@ -55,22 +55,23 @@ static struct diff_rename_dst *locate_rename_dst(struct diff_filespec *two,
/* Table of rename/copy src files */
/* Table of rename/copy src files */
static struct diff_rename_src {
static struct diff_rename_src {
struct diff_filespec *one;
struct diff_filepair *p;
unsigned short score; /* to remember the break score */
unsigned short score; /* to remember the break score */
} *rename_src;
} *rename_src;
static int rename_src_nr, rename_src_alloc;
static int rename_src_nr, rename_src_alloc;
static struct diff_rename_src *register_rename_src(struct diff_filespec *one,
static struct diff_rename_src *register_rename_src(struct diff_filepair *p)
unsigned short score)
{
{
int first, last;
int first, last;
struct diff_filespec *one = p->one;
unsigned short score = p->score;
first = 0;
first = 0;
last = rename_src_nr;
last = rename_src_nr;
while (last > first) {
while (last > first) {
int next = (last + first) >> 1;
int next = (last + first) >> 1;
struct diff_rename_src *src = &(rename_src[next]);
struct diff_rename_src *src = &(rename_src[next]);
int cmp = strcmp(one->path, src->one->path);
int cmp = strcmp(one->path, src->p->one->path);
if (!cmp)
if (!cmp)
return src;
return src;
if (cmp < 0) {
if (cmp < 0) {
@ -90,7 +91,7 @@ static struct diff_rename_src *register_rename_src(struct diff_filespec *one,
if (first < rename_src_nr)
if (first < rename_src_nr)
memmove(rename_src + first + 1, rename_src + first,
memmove(rename_src + first + 1, rename_src + first,
(rename_src_nr - first - 1) * sizeof(*rename_src));
(rename_src_nr - first - 1) * sizeof(*rename_src));
rename_src[first].one = one;
rename_src[first].p = p;
rename_src[first].score = score;
rename_src[first].score = score;
return &(rename_src[first]);
return &(rename_src[first]);
}
}
@ -205,7 +206,7 @@ static void record_rename_pair(int dst_index, int src_index, int score)
if (rename_dst[dst_index].pair)
if (rename_dst[dst_index].pair)
die("internal error: dst already matched.");
die("internal error: dst already matched.");
src = rename_src[src_index].one;
src = rename_src[src_index].p->one;
src->rename_used++;
src->rename_used++;
src->count++;
src->count++;
@ -389,7 +390,7 @@ static int find_exact_renames(struct diff_options *options)
init_hash(&file_table);
init_hash(&file_table);
for (i = 0; i < rename_src_nr; i++)
for (i = 0; i < rename_src_nr; i++)
insert_file_table(&file_table, -1, i, rename_src[i].one);
insert_file_table(&file_table, -1, i, rename_src[i].p->one);
for (i = 0; i < rename_dst_nr; i++)
for (i = 0; i < rename_dst_nr; i++)
insert_file_table(&file_table, 1, i, rename_dst[i].two);
insert_file_table(&file_table, 1, i, rename_dst[i].two);
@ -419,6 +420,55 @@ static void record_if_better(struct diff_score m[], struct diff_score *o)
m[worst] = *o;
m[worst] = *o;
}
}
/*
* Returns:
* 0 if we are under the limit;
* 1 if we need to disable inexact rename detection;
* 2 if we would be under the limit if we were given -C instead of -C -C.
*/
static int too_many_rename_candidates(int num_create,
struct diff_options *options)
{
int rename_limit = options->rename_limit;
int num_src = rename_src_nr;
int i;
options->needed_rename_limit = 0;
/*
* This basically does a test for the rename matrix not
* growing larger than a "rename_limit" square matrix, ie:
*
* num_create * num_src > rename_limit * rename_limit
*
* but handles the potential overflow case specially (and we
* assume at least 32-bit integers)
*/
if (rename_limit <= 0 || rename_limit > 32767)
rename_limit = 32767;
if ((num_create <= rename_limit || num_src <= rename_limit) &&
(num_create * num_src <= rename_limit * rename_limit))
return 0;
options->needed_rename_limit =
num_src > num_create ? num_src : num_create;
/* Are we running under -C -C? */
if (!DIFF_OPT_TST(options, FIND_COPIES_HARDER))
return 1;
/* Would we bust the limit if we were running under -C? */
for (num_src = i = 0; i < rename_src_nr; i++) {
if (diff_unmodified_pair(rename_src[i].p))
continue;
num_src++;
}
if ((num_create <= rename_limit || num_src <= rename_limit) &&
(num_create * num_src <= rename_limit * rename_limit))
return 2;
return 1;
}
static int find_renames(struct diff_score *mx, int dst_cnt, int minimum_score, int copies)
static int find_renames(struct diff_score *mx, int dst_cnt, int minimum_score, int copies)
{
{
int count = 0, i;
int count = 0, i;
@ -432,7 +482,7 @@ static int find_renames(struct diff_score *mx, int dst_cnt, int minimum_score, i
dst = &rename_dst[mx[i].dst];
dst = &rename_dst[mx[i].dst];
if (dst->pair)
if (dst->pair)
continue; /* already done, either exact or fuzzy. */
continue; /* already done, either exact or fuzzy. */
if (!copies && rename_src[mx[i].src].one->rename_used)
if (!copies && rename_src[mx[i].src].p->one->rename_used)
continue;
continue;
record_rename_pair(mx[i].dst, mx[i].src, mx[i].score);
record_rename_pair(mx[i].dst, mx[i].src, mx[i].score);
count++;
count++;
@ -444,11 +494,10 @@ void diffcore_rename(struct diff_options *options)
{
{
int detect_rename = options->detect_rename;
int detect_rename = options->detect_rename;
int minimum_score = options->rename_score;
int minimum_score = options->rename_score;
int rename_limit = options->rename_limit;
struct diff_queue_struct *q = &diff_queued_diff;
struct diff_queue_struct *q = &diff_queued_diff;
struct diff_queue_struct outq;
struct diff_queue_struct outq;
struct diff_score *mx;
struct diff_score *mx;
int i, j, rename_count;
int i, j, rename_count, skip_unmodified = 0;
int num_create, num_src, dst_cnt;
int num_create, num_src, dst_cnt;
struct progress *progress = NULL;
struct progress *progress = NULL;
@ -476,7 +525,7 @@ void diffcore_rename(struct diff_options *options)
*/
*/
if (p->broken_pair && !p->score)
if (p->broken_pair && !p->score)
p->one->rename_used++;
p->one->rename_used++;
register_rename_src(p->one, p->score);
register_rename_src(p);
}
}
else if (detect_rename == DIFF_DETECT_COPY) {
else if (detect_rename == DIFF_DETECT_COPY) {
/*
/*
@ -484,7 +533,7 @@ void diffcore_rename(struct diff_options *options)
* one, to indicate ourselves as a user.
* one, to indicate ourselves as a user.
*/
*/
p->one->rename_used++;
p->one->rename_used++;
register_rename_src(p->one, p->score);
register_rename_src(p);
}
}
}
}
if (rename_dst_nr == 0 || rename_src_nr == 0)
if (rename_dst_nr == 0 || rename_src_nr == 0)
@ -511,23 +560,15 @@ void diffcore_rename(struct diff_options *options)
if (!num_create)
if (!num_create)
goto cleanup;
goto cleanup;
/*
switch (too_many_rename_candidates(num_create, options)) {
* This basically does a test for the rename matrix not
case 1:
* growing larger than a "rename_limit" square matrix, ie:
*
* num_create * num_src > rename_limit * rename_limit
*
* but handles the potential overflow case specially (and we
* assume at least 32-bit integers)
*/
options->needed_rename_limit = 0;
if (rename_limit <= 0 || rename_limit > 32767)
rename_limit = 32767;
if ((num_create > rename_limit && num_src > rename_limit) ||
(num_create * num_src > rename_limit * rename_limit)) {
options->needed_rename_limit =
num_src > num_create ? num_src : num_create;
goto cleanup;
goto cleanup;
case 2:
options->degraded_cc_to_c = 1;
skip_unmodified = 1;
break;
default:
break;
}
}
if (options->show_rename_progress) {
if (options->show_rename_progress) {
@ -549,8 +590,13 @@ void diffcore_rename(struct diff_options *options)
m[j].dst = -1;
m[j].dst = -1;
for (j = 0; j < rename_src_nr; j++) {
for (j = 0; j < rename_src_nr; j++) {
struct diff_filespec *one = rename_src[j].one;
struct diff_filespec *one = rename_src[j].p->one;
struct diff_score this_src;
struct diff_score this_src;
if (skip_unmodified &&
diff_unmodified_pair(rename_src[j].p))
continue;
this_src.score = estimate_similarity(one, two,
this_src.score = estimate_similarity(one, two,
minimum_score);
minimum_score);
this_src.name_score = basename_same(one, two);
this_src.name_score = basename_same(one, two);