git-svn: correctly display fatal() error messages
[git/git.git] / diffcore-rename.c
CommitLineData
427dcb4b
JH
1/*
2 * Copyright (C) 2005 Junio C Hamano
3 */
4#include "cache.h"
5#include "diff.h"
6#include "diffcore.h"
427dcb4b 7
25d5ea41
JH
8/* Table of rename/copy destinations */
9
10static struct diff_rename_dst {
11 struct diff_filespec *two;
12 struct diff_filepair *pair;
13} *rename_dst;
14static int rename_dst_nr, rename_dst_alloc;
427dcb4b 15
25d5ea41
JH
16static struct diff_rename_dst *locate_rename_dst(struct diff_filespec *two,
17 int insert_ok)
427dcb4b 18{
25d5ea41
JH
19 int first, last;
20
21 first = 0;
22 last = rename_dst_nr;
23 while (last > first) {
24 int next = (last + first) >> 1;
25 struct diff_rename_dst *dst = &(rename_dst[next]);
26 int cmp = strcmp(two->path, dst->two->path);
27 if (!cmp)
28 return dst;
29 if (cmp < 0) {
30 last = next;
31 continue;
32 }
33 first = next+1;
34 }
35 /* not found */
36 if (!insert_ok)
37 return NULL;
38 /* insert to make it at "first" */
39 if (rename_dst_alloc <= rename_dst_nr) {
40 rename_dst_alloc = alloc_nr(rename_dst_alloc);
41 rename_dst = xrealloc(rename_dst,
42 rename_dst_alloc * sizeof(*rename_dst));
43 }
44 rename_dst_nr++;
45 if (first < rename_dst_nr)
46 memmove(rename_dst + first + 1, rename_dst + first,
47 (rename_dst_nr - first - 1) * sizeof(*rename_dst));
5098bafb
JH
48 rename_dst[first].two = alloc_filespec(two->path);
49 fill_filespec(rename_dst[first].two, two->sha1, two->mode);
25d5ea41
JH
50 rename_dst[first].pair = NULL;
51 return &(rename_dst[first]);
427dcb4b
JH
52}
53
15d061b4 54/* Table of rename/copy src files */
25d5ea41
JH
55static struct diff_rename_src {
56 struct diff_filespec *one;
fc580719 57 unsigned short score; /* to remember the break score */
6bac10d8 58 unsigned src_path_left : 1;
25d5ea41
JH
59} *rename_src;
60static int rename_src_nr, rename_src_alloc;
427dcb4b 61
15d061b4 62static struct diff_rename_src *register_rename_src(struct diff_filespec *one,
fc580719
JH
63 int src_path_left,
64 unsigned short score)
25d5ea41
JH
65{
66 int first, last;
67
68 first = 0;
69 last = rename_src_nr;
70 while (last > first) {
71 int next = (last + first) >> 1;
72 struct diff_rename_src *src = &(rename_src[next]);
73 int cmp = strcmp(one->path, src->one->path);
74 if (!cmp)
75 return src;
76 if (cmp < 0) {
77 last = next;
78 continue;
79 }
80 first = next+1;
81 }
15d061b4 82
25d5ea41
JH
83 /* insert to make it at "first" */
84 if (rename_src_alloc <= rename_src_nr) {
85 rename_src_alloc = alloc_nr(rename_src_alloc);
86 rename_src = xrealloc(rename_src,
87 rename_src_alloc * sizeof(*rename_src));
427dcb4b 88 }
25d5ea41
JH
89 rename_src_nr++;
90 if (first < rename_src_nr)
91 memmove(rename_src + first + 1, rename_src + first,
92 (rename_src_nr - first - 1) * sizeof(*rename_src));
93 rename_src[first].one = one;
fc580719 94 rename_src[first].score = score;
6bac10d8 95 rename_src[first].src_path_left = src_path_left;
25d5ea41 96 return &(rename_src[first]);
427dcb4b
JH
97}
98
17e6019a
JH
99static int is_exact_match(struct diff_filespec *src,
100 struct diff_filespec *dst,
101 int contents_too)
427dcb4b
JH
102{
103 if (src->sha1_valid && dst->sha1_valid &&
a89fccd2 104 !hashcmp(src->sha1, dst->sha1))
427dcb4b 105 return 1;
17e6019a
JH
106 if (!contents_too)
107 return 0;
f0c6b2a2
JH
108 if (diff_populate_filespec(src, 1) || diff_populate_filespec(dst, 1))
109 return 0;
110 if (src->size != dst->size)
111 return 0;
112 if (diff_populate_filespec(src, 0) || diff_populate_filespec(dst, 0))
427dcb4b
JH
113 return 0;
114 if (src->size == dst->size &&
115 !memcmp(src->data, dst->data, src->size))
116 return 1;
117 return 0;
118}
119
120struct diff_score {
25d5ea41
JH
121 int src; /* index in rename_src */
122 int dst; /* index in rename_dst */
427dcb4b 123 int score;
427dcb4b
JH
124};
125
126static int estimate_similarity(struct diff_filespec *src,
127 struct diff_filespec *dst,
128 int minimum_score)
129{
130 /* src points at a file that existed in the original tree (or
131 * optionally a file in the destination tree) and dst points
132 * at a newly created file. They may be quite similar, in which
133 * case we want to say src is renamed to dst or src is copied into
134 * dst, and then some edit has been applied to dst.
135 *
136 * Compare them and return how similar they are, representing
f0c6b2a2
JH
137 * the score as an integer between 0 and MAX_SCORE.
138 *
139 * When there is an exact match, it is considered a better
140 * match than anything else; the destination does not even
141 * call into this function in that case.
427dcb4b 142 */
90bd932c 143 unsigned long max_size, delta_size, base_size, src_copied, literal_added;
75c660ac 144 unsigned long delta_limit;
427dcb4b
JH
145 int score;
146
60896c7b
JH
147 /* We deal only with regular files. Symlink renames are handled
148 * only when they are exact matches --- in other words, no edits
149 * after renaming.
150 */
151 if (!S_ISREG(src->mode) || !S_ISREG(dst->mode))
152 return 0;
153
90bd932c 154 max_size = ((src->size > dst->size) ? src->size : dst->size);
58b103f5 155 base_size = ((src->size < dst->size) ? src->size : dst->size);
90bd932c 156 delta_size = max_size - base_size;
427dcb4b 157
58b103f5
JH
158 /* We would not consider edits that change the file size so
159 * drastically. delta_size must be smaller than
cd1870ed 160 * (MAX_SCORE-minimum_score)/MAX_SCORE * min(src->size, dst->size).
f0c6b2a2 161 *
58b103f5
JH
162 * Note that base_size == 0 case is handled here already
163 * and the final score computation below would not have a
164 * divide-by-zero issue.
427dcb4b 165 */
cd1870ed 166 if (base_size * (MAX_SCORE-minimum_score) < delta_size * MAX_SCORE)
427dcb4b
JH
167 return 0;
168
f0c6b2a2
JH
169 if (diff_populate_filespec(src, 0) || diff_populate_filespec(dst, 0))
170 return 0; /* error but caught downstream */
171
85976974 172
65416758
JH
173 delta_limit = base_size * (MAX_SCORE-minimum_score) / MAX_SCORE;
174 if (diffcore_count_changes(src->data, src->size,
175 dst->data, dst->size,
c06c7966 176 &src->cnt_data, &dst->cnt_data,
65416758
JH
177 delta_limit,
178 &src_copied, &literal_added))
85976974 179 return 0;
355e76a4 180
1706306a
JH
181 /* How similar are they?
182 * what percentage of material in dst are from source?
427dcb4b 183 */
90bd932c 184 if (!dst->size)
1706306a
JH
185 score = 0; /* should not happen */
186 else
90bd932c 187 score = src_copied * MAX_SCORE / max_size;
427dcb4b
JH
188 return score;
189}
190
5098bafb 191static void record_rename_pair(int dst_index, int src_index, int score)
427dcb4b 192{
25d5ea41
JH
193 struct diff_filespec *one, *two, *src, *dst;
194 struct diff_filepair *dp;
f7c1512a 195
25d5ea41
JH
196 if (rename_dst[dst_index].pair)
197 die("internal error: dst already matched.");
427dcb4b 198
25d5ea41
JH
199 src = rename_src[src_index].one;
200 one = alloc_filespec(src->path);
201 fill_filespec(one, src->sha1, src->mode);
427dcb4b 202
25d5ea41
JH
203 dst = rename_dst[dst_index].two;
204 two = alloc_filespec(dst->path);
205 fill_filespec(two, dst->sha1, dst->mode);
427dcb4b 206
5098bafb 207 dp = diff_queue(NULL, one, two);
ef677686 208 dp->renamed_pair = 1;
fc580719
JH
209 if (!strcmp(src->path, dst->path))
210 dp->score = rename_src[src_index].score;
211 else
212 dp->score = score;
6bac10d8 213 dp->source_stays = rename_src[src_index].src_path_left;
25d5ea41 214 rename_dst[dst_index].pair = dp;
427dcb4b
JH
215}
216
217/*
218 * We sort the rename similarity matrix with the score, in descending
15d061b4 219 * order (the most similar first).
427dcb4b
JH
220 */
221static int score_compare(const void *a_, const void *b_)
222{
223 const struct diff_score *a = a_, *b = b_;
224 return b->score - a->score;
225}
226
6bac10d8
JH
227static int compute_stays(struct diff_queue_struct *q,
228 struct diff_filespec *one)
229{
230 int i;
231 for (i = 0; i < q->nr; i++) {
232 struct diff_filepair *p = q->queue[i];
233 if (strcmp(one->path, p->two->path))
234 continue;
235 if (DIFF_PAIR_RENAME(p)) {
236 return 0; /* something else is renamed into this */
237 }
238 }
239 return 1;
240}
241
8082d8d3 242void diffcore_rename(struct diff_options *options)
427dcb4b 243{
8082d8d3
JH
244 int detect_rename = options->detect_rename;
245 int minimum_score = options->rename_score;
246 int rename_limit = options->rename_limit;
38c6f780 247 struct diff_queue_struct *q = &diff_queued_diff;
5098bafb 248 struct diff_queue_struct outq;
427dcb4b 249 struct diff_score *mx;
17e6019a 250 int i, j, rename_count, contents_too;
25d5ea41 251 int num_create, num_src, dst_cnt;
427dcb4b 252
26dee0ad 253 if (!minimum_score)
f345b0a0 254 minimum_score = DEFAULT_RENAME_SCORE;
5098bafb 255 rename_count = 0;
427dcb4b 256
427dcb4b 257 for (i = 0; i < q->nr; i++) {
52e95789 258 struct diff_filepair *p = q->queue[i];
2f3f8b21 259 if (!DIFF_FILE_VALID(p->one)) {
81e50eab 260 if (!DIFF_FILE_VALID(p->two))
60896c7b 261 continue; /* unmerged */
2f3f8b21
JH
262 else if (options->single_follow &&
263 strcmp(options->single_follow, p->two->path))
264 continue; /* not interested */
427dcb4b 265 else
25d5ea41 266 locate_rename_dst(p->two, 1);
2f3f8b21 267 }
2210100a
JH
268 else if (!DIFF_FILE_VALID(p->two)) {
269 /* If the source is a broken "delete", and
270 * they did not really want to get broken,
271 * that means the source actually stays.
272 */
273 int stays = (p->broken_pair && !p->score);
fc580719 274 register_rename_src(p->one, stays, p->score);
2210100a 275 }
15d061b4 276 else if (detect_rename == DIFF_DETECT_COPY)
fc580719 277 register_rename_src(p->one, 1, p->score);
427dcb4b 278 }
7d6fb370 279 if (rename_dst_nr == 0 || rename_src_nr == 0 ||
3299c6f6 280 (0 < rename_limit && rename_limit < rename_dst_nr))
427dcb4b
JH
281 goto cleanup; /* nothing to do */
282
283 /* We really want to cull the candidates list early
284 * with cheap tests in order to avoid doing deltas.
17e6019a
JH
285 * The first round matches up the up-to-date entries,
286 * and then during the second round we try to match
287 * cache-dirty entries as well.
427dcb4b 288 */
17e6019a
JH
289 for (contents_too = 0; contents_too < 2; contents_too++) {
290 for (i = 0; i < rename_dst_nr; i++) {
291 struct diff_filespec *two = rename_dst[i].two;
292 if (rename_dst[i].pair)
293 continue; /* dealt with an earlier round */
294 for (j = 0; j < rename_src_nr; j++) {
295 struct diff_filespec *one = rename_src[j].one;
296 if (!is_exact_match(one, two, contents_too))
297 continue;
298 record_rename_pair(i, j, MAX_SCORE);
299 rename_count++;
300 break; /* we are done with this entry */
301 }
427dcb4b
JH
302 }
303 }
427dcb4b
JH
304
305 /* Have we run out the created file pool? If so we can avoid
306 * doing the delta matrix altogether.
307 */
5098bafb 308 if (rename_count == rename_dst_nr)
15d061b4 309 goto cleanup;
427dcb4b 310
9f70b806
JH
311 if (minimum_score == MAX_SCORE)
312 goto cleanup;
313
5098bafb 314 num_create = (rename_dst_nr - rename_count);
25d5ea41 315 num_src = rename_src_nr;
427dcb4b 316 mx = xmalloc(sizeof(*mx) * num_create * num_src);
25d5ea41 317 for (dst_cnt = i = 0; i < rename_dst_nr; i++) {
427dcb4b 318 int base = dst_cnt * num_src;
25d5ea41
JH
319 struct diff_filespec *two = rename_dst[i].two;
320 if (rename_dst[i].pair)
427dcb4b 321 continue; /* dealt with exact match already. */
25d5ea41
JH
322 for (j = 0; j < rename_src_nr; j++) {
323 struct diff_filespec *one = rename_src[j].one;
324 struct diff_score *m = &mx[base+j];
325 m->src = j;
326 m->dst = i;
327 m->score = estimate_similarity(one, two,
328 minimum_score);
427dcb4b 329 }
2821104d
JH
330 /* We do not need the text anymore */
331 diff_free_filespec_data(two);
427dcb4b
JH
332 dst_cnt++;
333 }
334 /* cost matrix sorted by most to least similar pair */
335 qsort(mx, num_create * num_src, sizeof(*mx), score_compare);
336 for (i = 0; i < num_create * num_src; i++) {
25d5ea41
JH
337 struct diff_rename_dst *dst = &rename_dst[mx[i].dst];
338 if (dst->pair)
339 continue; /* already done, either exact or fuzzy. */
427dcb4b 340 if (mx[i].score < minimum_score)
15d061b4 341 break; /* there is no more usable pair. */
5098bafb
JH
342 record_rename_pair(mx[i].dst, mx[i].src, mx[i].score);
343 rename_count++;
427dcb4b
JH
344 }
345 free(mx);
427dcb4b 346
15d061b4 347 cleanup:
427dcb4b 348 /* At this point, we have found some renames and copies and they
5098bafb 349 * are recorded in rename_dst. The original list is still in *q.
427dcb4b 350 */
25d5ea41
JH
351 outq.queue = NULL;
352 outq.nr = outq.alloc = 0;
427dcb4b 353 for (i = 0; i < q->nr; i++) {
25d5ea41 354 struct diff_filepair *p = q->queue[i];
25d5ea41
JH
355 struct diff_filepair *pair_to_free = NULL;
356
2cd68882
JH
357 if (!DIFF_FILE_VALID(p->one) && DIFF_FILE_VALID(p->two)) {
358 /*
359 * Creation
360 *
361 * We would output this create record if it has
362 * not been turned into a rename/copy already.
363 */
364 struct diff_rename_dst *dst =
365 locate_rename_dst(p->two, 0);
366 if (dst && dst->pair) {
25d5ea41
JH
367 diff_q(&outq, dst->pair);
368 pair_to_free = p;
369 }
370 else
2cd68882
JH
371 /* no matching rename/copy source, so
372 * record this as a creation.
25d5ea41
JH
373 */
374 diff_q(&outq, p);
427dcb4b 375 }
2cd68882
JH
376 else if (DIFF_FILE_VALID(p->one) && !DIFF_FILE_VALID(p->two)) {
377 /*
378 * Deletion
379 *
f345b0a0
JH
380 * We would output this delete record if:
381 *
382 * (1) this is a broken delete and the counterpart
383 * broken create remains in the output; or
5098bafb
JH
384 * (2) this is not a broken delete, and rename_dst
385 * does not have a rename/copy to move p->one->path
386 * out of existence.
f345b0a0
JH
387 *
388 * Otherwise, the counterpart broken create
389 * has been turned into a rename-edit; or
390 * delete did not have a matching create to
391 * begin with.
2cd68882 392 */
f345b0a0
JH
393 if (DIFF_PAIR_BROKEN(p)) {
394 /* broken delete */
395 struct diff_rename_dst *dst =
396 locate_rename_dst(p->one, 0);
397 if (dst && dst->pair)
398 /* counterpart is now rename/copy */
399 pair_to_free = p;
400 }
401 else {
5098bafb
JH
402 for (j = 0; j < rename_dst_nr; j++) {
403 if (!rename_dst[j].pair)
404 continue;
405 if (strcmp(rename_dst[j].pair->
406 one->path,
407 p->one->path))
408 continue;
409 break;
410 }
411 if (j < rename_dst_nr)
f345b0a0
JH
412 /* this path remains */
413 pair_to_free = p;
414 }
2cd68882
JH
415
416 if (pair_to_free)
417 ;
418 else
419 diff_q(&outq, p);
420 }
25d5ea41 421 else if (!diff_unmodified_pair(p))
15d061b4 422 /* all the usual ones need to be kept */
25d5ea41 423 diff_q(&outq, p);
15d061b4
JH
424 else
425 /* no need to keep unmodified pairs */
426 pair_to_free = p;
427
226406f6
JH
428 if (pair_to_free)
429 diff_free_filepair(pair_to_free);
427dcb4b 430 }
25d5ea41 431 diff_debug_queue("done copying original", &outq);
427dcb4b 432
25d5ea41
JH
433 free(q->queue);
434 *q = outq;
435 diff_debug_queue("done collapsing", q);
427dcb4b 436
6bac10d8
JH
437 /* We need to see which rename source really stays here;
438 * earlier we only checked if the path is left in the result,
439 * but even if a path remains in the result, if that is coming
440 * from copying something else on top of it, then the original
441 * source is lost and does not stay.
442 */
443 for (i = 0; i < q->nr; i++) {
444 struct diff_filepair *p = q->queue[i];
445 if (DIFF_PAIR_RENAME(p) && p->source_stays) {
446 /* If one appears as the target of a rename-copy,
447 * then mark p->source_stays = 0; otherwise
448 * leave it as is.
449 */
450 p->source_stays = compute_stays(q, p->one);
451 }
452 }
453
5098bafb
JH
454 for (i = 0; i < rename_dst_nr; i++) {
455 diff_free_filespec_data(rename_dst[i].two);
456 free(rename_dst[i].two);
457 }
458
25d5ea41
JH
459 free(rename_dst);
460 rename_dst = NULL;
461 rename_dst_nr = rename_dst_alloc = 0;
462 free(rename_src);
463 rename_src = NULL;
464 rename_src_nr = rename_src_alloc = 0;
427dcb4b
JH
465 return;
466}