undef/git-commit-vandalism
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

combine-diff: extend --cc logic to Octopus.

Browse Source 
Santi Bejar points out that a hunk that changes from all the
same common parents except one is uninteresting.  The earlier
round marked changes from only one parent uninteresting, but
this also marks hunks that have the same change from all but one
parent uninteresting, which is a natural extension of the
original idea to Octopus merges.

Signed-off-by: Junio C Hamano <junkio@cox.net>
This commit is contained in:
Junio C Hamano 2006-01-25 13:11:38 -08:00
parent e228340961
commit 263eee29e9
1 changed files with 64 additions and 27 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

91
combine-diff.c
View File

@ -271,21 +271,56 @@ static int interesting(struct sline *sline, unsigned long all_mask)
return ((sline->flag & all_mask) != all_mask || sline->lost_head); return ((sline->flag & all_mask) != all_mask || sline->lost_head);
} }
static unsigned long line_diff_parents(struct sline *sline, unsigned long all_mask) static unsigned long line_common_diff(struct sline *sline, unsigned long all_mask)
{ {
/* /*
* Look at the line and see from which parents we have difference. * Look at the line and see from which parents we have the
* Lower bits of sline->flag records if the parent had this line, * same difference.
* so XOR with all_mask gives us on-bits for parents we have
* differences with.
*/ */
unsigned long parents = (sline->flag ^ all_mask);
/* Lower bits of sline->flag records if the parent had this
* line, so XOR with all_mask gives us on-bits for parents we
* have differences with.
*/
unsigned long common_adds = (sline->flag ^ all_mask) & all_mask;
unsigned long common_removes = all_mask;
/* If all the parents have this line, that also counts as
* having the same difference.
*/
if (!common_adds)
common_adds = all_mask;
if (sline->lost_head) { if (sline->lost_head) {
/* Lost head list records the lines removed from
* the parents, and parent_map records from which
* parent the line was removed.
*/
struct lline *ll; struct lline *ll;
for (ll = sline->lost_head; ll; ll = ll->next) for (ll = sline->lost_head; ll; ll = ll->next) {
parents |= ll->parent_map; common_removes &= ll->parent_map;
}
} }
return parents & all_mask; return common_adds & common_removes;
}
static unsigned long line_all_diff(struct sline *sline, unsigned long all_mask)
{
/*
* Look at the line and see from which parents we have some difference.
*/
unsigned long different = (sline->flag ^ all_mask) & all_mask;
if (sline->lost_head) {
/* Lost head list records the lines removed from
* the parents, and parent_map records from which
* parent the line was removed.
*/
struct lline *ll;
for (ll = sline->lost_head; ll; ll = ll->next) {
different |= ll->parent_map;
}
}
return different;
} }
static void make_hunks(struct sline *sline, unsigned long cnt, static void make_hunks(struct sline *sline, unsigned long cnt,
@ -316,13 +351,14 @@ static void make_hunks(struct sline *sline, unsigned long cnt,
if (!dense) if (!dense)
return; return;
/* Look at each hunk, and if it contains changes from only /* Look at each hunk, and if we have changes from only one
* one parent, mark that uninteresting. * parent, or the changes are the same from all but one
* parent, mark that uninteresting.
*/ */
i = 0; i = 0;
while (i < cnt) { while (i < cnt) {
int j, hunk_end, diffs; int j, hunk_end, same, diff;
unsigned long parents; unsigned long same_diff, all_diff, this_diff;
while (i < cnt && !(sline[i].flag & mark)) while (i < cnt && !(sline[i].flag & mark))
i++; i++;
if (cnt <= i) if (cnt <= i)
@ -330,22 +366,23 @@ static void make_hunks(struct sline *sline, unsigned long cnt,
for (hunk_end = i + 1; hunk_end < cnt; hunk_end++) for (hunk_end = i + 1; hunk_end < cnt; hunk_end++)
if (!(sline[hunk_end].flag & mark)) if (!(sline[hunk_end].flag & mark))
break; break;
/* [i..hunk_end) are interesting. Now is it from /* [i..hunk_end) are interesting. Now does it have
* only one parent? * the same change with all but one parent?
* If lost lines are only from one parent and
* remaining lines existed in parents other than
* that parent, then the hunk is not that interesting.
*/ */
parents = 0; same_diff = all_mask;
diffs = 0; all_diff = 0;
for (j = i; j < hunk_end; j++) for (j = i; j < hunk_end; j++) {
parents |= line_diff_parents(sline + j, all_mask); same_diff &= line_common_diff(sline + j, all_mask);
/* Now, how many bits from [0..num_parent) are on? */ all_diff |= line_all_diff(sline + j, all_mask);
for (j = 0; j < num_parent; j++) {
if (parents & (1UL<<j))
diffs++;
} }
if (diffs < 2) { diff = same = 0;
for (j = 0; j < num_parent; j++) {
if (same_diff & (1UL<<j))
same++;
if (all_diff & (1UL<<j))
diff++;
}
if ((num_parent - 1 <= same) || (diff == 1)) {
/* This hunk is not that interesting after all */ /* This hunk is not that interesting after all */
for (j = i; j < hunk_end; j++) for (j = i; j < hunk_end; j++)
sline[j].flag &= ~mark; sline[j].flag &= ~mark;