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