merge-recursive: combine error handling
[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"
b2141fc1 7#include "config.h"
1c4b6604 8#include "advice.h"
697cc8ef 9#include "lockfile.h"
9047ebbc 10#include "cache-tree.h"
cbd53a21 11#include "object-store.h"
109cd76d 12#include "repository.h"
9047ebbc
MV
13#include "commit.h"
14#include "blob.h"
15#include "builtin.h"
16#include "tree-walk.h"
17#include "diff.h"
18#include "diffcore.h"
19#include "tag.h"
14ba97f8 20#include "alloc.h"
9047ebbc
MV
21#include "unpack-trees.h"
22#include "string-list.h"
23#include "xdiff-interface.h"
24#include "ll-merge.h"
9047ebbc
MV
25#include "attr.h"
26#include "merge-recursive.h"
9800c0df 27#include "dir.h"
68d03e4a 28#include "submodule.h"
18cfc088 29#include "revision.h"
64043556 30#include "commit-reach.h"
9047ebbc 31
fc65b00d
KW
32struct path_hashmap_entry {
33 struct hashmap_entry e;
34 char path[FLEX_ARRAY];
35};
36
37static int path_hashmap_cmp(const void *cmp_data,
38 const void *entry,
39 const void *entry_or_key,
40 const void *keydata)
41{
42 const struct path_hashmap_entry *a = entry;
43 const struct path_hashmap_entry *b = entry_or_key;
44 const char *key = keydata;
45
46 if (ignore_case)
47 return strcasecmp(a->path, key ? key : b->path);
48 else
49 return strcmp(a->path, key ? key : b->path);
50}
51
52static unsigned int path_hash(const char *path)
53{
54 return ignore_case ? strihash(path) : strhash(path);
55}
56
7fe40b88
EN
57static struct dir_rename_entry *dir_rename_find_entry(struct hashmap *hashmap,
58 char *dir)
59{
60 struct dir_rename_entry key;
61
62 if (dir == NULL)
63 return NULL;
64 hashmap_entry_init(&key, strhash(dir));
65 key.dir = dir;
66 return hashmap_get(hashmap, &key, NULL);
67}
68
69static int dir_rename_cmp(const void *unused_cmp_data,
70 const void *entry,
71 const void *entry_or_key,
72 const void *unused_keydata)
73{
74 const struct dir_rename_entry *e1 = entry;
75 const struct dir_rename_entry *e2 = entry_or_key;
76
77 return strcmp(e1->dir, e2->dir);
78}
79
80static void dir_rename_init(struct hashmap *map)
81{
82 hashmap_init(map, dir_rename_cmp, NULL, 0);
83}
84
85static void dir_rename_entry_init(struct dir_rename_entry *entry,
86 char *directory)
87{
88 hashmap_entry_init(entry, strhash(directory));
89 entry->dir = directory;
90 entry->non_unique_new_dir = 0;
91 strbuf_init(&entry->new_dir, 0);
92 string_list_init(&entry->possible_new_dirs, 0);
93}
94
e95ab70a
EN
95static struct collision_entry *collision_find_entry(struct hashmap *hashmap,
96 char *target_file)
97{
98 struct collision_entry key;
99
100 hashmap_entry_init(&key, strhash(target_file));
101 key.target_file = target_file;
102 return hashmap_get(hashmap, &key, NULL);
103}
104
105static int collision_cmp(void *unused_cmp_data,
106 const struct collision_entry *e1,
107 const struct collision_entry *e2,
108 const void *unused_keydata)
109{
110 return strcmp(e1->target_file, e2->target_file);
111}
112
113static void collision_init(struct hashmap *map)
114{
115 hashmap_init(map, (hashmap_cmp_fn) collision_cmp, NULL, 0);
116}
117
bc9204d4
JS
118static void flush_output(struct merge_options *o)
119{
f1e2426b 120 if (o->buffer_output < 2 && o->obuf.len) {
bc9204d4
JS
121 fputs(o->obuf.buf, stdout);
122 strbuf_reset(&o->obuf);
123 }
124}
125
126static int err(struct merge_options *o, const char *err, ...)
127{
128 va_list params;
129
f1e2426b
JS
130 if (o->buffer_output < 2)
131 flush_output(o);
132 else {
133 strbuf_complete(&o->obuf, '\n');
134 strbuf_addstr(&o->obuf, "error: ");
135 }
bc9204d4
JS
136 va_start(params, err);
137 strbuf_vaddf(&o->obuf, err, params);
138 va_end(params);
f1e2426b
JS
139 if (o->buffer_output > 1)
140 strbuf_addch(&o->obuf, '\n');
141 else {
142 error("%s", o->obuf.buf);
143 strbuf_reset(&o->obuf);
144 }
bc9204d4
JS
145
146 return -1;
147}
148
85e51b78
JH
149static struct tree *shift_tree_object(struct tree *one, struct tree *two,
150 const char *subtree_shift)
9047ebbc 151{
f2fd0760 152 struct object_id shifted;
9047ebbc 153
85e51b78 154 if (!*subtree_shift) {
82db3d44 155 shift_tree(&one->object.oid, &two->object.oid, &shifted, 0);
85e51b78 156 } else {
82db3d44 157 shift_tree_by(&one->object.oid, &two->object.oid, &shifted,
85e51b78
JH
158 subtree_shift);
159 }
4a7e27e9 160 if (oideq(&two->object.oid, &shifted))
9047ebbc 161 return two;
f86bcc7b 162 return lookup_tree(the_repository, &shifted);
9047ebbc
MV
163}
164
2af202be 165static struct commit *make_virtual_commit(struct tree *tree, const char *comment)
9047ebbc 166{
8ba0e5ec 167 struct commit *commit = alloc_commit_node(the_repository);
ae8e4c9c 168
a2571653 169 set_merge_remote_desc(commit, comment, (struct object *)commit);
891435d5 170 commit->maybe_tree = tree;
9047ebbc
MV
171 commit->object.parsed = 1;
172 return commit;
173}
174
175/*
176 * Since we use get_tree_entry(), which does not put the read object into
177 * the object pool, we cannot rely on a == b.
178 */
b4da9d62 179static int oid_eq(const struct object_id *a, const struct object_id *b)
9047ebbc
MV
180{
181 if (!a && !b)
182 return 2;
4a7e27e9 183 return a && b && oideq(a, b);
9047ebbc
MV
184}
185
25c39363
EN
186enum rename_type {
187 RENAME_NORMAL = 0,
5455c338 188 RENAME_VIA_DIR,
7f867165 189 RENAME_ADD,
25c39363 190 RENAME_DELETE,
4f66dade 191 RENAME_ONE_FILE_TO_ONE,
461f5041
EN
192 RENAME_ONE_FILE_TO_TWO,
193 RENAME_TWO_FILES_TO_ONE
25c39363
EN
194};
195
4f66dade 196struct rename_conflict_info {
25c39363
EN
197 enum rename_type rename_type;
198 struct diff_filepair *pair1;
199 struct diff_filepair *pair2;
200 const char *branch1;
201 const char *branch2;
202 struct stage_data *dst_entry1;
203 struct stage_data *dst_entry2;
232c635f
EN
204 struct diff_filespec ren1_other;
205 struct diff_filespec ren2_other;
25c39363
EN
206};
207
9047ebbc
MV
208/*
209 * Since we want to write the index eventually, we cannot reuse the index
210 * for these (temporary) data.
211 */
9cba13ca
JN
212struct stage_data {
213 struct {
9047ebbc 214 unsigned mode;
fd429e98 215 struct object_id oid;
9047ebbc 216 } stages[4];
4f66dade 217 struct rename_conflict_info *rename_conflict_info;
9047ebbc
MV
218 unsigned processed:1;
219};
220
4f66dade
EN
221static inline void setup_rename_conflict_info(enum rename_type rename_type,
222 struct diff_filepair *pair1,
223 struct diff_filepair *pair2,
224 const char *branch1,
225 const char *branch2,
226 struct stage_data *dst_entry1,
232c635f
EN
227 struct stage_data *dst_entry2,
228 struct merge_options *o,
229 struct stage_data *src_entry1,
230 struct stage_data *src_entry2)
25c39363 231{
7f867165 232 int ostage1 = 0, ostage2;
4f445453
EN
233 struct rename_conflict_info *ci;
234
235 /*
236 * When we have two renames involved, it's easiest to get the
237 * correct things into stage 2 and 3, and to make sure that the
238 * content merge puts HEAD before the other branch if we just
239 * ensure that branch1 == o->branch1. So, simply flip arguments
240 * around if we don't have that.
241 */
242 if (dst_entry2 && branch1 != o->branch1) {
243 setup_rename_conflict_info(rename_type,
244 pair2, pair1,
245 branch2, branch1,
246 dst_entry2, dst_entry1,
247 o,
248 src_entry2, src_entry1);
249 return;
250 }
251
252 ci = xcalloc(1, sizeof(struct rename_conflict_info));
25c39363
EN
253 ci->rename_type = rename_type;
254 ci->pair1 = pair1;
255 ci->branch1 = branch1;
256 ci->branch2 = branch2;
257
258 ci->dst_entry1 = dst_entry1;
4f66dade 259 dst_entry1->rename_conflict_info = ci;
25c39363
EN
260 dst_entry1->processed = 0;
261
262 assert(!pair2 == !dst_entry2);
263 if (dst_entry2) {
264 ci->dst_entry2 = dst_entry2;
265 ci->pair2 = pair2;
4f66dade 266 dst_entry2->rename_conflict_info = ci;
25c39363 267 }
232c635f 268
7f867165
EN
269 /*
270 * For each rename, there could have been
271 * modifications on the side of history where that
272 * file was not renamed.
273 */
274 if (rename_type == RENAME_ADD ||
275 rename_type == RENAME_TWO_FILES_TO_ONE) {
276 ostage1 = o->branch1 == branch1 ? 3 : 2;
232c635f
EN
277
278 ci->ren1_other.path = pair1->one->path;
fd429e98 279 oidcpy(&ci->ren1_other.oid, &src_entry1->stages[ostage1].oid);
232c635f 280 ci->ren1_other.mode = src_entry1->stages[ostage1].mode;
7f867165
EN
281 }
282
283 if (rename_type == RENAME_TWO_FILES_TO_ONE) {
284 ostage2 = ostage1 ^ 1;
232c635f
EN
285
286 ci->ren2_other.path = pair2->one->path;
fd429e98 287 oidcpy(&ci->ren2_other.oid, &src_entry2->stages[ostage2].oid);
232c635f 288 ci->ren2_other.mode = src_entry2->stages[ostage2].mode;
25c39363
EN
289 }
290}
291
8a2fce18 292static int show(struct merge_options *o, int v)
9047ebbc 293{
5033639c 294 return (!o->call_depth && o->verbosity >= v) || o->verbosity >= 5;
9047ebbc
MV
295}
296
28bea9e5 297__attribute__((format (printf, 3, 4)))
8a2fce18 298static void output(struct merge_options *o, int v, const char *fmt, ...)
9047ebbc 299{
9047ebbc
MV
300 va_list ap;
301
8a2fce18 302 if (!show(o, v))
9047ebbc
MV
303 return;
304
415792ed 305 strbuf_addchars(&o->obuf, ' ', o->call_depth * 2);
9047ebbc
MV
306
307 va_start(ap, fmt);
ebeb6090 308 strbuf_vaddf(&o->obuf, fmt, ap);
9047ebbc
MV
309 va_end(ap);
310
294b2680 311 strbuf_addch(&o->obuf, '\n');
8a2fce18 312 if (!o->buffer_output)
c7d84924 313 flush_output(o);
9047ebbc
MV
314}
315
5033639c 316static void output_commit_title(struct merge_options *o, struct commit *commit)
9047ebbc 317{
e2e5ac23
NTND
318 struct merge_remote_desc *desc;
319
dde75cb0 320 strbuf_addchars(&o->obuf, ' ', o->call_depth * 2);
e2e5ac23
NTND
321 desc = merge_remote_util(commit);
322 if (desc)
323 strbuf_addf(&o->obuf, "virtual %s\n", desc->name);
9047ebbc 324 else {
30e677e0 325 strbuf_add_unique_abbrev(&o->obuf, &commit->object.oid,
a94bb683
RS
326 DEFAULT_ABBREV);
327 strbuf_addch(&o->obuf, ' ');
9047ebbc 328 if (parse_commit(commit) != 0)
a22ae753 329 strbuf_addstr(&o->obuf, _("(bad commit)\n"));
9047ebbc 330 else {
49b7120e 331 const char *title;
8597ea3a 332 const char *msg = get_commit_buffer(commit, NULL);
bc6b8fc1 333 int len = find_commit_subject(msg, &title);
49b7120e 334 if (len)
dde75cb0 335 strbuf_addf(&o->obuf, "%.*s\n", len, title);
bc6b8fc1 336 unuse_commit_buffer(commit, msg);
9047ebbc
MV
337 }
338 }
dde75cb0 339 flush_output(o);
9047ebbc
MV
340}
341
bc9204d4 342static int add_cacheinfo(struct merge_options *o,
d90e759f
EN
343 unsigned int mode, const struct object_id *oid,
344 const char *path, int stage, int refresh, int options)
9047ebbc
MV
345{
346 struct cache_entry *ce;
1335d76e
JH
347 int ret;
348
a849735b 349 ce = make_cache_entry(&the_index, mode, oid ? oid : &null_oid, path, stage, 0);
9047ebbc 350 if (!ce)
fd53b7ff 351 return err(o, _("add_cacheinfo failed for path '%s'; merge aborting."), path);
1335d76e
JH
352
353 ret = add_cache_entry(ce, options);
354 if (refresh) {
355 struct cache_entry *nce;
356
768d7965 357 nce = refresh_cache_entry(&the_index, ce, CE_MATCH_REFRESH | CE_MATCH_IGNORE_MISSING);
55e9f0e5 358 if (!nce)
fd53b7ff 359 return err(o, _("add_cacheinfo failed to refresh for path '%s'; merge aborting."), path);
1335d76e
JH
360 if (nce != ce)
361 ret = add_cache_entry(nce, options);
362 }
363 return ret;
9047ebbc
MV
364}
365
9047ebbc
MV
366static void init_tree_desc_from_tree(struct tree_desc *desc, struct tree *tree)
367{
368 parse_tree(tree);
369 init_tree_desc(desc, tree->buffer, tree->size);
370}
371
3f1c1c36
EN
372static int unpack_trees_start(struct merge_options *o,
373 struct tree *common,
374 struct tree *head,
375 struct tree *merge)
9047ebbc
MV
376{
377 int rc;
378 struct tree_desc t[3];
a35edc84 379 struct index_state tmp_index = { NULL };
9047ebbc 380
64b1abe9
EN
381 memset(&o->unpack_opts, 0, sizeof(o->unpack_opts));
382 if (o->call_depth)
383 o->unpack_opts.index_only = 1;
9047ebbc 384 else
64b1abe9
EN
385 o->unpack_opts.update = 1;
386 o->unpack_opts.merge = 1;
387 o->unpack_opts.head_idx = 2;
388 o->unpack_opts.fn = threeway_merge;
389 o->unpack_opts.src_index = &the_index;
a35edc84 390 o->unpack_opts.dst_index = &tmp_index;
6f10a09e 391 o->unpack_opts.aggressive = !merge_detect_rename(o);
64b1abe9 392 setup_unpack_trees_porcelain(&o->unpack_opts, "merge");
9047ebbc
MV
393
394 init_tree_desc_from_tree(t+0, common);
395 init_tree_desc_from_tree(t+1, head);
396 init_tree_desc_from_tree(t+2, merge);
397
64b1abe9 398 rc = unpack_trees(3, t, &o->unpack_opts);
9047ebbc 399 cache_tree_free(&active_cache_tree);
a35edc84 400
64b1abe9 401 /*
a35edc84
EN
402 * Update the_index to match the new results, AFTER saving a copy
403 * in o->orig_index. Update src_index to point to the saved copy.
404 * (verify_uptodate() checks src_index, and the original index is
405 * the one that had the necessary modification timestamps.)
64b1abe9 406 */
a35edc84
EN
407 o->orig_index = the_index;
408 the_index = tmp_index;
409 o->unpack_opts.src_index = &o->orig_index;
410
9047ebbc
MV
411 return rc;
412}
413
3f1c1c36
EN
414static void unpack_trees_finish(struct merge_options *o)
415{
416 discard_index(&o->orig_index);
1c41d280 417 clear_unpack_trees_porcelain(&o->unpack_opts);
3f1c1c36
EN
418}
419
8a2fce18 420struct tree *write_tree_from_memory(struct merge_options *o)
9047ebbc
MV
421{
422 struct tree *result = NULL;
423
424 if (unmerged_cache()) {
425 int i;
19c6a4f8 426 fprintf(stderr, "BUG: There are unmerged index entries:\n");
9047ebbc 427 for (i = 0; i < active_nr; i++) {
9c5e6c80 428 const struct cache_entry *ce = active_cache[i];
9047ebbc 429 if (ce_stage(ce))
c43ba42e 430 fprintf(stderr, "BUG: %d %.*s\n", ce_stage(ce),
19c6a4f8 431 (int)ce_namelen(ce), ce->name);
9047ebbc 432 }
033abf97 433 BUG("unmerged index entries in merge-recursive.c");
9047ebbc
MV
434 }
435
436 if (!active_cache_tree)
437 active_cache_tree = cache_tree();
438
439 if (!cache_tree_fully_valid(active_cache_tree) &&
6003303a 440 cache_tree_update(&the_index, 0) < 0) {
bc9204d4 441 err(o, _("error building trees"));
6003303a
JS
442 return NULL;
443 }
9047ebbc 444
f86bcc7b 445 result = lookup_tree(the_repository, &active_cache_tree->oid);
9047ebbc
MV
446
447 return result;
448}
449
df46d77e 450static int save_files_dirs(const struct object_id *oid,
d90e759f
EN
451 struct strbuf *base, const char *path,
452 unsigned int mode, int stage, void *context)
9047ebbc 453{
fc65b00d 454 struct path_hashmap_entry *entry;
6a0b0b6d 455 int baselen = base->len;
696ee23c
MV
456 struct merge_options *o = context;
457
6a0b0b6d 458 strbuf_addstr(base, path);
9047ebbc 459
fc65b00d
KW
460 FLEX_ALLOC_MEM(entry, path, base->buf, base->len);
461 hashmap_entry_init(entry, path_hash(entry->path));
462 hashmap_add(&o->current_file_dir_set, entry);
9047ebbc 463
6a0b0b6d 464 strbuf_setlen(base, baselen);
d3bee161 465 return (S_ISDIR(mode) ? READ_TREE_RECURSIVE : 0);
9047ebbc
MV
466}
467
ef9c4dc3 468static void get_files_dirs(struct merge_options *o, struct tree *tree)
9047ebbc 469{
f0096c06 470 struct pathspec match_all;
9a087274 471 memset(&match_all, 0, sizeof(match_all));
ef9c4dc3 472 read_tree_recursive(tree, "", 0, 0, &match_all, save_files_dirs, o);
9047ebbc
MV
473}
474
5b047ac0
EN
475static int get_tree_entry_if_blob(const struct object_id *tree,
476 const char *path,
477 struct object_id *hashy,
478 unsigned int *mode_o)
479{
480 int ret;
481
482 ret = get_tree_entry(tree, path, hashy, mode_o);
483 if (S_ISDIR(*mode_o)) {
484 oidcpy(hashy, &null_oid);
485 *mode_o = 0;
486 }
487 return ret;
488}
489
9047ebbc
MV
490/*
491 * Returns an index_entry instance which doesn't have to correspond to
492 * a real cache entry in Git's index.
493 */
494static struct stage_data *insert_stage_data(const char *path,
495 struct tree *o, struct tree *a, struct tree *b,
496 struct string_list *entries)
497{
498 struct string_list_item *item;
499 struct stage_data *e = xcalloc(1, sizeof(struct stage_data));
5b047ac0
EN
500 get_tree_entry_if_blob(&o->object.oid, path,
501 &e->stages[1].oid, &e->stages[1].mode);
502 get_tree_entry_if_blob(&a->object.oid, path,
503 &e->stages[2].oid, &e->stages[2].mode);
504 get_tree_entry_if_blob(&b->object.oid, path,
505 &e->stages[3].oid, &e->stages[3].mode);
78a395d3 506 item = string_list_insert(entries, path);
9047ebbc
MV
507 item->util = e;
508 return e;
509}
510
511/*
512 * Create a dictionary mapping file names to stage_data objects. The
513 * dictionary contains one entry for every path with a non-zero stage entry.
514 */
515static struct string_list *get_unmerged(void)
516{
517 struct string_list *unmerged = xcalloc(1, sizeof(struct string_list));
518 int i;
519
520 unmerged->strdup_strings = 1;
521
522 for (i = 0; i < active_nr; i++) {
523 struct string_list_item *item;
524 struct stage_data *e;
9c5e6c80 525 const struct cache_entry *ce = active_cache[i];
9047ebbc
MV
526 if (!ce_stage(ce))
527 continue;
528
e8c8b713 529 item = string_list_lookup(unmerged, ce->name);
9047ebbc 530 if (!item) {
78a395d3 531 item = string_list_insert(unmerged, ce->name);
9047ebbc
MV
532 item->util = xcalloc(1, sizeof(struct stage_data));
533 }
534 e = item->util;
535 e->stages[ce_stage(ce)].mode = ce->ce_mode;
99d1a986 536 oidcpy(&e->stages[ce_stage(ce)].oid, &ce->oid);
9047ebbc
MV
537 }
538
539 return unmerged;
540}
541
fa6ca111 542static int string_list_df_name_compare(const char *one, const char *two)
ef02b317 543{
fa6ca111
NTND
544 int onelen = strlen(one);
545 int twolen = strlen(two);
f0fd4d05
EN
546 /*
547 * Here we only care that entries for D/F conflicts are
548 * adjacent, in particular with the file of the D/F conflict
549 * appearing before files below the corresponding directory.
550 * The order of the rest of the list is irrelevant for us.
ef02b317 551 *
f0fd4d05
EN
552 * To achieve this, we sort with df_name_compare and provide
553 * the mode S_IFDIR so that D/F conflicts will sort correctly.
554 * We use the mode S_IFDIR for everything else for simplicity,
555 * since in other cases any changes in their order due to
556 * sorting cause no problems for us.
557 */
fa6ca111
NTND
558 int cmp = df_name_compare(one, onelen, S_IFDIR,
559 two, twolen, S_IFDIR);
f0fd4d05
EN
560 /*
561 * Now that 'foo' and 'foo/bar' compare equal, we have to make sure
562 * that 'foo' comes before 'foo/bar'.
ef02b317 563 */
f0fd4d05
EN
564 if (cmp)
565 return cmp;
566 return onelen - twolen;
567}
568
70cc3d36
EN
569static void record_df_conflict_files(struct merge_options *o,
570 struct string_list *entries)
ef02b317 571{
70cc3d36 572 /* If there is a D/F conflict and the file for such a conflict
2d6bad91 573 * currently exists in the working tree, we want to allow it to be
edd2faf5
EN
574 * removed to make room for the corresponding directory if needed.
575 * The files underneath the directories of such D/F conflicts will
576 * be processed before the corresponding file involved in the D/F
577 * conflict. If the D/F directory ends up being removed by the
578 * merge, then we won't have to touch the D/F file. If the D/F
579 * directory needs to be written to the working copy, then the D/F
580 * file will simply be removed (in make_room_for_path()) to make
581 * room for the necessary paths. Note that if both the directory
582 * and the file need to be present, then the D/F file will be
583 * reinstated with a new unique name at the time it is processed.
ef02b317 584 */
af4941d4 585 struct string_list df_sorted_entries = STRING_LIST_INIT_NODUP;
ef02b317 586 const char *last_file = NULL;
c8516500 587 int last_len = 0;
ef02b317
EN
588 int i;
589
0b30e812
EN
590 /*
591 * If we're merging merge-bases, we don't want to bother with
592 * any working directory changes.
593 */
594 if (o->call_depth)
595 return;
596
f0fd4d05 597 /* Ensure D/F conflicts are adjacent in the entries list. */
ef02b317 598 for (i = 0; i < entries->nr; i++) {
f701aae0
EN
599 struct string_list_item *next = &entries->items[i];
600 string_list_append(&df_sorted_entries, next->string)->util =
601 next->util;
602 }
fa6ca111
NTND
603 df_sorted_entries.cmp = string_list_df_name_compare;
604 string_list_sort(&df_sorted_entries);
f0fd4d05 605
70cc3d36 606 string_list_clear(&o->df_conflict_file_set, 1);
f701aae0
EN
607 for (i = 0; i < df_sorted_entries.nr; i++) {
608 const char *path = df_sorted_entries.items[i].string;
ef02b317 609 int len = strlen(path);
f701aae0 610 struct stage_data *e = df_sorted_entries.items[i].util;
ef02b317
EN
611
612 /*
613 * Check if last_file & path correspond to a D/F conflict;
614 * i.e. whether path is last_file+'/'+<something>.
70cc3d36
EN
615 * If so, record that it's okay to remove last_file to make
616 * room for path and friends if needed.
ef02b317
EN
617 */
618 if (last_file &&
619 len > last_len &&
620 memcmp(path, last_file, last_len) == 0 &&
621 path[last_len] == '/') {
70cc3d36 622 string_list_insert(&o->df_conflict_file_set, last_file);
ef02b317
EN
623 }
624
625 /*
626 * Determine whether path could exist as a file in the
627 * working directory as a possible D/F conflict. This
628 * will only occur when it exists in stage 2 as a
629 * file.
630 */
631 if (S_ISREG(e->stages[2].mode) || S_ISLNK(e->stages[2].mode)) {
632 last_file = path;
633 last_len = len;
ef02b317
EN
634 } else {
635 last_file = NULL;
636 }
637 }
f701aae0 638 string_list_clear(&df_sorted_entries, 0);
ef02b317
EN
639}
640
9cba13ca 641struct rename {
9047ebbc 642 struct diff_filepair *pair;
379fc378
EN
643 /*
644 * Purpose of src_entry and dst_entry:
645 *
646 * If 'before' is renamed to 'after' then src_entry will contain
647 * the versions of 'before' from the merge_base, HEAD, and MERGE in
648 * stages 1, 2, and 3; dst_entry will contain the respective
649 * versions of 'after' in corresponding locations. Thus, we have a
650 * total of six modes and oids, though some will be null. (Stage 0
651 * is ignored; we're interested in handling conflicts.)
652 *
653 * Since we don't turn on break-rewrites by default, neither
654 * src_entry nor dst_entry can have all three of their stages have
655 * non-null oids, meaning at most four of the six will be non-null.
656 * Also, since this is a rename, both src_entry and dst_entry will
657 * have at least one non-null oid, meaning at least two will be
658 * non-null. Of the six oids, a typical rename will have three be
659 * non-null. Only two implies a rename/delete, and four implies a
660 * rename/add.
661 */
9047ebbc
MV
662 struct stage_data *src_entry;
663 struct stage_data *dst_entry;
9c0743fe 664 unsigned add_turned_into_rename:1;
9047ebbc
MV
665 unsigned processed:1;
666};
667
bc9204d4
JS
668static int update_stages(struct merge_options *opt, const char *path,
669 const struct diff_filespec *o,
650467cf
EN
670 const struct diff_filespec *a,
671 const struct diff_filespec *b)
9047ebbc 672{
f53d3977
EN
673
674 /*
675 * NOTE: It is usually a bad idea to call update_stages on a path
676 * before calling update_file on that same path, since it can
677 * sometimes lead to spurious "refusing to lose untracked file..."
678 * messages from update_file (via make_room_for path via
679 * would_lose_untracked). Instead, reverse the order of the calls
680 * (executing update_file first and then update_stages).
681 */
650467cf
EN
682 int clear = 1;
683 int options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_SKIP_DFCHECK;
9047ebbc
MV
684 if (clear)
685 if (remove_file_from_cache(path))
686 return -1;
687 if (o)
bc9204d4 688 if (add_cacheinfo(opt, o->mode, &o->oid, path, 1, 0, options))
9047ebbc
MV
689 return -1;
690 if (a)
bc9204d4 691 if (add_cacheinfo(opt, a->mode, &a->oid, path, 2, 0, options))
9047ebbc
MV
692 return -1;
693 if (b)
bc9204d4 694 if (add_cacheinfo(opt, b->mode, &b->oid, path, 3, 0, options))
9047ebbc
MV
695 return -1;
696 return 0;
697}
698
b8ddf164
EN
699static void update_entry(struct stage_data *entry,
700 struct diff_filespec *o,
701 struct diff_filespec *a,
702 struct diff_filespec *b)
2ff739f9 703{
2ff739f9
EN
704 entry->processed = 0;
705 entry->stages[1].mode = o->mode;
706 entry->stages[2].mode = a->mode;
707 entry->stages[3].mode = b->mode;
fd429e98 708 oidcpy(&entry->stages[1].oid, &o->oid);
709 oidcpy(&entry->stages[2].oid, &a->oid);
710 oidcpy(&entry->stages[3].oid, &b->oid);
2ff739f9
EN
711}
712
b7fa51da
MV
713static int remove_file(struct merge_options *o, int clean,
714 const char *path, int no_wd)
9047ebbc 715{
b7fa51da
MV
716 int update_cache = o->call_depth || clean;
717 int update_working_directory = !o->call_depth && !no_wd;
9047ebbc
MV
718
719 if (update_cache) {
720 if (remove_file_from_cache(path))
721 return -1;
722 }
723 if (update_working_directory) {
ae352c7f
DT
724 if (ignore_case) {
725 struct cache_entry *ce;
726 ce = cache_file_exists(path, strlen(path), ignore_case);
4cba2b01 727 if (ce && ce_stage(ce) == 0 && strcmp(path, ce->name))
ae352c7f
DT
728 return 0;
729 }
25755e84 730 if (remove_path(path))
9047ebbc 731 return -1;
9047ebbc
MV
732 }
733 return 0;
734}
735
45bc131d
JK
736/* add a string to a strbuf, but converting "/" to "_" */
737static void add_flattened_path(struct strbuf *out, const char *s)
738{
739 size_t i = out->len;
740 strbuf_addstr(out, s);
741 for (; i < out->len; i++)
742 if (out->buf[i] == '/')
743 out->buf[i] = '_';
744}
745
696ee23c 746static char *unique_path(struct merge_options *o, const char *path, const char *branch)
9047ebbc 747{
fc65b00d 748 struct path_hashmap_entry *entry;
45bc131d 749 struct strbuf newpath = STRBUF_INIT;
9047ebbc 750 int suffix = 0;
45bc131d
JK
751 size_t base_len;
752
753 strbuf_addf(&newpath, "%s~", path);
754 add_flattened_path(&newpath, branch);
755
756 base_len = newpath.len;
fc65b00d
KW
757 while (hashmap_get_from_hash(&o->current_file_dir_set,
758 path_hash(newpath.buf), newpath.buf) ||
8e1b62f1 759 (!o->call_depth && file_exists(newpath.buf))) {
45bc131d
JK
760 strbuf_setlen(&newpath, base_len);
761 strbuf_addf(&newpath, "_%d", suffix++);
762 }
763
fc65b00d
KW
764 FLEX_ALLOC_MEM(entry, path, newpath.buf, newpath.len);
765 hashmap_entry_init(entry, path_hash(entry->path));
766 hashmap_add(&o->current_file_dir_set, entry);
45bc131d 767 return strbuf_detach(&newpath, NULL);
9047ebbc
MV
768}
769
5423d2e7
DT
770/**
771 * Check whether a directory in the index is in the way of an incoming
772 * file. Return 1 if so. If check_working_copy is non-zero, also
773 * check the working directory. If empty_ok is non-zero, also return
774 * 0 in the case where the working-tree dir exists but is empty.
775 */
776static int dir_in_way(const char *path, int check_working_copy, int empty_ok)
f2507b4e 777{
b4600fbe
JK
778 int pos;
779 struct strbuf dirpath = STRBUF_INIT;
f2507b4e
EN
780 struct stat st;
781
b4600fbe
JK
782 strbuf_addstr(&dirpath, path);
783 strbuf_addch(&dirpath, '/');
f2507b4e 784
b4600fbe 785 pos = cache_name_pos(dirpath.buf, dirpath.len);
f2507b4e
EN
786
787 if (pos < 0)
788 pos = -1 - pos;
789 if (pos < active_nr &&
b4600fbe
JK
790 !strncmp(dirpath.buf, active_cache[pos]->name, dirpath.len)) {
791 strbuf_release(&dirpath);
f2507b4e
EN
792 return 1;
793 }
794
b4600fbe 795 strbuf_release(&dirpath);
5423d2e7
DT
796 return check_working_copy && !lstat(path, &st) && S_ISDIR(st.st_mode) &&
797 !(empty_ok && is_empty_dir(path));
f2507b4e
EN
798}
799
1de70dbd
EN
800/*
801 * Returns whether path was tracked in the index before the merge started,
802 * and its oid and mode match the specified values
803 */
804static int was_tracked_and_matches(struct merge_options *o, const char *path,
805 const struct object_id *oid, unsigned mode)
60c91181 806{
1de70dbd
EN
807 int pos = index_name_pos(&o->orig_index, path, strlen(path));
808 struct cache_entry *ce;
809
810 if (0 > pos)
811 /* we were not tracking this path before the merge */
812 return 0;
813
814 /* See if the file we were tracking before matches */
815 ce = o->orig_index.cache[pos];
816 return (oid_eq(&ce->oid, oid) && ce->ce_mode == mode);
817}
818
a35edc84
EN
819/*
820 * Returns whether path was tracked in the index before the merge started
821 */
822static int was_tracked(struct merge_options *o, const char *path)
60c91181 823{
a35edc84 824 int pos = index_name_pos(&o->orig_index, path, strlen(path));
60c91181 825
f8d83fb6 826 if (0 <= pos)
a35edc84 827 /* we were tracking this path before the merge */
f8d83fb6
JS
828 return 1;
829
aacb82de 830 return 0;
60c91181
JH
831}
832
aacb82de 833static int would_lose_untracked(const char *path)
9047ebbc 834{
a35edc84
EN
835 /*
836 * This may look like it can be simplified to:
837 * return !was_tracked(o, path) && file_exists(path)
838 * but it can't. This function needs to know whether path was in
839 * the working tree due to EITHER having been tracked in the index
840 * before the merge OR having been put into the working copy and
841 * index by unpack_trees(). Due to that either-or requirement, we
842 * check the current index instead of the original one.
843 *
844 * Note that we do not need to worry about merge-recursive itself
845 * updating the index after unpack_trees() and before calling this
846 * function, because we strictly require all code paths in
847 * merge-recursive to update the working tree first and the index
848 * second. Doing otherwise would break
849 * update_file()/would_lose_untracked(); see every comment in this
850 * file which mentions "update_stages".
851 */
852 int pos = cache_name_pos(path, strlen(path));
853
854 if (pos < 0)
855 pos = -1 - pos;
856 while (pos < active_nr &&
857 !strcmp(path, active_cache[pos]->name)) {
858 /*
859 * If stage #0, it is definitely tracked.
860 * If it has stage #2 then it was tracked
861 * before this merge started. All other
862 * cases the path was not tracked.
863 */
864 switch (ce_stage(active_cache[pos])) {
865 case 0:
866 case 2:
867 return 0;
868 }
869 pos++;
870 }
871 return file_exists(path);
60c91181
JH
872}
873
64b1abe9
EN
874static int was_dirty(struct merge_options *o, const char *path)
875{
876 struct cache_entry *ce;
877 int dirty = 1;
878
a35edc84 879 if (o->call_depth || !was_tracked(o, path))
64b1abe9
EN
880 return !dirty;
881
277292d5
EN
882 ce = index_file_exists(o->unpack_opts.src_index,
883 path, strlen(path), ignore_case);
884 dirty = verify_uptodate(ce, &o->unpack_opts) != 0;
64b1abe9 885 return dirty;
60c91181
JH
886}
887
ed0148a5 888static int make_room_for_path(struct merge_options *o, const char *path)
9047ebbc 889{
ed0148a5 890 int status, i;
55653a68 891 const char *msg = _("failed to create path '%s'%s");
9047ebbc 892
ed0148a5
EN
893 /* Unlink any D/F conflict files that are in the way */
894 for (i = 0; i < o->df_conflict_file_set.nr; i++) {
895 const char *df_path = o->df_conflict_file_set.items[i].string;
896 size_t pathlen = strlen(path);
897 size_t df_pathlen = strlen(df_path);
898 if (df_pathlen < pathlen &&
899 path[df_pathlen] == '/' &&
900 strncmp(path, df_path, df_pathlen) == 0) {
901 output(o, 3,
55653a68 902 _("Removing %s to make room for subdirectory\n"),
ed0148a5
EN
903 df_path);
904 unlink(df_path);
905 unsorted_string_list_delete_item(&o->df_conflict_file_set,
906 i, 0);
907 break;
908 }
909 }
910
911 /* Make sure leading directories are created */
9047ebbc
MV
912 status = safe_create_leading_directories_const(path);
913 if (status) {
6003303a 914 if (status == SCLD_EXISTS)
9047ebbc 915 /* something else exists */
bc9204d4
JS
916 return err(o, msg, path, _(": perhaps a D/F conflict?"));
917 return err(o, msg, path, "");
9047ebbc
MV
918 }
919
60c91181
JH
920 /*
921 * Do not unlink a file in the work tree if we are not
922 * tracking it.
923 */
924 if (would_lose_untracked(path))
bc9204d4 925 return err(o, _("refusing to lose untracked file at '%s'"),
d90e759f 926 path);
60c91181 927
9047ebbc
MV
928 /* Successful unlink is good.. */
929 if (!unlink(path))
930 return 0;
931 /* .. and so is no existing file */
932 if (errno == ENOENT)
933 return 0;
934 /* .. but not some other error (who really cares what?) */
bc9204d4 935 return err(o, msg, path, _(": perhaps a D/F conflict?"));
9047ebbc
MV
936}
937
75456f96
JS
938static int update_file_flags(struct merge_options *o,
939 const struct object_id *oid,
940 unsigned mode,
941 const char *path,
942 int update_cache,
943 int update_wd)
9047ebbc 944{
6003303a
JS
945 int ret = 0;
946
b7fa51da 947 if (o->call_depth)
9047ebbc
MV
948 update_wd = 0;
949
950 if (update_wd) {
951 enum object_type type;
952 void *buf;
953 unsigned long size;
954
68d03e4a 955 if (S_ISGITLINK(mode)) {
0c44c943
JH
956 /*
957 * We may later decide to recursively descend into
958 * the submodule directory and update its index
959 * and/or work tree, but we do not do that now.
960 */
68d03e4a 961 update_wd = 0;
0c44c943 962 goto update_index;
68d03e4a 963 }
9047ebbc 964
b4f5aca4 965 buf = read_object_file(oid, &type, &size);
9047ebbc 966 if (!buf)
bc9204d4 967 return err(o, _("cannot read object %s '%s'"), oid_to_hex(oid), path);
6003303a 968 if (type != OBJ_BLOB) {
bc9204d4 969 ret = err(o, _("blob expected for %s '%s'"), oid_to_hex(oid), path);
6003303a
JS
970 goto free_buf;
971 }
9047ebbc 972 if (S_ISREG(mode)) {
f285a2d7 973 struct strbuf strbuf = STRBUF_INIT;
7f944e26 974 if (convert_to_working_tree(&the_index, path, buf, size, &strbuf)) {
9047ebbc
MV
975 free(buf);
976 size = strbuf.len;
977 buf = strbuf_detach(&strbuf, NULL);
978 }
979 }
980
ed0148a5 981 if (make_room_for_path(o, path) < 0) {
9047ebbc 982 update_wd = 0;
75456f96 983 goto free_buf;
9047ebbc
MV
984 }
985 if (S_ISREG(mode) || (!has_symlinks && S_ISLNK(mode))) {
986 int fd;
987 if (mode & 0100)
988 mode = 0777;
989 else
990 mode = 0666;
991 fd = open(path, O_WRONLY | O_TRUNC | O_CREAT, mode);
6003303a 992 if (fd < 0) {
bc9204d4
JS
993 ret = err(o, _("failed to open '%s': %s"),
994 path, strerror(errno));
6003303a
JS
995 goto free_buf;
996 }
f633ea2c 997 write_in_full(fd, buf, size);
9047ebbc
MV
998 close(fd);
999 } else if (S_ISLNK(mode)) {
1000 char *lnk = xmemdupz(buf, size);
1001 safe_create_leading_directories_const(path);
1002 unlink(path);
304dcf26 1003 if (symlink(lnk, path))
bc9204d4 1004 ret = err(o, _("failed to symlink '%s': %s"),
d90e759f 1005 path, strerror(errno));
9047ebbc
MV
1006 free(lnk);
1007 } else
bc9204d4
JS
1008 ret = err(o,
1009 _("do not know what to do with %06o %s '%s'"),
1010 mode, oid_to_hex(oid), path);
93665365 1011 free_buf:
9047ebbc
MV
1012 free(buf);
1013 }
93665365 1014update_index:
6003303a 1015 if (!ret && update_cache)
fd53b7ff
EN
1016 if (add_cacheinfo(o, mode, oid, path, 0, update_wd,
1017 ADD_CACHE_OK_TO_ADD))
1018 return -1;
6003303a 1019 return ret;
9047ebbc
MV
1020}
1021
75456f96
JS
1022static int update_file(struct merge_options *o,
1023 int clean,
1024 const struct object_id *oid,
1025 unsigned mode,
1026 const char *path)
9047ebbc 1027{
75456f96 1028 return update_file_flags(o, oid, mode, path, o->call_depth || clean, !o->call_depth);
9047ebbc
MV
1029}
1030
1031/* Low level file merging, update and removal */
1032
9cba13ca 1033struct merge_file_info {
9b561499 1034 struct object_id oid;
9047ebbc
MV
1035 unsigned mode;
1036 unsigned clean:1,
1037 merge:1;
1038};
1039
b7fa51da
MV
1040static int merge_3way(struct merge_options *o,
1041 mmbuffer_t *result_buf,
0c059420
EN
1042 const struct diff_filespec *one,
1043 const struct diff_filespec *a,
1044 const struct diff_filespec *b,
9047ebbc 1045 const char *branch1,
b2a7942b
EN
1046 const char *branch2,
1047 const int extra_marker_size)
9047ebbc
MV
1048{
1049 mmfile_t orig, src1, src2;
712516bc 1050 struct ll_merge_options ll_opts = {0};
4c5868f4 1051 char *base_name, *name1, *name2;
9047ebbc 1052 int merge_status;
8cc5b290 1053
712516bc 1054 ll_opts.renormalize = o->renormalize;
b2a7942b 1055 ll_opts.extra_marker_size = extra_marker_size;
58a1ece4 1056 ll_opts.xdl_opts = o->xdl_opts;
712516bc
JN
1057
1058 if (o->call_depth) {
1059 ll_opts.virtual_ancestor = 1;
1060 ll_opts.variant = 0;
1061 } else {
8cc5b290
AP
1062 switch (o->recursive_variant) {
1063 case MERGE_RECURSIVE_OURS:
712516bc 1064 ll_opts.variant = XDL_MERGE_FAVOR_OURS;
8cc5b290
AP
1065 break;
1066 case MERGE_RECURSIVE_THEIRS:
712516bc 1067 ll_opts.variant = XDL_MERGE_FAVOR_THEIRS;
8cc5b290
AP
1068 break;
1069 default:
712516bc 1070 ll_opts.variant = 0;
8cc5b290
AP
1071 break;
1072 }
1073 }
9047ebbc 1074
4c5868f4
JN
1075 if (strcmp(a->path, b->path) ||
1076 (o->ancestor != NULL && strcmp(a->path, one->path) != 0)) {
1077 base_name = o->ancestor == NULL ? NULL :
4e2d094d
RJ
1078 mkpathdup("%s:%s", o->ancestor, one->path);
1079 name1 = mkpathdup("%s:%s", branch1, a->path);
1080 name2 = mkpathdup("%s:%s", branch2, b->path);
606475f3 1081 } else {
4c5868f4 1082 base_name = o->ancestor == NULL ? NULL :
4e2d094d
RJ
1083 mkpathdup("%s", o->ancestor);
1084 name1 = mkpathdup("%s", branch1);
1085 name2 = mkpathdup("%s", branch2);
606475f3 1086 }
9047ebbc 1087
d449347d 1088 read_mmblob(&orig, &one->oid);
1089 read_mmblob(&src1, &a->oid);
1090 read_mmblob(&src2, &b->oid);
9047ebbc 1091
4c5868f4 1092 merge_status = ll_merge(result_buf, a->path, &orig, base_name,
712516bc 1093 &src1, name1, &src2, name2, &ll_opts);
9047ebbc 1094
4e2d094d 1095 free(base_name);
9047ebbc
MV
1096 free(name1);
1097 free(name2);
1098 free(orig.ptr);
1099 free(src1.ptr);
1100 free(src2.ptr);
1101 return merge_status;
1102}
1103
18cfc088 1104static int find_first_merges(struct object_array *result, const char *path,
d90e759f 1105 struct commit *a, struct commit *b)
18cfc088
SB
1106{
1107 int i, j;
1108 struct object_array merges = OBJECT_ARRAY_INIT;
1109 struct commit *commit;
1110 int contains_another;
1111
1112 char merged_revision[42];
1113 const char *rev_args[] = { "rev-list", "--merges", "--ancestry-path",
1114 "--all", merged_revision, NULL };
1115 struct rev_info revs;
1116 struct setup_revision_opt rev_opts;
1117
1118 memset(result, 0, sizeof(struct object_array));
1119 memset(&rev_opts, 0, sizeof(rev_opts));
1120
1121 /* get all revisions that merge commit a */
1122 xsnprintf(merged_revision, sizeof(merged_revision), "^%s",
d90e759f 1123 oid_to_hex(&a->object.oid));
18cfc088
SB
1124 init_revisions(&revs, NULL);
1125 rev_opts.submodule = path;
1126 /* FIXME: can't handle linked worktrees in submodules yet */
1127 revs.single_worktree = path != NULL;
1128 setup_revisions(ARRAY_SIZE(rev_args)-1, rev_args, &revs, &rev_opts);
1129
1130 /* save all revisions from the above list that contain b */
1131 if (prepare_revision_walk(&revs))
1132 die("revision walk setup failed");
1133 while ((commit = get_revision(&revs)) != NULL) {
1134 struct object *o = &(commit->object);
1135 if (in_merge_bases(b, commit))
1136 add_object_array(o, NULL, &merges);
1137 }
1138 reset_revision_walk();
1139
1140 /* Now we've got all merges that contain a and b. Prune all
1141 * merges that contain another found merge and save them in
1142 * result.
1143 */
1144 for (i = 0; i < merges.nr; i++) {
1145 struct commit *m1 = (struct commit *) merges.objects[i].item;
1146
1147 contains_another = 0;
1148 for (j = 0; j < merges.nr; j++) {
1149 struct commit *m2 = (struct commit *) merges.objects[j].item;
1150 if (i != j && in_merge_bases(m2, m1)) {
1151 contains_another = 1;
1152 break;
1153 }
1154 }
1155
1156 if (!contains_another)
1157 add_object_array(merges.objects[i].item, NULL, result);
1158 }
1159
1160 object_array_clear(&merges);
1161 return result->nr;
1162}
1163
1164static void print_commit(struct commit *commit)
1165{
1166 struct strbuf sb = STRBUF_INIT;
1167 struct pretty_print_context ctx = {0};
1168 ctx.date_mode.type = DATE_NORMAL;
1169 format_commit_message(commit, " %h: %m %s", &sb, &ctx);
1170 fprintf(stderr, "%s\n", sb.buf);
1171 strbuf_release(&sb);
1172}
1173
325f3a8e
SB
1174static int merge_submodule(struct merge_options *o,
1175 struct object_id *result, const char *path,
18cfc088 1176 const struct object_id *base, const struct object_id *a,
325f3a8e 1177 const struct object_id *b)
18cfc088
SB
1178{
1179 struct commit *commit_base, *commit_a, *commit_b;
1180 int parent_count;
1181 struct object_array merges;
1182
1183 int i;
325f3a8e 1184 int search = !o->call_depth;
18cfc088
SB
1185
1186 /* store a in result in case we fail */
1187 oidcpy(result, a);
1188
1189 /* we can not handle deletion conflicts */
1190 if (is_null_oid(base))
1191 return 0;
1192 if (is_null_oid(a))
1193 return 0;
1194 if (is_null_oid(b))
1195 return 0;
1196
1197 if (add_submodule_odb(path)) {
325f3a8e 1198 output(o, 1, _("Failed to merge submodule %s (not checked out)"), path);
18cfc088
SB
1199 return 0;
1200 }
1201
2122f675
SB
1202 if (!(commit_base = lookup_commit_reference(the_repository, base)) ||
1203 !(commit_a = lookup_commit_reference(the_repository, a)) ||
1204 !(commit_b = lookup_commit_reference(the_repository, b))) {
325f3a8e 1205 output(o, 1, _("Failed to merge submodule %s (commits not present)"), path);
18cfc088
SB
1206 return 0;
1207 }
1208
1209 /* check whether both changes are forward */
1210 if (!in_merge_bases(commit_base, commit_a) ||
1211 !in_merge_bases(commit_base, commit_b)) {
325f3a8e 1212 output(o, 1, _("Failed to merge submodule %s (commits don't follow merge-base)"), path);
18cfc088
SB
1213 return 0;
1214 }
1215
1216 /* Case #1: a is contained in b or vice versa */
1217 if (in_merge_bases(commit_a, commit_b)) {
1218 oidcpy(result, b);
76f42125
LM
1219 if (show(o, 3)) {
1220 output(o, 3, _("Fast-forwarding submodule %s to the following commit:"), path);
1221 output_commit_title(o, commit_b);
1222 } else if (show(o, 2))
40aac22b 1223 output(o, 2, _("Fast-forwarding submodule %s"), path);
76f42125
LM
1224 else
1225 ; /* no output */
1226
18cfc088
SB
1227 return 1;
1228 }
1229 if (in_merge_bases(commit_b, commit_a)) {
1230 oidcpy(result, a);
76f42125
LM
1231 if (show(o, 3)) {
1232 output(o, 3, _("Fast-forwarding submodule %s to the following commit:"), path);
1233 output_commit_title(o, commit_a);
1234 } else if (show(o, 2))
40aac22b 1235 output(o, 2, _("Fast-forwarding submodule %s"), path);
76f42125
LM
1236 else
1237 ; /* no output */
1238
18cfc088
SB
1239 return 1;
1240 }
1241
1242 /*
1243 * Case #2: There are one or more merges that contain a and b in
1244 * the submodule. If there is only one, then present it as a
1245 * suggestion to the user, but leave it marked unmerged so the
1246 * user needs to confirm the resolution.
1247 */
1248
1249 /* Skip the search if makes no sense to the calling context. */
1250 if (!search)
1251 return 0;
1252
1253 /* find commit which merges them */
1254 parent_count = find_first_merges(&merges, path, commit_a, commit_b);
1255 switch (parent_count) {
1256 case 0:
325f3a8e 1257 output(o, 1, _("Failed to merge submodule %s (merge following commits not found)"), path);
18cfc088
SB
1258 break;
1259
1260 case 1:
325f3a8e
SB
1261 output(o, 1, _("Failed to merge submodule %s (not fast-forward)"), path);
1262 output(o, 2, _("Found a possible merge resolution for the submodule:\n"));
18cfc088 1263 print_commit((struct commit *) merges.objects[0].item);
325f3a8e 1264 output(o, 2, _(
d90e759f
EN
1265 "If this is correct simply add it to the index "
1266 "for example\n"
1267 "by using:\n\n"
1268 " git update-index --cacheinfo 160000 %s \"%s\"\n\n"
1269 "which will accept this suggestion.\n"),
1270 oid_to_hex(&merges.objects[0].item->oid), path);
18cfc088
SB
1271 break;
1272
1273 default:
325f3a8e 1274 output(o, 1, _("Failed to merge submodule %s (multiple merges found)"), path);
18cfc088
SB
1275 for (i = 0; i < merges.nr; i++)
1276 print_commit((struct commit *) merges.objects[i].item);
1277 }
1278
1279 object_array_clear(&merges);
1280 return 0;
1281}
1282
d9573556
EN
1283static int merge_mode_and_contents(struct merge_options *o,
1284 const struct diff_filespec *one,
1285 const struct diff_filespec *a,
1286 const struct diff_filespec *b,
1287 const char *filename,
1288 const char *branch1,
1289 const char *branch2,
b2a7942b 1290 const int extra_marker_size,
d9573556 1291 struct merge_file_info *result)
9047ebbc 1292{
4f445453
EN
1293 if (o->branch1 != branch1) {
1294 /*
1295 * It's weird getting a reverse merge with HEAD on the bottom
1296 * side of the conflict markers and the other branch on the
1297 * top. Fix that.
1298 */
1299 return merge_mode_and_contents(o, one, b, a,
1300 filename,
b2a7942b
EN
1301 branch2, branch1,
1302 extra_marker_size, result);
4f445453
EN
1303 }
1304
3c8a51e8
JS
1305 result->merge = 0;
1306 result->clean = 1;
9047ebbc
MV
1307
1308 if ((S_IFMT & a->mode) != (S_IFMT & b->mode)) {
3c8a51e8 1309 result->clean = 0;
9047ebbc 1310 if (S_ISREG(a->mode)) {
3c8a51e8
JS
1311 result->mode = a->mode;
1312 oidcpy(&result->oid, &a->oid);
9047ebbc 1313 } else {
3c8a51e8
JS
1314 result->mode = b->mode;
1315 oidcpy(&result->oid, &b->oid);
9047ebbc
MV
1316 }
1317 } else {
b4da9d62 1318 if (!oid_eq(&a->oid, &one->oid) && !oid_eq(&b->oid, &one->oid))
3c8a51e8 1319 result->merge = 1;
9047ebbc
MV
1320
1321 /*
1322 * Merge modes
1323 */
b7fa51da 1324 if (a->mode == b->mode || a->mode == one->mode)
3c8a51e8 1325 result->mode = b->mode;
9047ebbc 1326 else {
3c8a51e8 1327 result->mode = a->mode;
b7fa51da 1328 if (b->mode != one->mode) {
3c8a51e8
JS
1329 result->clean = 0;
1330 result->merge = 1;
9047ebbc
MV
1331 }
1332 }
1333
b4da9d62 1334 if (oid_eq(&a->oid, &b->oid) || oid_eq(&a->oid, &one->oid))
3c8a51e8 1335 oidcpy(&result->oid, &b->oid);
b4da9d62 1336 else if (oid_eq(&b->oid, &one->oid))
3c8a51e8 1337 oidcpy(&result->oid, &a->oid);
9047ebbc
MV
1338 else if (S_ISREG(a->mode)) {
1339 mmbuffer_t result_buf;
6003303a 1340 int ret = 0, merge_status;
9047ebbc 1341
b7fa51da 1342 merge_status = merge_3way(o, &result_buf, one, a, b,
b2a7942b
EN
1343 branch1, branch2,
1344 extra_marker_size);
9047ebbc
MV
1345
1346 if ((merge_status < 0) || !result_buf.ptr)
bc9204d4 1347 ret = err(o, _("Failed to execute internal merge"));
9047ebbc 1348
a09c985e
PO
1349 if (!ret &&
1350 write_object_file(result_buf.ptr, result_buf.size,
1351 blob_type, &result->oid))
bc9204d4
JS
1352 ret = err(o, _("Unable to add %s to database"),
1353 a->path);
9047ebbc
MV
1354
1355 free(result_buf.ptr);
6003303a
JS
1356 if (ret)
1357 return ret;
3c8a51e8 1358 result->clean = (merge_status == 0);
9047ebbc 1359 } else if (S_ISGITLINK(a->mode)) {
325f3a8e 1360 result->clean = merge_submodule(o, &result->oid,
d90e759f
EN
1361 one->path,
1362 &one->oid,
1363 &a->oid,
1364 &b->oid);
9047ebbc 1365 } else if (S_ISLNK(a->mode)) {
fd48b464
JH
1366 switch (o->recursive_variant) {
1367 case MERGE_RECURSIVE_NORMAL:
1368 oidcpy(&result->oid, &a->oid);
1369 if (!oid_eq(&a->oid, &b->oid))
1370 result->clean = 0;
1371 break;
1372 case MERGE_RECURSIVE_OURS:
1373 oidcpy(&result->oid, &a->oid);
1374 break;
1375 case MERGE_RECURSIVE_THEIRS:
1376 oidcpy(&result->oid, &b->oid);
1377 break;
1378 }
ef1177d1 1379 } else
033abf97 1380 BUG("unsupported object type in the tree");
9047ebbc
MV
1381 }
1382
05cf21eb
EN
1383 if (result->merge)
1384 output(o, 2, _("Auto-merging %s"), filename);
1385
3c8a51e8 1386 return 0;
9047ebbc
MV
1387}
1388
8ebe7b05
EN
1389static int handle_rename_via_dir(struct merge_options *o,
1390 struct diff_filepair *pair,
1391 const char *rename_branch,
1392 const char *other_branch)
9c0743fe 1393{
5455c338
EN
1394 /*
1395 * Handle file adds that need to be renamed due to directory rename
1396 * detection. This differs from handle_rename_normal, because
1397 * there is no content merge to do; just move the file into the
1398 * desired final location.
1399 */
9c0743fe
EN
1400 const struct diff_filespec *dest = pair->two;
1401
79c47598
EN
1402 if (!o->call_depth && would_lose_untracked(dest->path)) {
1403 char *alt_path = unique_path(o, dest->path, rename_branch);
1404
1405 output(o, 1, _("Error: Refusing to lose untracked file at %s; "
1406 "writing to %s instead."),
1407 dest->path, alt_path);
1408 /*
1409 * Write the file in worktree at alt_path, but not in the
1410 * index. Instead, write to dest->path for the index but
1411 * only at the higher appropriate stage.
1412 */
1413 if (update_file(o, 0, &dest->oid, dest->mode, alt_path))
1414 return -1;
1415 free(alt_path);
1416 return update_stages(o, dest->path, NULL,
1417 rename_branch == o->branch1 ? dest : NULL,
1418 rename_branch == o->branch1 ? NULL : dest);
1419 }
1420
1421 /* Update dest->path both in index and in worktree */
9c0743fe
EN
1422 if (update_file(o, 1, &dest->oid, dest->mode, dest->path))
1423 return -1;
1424 return 0;
6bdaead1
EN
1425}
1426
75456f96 1427static int handle_change_delete(struct merge_options *o,
d90e759f
EN
1428 const char *path, const char *old_path,
1429 const struct object_id *o_oid, int o_mode,
1430 const struct object_id *changed_oid,
1431 int changed_mode,
1432 const char *change_branch,
1433 const char *delete_branch,
1434 const char *change, const char *change_past)
b7033252 1435{
b26d87f2
MM
1436 char *alt_path = NULL;
1437 const char *update_path = path;
75456f96 1438 int ret = 0;
b26d87f2 1439
79c47598
EN
1440 if (dir_in_way(path, !o->call_depth, 0) ||
1441 (!o->call_depth && would_lose_untracked(path))) {
b26d87f2 1442 update_path = alt_path = unique_path(o, path, change_branch);
b7033252
EN
1443 }
1444
1445 if (o->call_depth) {
1446 /*
1447 * We cannot arbitrarily accept either a_sha or b_sha as
1448 * correct; since there is no true "middle point" between
1449 * them, simply reuse the base version for virtual merge base.
1450 */
75456f96
JS
1451 ret = remove_file_from_cache(path);
1452 if (!ret)
b26d87f2 1453 ret = update_file(o, 0, o_oid, o_mode, update_path);
b7033252 1454 } else {
5b26c3c9
EN
1455 /*
1456 * Despite the four nearly duplicate messages and argument
1457 * lists below and the ugliness of the nested if-statements,
1458 * having complete messages makes the job easier for
1459 * translators.
1460 *
1461 * The slight variance among the cases is due to the fact
1462 * that:
1463 * 1) directory/file conflicts (in effect if
1464 * !alt_path) could cause us to need to write the
1465 * file to a different path.
1466 * 2) renames (in effect if !old_path) could mean that
1467 * there are two names for the path that the user
1468 * may know the file by.
1469 */
b26d87f2
MM
1470 if (!alt_path) {
1471 if (!old_path) {
1472 output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1473 "and %s in %s. Version %s of %s left in tree."),
1474 change, path, delete_branch, change_past,
1475 change_branch, change_branch, path);
1476 } else {
1477 output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1478 "and %s to %s in %s. Version %s of %s left in tree."),
1479 change, old_path, delete_branch, change_past, path,
1480 change_branch, change_branch, path);
1481 }
55653a68 1482 } else {
b26d87f2
MM
1483 if (!old_path) {
1484 output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1485 "and %s in %s. Version %s of %s left in tree at %s."),
1486 change, path, delete_branch, change_past,
1487 change_branch, change_branch, path, alt_path);
1488 } else {
1489 output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1490 "and %s to %s in %s. Version %s of %s left in tree at %s."),
1491 change, old_path, delete_branch, change_past, path,
1492 change_branch, change_branch, path, alt_path);
1493 }
55653a68 1494 }
35a74abf 1495 /*
b26d87f2
MM
1496 * No need to call update_file() on path when change_branch ==
1497 * o->branch1 && !alt_path, since that would needlessly touch
1498 * path. We could call update_file_flags() with update_cache=0
1499 * and update_wd=0, but that's a no-op.
35a74abf 1500 */
b26d87f2
MM
1501 if (change_branch != o->branch1 || alt_path)
1502 ret = update_file(o, 0, changed_oid, changed_mode, update_path);
b7033252 1503 }
b26d87f2 1504 free(alt_path);
75456f96
JS
1505
1506 return ret;
b7033252
EN
1507}
1508
8ebe7b05
EN
1509static int handle_rename_delete(struct merge_options *o,
1510 struct diff_filepair *pair,
1511 const char *rename_branch,
1512 const char *delete_branch)
9047ebbc 1513{
e03acb8b
EN
1514 const struct diff_filespec *orig = pair->one;
1515 const struct diff_filespec *dest = pair->two;
6ef2cb00 1516
75456f96
JS
1517 if (handle_change_delete(o,
1518 o->call_depth ? orig->path : dest->path,
b26d87f2 1519 o->call_depth ? NULL : orig->path,
75456f96 1520 &orig->oid, orig->mode,
b26d87f2
MM
1521 &dest->oid, dest->mode,
1522 rename_branch, delete_branch,
75456f96
JS
1523 _("rename"), _("renamed")))
1524 return -1;
e03acb8b 1525
75456f96
JS
1526 if (o->call_depth)
1527 return remove_file_from_cache(dest->path);
1528 else
bc9204d4 1529 return update_stages(o, dest->path, NULL,
75456f96
JS
1530 rename_branch == o->branch1 ? dest : NULL,
1531 rename_branch == o->branch1 ? NULL : dest);
6ef2cb00
EN
1532}
1533
1ac91b32
EN
1534static struct diff_filespec *filespec_from_entry(struct diff_filespec *target,
1535 struct stage_data *entry,
1536 int stage)
9047ebbc 1537{
b4da9d62 1538 struct object_id *oid = &entry->stages[stage].oid;
1ac91b32 1539 unsigned mode = entry->stages[stage].mode;
b4da9d62 1540 if (mode == 0 || is_null_oid(oid))
1ac91b32 1541 return NULL;
b4da9d62 1542 oidcpy(&target->oid, oid);
1ac91b32
EN
1543 target->mode = mode;
1544 return target;
1545}
1546
37b65ce3
EN
1547static int handle_file_collision(struct merge_options *o,
1548 const char *collide_path,
1549 const char *prev_path1,
1550 const char *prev_path2,
1551 const char *branch1, const char *branch2,
1552 const struct object_id *a_oid,
1553 unsigned int a_mode,
1554 const struct object_id *b_oid,
1555 unsigned int b_mode)
1556{
1557 struct merge_file_info mfi;
1558 struct diff_filespec null, a, b;
1559 char *alt_path = NULL;
1560 const char *update_path = collide_path;
1561
7f867165
EN
1562 /*
1563 * It's easiest to get the correct things into stage 2 and 3, and
1564 * to make sure that the content merge puts HEAD before the other
1565 * branch if we just ensure that branch1 == o->branch1. So, simply
1566 * flip arguments around if we don't have that.
1567 */
1568 if (branch1 != o->branch1) {
1569 return handle_file_collision(o, collide_path,
1570 prev_path2, prev_path1,
1571 branch2, branch1,
1572 b_oid, b_mode,
1573 a_oid, a_mode);
1574 }
1575
37b65ce3
EN
1576 /*
1577 * In the recursive case, we just opt to undo renames
1578 */
1579 if (o->call_depth && (prev_path1 || prev_path2)) {
1580 /* Put first file (a_oid, a_mode) in its original spot */
1581 if (prev_path1) {
1582 if (update_file(o, 1, a_oid, a_mode, prev_path1))
1583 return -1;
1584 } else {
1585 if (update_file(o, 1, a_oid, a_mode, collide_path))
1586 return -1;
1587 }
1588
1589 /* Put second file (b_oid, b_mode) in its original spot */
1590 if (prev_path2) {
1591 if (update_file(o, 1, b_oid, b_mode, prev_path2))
1592 return -1;
1593 } else {
1594 if (update_file(o, 1, b_oid, b_mode, collide_path))
1595 return -1;
1596 }
1597
1598 /* Don't leave something at collision path if unrenaming both */
1599 if (prev_path1 && prev_path2)
1600 remove_file(o, 1, collide_path, 0);
1601
1602 return 0;
1603 }
1604
1605 /* Remove rename sources if rename/add or rename/rename(2to1) */
1606 if (prev_path1)
1607 remove_file(o, 1, prev_path1,
1608 o->call_depth || would_lose_untracked(prev_path1));
1609 if (prev_path2)
1610 remove_file(o, 1, prev_path2,
1611 o->call_depth || would_lose_untracked(prev_path2));
1612
1613 /*
1614 * Remove the collision path, if it wouldn't cause dirty contents
1615 * or an untracked file to get lost. We'll either overwrite with
1616 * merged contents, or just write out to differently named files.
1617 */
1618 if (was_dirty(o, collide_path)) {
1619 output(o, 1, _("Refusing to lose dirty file at %s"),
1620 collide_path);
1621 update_path = alt_path = unique_path(o, collide_path, "merged");
1622 } else if (would_lose_untracked(collide_path)) {
1623 /*
1624 * Only way we get here is if both renames were from
1625 * a directory rename AND user had an untracked file
1626 * at the location where both files end up after the
1627 * two directory renames. See testcase 10d of t6043.
1628 */
1629 output(o, 1, _("Refusing to lose untracked file at "
1630 "%s, even though it's in the way."),
1631 collide_path);
1632 update_path = alt_path = unique_path(o, collide_path, "merged");
1633 } else {
1634 /*
1635 * FIXME: It's possible that the two files are identical
1636 * and that the current working copy happens to match, in
1637 * which case we are unnecessarily touching the working
1638 * tree file. It's not a likely enough scenario that I
1639 * want to code up the checks for it and a better fix is
1640 * available if we restructure how unpack_trees() and
1641 * merge-recursive interoperate anyway, so punting for
1642 * now...
1643 */
1644 remove_file(o, 0, collide_path, 0);
1645 }
1646
1647 /* Store things in diff_filespecs for functions that need it */
1648 memset(&a, 0, sizeof(struct diff_filespec));
1649 memset(&b, 0, sizeof(struct diff_filespec));
1650 null.path = a.path = b.path = (char *)collide_path;
1651 oidcpy(&null.oid, &null_oid);
1652 null.mode = 0;
1653 oidcpy(&a.oid, a_oid);
1654 a.mode = a_mode;
1655 a.oid_valid = 1;
1656 oidcpy(&b.oid, b_oid);
1657 b.mode = b_mode;
1658 b.oid_valid = 1;
1659
1660 if (merge_mode_and_contents(o, &null, &a, &b, collide_path,
1661 branch1, branch2, o->call_depth * 2, &mfi))
1662 return -1;
1663 mfi.clean &= !alt_path;
1664 if (update_file(o, mfi.clean, &mfi.oid, mfi.mode, update_path))
1665 return -1;
1666 if (!mfi.clean && !o->call_depth &&
1667 update_stages(o, collide_path, NULL, &a, &b))
1668 return -1;
1669 free(alt_path);
1670 /*
1671 * FIXME: If both a & b both started with conflicts (only possible
1672 * if they came from a rename/rename(2to1)), but had IDENTICAL
1673 * contents including those conflicts, then in the next line we claim
1674 * it was clean. If someone cares about this case, we should have the
1675 * caller notify us if we started with conflicts.
1676 */
1677 return mfi.clean;
1678}
7f867165
EN
1679
1680static int handle_rename_add(struct merge_options *o,
1681 struct rename_conflict_info *ci)
1682{
1683 /* a was renamed to c, and a separate c was added. */
1684 struct diff_filespec *a = ci->pair1->one;
1685 struct diff_filespec *c = ci->pair1->two;
1686 char *path = c->path;
1687 char *prev_path_desc;
1688 struct merge_file_info mfi;
1689
1690 int other_stage = (ci->branch1 == o->branch1 ? 3 : 2);
1691
1692 output(o, 1, _("CONFLICT (rename/add): "
1693 "Rename %s->%s in %s. Added %s in %s"),
1694 a->path, c->path, ci->branch1,
1695 c->path, ci->branch2);
1696
1697 prev_path_desc = xstrfmt("version of %s from %s", path, a->path);
1698 if (merge_mode_and_contents(o, a, c, &ci->ren1_other, prev_path_desc,
1699 o->branch1, o->branch2,
1700 1 + o->call_depth * 2, &mfi))
1701 return -1;
1702 free(prev_path_desc);
1703
1704 return handle_file_collision(o,
1705 c->path, a->path, NULL,
1706 ci->branch1, ci->branch2,
1707 &mfi.oid, mfi.mode,
1708 &ci->dst_entry1->stages[other_stage].oid,
1709 ci->dst_entry1->stages[other_stage].mode);
1710}
37b65ce3 1711
80cee6e3
DS
1712static char *find_path_for_conflict(struct merge_options *o,
1713 const char *path,
1714 const char *branch1,
1715 const char *branch2)
1716{
1717 char *new_path = NULL;
1718 if (dir_in_way(path, !o->call_depth, 0)) {
1719 new_path = unique_path(o, path, branch1);
1720 output(o, 1, _("%s is a directory in %s adding "
1721 "as %s instead"),
1722 path, branch2, new_path);
1723 } else if (would_lose_untracked(path)) {
1724 new_path = unique_path(o, path, branch1);
1725 output(o, 1, _("Refusing to lose untracked file"
1726 " at %s; adding as %s instead"),
1727 path, new_path);
1728 }
1729
1730 return new_path;
1731}
1732
8ebe7b05
EN
1733static int handle_rename_rename_1to2(struct merge_options *o,
1734 struct rename_conflict_info *ci)
9047ebbc 1735{
09c01f85 1736 /* One file was renamed in both branches, but to different names. */
48c9cb9d
EN
1737 struct merge_file_info mfi;
1738 struct diff_filespec other;
1739 struct diff_filespec *add;
a99b7f22
EN
1740 struct diff_filespec *one = ci->pair1->one;
1741 struct diff_filespec *a = ci->pair1->two;
1742 struct diff_filespec *b = ci->pair2->two;
48c9cb9d 1743 char *path_desc;
4f66dade 1744
55653a68 1745 output(o, 1, _("CONFLICT (rename/rename): "
4f66dade 1746 "Rename \"%s\"->\"%s\" in branch \"%s\" "
55653a68 1747 "rename \"%s\"->\"%s\" in \"%s\"%s"),
a99b7f22
EN
1748 one->path, a->path, ci->branch1,
1749 one->path, b->path, ci->branch2,
55653a68 1750 o->call_depth ? _(" (left unresolved)") : "");
75456f96 1751
48c9cb9d
EN
1752 path_desc = xstrfmt("%s and %s, both renamed from %s",
1753 a->path, b->path, one->path);
1754 if (merge_mode_and_contents(o, one, a, b, path_desc,
1755 ci->branch1, ci->branch2,
1756 o->call_depth * 2, &mfi))
1757 return -1;
1758 free(path_desc);
1759
1760 if (o->call_depth) {
9047ebbc 1761 /*
c52ff85d
EN
1762 * FIXME: For rename/add-source conflicts (if we could detect
1763 * such), this is wrong. We should instead find a unique
1764 * pathname and then either rename the add-source file to that
1765 * unique path, or use that unique path instead of src here.
9047ebbc 1766 */
75456f96
JS
1767 if (update_file(o, 0, &mfi.oid, mfi.mode, one->path))
1768 return -1;
07413c5a 1769
6d63070c
EN
1770 /*
1771 * Above, we put the merged content at the merge-base's
1772 * path. Now we usually need to delete both a->path and
1773 * b->path. However, the rename on each side of the merge
1774 * could also be involved in a rename/add conflict. In
1775 * such cases, we should keep the added file around,
1776 * resolving the conflict at that path in its favor.
1777 */
1778 add = filespec_from_entry(&other, ci->dst_entry1, 2 ^ 1);
75456f96
JS
1779 if (add) {
1780 if (update_file(o, 0, &add->oid, add->mode, a->path))
1781 return -1;
1782 }
6d63070c
EN
1783 else
1784 remove_file_from_cache(a->path);
1785 add = filespec_from_entry(&other, ci->dst_entry2, 3 ^ 1);
75456f96
JS
1786 if (add) {
1787 if (update_file(o, 0, &add->oid, add->mode, b->path))
1788 return -1;
1789 }
6d63070c
EN
1790 else
1791 remove_file_from_cache(b->path);
48c9cb9d
EN
1792 } else {
1793 /*
1794 * For each destination path, we need to see if there is a
1795 * rename/add collision. If not, we can write the file out
1796 * to the specified location.
1797 */
1798 add = filespec_from_entry(&other, ci->dst_entry1, 2 ^ 1);
1799 if (add) {
1800 if (handle_file_collision(o, a->path,
1801 NULL, NULL,
1802 ci->branch1, ci->branch2,
1803 &mfi.oid, mfi.mode,
1804 &add->oid, add->mode) < 0)
1805 return -1;
1806 } else {
80cee6e3
DS
1807 char *new_path = find_path_for_conflict(o, a->path,
1808 ci->branch1,
1809 ci->branch2);
48c9cb9d
EN
1810 if (update_file(o, 0, &mfi.oid, mfi.mode, new_path ? new_path : a->path))
1811 return -1;
1812 free(new_path);
1813 if (update_stages(o, a->path, NULL, a, NULL))
1814 return -1;
1815 }
1816
1817 add = filespec_from_entry(&other, ci->dst_entry2, 3 ^ 1);
1818 if (add) {
1819 if (handle_file_collision(o, b->path,
1820 NULL, NULL,
1821 ci->branch1, ci->branch2,
1822 &add->oid, add->mode,
1823 &mfi.oid, mfi.mode) < 0)
1824 return -1;
1825 } else {
80cee6e3
DS
1826 char *new_path = find_path_for_conflict(o, b->path,
1827 ci->branch2,
1828 ci->branch1);
48c9cb9d
EN
1829 if (update_file(o, 0, &mfi.oid, mfi.mode, new_path ? new_path : b->path))
1830 return -1;
1831 free(new_path);
1832 if (update_stages(o, b->path, NULL, NULL, b))
1833 return -1;
1834 }
1835 }
75456f96
JS
1836
1837 return 0;
9047ebbc
MV
1838}
1839
8ebe7b05
EN
1840static int handle_rename_rename_2to1(struct merge_options *o,
1841 struct rename_conflict_info *ci)
9047ebbc 1842{
461f5041
EN
1843 /* Two files, a & b, were renamed to the same thing, c. */
1844 struct diff_filespec *a = ci->pair1->one;
1845 struct diff_filespec *b = ci->pair2->one;
1846 struct diff_filespec *c1 = ci->pair1->two;
1847 struct diff_filespec *c2 = ci->pair2->two;
1848 char *path = c1->path; /* == c2->path */
05cf21eb
EN
1849 char *path_side_1_desc;
1850 char *path_side_2_desc;
434b8525
EN
1851 struct merge_file_info mfi_c1;
1852 struct merge_file_info mfi_c2;
461f5041 1853
55653a68 1854 output(o, 1, _("CONFLICT (rename/rename): "
461f5041 1855 "Rename %s->%s in %s. "
55653a68 1856 "Rename %s->%s in %s"),
461f5041
EN
1857 a->path, c1->path, ci->branch1,
1858 b->path, c2->path, ci->branch2);
1859
2b168ef3
EN
1860 path_side_1_desc = xstrfmt("version of %s from %s", path, a->path);
1861 path_side_2_desc = xstrfmt("version of %s from %s", path, b->path);
d9573556 1862 if (merge_mode_and_contents(o, a, c1, &ci->ren1_other, path_side_1_desc,
b2a7942b 1863 o->branch1, o->branch2,
bbafc9c4 1864 1 + o->call_depth * 2, &mfi_c1) ||
d9573556 1865 merge_mode_and_contents(o, b, &ci->ren2_other, c2, path_side_2_desc,
b2a7942b 1866 o->branch1, o->branch2,
bbafc9c4 1867 1 + o->call_depth * 2, &mfi_c2))
75456f96 1868 return -1;
05cf21eb
EN
1869 free(path_side_1_desc);
1870 free(path_side_2_desc);
434b8525 1871
bbafc9c4
EN
1872 return handle_file_collision(o, path, a->path, b->path,
1873 ci->branch1, ci->branch2,
1874 &mfi_c1.oid, mfi_c1.mode,
1875 &mfi_c2.oid, mfi_c2.mode);
9047ebbc
MV
1876}
1877
9ba91557 1878/*
e5257b2a 1879 * Get the diff_filepairs changed between o_tree and tree.
9ba91557 1880 */
e5257b2a
EN
1881static struct diff_queue_struct *get_diffpairs(struct merge_options *o,
1882 struct tree *o_tree,
1883 struct tree *tree)
9ba91557 1884{
e5257b2a 1885 struct diff_queue_struct *ret;
9ba91557
EN
1886 struct diff_options opts;
1887
9ba91557
EN
1888 diff_setup(&opts);
1889 opts.flags.recursive = 1;
1890 opts.flags.rename_empty = 0;
85b46030
BP
1891 opts.detect_rename = merge_detect_rename(o);
1892 /*
1893 * We do not have logic to handle the detection of copies. In
1894 * fact, it may not even make sense to add such logic: would we
1895 * really want a change to a base file to be propagated through
1896 * multiple other files by a merge?
1897 */
1898 if (opts.detect_rename > DIFF_DETECT_RENAME)
1899 opts.detect_rename = DIFF_DETECT_RENAME;
9ba91557
EN
1900 opts.rename_limit = o->merge_rename_limit >= 0 ? o->merge_rename_limit :
1901 o->diff_rename_limit >= 0 ? o->diff_rename_limit :
1902 1000;
1903 opts.rename_score = o->rename_score;
1904 opts.show_rename_progress = o->show_rename_progress;
1905 opts.output_format = DIFF_FORMAT_NO_OUTPUT;
1906 diff_setup_done(&opts);
1907 diff_tree_oid(&o_tree->object.oid, &tree->object.oid, "", &opts);
1908 diffcore_std(&opts);
1909 if (opts.needed_rename_limit > o->needed_rename_limit)
1910 o->needed_rename_limit = opts.needed_rename_limit;
e5257b2a
EN
1911
1912 ret = xmalloc(sizeof(*ret));
1913 *ret = diff_queued_diff;
1914
1915 opts.output_format = DIFF_FORMAT_NO_OUTPUT;
1916 diff_queued_diff.nr = 0;
1917 diff_queued_diff.queue = NULL;
1918 diff_flush(&opts);
1919 return ret;
1920}
1921
96e7ffbd
EN
1922static int tree_has_path(struct tree *tree, const char *path)
1923{
1924 struct object_id hashy;
1925 unsigned int mode_o;
1926
1927 return !get_tree_entry(&tree->object.oid, path,
1928 &hashy, &mode_o);
1929}
1930
e95ab70a
EN
1931/*
1932 * Return a new string that replaces the beginning portion (which matches
1933 * entry->dir), with entry->new_dir. In perl-speak:
1934 * new_path_name = (old_path =~ s/entry->dir/entry->new_dir/);
1935 * NOTE:
1936 * Caller must ensure that old_path starts with entry->dir + '/'.
1937 */
1938static char *apply_dir_rename(struct dir_rename_entry *entry,
1939 const char *old_path)
1940{
1941 struct strbuf new_path = STRBUF_INIT;
1942 int oldlen, newlen;
1943
1944 if (entry->non_unique_new_dir)
1945 return NULL;
1946
1947 oldlen = strlen(entry->dir);
1948 newlen = entry->new_dir.len + (strlen(old_path) - oldlen) + 1;
1949 strbuf_grow(&new_path, newlen);
1950 strbuf_addbuf(&new_path, &entry->new_dir);
1951 strbuf_addstr(&new_path, &old_path[oldlen]);
1952
1953 return strbuf_detach(&new_path, NULL);
1954}
1955
7fe40b88
EN
1956static void get_renamed_dir_portion(const char *old_path, const char *new_path,
1957 char **old_dir, char **new_dir)
1958{
1959 char *end_of_old, *end_of_new;
1960 int old_len, new_len;
1961
1962 *old_dir = NULL;
1963 *new_dir = NULL;
1964
1965 /*
1966 * For
1967 * "a/b/c/d/e/foo.c" -> "a/b/some/thing/else/e/foo.c"
1968 * the "e/foo.c" part is the same, we just want to know that
1969 * "a/b/c/d" was renamed to "a/b/some/thing/else"
1970 * so, for this example, this function returns "a/b/c/d" in
1971 * *old_dir and "a/b/some/thing/else" in *new_dir.
1972 *
1973 * Also, if the basename of the file changed, we don't care. We
1974 * want to know which portion of the directory, if any, changed.
1975 */
1976 end_of_old = strrchr(old_path, '/');
1977 end_of_new = strrchr(new_path, '/');
1978
1979 if (end_of_old == NULL || end_of_new == NULL)
1980 return;
1981 while (*--end_of_new == *--end_of_old &&
1982 end_of_old != old_path &&
1983 end_of_new != new_path)
1984 ; /* Do nothing; all in the while loop */
1985 /*
1986 * We've found the first non-matching character in the directory
1987 * paths. That means the current directory we were comparing
1988 * represents the rename. Move end_of_old and end_of_new back
1989 * to the full directory name.
1990 */
1991 if (*end_of_old == '/')
1992 end_of_old++;
1993 if (*end_of_old != '/')
1994 end_of_new++;
1995 end_of_old = strchr(end_of_old, '/');
1996 end_of_new = strchr(end_of_new, '/');
1997
1998 /*
1999 * It may have been the case that old_path and new_path were the same
2000 * directory all along. Don't claim a rename if they're the same.
2001 */
2002 old_len = end_of_old - old_path;
2003 new_len = end_of_new - new_path;
2004
2005 if (old_len != new_len || strncmp(old_path, new_path, old_len)) {
2006 *old_dir = xstrndup(old_path, old_len);
2007 *new_dir = xstrndup(new_path, new_len);
2008 }
2009}
2010
96e7ffbd
EN
2011static void remove_hashmap_entries(struct hashmap *dir_renames,
2012 struct string_list *items_to_remove)
2013{
2014 int i;
2015 struct dir_rename_entry *entry;
2016
2017 for (i = 0; i < items_to_remove->nr; i++) {
2018 entry = items_to_remove->items[i].util;
2019 hashmap_remove(dir_renames, entry, NULL);
2020 }
2021 string_list_clear(items_to_remove, 0);
2022}
2023
f6f77559
EN
2024/*
2025 * See if there is a directory rename for path, and if there are any file
2026 * level conflicts for the renamed location. If there is a rename and
2027 * there are no conflicts, return the new name. Otherwise, return NULL.
2028 */
2029static char *handle_path_level_conflicts(struct merge_options *o,
2030 const char *path,
2031 struct dir_rename_entry *entry,
2032 struct hashmap *collisions,
2033 struct tree *tree)
2034{
2035 char *new_path = NULL;
2036 struct collision_entry *collision_ent;
2037 int clean = 1;
2038 struct strbuf collision_paths = STRBUF_INIT;
2039
2040 /*
2041 * entry has the mapping of old directory name to new directory name
2042 * that we want to apply to path.
2043 */
2044 new_path = apply_dir_rename(entry, path);
2045
2046 if (!new_path) {
2047 /* This should only happen when entry->non_unique_new_dir set */
2048 if (!entry->non_unique_new_dir)
2049 BUG("entry->non_unqiue_dir not set and !new_path");
2050 output(o, 1, _("CONFLICT (directory rename split): "
2051 "Unclear where to place %s because directory "
2052 "%s was renamed to multiple other directories, "
2053 "with no destination getting a majority of the "
2054 "files."),
2055 path, entry->dir);
2056 clean = 0;
2057 return NULL;
2058 }
2059
2060 /*
2061 * The caller needs to have ensured that it has pre-populated
2062 * collisions with all paths that map to new_path. Do a quick check
2063 * to ensure that's the case.
2064 */
2065 collision_ent = collision_find_entry(collisions, new_path);
2066 if (collision_ent == NULL)
2067 BUG("collision_ent is NULL");
2068
2069 /*
2070 * Check for one-sided add/add/.../add conflicts, i.e.
2071 * where implicit renames from the other side doing
2072 * directory rename(s) can affect this side of history
2073 * to put multiple paths into the same location. Warn
2074 * and bail on directory renames for such paths.
2075 */
2076 if (collision_ent->reported_already) {
2077 clean = 0;
2078 } else if (tree_has_path(tree, new_path)) {
2079 collision_ent->reported_already = 1;
2080 strbuf_add_separated_string_list(&collision_paths, ", ",
2081 &collision_ent->source_files);
2082 output(o, 1, _("CONFLICT (implicit dir rename): Existing "
2083 "file/dir at %s in the way of implicit "
2084 "directory rename(s) putting the following "
2085 "path(s) there: %s."),
2086 new_path, collision_paths.buf);
2087 clean = 0;
2088 } else if (collision_ent->source_files.nr > 1) {
2089 collision_ent->reported_already = 1;
2090 strbuf_add_separated_string_list(&collision_paths, ", ",
2091 &collision_ent->source_files);
2092 output(o, 1, _("CONFLICT (implicit dir rename): Cannot map "
2093 "more than one path to %s; implicit directory "
2094 "renames tried to put these paths there: %s"),
2095 new_path, collision_paths.buf);
2096 clean = 0;
2097 }
2098
2099 /* Free memory we no longer need */
2100 strbuf_release(&collision_paths);
2101 if (!clean && new_path) {
2102 free(new_path);
2103 return NULL;
2104 }
2105
2106 return new_path;
2107}
2108
96e7ffbd
EN
2109/*
2110 * There are a couple things we want to do at the directory level:
2111 * 1. Check for both sides renaming to the same thing, in order to avoid
2112 * implicit renaming of files that should be left in place. (See
2113 * testcase 6b in t6043 for details.)
2114 * 2. Prune directory renames if there are still files left in the
2115 * the original directory. These represent a partial directory rename,
2116 * i.e. a rename where only some of the files within the directory
2117 * were renamed elsewhere. (Technically, this could be done earlier
2118 * in get_directory_renames(), except that would prevent us from
2119 * doing the previous check and thus failing testcase 6b.)
2120 * 3. Check for rename/rename(1to2) conflicts (at the directory level).
2121 * In the future, we could potentially record this info as well and
2122 * omit reporting rename/rename(1to2) conflicts for each path within
2123 * the affected directories, thus cleaning up the merge output.
2124 * NOTE: We do NOT check for rename/rename(2to1) conflicts at the
2125 * directory level, because merging directories is fine. If it
2126 * causes conflicts for files within those merged directories, then
2127 * that should be detected at the individual path level.
2128 */
2129static void handle_directory_level_conflicts(struct merge_options *o,
2130 struct hashmap *dir_re_head,
2131 struct tree *head,
2132 struct hashmap *dir_re_merge,
2133 struct tree *merge)
2134{
2135 struct hashmap_iter iter;
2136 struct dir_rename_entry *head_ent;
2137 struct dir_rename_entry *merge_ent;
2138
2139 struct string_list remove_from_head = STRING_LIST_INIT_NODUP;
2140 struct string_list remove_from_merge = STRING_LIST_INIT_NODUP;
2141
2142 hashmap_iter_init(dir_re_head, &iter);
2143 while ((head_ent = hashmap_iter_next(&iter))) {
2144 merge_ent = dir_rename_find_entry(dir_re_merge, head_ent->dir);
2145 if (merge_ent &&
2146 !head_ent->non_unique_new_dir &&
2147 !merge_ent->non_unique_new_dir &&
2148 !strbuf_cmp(&head_ent->new_dir, &merge_ent->new_dir)) {
2149 /* 1. Renamed identically; remove it from both sides */
2150 string_list_append(&remove_from_head,
2151 head_ent->dir)->util = head_ent;
2152 strbuf_release(&head_ent->new_dir);
2153 string_list_append(&remove_from_merge,
2154 merge_ent->dir)->util = merge_ent;
2155 strbuf_release(&merge_ent->new_dir);
2156 } else if (tree_has_path(head, head_ent->dir)) {
2157 /* 2. This wasn't a directory rename after all */
2158 string_list_append(&remove_from_head,
2159 head_ent->dir)->util = head_ent;
2160 strbuf_release(&head_ent->new_dir);
2161 }
2162 }
2163
2164 remove_hashmap_entries(dir_re_head, &remove_from_head);
2165 remove_hashmap_entries(dir_re_merge, &remove_from_merge);
2166
2167 hashmap_iter_init(dir_re_merge, &iter);
2168 while ((merge_ent = hashmap_iter_next(&iter))) {
2169 head_ent = dir_rename_find_entry(dir_re_head, merge_ent->dir);
2170 if (tree_has_path(merge, merge_ent->dir)) {
2171 /* 2. This wasn't a directory rename after all */
2172 string_list_append(&remove_from_merge,
2173 merge_ent->dir)->util = merge_ent;
2174 } else if (head_ent &&
2175 !head_ent->non_unique_new_dir &&
2176 !merge_ent->non_unique_new_dir) {
2177 /* 3. rename/rename(1to2) */
2178 /*
2179 * We can assume it's not rename/rename(1to1) because
2180 * that was case (1), already checked above. So we
2181 * know that head_ent->new_dir and merge_ent->new_dir
2182 * are different strings.
2183 */
2184 output(o, 1, _("CONFLICT (rename/rename): "
2185 "Rename directory %s->%s in %s. "
2186 "Rename directory %s->%s in %s"),
2187 head_ent->dir, head_ent->new_dir.buf, o->branch1,
2188 head_ent->dir, merge_ent->new_dir.buf, o->branch2);
2189 string_list_append(&remove_from_head,
2190 head_ent->dir)->util = head_ent;
2191 strbuf_release(&head_ent->new_dir);
2192 string_list_append(&remove_from_merge,
2193 merge_ent->dir)->util = merge_ent;
2194 strbuf_release(&merge_ent->new_dir);
2195 }
2196 }
2197
2198 remove_hashmap_entries(dir_re_head, &remove_from_head);
2199 remove_hashmap_entries(dir_re_merge, &remove_from_merge);
2200}
2201
7fe40b88
EN
2202static struct hashmap *get_directory_renames(struct diff_queue_struct *pairs,
2203 struct tree *tree)
2204{
2205 struct hashmap *dir_renames;
2206 struct hashmap_iter iter;
2207 struct dir_rename_entry *entry;
2208 int i;
2209
2210 /*
2211 * Typically, we think of a directory rename as all files from a
2212 * certain directory being moved to a target directory. However,
2213 * what if someone first moved two files from the original
2214 * directory in one commit, and then renamed the directory
2215 * somewhere else in a later commit? At merge time, we just know
2216 * that files from the original directory went to two different
2217 * places, and that the bulk of them ended up in the same place.
2218 * We want each directory rename to represent where the bulk of the
2219 * files from that directory end up; this function exists to find
2220 * where the bulk of the files went.
2221 *
2222 * The first loop below simply iterates through the list of file
2223 * renames, finding out how often each directory rename pair
2224 * possibility occurs.
2225 */
2226 dir_renames = xmalloc(sizeof(*dir_renames));
2227 dir_rename_init(dir_renames);
2228 for (i = 0; i < pairs->nr; ++i) {
2229 struct string_list_item *item;
2230 int *count;
2231 struct diff_filepair *pair = pairs->queue[i];
2232 char *old_dir, *new_dir;
2233
2234 /* File not part of directory rename if it wasn't renamed */
2235 if (pair->status != 'R')
2236 continue;
2237
2238 get_renamed_dir_portion(pair->one->path, pair->two->path,
2239 &old_dir, &new_dir);
2240 if (!old_dir)
2241 /* Directory didn't change at all; ignore this one. */
2242 continue;
2243
2244 entry = dir_rename_find_entry(dir_renames, old_dir);
2245 if (!entry) {
2246 entry = xmalloc(sizeof(*entry));
2247 dir_rename_entry_init(entry, old_dir);
2248 hashmap_put(dir_renames, entry);
2249 } else {
2250 free(old_dir);
2251 }
2252 item = string_list_lookup(&entry->possible_new_dirs, new_dir);
2253 if (!item) {
2254 item = string_list_insert(&entry->possible_new_dirs,
2255 new_dir);
2256 item->util = xcalloc(1, sizeof(int));
2257 } else {
2258 free(new_dir);
2259 }
2260 count = item->util;
2261 *count += 1;
2262 }
2263
2264 /*
2265 * For each directory with files moved out of it, we find out which
2266 * target directory received the most files so we can declare it to
2267 * be the "winning" target location for the directory rename. This
2268 * winner gets recorded in new_dir. If there is no winner
2269 * (multiple target directories received the same number of files),
2270 * we set non_unique_new_dir. Once we've determined the winner (or
2271 * that there is no winner), we no longer need possible_new_dirs.
2272 */
2273 hashmap_iter_init(dir_renames, &iter);
2274 while ((entry = hashmap_iter_next(&iter))) {
2275 int max = 0;
2276 int bad_max = 0;
2277 char *best = NULL;
2278
2279 for (i = 0; i < entry->possible_new_dirs.nr; i++) {
2280 int *count = entry->possible_new_dirs.items[i].util;
2281
2282 if (*count == max)
2283 bad_max = max;
2284 else if (*count > max) {
2285 max = *count;
2286 best = entry->possible_new_dirs.items[i].string;
2287 }
2288 }
2289 if (bad_max == max)
2290 entry->non_unique_new_dir = 1;
2291 else {
2292 assert(entry->new_dir.len == 0);
2293 strbuf_addstr(&entry->new_dir, best);
2294 }
2295 /*
2296 * The relevant directory sub-portion of the original full
2297 * filepaths were xstrndup'ed before inserting into
2298 * possible_new_dirs, and instead of manually iterating the
2299 * list and free'ing each, just lie and tell
2300 * possible_new_dirs that it did the strdup'ing so that it
2301 * will free them for us.
2302 */
2303 entry->possible_new_dirs.strdup_strings = 1;
2304 string_list_clear(&entry->possible_new_dirs, 1);
2305 }
2306
2307 return dir_renames;
2308}
2309
e95ab70a
EN
2310static struct dir_rename_entry *check_dir_renamed(const char *path,
2311 struct hashmap *dir_renames)
2312{
9da2d037 2313 char *temp = xstrdup(path);
e95ab70a 2314 char *end;
9da2d037 2315 struct dir_rename_entry *entry = NULL;;
e95ab70a 2316
e95ab70a
EN
2317 while ((end = strrchr(temp, '/'))) {
2318 *end = '\0';
2319 entry = dir_rename_find_entry(dir_renames, temp);
2320 if (entry)
9da2d037 2321 break;
e95ab70a 2322 }
9da2d037
RS
2323 free(temp);
2324 return entry;
e95ab70a
EN
2325}
2326
2327static void compute_collisions(struct hashmap *collisions,
2328 struct hashmap *dir_renames,
2329 struct diff_queue_struct *pairs)
2330{
2331 int i;
2332
2333 /*
2334 * Multiple files can be mapped to the same path due to directory
2335 * renames done by the other side of history. Since that other
2336 * side of history could have merged multiple directories into one,
2337 * if our side of history added the same file basename to each of
2338 * those directories, then all N of them would get implicitly
2339 * renamed by the directory rename detection into the same path,
2340 * and we'd get an add/add/.../add conflict, and all those adds
2341 * from *this* side of history. This is not representable in the
2342 * index, and users aren't going to easily be able to make sense of
2343 * it. So we need to provide a good warning about what's
2344 * happening, and fall back to no-directory-rename detection
2345 * behavior for those paths.
2346 *
2347 * See testcases 9e and all of section 5 from t6043 for examples.
2348 */
2349 collision_init(collisions);
2350
2351 for (i = 0; i < pairs->nr; ++i) {
2352 struct dir_rename_entry *dir_rename_ent;
2353 struct collision_entry *collision_ent;
2354 char *new_path;
2355 struct diff_filepair *pair = pairs->queue[i];
2356
6e7e027f 2357 if (pair->status != 'A' && pair->status != 'R')
e95ab70a
EN
2358 continue;
2359 dir_rename_ent = check_dir_renamed(pair->two->path,
2360 dir_renames);
2361 if (!dir_rename_ent)
2362 continue;
2363
2364 new_path = apply_dir_rename(dir_rename_ent, pair->two->path);
2365 if (!new_path)
2366 /*
2367 * dir_rename_ent->non_unique_new_path is true, which
2368 * means there is no directory rename for us to use,
2369 * which means it won't cause us any additional
2370 * collisions.
2371 */
2372 continue;
2373 collision_ent = collision_find_entry(collisions, new_path);
2374 if (!collision_ent) {
2375 collision_ent = xcalloc(1,
2376 sizeof(struct collision_entry));
2377 hashmap_entry_init(collision_ent, strhash(new_path));
2378 hashmap_put(collisions, collision_ent);
2379 collision_ent->target_file = new_path;
2380 } else {
2381 free(new_path);
2382 }
2383 string_list_insert(&collision_ent->source_files,
2384 pair->two->path);
2385 }
2386}
2387
f6f77559
EN
2388static char *check_for_directory_rename(struct merge_options *o,
2389 const char *path,
2390 struct tree *tree,
2391 struct hashmap *dir_renames,
2392 struct hashmap *dir_rename_exclusions,
2393 struct hashmap *collisions,
2394 int *clean_merge)
2395{
2396 char *new_path = NULL;
2397 struct dir_rename_entry *entry = check_dir_renamed(path, dir_renames);
2398 struct dir_rename_entry *oentry = NULL;
2399
2400 if (!entry)
2401 return new_path;
2402
2403 /*
2404 * This next part is a little weird. We do not want to do an
2405 * implicit rename into a directory we renamed on our side, because
2406 * that will result in a spurious rename/rename(1to2) conflict. An
2407 * example:
2408 * Base commit: dumbdir/afile, otherdir/bfile
2409 * Side 1: smrtdir/afile, otherdir/bfile
2410 * Side 2: dumbdir/afile, dumbdir/bfile
2411 * Here, while working on Side 1, we could notice that otherdir was
2412 * renamed/merged to dumbdir, and change the diff_filepair for
2413 * otherdir/bfile into a rename into dumbdir/bfile. However, Side
2414 * 2 will notice the rename from dumbdir to smrtdir, and do the
2415 * transitive rename to move it from dumbdir/bfile to
2416 * smrtdir/bfile. That gives us bfile in dumbdir vs being in
2417 * smrtdir, a rename/rename(1to2) conflict. We really just want
2418 * the file to end up in smrtdir. And the way to achieve that is
2419 * to not let Side1 do the rename to dumbdir, since we know that is
2420 * the source of one of our directory renames.
2421 *
2422 * That's why oentry and dir_rename_exclusions is here.
2423 *
2424 * As it turns out, this also prevents N-way transient rename
2425 * confusion; See testcases 9c and 9d of t6043.
2426 */
2427 oentry = dir_rename_find_entry(dir_rename_exclusions, entry->new_dir.buf);
2428 if (oentry) {
2429 output(o, 1, _("WARNING: Avoiding applying %s -> %s rename "
2430 "to %s, because %s itself was renamed."),
2431 entry->dir, entry->new_dir.buf, path, entry->new_dir.buf);
2432 } else {
2433 new_path = handle_path_level_conflicts(o, path, entry,
2434 collisions, tree);
2435 *clean_merge &= (new_path != NULL);
2436 }
2437
2438 return new_path;
2439}
2440
9c0743fe
EN
2441static void apply_directory_rename_modifications(struct merge_options *o,
2442 struct diff_filepair *pair,
2443 char *new_path,
2444 struct rename *re,
2445 struct tree *tree,
2446 struct tree *o_tree,
2447 struct tree *a_tree,
2448 struct tree *b_tree,
2449 struct string_list *entries,
2450 int *clean)
2451{
2452 struct string_list_item *item;
2453 int stage = (tree == a_tree ? 2 : 3);
18797a3b 2454 int update_wd;
9c0743fe
EN
2455
2456 /*
2457 * In all cases where we can do directory rename detection,
2458 * unpack_trees() will have read pair->two->path into the
2459 * index and the working copy. We need to remove it so that
2460 * we can instead place it at new_path. It is guaranteed to
2461 * not be untracked (unpack_trees() would have errored out
2462 * saying the file would have been overwritten), but it might
2463 * be dirty, though.
2464 */
18797a3b
EN
2465 update_wd = !was_dirty(o, pair->two->path);
2466 if (!update_wd)
2467 output(o, 1, _("Refusing to lose dirty file at %s"),
2468 pair->two->path);
2469 remove_file(o, 1, pair->two->path, !update_wd);
9c0743fe
EN
2470
2471 /* Find or create a new re->dst_entry */
2472 item = string_list_lookup(entries, new_path);
2473 if (item) {
2474 /*
2475 * Since we're renaming on this side of history, and it's
2476 * due to a directory rename on the other side of history
2477 * (which we only allow when the directory in question no
2478 * longer exists on the other side of history), the
2479 * original entry for re->dst_entry is no longer
2480 * necessary...
2481 */
2482 re->dst_entry->processed = 1;
2483
2484 /*
2485 * ...because we'll be using this new one.
2486 */
2487 re->dst_entry = item->util;
2488 } else {
2489 /*
2490 * re->dst_entry is for the before-dir-rename path, and we
2491 * need it to hold information for the after-dir-rename
2492 * path. Before creating a new entry, we need to mark the
2493 * old one as unnecessary (...unless it is shared by
2494 * src_entry, i.e. this didn't use to be a rename, in which
2495 * case we can just allow the normal processing to happen
2496 * for it).
2497 */
2498 if (pair->status == 'R')
2499 re->dst_entry->processed = 1;
2500
2501 re->dst_entry = insert_stage_data(new_path,
2502 o_tree, a_tree, b_tree,
2503 entries);
2504 item = string_list_insert(entries, new_path);
2505 item->util = re->dst_entry;
2506 }
2507
2508 /*
2509 * Update the stage_data with the information about the path we are
2510 * moving into place. That slot will be empty and available for us
2511 * to write to because of the collision checks in
2512 * handle_path_level_conflicts(). In other words,
2513 * re->dst_entry->stages[stage].oid will be the null_oid, so it's
2514 * open for us to write to.
2515 *
2516 * It may be tempting to actually update the index at this point as
2517 * well, using update_stages_for_stage_data(), but as per the big
2518 * "NOTE" in update_stages(), doing so will modify the current
2519 * in-memory index which will break calls to would_lose_untracked()
2520 * that we need to make. Instead, we need to just make sure that
8ebe7b05 2521 * the various handle_rename_*() functions update the index
9c0743fe
EN
2522 * explicitly rather than relying on unpack_trees() to have done it.
2523 */
2524 get_tree_entry(&tree->object.oid,
2525 pair->two->path,
2526 &re->dst_entry->stages[stage].oid,
2527 &re->dst_entry->stages[stage].mode);
2528
2529 /* Update pair status */
2530 if (pair->status == 'A') {
2531 /*
2532 * Recording rename information for this add makes it look
2533 * like a rename/delete conflict. Make sure we can
2534 * correctly handle this as an add that was moved to a new
2535 * directory instead of reporting a rename/delete conflict.
2536 */
2537 re->add_turned_into_rename = 1;
2538 }
2539 /*
2540 * We don't actually look at pair->status again, but it seems
2541 * pedagogically correct to adjust it.
2542 */
2543 pair->status = 'R';
2544
2545 /*
2546 * Finally, record the new location.
2547 */
2548 pair->two->path = new_path;
2549}
2550
e5257b2a
EN
2551/*
2552 * Get information of all renames which occurred in 'pairs', making use of
2553 * any implicit directory renames inferred from the other side of history.
2554 * We need the three trees in the merge ('o_tree', 'a_tree' and 'b_tree')
2555 * to be able to associate the correct cache entries with the rename
2556 * information; tree is always equal to either a_tree or b_tree.
2557 */
2558static struct string_list *get_renames(struct merge_options *o,
2559 struct diff_queue_struct *pairs,
e95ab70a 2560 struct hashmap *dir_renames,
f6f77559 2561 struct hashmap *dir_rename_exclusions,
e5257b2a
EN
2562 struct tree *tree,
2563 struct tree *o_tree,
2564 struct tree *a_tree,
2565 struct tree *b_tree,
f6f77559
EN
2566 struct string_list *entries,
2567 int *clean_merge)
e5257b2a
EN
2568{
2569 int i;
e95ab70a
EN
2570 struct hashmap collisions;
2571 struct hashmap_iter iter;
2572 struct collision_entry *e;
e5257b2a
EN
2573 struct string_list *renames;
2574
e95ab70a 2575 compute_collisions(&collisions, dir_renames, pairs);
e5257b2a
EN
2576 renames = xcalloc(1, sizeof(struct string_list));
2577
2578 for (i = 0; i < pairs->nr; ++i) {
9ba91557
EN
2579 struct string_list_item *item;
2580 struct rename *re;
e5257b2a 2581 struct diff_filepair *pair = pairs->queue[i];
f6f77559 2582 char *new_path; /* non-NULL only with directory renames */
9ba91557 2583
6e7e027f 2584 if (pair->status != 'A' && pair->status != 'R') {
9ba91557
EN
2585 diff_free_filepair(pair);
2586 continue;
2587 }
f6f77559
EN
2588 new_path = check_for_directory_rename(o, pair->two->path, tree,
2589 dir_renames,
2590 dir_rename_exclusions,
2591 &collisions,
2592 clean_merge);
2593 if (pair->status != 'R' && !new_path) {
2594 diff_free_filepair(pair);
2595 continue;
2596 }
2597
9ba91557
EN
2598 re = xmalloc(sizeof(*re));
2599 re->processed = 0;
9c0743fe 2600 re->add_turned_into_rename = 0;
9ba91557
EN
2601 re->pair = pair;
2602 item = string_list_lookup(entries, re->pair->one->path);
2603 if (!item)
2604 re->src_entry = insert_stage_data(re->pair->one->path,
2605 o_tree, a_tree, b_tree, entries);
2606 else
2607 re->src_entry = item->util;
2608
2609 item = string_list_lookup(entries, re->pair->two->path);
2610 if (!item)
2611 re->dst_entry = insert_stage_data(re->pair->two->path,
2612 o_tree, a_tree, b_tree, entries);
2613 else
2614 re->dst_entry = item->util;
2615 item = string_list_insert(renames, pair->one->path);
2616 item->util = re;
9c0743fe
EN
2617 if (new_path)
2618 apply_directory_rename_modifications(o, pair, new_path,
2619 re, tree, o_tree,
2620 a_tree, b_tree,
2621 entries,
2622 clean_merge);
9ba91557 2623 }
e95ab70a
EN
2624
2625 hashmap_iter_init(&collisions, &iter);
2626 while ((e = hashmap_iter_next(&iter))) {
2627 free(e->target_file);
2628 string_list_clear(&e->source_files, 0);
2629 }
2630 hashmap_free(&collisions, 1);
9ba91557
EN
2631 return renames;
2632}
2633
8a2fce18
MV
2634static int process_renames(struct merge_options *o,
2635 struct string_list *a_renames,
2636 struct string_list *b_renames)
9047ebbc
MV
2637{
2638 int clean_merge = 1, i, j;
183113a5
TF
2639 struct string_list a_by_dst = STRING_LIST_INIT_NODUP;
2640 struct string_list b_by_dst = STRING_LIST_INIT_NODUP;
9047ebbc
MV
2641 const struct rename *sre;
2642
2643 for (i = 0; i < a_renames->nr; i++) {
2644 sre = a_renames->items[i].util;
78a395d3 2645 string_list_insert(&a_by_dst, sre->pair->two->path)->util
0a6b8712 2646 = (void *)sre;
9047ebbc
MV
2647 }
2648 for (i = 0; i < b_renames->nr; i++) {
2649 sre = b_renames->items[i].util;
78a395d3 2650 string_list_insert(&b_by_dst, sre->pair->two->path)->util
0a6b8712 2651 = (void *)sre;
9047ebbc
MV
2652 }
2653
2654 for (i = 0, j = 0; i < a_renames->nr || j < b_renames->nr;) {
8e24cbae 2655 struct string_list *renames1, *renames2Dst;
9047ebbc
MV
2656 struct rename *ren1 = NULL, *ren2 = NULL;
2657 const char *branch1, *branch2;
2658 const char *ren1_src, *ren1_dst;
461f5041 2659 struct string_list_item *lookup;
9047ebbc
MV
2660
2661 if (i >= a_renames->nr) {
9047ebbc
MV
2662 ren2 = b_renames->items[j++].util;
2663 } else if (j >= b_renames->nr) {
9047ebbc
MV
2664 ren1 = a_renames->items[i++].util;
2665 } else {
8e24cbae
BK
2666 int compare = strcmp(a_renames->items[i].string,
2667 b_renames->items[j].string);
9047ebbc
MV
2668 if (compare <= 0)
2669 ren1 = a_renames->items[i++].util;
2670 if (compare >= 0)
2671 ren2 = b_renames->items[j++].util;
2672 }
2673
2674 /* TODO: refactor, so that 1/2 are not needed */
2675 if (ren1) {
2676 renames1 = a_renames;
9047ebbc 2677 renames2Dst = &b_by_dst;
8a2fce18
MV
2678 branch1 = o->branch1;
2679 branch2 = o->branch2;
9047ebbc 2680 } else {
9047ebbc 2681 renames1 = b_renames;
9047ebbc 2682 renames2Dst = &a_by_dst;
8a2fce18
MV
2683 branch1 = o->branch2;
2684 branch2 = o->branch1;
35d803bc 2685 SWAP(ren2, ren1);
9047ebbc 2686 }
9047ebbc 2687
9047ebbc
MV
2688 if (ren1->processed)
2689 continue;
2690 ren1->processed = 1;
9047ebbc 2691 ren1->dst_entry->processed = 1;
7769a75e
EN
2692 /* BUG: We should only mark src_entry as processed if we
2693 * are not dealing with a rename + add-source case.
2694 */
9047ebbc 2695 ren1->src_entry->processed = 1;
9047ebbc
MV
2696
2697 ren1_src = ren1->pair->one->path;
2698 ren1_dst = ren1->pair->two->path;
2699
2700 if (ren2) {
461f5041 2701 /* One file renamed on both sides */
9047ebbc
MV
2702 const char *ren2_src = ren2->pair->one->path;
2703 const char *ren2_dst = ren2->pair->two->path;
4f66dade 2704 enum rename_type rename_type;
9047ebbc 2705 if (strcmp(ren1_src, ren2_src) != 0)
033abf97 2706 BUG("ren1_src != ren2_src");
9047ebbc
MV
2707 ren2->dst_entry->processed = 1;
2708 ren2->processed = 1;
2709 if (strcmp(ren1_dst, ren2_dst) != 0) {
4f66dade 2710 rename_type = RENAME_ONE_FILE_TO_TWO;
461f5041 2711 clean_merge = 0;
9047ebbc 2712 } else {
4f66dade 2713 rename_type = RENAME_ONE_FILE_TO_ONE;
7769a75e
EN
2714 /* BUG: We should only remove ren1_src in
2715 * the base stage (think of rename +
2716 * add-source cases).
2717 */
b7fa51da 2718 remove_file(o, 1, ren1_src, 1);
b8ddf164
EN
2719 update_entry(ren1->dst_entry,
2720 ren1->pair->one,
2721 ren1->pair->two,
2722 ren2->pair->two);
9047ebbc 2723 }
4f66dade
EN
2724 setup_rename_conflict_info(rename_type,
2725 ren1->pair,
2726 ren2->pair,
2727 branch1,
2728 branch2,
2729 ren1->dst_entry,
232c635f
EN
2730 ren2->dst_entry,
2731 o,
2732 NULL,
2733 NULL);
461f5041
EN
2734 } else if ((lookup = string_list_lookup(renames2Dst, ren1_dst))) {
2735 /* Two different files renamed to the same thing */
2736 char *ren2_dst;
2737 ren2 = lookup->util;
2738 ren2_dst = ren2->pair->two->path;
2739 if (strcmp(ren1_dst, ren2_dst) != 0)
033abf97 2740 BUG("ren1_dst != ren2_dst");
461f5041
EN
2741
2742 clean_merge = 0;
2743 ren2->processed = 1;
2744 /*
2745 * BUG: We should only mark src_entry as processed
2746 * if we are not dealing with a rename + add-source
2747 * case.
2748 */
2749 ren2->src_entry->processed = 1;
2750
2751 setup_rename_conflict_info(RENAME_TWO_FILES_TO_ONE,
2752 ren1->pair,
2753 ren2->pair,
2754 branch1,
2755 branch2,
2756 ren1->dst_entry,
232c635f
EN
2757 ren2->dst_entry,
2758 o,
2759 ren1->src_entry,
2760 ren2->src_entry);
2761
9047ebbc
MV
2762 } else {
2763 /* Renamed in 1, maybe changed in 2 */
9047ebbc
MV
2764 /* we only use sha1 and mode of these */
2765 struct diff_filespec src_other, dst_other;
41d70bd6 2766 int try_merge;
9047ebbc 2767
41d70bd6
EN
2768 /*
2769 * unpack_trees loads entries from common-commit
2770 * into stage 1, from head-commit into stage 2, and
2771 * from merge-commit into stage 3. We keep track
2772 * of which side corresponds to the rename.
2773 */
2774 int renamed_stage = a_renames == renames1 ? 2 : 3;
2775 int other_stage = a_renames == renames1 ? 3 : 2;
9047ebbc 2776
7769a75e
EN
2777 /* BUG: We should only remove ren1_src in the base
2778 * stage and in other_stage (think of rename +
2779 * add-source case).
2780 */
531357a4 2781 remove_file(o, 1, ren1_src,
a35edc84 2782 renamed_stage == 2 || !was_tracked(o, ren1_src));
9047ebbc 2783
fd429e98 2784 oidcpy(&src_other.oid,
2785 &ren1->src_entry->stages[other_stage].oid);
41d70bd6 2786 src_other.mode = ren1->src_entry->stages[other_stage].mode;
fd429e98 2787 oidcpy(&dst_other.oid,
2788 &ren1->dst_entry->stages[other_stage].oid);
41d70bd6 2789 dst_other.mode = ren1->dst_entry->stages[other_stage].mode;
9047ebbc
MV
2790 try_merge = 0;
2791
9c0743fe
EN
2792 if (oid_eq(&src_other.oid, &null_oid) &&
2793 ren1->add_turned_into_rename) {
5455c338 2794 setup_rename_conflict_info(RENAME_VIA_DIR,
9c0743fe
EN
2795 ren1->pair,
2796 NULL,
2797 branch1,
2798 branch2,
2799 ren1->dst_entry,
2800 NULL,
2801 o,
2802 NULL,
2803 NULL);
2804 } else if (oid_eq(&src_other.oid, &null_oid)) {
4f66dade
EN
2805 setup_rename_conflict_info(RENAME_DELETE,
2806 ren1->pair,
2807 NULL,
2808 branch1,
2809 branch2,
2810 ren1->dst_entry,
232c635f
EN
2811 NULL,
2812 o,
2813 NULL,
4f66dade 2814 NULL);
d5af5105 2815 } else if ((dst_other.mode == ren1->pair->two->mode) &&
b4da9d62 2816 oid_eq(&dst_other.oid, &ren1->pair->two->oid)) {
35a74abf
EN
2817 /*
2818 * Added file on the other side identical to
2819 * the file being renamed: clean merge.
2820 * Also, there is no need to overwrite the
2821 * file already in the working copy, so call
2822 * update_file_flags() instead of
2823 * update_file().
2824 */
75456f96
JS
2825 if (update_file_flags(o,
2826 &ren1->pair->two->oid,
2827 ren1->pair->two->mode,
2828 ren1_dst,
2829 1, /* update_cache */
2830 0 /* update_wd */))
2831 clean_merge = -1;
b4da9d62 2832 } else if (!oid_eq(&dst_other.oid, &null_oid)) {
7f867165
EN
2833 /*
2834 * Probably not a clean merge, but it's
2835 * premature to set clean_merge to 0 here,
2836 * because if the rename merges cleanly and
2837 * the merge exactly matches the newly added
2838 * file, then the merge will be clean.
2839 */
2840 setup_rename_conflict_info(RENAME_ADD,
2841 ren1->pair,
2842 NULL,
2843 branch1,
2844 branch2,
2845 ren1->dst_entry,
2846 NULL,
2847 o,
2848 ren1->src_entry,
2849 NULL);
9047ebbc
MV
2850 } else
2851 try_merge = 1;
2852
75456f96
JS
2853 if (clean_merge < 0)
2854 goto cleanup_and_return;
9047ebbc 2855 if (try_merge) {
8a2fce18 2856 struct diff_filespec *one, *a, *b;
9047ebbc
MV
2857 src_other.path = (char *)ren1_src;
2858
8a2fce18 2859 one = ren1->pair->one;
9047ebbc
MV
2860 if (a_renames == renames1) {
2861 a = ren1->pair->two;
2862 b = &src_other;
2863 } else {
2864 b = ren1->pair->two;
2865 a = &src_other;
2866 }
b8ddf164 2867 update_entry(ren1->dst_entry, one, a, b);
4f66dade
EN
2868 setup_rename_conflict_info(RENAME_NORMAL,
2869 ren1->pair,
2870 NULL,
2871 branch1,
2872 NULL,
2873 ren1->dst_entry,
232c635f
EN
2874 NULL,
2875 o,
2876 NULL,
4f66dade 2877 NULL);
9047ebbc
MV
2878 }
2879 }
2880 }
75456f96 2881cleanup_and_return:
9047ebbc
MV
2882 string_list_clear(&a_by_dst, 0);
2883 string_list_clear(&b_by_dst, 0);
2884
2885 return clean_merge;
2886}
2887
f172589e
EN
2888struct rename_info {
2889 struct string_list *head_renames;
2890 struct string_list *merge_renames;
2891};
2892
7fe40b88
EN
2893static void initial_cleanup_rename(struct diff_queue_struct *pairs,
2894 struct hashmap *dir_renames)
ffc16c49 2895{
7fe40b88
EN
2896 struct hashmap_iter iter;
2897 struct dir_rename_entry *e;
2898
2899 hashmap_iter_init(dir_renames, &iter);
2900 while ((e = hashmap_iter_next(&iter))) {
2901 free(e->dir);
2902 strbuf_release(&e->new_dir);
2903 /* possible_new_dirs already cleared in get_directory_renames */
2904 }
2905 hashmap_free(dir_renames, 1);
2906 free(dir_renames);
2907
ffc16c49
EN
2908 free(pairs->queue);
2909 free(pairs);
2910}
2911
8ebe7b05
EN
2912static int detect_and_process_renames(struct merge_options *o,
2913 struct tree *common,
2914 struct tree *head,
2915 struct tree *merge,
2916 struct string_list *entries,
2917 struct rename_info *ri)
f172589e 2918{
e5257b2a 2919 struct diff_queue_struct *head_pairs, *merge_pairs;
7fe40b88 2920 struct hashmap *dir_re_head, *dir_re_merge;
f6f77559 2921 int clean = 1;
e5257b2a 2922
3992ff0c
EN
2923 ri->head_renames = NULL;
2924 ri->merge_renames = NULL;
2925
85b46030 2926 if (!merge_detect_rename(o))
3992ff0c
EN
2927 return 1;
2928
e5257b2a
EN
2929 head_pairs = get_diffpairs(o, common, head);
2930 merge_pairs = get_diffpairs(o, common, merge);
2931
5fdddd9b
EN
2932 if (o->detect_directory_renames) {
2933 dir_re_head = get_directory_renames(head_pairs, head);
2934 dir_re_merge = get_directory_renames(merge_pairs, merge);
7fe40b88 2935
5fdddd9b
EN
2936 handle_directory_level_conflicts(o,
2937 dir_re_head, head,
2938 dir_re_merge, merge);
2939 } else {
2940 dir_re_head = xmalloc(sizeof(*dir_re_head));
2941 dir_re_merge = xmalloc(sizeof(*dir_re_merge));
2942 dir_rename_init(dir_re_head);
2943 dir_rename_init(dir_re_merge);
2944 }
96e7ffbd 2945
e95ab70a 2946 ri->head_renames = get_renames(o, head_pairs,
f6f77559
EN
2947 dir_re_merge, dir_re_head, head,
2948 common, head, merge, entries,
2949 &clean);
2950 if (clean < 0)
2951 goto cleanup;
e95ab70a 2952 ri->merge_renames = get_renames(o, merge_pairs,
f6f77559
EN
2953 dir_re_head, dir_re_merge, merge,
2954 common, head, merge, entries,
2955 &clean);
2956 if (clean < 0)
2957 goto cleanup;
2958 clean &= process_renames(o, ri->head_renames, ri->merge_renames);
2959
2960cleanup:
e5257b2a
EN
2961 /*
2962 * Some cleanup is deferred until cleanup_renames() because the
2963 * data structures are still needed and referenced in
2964 * process_entry(). But there are a few things we can free now.
2965 */
7fe40b88
EN
2966 initial_cleanup_rename(head_pairs, dir_re_head);
2967 initial_cleanup_rename(merge_pairs, dir_re_merge);
e5257b2a
EN
2968
2969 return clean;
f172589e
EN
2970}
2971
ffc16c49 2972static void final_cleanup_rename(struct string_list *rename)
f172589e 2973{
9cfee25a
EN
2974 const struct rename *re;
2975 int i;
f172589e 2976
3992ff0c
EN
2977 if (rename == NULL)
2978 return;
2979
9cfee25a
EN
2980 for (i = 0; i < rename->nr; i++) {
2981 re = rename->items[i].util;
2982 diff_free_filepair(re->pair);
2983 }
2984 string_list_clear(rename, 1);
2985 free(rename);
2986}
2987
ffc16c49 2988static void final_cleanup_renames(struct rename_info *re_info)
9cfee25a 2989{
ffc16c49
EN
2990 final_cleanup_rename(re_info->head_renames);
2991 final_cleanup_rename(re_info->merge_renames);
f172589e
EN
2992}
2993
b4da9d62 2994static struct object_id *stage_oid(const struct object_id *oid, unsigned mode)
9047ebbc 2995{
b4da9d62 2996 return (is_null_oid(oid) || mode == 0) ? NULL: (struct object_id *)oid;
9047ebbc
MV
2997}
2998
bc9204d4 2999static int read_oid_strbuf(struct merge_options *o,
d90e759f
EN
3000 const struct object_id *oid,
3001 struct strbuf *dst)
331a1838
EB
3002{
3003 void *buf;
3004 enum object_type type;
3005 unsigned long size;
b4f5aca4 3006 buf = read_object_file(oid, &type, &size);
331a1838 3007 if (!buf)
bc9204d4 3008 return err(o, _("cannot read object %s"), oid_to_hex(oid));
331a1838
EB
3009 if (type != OBJ_BLOB) {
3010 free(buf);
bc9204d4 3011 return err(o, _("object %s is not a blob"), oid_to_hex(oid));
331a1838
EB
3012 }
3013 strbuf_attach(dst, buf, size, size + 1);
3014 return 0;
3015}
3016
bc9204d4
JS
3017static int blob_unchanged(struct merge_options *opt,
3018 const struct object_id *o_oid,
72fac66b 3019 unsigned o_mode,
b4da9d62 3020 const struct object_id *a_oid,
72fac66b 3021 unsigned a_mode,
3e7589b7 3022 int renormalize, const char *path)
331a1838
EB
3023{
3024 struct strbuf o = STRBUF_INIT;
3025 struct strbuf a = STRBUF_INIT;
3026 int ret = 0; /* assume changed for safety */
3027
72fac66b
JK
3028 if (a_mode != o_mode)
3029 return 0;
b4da9d62 3030 if (oid_eq(o_oid, a_oid))
331a1838 3031 return 1;
3e7589b7 3032 if (!renormalize)
331a1838
EB
3033 return 0;
3034
b4da9d62 3035 assert(o_oid && a_oid);
bc9204d4 3036 if (read_oid_strbuf(opt, o_oid, &o) || read_oid_strbuf(opt, a_oid, &a))
331a1838
EB
3037 goto error_return;
3038 /*
3039 * Note: binary | is used so that both renormalizations are
3040 * performed. Comparison can be skipped if both files are
3041 * unchanged since their sha1s have already been compared.
3042 */
a33e0b2a
BW
3043 if (renormalize_buffer(&the_index, path, o.buf, o.len, &o) |
3044 renormalize_buffer(&the_index, path, a.buf, a.len, &a))
331a1838
EB
3045 ret = (o.len == a.len && !memcmp(o.buf, a.buf, o.len));
3046
3047error_return:
3048 strbuf_release(&o);
3049 strbuf_release(&a);
3050 return ret;
3051}
3052
75456f96 3053static int handle_modify_delete(struct merge_options *o,
d90e759f
EN
3054 const char *path,
3055 struct object_id *o_oid, int o_mode,
3056 struct object_id *a_oid, int a_mode,
3057 struct object_id *b_oid, int b_mode)
5e3ce663 3058{
b26d87f2
MM
3059 const char *modify_branch, *delete_branch;
3060 struct object_id *changed_oid;
3061 int changed_mode;
3062
3063 if (a_oid) {
3064 modify_branch = o->branch1;
3065 delete_branch = o->branch2;
3066 changed_oid = a_oid;
3067 changed_mode = a_mode;
3068 } else {
3069 modify_branch = o->branch2;
3070 delete_branch = o->branch1;
3071 changed_oid = b_oid;
3072 changed_mode = b_mode;
3073 }
3074
75456f96 3075 return handle_change_delete(o,
b26d87f2 3076 path, NULL,
75456f96 3077 o_oid, o_mode,
b26d87f2
MM
3078 changed_oid, changed_mode,
3079 modify_branch, delete_branch,
75456f96 3080 _("modify"), _("modified"));
5e3ce663
EN
3081}
3082
d9573556
EN
3083static int handle_content_merge(struct merge_options *o,
3084 const char *path,
3085 int is_dirty,
3086 struct object_id *o_oid, int o_mode,
3087 struct object_id *a_oid, int a_mode,
3088 struct object_id *b_oid, int b_mode,
3089 struct rename_conflict_info *rename_conflict_info)
0c4918d1 3090{
55653a68 3091 const char *reason = _("content");
5b448b85 3092 const char *path1 = NULL, *path2 = NULL;
0c4918d1
EN
3093 struct merge_file_info mfi;
3094 struct diff_filespec one, a, b;
4ab9a157 3095 unsigned df_conflict_remains = 0;
0c4918d1 3096
b4da9d62 3097 if (!o_oid) {
55653a68 3098 reason = _("add/add");
b4da9d62 3099 o_oid = (struct object_id *)&null_oid;
0c4918d1
EN
3100 }
3101 one.path = a.path = b.path = (char *)path;
b4da9d62 3102 oidcpy(&one.oid, o_oid);
0c4918d1 3103 one.mode = o_mode;
b4da9d62 3104 oidcpy(&a.oid, a_oid);
0c4918d1 3105 a.mode = a_mode;
b4da9d62 3106 oidcpy(&b.oid, b_oid);
0c4918d1
EN
3107 b.mode = b_mode;
3108
3c217c07 3109 if (rename_conflict_info) {
3c217c07
EN
3110 struct diff_filepair *pair1 = rename_conflict_info->pair1;
3111
3112 path1 = (o->branch1 == rename_conflict_info->branch1) ?
3113 pair1->two->path : pair1->one->path;
3114 /* If rename_conflict_info->pair2 != NULL, we are in
3115 * RENAME_ONE_FILE_TO_ONE case. Otherwise, we have a
3116 * normal rename.
3117 */
3118 path2 = (rename_conflict_info->pair2 ||
3119 o->branch2 == rename_conflict_info->branch1) ?
3120 pair1->two->path : pair1->one->path;
52396e1d
EN
3121 one.path = pair1->one->path;
3122 a.path = (char *)path1;
3123 b.path = (char *)path2;
3c217c07 3124
5423d2e7
DT
3125 if (dir_in_way(path, !o->call_depth,
3126 S_ISGITLINK(pair1->two->mode)))
3c217c07 3127 df_conflict_remains = 1;
4ab9a157 3128 }
d9573556 3129 if (merge_mode_and_contents(o, &one, &a, &b, path,
b2a7942b
EN
3130 o->branch1, o->branch2,
3131 o->call_depth * 2, &mfi))
3c8a51e8 3132 return -1;
4ab9a157 3133
1de70dbd
EN
3134 /*
3135 * We can skip updating the working tree file iff:
3136 * a) The merge is clean
3137 * b) The merge matches what was in HEAD (content, mode, pathname)
3138 * c) The target path is usable (i.e. not involved in D/F conflict)
3139 */
3140 if (mfi.clean &&
3141 was_tracked_and_matches(o, path, &mfi.oid, mfi.mode) &&
3142 !df_conflict_remains) {
2b75fb60
EN
3143 int pos;
3144 struct cache_entry *ce;
3145
55653a68 3146 output(o, 3, _("Skipped %s (merged same as existing)"), path);
1de70dbd
EN
3147 if (add_cacheinfo(o, mfi.mode, &mfi.oid, path,
3148 0, (!o->call_depth && !is_dirty), 0))
3149 return -1;
2b75fb60
EN
3150 /*
3151 * However, add_cacheinfo() will delete the old cache entry
3152 * and add a new one. We need to copy over any skip_worktree
3153 * flag to avoid making the file appear as if it were
3154 * deleted by the user.
3155 */
3156 pos = index_name_pos(&o->orig_index, path, strlen(path));
3157 ce = o->orig_index.cache[pos];
3158 if (ce_skip_worktree(ce)) {
3159 pos = index_name_pos(&the_index, path, strlen(path));
3160 ce = the_index.cache[pos];
3161 ce->ce_flags |= CE_SKIP_WORKTREE;
3162 }
1de70dbd 3163 return mfi.clean;
05cf21eb 3164 }
0c4918d1
EN
3165
3166 if (!mfi.clean) {
3167 if (S_ISGITLINK(mfi.mode))
55653a68
JX
3168 reason = _("submodule");
3169 output(o, 1, _("CONFLICT (%s): Merge conflict in %s"),
0c4918d1 3170 reason, path);
4f66dade 3171 if (rename_conflict_info && !df_conflict_remains)
bc9204d4 3172 if (update_stages(o, path, &one, &a, &b))
75456f96 3173 return -1;
0c4918d1
EN
3174 }
3175
bd42380e 3176 if (df_conflict_remains || is_dirty) {
3d6b8e88 3177 char *new_path;
51931bf0
EN
3178 if (o->call_depth) {
3179 remove_file_from_cache(path);
3180 } else {
75456f96 3181 if (!mfi.clean) {
bc9204d4 3182 if (update_stages(o, path, &one, &a, &b))
75456f96
JS
3183 return -1;
3184 } else {
a35edc84 3185 int file_from_stage2 = was_tracked(o, path);
51931bf0 3186 struct diff_filespec merged;
9b561499 3187 oidcpy(&merged.oid, &mfi.oid);
51931bf0
EN
3188 merged.mode = mfi.mode;
3189
bc9204d4 3190 if (update_stages(o, path, NULL,
75456f96
JS
3191 file_from_stage2 ? &merged : NULL,
3192 file_from_stage2 ? NULL : &merged))
3193 return -1;
51931bf0
EN
3194 }
3195
3196 }
4f66dade 3197 new_path = unique_path(o, path, rename_conflict_info->branch1);
bd42380e
EN
3198 if (is_dirty) {
3199 output(o, 1, _("Refusing to lose dirty file at %s"),
3200 path);
3201 }
55653a68 3202 output(o, 1, _("Adding as %s instead"), new_path);
75456f96
JS
3203 if (update_file(o, 0, &mfi.oid, mfi.mode, new_path)) {
3204 free(new_path);
3205 return -1;
3206 }
3d6b8e88 3207 free(new_path);
51931bf0 3208 mfi.clean = 0;
75456f96
JS
3209 } else if (update_file(o, mfi.clean, &mfi.oid, mfi.mode, path))
3210 return -1;
bd42380e 3211 return !is_dirty && mfi.clean;
0c4918d1
EN
3212}
3213
8ebe7b05
EN
3214static int handle_rename_normal(struct merge_options *o,
3215 const char *path,
3216 struct object_id *o_oid, unsigned int o_mode,
3217 struct object_id *a_oid, unsigned int a_mode,
3218 struct object_id *b_oid, unsigned int b_mode,
3219 struct rename_conflict_info *ci)
64b1abe9 3220{
64b1abe9 3221 /* Merge the content and write it out */
d9573556
EN
3222 return handle_content_merge(o, path, was_dirty(o, path),
3223 o_oid, o_mode, a_oid, a_mode, b_oid, b_mode,
3224 ci);
0c4918d1
EN
3225}
3226
9047ebbc 3227/* Per entry merge function */
8a2fce18
MV
3228static int process_entry(struct merge_options *o,
3229 const char *path, struct stage_data *entry)
9047ebbc 3230{
9047ebbc 3231 int clean_merge = 1;
1bc0ab7c 3232 int normalize = o->renormalize;
9047ebbc
MV
3233 unsigned o_mode = entry->stages[1].mode;
3234 unsigned a_mode = entry->stages[2].mode;
3235 unsigned b_mode = entry->stages[3].mode;
b4da9d62 3236 struct object_id *o_oid = stage_oid(&entry->stages[1].oid, o_mode);
3237 struct object_id *a_oid = stage_oid(&entry->stages[2].oid, a_mode);
3238 struct object_id *b_oid = stage_oid(&entry->stages[3].oid, b_mode);
9047ebbc 3239
37348937 3240 entry->processed = 1;
4f66dade
EN
3241 if (entry->rename_conflict_info) {
3242 struct rename_conflict_info *conflict_info = entry->rename_conflict_info;
07413c5a 3243 switch (conflict_info->rename_type) {
882fd11a 3244 case RENAME_NORMAL:
4f66dade 3245 case RENAME_ONE_FILE_TO_ONE:
8ebe7b05
EN
3246 clean_merge = handle_rename_normal(o,
3247 path,
3248 o_oid, o_mode,
3249 a_oid, a_mode,
3250 b_oid, b_mode,
3251 conflict_info);
882fd11a 3252 break;
5455c338 3253 case RENAME_VIA_DIR:
9c0743fe 3254 clean_merge = 1;
8ebe7b05
EN
3255 if (handle_rename_via_dir(o,
3256 conflict_info->pair1,
3257 conflict_info->branch1,
3258 conflict_info->branch2))
9c0743fe 3259 clean_merge = -1;
882fd11a 3260 break;
7f867165
EN
3261 case RENAME_ADD:
3262 /*
3263 * Probably unclean merge, but if the renamed file
3264 * merges cleanly and the result can then be
3265 * two-way merged cleanly with the added file, I
3266 * guess it's a clean merge?
3267 */
3268 clean_merge = handle_rename_add(o, conflict_info);
3269 break;
3b130adf
EN
3270 case RENAME_DELETE:
3271 clean_merge = 0;
8ebe7b05
EN
3272 if (handle_rename_delete(o,
3273 conflict_info->pair1,
3274 conflict_info->branch1,
3275 conflict_info->branch2))
75456f96 3276 clean_merge = -1;
3b130adf 3277 break;
07413c5a 3278 case RENAME_ONE_FILE_TO_TWO:
07413c5a 3279 clean_merge = 0;
8ebe7b05 3280 if (handle_rename_rename_1to2(o, conflict_info))
75456f96 3281 clean_merge = -1;
07413c5a 3282 break;
461f5041 3283 case RENAME_TWO_FILES_TO_ONE:
bbafc9c4
EN
3284 /*
3285 * Probably unclean merge, but if the two renamed
3286 * files merge cleanly and the two resulting files
3287 * can then be two-way merged cleanly, I guess it's
3288 * a clean merge?
3289 */
3290 clean_merge = handle_rename_rename_2to1(o,
3291 conflict_info);
07413c5a
EN
3292 break;
3293 default:
3294 entry->processed = 0;
3295 break;
3296 }
b4da9d62 3297 } else if (o_oid && (!a_oid || !b_oid)) {
edd2faf5 3298 /* Case A: Deleted in one */
b4da9d62 3299 if ((!a_oid && !b_oid) ||
bc9204d4
JS
3300 (!b_oid && blob_unchanged(o, o_oid, o_mode, a_oid, a_mode, normalize, path)) ||
3301 (!a_oid && blob_unchanged(o, o_oid, o_mode, b_oid, b_mode, normalize, path))) {
edd2faf5
EN
3302 /* Deleted in both or deleted in one and
3303 * unchanged in the other */
b4da9d62 3304 if (a_oid)
55653a68 3305 output(o, 2, _("Removing %s"), path);
edd2faf5 3306 /* do not touch working file if it did not exist */
b4da9d62 3307 remove_file(o, 1, path, !a_oid);
edd2faf5
EN
3308 } else {
3309 /* Modify/delete; deleted side may have put a directory in the way */
edd2faf5 3310 clean_merge = 0;
75456f96
JS
3311 if (handle_modify_delete(o, path, o_oid, o_mode,
3312 a_oid, a_mode, b_oid, b_mode))
3313 clean_merge = -1;
3d6b8e88 3314 }
b4da9d62 3315 } else if ((!o_oid && a_oid && !b_oid) ||
3316 (!o_oid && !a_oid && b_oid)) {
edd2faf5
EN
3317 /* Case B: Added in one. */
3318 /* [nothing|directory] -> ([nothing|directory], file) */
3319
9c0bbb50
EN
3320 const char *add_branch;
3321 const char *other_branch;
3322 unsigned mode;
b4da9d62 3323 const struct object_id *oid;
9c0bbb50 3324 const char *conf;
37348937 3325
b4da9d62 3326 if (a_oid) {
9c0bbb50
EN
3327 add_branch = o->branch1;
3328 other_branch = o->branch2;
3329 mode = a_mode;
b4da9d62 3330 oid = a_oid;
55653a68 3331 conf = _("file/directory");
9c0bbb50
EN
3332 } else {
3333 add_branch = o->branch2;
3334 other_branch = o->branch1;
3335 mode = b_mode;
b4da9d62 3336 oid = b_oid;
55653a68 3337 conf = _("directory/file");
9c0bbb50 3338 }
c641ca67
EN
3339 if (dir_in_way(path,
3340 !o->call_depth && !S_ISGITLINK(a_mode),
3341 0)) {
3d6b8e88 3342 char *new_path = unique_path(o, path, add_branch);
9c0bbb50 3343 clean_merge = 0;
55653a68
JX
3344 output(o, 1, _("CONFLICT (%s): There is a directory with name %s in %s. "
3345 "Adding %s as %s"),
9c0bbb50 3346 conf, path, other_branch, path, new_path);
75456f96
JS
3347 if (update_file(o, 0, oid, mode, new_path))
3348 clean_merge = -1;
3349 else if (o->call_depth)
7b1c610f 3350 remove_file_from_cache(path);
3d6b8e88 3351 free(new_path);
9c0bbb50 3352 } else {
55653a68 3353 output(o, 2, _("Adding %s"), path);
35a74abf 3354 /* do not overwrite file if already present */
75456f96
JS
3355 if (update_file_flags(o, oid, mode, path, 1, !a_oid))
3356 clean_merge = -1;
9c0bbb50 3357 }
b4da9d62 3358 } else if (a_oid && b_oid) {
dcf28150
EN
3359 if (!o_oid) {
3360 /* Case C: Added in both (check for same permissions) */
3361 output(o, 1,
3362 _("CONFLICT (add/add): Merge conflict in %s"),
3363 path);
3364 clean_merge = handle_file_collision(o,
3365 path, NULL, NULL,
3366 o->branch1,
3367 o->branch2,
3368 a_oid, a_mode,
3369 b_oid, b_mode);
3370 } else {
3371 /* case D: Modified in both, but differently. */
3372 int is_dirty = 0; /* unpack_trees would have bailed if dirty */
3373 clean_merge = handle_content_merge(o, path,
3374 is_dirty,
3375 o_oid, o_mode,
3376 a_oid, a_mode,
3377 b_oid, b_mode,
3378 NULL);
3379 }
b4da9d62 3380 } else if (!o_oid && !a_oid && !b_oid) {
edd2faf5
EN
3381 /*
3382 * this entry was deleted altogether. a_mode == 0 means
3383 * we had that path and want to actively remove it.
3384 */
3385 remove_file(o, 1, path, !a_mode);
3386 } else
033abf97 3387 BUG("fatal merge failure, shouldn't happen.");
37348937
EN
3388
3389 return clean_merge;
3390}
3391
8a2fce18
MV
3392int merge_trees(struct merge_options *o,
3393 struct tree *head,
9047ebbc
MV
3394 struct tree *merge,
3395 struct tree *common,
9047ebbc
MV
3396 struct tree **result)
3397{
3398 int code, clean;
eddd1a41
EN
3399 struct strbuf sb = STRBUF_INIT;
3400
3401 if (!o->call_depth && index_has_changes(&the_index, head, &sb)) {
3402 err(o, _("Your local changes to the following files would be overwritten by merge:\n %s"),
3403 sb.buf);
3404 return -1;
3405 }
9047ebbc 3406
85e51b78
JH
3407 if (o->subtree_shift) {
3408 merge = shift_tree_object(head, merge, o->subtree_shift);
3409 common = shift_tree_object(head, common, o->subtree_shift);
9047ebbc
MV
3410 }
3411
b4da9d62 3412 if (oid_eq(&common->object.oid, &merge->object.oid)) {
7560f547 3413 output(o, 0, _("Already up to date!"));
9047ebbc
MV
3414 *result = head;
3415 return 1;
3416 }
3417
3f1c1c36 3418 code = unpack_trees_start(o, common, head, merge);
9047ebbc 3419
fadd069d
JH
3420 if (code != 0) {
3421 if (show(o, 4) || o->call_depth)
bc9204d4 3422 err(o, _("merging of trees %s and %s failed"),
f2fd0760 3423 oid_to_hex(&head->object.oid),
3424 oid_to_hex(&merge->object.oid));
3f1c1c36 3425 unpack_trees_finish(o);
6003303a 3426 return -1;
fadd069d 3427 }
9047ebbc
MV
3428
3429 if (unmerged_cache()) {
f172589e
EN
3430 struct string_list *entries;
3431 struct rename_info re_info;
9047ebbc 3432 int i;
fc65b00d
KW
3433 /*
3434 * Only need the hashmap while processing entries, so
3435 * initialize it here and free it when we are done running
3436 * through the entries. Keeping it in the merge_options as
3437 * opposed to decaring a local hashmap is for convenience
3438 * so that we don't have to pass it to around.
3439 */
3440 hashmap_init(&o->current_file_dir_set, path_hashmap_cmp, NULL, 512);
696ee23c
MV
3441 get_files_dirs(o, head);
3442 get_files_dirs(o, merge);
9047ebbc
MV
3443
3444 entries = get_unmerged();
8ebe7b05
EN
3445 clean = detect_and_process_renames(o, common, head, merge,
3446 entries, &re_info);
6c8647da 3447 record_df_conflict_files(o, entries);
75456f96 3448 if (clean < 0)
e336bdc5 3449 goto cleanup;
edd2faf5 3450 for (i = entries->nr-1; 0 <= i; i--) {
9047ebbc
MV
3451 const char *path = entries->items[i].string;
3452 struct stage_data *e = entries->items[i].util;
75456f96
JS
3453 if (!e->processed) {
3454 int ret = process_entry(o, path, e);
3455 if (!ret)
3456 clean = 0;
e336bdc5
KW
3457 else if (ret < 0) {
3458 clean = ret;
3459 goto cleanup;
3460 }
75456f96 3461 }
9047ebbc 3462 }
7edba4c4
JH
3463 for (i = 0; i < entries->nr; i++) {
3464 struct stage_data *e = entries->items[i].util;
3465 if (!e->processed)
033abf97 3466 BUG("unprocessed path??? %s",
7edba4c4
JH
3467 entries->items[i].string);
3468 }
9047ebbc 3469
93665365 3470 cleanup:
ffc16c49 3471 final_cleanup_renames(&re_info);
f172589e 3472
9047ebbc 3473 string_list_clear(entries, 1);
f172589e 3474 free(entries);
9047ebbc 3475
fc65b00d
KW
3476 hashmap_free(&o->current_file_dir_set, 1);
3477
3f1c1c36
EN
3478 if (clean < 0) {
3479 unpack_trees_finish(o);
e336bdc5 3480 return clean;
3f1c1c36 3481 }
9047ebbc
MV
3482 }
3483 else
3484 clean = 1;
3485
3f1c1c36 3486 unpack_trees_finish(o);
a35edc84 3487
fbc87eb5
JS
3488 if (o->call_depth && !(*result = write_tree_from_memory(o)))
3489 return -1;
9047ebbc
MV
3490
3491 return clean;
3492}
3493
3494static struct commit_list *reverse_commit_list(struct commit_list *list)
3495{
3496 struct commit_list *next = NULL, *current, *backup;
3497 for (current = list; current; current = backup) {
3498 backup = current->next;
3499 current->next = next;
3500 next = current;
3501 }
3502 return next;
3503}
3504
3505/*
3506 * Merge the commits h1 and h2, return the resulting virtual
3507 * commit object and a flag indicating the cleanness of the merge.
3508 */
8a2fce18
MV
3509int merge_recursive(struct merge_options *o,
3510 struct commit *h1,
9047ebbc 3511 struct commit *h2,
9047ebbc
MV
3512 struct commit_list *ca,
3513 struct commit **result)
3514{
3515 struct commit_list *iter;
3516 struct commit *merged_common_ancestors;
156e1782 3517 struct tree *mrtree;
9047ebbc
MV
3518 int clean;
3519
8a2fce18 3520 if (show(o, 4)) {
55653a68 3521 output(o, 4, _("Merging:"));
5033639c
MV
3522 output_commit_title(o, h1);
3523 output_commit_title(o, h2);
9047ebbc
MV
3524 }
3525
3526 if (!ca) {
2ce406cc 3527 ca = get_merge_bases(h1, h2);
9047ebbc
MV
3528 ca = reverse_commit_list(ca);
3529 }
3530
8a2fce18 3531 if (show(o, 5)) {
e0453cd8
RT
3532 unsigned cnt = commit_list_count(ca);
3533
3534 output(o, 5, Q_("found %u common ancestor:",
3535 "found %u common ancestors:", cnt), cnt);
9047ebbc 3536 for (iter = ca; iter; iter = iter->next)
5033639c 3537 output_commit_title(o, iter->item);
9047ebbc
MV
3538 }
3539