merge-recursive: Delay handling of rename/delete conflicts
[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 */
4c371f91 6#include "advice.h"
9047ebbc
MV
7#include "cache.h"
8#include "cache-tree.h"
9#include "commit.h"
10#include "blob.h"
11#include "builtin.h"
12#include "tree-walk.h"
13#include "diff.h"
14#include "diffcore.h"
15#include "tag.h"
16#include "unpack-trees.h"
17#include "string-list.h"
18#include "xdiff-interface.h"
19#include "ll-merge.h"
9047ebbc
MV
20#include "attr.h"
21#include "merge-recursive.h"
9800c0df 22#include "dir.h"
68d03e4a 23#include "submodule.h"
9047ebbc 24
85e51b78
JH
25static struct tree *shift_tree_object(struct tree *one, struct tree *two,
26 const char *subtree_shift)
9047ebbc
MV
27{
28 unsigned char shifted[20];
29
85e51b78
JH
30 if (!*subtree_shift) {
31 shift_tree(one->object.sha1, two->object.sha1, shifted, 0);
32 } else {
33 shift_tree_by(one->object.sha1, two->object.sha1, shifted,
34 subtree_shift);
35 }
9047ebbc
MV
36 if (!hashcmp(two->object.sha1, shifted))
37 return two;
38 return lookup_tree(shifted);
39}
40
41/*
a6f63ae0 42 * A virtual commit has (const char *)commit->util set to the name.
9047ebbc
MV
43 */
44
2af202be 45static struct commit *make_virtual_commit(struct tree *tree, const char *comment)
9047ebbc
MV
46{
47 struct commit *commit = xcalloc(1, sizeof(struct commit));
9047ebbc
MV
48 commit->tree = tree;
49 commit->util = (void*)comment;
9047ebbc
MV
50 /* avoid warnings */
51 commit->object.parsed = 1;
52 return commit;
53}
54
55/*
56 * Since we use get_tree_entry(), which does not put the read object into
57 * the object pool, we cannot rely on a == b.
58 */
59static int sha_eq(const unsigned char *a, const unsigned char *b)
60{
61 if (!a && !b)
62 return 2;
63 return a && b && hashcmp(a, b) == 0;
64}
65
25c39363
EN
66enum rename_type {
67 RENAME_NORMAL = 0,
68 RENAME_DELETE,
69 RENAME_ONE_FILE_TO_TWO
70};
71
72struct rename_df_conflict_info {
73 enum rename_type rename_type;
74 struct diff_filepair *pair1;
75 struct diff_filepair *pair2;
76 const char *branch1;
77 const char *branch2;
78 struct stage_data *dst_entry1;
79 struct stage_data *dst_entry2;
80};
81
9047ebbc
MV
82/*
83 * Since we want to write the index eventually, we cannot reuse the index
84 * for these (temporary) data.
85 */
86struct stage_data
87{
88 struct
89 {
90 unsigned mode;
91 unsigned char sha[20];
92 } stages[4];
25c39363 93 struct rename_df_conflict_info *rename_df_conflict_info;
9047ebbc
MV
94 unsigned processed:1;
95};
96
25c39363
EN
97static inline void setup_rename_df_conflict_info(enum rename_type rename_type,
98 struct diff_filepair *pair1,
99 struct diff_filepair *pair2,
100 const char *branch1,
101 const char *branch2,
102 struct stage_data *dst_entry1,
103 struct stage_data *dst_entry2)
104{
105 struct rename_df_conflict_info *ci = xcalloc(1, sizeof(struct rename_df_conflict_info));
106 ci->rename_type = rename_type;
107 ci->pair1 = pair1;
108 ci->branch1 = branch1;
109 ci->branch2 = branch2;
110
111 ci->dst_entry1 = dst_entry1;
112 dst_entry1->rename_df_conflict_info = ci;
113 dst_entry1->processed = 0;
114
115 assert(!pair2 == !dst_entry2);
116 if (dst_entry2) {
117 ci->dst_entry2 = dst_entry2;
118 ci->pair2 = pair2;
119 dst_entry2->rename_df_conflict_info = ci;
120 dst_entry2->processed = 0;
121 }
122}
123
8a2fce18 124static int show(struct merge_options *o, int v)
9047ebbc 125{
5033639c 126 return (!o->call_depth && o->verbosity >= v) || o->verbosity >= 5;
9047ebbc
MV
127}
128
c7d84924 129static void flush_output(struct merge_options *o)
9047ebbc 130{
c7d84924
MV
131 if (o->obuf.len) {
132 fputs(o->obuf.buf, stdout);
133 strbuf_reset(&o->obuf);
9047ebbc
MV
134 }
135}
136
28bea9e5 137__attribute__((format (printf, 3, 4)))
8a2fce18 138static void output(struct merge_options *o, int v, const char *fmt, ...)
9047ebbc
MV
139{
140 int len;
141 va_list ap;
142
8a2fce18 143 if (!show(o, v))
9047ebbc
MV
144 return;
145
c7d84924
MV
146 strbuf_grow(&o->obuf, o->call_depth * 2 + 2);
147 memset(o->obuf.buf + o->obuf.len, ' ', o->call_depth * 2);
148 strbuf_setlen(&o->obuf, o->obuf.len + o->call_depth * 2);
9047ebbc
MV
149
150 va_start(ap, fmt);
c7d84924 151 len = vsnprintf(o->obuf.buf + o->obuf.len, strbuf_avail(&o->obuf), fmt, ap);
9047ebbc
MV
152 va_end(ap);
153
154 if (len < 0)
155 len = 0;
c7d84924
MV
156 if (len >= strbuf_avail(&o->obuf)) {
157 strbuf_grow(&o->obuf, len + 2);
9047ebbc 158 va_start(ap, fmt);
c7d84924 159 len = vsnprintf(o->obuf.buf + o->obuf.len, strbuf_avail(&o->obuf), fmt, ap);
9047ebbc 160 va_end(ap);
c7d84924 161 if (len >= strbuf_avail(&o->obuf)) {
9047ebbc
MV
162 die("this should not happen, your snprintf is broken");
163 }
164 }
c7d84924
MV
165 strbuf_setlen(&o->obuf, o->obuf.len + len);
166 strbuf_add(&o->obuf, "\n", 1);
8a2fce18 167 if (!o->buffer_output)
c7d84924 168 flush_output(o);
9047ebbc
MV
169}
170
5033639c 171static void output_commit_title(struct merge_options *o, struct commit *commit)
9047ebbc
MV
172{
173 int i;
c7d84924 174 flush_output(o);
5033639c 175 for (i = o->call_depth; i--;)
9047ebbc
MV
176 fputs(" ", stdout);
177 if (commit->util)
178 printf("virtual %s\n", (char *)commit->util);
179 else {
180 printf("%s ", find_unique_abbrev(commit->object.sha1, DEFAULT_ABBREV));
181 if (parse_commit(commit) != 0)
182 printf("(bad commit)\n");
183 else {
49b7120e
CC
184 const char *title;
185 int len = find_commit_subject(commit->buffer, &title);
186 if (len)
187 printf("%.*s\n", len, title);
9047ebbc
MV
188 }
189 }
190}
191
192static int add_cacheinfo(unsigned int mode, const unsigned char *sha1,
193 const char *path, int stage, int refresh, int options)
194{
195 struct cache_entry *ce;
196 ce = make_cache_entry(mode, sha1 ? sha1 : null_sha1, path, stage, refresh);
197 if (!ce)
198 return error("addinfo_cache failed for path '%s'", path);
199 return add_cache_entry(ce, options);
200}
201
9047ebbc
MV
202static void init_tree_desc_from_tree(struct tree_desc *desc, struct tree *tree)
203{
204 parse_tree(tree);
205 init_tree_desc(desc, tree->buffer, tree->size);
206}
207
208static int git_merge_trees(int index_only,
209 struct tree *common,
210 struct tree *head,
211 struct tree *merge)
212{
213 int rc;
214 struct tree_desc t[3];
215 struct unpack_trees_options opts;
216
217 memset(&opts, 0, sizeof(opts));
218 if (index_only)
219 opts.index_only = 1;
220 else
221 opts.update = 1;
222 opts.merge = 1;
223 opts.head_idx = 2;
224 opts.fn = threeway_merge;
225 opts.src_index = &the_index;
226 opts.dst_index = &the_index;
e294030f 227 setup_unpack_trees_porcelain(&opts, "merge");
9047ebbc
MV
228
229 init_tree_desc_from_tree(t+0, common);
230 init_tree_desc_from_tree(t+1, head);
231 init_tree_desc_from_tree(t+2, merge);
232
233 rc = unpack_trees(3, t, &opts);
234 cache_tree_free(&active_cache_tree);
235 return rc;
236}
237
8a2fce18 238struct tree *write_tree_from_memory(struct merge_options *o)
9047ebbc
MV
239{
240 struct tree *result = NULL;
241
242 if (unmerged_cache()) {
243 int i;
19c6a4f8 244 fprintf(stderr, "BUG: There are unmerged index entries:\n");
9047ebbc
MV
245 for (i = 0; i < active_nr; i++) {
246 struct cache_entry *ce = active_cache[i];
247 if (ce_stage(ce))
19c6a4f8
JH
248 fprintf(stderr, "BUG: %d %.*s", ce_stage(ce),
249 (int)ce_namelen(ce), ce->name);
9047ebbc 250 }
19c6a4f8 251 die("Bug in merge-recursive.c");
9047ebbc
MV
252 }
253
254 if (!active_cache_tree)
255 active_cache_tree = cache_tree();
256
257 if (!cache_tree_fully_valid(active_cache_tree) &&
258 cache_tree_update(active_cache_tree,
259 active_cache, active_nr, 0, 0) < 0)
260 die("error building trees");
261
262 result = lookup_tree(active_cache_tree->sha1);
263
264 return result;
265}
266
267static int save_files_dirs(const unsigned char *sha1,
268 const char *base, int baselen, const char *path,
269 unsigned int mode, int stage, void *context)
270{
271 int len = strlen(path);
272 char *newpath = xmalloc(baselen + len + 1);
696ee23c
MV
273 struct merge_options *o = context;
274
9047ebbc
MV
275 memcpy(newpath, base, baselen);
276 memcpy(newpath + baselen, path, len);
277 newpath[baselen + len] = '\0';
278
279 if (S_ISDIR(mode))
78a395d3 280 string_list_insert(&o->current_directory_set, newpath);
9047ebbc 281 else
78a395d3 282 string_list_insert(&o->current_file_set, newpath);
9047ebbc
MV
283 free(newpath);
284
d3bee161 285 return (S_ISDIR(mode) ? READ_TREE_RECURSIVE : 0);
9047ebbc
MV
286}
287
696ee23c 288static int get_files_dirs(struct merge_options *o, struct tree *tree)
9047ebbc
MV
289{
290 int n;
696ee23c 291 if (read_tree_recursive(tree, "", 0, 0, NULL, save_files_dirs, o))
9047ebbc 292 return 0;
696ee23c 293 n = o->current_file_set.nr + o->current_directory_set.nr;
9047ebbc
MV
294 return n;
295}
296
297/*
298 * Returns an index_entry instance which doesn't have to correspond to
299 * a real cache entry in Git's index.
300 */
301static struct stage_data *insert_stage_data(const char *path,
302 struct tree *o, struct tree *a, struct tree *b,
303 struct string_list *entries)
304{
305 struct string_list_item *item;
306 struct stage_data *e = xcalloc(1, sizeof(struct stage_data));
307 get_tree_entry(o->object.sha1, path,
308 e->stages[1].sha, &e->stages[1].mode);
309 get_tree_entry(a->object.sha1, path,
310 e->stages[2].sha, &e->stages[2].mode);
311 get_tree_entry(b->object.sha1, path,
312 e->stages[3].sha, &e->stages[3].mode);
78a395d3 313 item = string_list_insert(entries, path);
9047ebbc
MV
314 item->util = e;
315 return e;
316}
317
318/*
319 * Create a dictionary mapping file names to stage_data objects. The
320 * dictionary contains one entry for every path with a non-zero stage entry.
321 */
322static struct string_list *get_unmerged(void)
323{
324 struct string_list *unmerged = xcalloc(1, sizeof(struct string_list));
325 int i;
326
327 unmerged->strdup_strings = 1;
328
329 for (i = 0; i < active_nr; i++) {
330 struct string_list_item *item;
331 struct stage_data *e;
332 struct cache_entry *ce = active_cache[i];
333 if (!ce_stage(ce))
334 continue;
335
e8c8b713 336 item = string_list_lookup(unmerged, ce->name);
9047ebbc 337 if (!item) {
78a395d3 338 item = string_list_insert(unmerged, ce->name);
9047ebbc
MV
339 item->util = xcalloc(1, sizeof(struct stage_data));
340 }
341 e = item->util;
342 e->stages[ce_stage(ce)].mode = ce->ce_mode;
343 hashcpy(e->stages[ce_stage(ce)].sha, ce->sha1);
344 }
345
346 return unmerged;
347}
348
349struct rename
350{
351 struct diff_filepair *pair;
352 struct stage_data *src_entry;
353 struct stage_data *dst_entry;
354 unsigned processed:1;
355};
356
357/*
358 * Get information of all renames which occurred between 'o_tree' and
359 * 'tree'. We need the three trees in the merge ('o_tree', 'a_tree' and
360 * 'b_tree') to be able to associate the correct cache entries with
361 * the rename information. 'tree' is always equal to either a_tree or b_tree.
362 */
8a2fce18
MV
363static struct string_list *get_renames(struct merge_options *o,
364 struct tree *tree,
365 struct tree *o_tree,
366 struct tree *a_tree,
367 struct tree *b_tree,
368 struct string_list *entries)
9047ebbc
MV
369{
370 int i;
371 struct string_list *renames;
372 struct diff_options opts;
373
374 renames = xcalloc(1, sizeof(struct string_list));
375 diff_setup(&opts);
376 DIFF_OPT_SET(&opts, RECURSIVE);
377 opts.detect_rename = DIFF_DETECT_RENAME;
8a2fce18
MV
378 opts.rename_limit = o->merge_rename_limit >= 0 ? o->merge_rename_limit :
379 o->diff_rename_limit >= 0 ? o->diff_rename_limit :
9047ebbc
MV
380 500;
381 opts.warn_on_too_large_rename = 1;
382 opts.output_format = DIFF_FORMAT_NO_OUTPUT;
383 if (diff_setup_done(&opts) < 0)
384 die("diff setup failed");
385 diff_tree_sha1(o_tree->object.sha1, tree->object.sha1, "", &opts);
386 diffcore_std(&opts);
387 for (i = 0; i < diff_queued_diff.nr; ++i) {
388 struct string_list_item *item;
389 struct rename *re;
390 struct diff_filepair *pair = diff_queued_diff.queue[i];
391 if (pair->status != 'R') {
392 diff_free_filepair(pair);
393 continue;
394 }
395 re = xmalloc(sizeof(*re));
396 re->processed = 0;
397 re->pair = pair;
e8c8b713 398 item = string_list_lookup(entries, re->pair->one->path);
9047ebbc
MV
399 if (!item)
400 re->src_entry = insert_stage_data(re->pair->one->path,
401 o_tree, a_tree, b_tree, entries);
402 else
403 re->src_entry = item->util;
404
e8c8b713 405 item = string_list_lookup(entries, re->pair->two->path);
9047ebbc
MV
406 if (!item)
407 re->dst_entry = insert_stage_data(re->pair->two->path,
408 o_tree, a_tree, b_tree, entries);
409 else
410 re->dst_entry = item->util;
78a395d3 411 item = string_list_insert(renames, pair->one->path);
9047ebbc
MV
412 item->util = re;
413 }
414 opts.output_format = DIFF_FORMAT_NO_OUTPUT;
415 diff_queued_diff.nr = 0;
416 diff_flush(&opts);
417 return renames;
418}
419
2ff739f9 420static int update_stages_options(const char *path, struct diff_filespec *o,
9047ebbc 421 struct diff_filespec *a, struct diff_filespec *b,
2ff739f9 422 int clear, int options)
9047ebbc 423{
9047ebbc
MV
424 if (clear)
425 if (remove_file_from_cache(path))
426 return -1;
427 if (o)
428 if (add_cacheinfo(o->mode, o->sha1, path, 1, 0, options))
429 return -1;
430 if (a)
431 if (add_cacheinfo(a->mode, a->sha1, path, 2, 0, options))
432 return -1;
433 if (b)
434 if (add_cacheinfo(b->mode, b->sha1, path, 3, 0, options))
435 return -1;
436 return 0;
437}
438
2ff739f9
EN
439static int update_stages(const char *path, struct diff_filespec *o,
440 struct diff_filespec *a, struct diff_filespec *b,
441 int clear)
442{
443 int options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_OK_TO_REPLACE;
444 return update_stages_options(path, o, a, b, clear, options);
445}
446
447static int update_stages_and_entry(const char *path,
448 struct stage_data *entry,
449 struct diff_filespec *o,
450 struct diff_filespec *a,
451 struct diff_filespec *b,
452 int clear)
453{
454 int options;
455
456 entry->processed = 0;
457 entry->stages[1].mode = o->mode;
458 entry->stages[2].mode = a->mode;
459 entry->stages[3].mode = b->mode;
460 hashcpy(entry->stages[1].sha, o->sha1);
461 hashcpy(entry->stages[2].sha, a->sha1);
462 hashcpy(entry->stages[3].sha, b->sha1);
463 options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_SKIP_DFCHECK;
464 return update_stages_options(path, o, a, b, clear, options);
465}
466
b7fa51da
MV
467static int remove_file(struct merge_options *o, int clean,
468 const char *path, int no_wd)
9047ebbc 469{
b7fa51da
MV
470 int update_cache = o->call_depth || clean;
471 int update_working_directory = !o->call_depth && !no_wd;
9047ebbc
MV
472
473 if (update_cache) {
474 if (remove_file_from_cache(path))
475 return -1;
476 }
477 if (update_working_directory) {
25755e84 478 if (remove_path(path))
9047ebbc 479 return -1;
9047ebbc
MV
480 }
481 return 0;
482}
483
696ee23c 484static char *unique_path(struct merge_options *o, const char *path, const char *branch)
9047ebbc
MV
485{
486 char *newpath = xmalloc(strlen(path) + 1 + strlen(branch) + 8 + 1);
487 int suffix = 0;
488 struct stat st;
489 char *p = newpath + strlen(path);
490 strcpy(newpath, path);
491 *(p++) = '~';
492 strcpy(p, branch);
493 for (; *p; ++p)
494 if ('/' == *p)
495 *p = '_';
696ee23c
MV
496 while (string_list_has_string(&o->current_file_set, newpath) ||
497 string_list_has_string(&o->current_directory_set, newpath) ||
9047ebbc
MV
498 lstat(newpath, &st) == 0)
499 sprintf(p, "_%d", suffix++);
500
78a395d3 501 string_list_insert(&o->current_file_set, newpath);
9047ebbc
MV
502 return newpath;
503}
504
505static void flush_buffer(int fd, const char *buf, unsigned long size)
506{
507 while (size > 0) {
508 long ret = write_in_full(fd, buf, size);
509 if (ret < 0) {
510 /* Ignore epipe */
511 if (errno == EPIPE)
512 break;
d824cbba 513 die_errno("merge-recursive");
9047ebbc
MV
514 } else if (!ret) {
515 die("merge-recursive: disk full?");
516 }
517 size -= ret;
518 buf += ret;
519 }
520}
521
60c91181
JH
522static int would_lose_untracked(const char *path)
523{
524 int pos = cache_name_pos(path, strlen(path));
525
526 if (pos < 0)
527 pos = -1 - pos;
528 while (pos < active_nr &&
529 !strcmp(path, active_cache[pos]->name)) {
530 /*
531 * If stage #0, it is definitely tracked.
532 * If it has stage #2 then it was tracked
533 * before this merge started. All other
534 * cases the path was not tracked.
535 */
536 switch (ce_stage(active_cache[pos])) {
537 case 0:
538 case 2:
539 return 0;
540 }
541 pos++;
542 }
543 return file_exists(path);
544}
545
9047ebbc
MV
546static int make_room_for_path(const char *path)
547{
548 int status;
549 const char *msg = "failed to create path '%s'%s";
550
551 status = safe_create_leading_directories_const(path);
552 if (status) {
553 if (status == -3) {
554 /* something else exists */
555 error(msg, path, ": perhaps a D/F conflict?");
556 return -1;
557 }
558 die(msg, path, "");
559 }
560
60c91181
JH
561 /*
562 * Do not unlink a file in the work tree if we are not
563 * tracking it.
564 */
565 if (would_lose_untracked(path))
566 return error("refusing to lose untracked file at '%s'",
567 path);
568
9047ebbc
MV
569 /* Successful unlink is good.. */
570 if (!unlink(path))
571 return 0;
572 /* .. and so is no existing file */
573 if (errno == ENOENT)
574 return 0;
575 /* .. but not some other error (who really cares what?) */
576 return error(msg, path, ": perhaps a D/F conflict?");
577}
578
b7fa51da
MV
579static void update_file_flags(struct merge_options *o,
580 const unsigned char *sha,
9047ebbc
MV
581 unsigned mode,
582 const char *path,
583 int update_cache,
584 int update_wd)
585{
b7fa51da 586 if (o->call_depth)
9047ebbc
MV
587 update_wd = 0;
588
589 if (update_wd) {
590 enum object_type type;
591 void *buf;
592 unsigned long size;
593
68d03e4a 594 if (S_ISGITLINK(mode)) {
0c44c943
JH
595 /*
596 * We may later decide to recursively descend into
597 * the submodule directory and update its index
598 * and/or work tree, but we do not do that now.
599 */
68d03e4a 600 update_wd = 0;
0c44c943 601 goto update_index;
68d03e4a 602 }
9047ebbc
MV
603
604 buf = read_sha1_file(sha, &type, &size);
605 if (!buf)
606 die("cannot read object %s '%s'", sha1_to_hex(sha), path);
607 if (type != OBJ_BLOB)
608 die("blob expected for %s '%s'", sha1_to_hex(sha), path);
609 if (S_ISREG(mode)) {
f285a2d7 610 struct strbuf strbuf = STRBUF_INIT;
9047ebbc
MV
611 if (convert_to_working_tree(path, buf, size, &strbuf)) {
612 free(buf);
613 size = strbuf.len;
614 buf = strbuf_detach(&strbuf, NULL);
615 }
616 }
617
618 if (make_room_for_path(path) < 0) {
619 update_wd = 0;
620 free(buf);
621 goto update_index;
622 }
623 if (S_ISREG(mode) || (!has_symlinks && S_ISLNK(mode))) {
624 int fd;
625 if (mode & 0100)
626 mode = 0777;
627 else
628 mode = 0666;
629 fd = open(path, O_WRONLY | O_TRUNC | O_CREAT, mode);
630 if (fd < 0)
d824cbba 631 die_errno("failed to open '%s'", path);
9047ebbc
MV
632 flush_buffer(fd, buf, size);
633 close(fd);
634 } else if (S_ISLNK(mode)) {
635 char *lnk = xmemdupz(buf, size);
636 safe_create_leading_directories_const(path);
637 unlink(path);
304dcf26 638 if (symlink(lnk, path))
d824cbba 639 die_errno("failed to symlink '%s'", path);
9047ebbc
MV
640 free(lnk);
641 } else
642 die("do not know what to do with %06o %s '%s'",
643 mode, sha1_to_hex(sha), path);
644 free(buf);
645 }
646 update_index:
647 if (update_cache)
648 add_cacheinfo(mode, sha, path, 0, update_wd, ADD_CACHE_OK_TO_ADD);
649}
650
b7fa51da
MV
651static void update_file(struct merge_options *o,
652 int clean,
9047ebbc
MV
653 const unsigned char *sha,
654 unsigned mode,
655 const char *path)
656{
b7fa51da 657 update_file_flags(o, sha, mode, path, o->call_depth || clean, !o->call_depth);
9047ebbc
MV
658}
659
660/* Low level file merging, update and removal */
661
662struct merge_file_info
663{
664 unsigned char sha[20];
665 unsigned mode;
666 unsigned clean:1,
667 merge:1;
668};
669
b7fa51da
MV
670static int merge_3way(struct merge_options *o,
671 mmbuffer_t *result_buf,
672 struct diff_filespec *one,
9047ebbc
MV
673 struct diff_filespec *a,
674 struct diff_filespec *b,
675 const char *branch1,
676 const char *branch2)
677{
678 mmfile_t orig, src1, src2;
4c5868f4 679 char *base_name, *name1, *name2;
9047ebbc 680 int merge_status;
8cc5b290
AP
681 int favor;
682
683 if (o->call_depth)
684 favor = 0;
685 else {
686 switch (o->recursive_variant) {
687 case MERGE_RECURSIVE_OURS:
688 favor = XDL_MERGE_FAVOR_OURS;
689 break;
690 case MERGE_RECURSIVE_THEIRS:
691 favor = XDL_MERGE_FAVOR_THEIRS;
692 break;
693 default:
694 favor = 0;
695 break;
696 }
697 }
9047ebbc 698
4c5868f4
JN
699 if (strcmp(a->path, b->path) ||
700 (o->ancestor != NULL && strcmp(a->path, one->path) != 0)) {
701 base_name = o->ancestor == NULL ? NULL :
702 xstrdup(mkpath("%s:%s", o->ancestor, one->path));
606475f3
MR
703 name1 = xstrdup(mkpath("%s:%s", branch1, a->path));
704 name2 = xstrdup(mkpath("%s:%s", branch2, b->path));
705 } else {
4c5868f4
JN
706 base_name = o->ancestor == NULL ? NULL :
707 xstrdup(mkpath("%s", o->ancestor));
606475f3
MR
708 name1 = xstrdup(mkpath("%s", branch1));
709 name2 = xstrdup(mkpath("%s", branch2));
710 }
9047ebbc 711
06b65939
ML
712 read_mmblob(&orig, one->sha1);
713 read_mmblob(&src1, a->sha1);
714 read_mmblob(&src2, b->sha1);
9047ebbc 715
4c5868f4 716 merge_status = ll_merge(result_buf, a->path, &orig, base_name,
9047ebbc 717 &src1, name1, &src2, name2,
73cf7f71 718 ((o->call_depth ? LL_OPT_VIRTUAL_ANCESTOR : 0) |
18b037a5 719 (o->renormalize ? LL_OPT_RENORMALIZE : 0) |
73cf7f71 720 create_ll_flag(favor)));
9047ebbc
MV
721
722 free(name1);
723 free(name2);
724 free(orig.ptr);
725 free(src1.ptr);
726 free(src2.ptr);
727 return merge_status;
728}
729
b7fa51da
MV
730static struct merge_file_info merge_file(struct merge_options *o,
731 struct diff_filespec *one,
732 struct diff_filespec *a,
733 struct diff_filespec *b,
734 const char *branch1,
735 const char *branch2)
9047ebbc
MV
736{
737 struct merge_file_info result;
738 result.merge = 0;
739 result.clean = 1;
740
741 if ((S_IFMT & a->mode) != (S_IFMT & b->mode)) {
742 result.clean = 0;
743 if (S_ISREG(a->mode)) {
744 result.mode = a->mode;
745 hashcpy(result.sha, a->sha1);
746 } else {
747 result.mode = b->mode;
748 hashcpy(result.sha, b->sha1);
749 }
750 } else {
b7fa51da 751 if (!sha_eq(a->sha1, one->sha1) && !sha_eq(b->sha1, one->sha1))
9047ebbc
MV
752 result.merge = 1;
753
754 /*
755 * Merge modes
756 */
b7fa51da 757 if (a->mode == b->mode || a->mode == one->mode)
9047ebbc
MV
758 result.mode = b->mode;
759 else {
760 result.mode = a->mode;
b7fa51da 761 if (b->mode != one->mode) {
9047ebbc
MV
762 result.clean = 0;
763 result.merge = 1;
764 }
765 }
766
b7fa51da 767 if (sha_eq(a->sha1, b->sha1) || sha_eq(a->sha1, one->sha1))
9047ebbc 768 hashcpy(result.sha, b->sha1);
b7fa51da 769 else if (sha_eq(b->sha1, one->sha1))
9047ebbc
MV
770 hashcpy(result.sha, a->sha1);
771 else if (S_ISREG(a->mode)) {
772 mmbuffer_t result_buf;
773 int merge_status;
774
b7fa51da 775 merge_status = merge_3way(o, &result_buf, one, a, b,
9047ebbc
MV
776 branch1, branch2);
777
778 if ((merge_status < 0) || !result_buf.ptr)
779 die("Failed to execute internal merge");
780
781 if (write_sha1_file(result_buf.ptr, result_buf.size,
782 blob_type, result.sha))
783 die("Unable to add %s to database",
784 a->path);
785
786 free(result_buf.ptr);
787 result.clean = (merge_status == 0);
788 } else if (S_ISGITLINK(a->mode)) {
68d03e4a
HV
789 result.clean = merge_submodule(result.sha, one->path, one->sha1,
790 a->sha1, b->sha1);
9047ebbc
MV
791 } else if (S_ISLNK(a->mode)) {
792 hashcpy(result.sha, a->sha1);
793
794 if (!sha_eq(a->sha1, b->sha1))
795 result.clean = 0;
796 } else {
797 die("unsupported object type in the tree");
798 }
799 }
800
801 return result;
802}
803
6ef2cb00
EN
804static void conflict_rename_delete(struct merge_options *o,
805 struct diff_filepair *pair,
806 const char *rename_branch,
807 const char *other_branch)
808{
809 char *dest_name = pair->two->path;
810
811 output(o, 1, "CONFLICT (rename/delete): Rename %s->%s in %s "
812 "and deleted in %s",
813 pair->one->path, pair->two->path, rename_branch,
814 other_branch);
815 if (!o->call_depth)
816 update_stages(dest_name, NULL,
817 rename_branch == o->branch1 ? pair->two : NULL,
818 rename_branch == o->branch1 ? NULL : pair->two,
819 1);
820 update_file(o, 0, pair->two->sha1, pair->two->mode, dest_name);
821}
822
09c01f85 823static void conflict_rename_rename_1to2(struct merge_options *o,
36de1704 824 struct diff_filepair *pair1,
09c01f85 825 const char *branch1,
36de1704 826 struct diff_filepair *pair2,
09c01f85 827 const char *branch2)
9047ebbc 828{
09c01f85 829 /* One file was renamed in both branches, but to different names. */
9047ebbc
MV
830 char *del[2];
831 int delp = 0;
36de1704
EN
832 const char *ren1_dst = pair1->two->path;
833 const char *ren2_dst = pair2->two->path;
9047ebbc
MV
834 const char *dst_name1 = ren1_dst;
835 const char *dst_name2 = ren2_dst;
696ee23c
MV
836 if (string_list_has_string(&o->current_directory_set, ren1_dst)) {
837 dst_name1 = del[delp++] = unique_path(o, ren1_dst, branch1);
8a2fce18 838 output(o, 1, "%s is a directory in %s adding as %s instead",
9047ebbc 839 ren1_dst, branch2, dst_name1);
b7fa51da 840 remove_file(o, 0, ren1_dst, 0);
9047ebbc 841 }
696ee23c
MV
842 if (string_list_has_string(&o->current_directory_set, ren2_dst)) {
843 dst_name2 = del[delp++] = unique_path(o, ren2_dst, branch2);
8a2fce18 844 output(o, 1, "%s is a directory in %s adding as %s instead",
9047ebbc 845 ren2_dst, branch1, dst_name2);
b7fa51da 846 remove_file(o, 0, ren2_dst, 0);
9047ebbc 847 }
b7fa51da 848 if (o->call_depth) {
9047ebbc
MV
849 remove_file_from_cache(dst_name1);
850 remove_file_from_cache(dst_name2);
851 /*
852 * Uncomment to leave the conflicting names in the resulting tree
853 *
36de1704
EN
854 * update_file(o, 0, pair1->two->sha1, pair1->two->mode, dst_name1);
855 * update_file(o, 0, pair2->two->sha1, pair2->two->mode, dst_name2);
9047ebbc
MV
856 */
857 } else {
07413c5a
EN
858 update_stages(ren1_dst, NULL, pair1->two, NULL, 1);
859 update_stages(ren2_dst, NULL, NULL, pair2->two, 1);
860
861 update_file(o, 0, pair1->two->sha1, pair1->two->mode, dst_name1);
862 update_file(o, 0, pair2->two->sha1, pair2->two->mode, dst_name2);
9047ebbc
MV
863 }
864 while (delp--)
865 free(del[delp]);
866}
867
09c01f85
EN
868static void conflict_rename_rename_2to1(struct merge_options *o,
869 struct rename *ren1,
870 const char *branch1,
871 struct rename *ren2,
872 const char *branch2)
9047ebbc 873{
09c01f85 874 /* Two files were renamed to the same thing. */
696ee23c
MV
875 char *new_path1 = unique_path(o, ren1->pair->two->path, branch1);
876 char *new_path2 = unique_path(o, ren2->pair->two->path, branch2);
8a2fce18 877 output(o, 1, "Renaming %s to %s and %s to %s instead",
9047ebbc
MV
878 ren1->pair->one->path, new_path1,
879 ren2->pair->one->path, new_path2);
b7fa51da
MV
880 remove_file(o, 0, ren1->pair->two->path, 0);
881 update_file(o, 0, ren1->pair->two->sha1, ren1->pair->two->mode, new_path1);
882 update_file(o, 0, ren2->pair->two->sha1, ren2->pair->two->mode, new_path2);
9047ebbc
MV
883 free(new_path2);
884 free(new_path1);
885}
886
8a2fce18
MV
887static int process_renames(struct merge_options *o,
888 struct string_list *a_renames,
889 struct string_list *b_renames)
9047ebbc
MV
890{
891 int clean_merge = 1, i, j;
183113a5
TF
892 struct string_list a_by_dst = STRING_LIST_INIT_NODUP;
893 struct string_list b_by_dst = STRING_LIST_INIT_NODUP;
9047ebbc
MV
894 const struct rename *sre;
895
896 for (i = 0; i < a_renames->nr; i++) {
897 sre = a_renames->items[i].util;
78a395d3 898 string_list_insert(&a_by_dst, sre->pair->two->path)->util
9047ebbc
MV
899 = sre->dst_entry;
900 }
901 for (i = 0; i < b_renames->nr; i++) {
902 sre = b_renames->items[i].util;
78a395d3 903 string_list_insert(&b_by_dst, sre->pair->two->path)->util
9047ebbc
MV
904 = sre->dst_entry;
905 }
906
907 for (i = 0, j = 0; i < a_renames->nr || j < b_renames->nr;) {
9047ebbc 908 char *src;
8e24cbae 909 struct string_list *renames1, *renames2Dst;
9047ebbc
MV
910 struct rename *ren1 = NULL, *ren2 = NULL;
911 const char *branch1, *branch2;
912 const char *ren1_src, *ren1_dst;
913
914 if (i >= a_renames->nr) {
9047ebbc
MV
915 ren2 = b_renames->items[j++].util;
916 } else if (j >= b_renames->nr) {
9047ebbc
MV
917 ren1 = a_renames->items[i++].util;
918 } else {
8e24cbae
BK
919 int compare = strcmp(a_renames->items[i].string,
920 b_renames->items[j].string);
9047ebbc
MV
921 if (compare <= 0)
922 ren1 = a_renames->items[i++].util;
923 if (compare >= 0)
924 ren2 = b_renames->items[j++].util;
925 }
926
927 /* TODO: refactor, so that 1/2 are not needed */
928 if (ren1) {
929 renames1 = a_renames;
9047ebbc 930 renames2Dst = &b_by_dst;
8a2fce18
MV
931 branch1 = o->branch1;
932 branch2 = o->branch2;
9047ebbc
MV
933 } else {
934 struct rename *tmp;
935 renames1 = b_renames;
9047ebbc 936 renames2Dst = &a_by_dst;
8a2fce18
MV
937 branch1 = o->branch2;
938 branch2 = o->branch1;
9047ebbc
MV
939 tmp = ren2;
940 ren2 = ren1;
941 ren1 = tmp;
942 }
943 src = ren1->pair->one->path;
944
945 ren1->dst_entry->processed = 1;
946 ren1->src_entry->processed = 1;
947
948 if (ren1->processed)
949 continue;
950 ren1->processed = 1;
951
952 ren1_src = ren1->pair->one->path;
953 ren1_dst = ren1->pair->two->path;
954
955 if (ren2) {
956 const char *ren2_src = ren2->pair->one->path;
957 const char *ren2_dst = ren2->pair->two->path;
958 /* Renamed in 1 and renamed in 2 */
959 if (strcmp(ren1_src, ren2_src) != 0)
960 die("ren1.src != ren2.src");
961 ren2->dst_entry->processed = 1;
962 ren2->processed = 1;
963 if (strcmp(ren1_dst, ren2_dst) != 0) {
07413c5a
EN
964 setup_rename_df_conflict_info(RENAME_ONE_FILE_TO_TWO,
965 ren1->pair,
966 ren2->pair,
967 branch1,
968 branch2,
969 ren1->dst_entry,
970 ren2->dst_entry);
971 remove_file(o, 0, ren1_dst, 0);
972 /* ren2_dst not in head, so no need to delete */
9047ebbc 973 } else {
b7fa51da 974 remove_file(o, 1, ren1_src, 1);
161cf7f9
EN
975 update_stages_and_entry(ren1_dst,
976 ren1->dst_entry,
977 ren1->pair->one,
978 ren1->pair->two,
979 ren2->pair->two,
980 1 /* clear */);
9047ebbc
MV
981 }
982 } else {
983 /* Renamed in 1, maybe changed in 2 */
984 struct string_list_item *item;
985 /* we only use sha1 and mode of these */
986 struct diff_filespec src_other, dst_other;
41d70bd6 987 int try_merge;
9047ebbc 988
41d70bd6
EN
989 /*
990 * unpack_trees loads entries from common-commit
991 * into stage 1, from head-commit into stage 2, and
992 * from merge-commit into stage 3. We keep track
993 * of which side corresponds to the rename.
994 */
995 int renamed_stage = a_renames == renames1 ? 2 : 3;
996 int other_stage = a_renames == renames1 ? 3 : 2;
9047ebbc 997
41d70bd6 998 remove_file(o, 1, ren1_src, o->call_depth || renamed_stage == 2);
9047ebbc 999
41d70bd6
EN
1000 hashcpy(src_other.sha1, ren1->src_entry->stages[other_stage].sha);
1001 src_other.mode = ren1->src_entry->stages[other_stage].mode;
1002 hashcpy(dst_other.sha1, ren1->dst_entry->stages[other_stage].sha);
1003 dst_other.mode = ren1->dst_entry->stages[other_stage].mode;
9047ebbc
MV
1004 try_merge = 0;
1005
86273e57 1006 if (sha_eq(src_other.sha1, null_sha1)) {
3b130adf
EN
1007 if (string_list_has_string(&o->current_directory_set, ren1_dst)) {
1008 ren1->dst_entry->processed = 0;
1009 setup_rename_df_conflict_info(RENAME_DELETE,
1010 ren1->pair,
1011 NULL,
1012 branch1,
1013 branch2,
1014 ren1->dst_entry,
1015 NULL);
1016 remove_file(o, 0, ren1_dst, 0);
1017 } else {
1018 clean_merge = 0;
1019 conflict_rename_delete(o, ren1->pair, branch1, branch2);
1020 }
d5af5105
SK
1021 } else if ((dst_other.mode == ren1->pair->two->mode) &&
1022 sha_eq(dst_other.sha1, ren1->pair->two->sha1)) {
1023 /* Added file on the other side
1024 identical to the file being
1025 renamed: clean merge */
1026 update_file(o, 1, ren1->pair->two->sha1, ren1->pair->two->mode, ren1_dst);
9047ebbc
MV
1027 } else if (!sha_eq(dst_other.sha1, null_sha1)) {
1028 const char *new_path;
1029 clean_merge = 0;
1030 try_merge = 1;
8a2fce18 1031 output(o, 1, "CONFLICT (rename/add): Rename %s->%s in %s. "
9047ebbc
MV
1032 "%s added in %s",
1033 ren1_src, ren1_dst, branch1,
1034 ren1_dst, branch2);
c94736a2
JH
1035 if (o->call_depth) {
1036 struct merge_file_info mfi;
1037 struct diff_filespec one, a, b;
1038
1039 one.path = a.path = b.path =
1040 (char *)ren1_dst;
1041 hashcpy(one.sha1, null_sha1);
1042 one.mode = 0;
1043 hashcpy(a.sha1, ren1->pair->two->sha1);
1044 a.mode = ren1->pair->two->mode;
1045 hashcpy(b.sha1, dst_other.sha1);
1046 b.mode = dst_other.mode;
1047 mfi = merge_file(o, &one, &a, &b,
1048 branch1,
1049 branch2);
1050 output(o, 1, "Adding merged %s", ren1_dst);
1051 update_file(o, 0,
1052 mfi.sha,
1053 mfi.mode,
1054 ren1_dst);
2a669c34 1055 try_merge = 0;
c94736a2
JH
1056 } else {
1057 new_path = unique_path(o, ren1_dst, branch2);
1058 output(o, 1, "Adding as %s instead", new_path);
1059 update_file(o, 0, dst_other.sha1, dst_other.mode, new_path);
1060 }
e8c8b713 1061 } else if ((item = string_list_lookup(renames2Dst, ren1_dst))) {
9047ebbc
MV
1062 ren2 = item->util;
1063 clean_merge = 0;
1064 ren2->processed = 1;
8a2fce18
MV
1065 output(o, 1, "CONFLICT (rename/rename): "
1066 "Rename %s->%s in %s. "
9047ebbc
MV
1067 "Rename %s->%s in %s",
1068 ren1_src, ren1_dst, branch1,
1069 ren2->pair->one->path, ren2->pair->two->path, branch2);
09c01f85 1070 conflict_rename_rename_2to1(o, ren1, branch1, ren2, branch2);
9047ebbc
MV
1071 } else
1072 try_merge = 1;
1073
1074 if (try_merge) {
8a2fce18 1075 struct diff_filespec *one, *a, *b;
9047ebbc
MV
1076 struct merge_file_info mfi;
1077 src_other.path = (char *)ren1_src;
1078
8a2fce18 1079 one = ren1->pair->one;
9047ebbc
MV
1080 if (a_renames == renames1) {
1081 a = ren1->pair->two;
1082 b = &src_other;
1083 } else {
1084 b = ren1->pair->two;
1085 a = &src_other;
1086 }
b7fa51da 1087 mfi = merge_file(o, one, a, b,
8a2fce18 1088 o->branch1, o->branch2);
9047ebbc
MV
1089
1090 if (mfi.clean &&
1091 sha_eq(mfi.sha, ren1->pair->two->sha1) &&
5a2580d6 1092 mfi.mode == ren1->pair->two->mode) {
9047ebbc 1093 /*
a3e41367 1094 * This message is part of
9047ebbc
MV
1095 * t6022 test. If you change
1096 * it update the test too.
1097 */
8a2fce18 1098 output(o, 3, "Skipped %s (merged same as existing)", ren1_dst);
5a2580d6
EN
1099
1100 /* There may be higher stage entries left
1101 * in the index (e.g. due to a D/F
1102 * conflict) that need to be resolved.
1103 */
96ecac67
EN
1104 if (!ren1->dst_entry->stages[2].mode !=
1105 !ren1->dst_entry->stages[3].mode)
5a2580d6 1106 ren1->dst_entry->processed = 0;
5a2580d6 1107 } else {
9047ebbc 1108 if (mfi.merge || !mfi.clean)
8a2fce18 1109 output(o, 1, "Renaming %s => %s", ren1_src, ren1_dst);
9047ebbc 1110 if (mfi.merge)
8a2fce18 1111 output(o, 2, "Auto-merging %s", ren1_dst);
9047ebbc 1112 if (!mfi.clean) {
8a2fce18 1113 output(o, 1, "CONFLICT (rename/modify): Merge conflict in %s",
9047ebbc
MV
1114 ren1_dst);
1115 clean_merge = 0;
1116
b7fa51da 1117 if (!o->call_depth)
9047ebbc 1118 update_stages(ren1_dst,
8a2fce18 1119 one, a, b, 1);
9047ebbc 1120 }
b7fa51da 1121 update_file(o, mfi.clean, mfi.sha, mfi.mode, ren1_dst);
9047ebbc
MV
1122 }
1123 }
1124 }
1125 }
1126 string_list_clear(&a_by_dst, 0);
1127 string_list_clear(&b_by_dst, 0);
1128
1129 return clean_merge;
1130}
1131
1132static unsigned char *stage_sha(const unsigned char *sha, unsigned mode)
1133{
1134 return (is_null_sha1(sha) || mode == 0) ? NULL: (unsigned char *)sha;
1135}
1136
331a1838
EB
1137static int read_sha1_strbuf(const unsigned char *sha1, struct strbuf *dst)
1138{
1139 void *buf;
1140 enum object_type type;
1141 unsigned long size;
1142 buf = read_sha1_file(sha1, &type, &size);
1143 if (!buf)
1144 return error("cannot read object %s", sha1_to_hex(sha1));
1145 if (type != OBJ_BLOB) {
1146 free(buf);
1147 return error("object %s is not a blob", sha1_to_hex(sha1));
1148 }
1149 strbuf_attach(dst, buf, size, size + 1);
1150 return 0;
1151}
1152
1153static int blob_unchanged(const unsigned char *o_sha,
1154 const unsigned char *a_sha,
3e7589b7 1155 int renormalize, const char *path)
331a1838
EB
1156{
1157 struct strbuf o = STRBUF_INIT;
1158 struct strbuf a = STRBUF_INIT;
1159 int ret = 0; /* assume changed for safety */
1160
1161 if (sha_eq(o_sha, a_sha))
1162 return 1;
3e7589b7 1163 if (!renormalize)
331a1838
EB
1164 return 0;
1165
1166 assert(o_sha && a_sha);
1167 if (read_sha1_strbuf(o_sha, &o) || read_sha1_strbuf(a_sha, &a))
1168 goto error_return;
1169 /*
1170 * Note: binary | is used so that both renormalizations are
1171 * performed. Comparison can be skipped if both files are
1172 * unchanged since their sha1s have already been compared.
1173 */
1174 if (renormalize_buffer(path, o.buf, o.len, &o) |
1175 renormalize_buffer(path, a.buf, o.len, &a))
1176 ret = (o.len == a.len && !memcmp(o.buf, a.buf, o.len));
1177
1178error_return:
1179 strbuf_release(&o);
1180 strbuf_release(&a);
1181 return ret;
1182}
1183
5e3ce663
EN
1184static void handle_delete_modify(struct merge_options *o,
1185 const char *path,
1186 unsigned char *a_sha, int a_mode,
1187 unsigned char *b_sha, int b_mode)
1188{
1189 if (!a_sha) {
1190 output(o, 1, "CONFLICT (delete/modify): %s deleted in %s "
1191 "and modified in %s. Version %s of %s left in tree.",
1192 path, o->branch1,
1193 o->branch2, o->branch2, path);
1194 update_file(o, 0, b_sha, b_mode, path);
1195 } else {
1196 output(o, 1, "CONFLICT (delete/modify): %s deleted in %s "
1197 "and modified in %s. Version %s of %s left in tree.",
1198 path, o->branch2,
1199 o->branch1, o->branch1, path);
1200 update_file(o, 0, a_sha, a_mode, path);
1201 }
1202}
1203
0c4918d1
EN
1204
1205static int merge_content(struct merge_options *o,
1206 const char *path,
1207 unsigned char *o_sha, int o_mode,
1208 unsigned char *a_sha, int a_mode,
61b8bcae
EN
1209 unsigned char *b_sha, int b_mode,
1210 const char *df_rename_conflict_branch)
0c4918d1
EN
1211{
1212 const char *reason = "content";
1213 struct merge_file_info mfi;
1214 struct diff_filespec one, a, b;
1215
1216 if (!o_sha) {
1217 reason = "add/add";
1218 o_sha = (unsigned char *)null_sha1;
1219 }
1220 one.path = a.path = b.path = (char *)path;
1221 hashcpy(one.sha1, o_sha);
1222 one.mode = o_mode;
1223 hashcpy(a.sha1, a_sha);
1224 a.mode = a_mode;
1225 hashcpy(b.sha1, b_sha);
1226 b.mode = b_mode;
1227
1228 mfi = merge_file(o, &one, &a, &b, o->branch1, o->branch2);
1229 if (mfi.clean && sha_eq(mfi.sha, a_sha) && mfi.mode == a.mode)
1230 output(o, 3, "Skipped %s (merged same as existing)", path);
1231 else
1232 output(o, 2, "Auto-merging %s", path);
1233
1234 if (!mfi.clean) {
1235 if (S_ISGITLINK(mfi.mode))
1236 reason = "submodule";
1237 output(o, 1, "CONFLICT (%s): Merge conflict in %s",
1238 reason, path);
1239 }
1240
1241 update_file(o, mfi.clean, mfi.sha, mfi.mode, path);
1242 return mfi.clean;
1243
1244}
1245
9047ebbc 1246/* Per entry merge function */
8a2fce18
MV
1247static int process_entry(struct merge_options *o,
1248 const char *path, struct stage_data *entry)
9047ebbc
MV
1249{
1250 /*
1251 printf("processing entry, clean cache: %s\n", index_only ? "yes": "no");
1252 print_index_entry("\tpath: ", entry);
1253 */
1254 int clean_merge = 1;
1bc0ab7c 1255 int normalize = o->renormalize;
9047ebbc
MV
1256 unsigned o_mode = entry->stages[1].mode;
1257 unsigned a_mode = entry->stages[2].mode;
1258 unsigned b_mode = entry->stages[3].mode;
1259 unsigned char *o_sha = stage_sha(entry->stages[1].sha, o_mode);
1260 unsigned char *a_sha = stage_sha(entry->stages[2].sha, a_mode);
1261 unsigned char *b_sha = stage_sha(entry->stages[3].sha, b_mode);
1262
384c1668
EN
1263 if (entry->rename_df_conflict_info)
1264 return 1; /* Such cases are handled elsewhere. */
1265
37348937 1266 entry->processed = 1;
9047ebbc
MV
1267 if (o_sha && (!a_sha || !b_sha)) {
1268 /* Case A: Deleted in one */
1269 if ((!a_sha && !b_sha) ||
3e7589b7
JN
1270 (!b_sha && blob_unchanged(o_sha, a_sha, normalize, path)) ||
1271 (!a_sha && blob_unchanged(o_sha, b_sha, normalize, path))) {
9047ebbc
MV
1272 /* Deleted in both or deleted in one and
1273 * unchanged in the other */
1274 if (a_sha)
8a2fce18 1275 output(o, 2, "Removing %s", path);
9047ebbc 1276 /* do not touch working file if it did not exist */
b7fa51da 1277 remove_file(o, 1, path, !a_sha);
9047ebbc
MV
1278 } else {
1279 /* Deleted in one and changed in the other */
1280 clean_merge = 0;
5e3ce663
EN
1281 handle_delete_modify(o, path,
1282 a_sha, a_mode, b_sha, b_mode);
9047ebbc
MV
1283 }
1284
1285 } else if ((!o_sha && a_sha && !b_sha) ||
1286 (!o_sha && !a_sha && b_sha)) {
1287 /* Case B: Added in one. */
9047ebbc
MV
1288 unsigned mode;
1289 const unsigned char *sha;
9047ebbc
MV
1290
1291 if (a_sha) {
9047ebbc
MV
1292 mode = a_mode;
1293 sha = a_sha;
9047ebbc 1294 } else {
9047ebbc
MV
1295 mode = b_mode;
1296 sha = b_sha;
9047ebbc 1297 }
696ee23c 1298 if (string_list_has_string(&o->current_directory_set, path)) {
37348937
EN
1299 /* Handle D->F conflicts after all subfiles */
1300 entry->processed = 0;
1301 /* But get any file out of the way now, so conflicted
1302 * entries below the directory of the same name can
1303 * be put in the working directory.
1304 */
1305 if (a_sha)
1306 output(o, 2, "Removing %s", path);
1307 /* do not touch working file if it did not exist */
1308 remove_file(o, 0, path, !a_sha);
1309 return 1; /* Assume clean till processed */
9047ebbc 1310 } else {
8a2fce18 1311 output(o, 2, "Adding %s", path);
b7fa51da 1312 update_file(o, 1, sha, mode, path);
9047ebbc
MV
1313 }
1314 } else if (a_sha && b_sha) {
1315 /* Case C: Added in both (check for same permissions) and */
1316 /* case D: Modified in both, but differently. */
0c4918d1 1317 clean_merge = merge_content(o, path,
61b8bcae
EN
1318 o_sha, o_mode, a_sha, a_mode, b_sha, b_mode,
1319 NULL);
9047ebbc
MV
1320 } else if (!o_sha && !a_sha && !b_sha) {
1321 /*
1322 * this entry was deleted altogether. a_mode == 0 means
1323 * we had that path and want to actively remove it.
1324 */
b7fa51da 1325 remove_file(o, 1, path, !a_mode);
9047ebbc
MV
1326 } else
1327 die("Fatal merge failure, shouldn't happen.");
1328
1329 return clean_merge;
1330}
1331
37348937 1332/*
9c0bbb50
EN
1333 * Per entry merge function for D/F (and/or rename) conflicts. In the
1334 * cases we can cleanly resolve D/F conflicts, process_entry() can
1335 * clean out all the files below the directory for us. All D/F
1336 * conflict cases must be handled here at the end to make sure any
1337 * directories that can be cleaned out, are.
1338 *
1339 * Some rename conflicts may also be handled here that don't necessarily
1340 * involve D/F conflicts, since the code to handle them is generic enough
1341 * to handle those rename conflicts with or without D/F conflicts also
1342 * being involved.
37348937
EN
1343 */
1344static int process_df_entry(struct merge_options *o,
9c0bbb50 1345 const char *path, struct stage_data *entry)
37348937
EN
1346{
1347 int clean_merge = 1;
1348 unsigned o_mode = entry->stages[1].mode;
1349 unsigned a_mode = entry->stages[2].mode;
1350 unsigned b_mode = entry->stages[3].mode;
1351 unsigned char *o_sha = stage_sha(entry->stages[1].sha, o_mode);
1352 unsigned char *a_sha = stage_sha(entry->stages[2].sha, a_mode);
1353 unsigned char *b_sha = stage_sha(entry->stages[3].sha, b_mode);
37348937
EN
1354 struct stat st;
1355
37348937 1356 entry->processed = 1;
9c0bbb50 1357 if (entry->rename_df_conflict_info) {
07413c5a
EN
1358 struct rename_df_conflict_info *conflict_info = entry->rename_df_conflict_info;
1359 char *src;
1360 switch (conflict_info->rename_type) {
3b130adf
EN
1361 case RENAME_DELETE:
1362 clean_merge = 0;
1363 conflict_rename_delete(o, conflict_info->pair1,
1364 conflict_info->branch1,
1365 conflict_info->branch2);
1366 break;
07413c5a
EN
1367 case RENAME_ONE_FILE_TO_TWO:
1368 src = conflict_info->pair1->one->path;
1369 clean_merge = 0;
1370 output(o, 1, "CONFLICT (rename/rename): "
1371 "Rename \"%s\"->\"%s\" in branch \"%s\" "
1372 "rename \"%s\"->\"%s\" in \"%s\"%s",
1373 src, conflict_info->pair1->two->path, conflict_info->branch1,
1374 src, conflict_info->pair2->two->path, conflict_info->branch2,
1375 o->call_depth ? " (left unresolved)" : "");
1376 if (o->call_depth) {
1377 remove_file_from_cache(src);
1378 update_file(o, 0, conflict_info->pair1->one->sha1,
1379 conflict_info->pair1->one->mode, src);
1380 }
1381 conflict_rename_rename_1to2(o, conflict_info->pair1,
1382 conflict_info->branch1,
1383 conflict_info->pair2,
1384 conflict_info->branch2);
1385 conflict_info->dst_entry2->processed = 1;
1386 break;
1387 default:
1388 entry->processed = 0;
1389 break;
1390 }
9c0bbb50
EN
1391 } else if (!o_sha && !!a_sha != !!b_sha) {
1392 /* directory -> (directory, file) */
1393 const char *add_branch;
1394 const char *other_branch;
1395 unsigned mode;
1396 const unsigned char *sha;
1397 const char *conf;
37348937 1398
9c0bbb50
EN
1399 if (a_sha) {
1400 add_branch = o->branch1;
1401 other_branch = o->branch2;
1402 mode = a_mode;
1403 sha = a_sha;
1404 conf = "file/directory";
1405 } else {
1406 add_branch = o->branch2;
1407 other_branch = o->branch1;
1408 mode = b_mode;
1409 sha = b_sha;
1410 conf = "directory/file";
1411 }
1412 if (lstat(path, &st) == 0 && S_ISDIR(st.st_mode)) {
1413 const char *new_path = unique_path(o, path, add_branch);
1414 clean_merge = 0;
1415 output(o, 1, "CONFLICT (%s): There is a directory with name %s in %s. "
1416 "Adding %s as %s",
1417 conf, path, other_branch, path, new_path);
1418 remove_file(o, 0, path, 0);
1419 update_file(o, 0, sha, mode, new_path);
1420 } else {
1421 output(o, 2, "Adding %s", path);
1422 update_file(o, 1, sha, mode, path);
1423 }
37348937 1424 } else {
9c0bbb50
EN
1425 entry->processed = 0;
1426 return 1; /* not handled; assume clean until processed */
37348937
EN
1427 }
1428
1429 return clean_merge;
1430}
1431
8a2fce18
MV
1432int merge_trees(struct merge_options *o,
1433 struct tree *head,
9047ebbc
MV
1434 struct tree *merge,
1435 struct tree *common,
9047ebbc
MV
1436 struct tree **result)
1437{
1438 int code, clean;
1439
85e51b78
JH
1440 if (o->subtree_shift) {
1441 merge = shift_tree_object(head, merge, o->subtree_shift);
1442 common = shift_tree_object(head, common, o->subtree_shift);
9047ebbc
MV
1443 }
1444
1445 if (sha_eq(common->object.sha1, merge->object.sha1)) {
5e5ffa09 1446 output(o, 0, "Already up-to-date!");
9047ebbc
MV
1447 *result = head;
1448 return 1;
1449 }
1450
b7fa51da 1451 code = git_merge_trees(o->call_depth, common, head, merge);
9047ebbc 1452
fadd069d
JH
1453 if (code != 0) {
1454 if (show(o, 4) || o->call_depth)
1455 die("merging of trees %s and %s failed",
1456 sha1_to_hex(head->object.sha1),
1457 sha1_to_hex(merge->object.sha1));
1458 else
1459 exit(128);
1460 }
9047ebbc
MV
1461
1462 if (unmerged_cache()) {
1463 struct string_list *entries, *re_head, *re_merge;
1464 int i;
696ee23c
MV
1465 string_list_clear(&o->current_file_set, 1);
1466 string_list_clear(&o->current_directory_set, 1);
1467 get_files_dirs(o, head);
1468 get_files_dirs(o, merge);
9047ebbc
MV
1469
1470 entries = get_unmerged();
8a2fce18
MV
1471 re_head = get_renames(o, head, common, head, merge, entries);
1472 re_merge = get_renames(o, merge, common, head, merge, entries);
1473 clean = process_renames(o, re_head, re_merge);
9047ebbc
MV
1474 for (i = 0; i < entries->nr; i++) {
1475 const char *path = entries->items[i].string;
1476 struct stage_data *e = entries->items[i].util;
1477 if (!e->processed
8a2fce18 1478 && !process_entry(o, path, e))
9047ebbc
MV
1479 clean = 0;
1480 }
37348937
EN
1481 for (i = 0; i < entries->nr; i++) {
1482 const char *path = entries->items[i].string;
1483 struct stage_data *e = entries->items[i].util;
1484 if (!e->processed
1485 && !process_df_entry(o, path, e))
1486 clean = 0;
1487 }
7edba4c4
JH
1488 for (i = 0; i < entries->nr; i++) {
1489 struct stage_data *e = entries->items[i].util;
1490 if (!e->processed)
1491 die("Unprocessed path??? %s",
1492 entries->items[i].string);
1493 }
9047ebbc
MV
1494
1495 string_list_clear(re_merge, 0);
1496 string_list_clear(re_head, 0);
1497 string_list_clear(entries, 1);
1498
1499 }
1500 else
1501 clean = 1;
1502
b7fa51da 1503 if (o->call_depth)
8a2fce18 1504 *result = write_tree_from_memory(o);
9047ebbc
MV
1505
1506 return clean;
1507}
1508
1509static struct commit_list *reverse_commit_list(struct commit_list *list)
1510{
1511 struct commit_list *next = NULL, *current, *backup;
1512 for (current = list; current; current = backup) {
1513 backup = current->next;
1514 current->next = next;
1515 next = current;
1516 }
1517 return next;
1518}
1519
1520/*
1521 * Merge the commits h1 and h2, return the resulting virtual
1522 * commit object and a flag indicating the cleanness of the merge.
1523 */
8a2fce18
MV
1524int merge_recursive(struct merge_options *o,
1525 struct commit *h1,
9047ebbc 1526 struct commit *h2,
9047ebbc
MV
1527 struct commit_list *ca,
1528 struct commit **result)
1529{
1530 struct commit_list *iter;
1531 struct commit *merged_common_ancestors;
1532 struct tree *mrtree = mrtree;
1533 int clean;
1534
8a2fce18
MV
1535 if (show(o, 4)) {
1536 output(o, 4, "Merging:");
5033639c
MV
1537 output_commit_title(o, h1);
1538 output_commit_title(o, h2);
9047ebbc
MV
1539 }
1540
1541 if (!ca) {
1542 ca = get_merge_bases(h1, h2, 1);
1543 ca = reverse_commit_list(ca);
1544 }
1545
8a2fce18
MV
1546 if (show(o, 5)) {
1547 output(o, 5, "found %u common ancestor(s):", commit_list_count(ca));
9047ebbc 1548 for (iter = ca; iter; iter = iter->next)
5033639c 1549 output_commit_title(o, iter->item);
9047ebbc
MV
1550 }
1551
1552 merged_common_ancestors = pop_commit(&ca);
1553 if (merged_common_ancestors == NULL) {
1554 /* if there is no common ancestor, make an empty tree */
1555 struct tree *tree = xcalloc(1, sizeof(struct tree));
1556
1557 tree->object.parsed = 1;
1558 tree->object.type = OBJ_TREE;
1559 pretend_sha1_file(NULL, 0, OBJ_TREE, tree->object.sha1);
1560 merged_common_ancestors = make_virtual_commit(tree, "ancestor");
1561 }
1562
1563 for (iter = ca; iter; iter = iter->next) {
8a2fce18 1564 const char *saved_b1, *saved_b2;
5033639c 1565 o->call_depth++;
9047ebbc
MV
1566 /*
1567 * When the merge fails, the result contains files
1568 * with conflict markers. The cleanness flag is
1569 * ignored, it was never actually used, as result of
1570 * merge_trees has always overwritten it: the committed
1571 * "conflicts" were already resolved.
1572 */
1573 discard_cache();
8a2fce18
MV
1574 saved_b1 = o->branch1;
1575 saved_b2 = o->branch2;
1576 o->branch1 = "Temporary merge branch 1";
1577 o->branch2 = "Temporary merge branch 2";
1578 merge_recursive(o, merged_common_ancestors, iter->item,
1579 NULL, &merged_common_ancestors);
1580 o->branch1 = saved_b1;
1581 o->branch2 = saved_b2;
5033639c 1582 o->call_depth--;
9047ebbc
MV
1583
1584 if (!merged_common_ancestors)
1585 die("merge returned no commit");
1586 }
1587
1588 discard_cache();
b7fa51da 1589 if (!o->call_depth)
9047ebbc 1590 read_cache();
9047ebbc 1591
7ca56aa0 1592 o->ancestor = "merged common ancestors";
8a2fce18
MV
1593 clean = merge_trees(o, h1->tree, h2->tree, merged_common_ancestors->tree,
1594 &mrtree);
9047ebbc 1595
b7fa51da 1596 if (o->call_depth) {
9047ebbc
MV
1597 *result = make_virtual_commit(mrtree, "merged tree");
1598 commit_list_insert(h1, &(*result)->parents);
1599 commit_list_insert(h2, &(*result)->parents->next);
1600 }
c7d84924 1601 flush_output(o);
9047ebbc
MV
1602 return clean;
1603}
1604
73118f89
SB
1605static struct commit *get_ref(const unsigned char *sha1, const char *name)
1606{
1607 struct object *object;
1608
1609 object = deref_tag(parse_object(sha1), name, strlen(name));
1610 if (!object)
1611 return NULL;
1612 if (object->type == OBJ_TREE)
1613 return make_virtual_commit((struct tree*)object, name);
1614 if (object->type != OBJ_COMMIT)
1615 return NULL;
1616 if (parse_commit((struct commit *)object))
1617 return NULL;
1618 return (struct commit *)object;
1619}
1620
8a2fce18
MV
1621int merge_recursive_generic(struct merge_options *o,
1622 const unsigned char *head,
1623 const unsigned char *merge,
1624 int num_base_list,
1625 const unsigned char **base_list,
1626 struct commit **result)
73118f89
SB
1627{
1628 int clean, index_fd;
1629 struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
8a2fce18
MV
1630 struct commit *head_commit = get_ref(head, o->branch1);
1631 struct commit *next_commit = get_ref(merge, o->branch2);
73118f89
SB
1632 struct commit_list *ca = NULL;
1633
1634 if (base_list) {
1635 int i;
8a2fce18 1636 for (i = 0; i < num_base_list; ++i) {
73118f89 1637 struct commit *base;
8a2fce18 1638 if (!(base = get_ref(base_list[i], sha1_to_hex(base_list[i]))))
73118f89 1639 return error("Could not parse object '%s'",
8a2fce18 1640 sha1_to_hex(base_list[i]));
73118f89
SB
1641 commit_list_insert(base, &ca);
1642 }
1643 }
1644
1645 index_fd = hold_locked_index(lock, 1);
8a2fce18
MV
1646 clean = merge_recursive(o, head_commit, next_commit, ca,
1647 result);
73118f89
SB
1648 if (active_cache_changed &&
1649 (write_cache(index_fd, active_cache, active_nr) ||
1650 commit_locked_index(lock)))
1651 return error("Unable to write index.");
1652
1653 return clean ? 0 : 1;
1654}
1655
8a2fce18 1656static int merge_recursive_config(const char *var, const char *value, void *cb)
9047ebbc 1657{
8a2fce18 1658 struct merge_options *o = cb;
9047ebbc 1659 if (!strcasecmp(var, "merge.verbosity")) {
8a2fce18 1660 o->verbosity = git_config_int(var, value);
9047ebbc
MV
1661 return 0;
1662 }
1663 if (!strcasecmp(var, "diff.renamelimit")) {
8a2fce18 1664 o->diff_rename_limit = git_config_int(var, value);
9047ebbc
MV
1665 return 0;
1666 }
1667 if (!strcasecmp(var, "merge.renamelimit")) {
8a2fce18 1668 o->merge_rename_limit = git_config_int(var, value);
9047ebbc
MV
1669 return 0;
1670 }
e137a892 1671 return git_xmerge_config(var, value, cb);
9047ebbc
MV
1672}
1673
8a2fce18 1674void init_merge_options(struct merge_options *o)
9047ebbc 1675{
8a2fce18
MV
1676 memset(o, 0, sizeof(struct merge_options));
1677 o->verbosity = 2;
1678 o->buffer_output = 1;
1679 o->diff_rename_limit = -1;
1680 o->merge_rename_limit = -1;
7610fa57 1681 o->renormalize = 0;
8a2fce18 1682 git_config(merge_recursive_config, o);
9047ebbc 1683 if (getenv("GIT_MERGE_VERBOSITY"))
8a2fce18 1684 o->verbosity =
9047ebbc 1685 strtol(getenv("GIT_MERGE_VERBOSITY"), NULL, 10);
8a2fce18
MV
1686 if (o->verbosity >= 5)
1687 o->buffer_output = 0;
c7d84924 1688 strbuf_init(&o->obuf, 0);
696ee23c
MV
1689 memset(&o->current_file_set, 0, sizeof(struct string_list));
1690 o->current_file_set.strdup_strings = 1;
1691 memset(&o->current_directory_set, 0, sizeof(struct string_list));
1692 o->current_directory_set.strdup_strings = 1;
9047ebbc 1693}