Lines Matching refs:changes
180 of changes, the algorithm is linear in the file size. */
576 /* Adjust inserts/deletes of identical lines to join changes
604 /* Scan forwards to find beginning of another run of changes.
619 /* Find the end of this run of changes. */
628 /* Record the length of this run of changes, so that
669 /* If possible, move the fully-merged run of changes
781 briefly_report (int changes, struct file_data const filevec[])
783 if (changes)
789 changes = 2;
792 return changes;
803 int changes;
818 changes = 1;
822 changes = 0;
852 changes = 1;
859 changes = 0;
865 changes = briefly_report (changes, cmp->file);
926 If some changes are ignored, we must scan the script to decide. */
930 changes = 0;
932 while (next && changes == 0)
937 /* Find a set of changes that belong together. */
941 /* Disconnect them from the rest of the changes, making them
948 changes = 1;
955 changes = (script != 0);
958 changes = briefly_report (changes, cmp->file);
961 if (changes | !no_diff_means_no_output)
1034 changes = 2;
1042 return changes;