Make 'unpack_trees()' take the index to work on as an argument
[git/git.git] / builtin-merge-recursive.c
CommitLineData
6d297f81
JS
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 */
6d297f81
JS
6#include "cache.h"
7#include "cache-tree.h"
8#include "commit.h"
9#include "blob.h"
e1b3a2ca 10#include "builtin.h"
6d297f81
JS
11#include "tree-walk.h"
12#include "diff.h"
13#include "diffcore.h"
14#include "run-command.h"
15#include "tag.h"
7a85b848 16#include "unpack-trees.h"
6d297f81 17#include "path-list.h"
c2b4faea 18#include "xdiff-interface.h"
f3ef6b6b 19#include "interpolate.h"
a129d96f 20#include "attr.h"
e1b3a2ca 21#include "merge-recursive.h"
6d297f81 22
68faf689
JH
23static int subtree_merge;
24
25static struct tree *shift_tree_object(struct tree *one, struct tree *two)
26{
27 unsigned char shifted[20];
28
29 /*
30 * NEEDSWORK: this limits the recursion depth to hardcoded
31 * value '2' to avoid excessive overhead.
32 */
33 shift_tree(one->object.sha1, two->object.sha1, shifted, 2);
34 if (!hashcmp(two->object.sha1, shifted))
35 return two;
36 return lookup_tree(shifted);
37}
38
6d297f81
JS
39/*
40 * A virtual commit has
41 * - (const char *)commit->util set to the name, and
42 * - *(int *)commit->object.sha1 set to the virtual id.
43 */
6d297f81
JS
44
45static unsigned commit_list_count(const struct commit_list *l)
46{
47 unsigned c = 0;
48 for (; l; l = l->next )
49 c++;
50 return c;
51}
52
53static struct commit *make_virtual_commit(struct tree *tree, const char *comment)
54{
55 struct commit *commit = xcalloc(1, sizeof(struct commit));
56 static unsigned virtual_id = 1;
57 commit->tree = tree;
58 commit->util = (void*)comment;
59 *(int*)commit->object.sha1 = virtual_id++;
c1f3089e
JS
60 /* avoid warnings */
61 commit->object.parsed = 1;
6d297f81
JS
62 return commit;
63}
64
65/*
3058e933
JS
66 * Since we use get_tree_entry(), which does not put the read object into
67 * the object pool, we cannot rely on a == b.
6d297f81
JS
68 */
69static int sha_eq(const unsigned char *a, const unsigned char *b)
70{
3af244ca 71 if (!a && !b)
6d297f81 72 return 2;
87cb004e 73 return a && b && hashcmp(a, b) == 0;
6d297f81
JS
74}
75
6d297f81 76/*
3058e933
JS
77 * Since we want to write the index eventually, we cannot reuse the index
78 * for these (temporary) data.
6d297f81
JS
79 */
80struct stage_data
81{
82 struct
83 {
84 unsigned mode;
85 unsigned char sha[20];
86 } stages[4];
87 unsigned processed:1;
88};
89
5a753613
JS
90static struct path_list current_file_set = {NULL, 0, 0, 1};
91static struct path_list current_directory_set = {NULL, 0, 0, 1};
6d297f81 92
63889639 93static int call_depth = 0;
8c3275ab 94static int verbosity = 2;
df3a02f6 95static int rename_limit = -1;
66a155bc 96static int buffer_output = 1;
19247e55 97static struct strbuf obuf = STRBUF_INIT;
6d297f81 98
19247e55 99static int show(int v)
8c3275ab
SP
100{
101 return (!call_depth && verbosity >= v) || verbosity >= 5;
102}
103
19247e55 104static void flush_output(void)
6d297f81 105{
19247e55
PH
106 if (obuf.len) {
107 fputs(obuf.buf, stdout);
108 strbuf_reset(&obuf);
8c3275ab 109 }
6d297f81
JS
110}
111
19247e55 112static void output(int v, const char *fmt, ...)
66a155bc 113{
19247e55
PH
114 int len;
115 va_list ap;
116
117 if (!show(v))
118 return;
119
120 strbuf_grow(&obuf, call_depth * 2 + 2);
121 memset(obuf.buf + obuf.len, ' ', call_depth * 2);
122 strbuf_setlen(&obuf, obuf.len + call_depth * 2);
123
124 va_start(ap, fmt);
125 len = vsnprintf(obuf.buf + obuf.len, strbuf_avail(&obuf), fmt, ap);
126 va_end(ap);
127
128 if (len < 0)
129 len = 0;
130 if (len >= strbuf_avail(&obuf)) {
131 strbuf_grow(&obuf, len + 2);
132 va_start(ap, fmt);
133 len = vsnprintf(obuf.buf + obuf.len, strbuf_avail(&obuf), fmt, ap);
134 va_end(ap);
135 if (len >= strbuf_avail(&obuf)) {
136 die("this should not happen, your snprintf is broken");
137 }
66a155bc 138 }
19247e55
PH
139 strbuf_setlen(&obuf, obuf.len + len);
140 strbuf_add(&obuf, "\n", 1);
141 if (!buffer_output)
142 flush_output();
66a155bc
SP
143}
144
3af244ca
JS
145static void output_commit_title(struct commit *commit)
146{
147 int i;
66a155bc 148 flush_output();
63889639 149 for (i = call_depth; i--;)
3af244ca
JS
150 fputs(" ", stdout);
151 if (commit->util)
152 printf("virtual %s\n", (char *)commit->util);
153 else {
9926ba98 154 printf("%s ", find_unique_abbrev(commit->object.sha1, DEFAULT_ABBREV));
3af244ca
JS
155 if (parse_commit(commit) != 0)
156 printf("(bad commit)\n");
157 else {
158 const char *s;
159 int len;
160 for (s = commit->buffer; *s; s++)
161 if (*s == '\n' && s[1] == '\n') {
162 s += 2;
163 break;
164 }
165 for (len = 0; s[len] && '\n' != s[len]; len++)
166 ; /* do nothing */
167 printf("%.*s\n", len, s);
168 }
169 }
170}
171
6d297f81
JS
172static int add_cacheinfo(unsigned int mode, const unsigned char *sha1,
173 const char *path, int stage, int refresh, int options)
174{
175 struct cache_entry *ce;
6d297f81
JS
176 ce = make_cache_entry(mode, sha1 ? sha1 : null_sha1, path, stage, refresh);
177 if (!ce)
0424138d 178 return error("addinfo_cache failed for path '%s'", path);
6d297f81
JS
179 return add_cache_entry(ce, options);
180}
181
182/*
183 * This is a global variable which is used in a number of places but
184 * only written to in the 'merge' function.
185 *
186 * index_only == 1 => Don't leave any non-stage 0 entries in the cache and
187 * don't update the working directory.
188 * 0 => Leave unmerged entries in the cache and update
189 * the working directory.
190 */
191static int index_only = 0;
192
933bf40a
LT
193static void init_tree_desc_from_tree(struct tree_desc *desc, struct tree *tree)
194{
195 parse_tree(tree);
196 init_tree_desc(desc, tree->buffer, tree->size);
197}
198
7a85b848 199static int git_merge_trees(int index_only,
6d297f81
JS
200 struct tree *common,
201 struct tree *head,
202 struct tree *merge)
203{
3af244ca 204 int rc;
933bf40a 205 struct tree_desc t[3];
7a85b848
JS
206 struct unpack_trees_options opts;
207
7a85b848
JS
208 memset(&opts, 0, sizeof(opts));
209 if (index_only)
210 opts.index_only = 1;
211 else
212 opts.update = 1;
213 opts.merge = 1;
214 opts.head_idx = 2;
215 opts.fn = threeway_merge;
bc052d7f 216 opts.index = &the_index;
7a85b848 217
933bf40a
LT
218 init_tree_desc_from_tree(t+0, common);
219 init_tree_desc_from_tree(t+1, head);
220 init_tree_desc_from_tree(t+2, merge);
7a85b848 221
933bf40a 222 rc = unpack_trees(3, t, &opts);
7a85b848 223 cache_tree_free(&active_cache_tree);
7a85b848 224 return rc;
6d297f81
JS
225}
226
e1b3a2ca 227struct tree *write_tree_from_memory(void)
6d297f81 228{
5b982f84
JS
229 struct tree *result = NULL;
230
94a5728c 231 if (unmerged_cache()) {
a97e4075
AR
232 int i;
233 output(0, "There are unmerged index entries:");
234 for (i = 0; i < active_nr; i++) {
235 struct cache_entry *ce = active_cache[i];
236 if (ce_stage(ce))
237 output(0, "%d %.*s", ce_stage(ce), ce_namelen(ce), ce->name);
238 }
8b944b56 239 return NULL;
a97e4075 240 }
5b982f84
JS
241
242 if (!active_cache_tree)
243 active_cache_tree = cache_tree();
244
245 if (!cache_tree_fully_valid(active_cache_tree) &&
8b944b56
JH
246 cache_tree_update(active_cache_tree,
247 active_cache, active_nr, 0, 0) < 0)
5b982f84
JS
248 die("error building trees");
249
250 result = lookup_tree(active_cache_tree->sha1);
251
5b982f84 252 return result;
6d297f81
JS
253}
254
6d297f81
JS
255static int save_files_dirs(const unsigned char *sha1,
256 const char *base, int baselen, const char *path,
257 unsigned int mode, int stage)
258{
259 int len = strlen(path);
2d7320d0 260 char *newpath = xmalloc(baselen + len + 1);
6d297f81
JS
261 memcpy(newpath, base, baselen);
262 memcpy(newpath + baselen, path, len);
263 newpath[baselen + len] = '\0';
264
265 if (S_ISDIR(mode))
5a753613 266 path_list_insert(newpath, &current_directory_set);
6d297f81 267 else
5a753613 268 path_list_insert(newpath, &current_file_set);
6d297f81
JS
269 free(newpath);
270
271 return READ_TREE_RECURSIVE;
272}
273
3af244ca 274static int get_files_dirs(struct tree *tree)
6d297f81
JS
275{
276 int n;
bd669986 277 if (read_tree_recursive(tree, "", 0, 0, NULL, save_files_dirs) != 0)
6d297f81 278 return 0;
5a753613 279 n = current_file_set.nr + current_directory_set.nr;
6d297f81
JS
280 return n;
281}
282
6d297f81 283/*
790296fd 284 * Returns an index_entry instance which doesn't have to correspond to
6d297f81
JS
285 * a real cache entry in Git's index.
286 */
3af244ca
JS
287static struct stage_data *insert_stage_data(const char *path,
288 struct tree *o, struct tree *a, struct tree *b,
289 struct path_list *entries)
6d297f81 290{
3af244ca 291 struct path_list_item *item;
6d297f81
JS
292 struct stage_data *e = xcalloc(1, sizeof(struct stage_data));
293 get_tree_entry(o->object.sha1, path,
294 e->stages[1].sha, &e->stages[1].mode);
295 get_tree_entry(a->object.sha1, path,
296 e->stages[2].sha, &e->stages[2].mode);
297 get_tree_entry(b->object.sha1, path,
298 e->stages[3].sha, &e->stages[3].mode);
3af244ca
JS
299 item = path_list_insert(path, entries);
300 item->util = e;
6d297f81
JS
301 return e;
302}
303
6d297f81 304/*
5a753613 305 * Create a dictionary mapping file names to stage_data objects. The
6d297f81
JS
306 * dictionary contains one entry for every path with a non-zero stage entry.
307 */
3af244ca 308static struct path_list *get_unmerged(void)
6d297f81
JS
309{
310 struct path_list *unmerged = xcalloc(1, sizeof(struct path_list));
311 int i;
312
313 unmerged->strdup_paths = 1;
8b944b56 314
ad57cbca 315 for (i = 0; i < active_nr; i++) {
3af244ca
JS
316 struct path_list_item *item;
317 struct stage_data *e;
6d297f81
JS
318 struct cache_entry *ce = active_cache[i];
319 if (!ce_stage(ce))
320 continue;
321
3af244ca
JS
322 item = path_list_lookup(ce->name, unmerged);
323 if (!item) {
324 item = path_list_insert(ce->name, unmerged);
325 item->util = xcalloc(1, sizeof(struct stage_data));
326 }
327 e = item->util;
7a51ed66 328 e->stages[ce_stage(ce)].mode = ce->ce_mode;
8da71493 329 hashcpy(e->stages[ce_stage(ce)].sha, ce->sha1);
6d297f81
JS
330 }
331
6d297f81
JS
332 return unmerged;
333}
334
335struct rename
336{
337 struct diff_filepair *pair;
338 struct stage_data *src_entry;
339 struct stage_data *dst_entry;
340 unsigned processed:1;
341};
342
6d297f81 343/*
3dff5379 344 * Get information of all renames which occurred between 'o_tree' and
5a753613
JS
345 * 'tree'. We need the three trees in the merge ('o_tree', 'a_tree' and
346 * 'b_tree') to be able to associate the correct cache entries with
347 * the rename information. 'tree' is always equal to either a_tree or b_tree.
6d297f81
JS
348 */
349static struct path_list *get_renames(struct tree *tree,
5a753613
JS
350 struct tree *o_tree,
351 struct tree *a_tree,
352 struct tree *b_tree,
6d297f81
JS
353 struct path_list *entries)
354{
3af244ca
JS
355 int i;
356 struct path_list *renames;
357 struct diff_options opts;
3af244ca
JS
358
359 renames = xcalloc(1, sizeof(struct path_list));
6d297f81 360 diff_setup(&opts);
8f67f8ae 361 DIFF_OPT_SET(&opts, RECURSIVE);
6d297f81 362 opts.detect_rename = DIFF_DETECT_RENAME;
df3a02f6 363 opts.rename_limit = rename_limit;
6d297f81
JS
364 opts.output_format = DIFF_FORMAT_NO_OUTPUT;
365 if (diff_setup_done(&opts) < 0)
366 die("diff setup failed");
5a753613 367 diff_tree_sha1(o_tree->object.sha1, tree->object.sha1, "", &opts);
6d297f81
JS
368 diffcore_std(&opts);
369 for (i = 0; i < diff_queued_diff.nr; ++i) {
3af244ca 370 struct path_list_item *item;
6d297f81
JS
371 struct rename *re;
372 struct diff_filepair *pair = diff_queued_diff.queue[i];
373 if (pair->status != 'R') {
374 diff_free_filepair(pair);
375 continue;
376 }
377 re = xmalloc(sizeof(*re));
378 re->processed = 0;
379 re->pair = pair;
3af244ca
JS
380 item = path_list_lookup(re->pair->one->path, entries);
381 if (!item)
382 re->src_entry = insert_stage_data(re->pair->one->path,
5a753613 383 o_tree, a_tree, b_tree, entries);
3af244ca
JS
384 else
385 re->src_entry = item->util;
386
387 item = path_list_lookup(re->pair->two->path, entries);
388 if (!item)
389 re->dst_entry = insert_stage_data(re->pair->two->path,
5a753613 390 o_tree, a_tree, b_tree, entries);
3af244ca
JS
391 else
392 re->dst_entry = item->util;
393 item = path_list_insert(pair->one->path, renames);
6d297f81
JS
394 item->util = re;
395 }
396 opts.output_format = DIFF_FORMAT_NO_OUTPUT;
397 diff_queued_diff.nr = 0;
398 diff_flush(&opts);
6d297f81
JS
399 return renames;
400}
401
9fe0d87d
JH
402static int update_stages(const char *path, struct diff_filespec *o,
403 struct diff_filespec *a, struct diff_filespec *b,
404 int clear)
6d297f81
JS
405{
406 int options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_OK_TO_REPLACE;
3af244ca
JS
407 if (clear)
408 if (remove_file_from_cache(path))
6d297f81 409 return -1;
3af244ca
JS
410 if (o)
411 if (add_cacheinfo(o->mode, o->sha1, path, 1, 0, options))
6d297f81 412 return -1;
3af244ca
JS
413 if (a)
414 if (add_cacheinfo(a->mode, a->sha1, path, 2, 0, options))
6d297f81 415 return -1;
3af244ca
JS
416 if (b)
417 if (add_cacheinfo(b->mode, b->sha1, path, 3, 0, options))
6d297f81
JS
418 return -1;
419 return 0;
420}
421
6d297f81
JS
422static int remove_path(const char *name)
423{
182af834 424 int ret;
3af244ca 425 char *slash, *dirs;
6d297f81
JS
426
427 ret = unlink(name);
3af244ca 428 if (ret)
6d297f81 429 return ret;
182af834 430 dirs = xstrdup(name);
3af244ca 431 while ((slash = strrchr(name, '/'))) {
6d297f81 432 *slash = '\0';
3af244ca 433 if (rmdir(name) != 0)
6d297f81
JS
434 break;
435 }
436 free(dirs);
437 return ret;
438}
439
65ac6e9c 440static int remove_file(int clean, const char *path, int no_wd)
6d297f81 441{
5a753613 442 int update_cache = index_only || clean;
65ac6e9c 443 int update_working_directory = !index_only && !no_wd;
6d297f81 444
5a753613 445 if (update_cache) {
6d297f81
JS
446 if (remove_file_from_cache(path))
447 return -1;
448 }
65ac6e9c 449 if (update_working_directory) {
6d297f81 450 unlink(path);
3af244ca 451 if (errno != ENOENT || errno != EISDIR)
6d297f81
JS
452 return -1;
453 remove_path(path);
454 }
455 return 0;
456}
457
458static char *unique_path(const char *path, const char *branch)
459{
460 char *newpath = xmalloc(strlen(path) + 1 + strlen(branch) + 8 + 1);
3af244ca
JS
461 int suffix = 0;
462 struct stat st;
f59aac47 463 char *p = newpath + strlen(path);
6d297f81 464 strcpy(newpath, path);
f59aac47 465 *(p++) = '~';
6d297f81 466 strcpy(p, branch);
3af244ca
JS
467 for (; *p; ++p)
468 if ('/' == *p)
6d297f81 469 *p = '_';
5a753613
JS
470 while (path_list_has_path(&current_file_set, newpath) ||
471 path_list_has_path(&current_directory_set, newpath) ||
3af244ca 472 lstat(newpath, &st) == 0)
6d297f81 473 sprintf(p, "_%d", suffix++);
3af244ca 474
5a753613 475 path_list_insert(newpath, &current_file_set);
6d297f81
JS
476 return newpath;
477}
478
3af244ca 479static int mkdir_p(const char *path, unsigned long mode)
6d297f81 480{
9befac47
SP
481 /* path points to cache entries, so xstrdup before messing with it */
482 char *buf = xstrdup(path);
3af244ca 483 int result = safe_create_leading_directories(buf);
6d297f81 484 free(buf);
3af244ca 485 return result;
6d297f81
JS
486}
487
488static void flush_buffer(int fd, const char *buf, unsigned long size)
489{
490 while (size > 0) {
93822c22 491 long ret = write_in_full(fd, buf, size);
6d297f81
JS
492 if (ret < 0) {
493 /* Ignore epipe */
494 if (errno == EPIPE)
495 break;
496 die("merge-recursive: %s", strerror(errno));
497 } else if (!ret) {
498 die("merge-recursive: disk full?");
499 }
500 size -= ret;
501 buf += ret;
502 }
503}
504
851c603e
LT
505static int make_room_for_path(const char *path)
506{
507 int status;
508 const char *msg = "failed to create path '%s'%s";
509
510 status = mkdir_p(path, 0777);
511 if (status) {
512 if (status == -3) {
513 /* something else exists */
514 error(msg, path, ": perhaps a D/F conflict?");
515 return -1;
516 }
517 die(msg, path, "");
518 }
519
520 /* Successful unlink is good.. */
521 if (!unlink(path))
522 return 0;
523 /* .. and so is no existing file */
524 if (errno == ENOENT)
525 return 0;
526 /* .. but not some other error (who really cares what?) */
527 return error(msg, path, ": perhaps a D/F conflict?");
528}
529
9fe0d87d
JH
530static void update_file_flags(const unsigned char *sha,
531 unsigned mode,
532 const char *path,
533 int update_cache,
534 int update_wd)
6d297f81 535{
3af244ca
JS
536 if (index_only)
537 update_wd = 0;
6d297f81 538
3af244ca 539 if (update_wd) {
21666f1a 540 enum object_type type;
6d297f81
JS
541 void *buf;
542 unsigned long size;
543
20b178de
FAG
544 if (S_ISGITLINK(mode))
545 die("cannot read object %s '%s': It is a submodule!",
546 sha1_to_hex(sha), path);
547
21666f1a 548 buf = read_sha1_file(sha, &type, &size);
6d297f81
JS
549 if (!buf)
550 die("cannot read object %s '%s'", sha1_to_hex(sha), path);
21666f1a 551 if (type != OBJ_BLOB)
6d297f81
JS
552 die("blob expected for %s '%s'", sha1_to_hex(sha), path);
553
851c603e
LT
554 if (make_room_for_path(path) < 0) {
555 update_wd = 0;
556 goto update_index;
557 }
723024d6 558 if (S_ISREG(mode) || (!has_symlinks && S_ISLNK(mode))) {
3af244ca 559 int fd;
3af244ca 560 if (mode & 0100)
6d297f81
JS
561 mode = 0777;
562 else
563 mode = 0666;
3af244ca
JS
564 fd = open(path, O_WRONLY | O_TRUNC | O_CREAT, mode);
565 if (fd < 0)
6d297f81
JS
566 die("failed to open %s: %s", path, strerror(errno));
567 flush_buffer(fd, buf, size);
568 close(fd);
3af244ca 569 } else if (S_ISLNK(mode)) {
182af834 570 char *lnk = xmemdupz(buf, size);
3af244ca 571 mkdir_p(path, 0777);
17cd29b2 572 unlink(path);
3af244ca 573 symlink(lnk, path);
723024d6 574 free(lnk);
6d297f81
JS
575 } else
576 die("do not know what to do with %06o %s '%s'",
577 mode, sha1_to_hex(sha), path);
578 }
4d50895a 579 update_index:
3af244ca
JS
580 if (update_cache)
581 add_cacheinfo(mode, sha, path, 0, update_wd, ADD_CACHE_OK_TO_ADD);
6d297f81
JS
582}
583
9fe0d87d
JH
584static void update_file(int clean,
585 const unsigned char *sha,
586 unsigned mode,
587 const char *path)
6d297f81
JS
588{
589 update_file_flags(sha, mode, path, index_only || clean, !index_only);
590}
591
592/* Low level file merging, update and removal */
593
594struct merge_file_info
595{
596 unsigned char sha[20];
597 unsigned mode;
598 unsigned clean:1,
599 merge:1;
600};
601
c2b4faea 602static void fill_mm(const unsigned char *sha1, mmfile_t *mm)
6d297f81 603{
6d297f81 604 unsigned long size;
21666f1a 605 enum object_type type;
6d297f81 606
f953831e
JS
607 if (!hashcmp(sha1, null_sha1)) {
608 mm->ptr = xstrdup("");
609 mm->size = 0;
610 return;
611 }
6d297f81 612
21666f1a
NP
613 mm->ptr = read_sha1_file(sha1, &type, &size);
614 if (!mm->ptr || type != OBJ_BLOB)
6d297f81 615 die("unable to read blob object %s", sha1_to_hex(sha1));
c2b4faea 616 mm->size = size;
6d297f81
JS
617}
618
153920da
JH
619/*
620 * Customizable low-level merge drivers support.
621 */
622
623struct ll_merge_driver;
624typedef int (*ll_merge_fn)(const struct ll_merge_driver *,
625 const char *path,
f3ef6b6b 626 mmfile_t *orig,
a129d96f
JH
627 mmfile_t *src1, const char *name1,
628 mmfile_t *src2, const char *name2,
629 mmbuffer_t *result);
630
153920da
JH
631struct ll_merge_driver {
632 const char *name;
633 const char *description;
634 ll_merge_fn fn;
3086486d 635 const char *recursive;
153920da
JH
636 struct ll_merge_driver *next;
637 char *cmdline;
638};
639
640/*
641 * Built-in low-levels
642 */
b798671f
JH
643static int ll_binary_merge(const struct ll_merge_driver *drv_unused,
644 const char *path_unused,
645 mmfile_t *orig,
646 mmfile_t *src1, const char *name1,
647 mmfile_t *src2, const char *name2,
648 mmbuffer_t *result)
649{
650 /*
651 * The tentative merge result is "ours" for the final round,
652 * or common ancestor for an internal merge. Still return
653 * "conflicted merge" status.
654 */
655 mmfile_t *stolen = index_only ? orig : src1;
656
657 result->ptr = stolen->ptr;
658 result->size = stolen->size;
659 stolen->ptr = NULL;
660 return 1;
661}
662
153920da
JH
663static int ll_xdl_merge(const struct ll_merge_driver *drv_unused,
664 const char *path_unused,
f3ef6b6b 665 mmfile_t *orig,
a129d96f
JH
666 mmfile_t *src1, const char *name1,
667 mmfile_t *src2, const char *name2,
668 mmbuffer_t *result)
669{
670 xpparam_t xpp;
671
9f30855d 672 if (buffer_is_binary(orig->ptr, orig->size) ||
b798671f
JH
673 buffer_is_binary(src1->ptr, src1->size) ||
674 buffer_is_binary(src2->ptr, src2->size)) {
675 warning("Cannot merge binary files: %s vs. %s\n",
9f30855d 676 name1, name2);
b798671f
JH
677 return ll_binary_merge(drv_unused, path_unused,
678 orig, src1, name1,
679 src2, name2,
680 result);
681 }
9f30855d 682
a129d96f
JH
683 memset(&xpp, 0, sizeof(xpp));
684 return xdl_merge(orig,
685 src1, name1,
686 src2, name2,
687 &xpp, XDL_MERGE_ZEALOUS,
688 result);
689}
690
153920da
JH
691static int ll_union_merge(const struct ll_merge_driver *drv_unused,
692 const char *path_unused,
f3ef6b6b 693 mmfile_t *orig,
a129d96f
JH
694 mmfile_t *src1, const char *name1,
695 mmfile_t *src2, const char *name2,
696 mmbuffer_t *result)
697{
698 char *src, *dst;
699 long size;
700 const int marker_size = 7;
701
153920da
JH
702 int status = ll_xdl_merge(drv_unused, path_unused,
703 orig, src1, NULL, src2, NULL, result);
a129d96f
JH
704 if (status <= 0)
705 return status;
706 size = result->size;
707 src = dst = result->ptr;
708 while (size) {
709 char ch;
710 if ((marker_size < size) &&
711 (*src == '<' || *src == '=' || *src == '>')) {
712 int i;
713 ch = *src;
714 for (i = 0; i < marker_size; i++)
715 if (src[i] != ch)
716 goto not_a_marker;
717 if (src[marker_size] != '\n')
718 goto not_a_marker;
719 src += marker_size + 1;
720 size -= marker_size + 1;
721 continue;
722 }
723 not_a_marker:
724 do {
725 ch = *src++;
726 *dst++ = ch;
727 size--;
728 } while (ch != '\n' && size);
729 }
730 result->size = dst - result->ptr;
731 return 0;
732}
733
153920da
JH
734#define LL_BINARY_MERGE 0
735#define LL_TEXT_MERGE 1
736#define LL_UNION_MERGE 2
737static struct ll_merge_driver ll_merge_drv[] = {
738 { "binary", "built-in binary merge", ll_binary_merge },
739 { "text", "built-in 3-way text merge", ll_xdl_merge },
740 { "union", "built-in union merge", ll_union_merge },
a129d96f
JH
741};
742
f3ef6b6b
JH
743static void create_temp(mmfile_t *src, char *path)
744{
745 int fd;
746
747 strcpy(path, ".merge_file_XXXXXX");
7647b17f 748 fd = xmkstemp(path);
f3ef6b6b
JH
749 if (write_in_full(fd, src->ptr, src->size) != src->size)
750 die("unable to write temp-file");
751 close(fd);
752}
753
153920da
JH
754/*
755 * User defined low-level merge driver support.
756 */
757static int ll_ext_merge(const struct ll_merge_driver *fn,
758 const char *path,
f3ef6b6b
JH
759 mmfile_t *orig,
760 mmfile_t *src1, const char *name1,
761 mmfile_t *src2, const char *name2,
762 mmbuffer_t *result)
763{
764 char temp[3][50];
765 char cmdbuf[2048];
766 struct interp table[] = {
767 { "%O" },
768 { "%A" },
769 { "%B" },
770 };
771 struct child_process child;
772 const char *args[20];
773 int status, fd, i;
774 struct stat st;
775
15ba3af2
JH
776 if (fn->cmdline == NULL)
777 die("custom merge driver %s lacks command line.", fn->name);
778
f3ef6b6b
JH
779 result->ptr = NULL;
780 result->size = 0;
781 create_temp(orig, temp[0]);
782 create_temp(src1, temp[1]);
783 create_temp(src2, temp[2]);
784
785 interp_set_entry(table, 0, temp[0]);
786 interp_set_entry(table, 1, temp[1]);
787 interp_set_entry(table, 2, temp[2]);
788
153920da
JH
789 output(1, "merging %s using %s", path,
790 fn->description ? fn->description : fn->name);
791
792 interpolate(cmdbuf, sizeof(cmdbuf), fn->cmdline, table, 3);
f3ef6b6b
JH
793
794 memset(&child, 0, sizeof(child));
795 child.argv = args;
796 args[0] = "sh";
797 args[1] = "-c";
798 args[2] = cmdbuf;
799 args[3] = NULL;
800
801 status = run_command(&child);
802 if (status < -ERR_RUN_COMMAND_FORK)
803 ; /* failure in run-command */
804 else
805 status = -status;
806 fd = open(temp[1], O_RDONLY);
807 if (fd < 0)
808 goto bad;
809 if (fstat(fd, &st))
810 goto close_bad;
811 result->size = st.st_size;
812 result->ptr = xmalloc(result->size + 1);
813 if (read_in_full(fd, result->ptr, result->size) != result->size) {
814 free(result->ptr);
815 result->ptr = NULL;
816 result->size = 0;
817 }
818 close_bad:
819 close(fd);
820 bad:
821 for (i = 0; i < 3; i++)
822 unlink(temp[i]);
823 return status;
824}
825
826/*
827 * merge.default and merge.driver configuration items
828 */
153920da 829static struct ll_merge_driver *ll_user_merge, **ll_user_merge_tail;
be89cb23 830static const char *default_ll_merge;
f3ef6b6b
JH
831
832static int read_merge_config(const char *var, const char *value)
833{
153920da
JH
834 struct ll_merge_driver *fn;
835 const char *ep, *name;
836 int namelen;
f3ef6b6b 837
be89cb23 838 if (!strcmp(var, "merge.default")) {
e098368b
JH
839 if (!value)
840 return config_error_nonbool(var);
841 default_ll_merge = strdup(value);
be89cb23
JH
842 return 0;
843 }
844
153920da
JH
845 /*
846 * We are not interested in anything but "merge.<name>.variable";
847 * especially, we do not want to look at variables such as
848 * "merge.summary", "merge.tool", and "merge.verbosity".
849 */
15ba3af2 850 if (prefixcmp(var, "merge.") || (ep = strrchr(var, '.')) == var + 5)
f3ef6b6b 851 return 0;
153920da 852
f3ef6b6b 853 /*
153920da
JH
854 * Find existing one as we might be processing merge.<name>.var2
855 * after seeing merge.<name>.var1.
f3ef6b6b 856 */
153920da
JH
857 name = var + 6;
858 namelen = ep - name;
859 for (fn = ll_user_merge; fn; fn = fn->next)
860 if (!strncmp(fn->name, name, namelen) && !fn->name[namelen])
861 break;
862 if (!fn) {
153920da 863 fn = xcalloc(1, sizeof(struct ll_merge_driver));
182af834 864 fn->name = xmemdupz(name, namelen);
153920da 865 fn->fn = ll_ext_merge;
153920da 866 *ll_user_merge_tail = fn;
e87b1c94 867 ll_user_merge_tail = &(fn->next);
153920da
JH
868 }
869
870 ep++;
871
872 if (!strcmp("name", ep)) {
873 if (!value)
e098368b 874 return config_error_nonbool(var);
153920da
JH
875 fn->description = strdup(value);
876 return 0;
877 }
878
879 if (!strcmp("driver", ep)) {
880 if (!value)
e098368b 881 return config_error_nonbool(var);
153920da
JH
882 /*
883 * merge.<name>.driver specifies the command line:
884 *
885 * command-line
886 *
887 * The command-line will be interpolated with the following
888 * tokens and is given to the shell:
889 *
890 * %O - temporary file name for the merge base.
891 * %A - temporary file name for our version.
892 * %B - temporary file name for the other branches' version.
893 *
894 * The external merge driver should write the results in the
895 * file named by %A, and signal that it has done with zero exit
896 * status.
897 */
898 fn->cmdline = strdup(value);
899 return 0;
900 }
901
3086486d
JH
902 if (!strcmp("recursive", ep)) {
903 if (!value)
e098368b 904 return config_error_nonbool(var);
3086486d
JH
905 fn->recursive = strdup(value);
906 return 0;
907 }
908
f3ef6b6b
JH
909 return 0;
910}
911
912static void initialize_ll_merge(void)
a129d96f 913{
153920da 914 if (ll_user_merge_tail)
f3ef6b6b 915 return;
153920da 916 ll_user_merge_tail = &ll_user_merge;
f3ef6b6b
JH
917 git_config(read_merge_config);
918}
919
a5e92abd 920static const struct ll_merge_driver *find_ll_merge_driver(const char *merge_attr)
f3ef6b6b 921{
153920da 922 struct ll_merge_driver *fn;
a129d96f
JH
923 const char *name;
924 int i;
925
f3ef6b6b
JH
926 initialize_ll_merge();
927
928 if (ATTR_TRUE(merge_attr))
153920da 929 return &ll_merge_drv[LL_TEXT_MERGE];
a129d96f 930 else if (ATTR_FALSE(merge_attr))
153920da 931 return &ll_merge_drv[LL_BINARY_MERGE];
be89cb23
JH
932 else if (ATTR_UNSET(merge_attr)) {
933 if (!default_ll_merge)
153920da 934 return &ll_merge_drv[LL_TEXT_MERGE];
be89cb23
JH
935 else
936 name = default_ll_merge;
937 }
f3ef6b6b
JH
938 else
939 name = merge_attr;
940
153920da
JH
941 for (fn = ll_user_merge; fn; fn = fn->next)
942 if (!strcmp(fn->name, name))
943 return fn;
a129d96f 944
153920da
JH
945 for (i = 0; i < ARRAY_SIZE(ll_merge_drv); i++)
946 if (!strcmp(ll_merge_drv[i].name, name))
947 return &ll_merge_drv[i];
a129d96f
JH
948
949 /* default to the 3-way */
153920da 950 return &ll_merge_drv[LL_TEXT_MERGE];
a129d96f
JH
951}
952
a5e92abd 953static const char *git_path_check_merge(const char *path)
a129d96f
JH
954{
955 static struct git_attr_check attr_merge_check;
956
957 if (!attr_merge_check.attr)
958 attr_merge_check.attr = git_attr("merge", 5);
959
960 if (git_checkattr(path, 1, &attr_merge_check))
a5e92abd 961 return NULL;
a129d96f
JH
962 return attr_merge_check.value;
963}
964
3e5261a2
JH
965static int ll_merge(mmbuffer_t *result_buf,
966 struct diff_filespec *o,
967 struct diff_filespec *a,
968 struct diff_filespec *b,
969 const char *branch1,
970 const char *branch2)
971{
972 mmfile_t orig, src1, src2;
3e5261a2
JH
973 char *name1, *name2;
974 int merge_status;
a5e92abd 975 const char *ll_driver_name;
153920da 976 const struct ll_merge_driver *driver;
3e5261a2
JH
977
978 name1 = xstrdup(mkpath("%s:%s", branch1, a->path));
979 name2 = xstrdup(mkpath("%s:%s", branch2, b->path));
980
981 fill_mm(o->sha1, &orig);
982 fill_mm(a->sha1, &src1);
983 fill_mm(b->sha1, &src2);
984
a5e92abd
JH
985 ll_driver_name = git_path_check_merge(a->path);
986 driver = find_ll_merge_driver(ll_driver_name);
a129d96f 987
d56dbd67
JH
988 if (index_only && driver->recursive)
989 driver = find_ll_merge_driver(driver->recursive);
153920da
JH
990 merge_status = driver->fn(driver, a->path,
991 &orig, &src1, name1, &src2, name2,
992 result_buf);
a129d96f 993
3e5261a2
JH
994 free(name1);
995 free(name2);
996 free(orig.ptr);
997 free(src1.ptr);
998 free(src2.ptr);
999 return merge_status;
1000}
1001
3af244ca
JS
1002static struct merge_file_info merge_file(struct diff_filespec *o,
1003 struct diff_filespec *a, struct diff_filespec *b,
c1d20846 1004 const char *branch1, const char *branch2)
6d297f81
JS
1005{
1006 struct merge_file_info result;
1007 result.merge = 0;
1008 result.clean = 1;
1009
3af244ca 1010 if ((S_IFMT & a->mode) != (S_IFMT & b->mode)) {
6d297f81 1011 result.clean = 0;
3af244ca
JS
1012 if (S_ISREG(a->mode)) {
1013 result.mode = a->mode;
8da71493 1014 hashcpy(result.sha, a->sha1);
6d297f81 1015 } else {
3af244ca 1016 result.mode = b->mode;
8da71493 1017 hashcpy(result.sha, b->sha1);
6d297f81
JS
1018 }
1019 } else {
3af244ca 1020 if (!sha_eq(a->sha1, o->sha1) && !sha_eq(b->sha1, o->sha1))
6d297f81
JS
1021 result.merge = 1;
1022
3af244ca 1023 result.mode = a->mode == o->mode ? b->mode: a->mode;
6d297f81 1024
3af244ca 1025 if (sha_eq(a->sha1, o->sha1))
8da71493 1026 hashcpy(result.sha, b->sha1);
3af244ca 1027 else if (sha_eq(b->sha1, o->sha1))
8da71493 1028 hashcpy(result.sha, a->sha1);
3af244ca 1029 else if (S_ISREG(a->mode)) {
c2b4faea 1030 mmbuffer_t result_buf;
c2b4faea
JH
1031 int merge_status;
1032
3e5261a2
JH
1033 merge_status = ll_merge(&result_buf, o, a, b,
1034 branch1, branch2);
c2b4faea
JH
1035
1036 if ((merge_status < 0) || !result_buf.ptr)
1037 die("Failed to execute internal merge");
1038
1039 if (write_sha1_file(result_buf.ptr, result_buf.size,
1040 blob_type, result.sha))
1041 die("Unable to add %s to database",
1042 a->path);
1043
1044 free(result_buf.ptr);
1045 result.clean = (merge_status == 0);
ff72af00
JH
1046 } else if (S_ISGITLINK(a->mode)) {
1047 result.clean = 0;
1048 hashcpy(result.sha, a->sha1);
1049 } else if (S_ISLNK(a->mode)) {
8da71493 1050 hashcpy(result.sha, a->sha1);
6d297f81 1051
3af244ca 1052 if (!sha_eq(a->sha1, b->sha1))
6d297f81 1053 result.clean = 0;
ff72af00
JH
1054 } else {
1055 die("unsupported object type in the tree");
6d297f81
JS
1056 }
1057 }
1058
1059 return result;
1060}
1061
1062static void conflict_rename_rename(struct rename *ren1,
1063 const char *branch1,
1064 struct rename *ren2,
1065 const char *branch2)
1066{
1067 char *del[2];
1068 int delp = 0;
1069 const char *ren1_dst = ren1->pair->two->path;
1070 const char *ren2_dst = ren2->pair->two->path;
5a753613
JS
1071 const char *dst_name1 = ren1_dst;
1072 const char *dst_name2 = ren2_dst;
1073 if (path_list_has_path(&current_directory_set, ren1_dst)) {
1074 dst_name1 = del[delp++] = unique_path(ren1_dst, branch1);
89f40be2 1075 output(1, "%s is a directory in %s added as %s instead",
5a753613 1076 ren1_dst, branch2, dst_name1);
65ac6e9c 1077 remove_file(0, ren1_dst, 0);
6d297f81 1078 }
5a753613
JS
1079 if (path_list_has_path(&current_directory_set, ren2_dst)) {
1080 dst_name2 = del[delp++] = unique_path(ren2_dst, branch2);
89f40be2 1081 output(1, "%s is a directory in %s added as %s instead",
5a753613 1082 ren2_dst, branch1, dst_name2);
65ac6e9c 1083 remove_file(0, ren2_dst, 0);
6d297f81 1084 }
a97e4075
AR
1085 if (index_only) {
1086 remove_file_from_cache(dst_name1);
1087 remove_file_from_cache(dst_name2);
1088 /*
1089 * Uncomment to leave the conflicting names in the resulting tree
1090 *
1091 * update_file(0, ren1->pair->two->sha1, ren1->pair->two->mode, dst_name1);
1092 * update_file(0, ren2->pair->two->sha1, ren2->pair->two->mode, dst_name2);
1093 */
1094 } else {
1095 update_stages(dst_name1, NULL, ren1->pair->two, NULL, 1);
1096 update_stages(dst_name2, NULL, NULL, ren2->pair->two, 1);
1097 }
3af244ca 1098 while (delp--)
6d297f81
JS
1099 free(del[delp]);
1100}
1101
1102static void conflict_rename_dir(struct rename *ren1,
1103 const char *branch1)
1104{
5a753613 1105 char *new_path = unique_path(ren1->pair->two->path, branch1);
89f40be2 1106 output(1, "Renamed %s to %s instead", ren1->pair->one->path, new_path);
65ac6e9c 1107 remove_file(0, ren1->pair->two->path, 0);
5a753613
JS
1108 update_file(0, ren1->pair->two->sha1, ren1->pair->two->mode, new_path);
1109 free(new_path);
6d297f81
JS
1110}
1111
1112static void conflict_rename_rename_2(struct rename *ren1,
1113 const char *branch1,
1114 struct rename *ren2,
1115 const char *branch2)
1116{
5a753613
JS
1117 char *new_path1 = unique_path(ren1->pair->two->path, branch1);
1118 char *new_path2 = unique_path(ren2->pair->two->path, branch2);
89f40be2 1119 output(1, "Renamed %s to %s and %s to %s instead",
5a753613
JS
1120 ren1->pair->one->path, new_path1,
1121 ren2->pair->one->path, new_path2);
65ac6e9c 1122 remove_file(0, ren1->pair->two->path, 0);
5a753613
JS
1123 update_file(0, ren1->pair->two->sha1, ren1->pair->two->mode, new_path1);
1124 update_file(0, ren2->pair->two->sha1, ren2->pair->two->mode, new_path2);
1125 free(new_path2);
1126 free(new_path1);
6d297f81
JS
1127}
1128
5a753613
JS
1129static int process_renames(struct path_list *a_renames,
1130 struct path_list *b_renames,
1131 const char *a_branch,
1132 const char *b_branch)
6d297f81 1133{
5a753613
JS
1134 int clean_merge = 1, i, j;
1135 struct path_list a_by_dst = {NULL, 0, 0, 0}, b_by_dst = {NULL, 0, 0, 0};
6d297f81
JS
1136 const struct rename *sre;
1137
5a753613
JS
1138 for (i = 0; i < a_renames->nr; i++) {
1139 sre = a_renames->items[i].util;
1140 path_list_insert(sre->pair->two->path, &a_by_dst)->util
6d297f81
JS
1141 = sre->dst_entry;
1142 }
5a753613
JS
1143 for (i = 0; i < b_renames->nr; i++) {
1144 sre = b_renames->items[i].util;
1145 path_list_insert(sre->pair->two->path, &b_by_dst)->util
6d297f81
JS
1146 = sre->dst_entry;
1147 }
1148
5a753613 1149 for (i = 0, j = 0; i < a_renames->nr || j < b_renames->nr;) {
3af244ca
JS
1150 int compare;
1151 char *src;
6d297f81 1152 struct path_list *renames1, *renames2, *renames2Dst;
3af244ca 1153 struct rename *ren1 = NULL, *ren2 = NULL;
5a753613 1154 const char *branch1, *branch2;
3af244ca
JS
1155 const char *ren1_src, *ren1_dst;
1156
5a753613 1157 if (i >= a_renames->nr) {
3af244ca 1158 compare = 1;
5a753613
JS
1159 ren2 = b_renames->items[j++].util;
1160 } else if (j >= b_renames->nr) {
3af244ca 1161 compare = -1;
5a753613 1162 ren1 = a_renames->items[i++].util;
3af244ca 1163 } else {
5a753613
JS
1164 compare = strcmp(a_renames->items[i].path,
1165 b_renames->items[j].path);
3d234d0a
JS
1166 if (compare <= 0)
1167 ren1 = a_renames->items[i++].util;
1168 if (compare >= 0)
1169 ren2 = b_renames->items[j++].util;
3af244ca
JS
1170 }
1171
6d297f81 1172 /* TODO: refactor, so that 1/2 are not needed */
3af244ca 1173 if (ren1) {
5a753613
JS
1174 renames1 = a_renames;
1175 renames2 = b_renames;
1176 renames2Dst = &b_by_dst;
1177 branch1 = a_branch;
1178 branch2 = b_branch;
6d297f81 1179 } else {
3af244ca 1180 struct rename *tmp;
5a753613
JS
1181 renames1 = b_renames;
1182 renames2 = a_renames;
1183 renames2Dst = &a_by_dst;
1184 branch1 = b_branch;
1185 branch2 = a_branch;
3af244ca 1186 tmp = ren2;
6d297f81
JS
1187 ren2 = ren1;
1188 ren1 = tmp;
1189 }
3af244ca 1190 src = ren1->pair->one->path;
6d297f81
JS
1191
1192 ren1->dst_entry->processed = 1;
1193 ren1->src_entry->processed = 1;
1194
3af244ca 1195 if (ren1->processed)
6d297f81
JS
1196 continue;
1197 ren1->processed = 1;
1198
3af244ca
JS
1199 ren1_src = ren1->pair->one->path;
1200 ren1_dst = ren1->pair->two->path;
6d297f81 1201
3af244ca 1202 if (ren2) {
6d297f81
JS
1203 const char *ren2_src = ren2->pair->one->path;
1204 const char *ren2_dst = ren2->pair->two->path;
1205 /* Renamed in 1 and renamed in 2 */
1206 if (strcmp(ren1_src, ren2_src) != 0)
1207 die("ren1.src != ren2.src");
1208 ren2->dst_entry->processed = 1;
1209 ren2->processed = 1;
1210 if (strcmp(ren1_dst, ren2_dst) != 0) {
5a753613 1211 clean_merge = 0;
8c3275ab 1212 output(1, "CONFLICT (rename/rename): "
a97e4075
AR
1213 "Rename \"%s\"->\"%s\" in branch \"%s\" "
1214 "rename \"%s\"->\"%s\" in \"%s\"%s",
5a753613 1215 src, ren1_dst, branch1,
a97e4075
AR
1216 src, ren2_dst, branch2,
1217 index_only ? " (left unresolved)": "");
1218 if (index_only) {
1219 remove_file_from_cache(src);
1220 update_file(0, ren1->pair->one->sha1,
1221 ren1->pair->one->mode, src);
1222 }
5a753613 1223 conflict_rename_rename(ren1, branch1, ren2, branch2);
6d297f81 1224 } else {
6d297f81 1225 struct merge_file_info mfi;
65ac6e9c 1226 remove_file(1, ren1_src, 1);
3af244ca
JS
1227 mfi = merge_file(ren1->pair->one,
1228 ren1->pair->two,
1229 ren2->pair->two,
5a753613
JS
1230 branch1,
1231 branch2);
3af244ca 1232 if (mfi.merge || !mfi.clean)
89f40be2 1233 output(1, "Renamed %s->%s", src, ren1_dst);
6d297f81 1234
3af244ca 1235 if (mfi.merge)
89f40be2 1236 output(2, "Auto-merged %s", ren1_dst);
6d297f81 1237
3af244ca 1238 if (!mfi.clean) {
8c3275ab 1239 output(1, "CONFLICT (content): merge conflict in %s",
6d297f81 1240 ren1_dst);
5a753613 1241 clean_merge = 0;
6d297f81 1242
3af244ca 1243 if (!index_only)
6d297f81 1244 update_stages(ren1_dst,
3af244ca
JS
1245 ren1->pair->one,
1246 ren1->pair->two,
1247 ren2->pair->two,
6d297f81
JS
1248 1 /* clear */);
1249 }
1250 update_file(mfi.clean, mfi.sha, mfi.mode, ren1_dst);
1251 }
1252 } else {
1253 /* Renamed in 1, maybe changed in 2 */
3af244ca
JS
1254 struct path_list_item *item;
1255 /* we only use sha1 and mode of these */
1256 struct diff_filespec src_other, dst_other;
5a753613 1257 int try_merge, stage = a_renames == renames1 ? 3: 2;
6d297f81 1258
183d7972 1259 remove_file(1, ren1_src, index_only || stage == 3);
6d297f81 1260
87cb004e 1261 hashcpy(src_other.sha1, ren1->src_entry->stages[stage].sha);
3af244ca 1262 src_other.mode = ren1->src_entry->stages[stage].mode;
87cb004e 1263 hashcpy(dst_other.sha1, ren1->dst_entry->stages[stage].sha);
3af244ca 1264 dst_other.mode = ren1->dst_entry->stages[stage].mode;
6d297f81 1265
5a753613 1266 try_merge = 0;
6d297f81 1267
5a753613
JS
1268 if (path_list_has_path(&current_directory_set, ren1_dst)) {
1269 clean_merge = 0;
89f40be2 1270 output(1, "CONFLICT (rename/directory): Renamed %s->%s in %s "
6d297f81 1271 " directory %s added in %s",
5a753613
JS
1272 ren1_src, ren1_dst, branch1,
1273 ren1_dst, branch2);
1274 conflict_rename_dir(ren1, branch1);
3af244ca 1275 } else if (sha_eq(src_other.sha1, null_sha1)) {
5a753613 1276 clean_merge = 0;
89f40be2 1277 output(1, "CONFLICT (rename/delete): Renamed %s->%s in %s "
6d297f81 1278 "and deleted in %s",
5a753613
JS
1279 ren1_src, ren1_dst, branch1,
1280 branch2);
6d297f81 1281 update_file(0, ren1->pair->two->sha1, ren1->pair->two->mode, ren1_dst);
3af244ca 1282 } else if (!sha_eq(dst_other.sha1, null_sha1)) {
5a753613
JS
1283 const char *new_path;
1284 clean_merge = 0;
1285 try_merge = 1;
89f40be2 1286 output(1, "CONFLICT (rename/add): Renamed %s->%s in %s. "
6d297f81 1287 "%s added in %s",
5a753613
JS
1288 ren1_src, ren1_dst, branch1,
1289 ren1_dst, branch2);
1290 new_path = unique_path(ren1_dst, branch2);
89f40be2 1291 output(1, "Added as %s instead", new_path);
5a753613 1292 update_file(0, dst_other.sha1, dst_other.mode, new_path);
3af244ca
JS
1293 } else if ((item = path_list_lookup(ren1_dst, renames2Dst))) {
1294 ren2 = item->util;
5a753613 1295 clean_merge = 0;
6d297f81 1296 ren2->processed = 1;
89f40be2
SP
1297 output(1, "CONFLICT (rename/rename): Renamed %s->%s in %s. "
1298 "Renamed %s->%s in %s",
5a753613
JS
1299 ren1_src, ren1_dst, branch1,
1300 ren2->pair->one->path, ren2->pair->two->path, branch2);
1301 conflict_rename_rename_2(ren1, branch1, ren2, branch2);
6d297f81 1302 } else
5a753613 1303 try_merge = 1;
6d297f81 1304
5a753613 1305 if (try_merge) {
3af244ca 1306 struct diff_filespec *o, *a, *b;
6d297f81 1307 struct merge_file_info mfi;
3af244ca
JS
1308 src_other.path = (char *)ren1_src;
1309
1310 o = ren1->pair->one;
5a753613 1311 if (a_renames == renames1) {
3af244ca
JS
1312 a = ren1->pair->two;
1313 b = &src_other;
1314 } else {
1315 b = ren1->pair->two;
1316 a = &src_other;
1317 }
1318 mfi = merge_file(o, a, b,
5a753613 1319 a_branch, b_branch);
6d297f81 1320
0d5e6c97 1321 if (mfi.clean &&
c135ee88
AR
1322 sha_eq(mfi.sha, ren1->pair->two->sha1) &&
1323 mfi.mode == ren1->pair->two->mode)
8a359819
AR
1324 /*
1325 * This messaged is part of
1326 * t6022 test. If you change
1327 * it update the test too.
1328 */
c135ee88
AR
1329 output(3, "Skipped %s (merged same as existing)", ren1_dst);
1330 else {
1331 if (mfi.merge || !mfi.clean)
1332 output(1, "Renamed %s => %s", ren1_src, ren1_dst);
1333 if (mfi.merge)
1334 output(2, "Auto-merged %s", ren1_dst);
1335 if (!mfi.clean) {
1336 output(1, "CONFLICT (rename/modify): Merge conflict in %s",
1337 ren1_dst);
1338 clean_merge = 0;
1339
1340 if (!index_only)
1341 update_stages(ren1_dst,
1342 o, a, b, 1);
1343 }
1344 update_file(mfi.clean, mfi.sha, mfi.mode, ren1_dst);
6d297f81 1345 }
6d297f81
JS
1346 }
1347 }
1348 }
5a753613
JS
1349 path_list_clear(&a_by_dst, 0);
1350 path_list_clear(&b_by_dst, 0);
6d297f81 1351
5a753613 1352 return clean_merge;
6d297f81
JS
1353}
1354
ac7f0f43 1355static unsigned char *stage_sha(const unsigned char *sha, unsigned mode)
6d297f81 1356{
ac7f0f43 1357 return (is_null_sha1(sha) || mode == 0) ? NULL: (unsigned char *)sha;
6d297f81
JS
1358}
1359
1360/* Per entry merge function */
1361static int process_entry(const char *path, struct stage_data *entry,
c1d20846
JS
1362 const char *branch1,
1363 const char *branch2)
6d297f81
JS
1364{
1365 /*
1366 printf("processing entry, clean cache: %s\n", index_only ? "yes": "no");
1367 print_index_entry("\tpath: ", entry);
1368 */
5a753613 1369 int clean_merge = 1;
5a753613
JS
1370 unsigned o_mode = entry->stages[1].mode;
1371 unsigned a_mode = entry->stages[2].mode;
1372 unsigned b_mode = entry->stages[3].mode;
ac7f0f43
JH
1373 unsigned char *o_sha = stage_sha(entry->stages[1].sha, o_mode);
1374 unsigned char *a_sha = stage_sha(entry->stages[2].sha, a_mode);
1375 unsigned char *b_sha = stage_sha(entry->stages[3].sha, b_mode);
5a753613
JS
1376
1377 if (o_sha && (!a_sha || !b_sha)) {
6d297f81 1378 /* Case A: Deleted in one */
5a753613
JS
1379 if ((!a_sha && !b_sha) ||
1380 (sha_eq(a_sha, o_sha) && !b_sha) ||
1381 (!a_sha && sha_eq(b_sha, o_sha))) {
6d297f81
JS
1382 /* Deleted in both or deleted in one and
1383 * unchanged in the other */
5a753613 1384 if (a_sha)
89f40be2 1385 output(2, "Removed %s", path);
65ac6e9c
JH
1386 /* do not touch working file if it did not exist */
1387 remove_file(1, path, !a_sha);
6d297f81
JS
1388 } else {
1389 /* Deleted in one and changed in the other */
5a753613
JS
1390 clean_merge = 0;
1391 if (!a_sha) {
8c3275ab 1392 output(1, "CONFLICT (delete/modify): %s deleted in %s "
6d297f81 1393 "and modified in %s. Version %s of %s left in tree.",
c1d20846
JS
1394 path, branch1,
1395 branch2, branch2, path);
5a753613 1396 update_file(0, b_sha, b_mode, path);
6d297f81 1397 } else {
8c3275ab 1398 output(1, "CONFLICT (delete/modify): %s deleted in %s "
6d297f81 1399 "and modified in %s. Version %s of %s left in tree.",
c1d20846
JS
1400 path, branch2,
1401 branch1, branch1, path);
5a753613 1402 update_file(0, a_sha, a_mode, path);
6d297f81
JS
1403 }
1404 }
1405
5a753613
JS
1406 } else if ((!o_sha && a_sha && !b_sha) ||
1407 (!o_sha && !a_sha && b_sha)) {
6d297f81 1408 /* Case B: Added in one. */
5a753613
JS
1409 const char *add_branch;
1410 const char *other_branch;
6d297f81
JS
1411 unsigned mode;
1412 const unsigned char *sha;
1413 const char *conf;
1414
5a753613 1415 if (a_sha) {
c1d20846
JS
1416 add_branch = branch1;
1417 other_branch = branch2;
5a753613
JS
1418 mode = a_mode;
1419 sha = a_sha;
6d297f81
JS
1420 conf = "file/directory";
1421 } else {
c1d20846
JS
1422 add_branch = branch2;
1423 other_branch = branch1;
5a753613
JS
1424 mode = b_mode;
1425 sha = b_sha;
6d297f81
JS
1426 conf = "directory/file";
1427 }
5a753613
JS
1428 if (path_list_has_path(&current_directory_set, path)) {
1429 const char *new_path = unique_path(path, add_branch);
1430 clean_merge = 0;
8c3275ab 1431 output(1, "CONFLICT (%s): There is a directory with name %s in %s. "
89f40be2 1432 "Added %s as %s",
5a753613 1433 conf, path, other_branch, path, new_path);
65ac6e9c 1434 remove_file(0, path, 0);
5a753613 1435 update_file(0, sha, mode, new_path);
6d297f81 1436 } else {
89f40be2 1437 output(2, "Added %s", path);
6d297f81
JS
1438 update_file(1, sha, mode, path);
1439 }
f953831e
JS
1440 } else if (a_sha && b_sha) {
1441 /* Case C: Added in both (check for same permissions) and */
6d297f81 1442 /* case D: Modified in both, but differently. */
f953831e 1443 const char *reason = "content";
6d297f81 1444 struct merge_file_info mfi;
3af244ca
JS
1445 struct diff_filespec o, a, b;
1446
f953831e
JS
1447 if (!o_sha) {
1448 reason = "add/add";
1449 o_sha = (unsigned char *)null_sha1;
1450 }
89f40be2 1451 output(2, "Auto-merged %s", path);
3af244ca 1452 o.path = a.path = b.path = (char *)path;
8da71493 1453 hashcpy(o.sha1, o_sha);
5a753613 1454 o.mode = o_mode;
8da71493 1455 hashcpy(a.sha1, a_sha);
5a753613 1456 a.mode = a_mode;
8da71493 1457 hashcpy(b.sha1, b_sha);
5a753613 1458 b.mode = b_mode;
3af244ca
JS
1459
1460 mfi = merge_file(&o, &a, &b,
c1d20846 1461 branch1, branch2);
6d297f81 1462
20b178de 1463 clean_merge = mfi.clean;
3af244ca 1464 if (mfi.clean)
6d297f81 1465 update_file(1, mfi.sha, mfi.mode, path);
20b178de
FAG
1466 else if (S_ISGITLINK(mfi.mode))
1467 output(1, "CONFLICT (submodule): Merge conflict in %s "
1468 "- needs %s", path, sha1_to_hex(b.sha1));
6d297f81 1469 else {
8c3275ab 1470 output(1, "CONFLICT (%s): Merge conflict in %s",
f953831e 1471 reason, path);
6d297f81 1472
3af244ca 1473 if (index_only)
6d297f81
JS
1474 update_file(0, mfi.sha, mfi.mode, path);
1475 else
1476 update_file_flags(mfi.sha, mfi.mode, path,
5a753613 1477 0 /* update_cache */, 1 /* update_working_directory */);
6d297f81 1478 }
ac7f0f43
JH
1479 } else if (!o_sha && !a_sha && !b_sha) {
1480 /*
1481 * this entry was deleted altogether. a_mode == 0 means
1482 * we had that path and want to actively remove it.
1483 */
1484 remove_file(1, path, !a_mode);
6d297f81
JS
1485 } else
1486 die("Fatal merge failure, shouldn't happen.");
1487
5a753613 1488 return clean_merge;
6d297f81
JS
1489}
1490
e1b3a2ca
DB
1491int merge_trees(struct tree *head,
1492 struct tree *merge,
1493 struct tree *common,
1494 const char *branch1,
1495 const char *branch2,
1496 struct tree **result)
6d297f81 1497{
3af244ca 1498 int code, clean;
68faf689
JH
1499
1500 if (subtree_merge) {
1501 merge = shift_tree_object(head, merge);
1502 common = shift_tree_object(head, common);
1503 }
1504
3af244ca 1505 if (sha_eq(common->object.sha1, merge->object.sha1)) {
8c3275ab 1506 output(0, "Already uptodate!");
3af244ca
JS
1507 *result = head;
1508 return 1;
6d297f81
JS
1509 }
1510
7a85b848 1511 code = git_merge_trees(index_only, common, head, merge);
6d297f81 1512
3af244ca 1513 if (code != 0)
6d297f81
JS
1514 die("merging of trees %s and %s failed",
1515 sha1_to_hex(head->object.sha1),
1516 sha1_to_hex(merge->object.sha1));
1517
94a5728c 1518 if (unmerged_cache()) {
3af244ca
JS
1519 struct path_list *entries, *re_head, *re_merge;
1520 int i;
5a753613
JS
1521 path_list_clear(&current_file_set, 1);
1522 path_list_clear(&current_directory_set, 1);
3af244ca
JS
1523 get_files_dirs(head);
1524 get_files_dirs(merge);
6d297f81 1525
3af244ca 1526 entries = get_unmerged();
6d297f81
JS
1527 re_head = get_renames(head, common, head, merge, entries);
1528 re_merge = get_renames(merge, common, head, merge, entries);
3af244ca 1529 clean = process_renames(re_head, re_merge,
c1d20846 1530 branch1, branch2);
ad57cbca 1531 for (i = 0; i < entries->nr; i++) {
6d297f81
JS
1532 const char *path = entries->items[i].path;
1533 struct stage_data *e = entries->items[i].util;
3f6ee2d1
SP
1534 if (!e->processed
1535 && !process_entry(path, e, branch1, branch2))
3af244ca 1536 clean = 0;
6d297f81
JS
1537 }
1538
3af244ca
JS
1539 path_list_clear(re_merge, 0);
1540 path_list_clear(re_head, 0);
1541 path_list_clear(entries, 1);
6d297f81 1542
6d297f81 1543 }
1cf716a2
JH
1544 else
1545 clean = 1;
1546
8b944b56 1547 if (index_only)
e1b3a2ca 1548 *result = write_tree_from_memory();
6d297f81 1549
3af244ca 1550 return clean;
6d297f81
JS
1551}
1552
8918b0c9
JS
1553static struct commit_list *reverse_commit_list(struct commit_list *list)
1554{
1555 struct commit_list *next = NULL, *current, *backup;
1556 for (current = list; current; current = backup) {
1557 backup = current->next;
1558 current->next = next;
1559 next = current;
1560 }
1561 return next;
1562}
1563
6d297f81
JS
1564/*
1565 * Merge the commits h1 and h2, return the resulting virtual
3dff5379 1566 * commit object and a flag indicating the cleanness of the merge.
6d297f81 1567 */
e1b3a2ca
DB
1568int merge_recursive(struct commit *h1,
1569 struct commit *h2,
1570 const char *branch1,
1571 const char *branch2,
1572 struct commit_list *ca,
1573 struct commit **result)
6d297f81 1574{
8b944b56 1575 struct commit_list *iter;
5a753613 1576 struct commit *merged_common_ancestors;
f120ae2a 1577 struct tree *mrtree = mrtree;
3af244ca 1578 int clean;
6d297f81 1579
8c3275ab
SP
1580 if (show(4)) {
1581 output(4, "Merging:");
1582 output_commit_title(h1);
1583 output_commit_title(h2);
1584 }
6d297f81 1585
8b944b56
JH
1586 if (!ca) {
1587 ca = get_merge_bases(h1, h2, 1);
1588 ca = reverse_commit_list(ca);
1589 }
6d297f81 1590
8c3275ab
SP
1591 if (show(5)) {
1592 output(5, "found %u common ancestor(s):", commit_list_count(ca));
1593 for (iter = ca; iter; iter = iter->next)
1594 output_commit_title(iter->item);
1595 }
6d297f81 1596
5a753613 1597 merged_common_ancestors = pop_commit(&ca);
934d9a24
JS
1598 if (merged_common_ancestors == NULL) {
1599 /* if there is no common ancestor, make an empty tree */
1600 struct tree *tree = xcalloc(1, sizeof(struct tree));
934d9a24
JS
1601
1602 tree->object.parsed = 1;
1603 tree->object.type = OBJ_TREE;
21666f1a 1604 pretend_sha1_file(NULL, 0, OBJ_TREE, tree->object.sha1);
934d9a24
JS
1605 merged_common_ancestors = make_virtual_commit(tree, "ancestor");
1606 }
6d297f81 1607
6d297f81 1608 for (iter = ca; iter; iter = iter->next) {
63889639 1609 call_depth++;
3af244ca
JS
1610 /*
1611 * When the merge fails, the result contains files
1612 * with conflict markers. The cleanness flag is
3dff5379
PR
1613 * ignored, it was never actually used, as result of
1614 * merge_trees has always overwritten it: the committed
3af244ca
JS
1615 * "conflicts" were already resolved.
1616 */
8b944b56 1617 discard_cache();
e1b3a2ca
DB
1618 merge_recursive(merged_common_ancestors, iter->item,
1619 "Temporary merge branch 1",
1620 "Temporary merge branch 2",
1621 NULL,
1622 &merged_common_ancestors);
63889639 1623 call_depth--;
6d297f81 1624
5a753613 1625 if (!merged_common_ancestors)
6d297f81
JS
1626 die("merge returned no commit");
1627 }
1628
8b944b56 1629 discard_cache();
63889639 1630 if (!call_depth) {
8b944b56 1631 read_cache();
6d297f81 1632 index_only = 0;
8b944b56 1633 } else
6d297f81 1634 index_only = 1;
6d297f81 1635
5a753613 1636 clean = merge_trees(h1->tree, h2->tree, merged_common_ancestors->tree,
c1d20846 1637 branch1, branch2, &mrtree);
6d297f81 1638
8b944b56 1639 if (index_only) {
3af244ca
JS
1640 *result = make_virtual_commit(mrtree, "merged tree");
1641 commit_list_insert(h1, &(*result)->parents);
1642 commit_list_insert(h2, &(*result)->parents->next);
8b944b56 1643 }
66a155bc 1644 flush_output();
3af244ca 1645 return clean;
6d297f81
JS
1646}
1647
7ba3c078
SP
1648static const char *better_branch_name(const char *branch)
1649{
1650 static char githead_env[8 + 40 + 1];
1651 char *name;
1652
1653 if (strlen(branch) != 40)
1654 return branch;
1655 sprintf(githead_env, "GITHEAD_%s", branch);
1656 name = getenv(githead_env);
1657 return name ? name : branch;
1658}
1659
6d297f81
JS
1660static struct commit *get_ref(const char *ref)
1661{
1662 unsigned char sha1[20];
1663 struct object *object;
1664
1665 if (get_sha1(ref, sha1))
1666 die("Could not resolve ref '%s'", ref);
1667 object = deref_tag(parse_object(sha1), ref, strlen(ref));
affeef12
MK
1668 if (!object)
1669 return NULL;
a970e84e
SP
1670 if (object->type == OBJ_TREE)
1671 return make_virtual_commit((struct tree*)object,
1672 better_branch_name(ref));
bf6d324e 1673 if (object->type != OBJ_COMMIT)
6d297f81
JS
1674 return NULL;
1675 if (parse_commit((struct commit *)object))
1676 die("Could not parse commit '%s'", sha1_to_hex(object->sha1));
1677 return (struct commit *)object;
1678}
1679
8c3275ab
SP
1680static int merge_config(const char *var, const char *value)
1681{
1682 if (!strcasecmp(var, "merge.verbosity")) {
1683 verbosity = git_config_int(var, value);
1684 return 0;
1685 }
df3a02f6
LH
1686 if (!strcasecmp(var, "diff.renamelimit")) {
1687 rename_limit = git_config_int(var, value);
1688 return 0;
1689 }
8c3275ab
SP
1690 return git_default_config(var, value);
1691}
1692
e1b3a2ca 1693int cmd_merge_recursive(int argc, const char **argv, const char *prefix)
6d297f81 1694{
8b944b56 1695 static const char *bases[20];
6d297f81 1696 static unsigned bases_count = 0;
3af244ca
JS
1697 int i, clean;
1698 const char *branch1, *branch2;
1699 struct commit *result, *h1, *h2;
8b944b56
JH
1700 struct commit_list *ca = NULL;
1701 struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
1702 int index_fd;
6d297f81 1703
68faf689
JH
1704 if (argv[0]) {
1705 int namelen = strlen(argv[0]);
1706 if (8 < namelen &&
1707 !strcmp(argv[0] + namelen - 8, "-subtree"))
1708 subtree_merge = 1;
1709 }
1710
8c3275ab
SP
1711 git_config(merge_config);
1712 if (getenv("GIT_MERGE_VERBOSITY"))
1713 verbosity = strtol(getenv("GIT_MERGE_VERBOSITY"), NULL, 10);
6d297f81
JS
1714
1715 if (argc < 4)
1716 die("Usage: %s <base>... -- <head> <remote> ...\n", argv[0]);
1717
6d297f81
JS
1718 for (i = 1; i < argc; ++i) {
1719 if (!strcmp(argv[i], "--"))
1720 break;
1721 if (bases_count < sizeof(bases)/sizeof(*bases))
1722 bases[bases_count++] = argv[i];
1723 }
1724 if (argc - i != 3) /* "--" "<head>" "<remote>" */
1725 die("Not handling anything other than two heads merge.");
ad57cbca 1726 if (verbosity >= 5)
3f6ee2d1 1727 buffer_output = 0;
6d297f81 1728
6d297f81
JS
1729 branch1 = argv[++i];
1730 branch2 = argv[++i];
6d297f81 1731
3af244ca
JS
1732 h1 = get_ref(branch1);
1733 h2 = get_ref(branch2);
6d297f81 1734
e0ec1819
SP
1735 branch1 = better_branch_name(branch1);
1736 branch2 = better_branch_name(branch2);
3f6ee2d1 1737
8c3275ab
SP
1738 if (show(3))
1739 printf("Merging %s with %s\n", branch1, branch2);
e0ec1819 1740
30ca07a2 1741 index_fd = hold_locked_index(lock, 1);
6d297f81 1742
8b944b56
JH
1743 for (i = 0; i < bases_count; i++) {
1744 struct commit *ancestor = get_ref(bases[i]);
1745 ca = commit_list_insert(ancestor, &ca);
1746 }
e1b3a2ca 1747 clean = merge_recursive(h1, h2, branch1, branch2, ca, &result);
8b944b56
JH
1748
1749 if (active_cache_changed &&
1750 (write_cache(index_fd, active_cache, active_nr) ||
4ed7cd3a 1751 commit_locked_index(lock)))
8b944b56 1752 die ("unable to write %s", get_index_file());
6d297f81 1753
3af244ca 1754 return clean ? 0: 1;
6d297f81 1755}