2 * Recursive Merge algorithm stolen from git-merge-recursive.py by
4 * The thieves were Alex Riesen and Johannes Schindelin, in June/July 2006
7 #include "cache-tree.h"
11 #include "tree-walk.h"
15 #include "unpack-trees.h"
16 #include "string-list.h"
17 #include "xdiff-interface.h"
19 #include "interpolate.h"
22 #include "merge-recursive.h"
24 static int subtree_merge;
26 static struct tree *shift_tree_object(struct tree *one, struct tree *two)
28 unsigned char shifted[20];
31 * NEEDSWORK: this limits the recursion depth to hardcoded
32 * value '2' to avoid excessive overhead.
34 shift_tree(one->object.sha1, two->object.sha1, shifted, 2);
35 if (!hashcmp(two->object.sha1, shifted))
37 return lookup_tree(shifted);
41 * A virtual commit has
42 * - (const char *)commit->util set to the name, and
43 * - *(int *)commit->object.sha1 set to the virtual id.
46 static struct commit *make_virtual_commit(struct tree *tree, const char *comment)
48 struct commit *commit = xcalloc(1, sizeof(struct commit));
49 static unsigned virtual_id = 1;
51 commit->util = (void*)comment;
52 *(int*)commit->object.sha1 = virtual_id++;
54 commit->object.parsed = 1;
59 * Since we use get_tree_entry(), which does not put the read object into
60 * the object pool, we cannot rely on a == b.
62 static int sha_eq(const unsigned char *a, const unsigned char *b)
66 return a && b && hashcmp(a, b) == 0;
70 * Since we want to write the index eventually, we cannot reuse the index
71 * for these (temporary) data.
78 unsigned char sha[20];
83 static struct string_list current_file_set = {NULL, 0, 0, 1};
84 static struct string_list current_directory_set = {NULL, 0, 0, 1};
86 static int call_depth = 0;
87 static int verbosity = 2;
88 static int diff_rename_limit = -1;
89 static int merge_rename_limit = -1;
90 static int buffer_output = 1;
91 static struct strbuf obuf = STRBUF_INIT;
93 static int show(int v)
95 return (!call_depth && verbosity >= v) || verbosity >= 5;
98 static void flush_output(void)
101 fputs(obuf.buf, stdout);
106 static void output(int v, const char *fmt, ...)
114 strbuf_grow(&obuf, call_depth * 2 + 2);
115 memset(obuf.buf + obuf.len, ' ', call_depth * 2);
116 strbuf_setlen(&obuf, obuf.len + call_depth * 2);
119 len = vsnprintf(obuf.buf + obuf.len, strbuf_avail(&obuf), fmt, ap);
124 if (len >= strbuf_avail(&obuf)) {
125 strbuf_grow(&obuf, len + 2);
127 len = vsnprintf(obuf.buf + obuf.len, strbuf_avail(&obuf), fmt, ap);
129 if (len >= strbuf_avail(&obuf)) {
130 die("this should not happen, your snprintf is broken");
133 strbuf_setlen(&obuf, obuf.len + len);
134 strbuf_add(&obuf, "\n", 1);
139 static void output_commit_title(struct commit *commit)
143 for (i = call_depth; i--;)
146 printf("virtual %s\n", (char *)commit->util);
148 printf("%s ", find_unique_abbrev(commit->object.sha1, DEFAULT_ABBREV));
149 if (parse_commit(commit) != 0)
150 printf("(bad commit)\n");
154 for (s = commit->buffer; *s; s++)
155 if (*s == '\n' && s[1] == '\n') {
159 for (len = 0; s[len] && '\n' != s[len]; len++)
161 printf("%.*s\n", len, s);
166 static int add_cacheinfo(unsigned int mode, const unsigned char *sha1,
167 const char *path, int stage, int refresh, int options)
169 struct cache_entry *ce;
170 ce = make_cache_entry(mode, sha1 ? sha1 : null_sha1, path, stage, refresh);
172 return error("addinfo_cache failed for path '%s'", path);
173 return add_cache_entry(ce, options);
177 * This is a global variable which is used in a number of places but
178 * only written to in the 'merge' function.
180 * index_only == 1 => Don't leave any non-stage 0 entries in the cache and
181 * don't update the working directory.
182 * 0 => Leave unmerged entries in the cache and update
183 * the working directory.
185 static int index_only = 0;
187 static void init_tree_desc_from_tree(struct tree_desc *desc, struct tree *tree)
190 init_tree_desc(desc, tree->buffer, tree->size);
193 static int git_merge_trees(int index_only,
199 struct tree_desc t[3];
200 struct unpack_trees_options opts;
202 memset(&opts, 0, sizeof(opts));
209 opts.fn = threeway_merge;
210 opts.src_index = &the_index;
211 opts.dst_index = &the_index;
213 init_tree_desc_from_tree(t+0, common);
214 init_tree_desc_from_tree(t+1, head);
215 init_tree_desc_from_tree(t+2, merge);
217 rc = unpack_trees(3, t, &opts);
218 cache_tree_free(&active_cache_tree);
222 struct tree *write_tree_from_memory(void)
224 struct tree *result = NULL;
226 if (unmerged_cache()) {
228 output(0, "There are unmerged index entries:");
229 for (i = 0; i < active_nr; i++) {
230 struct cache_entry *ce = active_cache[i];
232 output(0, "%d %.*s", ce_stage(ce), ce_namelen(ce), ce->name);
237 if (!active_cache_tree)
238 active_cache_tree = cache_tree();
240 if (!cache_tree_fully_valid(active_cache_tree) &&
241 cache_tree_update(active_cache_tree,
242 active_cache, active_nr, 0, 0) < 0)
243 die("error building trees");
245 result = lookup_tree(active_cache_tree->sha1);
250 static int save_files_dirs(const unsigned char *sha1,
251 const char *base, int baselen, const char *path,
252 unsigned int mode, int stage, void *context)
254 int len = strlen(path);
255 char *newpath = xmalloc(baselen + len + 1);
256 memcpy(newpath, base, baselen);
257 memcpy(newpath + baselen, path, len);
258 newpath[baselen + len] = '\0';
261 string_list_insert(newpath, ¤t_directory_set);
263 string_list_insert(newpath, ¤t_file_set);
266 return READ_TREE_RECURSIVE;
269 static int get_files_dirs(struct tree *tree)
272 if (read_tree_recursive(tree, "", 0, 0, NULL, save_files_dirs, NULL))
274 n = current_file_set.nr + current_directory_set.nr;
279 * Returns an index_entry instance which doesn't have to correspond to
280 * a real cache entry in Git's index.
282 static struct stage_data *insert_stage_data(const char *path,
283 struct tree *o, struct tree *a, struct tree *b,
284 struct string_list *entries)
286 struct string_list_item *item;
287 struct stage_data *e = xcalloc(1, sizeof(struct stage_data));
288 get_tree_entry(o->object.sha1, path,
289 e->stages[1].sha, &e->stages[1].mode);
290 get_tree_entry(a->object.sha1, path,
291 e->stages[2].sha, &e->stages[2].mode);
292 get_tree_entry(b->object.sha1, path,
293 e->stages[3].sha, &e->stages[3].mode);
294 item = string_list_insert(path, entries);
300 * Create a dictionary mapping file names to stage_data objects. The
301 * dictionary contains one entry for every path with a non-zero stage entry.
303 static struct string_list *get_unmerged(void)
305 struct string_list *unmerged = xcalloc(1, sizeof(struct string_list));
308 unmerged->strdup_strings = 1;
310 for (i = 0; i < active_nr; i++) {
311 struct string_list_item *item;
312 struct stage_data *e;
313 struct cache_entry *ce = active_cache[i];
317 item = string_list_lookup(ce->name, unmerged);
319 item = string_list_insert(ce->name, unmerged);
320 item->util = xcalloc(1, sizeof(struct stage_data));
323 e->stages[ce_stage(ce)].mode = ce->ce_mode;
324 hashcpy(e->stages[ce_stage(ce)].sha, ce->sha1);
332 struct diff_filepair *pair;
333 struct stage_data *src_entry;
334 struct stage_data *dst_entry;
335 unsigned processed:1;
339 * Get information of all renames which occurred between 'o_tree' and
340 * 'tree'. We need the three trees in the merge ('o_tree', 'a_tree' and
341 * 'b_tree') to be able to associate the correct cache entries with
342 * the rename information. 'tree' is always equal to either a_tree or b_tree.
344 static struct string_list *get_renames(struct tree *tree,
348 struct string_list *entries)
351 struct string_list *renames;
352 struct diff_options opts;
354 renames = xcalloc(1, sizeof(struct string_list));
356 DIFF_OPT_SET(&opts, RECURSIVE);
357 opts.detect_rename = DIFF_DETECT_RENAME;
358 opts.rename_limit = merge_rename_limit >= 0 ? merge_rename_limit :
359 diff_rename_limit >= 0 ? diff_rename_limit :
361 opts.warn_on_too_large_rename = 1;
362 opts.output_format = DIFF_FORMAT_NO_OUTPUT;
363 if (diff_setup_done(&opts) < 0)
364 die("diff setup failed");
365 diff_tree_sha1(o_tree->object.sha1, tree->object.sha1, "", &opts);
367 for (i = 0; i < diff_queued_diff.nr; ++i) {
368 struct string_list_item *item;
370 struct diff_filepair *pair = diff_queued_diff.queue[i];
371 if (pair->status != 'R') {
372 diff_free_filepair(pair);
375 re = xmalloc(sizeof(*re));
378 item = string_list_lookup(re->pair->one->path, entries);
380 re->src_entry = insert_stage_data(re->pair->one->path,
381 o_tree, a_tree, b_tree, entries);
383 re->src_entry = item->util;
385 item = string_list_lookup(re->pair->two->path, entries);
387 re->dst_entry = insert_stage_data(re->pair->two->path,
388 o_tree, a_tree, b_tree, entries);
390 re->dst_entry = item->util;
391 item = string_list_insert(pair->one->path, renames);
394 opts.output_format = DIFF_FORMAT_NO_OUTPUT;
395 diff_queued_diff.nr = 0;
400 static int update_stages(const char *path, struct diff_filespec *o,
401 struct diff_filespec *a, struct diff_filespec *b,
404 int options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_OK_TO_REPLACE;
406 if (remove_file_from_cache(path))
409 if (add_cacheinfo(o->mode, o->sha1, path, 1, 0, options))
412 if (add_cacheinfo(a->mode, a->sha1, path, 2, 0, options))
415 if (add_cacheinfo(b->mode, b->sha1, path, 3, 0, options))
420 static int remove_file(int clean, const char *path, int no_wd)
422 int update_cache = index_only || clean;
423 int update_working_directory = !index_only && !no_wd;
426 if (remove_file_from_cache(path))
429 if (update_working_directory) {
430 if (remove_path(path))
436 static char *unique_path(const char *path, const char *branch)
438 char *newpath = xmalloc(strlen(path) + 1 + strlen(branch) + 8 + 1);
441 char *p = newpath + strlen(path);
442 strcpy(newpath, path);
448 while (string_list_has_string(¤t_file_set, newpath) ||
449 string_list_has_string(¤t_directory_set, newpath) ||
450 lstat(newpath, &st) == 0)
451 sprintf(p, "_%d", suffix++);
453 string_list_insert(newpath, ¤t_file_set);
457 static void flush_buffer(int fd, const char *buf, unsigned long size)
460 long ret = write_in_full(fd, buf, size);
465 die("merge-recursive: %s", strerror(errno));
467 die("merge-recursive: disk full?");
474 static int would_lose_untracked(const char *path)
476 int pos = cache_name_pos(path, strlen(path));
480 while (pos < active_nr &&
481 !strcmp(path, active_cache[pos]->name)) {
483 * If stage #0, it is definitely tracked.
484 * If it has stage #2 then it was tracked
485 * before this merge started. All other
486 * cases the path was not tracked.
488 switch (ce_stage(active_cache[pos])) {
495 return file_exists(path);
498 static int make_room_for_path(const char *path)
501 const char *msg = "failed to create path '%s'%s";
503 status = safe_create_leading_directories_const(path);
506 /* something else exists */
507 error(msg, path, ": perhaps a D/F conflict?");
514 * Do not unlink a file in the work tree if we are not
517 if (would_lose_untracked(path))
518 return error("refusing to lose untracked file at '%s'",
521 /* Successful unlink is good.. */
524 /* .. and so is no existing file */
527 /* .. but not some other error (who really cares what?) */
528 return error(msg, path, ": perhaps a D/F conflict?");
531 static void update_file_flags(const unsigned char *sha,
541 enum object_type type;
545 if (S_ISGITLINK(mode))
546 die("cannot read object %s '%s': It is a submodule!",
547 sha1_to_hex(sha), path);
549 buf = read_sha1_file(sha, &type, &size);
551 die("cannot read object %s '%s'", sha1_to_hex(sha), path);
552 if (type != OBJ_BLOB)
553 die("blob expected for %s '%s'", sha1_to_hex(sha), path);
555 struct strbuf strbuf;
556 strbuf_init(&strbuf, 0);
557 if (convert_to_working_tree(path, buf, size, &strbuf)) {
560 buf = strbuf_detach(&strbuf, NULL);
564 if (make_room_for_path(path) < 0) {
569 if (S_ISREG(mode) || (!has_symlinks && S_ISLNK(mode))) {
575 fd = open(path, O_WRONLY | O_TRUNC | O_CREAT, mode);
577 die("failed to open %s: %s", path, strerror(errno));
578 flush_buffer(fd, buf, size);
580 } else if (S_ISLNK(mode)) {
581 char *lnk = xmemdupz(buf, size);
582 safe_create_leading_directories_const(path);
587 die("do not know what to do with %06o %s '%s'",
588 mode, sha1_to_hex(sha), path);
593 add_cacheinfo(mode, sha, path, 0, update_wd, ADD_CACHE_OK_TO_ADD);
596 static void update_file(int clean,
597 const unsigned char *sha,
601 update_file_flags(sha, mode, path, index_only || clean, !index_only);
604 /* Low level file merging, update and removal */
606 struct merge_file_info
608 unsigned char sha[20];
614 static void fill_mm(const unsigned char *sha1, mmfile_t *mm)
617 enum object_type type;
619 if (!hashcmp(sha1, null_sha1)) {
620 mm->ptr = xstrdup("");
625 mm->ptr = read_sha1_file(sha1, &type, &size);
626 if (!mm->ptr || type != OBJ_BLOB)
627 die("unable to read blob object %s", sha1_to_hex(sha1));
631 static int merge_3way(mmbuffer_t *result_buf,
632 struct diff_filespec *o,
633 struct diff_filespec *a,
634 struct diff_filespec *b,
638 mmfile_t orig, src1, src2;
642 name1 = xstrdup(mkpath("%s:%s", branch1, a->path));
643 name2 = xstrdup(mkpath("%s:%s", branch2, b->path));
645 fill_mm(o->sha1, &orig);
646 fill_mm(a->sha1, &src1);
647 fill_mm(b->sha1, &src2);
649 merge_status = ll_merge(result_buf, a->path, &orig,
650 &src1, name1, &src2, name2,
661 static struct merge_file_info merge_file(struct diff_filespec *o,
662 struct diff_filespec *a, struct diff_filespec *b,
663 const char *branch1, const char *branch2)
665 struct merge_file_info result;
669 if ((S_IFMT & a->mode) != (S_IFMT & b->mode)) {
671 if (S_ISREG(a->mode)) {
672 result.mode = a->mode;
673 hashcpy(result.sha, a->sha1);
675 result.mode = b->mode;
676 hashcpy(result.sha, b->sha1);
679 if (!sha_eq(a->sha1, o->sha1) && !sha_eq(b->sha1, o->sha1))
685 if (a->mode == b->mode || a->mode == o->mode)
686 result.mode = b->mode;
688 result.mode = a->mode;
689 if (b->mode != o->mode) {
695 if (sha_eq(a->sha1, b->sha1) || sha_eq(a->sha1, o->sha1))
696 hashcpy(result.sha, b->sha1);
697 else if (sha_eq(b->sha1, o->sha1))
698 hashcpy(result.sha, a->sha1);
699 else if (S_ISREG(a->mode)) {
700 mmbuffer_t result_buf;
703 merge_status = merge_3way(&result_buf, o, a, b,
706 if ((merge_status < 0) || !result_buf.ptr)
707 die("Failed to execute internal merge");
709 if (write_sha1_file(result_buf.ptr, result_buf.size,
710 blob_type, result.sha))
711 die("Unable to add %s to database",
714 free(result_buf.ptr);
715 result.clean = (merge_status == 0);
716 } else if (S_ISGITLINK(a->mode)) {
718 hashcpy(result.sha, a->sha1);
719 } else if (S_ISLNK(a->mode)) {
720 hashcpy(result.sha, a->sha1);
722 if (!sha_eq(a->sha1, b->sha1))
725 die("unsupported object type in the tree");
732 static void conflict_rename_rename(struct rename *ren1,
739 const char *ren1_dst = ren1->pair->two->path;
740 const char *ren2_dst = ren2->pair->two->path;
741 const char *dst_name1 = ren1_dst;
742 const char *dst_name2 = ren2_dst;
743 if (string_list_has_string(¤t_directory_set, ren1_dst)) {
744 dst_name1 = del[delp++] = unique_path(ren1_dst, branch1);
745 output(1, "%s is a directory in %s added as %s instead",
746 ren1_dst, branch2, dst_name1);
747 remove_file(0, ren1_dst, 0);
749 if (string_list_has_string(¤t_directory_set, ren2_dst)) {
750 dst_name2 = del[delp++] = unique_path(ren2_dst, branch2);
751 output(1, "%s is a directory in %s added as %s instead",
752 ren2_dst, branch1, dst_name2);
753 remove_file(0, ren2_dst, 0);
756 remove_file_from_cache(dst_name1);
757 remove_file_from_cache(dst_name2);
759 * Uncomment to leave the conflicting names in the resulting tree
761 * update_file(0, ren1->pair->two->sha1, ren1->pair->two->mode, dst_name1);
762 * update_file(0, ren2->pair->two->sha1, ren2->pair->two->mode, dst_name2);
765 update_stages(dst_name1, NULL, ren1->pair->two, NULL, 1);
766 update_stages(dst_name2, NULL, NULL, ren2->pair->two, 1);
772 static void conflict_rename_dir(struct rename *ren1,
775 char *new_path = unique_path(ren1->pair->two->path, branch1);
776 output(1, "Renamed %s to %s instead", ren1->pair->one->path, new_path);
777 remove_file(0, ren1->pair->two->path, 0);
778 update_file(0, ren1->pair->two->sha1, ren1->pair->two->mode, new_path);
782 static void conflict_rename_rename_2(struct rename *ren1,
787 char *new_path1 = unique_path(ren1->pair->two->path, branch1);
788 char *new_path2 = unique_path(ren2->pair->two->path, branch2);
789 output(1, "Renamed %s to %s and %s to %s instead",
790 ren1->pair->one->path, new_path1,
791 ren2->pair->one->path, new_path2);
792 remove_file(0, ren1->pair->two->path, 0);
793 update_file(0, ren1->pair->two->sha1, ren1->pair->two->mode, new_path1);
794 update_file(0, ren2->pair->two->sha1, ren2->pair->two->mode, new_path2);
799 static int process_renames(struct string_list *a_renames,
800 struct string_list *b_renames,
801 const char *a_branch,
802 const char *b_branch)
804 int clean_merge = 1, i, j;
805 struct string_list a_by_dst = {NULL, 0, 0, 0}, b_by_dst = {NULL, 0, 0, 0};
806 const struct rename *sre;
808 for (i = 0; i < a_renames->nr; i++) {
809 sre = a_renames->items[i].util;
810 string_list_insert(sre->pair->two->path, &a_by_dst)->util
813 for (i = 0; i < b_renames->nr; i++) {
814 sre = b_renames->items[i].util;
815 string_list_insert(sre->pair->two->path, &b_by_dst)->util
819 for (i = 0, j = 0; i < a_renames->nr || j < b_renames->nr;) {
822 struct string_list *renames1, *renames2, *renames2Dst;
823 struct rename *ren1 = NULL, *ren2 = NULL;
824 const char *branch1, *branch2;
825 const char *ren1_src, *ren1_dst;
827 if (i >= a_renames->nr) {
829 ren2 = b_renames->items[j++].util;
830 } else if (j >= b_renames->nr) {
832 ren1 = a_renames->items[i++].util;
834 compare = strcmp(a_renames->items[i].string,
835 b_renames->items[j].string);
837 ren1 = a_renames->items[i++].util;
839 ren2 = b_renames->items[j++].util;
842 /* TODO: refactor, so that 1/2 are not needed */
844 renames1 = a_renames;
845 renames2 = b_renames;
846 renames2Dst = &b_by_dst;
851 renames1 = b_renames;
852 renames2 = a_renames;
853 renames2Dst = &a_by_dst;
860 src = ren1->pair->one->path;
862 ren1->dst_entry->processed = 1;
863 ren1->src_entry->processed = 1;
869 ren1_src = ren1->pair->one->path;
870 ren1_dst = ren1->pair->two->path;
873 const char *ren2_src = ren2->pair->one->path;
874 const char *ren2_dst = ren2->pair->two->path;
875 /* Renamed in 1 and renamed in 2 */
876 if (strcmp(ren1_src, ren2_src) != 0)
877 die("ren1.src != ren2.src");
878 ren2->dst_entry->processed = 1;
880 if (strcmp(ren1_dst, ren2_dst) != 0) {
882 output(1, "CONFLICT (rename/rename): "
883 "Rename \"%s\"->\"%s\" in branch \"%s\" "
884 "rename \"%s\"->\"%s\" in \"%s\"%s",
885 src, ren1_dst, branch1,
886 src, ren2_dst, branch2,
887 index_only ? " (left unresolved)": "");
889 remove_file_from_cache(src);
890 update_file(0, ren1->pair->one->sha1,
891 ren1->pair->one->mode, src);
893 conflict_rename_rename(ren1, branch1, ren2, branch2);
895 struct merge_file_info mfi;
896 remove_file(1, ren1_src, 1);
897 mfi = merge_file(ren1->pair->one,
902 if (mfi.merge || !mfi.clean)
903 output(1, "Renamed %s->%s", src, ren1_dst);
906 output(2, "Auto-merged %s", ren1_dst);
909 output(1, "CONFLICT (content): merge conflict in %s",
914 update_stages(ren1_dst,
920 update_file(mfi.clean, mfi.sha, mfi.mode, ren1_dst);
923 /* Renamed in 1, maybe changed in 2 */
924 struct string_list_item *item;
925 /* we only use sha1 and mode of these */
926 struct diff_filespec src_other, dst_other;
927 int try_merge, stage = a_renames == renames1 ? 3: 2;
929 remove_file(1, ren1_src, index_only || stage == 3);
931 hashcpy(src_other.sha1, ren1->src_entry->stages[stage].sha);
932 src_other.mode = ren1->src_entry->stages[stage].mode;
933 hashcpy(dst_other.sha1, ren1->dst_entry->stages[stage].sha);
934 dst_other.mode = ren1->dst_entry->stages[stage].mode;
938 if (string_list_has_string(¤t_directory_set, ren1_dst)) {
940 output(1, "CONFLICT (rename/directory): Renamed %s->%s in %s "
941 " directory %s added in %s",
942 ren1_src, ren1_dst, branch1,
944 conflict_rename_dir(ren1, branch1);
945 } else if (sha_eq(src_other.sha1, null_sha1)) {
947 output(1, "CONFLICT (rename/delete): Renamed %s->%s in %s "
949 ren1_src, ren1_dst, branch1,
951 update_file(0, ren1->pair->two->sha1, ren1->pair->two->mode, ren1_dst);
952 } else if (!sha_eq(dst_other.sha1, null_sha1)) {
953 const char *new_path;
956 output(1, "CONFLICT (rename/add): Renamed %s->%s in %s. "
958 ren1_src, ren1_dst, branch1,
960 new_path = unique_path(ren1_dst, branch2);
961 output(1, "Added as %s instead", new_path);
962 update_file(0, dst_other.sha1, dst_other.mode, new_path);
963 } else if ((item = string_list_lookup(ren1_dst, renames2Dst))) {
967 output(1, "CONFLICT (rename/rename): Renamed %s->%s in %s. "
968 "Renamed %s->%s in %s",
969 ren1_src, ren1_dst, branch1,
970 ren2->pair->one->path, ren2->pair->two->path, branch2);
971 conflict_rename_rename_2(ren1, branch1, ren2, branch2);
976 struct diff_filespec *o, *a, *b;
977 struct merge_file_info mfi;
978 src_other.path = (char *)ren1_src;
981 if (a_renames == renames1) {
988 mfi = merge_file(o, a, b,
992 sha_eq(mfi.sha, ren1->pair->two->sha1) &&
993 mfi.mode == ren1->pair->two->mode)
995 * This messaged is part of
996 * t6022 test. If you change
997 * it update the test too.
999 output(3, "Skipped %s (merged same as existing)", ren1_dst);
1001 if (mfi.merge || !mfi.clean)
1002 output(1, "Renamed %s => %s", ren1_src, ren1_dst);
1004 output(2, "Auto-merged %s", ren1_dst);
1006 output(1, "CONFLICT (rename/modify): Merge conflict in %s",
1011 update_stages(ren1_dst,
1014 update_file(mfi.clean, mfi.sha, mfi.mode, ren1_dst);
1019 string_list_clear(&a_by_dst, 0);
1020 string_list_clear(&b_by_dst, 0);
1025 static unsigned char *stage_sha(const unsigned char *sha, unsigned mode)
1027 return (is_null_sha1(sha) || mode == 0) ? NULL: (unsigned char *)sha;
1030 /* Per entry merge function */
1031 static int process_entry(const char *path, struct stage_data *entry,
1032 const char *branch1,
1033 const char *branch2)
1036 printf("processing entry, clean cache: %s\n", index_only ? "yes": "no");
1037 print_index_entry("\tpath: ", entry);
1039 int clean_merge = 1;
1040 unsigned o_mode = entry->stages[1].mode;
1041 unsigned a_mode = entry->stages[2].mode;
1042 unsigned b_mode = entry->stages[3].mode;
1043 unsigned char *o_sha = stage_sha(entry->stages[1].sha, o_mode);
1044 unsigned char *a_sha = stage_sha(entry->stages[2].sha, a_mode);
1045 unsigned char *b_sha = stage_sha(entry->stages[3].sha, b_mode);
1047 if (o_sha && (!a_sha || !b_sha)) {
1048 /* Case A: Deleted in one */
1049 if ((!a_sha && !b_sha) ||
1050 (sha_eq(a_sha, o_sha) && !b_sha) ||
1051 (!a_sha && sha_eq(b_sha, o_sha))) {
1052 /* Deleted in both or deleted in one and
1053 * unchanged in the other */
1055 output(2, "Removed %s", path);
1056 /* do not touch working file if it did not exist */
1057 remove_file(1, path, !a_sha);
1059 /* Deleted in one and changed in the other */
1062 output(1, "CONFLICT (delete/modify): %s deleted in %s "
1063 "and modified in %s. Version %s of %s left in tree.",
1065 branch2, branch2, path);
1066 update_file(0, b_sha, b_mode, path);
1068 output(1, "CONFLICT (delete/modify): %s deleted in %s "
1069 "and modified in %s. Version %s of %s left in tree.",
1071 branch1, branch1, path);
1072 update_file(0, a_sha, a_mode, path);
1076 } else if ((!o_sha && a_sha && !b_sha) ||
1077 (!o_sha && !a_sha && b_sha)) {
1078 /* Case B: Added in one. */
1079 const char *add_branch;
1080 const char *other_branch;
1082 const unsigned char *sha;
1086 add_branch = branch1;
1087 other_branch = branch2;
1090 conf = "file/directory";
1092 add_branch = branch2;
1093 other_branch = branch1;
1096 conf = "directory/file";
1098 if (string_list_has_string(¤t_directory_set, path)) {
1099 const char *new_path = unique_path(path, add_branch);
1101 output(1, "CONFLICT (%s): There is a directory with name %s in %s. "
1103 conf, path, other_branch, path, new_path);
1104 remove_file(0, path, 0);
1105 update_file(0, sha, mode, new_path);
1107 output(2, "Added %s", path);
1108 update_file(1, sha, mode, path);
1110 } else if (a_sha && b_sha) {
1111 /* Case C: Added in both (check for same permissions) and */
1112 /* case D: Modified in both, but differently. */
1113 const char *reason = "content";
1114 struct merge_file_info mfi;
1115 struct diff_filespec o, a, b;
1119 o_sha = (unsigned char *)null_sha1;
1121 output(2, "Auto-merged %s", path);
1122 o.path = a.path = b.path = (char *)path;
1123 hashcpy(o.sha1, o_sha);
1125 hashcpy(a.sha1, a_sha);
1127 hashcpy(b.sha1, b_sha);
1130 mfi = merge_file(&o, &a, &b,
1133 clean_merge = mfi.clean;
1135 update_file(1, mfi.sha, mfi.mode, path);
1136 else if (S_ISGITLINK(mfi.mode))
1137 output(1, "CONFLICT (submodule): Merge conflict in %s "
1138 "- needs %s", path, sha1_to_hex(b.sha1));
1140 output(1, "CONFLICT (%s): Merge conflict in %s",
1144 update_file(0, mfi.sha, mfi.mode, path);
1146 update_file_flags(mfi.sha, mfi.mode, path,
1147 0 /* update_cache */, 1 /* update_working_directory */);
1149 } else if (!o_sha && !a_sha && !b_sha) {
1151 * this entry was deleted altogether. a_mode == 0 means
1152 * we had that path and want to actively remove it.
1154 remove_file(1, path, !a_mode);
1156 die("Fatal merge failure, shouldn't happen.");
1161 int merge_trees(struct tree *head,
1163 struct tree *common,
1164 const char *branch1,
1165 const char *branch2,
1166 struct tree **result)
1170 if (subtree_merge) {
1171 merge = shift_tree_object(head, merge);
1172 common = shift_tree_object(head, common);
1175 if (sha_eq(common->object.sha1, merge->object.sha1)) {
1176 output(0, "Already uptodate!");
1181 code = git_merge_trees(index_only, common, head, merge);
1184 die("merging of trees %s and %s failed",
1185 sha1_to_hex(head->object.sha1),
1186 sha1_to_hex(merge->object.sha1));
1188 if (unmerged_cache()) {
1189 struct string_list *entries, *re_head, *re_merge;
1191 string_list_clear(¤t_file_set, 1);
1192 string_list_clear(¤t_directory_set, 1);
1193 get_files_dirs(head);
1194 get_files_dirs(merge);
1196 entries = get_unmerged();
1197 re_head = get_renames(head, common, head, merge, entries);
1198 re_merge = get_renames(merge, common, head, merge, entries);
1199 clean = process_renames(re_head, re_merge,
1201 for (i = 0; i < entries->nr; i++) {
1202 const char *path = entries->items[i].string;
1203 struct stage_data *e = entries->items[i].util;
1205 && !process_entry(path, e, branch1, branch2))
1209 string_list_clear(re_merge, 0);
1210 string_list_clear(re_head, 0);
1211 string_list_clear(entries, 1);
1218 *result = write_tree_from_memory();
1223 static struct commit_list *reverse_commit_list(struct commit_list *list)
1225 struct commit_list *next = NULL, *current, *backup;
1226 for (current = list; current; current = backup) {
1227 backup = current->next;
1228 current->next = next;
1235 * Merge the commits h1 and h2, return the resulting virtual
1236 * commit object and a flag indicating the cleanness of the merge.
1238 int merge_recursive(struct commit *h1,
1240 const char *branch1,
1241 const char *branch2,
1242 struct commit_list *ca,
1243 struct commit **result)
1245 struct commit_list *iter;
1246 struct commit *merged_common_ancestors;
1247 struct tree *mrtree = mrtree;
1251 output(4, "Merging:");
1252 output_commit_title(h1);
1253 output_commit_title(h2);
1257 ca = get_merge_bases(h1, h2, 1);
1258 ca = reverse_commit_list(ca);
1262 output(5, "found %u common ancestor(s):", commit_list_count(ca));
1263 for (iter = ca; iter; iter = iter->next)
1264 output_commit_title(iter->item);
1267 merged_common_ancestors = pop_commit(&ca);
1268 if (merged_common_ancestors == NULL) {
1269 /* if there is no common ancestor, make an empty tree */
1270 struct tree *tree = xcalloc(1, sizeof(struct tree));
1272 tree->object.parsed = 1;
1273 tree->object.type = OBJ_TREE;
1274 pretend_sha1_file(NULL, 0, OBJ_TREE, tree->object.sha1);
1275 merged_common_ancestors = make_virtual_commit(tree, "ancestor");
1278 for (iter = ca; iter; iter = iter->next) {
1281 * When the merge fails, the result contains files
1282 * with conflict markers. The cleanness flag is
1283 * ignored, it was never actually used, as result of
1284 * merge_trees has always overwritten it: the committed
1285 * "conflicts" were already resolved.
1288 merge_recursive(merged_common_ancestors, iter->item,
1289 "Temporary merge branch 1",
1290 "Temporary merge branch 2",
1292 &merged_common_ancestors);
1295 if (!merged_common_ancestors)
1296 die("merge returned no commit");
1306 clean = merge_trees(h1->tree, h2->tree, merged_common_ancestors->tree,
1307 branch1, branch2, &mrtree);
1310 *result = make_virtual_commit(mrtree, "merged tree");
1311 commit_list_insert(h1, &(*result)->parents);
1312 commit_list_insert(h2, &(*result)->parents->next);
1318 static const char *better_branch_name(const char *branch)
1320 static char githead_env[8 + 40 + 1];
1323 if (strlen(branch) != 40)
1325 sprintf(githead_env, "GITHEAD_%s", branch);
1326 name = getenv(githead_env);
1327 return name ? name : branch;
1330 static struct commit *get_ref(const char *ref)
1332 unsigned char sha1[20];
1333 struct object *object;
1335 if (get_sha1(ref, sha1))
1336 die("Could not resolve ref '%s'", ref);
1337 object = deref_tag(parse_object(sha1), ref, strlen(ref));
1340 if (object->type == OBJ_TREE)
1341 return make_virtual_commit((struct tree*)object,
1342 better_branch_name(ref));
1343 if (object->type != OBJ_COMMIT)
1345 if (parse_commit((struct commit *)object))
1346 die("Could not parse commit '%s'", sha1_to_hex(object->sha1));
1347 return (struct commit *)object;
1350 static int merge_config(const char *var, const char *value, void *cb)
1352 if (!strcasecmp(var, "merge.verbosity")) {
1353 verbosity = git_config_int(var, value);
1356 if (!strcasecmp(var, "diff.renamelimit")) {
1357 diff_rename_limit = git_config_int(var, value);
1360 if (!strcasecmp(var, "merge.renamelimit")) {
1361 merge_rename_limit = git_config_int(var, value);
1364 return git_default_config(var, value, cb);
1367 int cmd_merge_recursive(int argc, const char **argv, const char *prefix)
1369 static const char *bases[20];
1370 static unsigned bases_count = 0;
1372 const char *branch1, *branch2;
1373 struct commit *result, *h1, *h2;
1374 struct commit_list *ca = NULL;
1375 struct lock_file *lock = xcalloc(1, sizeof(struct lock_file));
1379 int namelen = strlen(argv[0]);
1381 !strcmp(argv[0] + namelen - 8, "-subtree"))
1385 git_config(merge_config, NULL);
1386 if (getenv("GIT_MERGE_VERBOSITY"))
1387 verbosity = strtol(getenv("GIT_MERGE_VERBOSITY"), NULL, 10);
1390 die("Usage: %s <base>... -- <head> <remote> ...\n", argv[0]);
1392 for (i = 1; i < argc; ++i) {
1393 if (!strcmp(argv[i], "--"))
1395 if (bases_count < sizeof(bases)/sizeof(*bases))
1396 bases[bases_count++] = argv[i];
1398 if (argc - i != 3) /* "--" "<head>" "<remote>" */
1399 die("Not handling anything other than two heads merge.");
1403 branch1 = argv[++i];
1404 branch2 = argv[++i];
1406 h1 = get_ref(branch1);
1407 h2 = get_ref(branch2);
1409 branch1 = better_branch_name(branch1);
1410 branch2 = better_branch_name(branch2);
1413 printf("Merging %s with %s\n", branch1, branch2);
1415 index_fd = hold_locked_index(lock, 1);
1417 for (i = 0; i < bases_count; i++) {
1418 struct commit *ancestor = get_ref(bases[i]);
1419 ca = commit_list_insert(ancestor, &ca);
1421 clean = merge_recursive(h1, h2, branch1, branch2, ca, &result);
1423 if (active_cache_changed &&
1424 (write_cache(index_fd, active_cache, active_nr) ||
1425 commit_locked_index(lock)))
1426 die ("unable to write %s", get_index_file());
1428 return clean ? 0: 1;