Git 2.13.6
[git/git.git] / merge-recursive.c
CommitLineData
9047ebbc
MV
1/*
2 * Recursive Merge algorithm stolen from git-merge-recursive.py by
3 * Fredrik Kuivinen.
4 * The thieves were Alex Riesen and Johannes Schindelin, in June/July 2006
5 */
6#include "cache.h"
1c4b6604 7#include "advice.h"
697cc8ef 8#include "lockfile.h"
9047ebbc
MV
9#include "cache-tree.h"
10#include "commit.h"
11#include "blob.h"
12#include "builtin.h"
13#include "tree-walk.h"
14#include "diff.h"
15#include "diffcore.h"
16#include "tag.h"
17#include "unpack-trees.h"
18#include "string-list.h"
19#include "xdiff-interface.h"
20#include "ll-merge.h"
9047ebbc
MV
21#include "attr.h"
22#include "merge-recursive.h"
9800c0df 23#include "dir.h"
68d03e4a 24#include "submodule.h"
9047ebbc 25
bc9204d4
JS
26static void flush_output(struct merge_options *o)
27{
f1e2426b 28 if (o->buffer_output < 2 && o->obuf.len) {
bc9204d4
JS
29 fputs(o->obuf.buf, stdout);
30 strbuf_reset(&o->obuf);
31 }
32}
33
34static int err(struct merge_options *o, const char *err, ...)
35{
36 va_list params;
37
f1e2426b
JS
38 if (o->buffer_output < 2)
39 flush_output(o);
40 else {
41 strbuf_complete(&o->obuf, '\n');
42 strbuf_addstr(&o->obuf, "error: ");
43 }
bc9204d4
JS
44 va_start(params, err);
45 strbuf_vaddf(&o->obuf, err, params);
46 va_end(params);
f1e2426b
JS
47 if (o->buffer_output > 1)
48 strbuf_addch(&o->obuf, '\n');
49 else {
50 error("%s", o->obuf.buf);
51 strbuf_reset(&o->obuf);
52 }
bc9204d4
JS
53
54 return -1;
55}
56
85e51b78
JH
57static struct tree *shift_tree_object(struct tree *one, struct tree *two,
58 const char *subtree_shift)
9047ebbc 59{
f2fd0760 60 struct object_id shifted;
9047ebbc 61
85e51b78 62 if (!*subtree_shift) {
82db3d44 63 shift_tree(&one->object.oid, &two->object.oid, &shifted, 0);
85e51b78 64 } else {
82db3d44 65 shift_tree_by(&one->object.oid, &two->object.oid, &shifted,
85e51b78
JH
66 subtree_shift);
67 }
f2fd0760 68 if (!oidcmp(&two->object.oid, &shifted))
9047ebbc 69 return two;
f2fd0760 70 return lookup_tree(shifted.hash);
9047ebbc
MV
71}
72
2af202be 73static struct commit *make_virtual_commit(struct tree *tree, const char *comment)
9047ebbc 74{
10322a0a 75 struct commit *commit = alloc_commit_node();
ae8e4c9c 76
a2571653 77 set_merge_remote_desc(commit, comment, (struct object *)commit);
9047ebbc 78 commit->tree = tree;
9047ebbc
MV
79 commit->object.parsed = 1;
80 return commit;
81}
82
83/*
84 * Since we use get_tree_entry(), which does not put the read object into
85 * the object pool, we cannot rely on a == b.
86 */
b4da9d62 87static int oid_eq(const struct object_id *a, const struct object_id *b)
9047ebbc
MV
88{
89 if (!a && !b)
90 return 2;
b4da9d62 91 return a && b && oidcmp(a, b) == 0;
9047ebbc
MV
92}
93
25c39363
EN
94enum rename_type {
95 RENAME_NORMAL = 0,
96 RENAME_DELETE,
4f66dade 97 RENAME_ONE_FILE_TO_ONE,
461f5041
EN
98 RENAME_ONE_FILE_TO_TWO,
99 RENAME_TWO_FILES_TO_ONE
25c39363
EN
100};
101
4f66dade 102struct rename_conflict_info {
25c39363
EN
103 enum rename_type rename_type;
104 struct diff_filepair *pair1;
105 struct diff_filepair *pair2;
106 const char *branch1;
107 const char *branch2;
108 struct stage_data *dst_entry1;
109 struct stage_data *dst_entry2;
232c635f
EN
110 struct diff_filespec ren1_other;
111 struct diff_filespec ren2_other;
25c39363
EN
112};
113
9047ebbc
MV
114/*
115 * Since we want to write the index eventually, we cannot reuse the index
116 * for these (temporary) data.
117 */
9cba13ca
JN
118struct stage_data {
119 struct {
9047ebbc 120 unsigned mode;
fd429e98 121 struct object_id oid;
9047ebbc 122 } stages[4];
4f66dade 123 struct rename_conflict_info *rename_conflict_info;
9047ebbc
MV
124 unsigned processed:1;
125};
126
4f66dade
EN
127static inline void setup_rename_conflict_info(enum rename_type rename_type,
128 struct diff_filepair *pair1,
129 struct diff_filepair *pair2,
130 const char *branch1,
131 const char *branch2,
132 struct stage_data *dst_entry1,
232c635f
EN
133 struct stage_data *dst_entry2,
134 struct merge_options *o,
135 struct stage_data *src_entry1,
136 struct stage_data *src_entry2)
25c39363 137{
4f66dade 138 struct rename_conflict_info *ci = xcalloc(1, sizeof(struct rename_conflict_info));
25c39363
EN
139 ci->rename_type = rename_type;
140 ci->pair1 = pair1;
141 ci->branch1 = branch1;
142 ci->branch2 = branch2;
143
144 ci->dst_entry1 = dst_entry1;
4f66dade 145 dst_entry1->rename_conflict_info = ci;
25c39363
EN
146 dst_entry1->processed = 0;
147
148 assert(!pair2 == !dst_entry2);
149 if (dst_entry2) {
150 ci->dst_entry2 = dst_entry2;
151 ci->pair2 = pair2;
4f66dade 152 dst_entry2->rename_conflict_info = ci;
25c39363 153 }
232c635f
EN
154
155 if (rename_type == RENAME_TWO_FILES_TO_ONE) {
156 /*
157 * For each rename, there could have been
158 * modifications on the side of history where that
159 * file was not renamed.
160 */
161 int ostage1 = o->branch1 == branch1 ? 3 : 2;
162 int ostage2 = ostage1 ^ 1;
163
164 ci->ren1_other.path = pair1->one->path;
fd429e98 165 oidcpy(&ci->ren1_other.oid, &src_entry1->stages[ostage1].oid);
232c635f
EN
166 ci->ren1_other.mode = src_entry1->stages[ostage1].mode;
167
168 ci->ren2_other.path = pair2->one->path;
fd429e98 169 oidcpy(&ci->ren2_other.oid, &src_entry2->stages[ostage2].oid);
232c635f 170 ci->ren2_other.mode = src_entry2->stages[ostage2].mode;
25c39363
EN
171 }
172}
173
8a2fce18 174static int show(struct merge_options *o, int v)
9047ebbc 175{
5033639c 176 return (!o->call_depth && o->verbosity >= v) || o->verbosity >= 5;
9047ebbc
MV
177}
178
28bea9e5 179__attribute__((format (printf, 3, 4)))
8a2fce18 180static void output(struct merge_options *o, int v, const char *fmt, ...)
9047ebbc 181{
9047ebbc
MV
182 va_list ap;
183
8a2fce18 184 if (!show(o, v))
9047ebbc
MV
185 return;
186
415792ed 187 strbuf_addchars(&o->obuf, ' ', o->call_depth * 2);
9047ebbc
MV
188
189 va_start(ap, fmt);
ebeb6090 190 strbuf_vaddf(&o->obuf, fmt, ap);
9047ebbc
MV
191 va_end(ap);
192
294b2680 193 strbuf_addch(&o->obuf, '\n');
8a2fce18 194 if (!o->buffer_output)
c7d84924 195 flush_output(o);
9047ebbc
MV
196}
197
5033639c 198static void output_commit_title(struct merge_options *o, struct commit *commit)
9047ebbc 199{
dde75cb0 200 strbuf_addchars(&o->obuf, ' ', o->call_depth * 2);
9047ebbc 201 if (commit->util)
dde75cb0
JS
202 strbuf_addf(&o->obuf, "virtual %s\n",
203 merge_remote_util(commit)->name);
9047ebbc 204 else {
a94bb683
RS
205 strbuf_add_unique_abbrev(&o->obuf, commit->object.oid.hash,
206 DEFAULT_ABBREV);
207 strbuf_addch(&o->obuf, ' ');
9047ebbc 208 if (parse_commit(commit) != 0)
a22ae753 209 strbuf_addstr(&o->obuf, _("(bad commit)\n"));
9047ebbc 210 else {
49b7120e 211 const char *title;
8597ea3a 212 const char *msg = get_commit_buffer(commit, NULL);
bc6b8fc1 213 int len = find_commit_subject(msg, &title);
49b7120e 214 if (len)
dde75cb0 215 strbuf_addf(&o->obuf, "%.*s\n", len, title);
bc6b8fc1 216 unuse_commit_buffer(commit, msg);
9047ebbc
MV
217 }
218 }
dde75cb0 219 flush_output(o);
9047ebbc
MV
220}
221
bc9204d4
JS
222static int add_cacheinfo(struct merge_options *o,
223 unsigned int mode, const struct object_id *oid,
9047ebbc
MV
224 const char *path, int stage, int refresh, int options)
225{
226 struct cache_entry *ce;
1335d76e
JH
227 int ret;
228
21bed620 229 ce = make_cache_entry(mode, oid ? oid->hash : null_sha1, path, stage, 0);
9047ebbc 230 if (!ce)
bc9204d4 231 return err(o, _("addinfo_cache failed for path '%s'"), path);
1335d76e
JH
232
233 ret = add_cache_entry(ce, options);
234 if (refresh) {
235 struct cache_entry *nce;
236
237 nce = refresh_cache_entry(ce, CE_MATCH_REFRESH | CE_MATCH_IGNORE_MISSING);
55e9f0e5 238 if (!nce)
1749053d 239 return err(o, _("addinfo_cache failed for path '%s'"), path);
1335d76e
JH
240 if (nce != ce)
241 ret = add_cache_entry(nce, options);
242 }
243 return ret;
9047ebbc
MV
244}
245
9047ebbc
MV
246static void init_tree_desc_from_tree(struct tree_desc *desc, struct tree *tree)
247{
248 parse_tree(tree);
249 init_tree_desc(desc, tree->buffer, tree->size);
250}
251
252static int git_merge_trees(int index_only,
253 struct tree *common,
254 struct tree *head,
255 struct tree *merge)
256{
257 int rc;
258 struct tree_desc t[3];
259 struct unpack_trees_options opts;
260
261 memset(&opts, 0, sizeof(opts));
262 if (index_only)
263 opts.index_only = 1;
264 else
265 opts.update = 1;
266 opts.merge = 1;
267 opts.head_idx = 2;
268 opts.fn = threeway_merge;
269 opts.src_index = &the_index;
270 opts.dst_index = &the_index;
e294030f 271 setup_unpack_trees_porcelain(&opts, "merge");
9047ebbc
MV
272
273 init_tree_desc_from_tree(t+0, common);
274 init_tree_desc_from_tree(t+1, head);
275 init_tree_desc_from_tree(t+2, merge);
276
277 rc = unpack_trees(3, t, &opts);
278 cache_tree_free(&active_cache_tree);
279 return rc;
280}
281
8a2fce18 282struct tree *write_tree_from_memory(struct merge_options *o)
9047ebbc
MV
283{
284 struct tree *result = NULL;
285
286 if (unmerged_cache()) {
287 int i;
19c6a4f8 288 fprintf(stderr, "BUG: There are unmerged index entries:\n");
9047ebbc 289 for (i = 0; i < active_nr; i++) {
9c5e6c80 290 const struct cache_entry *ce = active_cache[i];
9047ebbc 291 if (ce_stage(ce))
c43ba42e 292 fprintf(stderr, "BUG: %d %.*s\n", ce_stage(ce),
19c6a4f8 293 (int)ce_namelen(ce), ce->name);
9047ebbc 294 }
ef1177d1 295 die("BUG: unmerged index entries in merge-recursive.c");
9047ebbc
MV
296 }
297
298 if (!active_cache_tree)
299 active_cache_tree = cache_tree();
300
301 if (!cache_tree_fully_valid(active_cache_tree) &&
6003303a 302 cache_tree_update(&the_index, 0) < 0) {
bc9204d4 303 err(o, _("error building trees"));
6003303a
JS
304 return NULL;
305 }
9047ebbc
MV
306
307 result = lookup_tree(active_cache_tree->sha1);
308
309 return result;
310}
311
312static int save_files_dirs(const unsigned char *sha1,
6a0b0b6d 313 struct strbuf *base, const char *path,
9047ebbc
MV
314 unsigned int mode, int stage, void *context)
315{
6a0b0b6d 316 int baselen = base->len;
696ee23c
MV
317 struct merge_options *o = context;
318
6a0b0b6d 319 strbuf_addstr(base, path);
9047ebbc
MV
320
321 if (S_ISDIR(mode))
6a0b0b6d 322 string_list_insert(&o->current_directory_set, base->buf);
9047ebbc 323 else
6a0b0b6d 324 string_list_insert(&o->current_file_set, base->buf);
9047ebbc 325
6a0b0b6d 326 strbuf_setlen(base, baselen);
d3bee161 327 return (S_ISDIR(mode) ? READ_TREE_RECURSIVE : 0);
9047ebbc
MV
328}
329
696ee23c 330static int get_files_dirs(struct merge_options *o, struct tree *tree)
9047ebbc
MV
331{
332 int n;
f0096c06 333 struct pathspec match_all;
9a087274 334 memset(&match_all, 0, sizeof(match_all));
f0096c06 335 if (read_tree_recursive(tree, "", 0, 0, &match_all, save_files_dirs, o))
9047ebbc 336 return 0;
696ee23c 337 n = o->current_file_set.nr + o->current_directory_set.nr;
9047ebbc
MV
338 return n;
339}
340
341/*
342 * Returns an index_entry instance which doesn't have to correspond to
343 * a real cache entry in Git's index.
344 */
345static struct stage_data *insert_stage_data(const char *path,
346 struct tree *o, struct tree *a, struct tree *b,
347 struct string_list *entries)
348{
349 struct string_list_item *item;
350 struct stage_data *e = xcalloc(1, sizeof(struct stage_data));
ed1c9977 351 get_tree_entry(o->object.oid.hash, path,
fd429e98 352 e->stages[1].oid.hash, &e->stages[1].mode);
ed1c9977 353 get_tree_entry(a->object.oid.hash, path,
fd429e98 354 e->stages[2].oid.hash, &e->stages[2].mode);
ed1c9977 355 get_tree_entry(b->object.oid.hash, path,
fd429e98 356 e->stages[3].oid.hash, &e->stages[3].mode);
78a395d3 357 item = string_list_insert(entries, path);
9047ebbc
MV
358 item->util = e;
359 return e;
360}
361
362/*
363 * Create a dictionary mapping file names to stage_data objects. The
364 * dictionary contains one entry for every path with a non-zero stage entry.
365 */
366static struct string_list *get_unmerged(void)
367{
368 struct string_list *unmerged = xcalloc(1, sizeof(struct string_list));
369 int i;
370
371 unmerged->strdup_strings = 1;
372
373 for (i = 0; i < active_nr; i++) {
374 struct string_list_item *item;
375 struct stage_data *e;
9c5e6c80 376 const struct cache_entry *ce = active_cache[i];
9047ebbc
MV
377 if (!ce_stage(ce))
378 continue;
379
e8c8b713 380 item = string_list_lookup(unmerged, ce->name);
9047ebbc 381 if (!item) {
78a395d3 382 item = string_list_insert(unmerged, ce->name);
9047ebbc
MV
383 item->util = xcalloc(1, sizeof(struct stage_data));
384 }
385 e = item->util;
386 e->stages[ce_stage(ce)].mode = ce->ce_mode;
99d1a986 387 oidcpy(&e->stages[ce_stage(ce)].oid, &ce->oid);
9047ebbc
MV
388 }
389
390 return unmerged;
391}
392
fa6ca111 393static int string_list_df_name_compare(const char *one, const char *two)
ef02b317 394{
fa6ca111
NTND
395 int onelen = strlen(one);
396 int twolen = strlen(two);
f0fd4d05
EN
397 /*
398 * Here we only care that entries for D/F conflicts are
399 * adjacent, in particular with the file of the D/F conflict
400 * appearing before files below the corresponding directory.
401 * The order of the rest of the list is irrelevant for us.
ef02b317 402 *
f0fd4d05
EN
403 * To achieve this, we sort with df_name_compare and provide
404 * the mode S_IFDIR so that D/F conflicts will sort correctly.
405 * We use the mode S_IFDIR for everything else for simplicity,
406 * since in other cases any changes in their order due to
407 * sorting cause no problems for us.
408 */
fa6ca111
NTND
409 int cmp = df_name_compare(one, onelen, S_IFDIR,
410 two, twolen, S_IFDIR);
f0fd4d05
EN
411 /*
412 * Now that 'foo' and 'foo/bar' compare equal, we have to make sure
413 * that 'foo' comes before 'foo/bar'.
ef02b317 414 */
f0fd4d05
EN
415 if (cmp)
416 return cmp;
417 return onelen - twolen;
418}
419
70cc3d36
EN
420static void record_df_conflict_files(struct merge_options *o,
421 struct string_list *entries)
ef02b317 422{
70cc3d36 423 /* If there is a D/F conflict and the file for such a conflict
f7d650c0 424 * currently exist in the working tree, we want to allow it to be
edd2faf5
EN
425 * removed to make room for the corresponding directory if needed.
426 * The files underneath the directories of such D/F conflicts will
427 * be processed before the corresponding file involved in the D/F
428 * conflict. If the D/F directory ends up being removed by the
429 * merge, then we won't have to touch the D/F file. If the D/F
430 * directory needs to be written to the working copy, then the D/F
431 * file will simply be removed (in make_room_for_path()) to make
432 * room for the necessary paths. Note that if both the directory
433 * and the file need to be present, then the D/F file will be
434 * reinstated with a new unique name at the time it is processed.
ef02b317 435 */
af4941d4 436 struct string_list df_sorted_entries = STRING_LIST_INIT_NODUP;
ef02b317 437 const char *last_file = NULL;
c8516500 438 int last_len = 0;
ef02b317
EN
439 int i;
440
0b30e812
EN
441 /*
442 * If we're merging merge-bases, we don't want to bother with
443 * any working directory changes.
444 */
445 if (o->call_depth)
446 return;
447
f0fd4d05 448 /* Ensure D/F conflicts are adjacent in the entries list. */
ef02b317 449 for (i = 0; i < entries->nr; i++) {
f701aae0
EN
450 struct string_list_item *next = &entries->items[i];
451 string_list_append(&df_sorted_entries, next->string)->util =
452 next->util;
453 }
fa6ca111
NTND
454 df_sorted_entries.cmp = string_list_df_name_compare;
455 string_list_sort(&df_sorted_entries);
f0fd4d05 456
70cc3d36 457 string_list_clear(&o->df_conflict_file_set, 1);
f701aae0
EN
458 for (i = 0; i < df_sorted_entries.nr; i++) {
459 const char *path = df_sorted_entries.items[i].string;
ef02b317 460 int len = strlen(path);
f701aae0 461 struct stage_data *e = df_sorted_entries.items[i].util;
ef02b317
EN
462
463 /*
464 * Check if last_file & path correspond to a D/F conflict;
465 * i.e. whether path is last_file+'/'+<something>.
70cc3d36
EN
466 * If so, record that it's okay to remove last_file to make
467 * room for path and friends if needed.
ef02b317
EN
468 */
469 if (last_file &&
470 len > last_len &&
471 memcmp(path, last_file, last_len) == 0 &&
472 path[last_len] == '/') {
70cc3d36 473 string_list_insert(&o->df_conflict_file_set, last_file);
ef02b317
EN
474 }
475
476 /*
477 * Determine whether path could exist as a file in the
478 * working directory as a possible D/F conflict. This
479 * will only occur when it exists in stage 2 as a
480 * file.
481 */
482 if (S_ISREG(e->stages[2].mode) || S_ISLNK(e->stages[2].mode)) {
483 last_file = path;
484 last_len = len;
ef02b317
EN
485 } else {
486 last_file = NULL;
487 }
488 }
f701aae0 489 string_list_clear(&df_sorted_entries, 0);
ef02b317
EN
490}
491
9cba13ca 492struct rename {
9047ebbc
MV
493 struct diff_filepair *pair;
494 struct stage_data *src_entry;
495 struct stage_data *dst_entry;
496 unsigned processed:1;
497};
498
499/*
500 * Get information of all renames which occurred between 'o_tree' and
501 * 'tree'. We need the three trees in the merge ('o_tree', 'a_tree' and
502 * 'b_tree') to be able to associate the correct cache entries with
503 * the rename information. 'tree' is always equal to either a_tree or b_tree.
504 */
8a2fce18
MV
505static struct string_list *get_renames(struct merge_options *o,
506 struct tree *tree,
507 struct tree *o_tree,
508 struct tree *a_tree,
509 struct tree *b_tree,
510 struct string_list *entries)
9047ebbc
MV
511{
512 int i;
513 struct string_list *renames;
514 struct diff_options opts;
515
516 renames = xcalloc(1, sizeof(struct string_list));
d2b11eca
FGA
517 if (!o->detect_rename)
518 return renames;
519
9047ebbc
MV
520 diff_setup(&opts);
521 DIFF_OPT_SET(&opts, RECURSIVE);
4f7cb99a 522 DIFF_OPT_CLR(&opts, RENAME_EMPTY);
9047ebbc 523 opts.detect_rename = DIFF_DETECT_RENAME;
8a2fce18
MV
524 opts.rename_limit = o->merge_rename_limit >= 0 ? o->merge_rename_limit :
525 o->diff_rename_limit >= 0 ? o->diff_rename_limit :
92c57e5c 526 1000;
10ae7526 527 opts.rename_score = o->rename_score;
99bfc669 528 opts.show_rename_progress = o->show_rename_progress;
9047ebbc 529 opts.output_format = DIFF_FORMAT_NO_OUTPUT;
28452655 530 diff_setup_done(&opts);
ed1c9977 531 diff_tree_sha1(o_tree->object.oid.hash, tree->object.oid.hash, "", &opts);
9047ebbc 532 diffcore_std(&opts);
bf0ab10f
JK
533 if (opts.needed_rename_limit > o->needed_rename_limit)
534 o->needed_rename_limit = opts.needed_rename_limit;
9047ebbc
MV
535 for (i = 0; i < diff_queued_diff.nr; ++i) {
536 struct string_list_item *item;
537 struct rename *re;
538 struct diff_filepair *pair = diff_queued_diff.queue[i];
539 if (pair->status != 'R') {
540 diff_free_filepair(pair);
541 continue;
542 }
543 re = xmalloc(sizeof(*re));
544 re->processed = 0;
545 re->pair = pair;
e8c8b713 546 item = string_list_lookup(entries, re->pair->one->path);
9047ebbc
MV
547 if (!item)
548 re->src_entry = insert_stage_data(re->pair->one->path,
549 o_tree, a_tree, b_tree, entries);
550 else
551 re->src_entry = item->util;
552
e8c8b713 553 item = string_list_lookup(entries, re->pair->two->path);
9047ebbc
MV
554 if (!item)
555 re->dst_entry = insert_stage_data(re->pair->two->path,
556 o_tree, a_tree, b_tree, entries);
557 else
558 re->dst_entry = item->util;
78a395d3 559 item = string_list_insert(renames, pair->one->path);
9047ebbc
MV
560 item->util = re;
561 }
562 opts.output_format = DIFF_FORMAT_NO_OUTPUT;
563 diff_queued_diff.nr = 0;
564 diff_flush(&opts);
565 return renames;
566}
567
bc9204d4
JS
568static int update_stages(struct merge_options *opt, const char *path,
569 const struct diff_filespec *o,
650467cf
EN
570 const struct diff_filespec *a,
571 const struct diff_filespec *b)
9047ebbc 572{
f53d3977
EN
573
574 /*
575 * NOTE: It is usually a bad idea to call update_stages on a path
576 * before calling update_file on that same path, since it can
577 * sometimes lead to spurious "refusing to lose untracked file..."
578 * messages from update_file (via make_room_for path via
579 * would_lose_untracked). Instead, reverse the order of the calls
580 * (executing update_file first and then update_stages).
581 */
650467cf
EN
582 int clear = 1;
583 int options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_SKIP_DFCHECK;
9047ebbc
MV
584 if (clear)
585 if (remove_file_from_cache(path))
586 return -1;
587 if (o)
bc9204d4 588 if (add_cacheinfo(opt, o->mode, &o->oid, path, 1, 0, options))
9047ebbc
MV
589 return -1;
590 if (a)
bc9204d4 591 if (add_cacheinfo(opt, a->mode, &a->oid, path, 2, 0, options))
9047ebbc
MV
592 return -1;
593 if (b)
bc9204d4 594 if (add_cacheinfo(opt, b->mode, &b->oid, path, 3, 0, options))
9047ebbc
MV
595 return -1;
596 return 0;
597}
598
b8ddf164
EN
599static void update_entry(struct stage_data *entry,
600 struct diff_filespec *o,
601 struct diff_filespec *a,
602 struct diff_filespec *b)
2ff739f9 603{
2ff739f9
EN
604 entry->processed = 0;
605 entry->stages[1].mode = o->mode;
606 entry->stages[2].mode = a->mode;
607 entry->stages[3].mode = b->mode;
fd429e98 608 oidcpy(&entry->stages[1].oid, &o->oid);
609 oidcpy(&entry->stages[2].oid, &a->oid);
610 oidcpy(&entry->stages[3].oid, &b->oid);
2ff739f9
EN
611}
612
b7fa51da
MV
613static int remove_file(struct merge_options *o, int clean,
614 const char *path, int no_wd)
9047ebbc 615{
b7fa51da
MV
616 int update_cache = o->call_depth || clean;
617 int update_working_directory = !o->call_depth && !no_wd;
9047ebbc
MV
618
619 if (update_cache) {
620 if (remove_file_from_cache(path))
621 return -1;
622 }
623 if (update_working_directory) {
ae352c7f
DT
624 if (ignore_case) {
625 struct cache_entry *ce;
626 ce = cache_file_exists(path, strlen(path), ignore_case);
627 if (ce && ce_stage(ce) == 0)
628 return 0;
629 }
25755e84 630 if (remove_path(path))
9047ebbc 631 return -1;
9047ebbc
MV
632 }
633 return 0;
634}
635
45bc131d
JK
636/* add a string to a strbuf, but converting "/" to "_" */
637static void add_flattened_path(struct strbuf *out, const char *s)
638{
639 size_t i = out->len;
640 strbuf_addstr(out, s);
641 for (; i < out->len; i++)
642 if (out->buf[i] == '/')
643 out->buf[i] = '_';
644}
645
696ee23c 646static char *unique_path(struct merge_options *o, const char *path, const char *branch)
9047ebbc 647{
45bc131d 648 struct strbuf newpath = STRBUF_INIT;
9047ebbc 649 int suffix = 0;
45bc131d
JK
650 size_t base_len;
651
652 strbuf_addf(&newpath, "%s~", path);
653 add_flattened_path(&newpath, branch);
654
655 base_len = newpath.len;
656 while (string_list_has_string(&o->current_file_set, newpath.buf) ||
657 string_list_has_string(&o->current_directory_set, newpath.buf) ||
8e1b62f1 658 (!o->call_depth && file_exists(newpath.buf))) {
45bc131d
JK
659 strbuf_setlen(&newpath, base_len);
660 strbuf_addf(&newpath, "_%d", suffix++);
661 }
662
663 string_list_insert(&o->current_file_set, newpath.buf);
664 return strbuf_detach(&newpath, NULL);
9047ebbc
MV
665}
666
5423d2e7
DT
667/**
668 * Check whether a directory in the index is in the way of an incoming
669 * file. Return 1 if so. If check_working_copy is non-zero, also
670 * check the working directory. If empty_ok is non-zero, also return
671 * 0 in the case where the working-tree dir exists but is empty.
672 */
673static int dir_in_way(const char *path, int check_working_copy, int empty_ok)
f2507b4e 674{
b4600fbe
JK
675 int pos;
676 struct strbuf dirpath = STRBUF_INIT;
f2507b4e
EN
677 struct stat st;
678
b4600fbe
JK
679 strbuf_addstr(&dirpath, path);
680 strbuf_addch(&dirpath, '/');
f2507b4e 681
b4600fbe 682 pos = cache_name_pos(dirpath.buf, dirpath.len);
f2507b4e
EN
683
684 if (pos < 0)
685 pos = -1 - pos;
686 if (pos < active_nr &&
b4600fbe
JK
687 !strncmp(dirpath.buf, active_cache[pos]->name, dirpath.len)) {
688 strbuf_release(&dirpath);
f2507b4e
EN
689 return 1;
690 }
691
b4600fbe 692 strbuf_release(&dirpath);
5423d2e7
DT
693 return check_working_copy && !lstat(path, &st) && S_ISDIR(st.st_mode) &&
694 !(empty_ok && is_empty_dir(path));
f2507b4e
EN
695}
696
aacb82de 697static int was_tracked(const char *path)
60c91181
JH
698{
699 int pos = cache_name_pos(path, strlen(path));
700
f8d83fb6
JS
701 if (0 <= pos)
702 /* we have been tracking this path */
703 return 1;
704
705 /*
706 * Look for an unmerged entry for the path,
707 * specifically stage #2, which would indicate
708 * that "our" side before the merge started
709 * had the path tracked (and resulted in a conflict).
710 */
711 for (pos = -1 - pos;
712 pos < active_nr && !strcmp(path, active_cache[pos]->name);
713 pos++)
714 if (ce_stage(active_cache[pos]) == 2)
aacb82de 715 return 1;
aacb82de 716 return 0;
60c91181
JH
717}
718
aacb82de 719static int would_lose_untracked(const char *path)
9047ebbc 720{
aacb82de 721 return !was_tracked(path) && file_exists(path);
60c91181
JH
722}
723
ed0148a5 724static int make_room_for_path(struct merge_options *o, const char *path)
9047ebbc 725{
ed0148a5 726 int status, i;
55653a68 727 const char *msg = _("failed to create path '%s'%s");
9047ebbc 728
ed0148a5
EN
729 /* Unlink any D/F conflict files that are in the way */
730 for (i = 0; i < o->df_conflict_file_set.nr; i++) {
731 const char *df_path = o->df_conflict_file_set.items[i].string;
732 size_t pathlen = strlen(path);
733 size_t df_pathlen = strlen(df_path);
734 if (df_pathlen < pathlen &&
735 path[df_pathlen] == '/' &&
736 strncmp(path, df_path, df_pathlen) == 0) {
737 output(o, 3,
55653a68 738 _("Removing %s to make room for subdirectory\n"),
ed0148a5
EN
739 df_path);
740 unlink(df_path);
741 unsorted_string_list_delete_item(&o->df_conflict_file_set,
742 i, 0);
743 break;
744 }
745 }
746
747 /* Make sure leading directories are created */
9047ebbc
MV
748 status = safe_create_leading_directories_const(path);
749 if (status) {
6003303a 750 if (status == SCLD_EXISTS)
9047ebbc 751 /* something else exists */
bc9204d4
JS
752 return err(o, msg, path, _(": perhaps a D/F conflict?"));
753 return err(o, msg, path, "");
9047ebbc
MV
754 }
755
60c91181
JH
756 /*
757 * Do not unlink a file in the work tree if we are not
758 * tracking it.
759 */
760 if (would_lose_untracked(path))
bc9204d4 761 return err(o, _("refusing to lose untracked file at '%s'"),
60c91181
JH
762 path);
763
9047ebbc
MV
764 /* Successful unlink is good.. */
765 if (!unlink(path))
766 return 0;
767 /* .. and so is no existing file */
768 if (errno == ENOENT)
769 return 0;
770 /* .. but not some other error (who really cares what?) */
bc9204d4 771 return err(o, msg, path, _(": perhaps a D/F conflict?"));
9047ebbc
MV
772}
773
75456f96
JS
774static int update_file_flags(struct merge_options *o,
775 const struct object_id *oid,
776 unsigned mode,
777 const char *path,
778 int update_cache,
779 int update_wd)
9047ebbc 780{
6003303a
JS
781 int ret = 0;
782
b7fa51da 783 if (o->call_depth)
9047ebbc
MV
784 update_wd = 0;
785
786 if (update_wd) {
787 enum object_type type;
788 void *buf;
789 unsigned long size;
790
68d03e4a 791 if (S_ISGITLINK(mode)) {
0c44c943
JH
792 /*
793 * We may later decide to recursively descend into
794 * the submodule directory and update its index
795 * and/or work tree, but we do not do that now.
796 */
68d03e4a 797 update_wd = 0;
0c44c943 798 goto update_index;
68d03e4a 799 }
9047ebbc 800
b4da9d62 801 buf = read_sha1_file(oid->hash, &type, &size);
9047ebbc 802 if (!buf)
bc9204d4 803 return err(o, _("cannot read object %s '%s'"), oid_to_hex(oid), path);
6003303a 804 if (type != OBJ_BLOB) {
bc9204d4 805 ret = err(o, _("blob expected for %s '%s'"), oid_to_hex(oid), path);
6003303a
JS
806 goto free_buf;
807 }
9047ebbc 808 if (S_ISREG(mode)) {
f285a2d7 809 struct strbuf strbuf = STRBUF_INIT;
9047ebbc
MV
810 if (convert_to_working_tree(path, buf, size, &strbuf)) {
811 free(buf);
812 size = strbuf.len;
813 buf = strbuf_detach(&strbuf, NULL);
814 }
815 }
816
ed0148a5 817 if (make_room_for_path(o, path) < 0) {
9047ebbc 818 update_wd = 0;
75456f96 819 goto free_buf;
9047ebbc
MV
820 }
821 if (S_ISREG(mode) || (!has_symlinks && S_ISLNK(mode))) {
822 int fd;
823 if (mode & 0100)
824 mode = 0777;
825 else
826 mode = 0666;
827 fd = open(path, O_WRONLY | O_TRUNC | O_CREAT, mode);
6003303a 828 if (fd < 0) {
bc9204d4
JS
829 ret = err(o, _("failed to open '%s': %s"),
830 path, strerror(errno));
6003303a
JS
831 goto free_buf;
832 }
f633ea2c 833 write_in_full(fd, buf, size);
9047ebbc
MV
834 close(fd);
835 } else if (S_ISLNK(mode)) {
836 char *lnk = xmemdupz(buf, size);
837 safe_create_leading_directories_const(path);
838 unlink(path);
304dcf26 839 if (symlink(lnk, path))
bc9204d4
JS
840 ret = err(o, _("failed to symlink '%s': %s"),
841 path, strerror(errno));
9047ebbc
MV
842 free(lnk);
843 } else
bc9204d4
JS
844 ret = err(o,
845 _("do not know what to do with %06o %s '%s'"),
846 mode, oid_to_hex(oid), path);
75456f96 847 free_buf:
9047ebbc
MV
848 free(buf);
849 }
850 update_index:
6003303a 851 if (!ret && update_cache)
bc9204d4 852 add_cacheinfo(o, mode, oid, path, 0, update_wd, ADD_CACHE_OK_TO_ADD);
6003303a 853 return ret;
9047ebbc
MV
854}
855
75456f96
JS
856static int update_file(struct merge_options *o,
857 int clean,
858 const struct object_id *oid,
859 unsigned mode,
860 const char *path)
9047ebbc 861{
75456f96 862 return update_file_flags(o, oid, mode, path, o->call_depth || clean, !o->call_depth);
9047ebbc
MV
863}
864
865/* Low level file merging, update and removal */
866
9cba13ca 867struct merge_file_info {
9b561499 868 struct object_id oid;
9047ebbc
MV
869 unsigned mode;
870 unsigned clean:1,
871 merge:1;
872};
873
b7fa51da
MV
874static int merge_3way(struct merge_options *o,
875 mmbuffer_t *result_buf,
0c059420
EN
876 const struct diff_filespec *one,
877 const struct diff_filespec *a,
878 const struct diff_filespec *b,
9047ebbc
MV
879 const char *branch1,
880 const char *branch2)
881{
882 mmfile_t orig, src1, src2;
712516bc 883 struct ll_merge_options ll_opts = {0};
4c5868f4 884 char *base_name, *name1, *name2;
9047ebbc 885 int merge_status;
8cc5b290 886
712516bc 887 ll_opts.renormalize = o->renormalize;
58a1ece4 888 ll_opts.xdl_opts = o->xdl_opts;
712516bc
JN
889
890 if (o->call_depth) {
891 ll_opts.virtual_ancestor = 1;
892 ll_opts.variant = 0;
893 } else {
8cc5b290
AP
894 switch (o->recursive_variant) {
895 case MERGE_RECURSIVE_OURS:
712516bc 896 ll_opts.variant = XDL_MERGE_FAVOR_OURS;
8cc5b290
AP
897 break;
898 case MERGE_RECURSIVE_THEIRS:
712516bc 899 ll_opts.variant = XDL_MERGE_FAVOR_THEIRS;
8cc5b290
AP
900 break;
901 default:
712516bc 902 ll_opts.variant = 0;
8cc5b290
AP
903 break;
904 }
905 }
9047ebbc 906
4c5868f4
JN
907 if (strcmp(a->path, b->path) ||
908 (o->ancestor != NULL && strcmp(a->path, one->path) != 0)) {
909 base_name = o->ancestor == NULL ? NULL :
4e2d094d
RJ
910 mkpathdup("%s:%s", o->ancestor, one->path);
911 name1 = mkpathdup("%s:%s", branch1, a->path);
912 name2 = mkpathdup("%s:%s", branch2, b->path);
606475f3 913 } else {
4c5868f4 914 base_name = o->ancestor == NULL ? NULL :
4e2d094d
RJ
915 mkpathdup("%s", o->ancestor);
916 name1 = mkpathdup("%s", branch1);
917 name2 = mkpathdup("%s", branch2);
606475f3 918 }
9047ebbc 919
d449347d 920 read_mmblob(&orig, &one->oid);
921 read_mmblob(&src1, &a->oid);
922 read_mmblob(&src2, &b->oid);
9047ebbc 923
4c5868f4 924 merge_status = ll_merge(result_buf, a->path, &orig, base_name,
712516bc 925 &src1, name1, &src2, name2, &ll_opts);
9047ebbc 926
4e2d094d 927 free(base_name);
9047ebbc
MV
928 free(name1);
929 free(name2);
930 free(orig.ptr);
931 free(src1.ptr);
932 free(src2.ptr);
933 return merge_status;
934}
935
3c8a51e8 936static int merge_file_1(struct merge_options *o,
6bdaead1
EN
937 const struct diff_filespec *one,
938 const struct diff_filespec *a,
939 const struct diff_filespec *b,
940 const char *branch1,
3c8a51e8
JS
941 const char *branch2,
942 struct merge_file_info *result)
9047ebbc 943{
3c8a51e8
JS
944 result->merge = 0;
945 result->clean = 1;
9047ebbc
MV
946
947 if ((S_IFMT & a->mode) != (S_IFMT & b->mode)) {
3c8a51e8 948 result->clean = 0;
9047ebbc 949 if (S_ISREG(a->mode)) {
3c8a51e8
JS
950 result->mode = a->mode;
951 oidcpy(&result->oid, &a->oid);
9047ebbc 952 } else {
3c8a51e8
JS
953 result->mode = b->mode;
954 oidcpy(&result->oid, &b->oid);
9047ebbc
MV
955 }
956 } else {
b4da9d62 957 if (!oid_eq(&a->oid, &one->oid) && !oid_eq(&b->oid, &one->oid))
3c8a51e8 958 result->merge = 1;
9047ebbc
MV
959
960 /*
961 * Merge modes
962 */
b7fa51da 963 if (a->mode == b->mode || a->mode == one->mode)
3c8a51e8 964 result->mode = b->mode;
9047ebbc 965 else {
3c8a51e8 966 result->mode = a->mode;
b7fa51da 967 if (b->mode != one->mode) {
3c8a51e8
JS
968 result->clean = 0;
969 result->merge = 1;
9047ebbc
MV
970 }
971 }
972
b4da9d62 973 if (oid_eq(&a->oid, &b->oid) || oid_eq(&a->oid, &one->oid))
3c8a51e8 974 oidcpy(&result->oid, &b->oid);
b4da9d62 975 else if (oid_eq(&b->oid, &one->oid))
3c8a51e8 976 oidcpy(&result->oid, &a->oid);
9047ebbc
MV
977 else if (S_ISREG(a->mode)) {
978 mmbuffer_t result_buf;
6003303a 979 int ret = 0, merge_status;
9047ebbc 980
b7fa51da 981 merge_status = merge_3way(o, &result_buf, one, a, b,
9047ebbc
MV
982 branch1, branch2);
983
984 if ((merge_status < 0) || !result_buf.ptr)
bc9204d4 985 ret = err(o, _("Failed to execute internal merge"));
9047ebbc 986
6003303a
JS
987 if (!ret && write_sha1_file(result_buf.ptr, result_buf.size,
988 blob_type, result->oid.hash))
bc9204d4
JS
989 ret = err(o, _("Unable to add %s to database"),
990 a->path);
9047ebbc
MV
991
992 free(result_buf.ptr);
6003303a
JS
993 if (ret)
994 return ret;
3c8a51e8 995 result->clean = (merge_status == 0);
9047ebbc 996 } else if (S_ISGITLINK(a->mode)) {
3c8a51e8 997 result->clean = merge_submodule(result->oid.hash,
a0d12c44 998 one->path,
999 one->oid.hash,
1000 a->oid.hash,
1001 b->oid.hash,
80988783 1002 !o->call_depth);
9047ebbc 1003 } else if (S_ISLNK(a->mode)) {
3c8a51e8 1004 oidcpy(&result->oid, &a->oid);
9047ebbc 1005
b4da9d62 1006 if (!oid_eq(&a->oid, &b->oid))
3c8a51e8 1007 result->clean = 0;
ef1177d1 1008 } else
7e97e100 1009 die("BUG: unsupported object type in the tree");
9047ebbc
MV
1010 }
1011
3c8a51e8 1012 return 0;
9047ebbc
MV
1013}
1014
3c8a51e8 1015static int merge_file_special_markers(struct merge_options *o,
dac47415
EN
1016 const struct diff_filespec *one,
1017 const struct diff_filespec *a,
1018 const struct diff_filespec *b,
1019 const char *branch1,
1020 const char *filename1,
1021 const char *branch2,
3c8a51e8
JS
1022 const char *filename2,
1023 struct merge_file_info *mfi)
dac47415
EN
1024{
1025 char *side1 = NULL;
1026 char *side2 = NULL;
3c8a51e8 1027 int ret;
dac47415 1028
28310186
JK
1029 if (filename1)
1030 side1 = xstrfmt("%s:%s", branch1, filename1);
1031 if (filename2)
1032 side2 = xstrfmt("%s:%s", branch2, filename2);
dac47415 1033
3c8a51e8
JS
1034 ret = merge_file_1(o, one, a, b,
1035 side1 ? side1 : branch1,
1036 side2 ? side2 : branch2, mfi);
dac47415
EN
1037 free(side1);
1038 free(side2);
3c8a51e8 1039 return ret;
dac47415
EN
1040}
1041
3c8a51e8 1042static int merge_file_one(struct merge_options *o,
6bdaead1 1043 const char *path,
b4da9d62 1044 const struct object_id *o_oid, int o_mode,
1045 const struct object_id *a_oid, int a_mode,
1046 const struct object_id *b_oid, int b_mode,
6bdaead1 1047 const char *branch1,
3c8a51e8
JS
1048 const char *branch2,
1049 struct merge_file_info *mfi)
6bdaead1
EN
1050{
1051 struct diff_filespec one, a, b;
1052
1053 one.path = a.path = b.path = (char *)path;
b4da9d62 1054 oidcpy(&one.oid, o_oid);
6bdaead1 1055 one.mode = o_mode;
b4da9d62 1056 oidcpy(&a.oid, a_oid);
6bdaead1 1057 a.mode = a_mode;
b4da9d62 1058 oidcpy(&b.oid, b_oid);
6bdaead1 1059 b.mode = b_mode;
3c8a51e8 1060 return merge_file_1(o, &one, &a, &b, branch1, branch2, mfi);
6bdaead1
EN
1061}
1062
75456f96 1063static int handle_change_delete(struct merge_options *o,
b26d87f2 1064 const char *path, const char *old_path,
b4da9d62 1065 const struct object_id *o_oid, int o_mode,
b26d87f2
MM
1066 const struct object_id *changed_oid,
1067 int changed_mode,
1068 const char *change_branch,
1069 const char *delete_branch,
b7033252
EN
1070 const char *change, const char *change_past)
1071{
b26d87f2
MM
1072 char *alt_path = NULL;
1073 const char *update_path = path;
75456f96 1074 int ret = 0;
b26d87f2 1075
5423d2e7 1076 if (dir_in_way(path, !o->call_depth, 0)) {
b26d87f2 1077 update_path = alt_path = unique_path(o, path, change_branch);
b7033252
EN
1078 }
1079
1080 if (o->call_depth) {
1081 /*
1082 * We cannot arbitrarily accept either a_sha or b_sha as
1083 * correct; since there is no true "middle point" between
1084 * them, simply reuse the base version for virtual merge base.
1085 */
75456f96
JS
1086 ret = remove_file_from_cache(path);
1087 if (!ret)
b26d87f2 1088 ret = update_file(o, 0, o_oid, o_mode, update_path);
b7033252 1089 } else {
b26d87f2
MM
1090 if (!alt_path) {
1091 if (!old_path) {
1092 output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1093 "and %s in %s. Version %s of %s left in tree."),
1094 change, path, delete_branch, change_past,
1095 change_branch, change_branch, path);
1096 } else {
1097 output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1098 "and %s to %s in %s. Version %s of %s left in tree."),
1099 change, old_path, delete_branch, change_past, path,
1100 change_branch, change_branch, path);
1101 }
55653a68 1102 } else {
b26d87f2
MM
1103 if (!old_path) {
1104 output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1105 "and %s in %s. Version %s of %s left in tree at %s."),
1106 change, path, delete_branch, change_past,
1107 change_branch, change_branch, path, alt_path);
1108 } else {
1109 output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1110 "and %s to %s in %s. Version %s of %s left in tree at %s."),
1111 change, old_path, delete_branch, change_past, path,
1112 change_branch, change_branch, path, alt_path);
1113 }
55653a68 1114 }
35a74abf 1115 /*
b26d87f2
MM
1116 * No need to call update_file() on path when change_branch ==
1117 * o->branch1 && !alt_path, since that would needlessly touch
1118 * path. We could call update_file_flags() with update_cache=0
1119 * and update_wd=0, but that's a no-op.
35a74abf 1120 */
b26d87f2
MM
1121 if (change_branch != o->branch1 || alt_path)
1122 ret = update_file(o, 0, changed_oid, changed_mode, update_path);
b7033252 1123 }
b26d87f2 1124 free(alt_path);
75456f96
JS
1125
1126 return ret;
b7033252
EN
1127}
1128
75456f96 1129static int conflict_rename_delete(struct merge_options *o,
6ef2cb00
EN
1130 struct diff_filepair *pair,
1131 const char *rename_branch,
b26d87f2 1132 const char *delete_branch)
9047ebbc 1133{
e03acb8b
EN
1134 const struct diff_filespec *orig = pair->one;
1135 const struct diff_filespec *dest = pair->two;
6ef2cb00 1136
75456f96
JS
1137 if (handle_change_delete(o,
1138 o->call_depth ? orig->path : dest->path,
b26d87f2 1139 o->call_depth ? NULL : orig->path,
75456f96 1140 &orig->oid, orig->mode,
b26d87f2
MM
1141 &dest->oid, dest->mode,
1142 rename_branch, delete_branch,
75456f96
JS
1143 _("rename"), _("renamed")))
1144 return -1;
e03acb8b 1145
75456f96
JS
1146 if (o->call_depth)
1147 return remove_file_from_cache(dest->path);
1148 else
bc9204d4 1149 return update_stages(o, dest->path, NULL,
75456f96
JS
1150 rename_branch == o->branch1 ? dest : NULL,
1151 rename_branch == o->branch1 ? NULL : dest);
6ef2cb00
EN
1152}
1153
1ac91b32
EN
1154static struct diff_filespec *filespec_from_entry(struct diff_filespec *target,
1155 struct stage_data *entry,
1156 int stage)
9047ebbc 1157{
b4da9d62 1158 struct object_id *oid = &entry->stages[stage].oid;
1ac91b32 1159 unsigned mode = entry->stages[stage].mode;
b4da9d62 1160 if (mode == 0 || is_null_oid(oid))
1ac91b32 1161 return NULL;
b4da9d62 1162 oidcpy(&target->oid, oid);
1ac91b32
EN
1163 target->mode = mode;
1164 return target;
1165}
1166
75456f96 1167static int handle_file(struct merge_options *o,
3672c971
EN
1168 struct diff_filespec *rename,
1169 int stage,
1170 struct rename_conflict_info *ci)
1171{
1172 char *dst_name = rename->path;
1173 struct stage_data *dst_entry;
1174 const char *cur_branch, *other_branch;
1175 struct diff_filespec other;
1176 struct diff_filespec *add;
75456f96 1177 int ret;
3672c971
EN
1178
1179 if (stage == 2) {
1180 dst_entry = ci->dst_entry1;
1181 cur_branch = ci->branch1;
1182 other_branch = ci->branch2;
1183 } else {
1184 dst_entry = ci->dst_entry2;
1185 cur_branch = ci->branch2;
1186 other_branch = ci->branch1;
9047ebbc 1187 }
3672c971
EN
1188
1189 add = filespec_from_entry(&other, dst_entry, stage ^ 1);
3672c971
EN
1190 if (add) {
1191 char *add_name = unique_path(o, rename->path, other_branch);
75456f96
JS
1192 if (update_file(o, 0, &add->oid, add->mode, add_name))
1193 return -1;
3672c971
EN
1194
1195 remove_file(o, 0, rename->path, 0);
1196 dst_name = unique_path(o, rename->path, cur_branch);
1197 } else {
5423d2e7 1198 if (dir_in_way(rename->path, !o->call_depth, 0)) {
3672c971 1199 dst_name = unique_path(o, rename->path, cur_branch);
55653a68 1200 output(o, 1, _("%s is a directory in %s adding as %s instead"),
3672c971
EN
1201 rename->path, other_branch, dst_name);
1202 }
9047ebbc 1203 }
75456f96
JS
1204 if ((ret = update_file(o, 0, &rename->oid, rename->mode, dst_name)))
1205 ; /* fall through, do allow dst_name to be released */
1206 else if (stage == 2)
bc9204d4 1207 ret = update_stages(o, rename->path, NULL, rename, add);
f53d3977 1208 else
bc9204d4 1209 ret = update_stages(o, rename->path, NULL, add, rename);
3672c971
EN
1210
1211 if (dst_name != rename->path)
1212 free(dst_name);
75456f96
JS
1213
1214 return ret;
3672c971
EN
1215}
1216
75456f96 1217static int conflict_rename_rename_1to2(struct merge_options *o,
a99b7f22 1218 struct rename_conflict_info *ci)
9047ebbc 1219{
09c01f85 1220 /* One file was renamed in both branches, but to different names. */
a99b7f22
EN
1221 struct diff_filespec *one = ci->pair1->one;
1222 struct diff_filespec *a = ci->pair1->two;
1223 struct diff_filespec *b = ci->pair2->two;
4f66dade 1224
55653a68 1225 output(o, 1, _("CONFLICT (rename/rename): "
4f66dade 1226 "Rename \"%s\"->\"%s\" in branch \"%s\" "
55653a68 1227 "rename \"%s\"->\"%s\" in \"%s\"%s"),
a99b7f22
EN
1228 one->path, a->path, ci->branch1,
1229 one->path, b->path, ci->branch2,
55653a68 1230 o->call_depth ? _(" (left unresolved)") : "");
b7fa51da 1231 if (o->call_depth) {
c52ff85d 1232 struct merge_file_info mfi;
6d63070c
EN
1233 struct diff_filespec other;
1234 struct diff_filespec *add;
3c8a51e8 1235 if (merge_file_one(o, one->path,
b4da9d62 1236 &one->oid, one->mode,
1237 &a->oid, a->mode,
1238 &b->oid, b->mode,
3c8a51e8 1239 ci->branch1, ci->branch2, &mfi))
75456f96
JS
1240 return -1;
1241
9047ebbc 1242 /*
c52ff85d
EN
1243 * FIXME: For rename/add-source conflicts (if we could detect
1244 * such), this is wrong. We should instead find a unique
1245 * pathname and then either rename the add-source file to that
1246 * unique path, or use that unique path instead of src here.
9047ebbc 1247 */
75456f96
JS
1248 if (update_file(o, 0, &mfi.oid, mfi.mode, one->path))
1249 return -1;
07413c5a 1250
6d63070c
EN
1251 /*
1252 * Above, we put the merged content at the merge-base's
1253 * path. Now we usually need to delete both a->path and
1254 * b->path. However, the rename on each side of the merge
1255 * could also be involved in a rename/add conflict. In
1256 * such cases, we should keep the added file around,
1257 * resolving the conflict at that path in its favor.
1258 */
1259 add = filespec_from_entry(&other, ci->dst_entry1, 2 ^ 1);
75456f96
JS
1260 if (add) {
1261 if (update_file(o, 0, &add->oid, add->mode, a->path))
1262 return -1;
1263 }
6d63070c
EN
1264 else
1265 remove_file_from_cache(a->path);
1266 add = filespec_from_entry(&other, ci->dst_entry2, 3 ^ 1);
75456f96
JS
1267 if (add) {
1268 if (update_file(o, 0, &add->oid, add->mode, b->path))
1269 return -1;
1270 }
6d63070c
EN
1271 else
1272 remove_file_from_cache(b->path);
75456f96
JS
1273 } else if (handle_file(o, a, 2, ci) || handle_file(o, b, 3, ci))
1274 return -1;
1275
1276 return 0;
9047ebbc
MV
1277}
1278
75456f96 1279static int conflict_rename_rename_2to1(struct merge_options *o,
461f5041 1280 struct rename_conflict_info *ci)
9047ebbc 1281{
461f5041
EN
1282 /* Two files, a & b, were renamed to the same thing, c. */
1283 struct diff_filespec *a = ci->pair1->one;
1284 struct diff_filespec *b = ci->pair2->one;
1285 struct diff_filespec *c1 = ci->pair1->two;
1286 struct diff_filespec *c2 = ci->pair2->two;
1287 char *path = c1->path; /* == c2->path */
434b8525
EN
1288 struct merge_file_info mfi_c1;
1289 struct merge_file_info mfi_c2;
75456f96 1290 int ret;
461f5041 1291
55653a68 1292 output(o, 1, _("CONFLICT (rename/rename): "
461f5041 1293 "Rename %s->%s in %s. "
55653a68 1294 "Rename %s->%s in %s"),
461f5041
EN
1295 a->path, c1->path, ci->branch1,
1296 b->path, c2->path, ci->branch2);
1297
8e1b62f1
EN
1298 remove_file(o, 1, a->path, o->call_depth || would_lose_untracked(a->path));
1299 remove_file(o, 1, b->path, o->call_depth || would_lose_untracked(b->path));
461f5041 1300
3c8a51e8
JS
1301 if (merge_file_special_markers(o, a, c1, &ci->ren1_other,
1302 o->branch1, c1->path,
1303 o->branch2, ci->ren1_other.path, &mfi_c1) ||
1304 merge_file_special_markers(o, b, &ci->ren2_other, c2,
1305 o->branch1, ci->ren2_other.path,
1306 o->branch2, c2->path, &mfi_c2))
75456f96 1307 return -1;
434b8525 1308
0a6b8712 1309 if (o->call_depth) {
434b8525
EN
1310 /*
1311 * If mfi_c1.clean && mfi_c2.clean, then it might make
1312 * sense to do a two-way merge of those results. But, I
1313 * think in all cases, it makes sense to have the virtual
1314 * merge base just undo the renames; they can be detected
1315 * again later for the non-recursive merge.
1316 */
1317 remove_file(o, 0, path, 0);
75456f96
JS
1318 ret = update_file(o, 0, &mfi_c1.oid, mfi_c1.mode, a->path);
1319 if (!ret)
1320 ret = update_file(o, 0, &mfi_c2.oid, mfi_c2.mode,
1321 b->path);
0a6b8712 1322 } else {
461f5041
EN
1323 char *new_path1 = unique_path(o, path, ci->branch1);
1324 char *new_path2 = unique_path(o, path, ci->branch2);
55653a68 1325 output(o, 1, _("Renaming %s to %s and %s to %s instead"),
461f5041 1326 a->path, new_path1, b->path, new_path2);
0a6b8712 1327 remove_file(o, 0, path, 0);
75456f96
JS
1328 ret = update_file(o, 0, &mfi_c1.oid, mfi_c1.mode, new_path1);
1329 if (!ret)
1330 ret = update_file(o, 0, &mfi_c2.oid, mfi_c2.mode,
1331 new_path2);
0a6b8712
EN
1332 free(new_path2);
1333 free(new_path1);
1334 }
75456f96
JS
1335
1336 return ret;
9047ebbc
MV
1337}
1338
8a2fce18
MV
1339static int process_renames(struct merge_options *o,
1340 struct string_list *a_renames,
1341 struct string_list *b_renames)
9047ebbc
MV
1342{
1343 int clean_merge = 1, i, j;
183113a5
TF
1344 struct string_list a_by_dst = STRING_LIST_INIT_NODUP;
1345 struct string_list b_by_dst = STRING_LIST_INIT_NODUP;
9047ebbc
MV
1346 const struct rename *sre;
1347
1348 for (i = 0; i < a_renames->nr; i++) {
1349 sre = a_renames->items[i].util;
78a395d3 1350 string_list_insert(&a_by_dst, sre->pair->two->path)->util
0a6b8712 1351 = (void *)sre;
9047ebbc
MV
1352 }
1353 for (i = 0; i < b_renames->nr; i++) {
1354 sre = b_renames->items[i].util;
78a395d3 1355 string_list_insert(&b_by_dst, sre->pair->two->path)->util
0a6b8712 1356 = (void *)sre;
9047ebbc
MV
1357 }
1358
1359 for (i = 0, j = 0; i < a_renames->nr || j < b_renames->nr;) {
8e24cbae 1360 struct string_list *renames1, *renames2Dst;
9047ebbc
MV
1361 struct rename *ren1 = NULL, *ren2 = NULL;
1362 const char *branch1, *branch2;
1363 const char *ren1_src, *ren1_dst;
461f5041 1364 struct string_list_item *lookup;
9047ebbc
MV
1365
1366 if (i >= a_renames->nr) {
9047ebbc
MV
1367 ren2 = b_renames->items[j++].util;
1368 } else if (j >= b_renames->nr) {
9047ebbc
MV
1369 ren1 = a_renames->items[i++].util;
1370 } else {
8e24cbae
BK
1371 int compare = strcmp(a_renames->items[i].string,
1372 b_renames->items[j].string);
9047ebbc
MV
1373 if (compare <= 0)
1374 ren1 = a_renames->items[i++].util;
1375 if (compare >= 0)
1376 ren2 = b_renames->items[j++].util;
1377 }
1378
1379 /* TODO: refactor, so that 1/2 are not needed */
1380 if (ren1) {
1381 renames1 = a_renames;
9047ebbc 1382 renames2Dst = &b_by_dst;
8a2fce18
MV
1383 branch1 = o->branch1;
1384 branch2 = o->branch2;
9047ebbc 1385 } else {
9047ebbc 1386 renames1 = b_renames;
9047ebbc 1387 renames2Dst = &a_by_dst;
8a2fce18
MV
1388 branch1 = o->branch2;
1389 branch2 = o->branch1;
35d803bc 1390 SWAP(ren2, ren1);
9047ebbc 1391 }
9047ebbc 1392
9047ebbc
MV
1393 if (ren1->processed)
1394 continue;
1395 ren1->processed = 1;
9047ebbc 1396 ren1->dst_entry->processed = 1;
7769a75e
EN
1397 /* BUG: We should only mark src_entry as processed if we
1398 * are not dealing with a rename + add-source case.
1399 */
9047ebbc 1400 ren1->src_entry->processed = 1;
9047ebbc
MV
1401
1402 ren1_src = ren1->pair->one->path;
1403 ren1_dst = ren1->pair->two->path;
1404
1405 if (ren2) {
461f5041 1406 /* One file renamed on both sides */
9047ebbc
MV
1407 const char *ren2_src = ren2->pair->one->path;
1408 const char *ren2_dst = ren2->pair->two->path;
4f66dade 1409 enum rename_type rename_type;
9047ebbc 1410 if (strcmp(ren1_src, ren2_src) != 0)
ef1177d1 1411 die("BUG: ren1_src != ren2_src");
9047ebbc
MV
1412 ren2->dst_entry->processed = 1;
1413 ren2->processed = 1;
1414 if (strcmp(ren1_dst, ren2_dst) != 0) {
4f66dade 1415 rename_type = RENAME_ONE_FILE_TO_TWO;
461f5041 1416 clean_merge = 0;
9047ebbc 1417 } else {
4f66dade 1418 rename_type = RENAME_ONE_FILE_TO_ONE;
7769a75e
EN
1419 /* BUG: We should only remove ren1_src in
1420 * the base stage (think of rename +
1421 * add-source cases).
1422 */
b7fa51da 1423 remove_file(o, 1, ren1_src, 1);
b8ddf164
EN
1424 update_entry(ren1->dst_entry,
1425 ren1->pair->one,
1426 ren1->pair->two,
1427 ren2->pair->two);
9047ebbc 1428 }
4f66dade
EN
1429 setup_rename_conflict_info(rename_type,
1430 ren1->pair,
1431 ren2->pair,
1432 branch1,
1433 branch2,
1434 ren1->dst_entry,
232c635f
EN
1435 ren2->dst_entry,
1436 o,
1437 NULL,
1438 NULL);
461f5041
EN
1439 } else if ((lookup = string_list_lookup(renames2Dst, ren1_dst))) {
1440 /* Two different files renamed to the same thing */
1441 char *ren2_dst;
1442 ren2 = lookup->util;
1443 ren2_dst = ren2->pair->two->path;
1444 if (strcmp(ren1_dst, ren2_dst) != 0)
ef1177d1 1445 die("BUG: ren1_dst != ren2_dst");
461f5041
EN
1446
1447 clean_merge = 0;
1448 ren2->processed = 1;
1449 /*
1450 * BUG: We should only mark src_entry as processed
1451 * if we are not dealing with a rename + add-source
1452 * case.
1453 */
1454 ren2->src_entry->processed = 1;
1455
1456 setup_rename_conflict_info(RENAME_TWO_FILES_TO_ONE,
1457 ren1->pair,
1458 ren2->pair,
1459 branch1,
1460 branch2,
1461 ren1->dst_entry,
232c635f
EN
1462 ren2->dst_entry,
1463 o,
1464 ren1->src_entry,
1465 ren2->src_entry);
1466
9047ebbc
MV
1467 } else {
1468 /* Renamed in 1, maybe changed in 2 */
9047ebbc
MV
1469 /* we only use sha1 and mode of these */
1470 struct diff_filespec src_other, dst_other;
41d70bd6 1471 int try_merge;
9047ebbc 1472
41d70bd6
EN
1473 /*
1474 * unpack_trees loads entries from common-commit
1475 * into stage 1, from head-commit into stage 2, and
1476 * from merge-commit into stage 3. We keep track
1477 * of which side corresponds to the rename.
1478 */
1479 int renamed_stage = a_renames == renames1 ? 2 : 3;
1480 int other_stage = a_renames == renames1 ? 3 : 2;
9047ebbc 1481
7769a75e
EN
1482 /* BUG: We should only remove ren1_src in the base
1483 * stage and in other_stage (think of rename +
1484 * add-source case).
1485 */
531357a4
EN
1486 remove_file(o, 1, ren1_src,
1487 renamed_stage == 2 || !was_tracked(ren1_src));
9047ebbc 1488
fd429e98 1489 oidcpy(&src_other.oid,
1490 &ren1->src_entry->stages[other_stage].oid);
41d70bd6 1491 src_other.mode = ren1->src_entry->stages[other_stage].mode;
fd429e98 1492 oidcpy(&dst_other.oid,
1493 &ren1->dst_entry->stages[other_stage].oid);
41d70bd6 1494 dst_other.mode = ren1->dst_entry->stages[other_stage].mode;
9047ebbc
MV
1495 try_merge = 0;
1496
b4da9d62 1497 if (oid_eq(&src_other.oid, &null_oid)) {
4f66dade
EN
1498 setup_rename_conflict_info(RENAME_DELETE,
1499 ren1->pair,
1500 NULL,
1501 branch1,
1502 branch2,
1503 ren1->dst_entry,
232c635f
EN
1504 NULL,
1505 o,
1506 NULL,
4f66dade 1507 NULL);
d5af5105 1508 } else if ((dst_other.mode == ren1->pair->two->mode) &&
b4da9d62 1509 oid_eq(&dst_other.oid, &ren1->pair->two->oid)) {
35a74abf
EN
1510 /*
1511 * Added file on the other side identical to
1512 * the file being renamed: clean merge.
1513 * Also, there is no need to overwrite the
1514 * file already in the working copy, so call
1515 * update_file_flags() instead of
1516 * update_file().
1517 */
75456f96
JS
1518 if (update_file_flags(o,
1519 &ren1->pair->two->oid,
1520 ren1->pair->two->mode,
1521 ren1_dst,
1522 1, /* update_cache */
1523 0 /* update_wd */))
1524 clean_merge = -1;
b4da9d62 1525 } else if (!oid_eq(&dst_other.oid, &null_oid)) {
9047ebbc
MV
1526 clean_merge = 0;
1527 try_merge = 1;
55653a68
JX
1528 output(o, 1, _("CONFLICT (rename/add): Rename %s->%s in %s. "
1529 "%s added in %s"),
9047ebbc
MV
1530 ren1_src, ren1_dst, branch1,
1531 ren1_dst, branch2);
c94736a2
JH
1532 if (o->call_depth) {
1533 struct merge_file_info mfi;
3c8a51e8
JS
1534 if (merge_file_one(o, ren1_dst, &null_oid, 0,
1535 &ren1->pair->two->oid,
1536 ren1->pair->two->mode,
1537 &dst_other.oid,
1538 dst_other.mode,
75456f96
JS
1539 branch1, branch2, &mfi)) {
1540 clean_merge = -1;
1541 goto cleanup_and_return;
1542 }
55653a68 1543 output(o, 1, _("Adding merged %s"), ren1_dst);
75456f96
JS
1544 if (update_file(o, 0, &mfi.oid,
1545 mfi.mode, ren1_dst))
1546 clean_merge = -1;
2a669c34 1547 try_merge = 0;
c94736a2 1548 } else {
3d6b8e88 1549 char *new_path = unique_path(o, ren1_dst, branch2);
55653a68 1550 output(o, 1, _("Adding as %s instead"), new_path);
75456f96
JS
1551 if (update_file(o, 0, &dst_other.oid,
1552 dst_other.mode, new_path))
1553 clean_merge = -1;
3d6b8e88 1554 free(new_path);
c94736a2 1555 }
9047ebbc
MV
1556 } else
1557 try_merge = 1;
1558
75456f96
JS
1559 if (clean_merge < 0)
1560 goto cleanup_and_return;
9047ebbc 1561 if (try_merge) {
8a2fce18 1562 struct diff_filespec *one, *a, *b;
9047ebbc
MV
1563 src_other.path = (char *)ren1_src;
1564
8a2fce18 1565 one = ren1->pair->one;
9047ebbc
MV
1566 if (a_renames == renames1) {
1567 a = ren1->pair->two;
1568 b = &src_other;
1569 } else {
1570 b = ren1->pair->two;
1571 a = &src_other;
1572 }
b8ddf164 1573 update_entry(ren1->dst_entry, one, a, b);
4f66dade
EN
1574 setup_rename_conflict_info(RENAME_NORMAL,
1575 ren1->pair,
1576 NULL,
1577 branch1,
1578 NULL,
1579 ren1->dst_entry,
232c635f
EN
1580 NULL,
1581 o,
1582 NULL,
4f66dade 1583 NULL);
9047ebbc
MV
1584 }
1585 }
1586 }
75456f96 1587cleanup_and_return:
9047ebbc
MV
1588 string_list_clear(&a_by_dst, 0);
1589 string_list_clear(&b_by_dst, 0);
1590
1591 return clean_merge;
1592}
1593
b4da9d62 1594static struct object_id *stage_oid(const struct object_id *oid, unsigned mode)
9047ebbc 1595{
b4da9d62 1596 return (is_null_oid(oid) || mode == 0) ? NULL: (struct object_id *)oid;
9047ebbc
MV
1597}
1598
bc9204d4
JS
1599static int read_oid_strbuf(struct merge_options *o,
1600 const struct object_id *oid, struct strbuf *dst)
331a1838
EB
1601{
1602 void *buf;
1603 enum object_type type;
1604 unsigned long size;
b4da9d62 1605 buf = read_sha1_file(oid->hash, &type, &size);
331a1838 1606 if (!buf)
bc9204d4 1607 return err(o, _("cannot read object %s"), oid_to_hex(oid));
331a1838
EB
1608 if (type != OBJ_BLOB) {
1609 free(buf);
bc9204d4 1610 return err(o, _("object %s is not a blob"), oid_to_hex(oid));
331a1838
EB
1611 }
1612 strbuf_attach(dst, buf, size, size + 1);
1613 return 0;
1614}
1615
bc9204d4
JS
1616static int blob_unchanged(struct merge_options *opt,
1617 const struct object_id *o_oid,
72fac66b 1618 unsigned o_mode,
b4da9d62 1619 const struct object_id *a_oid,
72fac66b 1620 unsigned a_mode,
3e7589b7 1621 int renormalize, const char *path)
331a1838
EB
1622{
1623 struct strbuf o = STRBUF_INIT;
1624 struct strbuf a = STRBUF_INIT;
1625 int ret = 0; /* assume changed for safety */
1626
72fac66b
JK
1627 if (a_mode != o_mode)
1628 return 0;
b4da9d62 1629 if (oid_eq(o_oid, a_oid))
331a1838 1630 return 1;
3e7589b7 1631 if (!renormalize)
331a1838
EB
1632 return 0;
1633
b4da9d62 1634 assert(o_oid && a_oid);
bc9204d4 1635 if (read_oid_strbuf(opt, o_oid, &o) || read_oid_strbuf(opt, a_oid, &a))
331a1838
EB
1636 goto error_return;
1637 /*
1638 * Note: binary | is used so that both renormalizations are
1639 * performed. Comparison can be skipped if both files are
1640 * unchanged since their sha1s have already been compared.
1641 */
1642 if (renormalize_buffer(path, o.buf, o.len, &o) |
422af49c 1643 renormalize_buffer(path, a.buf, a.len, &a))
331a1838
EB
1644 ret = (o.len == a.len && !memcmp(o.buf, a.buf, o.len));
1645
1646error_return:
1647 strbuf_release(&o);
1648 strbuf_release(&a);
1649 return ret;
1650}
1651
75456f96 1652static int handle_modify_delete(struct merge_options *o,
5e3ce663 1653 const char *path,
b4da9d62 1654 struct object_id *o_oid, int o_mode,
1655 struct object_id *a_oid, int a_mode,
1656 struct object_id *b_oid, int b_mode)
5e3ce663 1657{
b26d87f2
MM
1658 const char *modify_branch, *delete_branch;
1659 struct object_id *changed_oid;
1660 int changed_mode;
1661
1662 if (a_oid) {
1663 modify_branch = o->branch1;
1664 delete_branch = o->branch2;
1665 changed_oid = a_oid;
1666 changed_mode = a_mode;
1667 } else {
1668 modify_branch = o->branch2;
1669 delete_branch = o->branch1;
1670 changed_oid = b_oid;
1671 changed_mode = b_mode;
1672 }
1673
75456f96 1674 return handle_change_delete(o,
b26d87f2 1675 path, NULL,
75456f96 1676 o_oid, o_mode,
b26d87f2
MM
1677 changed_oid, changed_mode,
1678 modify_branch, delete_branch,
75456f96 1679 _("modify"), _("modified"));
5e3ce663
EN
1680}
1681
0c4918d1
EN
1682static int merge_content(struct merge_options *o,
1683 const char *path,
b4da9d62 1684 struct object_id *o_oid, int o_mode,
1685 struct object_id *a_oid, int a_mode,
1686 struct object_id *b_oid, int b_mode,
4f66dade 1687 struct rename_conflict_info *rename_conflict_info)
0c4918d1 1688{
55653a68 1689 const char *reason = _("content");
5b448b85 1690 const char *path1 = NULL, *path2 = NULL;
0c4918d1
EN
1691 struct merge_file_info mfi;
1692 struct diff_filespec one, a, b;
4ab9a157 1693 unsigned df_conflict_remains = 0;
0c4918d1 1694
b4da9d62 1695 if (!o_oid) {
55653a68 1696 reason = _("add/add");
b4da9d62 1697 o_oid = (struct object_id *)&null_oid;
0c4918d1
EN
1698 }
1699 one.path = a.path = b.path = (char *)path;
b4da9d62 1700 oidcpy(&one.oid, o_oid);
0c4918d1 1701 one.mode = o_mode;
b4da9d62 1702 oidcpy(&a.oid, a_oid);
0c4918d1 1703 a.mode = a_mode;
b4da9d62 1704 oidcpy(&b.oid, b_oid);
0c4918d1
EN
1705 b.mode = b_mode;
1706
3c217c07 1707 if (rename_conflict_info) {
3c217c07
EN
1708 struct diff_filepair *pair1 = rename_conflict_info->pair1;
1709
1710 path1 = (o->branch1 == rename_conflict_info->branch1) ?
1711 pair1->two->path : pair1->one->path;
1712 /* If rename_conflict_info->pair2 != NULL, we are in
1713 * RENAME_ONE_FILE_TO_ONE case. Otherwise, we have a
1714 * normal rename.
1715 */
1716 path2 = (rename_conflict_info->pair2 ||
1717 o->branch2 == rename_conflict_info->branch1) ?
1718 pair1->two->path : pair1->one->path;
3c217c07 1719
5423d2e7
DT
1720 if (dir_in_way(path, !o->call_depth,
1721 S_ISGITLINK(pair1->two->mode)))
3c217c07 1722 df_conflict_remains = 1;
4ab9a157 1723 }
3c8a51e8
JS
1724 if (merge_file_special_markers(o, &one, &a, &b,
1725 o->branch1, path1,
1726 o->branch2, path2, &mfi))
1727 return -1;
4ab9a157
EN
1728
1729 if (mfi.clean && !df_conflict_remains &&
b4da9d62 1730 oid_eq(&mfi.oid, a_oid) && mfi.mode == a_mode) {
5b448b85 1731 int path_renamed_outside_HEAD;
55653a68 1732 output(o, 3, _("Skipped %s (merged same as existing)"), path);
5b448b85
EN
1733 /*
1734 * The content merge resulted in the same file contents we
1735 * already had. We can return early if those file contents
1736 * are recorded at the correct path (which may not be true
1737 * if the merge involves a rename).
1738 */
1739 path_renamed_outside_HEAD = !path2 || !strcmp(path, path2);
1740 if (!path_renamed_outside_HEAD) {
bc9204d4 1741 add_cacheinfo(o, mfi.mode, &mfi.oid, path,
d45b7f40 1742 0, (!o->call_depth), 0);
5b448b85
EN
1743 return mfi.clean;
1744 }
1745 } else
55653a68 1746 output(o, 2, _("Auto-merging %s"), path);
0c4918d1
EN
1747
1748 if (!mfi.clean) {
1749 if (S_ISGITLINK(mfi.mode))
55653a68
JX
1750 reason = _("submodule");
1751 output(o, 1, _("CONFLICT (%s): Merge conflict in %s"),
0c4918d1 1752 reason, path);
4f66dade 1753 if (rename_conflict_info && !df_conflict_remains)
bc9204d4 1754 if (update_stages(o, path, &one, &a, &b))
75456f96 1755 return -1;
0c4918d1
EN
1756 }
1757
4ab9a157 1758 if (df_conflict_remains) {
3d6b8e88 1759 char *new_path;
51931bf0
EN
1760 if (o->call_depth) {
1761 remove_file_from_cache(path);
1762 } else {
75456f96 1763 if (!mfi.clean) {
bc9204d4 1764 if (update_stages(o, path, &one, &a, &b))
75456f96
JS
1765 return -1;
1766 } else {
51931bf0
EN
1767 int file_from_stage2 = was_tracked(path);
1768 struct diff_filespec merged;
9b561499 1769 oidcpy(&merged.oid, &mfi.oid);
51931bf0
EN
1770 merged.mode = mfi.mode;
1771
bc9204d4 1772 if (update_stages(o, path, NULL,
75456f96
JS
1773 file_from_stage2 ? &merged : NULL,
1774 file_from_stage2 ? NULL : &merged))
1775 return -1;
51931bf0
EN
1776 }
1777
1778 }
4f66dade 1779 new_path = unique_path(o, path, rename_conflict_info->branch1);
55653a68 1780 output(o, 1, _("Adding as %s instead"), new_path);
75456f96
JS
1781 if (update_file(o, 0, &mfi.oid, mfi.mode, new_path)) {
1782 free(new_path);
1783 return -1;
1784 }
3d6b8e88 1785 free(new_path);
51931bf0 1786 mfi.clean = 0;
75456f96
JS
1787 } else if (update_file(o, mfi.clean, &mfi.oid, mfi.mode, path))
1788 return -1;
0c4918d1 1789 return mfi.clean;
0c4918d1
EN
1790}
1791
9047ebbc 1792/* Per entry merge function */
8a2fce18
MV
1793static int process_entry(struct merge_options *o,
1794 const char *path, struct stage_data *entry)
9047ebbc 1795{
9047ebbc 1796 int clean_merge = 1;
1bc0ab7c 1797 int normalize = o->renormalize;
9047ebbc
MV
1798 unsigned o_mode = entry->stages[1].mode;
1799 unsigned a_mode = entry->stages[2].mode;
1800 unsigned b_mode = entry->stages[3].mode;
b4da9d62 1801 struct object_id *o_oid = stage_oid(&entry->stages[1].oid, o_mode);
1802 struct object_id *a_oid = stage_oid(&entry->stages[2].oid, a_mode);
1803 struct object_id *b_oid = stage_oid(&entry->stages[3].oid, b_mode);
9047ebbc 1804
37348937 1805 entry->processed = 1;
4f66dade
EN
1806 if (entry->rename_conflict_info) {
1807 struct rename_conflict_info *conflict_info = entry->rename_conflict_info;
07413c5a 1808 switch (conflict_info->rename_type) {
882fd11a 1809 case RENAME_NORMAL:
4f66dade 1810 case RENAME_ONE_FILE_TO_ONE:
882fd11a 1811 clean_merge = merge_content(o, path,
b4da9d62 1812 o_oid, o_mode, a_oid, a_mode, b_oid, b_mode,
4f66dade 1813 conflict_info);
882fd11a 1814 break;
3b130adf
EN
1815 case RENAME_DELETE:
1816 clean_merge = 0;
75456f96
JS
1817 if (conflict_rename_delete(o,
1818 conflict_info->pair1,
1819 conflict_info->branch1,
1820 conflict_info->branch2))
1821 clean_merge = -1;
3b130adf 1822 break;
07413c5a 1823 case RENAME_ONE_FILE_TO_TWO:
07413c5a 1824 clean_merge = 0;
75456f96
JS
1825 if (conflict_rename_rename_1to2(o, conflict_info))
1826 clean_merge = -1;
07413c5a 1827 break;
461f5041
EN
1828 case RENAME_TWO_FILES_TO_ONE:
1829 clean_merge = 0;
75456f96
JS
1830 if (conflict_rename_rename_2to1(o, conflict_info))
1831 clean_merge = -1;
07413c5a
EN
1832 break;
1833 default:
1834 entry->processed = 0;
1835 break;
1836 }
b4da9d62 1837 } else if (o_oid && (!a_oid || !b_oid)) {
edd2faf5 1838 /* Case A: Deleted in one */
b4da9d62 1839 if ((!a_oid && !b_oid) ||
bc9204d4
JS
1840 (!b_oid && blob_unchanged(o, o_oid, o_mode, a_oid, a_mode, normalize, path)) ||
1841 (!a_oid && blob_unchanged(o, o_oid, o_mode, b_oid, b_mode, normalize, path))) {
edd2faf5
EN
1842 /* Deleted in both or deleted in one and
1843 * unchanged in the other */
b4da9d62 1844 if (a_oid)
55653a68 1845 output(o, 2, _("Removing %s"), path);
edd2faf5 1846 /* do not touch working file if it did not exist */
b4da9d62 1847 remove_file(o, 1, path, !a_oid);
edd2faf5
EN
1848 } else {
1849 /* Modify/delete; deleted side may have put a directory in the way */
edd2faf5 1850 clean_merge = 0;
75456f96
JS
1851 if (handle_modify_delete(o, path, o_oid, o_mode,
1852 a_oid, a_mode, b_oid, b_mode))
1853 clean_merge = -1;
3d6b8e88 1854 }
b4da9d62 1855 } else if ((!o_oid && a_oid && !b_oid) ||
1856 (!o_oid && !a_oid && b_oid)) {
edd2faf5
EN
1857 /* Case B: Added in one. */
1858 /* [nothing|directory] -> ([nothing|directory], file) */
1859
9c0bbb50
EN
1860 const char *add_branch;
1861 const char *other_branch;
1862 unsigned mode;
b4da9d62 1863 const struct object_id *oid;
9c0bbb50 1864 const char *conf;
37348937 1865
b4da9d62 1866 if (a_oid) {
9c0bbb50
EN
1867 add_branch = o->branch1;
1868 other_branch = o->branch2;
1869 mode = a_mode;
b4da9d62 1870 oid = a_oid;
55653a68 1871 conf = _("file/directory");
9c0bbb50
EN
1872 } else {
1873 add_branch = o->branch2;
1874 other_branch = o->branch1;
1875 mode = b_mode;
b4da9d62 1876 oid = b_oid;
55653a68 1877 conf = _("directory/file");
9c0bbb50 1878 }
5423d2e7
DT
1879 if (dir_in_way(path, !o->call_depth,
1880 S_ISGITLINK(a_mode))) {
3d6b8e88 1881 char *new_path = unique_path(o, path, add_branch);
9c0bbb50 1882 clean_merge = 0;
55653a68
JX
1883 output(o, 1, _("CONFLICT (%s): There is a directory with name %s in %s. "
1884 "Adding %s as %s"),
9c0bbb50 1885 conf, path, other_branch, path, new_path);
75456f96
JS
1886 if (update_file(o, 0, oid, mode, new_path))
1887 clean_merge = -1;
1888 else if (o->call_depth)
7b1c610f 1889 remove_file_from_cache(path);
3d6b8e88 1890 free(new_path);
9c0bbb50 1891 } else {
55653a68 1892 output(o, 2, _("Adding %s"), path);
35a74abf 1893 /* do not overwrite file if already present */
75456f96
JS
1894 if (update_file_flags(o, oid, mode, path, 1, !a_oid))
1895 clean_merge = -1;
9c0bbb50 1896 }
b4da9d62 1897 } else if (a_oid && b_oid) {
edd2faf5
EN
1898 /* Case C: Added in both (check for same permissions) and */
1899 /* case D: Modified in both, but differently. */
4f66dade 1900 clean_merge = merge_content(o, path,
b4da9d62 1901 o_oid, o_mode, a_oid, a_mode, b_oid, b_mode,
edd2faf5 1902 NULL);
b4da9d62 1903 } else if (!o_oid && !a_oid && !b_oid) {
edd2faf5
EN
1904 /*
1905 * this entry was deleted altogether. a_mode == 0 means
1906 * we had that path and want to actively remove it.
1907 */
1908 remove_file(o, 1, path, !a_mode);
1909 } else
7e97e100 1910 die("BUG: fatal merge failure, shouldn't happen.");
37348937
EN
1911
1912 return clean_merge;
1913}
1914
8a2fce18
MV
1915int merge_trees(struct merge_options *o,
1916 struct tree *head,
9047ebbc
MV
1917 struct tree *merge,
1918 struct tree *common,
9047ebbc
MV
1919 struct tree **result)
1920{
1921 int code, clean;
1922
85e51b78
JH
1923 if (o->subtree_shift) {
1924 merge = shift_tree_object(head, merge, o->subtree_shift);
1925 common = shift_tree_object(head, common, o->subtree_shift);
9047ebbc
MV
1926 }
1927
b4da9d62 1928 if (oid_eq(&common->object.oid, &merge->object.oid)) {
55653a68 1929 output(o, 0, _("Already up-to-date!"));
9047ebbc
MV
1930 *result = head;
1931 return 1;
1932 }
1933
b7fa51da 1934 code = git_merge_trees(o->call_depth, common, head, merge);
9047ebbc 1935
fadd069d
JH
1936 if (code != 0) {
1937 if (show(o, 4) || o->call_depth)
bc9204d4 1938 err(o, _("merging of trees %s and %s failed"),
f2fd0760 1939 oid_to_hex(&head->object.oid),
1940 oid_to_hex(&merge->object.oid));
6003303a 1941 return -1;
fadd069d 1942 }
9047ebbc
MV
1943
1944 if (unmerged_cache()) {
1945 struct string_list *entries, *re_head, *re_merge;
1946 int i;
696ee23c
MV
1947 string_list_clear(&o->current_file_set, 1);
1948 string_list_clear(&o->current_directory_set, 1);
1949 get_files_dirs(o, head);
1950 get_files_dirs(o, merge);
9047ebbc
MV
1951
1952 entries = get_unmerged();
70cc3d36 1953 record_df_conflict_files(o, entries);
8a2fce18
MV
1954 re_head = get_renames(o, head, common, head, merge, entries);
1955 re_merge = get_renames(o, merge, common, head, merge, entries);
1956 clean = process_renames(o, re_head, re_merge);
75456f96
JS
1957 if (clean < 0)
1958 return clean;
edd2faf5 1959 for (i = entries->nr-1; 0 <= i; i--) {
9047ebbc
MV
1960 const char *path = entries->items[i].string;
1961 struct stage_data *e = entries->items[i].util;
75456f96
JS
1962 if (!e->processed) {
1963 int ret = process_entry(o, path, e);
1964 if (!ret)
1965 clean = 0;
1966 else if (ret < 0)
1967 return ret;
1968 }
9047ebbc 1969 }
7edba4c4
JH
1970 for (i = 0; i < entries->nr; i++) {
1971 struct stage_data *e = entries->items[i].util;
1972 if (!e->processed)
7e97e100 1973 die("BUG: unprocessed path??? %s",
7edba4c4
JH
1974 entries->items[i].string);
1975 }
9047ebbc
MV
1976
1977 string_list_clear(re_merge, 0);
1978 string_list_clear(re_head, 0);
1979 string_list_clear(entries, 1);
1980
473091e2
SB
1981 free(re_merge);
1982 free(re_head);
1983 free(entries);
9047ebbc
MV
1984 }
1985 else
1986 clean = 1;
1987
fbc87eb5
JS
1988 if (o->call_depth && !(*result = write_tree_from_memory(o)))
1989 return -1;
9047ebbc
MV
1990
1991 return clean;
1992}
1993
1994static struct commit_list *reverse_commit_list(struct commit_list *list)
1995{
1996 struct commit_list *next = NULL, *current, *backup;
1997 for (current = list; current; current = backup) {
1998 backup = current->next;
1999 current->next = next;
2000 next = current;
2001 }
2002 return next;
2003}
2004
2005/*
2006 * Merge the commits h1 and h2, return the resulting virtual
2007 * commit object and a flag indicating the cleanness of the merge.
2008 */
8a2fce18
MV
2009int merge_recursive(struct merge_options *o,
2010 struct commit *h1,
9047ebbc 2011 struct commit *h2,
9047ebbc
MV
2012 struct commit_list *ca,
2013 struct commit **result)
2014{
2015 struct commit_list *iter;
2016 struct commit *merged_common_ancestors;
2017 struct tree *mrtree = mrtree;
2018 int clean;
2019
8a2fce18 2020 if (show(o, 4)) {
55653a68 2021 output(o, 4, _("Merging:"));
5033639c
MV
2022 output_commit_title(o, h1);
2023 output_commit_title(o, h2);
9047ebbc
MV
2024 }
2025
2026 if (!ca) {
2ce406cc 2027 ca = get_merge_bases(h1, h2);
9047ebbc
MV
2028 ca = reverse_commit_list(ca);
2029 }
2030
8a2fce18 2031 if (show(o, 5)) {
e0453cd8
RT
2032 unsigned cnt = commit_list_count(ca);
2033
2034 output(o, 5, Q_("found %u common ancestor:",
2035 "found %u common ancestors:", cnt), cnt);
9047ebbc 2036 for (iter = ca; iter; iter = iter->next)
5033639c 2037 output_commit_title(o, iter->item);
9047ebbc
MV
2038 }
2039
2040 merged_common_ancestors = pop_commit(&ca);
2041 if (merged_common_ancestors == NULL) {
03f622c8
JN
2042 /* if there is no common ancestor, use an empty tree */
2043 struct tree *tree;
9047ebbc 2044
cba595bd 2045 tree = lookup_tree(EMPTY_TREE_SHA1_BIN);
9047ebbc
MV
2046 merged_common_ancestors = make_virtual_commit(tree, "ancestor");
2047 }
2048
2049 for (iter = ca; iter; iter = iter->next) {
8a2fce18 2050 const char *saved_b1, *saved_b2;
5033639c 2051 o->call_depth++;
9047ebbc
MV
2052 /*
2053 * When the merge fails, the result contains files
2054 * with conflict markers. The cleanness flag is
de8946de
JS
2055 * ignored (unless indicating an error), it was never
2056 * actually used, as result of merge_trees has always
2057 * overwritten it: the committed "conflicts" were
2058 * already resolved.
9047ebbc
MV
2059 */
2060 discard_cache();
8a2fce18
MV
2061 saved_b1 = o->branch1;
2062 saved_b2 = o->branch2;
2063 o->branch1 = "Temporary merge branch 1";
2064 o->branch2 = "Temporary merge branch 2";
de8946de
JS
2065 if (merge_recursive(o, merged_common_ancestors, iter->item,
2066 NULL, &merged_common_ancestors) < 0)
2067 return -1;
8a2fce18
MV
2068 o->branch1 = saved_b1;
2069 o->branch2 = saved_b2;
5033639c 2070 o->call_depth--;
9047ebbc
MV
2071
2072 if (!merged_common_ancestors)
bc9204d4 2073 return err(o, _("merge returned no commit"));
9047ebbc
MV
2074 }
2075
2076 discard_cache();
b7fa51da 2077 if (!o->call_depth)
9047ebbc 2078 read_cache();
9047ebbc 2079
7ca56aa0 2080 o->ancestor = "merged common ancestors";
8a2fce18
MV
2081 clean = merge_trees(o, h1->tree, h2->tree, merged_common_ancestors->tree,
2082 &mrtree);
6999bc70
JS
2083 if (clean < 0) {
2084 flush_output(o);
de8946de 2085 return clean;
6999bc70 2086 }
9047ebbc 2087
b7fa51da 2088 if (o->call_depth) {
9047ebbc
MV
2089 *result = make_virtual_commit(mrtree, "merged tree");
2090 commit_list_insert(h1, &(*result)->parents);
2091 commit_list_insert(h2, &(*result)->parents->next);
2092 }
c7d84924 2093 flush_output(o);
548009c0
JS
2094 if (!o->call_depth && o->buffer_output < 2)
2095 strbuf_release(&o->obuf);
f31027c9
JH
2096 if (show(o, 2))
2097 diff_warn_rename_limit("merge.renamelimit",
2098 o->needed_rename_limit, 0);
9047ebbc
MV
2099 return clean;
2100}
2101
4e8161a8 2102static struct commit *get_ref(const struct object_id *oid, const char *name)
73118f89
SB
2103{
2104 struct object *object;
2105
4e8161a8 2106 object = deref_tag(parse_object(oid->hash), name, strlen(name));
73118f89
SB
2107 if (!object)
2108 return NULL;
2109 if (object->type == OBJ_TREE)
2110 return make_virtual_commit((struct tree*)object, name);
2111 if (object->type != OBJ_COMMIT)
2112 return NULL;
2113 if (parse_commit((struct commit *)object))
2114 return NULL;
2115 return (struct commit *)object;
2116}
2117
8a2fce18 2118int merge_recursive_generic(struct merge_options *o,
4e8161a8 2119 const struct object_id *head,
2120 const struct object_id *merge,
8a2fce18 2121 int num_base_list,
4e8161a8 2122 const struct object_id **base_list,
8a2fce18 2123 struct commit **result)
73118f89 2124{
03b86647 2125 int clean;
73118f89 2126 struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
8a2fce18
MV
2127 struct commit *head_commit = get_ref(head, o->branch1);
2128 struct commit *next_commit = get_ref(merge, o->branch2);
73118f89
SB
2129 struct commit_list *ca = NULL;
2130
2131 if (base_list) {
2132 int i;
8a2fce18 2133 for (i = 0; i < num_base_list; ++i) {
73118f89 2134 struct commit *base;
4e8161a8 2135 if (!(base = get_ref(base_list[i], oid_to_hex(base_list[i]))))
bc9204d4 2136 return err(o, _("Could not parse object '%s'"),
4e8161a8 2137 oid_to_hex(base_list[i]));
73118f89
SB
2138 commit_list_insert(base, &ca);
2139 }
2140 }
2141
b3e83cc7 2142 hold_locked_index(lock, LOCK_DIE_ON_ERROR);
8a2fce18
MV
2143 clean = merge_recursive(o, head_commit, next_commit, ca,
2144 result);
de8946de
JS
2145 if (clean < 0)
2146 return clean;
2147
73118f89 2148 if (active_cache_changed &&
03b86647 2149 write_locked_index(&the_index, lock, COMMIT_LOCK))
bc9204d4 2150 return err(o, _("Unable to write index."));
73118f89
SB
2151
2152 return clean ? 0 : 1;
2153}
2154
0e7bcb1b 2155static void merge_recursive_config(struct merge_options *o)
9047ebbc 2156{
0e7bcb1b
TA
2157 git_config_get_int("merge.verbosity", &o->verbosity);
2158 git_config_get_int("diff.renamelimit", &o->diff_rename_limit);
2159 git_config_get_int("merge.renamelimit", &o->merge_rename_limit);
2160 git_config(git_xmerge_config, NULL);
9047ebbc
MV
2161}
2162
8a2fce18 2163void init_merge_options(struct merge_options *o)
9047ebbc 2164{
8a2fce18
MV
2165 memset(o, 0, sizeof(struct merge_options));
2166 o->verbosity = 2;
2167 o->buffer_output = 1;
2168 o->diff_rename_limit = -1;
2169 o->merge_rename_limit = -1;
7610fa57 2170 o->renormalize = 0;
d2b11eca 2171 o->detect_rename = 1;
0e7bcb1b 2172 merge_recursive_config(o);
9047ebbc 2173 if (getenv("GIT_MERGE_VERBOSITY"))
8a2fce18 2174 o->verbosity =
9047ebbc 2175 strtol(getenv("GIT_MERGE_VERBOSITY"), NULL, 10);
8a2fce18
MV
2176 if (o->verbosity >= 5)
2177 o->buffer_output = 0;
c7d84924 2178 strbuf_init(&o->obuf, 0);
f93d7c6f
TA
2179 string_list_init(&o->current_file_set, 1);
2180 string_list_init(&o->current_directory_set, 1);
2181 string_list_init(&o->df_conflict_file_set, 1);
9047ebbc 2182}
635a7bb1
JN
2183
2184int parse_merge_opt(struct merge_options *o, const char *s)
2185{
95b567c7
JK
2186 const char *arg;
2187
635a7bb1
JN
2188 if (!s || !*s)
2189 return -1;
2190 if (!strcmp(s, "ours"))
2191 o->recursive_variant = MERGE_RECURSIVE_OURS;
2192 else if (!strcmp(s, "theirs"))
2193 o->recursive_variant = MERGE_RECURSIVE_THEIRS;
2194 else if (!strcmp(s, "subtree"))
2195 o->subtree_shift = "";
95b567c7
JK
2196 else if (skip_prefix(s, "subtree=", &arg))
2197 o->subtree_shift = arg;
58a1ece4 2198 else if (!strcmp(s, "patience"))
307ab20b 2199 o->xdl_opts = DIFF_WITH_ALG(o, PATIENCE_DIFF);
8c912eea 2200 else if (!strcmp(s, "histogram"))
307ab20b 2201 o->xdl_opts = DIFF_WITH_ALG(o, HISTOGRAM_DIFF);
95b567c7
JK
2202 else if (skip_prefix(s, "diff-algorithm=", &arg)) {
2203 long value = parse_algorithm_value(arg);
07924d4d
MP
2204 if (value < 0)
2205 return -1;
2206 /* clear out previous settings */
2207 DIFF_XDL_CLR(o, NEED_MINIMAL);
2208 o->xdl_opts &= ~XDF_DIFF_ALGORITHM_MASK;
2209 o->xdl_opts |= value;
2210 }
4e5dd044 2211 else if (!strcmp(s, "ignore-space-change"))
c2d4b4cd 2212 DIFF_XDL_SET(o, IGNORE_WHITESPACE_CHANGE);
4e5dd044 2213 else if (!strcmp(s, "ignore-all-space"))
c2d4b4cd 2214 DIFF_XDL_SET(o, IGNORE_WHITESPACE);
4e5dd044 2215 else if (!strcmp(s, "ignore-space-at-eol"))
c2d4b4cd 2216 DIFF_XDL_SET(o, IGNORE_WHITESPACE_AT_EOL);
635a7bb1
JN
2217 else if (!strcmp(s, "renormalize"))
2218 o->renormalize = 1;
2219 else if (!strcmp(s, "no-renormalize"))
2220 o->renormalize = 0;
d2b11eca
FGA
2221 else if (!strcmp(s, "no-renames"))
2222 o->detect_rename = 0;
87892f60 2223 else if (!strcmp(s, "find-renames")) {
1b47ad16 2224 o->detect_rename = 1;
87892f60
FGA
2225 o->rename_score = 0;
2226 }
1b47ad16
FGA
2227 else if (skip_prefix(s, "find-renames=", &arg) ||
2228 skip_prefix(s, "rename-threshold=", &arg)) {
95b567c7 2229 if ((o->rename_score = parse_rename_score(&arg)) == -1 || *arg != 0)
10ae7526 2230 return -1;
d2b11eca 2231 o->detect_rename = 1;
10ae7526 2232 }
635a7bb1
JN
2233 else
2234 return -1;
2235 return 0;
2236}