2 * Recursive Merge algorithm stolen from git-merge-recursive.py by
4 * The thieves were Alex Riesen and Johannes Schindelin, in June/July 2006
8 #include "cache-tree.h"
12 #include "tree-walk.h"
16 #include "unpack-trees.h"
17 #include "string-list.h"
18 #include "xdiff-interface.h"
21 #include "merge-recursive.h"
23 #include "submodule.h"
25 static struct tree
*shift_tree_object(struct tree
*one
, struct tree
*two
,
26 const char *subtree_shift
)
28 unsigned char shifted
[20];
30 if (!*subtree_shift
) {
31 shift_tree(one
->object
.sha1
, two
->object
.sha1
, shifted
, 0);
33 shift_tree_by(one
->object
.sha1
, two
->object
.sha1
, shifted
,
36 if (!hashcmp(two
->object
.sha1
, shifted
))
38 return lookup_tree(shifted
);
42 * A virtual commit has (const char *)commit->util set to the name.
45 static struct commit
*make_virtual_commit(struct tree
*tree
, const char *comment
)
47 struct commit
*commit
= xcalloc(1, sizeof(struct commit
));
49 commit
->util
= (void*)comment
;
51 commit
->object
.parsed
= 1;
56 * Since we use get_tree_entry(), which does not put the read object into
57 * the object pool, we cannot rely on a == b.
59 static int sha_eq(const unsigned char *a
, const unsigned char *b
)
63 return a
&& b
&& hashcmp(a
, b
) == 0;
69 RENAME_ONE_FILE_TO_ONE
,
70 RENAME_ONE_FILE_TO_TWO
,
71 RENAME_TWO_FILES_TO_ONE
74 struct rename_conflict_info
{
75 enum rename_type rename_type
;
76 struct diff_filepair
*pair1
;
77 struct diff_filepair
*pair2
;
80 struct stage_data
*dst_entry1
;
81 struct stage_data
*dst_entry2
;
82 struct diff_filespec ren1_other
;
83 struct diff_filespec ren2_other
;
87 * Since we want to write the index eventually, we cannot reuse the index
88 * for these (temporary) data.
93 unsigned char sha
[20];
95 struct rename_conflict_info
*rename_conflict_info
;
99 static inline void setup_rename_conflict_info(enum rename_type rename_type
,
100 struct diff_filepair
*pair1
,
101 struct diff_filepair
*pair2
,
104 struct stage_data
*dst_entry1
,
105 struct stage_data
*dst_entry2
,
106 struct merge_options
*o
,
107 struct stage_data
*src_entry1
,
108 struct stage_data
*src_entry2
)
110 struct rename_conflict_info
*ci
= xcalloc(1, sizeof(struct rename_conflict_info
));
111 ci
->rename_type
= rename_type
;
113 ci
->branch1
= branch1
;
114 ci
->branch2
= branch2
;
116 ci
->dst_entry1
= dst_entry1
;
117 dst_entry1
->rename_conflict_info
= ci
;
118 dst_entry1
->processed
= 0;
120 assert(!pair2
== !dst_entry2
);
122 ci
->dst_entry2
= dst_entry2
;
124 dst_entry2
->rename_conflict_info
= ci
;
127 if (rename_type
== RENAME_TWO_FILES_TO_ONE
) {
129 * For each rename, there could have been
130 * modifications on the side of history where that
131 * file was not renamed.
133 int ostage1
= o
->branch1
== branch1
? 3 : 2;
134 int ostage2
= ostage1
^ 1;
136 ci
->ren1_other
.path
= pair1
->one
->path
;
137 hashcpy(ci
->ren1_other
.sha1
, src_entry1
->stages
[ostage1
].sha
);
138 ci
->ren1_other
.mode
= src_entry1
->stages
[ostage1
].mode
;
140 ci
->ren2_other
.path
= pair2
->one
->path
;
141 hashcpy(ci
->ren2_other
.sha1
, src_entry2
->stages
[ostage2
].sha
);
142 ci
->ren2_other
.mode
= src_entry2
->stages
[ostage2
].mode
;
146 static int show(struct merge_options
*o
, int v
)
148 return (!o
->call_depth
&& o
->verbosity
>= v
) || o
->verbosity
>= 5;
151 static void flush_output(struct merge_options
*o
)
154 fputs(o
->obuf
.buf
, stdout
);
155 strbuf_reset(&o
->obuf
);
159 __attribute__((format (printf
, 3, 4)))
160 static void output(struct merge_options
*o
, int v
, const char *fmt
, ...)
167 strbuf_grow(&o
->obuf
, o
->call_depth
* 2 + 2);
168 memset(o
->obuf
.buf
+ o
->obuf
.len
, ' ', o
->call_depth
* 2);
169 strbuf_setlen(&o
->obuf
, o
->obuf
.len
+ o
->call_depth
* 2);
172 strbuf_vaddf(&o
->obuf
, fmt
, ap
);
175 strbuf_add(&o
->obuf
, "\n", 1);
176 if (!o
->buffer_output
)
180 static void output_commit_title(struct merge_options
*o
, struct commit
*commit
)
184 for (i
= o
->call_depth
; i
--;)
187 printf("virtual %s\n", (char *)commit
->util
);
189 printf("%s ", find_unique_abbrev(commit
->object
.sha1
, DEFAULT_ABBREV
));
190 if (parse_commit(commit
) != 0)
191 printf("(bad commit)\n");
194 int len
= find_commit_subject(commit
->buffer
, &title
);
196 printf("%.*s\n", len
, title
);
201 static int add_cacheinfo(unsigned int mode
, const unsigned char *sha1
,
202 const char *path
, int stage
, int refresh
, int options
)
204 struct cache_entry
*ce
;
205 ce
= make_cache_entry(mode
, sha1
? sha1
: null_sha1
, path
, stage
, refresh
);
207 return error("addinfo_cache failed for path '%s'", path
);
208 return add_cache_entry(ce
, options
);
211 static void init_tree_desc_from_tree(struct tree_desc
*desc
, struct tree
*tree
)
214 init_tree_desc(desc
, tree
->buffer
, tree
->size
);
217 static int git_merge_trees(int index_only
,
223 struct tree_desc t
[3];
224 struct unpack_trees_options opts
;
226 memset(&opts
, 0, sizeof(opts
));
233 opts
.fn
= threeway_merge
;
234 opts
.src_index
= &the_index
;
235 opts
.dst_index
= &the_index
;
236 setup_unpack_trees_porcelain(&opts
, "merge");
238 init_tree_desc_from_tree(t
+0, common
);
239 init_tree_desc_from_tree(t
+1, head
);
240 init_tree_desc_from_tree(t
+2, merge
);
242 rc
= unpack_trees(3, t
, &opts
);
243 cache_tree_free(&active_cache_tree
);
247 struct tree
*write_tree_from_memory(struct merge_options
*o
)
249 struct tree
*result
= NULL
;
251 if (unmerged_cache()) {
253 fprintf(stderr
, "BUG: There are unmerged index entries:\n");
254 for (i
= 0; i
< active_nr
; i
++) {
255 struct cache_entry
*ce
= active_cache
[i
];
257 fprintf(stderr
, "BUG: %d %.*s\n", ce_stage(ce
),
258 (int)ce_namelen(ce
), ce
->name
);
260 die("Bug in merge-recursive.c");
263 if (!active_cache_tree
)
264 active_cache_tree
= cache_tree();
266 if (!cache_tree_fully_valid(active_cache_tree
) &&
267 cache_tree_update(active_cache_tree
,
268 active_cache
, active_nr
, 0, 0) < 0)
269 die("error building trees");
271 result
= lookup_tree(active_cache_tree
->sha1
);
276 static int save_files_dirs(const unsigned char *sha1
,
277 const char *base
, int baselen
, const char *path
,
278 unsigned int mode
, int stage
, void *context
)
280 int len
= strlen(path
);
281 char *newpath
= xmalloc(baselen
+ len
+ 1);
282 struct merge_options
*o
= context
;
284 memcpy(newpath
, base
, baselen
);
285 memcpy(newpath
+ baselen
, path
, len
);
286 newpath
[baselen
+ len
] = '\0';
289 string_list_insert(&o
->current_directory_set
, newpath
);
291 string_list_insert(&o
->current_file_set
, newpath
);
294 return (S_ISDIR(mode
) ? READ_TREE_RECURSIVE
: 0);
297 static int get_files_dirs(struct merge_options
*o
, struct tree
*tree
)
300 if (read_tree_recursive(tree
, "", 0, 0, NULL
, save_files_dirs
, o
))
302 n
= o
->current_file_set
.nr
+ o
->current_directory_set
.nr
;
307 * Returns an index_entry instance which doesn't have to correspond to
308 * a real cache entry in Git's index.
310 static struct stage_data
*insert_stage_data(const char *path
,
311 struct tree
*o
, struct tree
*a
, struct tree
*b
,
312 struct string_list
*entries
)
314 struct string_list_item
*item
;
315 struct stage_data
*e
= xcalloc(1, sizeof(struct stage_data
));
316 get_tree_entry(o
->object
.sha1
, path
,
317 e
->stages
[1].sha
, &e
->stages
[1].mode
);
318 get_tree_entry(a
->object
.sha1
, path
,
319 e
->stages
[2].sha
, &e
->stages
[2].mode
);
320 get_tree_entry(b
->object
.sha1
, path
,
321 e
->stages
[3].sha
, &e
->stages
[3].mode
);
322 item
= string_list_insert(entries
, path
);
328 * Create a dictionary mapping file names to stage_data objects. The
329 * dictionary contains one entry for every path with a non-zero stage entry.
331 static struct string_list
*get_unmerged(void)
333 struct string_list
*unmerged
= xcalloc(1, sizeof(struct string_list
));
336 unmerged
->strdup_strings
= 1;
338 for (i
= 0; i
< active_nr
; i
++) {
339 struct string_list_item
*item
;
340 struct stage_data
*e
;
341 struct cache_entry
*ce
= active_cache
[i
];
345 item
= string_list_lookup(unmerged
, ce
->name
);
347 item
= string_list_insert(unmerged
, ce
->name
);
348 item
->util
= xcalloc(1, sizeof(struct stage_data
));
351 e
->stages
[ce_stage(ce
)].mode
= ce
->ce_mode
;
352 hashcpy(e
->stages
[ce_stage(ce
)].sha
, ce
->sha1
);
358 static int string_list_df_name_compare(const void *a
, const void *b
)
360 const struct string_list_item
*one
= a
;
361 const struct string_list_item
*two
= b
;
362 int onelen
= strlen(one
->string
);
363 int twolen
= strlen(two
->string
);
365 * Here we only care that entries for D/F conflicts are
366 * adjacent, in particular with the file of the D/F conflict
367 * appearing before files below the corresponding directory.
368 * The order of the rest of the list is irrelevant for us.
370 * To achieve this, we sort with df_name_compare and provide
371 * the mode S_IFDIR so that D/F conflicts will sort correctly.
372 * We use the mode S_IFDIR for everything else for simplicity,
373 * since in other cases any changes in their order due to
374 * sorting cause no problems for us.
376 int cmp
= df_name_compare(one
->string
, onelen
, S_IFDIR
,
377 two
->string
, twolen
, S_IFDIR
);
379 * Now that 'foo' and 'foo/bar' compare equal, we have to make sure
380 * that 'foo' comes before 'foo/bar'.
384 return onelen
- twolen
;
387 static void record_df_conflict_files(struct merge_options
*o
,
388 struct string_list
*entries
)
390 /* If there is a D/F conflict and the file for such a conflict
391 * currently exist in the working copy, we want to allow it to be
392 * removed to make room for the corresponding directory if needed.
393 * The files underneath the directories of such D/F conflicts will
394 * be processed before the corresponding file involved in the D/F
395 * conflict. If the D/F directory ends up being removed by the
396 * merge, then we won't have to touch the D/F file. If the D/F
397 * directory needs to be written to the working copy, then the D/F
398 * file will simply be removed (in make_room_for_path()) to make
399 * room for the necessary paths. Note that if both the directory
400 * and the file need to be present, then the D/F file will be
401 * reinstated with a new unique name at the time it is processed.
403 const char *last_file
= NULL
;
408 * If we're merging merge-bases, we don't want to bother with
409 * any working directory changes.
414 /* Ensure D/F conflicts are adjacent in the entries list. */
415 qsort(entries
->items
, entries
->nr
, sizeof(*entries
->items
),
416 string_list_df_name_compare
);
418 string_list_clear(&o
->df_conflict_file_set
, 1);
419 for (i
= 0; i
< entries
->nr
; i
++) {
420 const char *path
= entries
->items
[i
].string
;
421 int len
= strlen(path
);
422 struct stage_data
*e
= entries
->items
[i
].util
;
425 * Check if last_file & path correspond to a D/F conflict;
426 * i.e. whether path is last_file+'/'+<something>.
427 * If so, record that it's okay to remove last_file to make
428 * room for path and friends if needed.
432 memcmp(path
, last_file
, last_len
) == 0 &&
433 path
[last_len
] == '/') {
434 string_list_insert(&o
->df_conflict_file_set
, last_file
);
438 * Determine whether path could exist as a file in the
439 * working directory as a possible D/F conflict. This
440 * will only occur when it exists in stage 2 as a
443 if (S_ISREG(e
->stages
[2].mode
) || S_ISLNK(e
->stages
[2].mode
)) {
453 struct diff_filepair
*pair
;
454 struct stage_data
*src_entry
;
455 struct stage_data
*dst_entry
;
456 unsigned processed
:1;
460 * Get information of all renames which occurred between 'o_tree' and
461 * 'tree'. We need the three trees in the merge ('o_tree', 'a_tree' and
462 * 'b_tree') to be able to associate the correct cache entries with
463 * the rename information. 'tree' is always equal to either a_tree or b_tree.
465 static struct string_list
*get_renames(struct merge_options
*o
,
470 struct string_list
*entries
)
473 struct string_list
*renames
;
474 struct diff_options opts
;
476 renames
= xcalloc(1, sizeof(struct string_list
));
478 DIFF_OPT_SET(&opts
, RECURSIVE
);
479 opts
.detect_rename
= DIFF_DETECT_RENAME
;
480 opts
.rename_limit
= o
->merge_rename_limit
>= 0 ? o
->merge_rename_limit
:
481 o
->diff_rename_limit
>= 0 ? o
->diff_rename_limit
:
483 opts
.rename_score
= o
->rename_score
;
484 opts
.show_rename_progress
= o
->show_rename_progress
;
485 opts
.output_format
= DIFF_FORMAT_NO_OUTPUT
;
486 if (diff_setup_done(&opts
) < 0)
487 die("diff setup failed");
488 diff_tree_sha1(o_tree
->object
.sha1
, tree
->object
.sha1
, "", &opts
);
490 if (opts
.needed_rename_limit
> o
->needed_rename_limit
)
491 o
->needed_rename_limit
= opts
.needed_rename_limit
;
492 for (i
= 0; i
< diff_queued_diff
.nr
; ++i
) {
493 struct string_list_item
*item
;
495 struct diff_filepair
*pair
= diff_queued_diff
.queue
[i
];
496 if (pair
->status
!= 'R') {
497 diff_free_filepair(pair
);
500 re
= xmalloc(sizeof(*re
));
503 item
= string_list_lookup(entries
, re
->pair
->one
->path
);
505 re
->src_entry
= insert_stage_data(re
->pair
->one
->path
,
506 o_tree
, a_tree
, b_tree
, entries
);
508 re
->src_entry
= item
->util
;
510 item
= string_list_lookup(entries
, re
->pair
->two
->path
);
512 re
->dst_entry
= insert_stage_data(re
->pair
->two
->path
,
513 o_tree
, a_tree
, b_tree
, entries
);
515 re
->dst_entry
= item
->util
;
516 item
= string_list_insert(renames
, pair
->one
->path
);
519 opts
.output_format
= DIFF_FORMAT_NO_OUTPUT
;
520 diff_queued_diff
.nr
= 0;
525 static int update_stages(const char *path
, const struct diff_filespec
*o
,
526 const struct diff_filespec
*a
,
527 const struct diff_filespec
*b
)
530 int options
= ADD_CACHE_OK_TO_ADD
| ADD_CACHE_SKIP_DFCHECK
;
532 if (remove_file_from_cache(path
))
535 if (add_cacheinfo(o
->mode
, o
->sha1
, path
, 1, 0, options
))
538 if (add_cacheinfo(a
->mode
, a
->sha1
, path
, 2, 0, options
))
541 if (add_cacheinfo(b
->mode
, b
->sha1
, path
, 3, 0, options
))
546 static void update_entry(struct stage_data
*entry
,
547 struct diff_filespec
*o
,
548 struct diff_filespec
*a
,
549 struct diff_filespec
*b
)
551 entry
->processed
= 0;
552 entry
->stages
[1].mode
= o
->mode
;
553 entry
->stages
[2].mode
= a
->mode
;
554 entry
->stages
[3].mode
= b
->mode
;
555 hashcpy(entry
->stages
[1].sha
, o
->sha1
);
556 hashcpy(entry
->stages
[2].sha
, a
->sha1
);
557 hashcpy(entry
->stages
[3].sha
, b
->sha1
);
560 static int remove_file(struct merge_options
*o
, int clean
,
561 const char *path
, int no_wd
)
563 int update_cache
= o
->call_depth
|| clean
;
564 int update_working_directory
= !o
->call_depth
&& !no_wd
;
567 if (remove_file_from_cache(path
))
570 if (update_working_directory
) {
571 if (remove_path(path
))
577 static char *unique_path(struct merge_options
*o
, const char *path
, const char *branch
)
579 char *newpath
= xmalloc(strlen(path
) + 1 + strlen(branch
) + 8 + 1);
582 char *p
= newpath
+ strlen(path
);
583 strcpy(newpath
, path
);
589 while (string_list_has_string(&o
->current_file_set
, newpath
) ||
590 string_list_has_string(&o
->current_directory_set
, newpath
) ||
591 lstat(newpath
, &st
) == 0)
592 sprintf(p
, "_%d", suffix
++);
594 string_list_insert(&o
->current_file_set
, newpath
);
598 static void flush_buffer(int fd
, const char *buf
, unsigned long size
)
601 long ret
= write_in_full(fd
, buf
, size
);
606 die_errno("merge-recursive");
608 die("merge-recursive: disk full?");
615 static int dir_in_way(const char *path
, int check_working_copy
)
617 int pos
, pathlen
= strlen(path
);
618 char *dirpath
= xmalloc(pathlen
+ 2);
621 strcpy(dirpath
, path
);
622 dirpath
[pathlen
] = '/';
623 dirpath
[pathlen
+1] = '\0';
625 pos
= cache_name_pos(dirpath
, pathlen
+1);
629 if (pos
< active_nr
&&
630 !strncmp(dirpath
, active_cache
[pos
]->name
, pathlen
+1)) {
636 return check_working_copy
&& !lstat(path
, &st
) && S_ISDIR(st
.st_mode
);
639 static int was_tracked(const char *path
)
641 int pos
= cache_name_pos(path
, strlen(path
));
645 while (pos
< active_nr
&&
646 !strcmp(path
, active_cache
[pos
]->name
)) {
648 * If stage #0, it is definitely tracked.
649 * If it has stage #2 then it was tracked
650 * before this merge started. All other
651 * cases the path was not tracked.
653 switch (ce_stage(active_cache
[pos
])) {
663 static int would_lose_untracked(const char *path
)
665 return !was_tracked(path
) && file_exists(path
);
668 static int make_room_for_path(struct merge_options
*o
, const char *path
)
671 const char *msg
= "failed to create path '%s'%s";
673 /* Unlink any D/F conflict files that are in the way */
674 for (i
= 0; i
< o
->df_conflict_file_set
.nr
; i
++) {
675 const char *df_path
= o
->df_conflict_file_set
.items
[i
].string
;
676 size_t pathlen
= strlen(path
);
677 size_t df_pathlen
= strlen(df_path
);
678 if (df_pathlen
< pathlen
&&
679 path
[df_pathlen
] == '/' &&
680 strncmp(path
, df_path
, df_pathlen
) == 0) {
682 "Removing %s to make room for subdirectory\n",
685 unsorted_string_list_delete_item(&o
->df_conflict_file_set
,
691 /* Make sure leading directories are created */
692 status
= safe_create_leading_directories_const(path
);
695 /* something else exists */
696 error(msg
, path
, ": perhaps a D/F conflict?");
703 * Do not unlink a file in the work tree if we are not
706 if (would_lose_untracked(path
))
707 return error("refusing to lose untracked file at '%s'",
710 /* Successful unlink is good.. */
713 /* .. and so is no existing file */
716 /* .. but not some other error (who really cares what?) */
717 return error(msg
, path
, ": perhaps a D/F conflict?");
720 static void update_file_flags(struct merge_options
*o
,
721 const unsigned char *sha
,
731 enum object_type type
;
735 if (S_ISGITLINK(mode
)) {
737 * We may later decide to recursively descend into
738 * the submodule directory and update its index
739 * and/or work tree, but we do not do that now.
745 buf
= read_sha1_file(sha
, &type
, &size
);
747 die("cannot read object %s '%s'", sha1_to_hex(sha
), path
);
748 if (type
!= OBJ_BLOB
)
749 die("blob expected for %s '%s'", sha1_to_hex(sha
), path
);
751 struct strbuf strbuf
= STRBUF_INIT
;
752 if (convert_to_working_tree(path
, buf
, size
, &strbuf
)) {
755 buf
= strbuf_detach(&strbuf
, NULL
);
759 if (make_room_for_path(o
, path
) < 0) {
764 if (S_ISREG(mode
) || (!has_symlinks
&& S_ISLNK(mode
))) {
770 fd
= open(path
, O_WRONLY
| O_TRUNC
| O_CREAT
, mode
);
772 die_errno("failed to open '%s'", path
);
773 flush_buffer(fd
, buf
, size
);
775 } else if (S_ISLNK(mode
)) {
776 char *lnk
= xmemdupz(buf
, size
);
777 safe_create_leading_directories_const(path
);
779 if (symlink(lnk
, path
))
780 die_errno("failed to symlink '%s'", path
);
783 die("do not know what to do with %06o %s '%s'",
784 mode
, sha1_to_hex(sha
), path
);
789 add_cacheinfo(mode
, sha
, path
, 0, update_wd
, ADD_CACHE_OK_TO_ADD
);
792 static void update_file(struct merge_options
*o
,
794 const unsigned char *sha
,
798 update_file_flags(o
, sha
, mode
, path
, o
->call_depth
|| clean
, !o
->call_depth
);
801 /* Low level file merging, update and removal */
803 struct merge_file_info
{
804 unsigned char sha
[20];
810 static int merge_3way(struct merge_options
*o
,
811 mmbuffer_t
*result_buf
,
812 const struct diff_filespec
*one
,
813 const struct diff_filespec
*a
,
814 const struct diff_filespec
*b
,
818 mmfile_t orig
, src1
, src2
;
819 struct ll_merge_options ll_opts
= {0};
820 char *base_name
, *name1
, *name2
;
823 ll_opts
.renormalize
= o
->renormalize
;
824 ll_opts
.xdl_opts
= o
->xdl_opts
;
827 ll_opts
.virtual_ancestor
= 1;
830 switch (o
->recursive_variant
) {
831 case MERGE_RECURSIVE_OURS
:
832 ll_opts
.variant
= XDL_MERGE_FAVOR_OURS
;
834 case MERGE_RECURSIVE_THEIRS
:
835 ll_opts
.variant
= XDL_MERGE_FAVOR_THEIRS
;
843 if (strcmp(a
->path
, b
->path
) ||
844 (o
->ancestor
!= NULL
&& strcmp(a
->path
, one
->path
) != 0)) {
845 base_name
= o
->ancestor
== NULL
? NULL
:
846 xstrdup(mkpath("%s:%s", o
->ancestor
, one
->path
));
847 name1
= xstrdup(mkpath("%s:%s", branch1
, a
->path
));
848 name2
= xstrdup(mkpath("%s:%s", branch2
, b
->path
));
850 base_name
= o
->ancestor
== NULL
? NULL
:
851 xstrdup(mkpath("%s", o
->ancestor
));
852 name1
= xstrdup(mkpath("%s", branch1
));
853 name2
= xstrdup(mkpath("%s", branch2
));
856 read_mmblob(&orig
, one
->sha1
);
857 read_mmblob(&src1
, a
->sha1
);
858 read_mmblob(&src2
, b
->sha1
);
860 merge_status
= ll_merge(result_buf
, a
->path
, &orig
, base_name
,
861 &src1
, name1
, &src2
, name2
, &ll_opts
);
871 static struct merge_file_info
merge_file_1(struct merge_options
*o
,
872 const struct diff_filespec
*one
,
873 const struct diff_filespec
*a
,
874 const struct diff_filespec
*b
,
878 struct merge_file_info result
;
882 if ((S_IFMT
& a
->mode
) != (S_IFMT
& b
->mode
)) {
884 if (S_ISREG(a
->mode
)) {
885 result
.mode
= a
->mode
;
886 hashcpy(result
.sha
, a
->sha1
);
888 result
.mode
= b
->mode
;
889 hashcpy(result
.sha
, b
->sha1
);
892 if (!sha_eq(a
->sha1
, one
->sha1
) && !sha_eq(b
->sha1
, one
->sha1
))
898 if (a
->mode
== b
->mode
|| a
->mode
== one
->mode
)
899 result
.mode
= b
->mode
;
901 result
.mode
= a
->mode
;
902 if (b
->mode
!= one
->mode
) {
908 if (sha_eq(a
->sha1
, b
->sha1
) || sha_eq(a
->sha1
, one
->sha1
))
909 hashcpy(result
.sha
, b
->sha1
);
910 else if (sha_eq(b
->sha1
, one
->sha1
))
911 hashcpy(result
.sha
, a
->sha1
);
912 else if (S_ISREG(a
->mode
)) {
913 mmbuffer_t result_buf
;
916 merge_status
= merge_3way(o
, &result_buf
, one
, a
, b
,
919 if ((merge_status
< 0) || !result_buf
.ptr
)
920 die("Failed to execute internal merge");
922 if (write_sha1_file(result_buf
.ptr
, result_buf
.size
,
923 blob_type
, result
.sha
))
924 die("Unable to add %s to database",
927 free(result_buf
.ptr
);
928 result
.clean
= (merge_status
== 0);
929 } else if (S_ISGITLINK(a
->mode
)) {
930 result
.clean
= merge_submodule(result
.sha
, one
->path
, one
->sha1
,
932 } else if (S_ISLNK(a
->mode
)) {
933 hashcpy(result
.sha
, a
->sha1
);
935 if (!sha_eq(a
->sha1
, b
->sha1
))
938 die("unsupported object type in the tree");
945 static struct merge_file_info
946 merge_file_special_markers(struct merge_options
*o
,
947 const struct diff_filespec
*one
,
948 const struct diff_filespec
*a
,
949 const struct diff_filespec
*b
,
951 const char *filename1
,
953 const char *filename2
)
957 struct merge_file_info mfi
;
960 side1
= xmalloc(strlen(branch1
) + strlen(filename1
) + 2);
961 sprintf(side1
, "%s:%s", branch1
, filename1
);
964 side2
= xmalloc(strlen(branch2
) + strlen(filename2
) + 2);
965 sprintf(side2
, "%s:%s", branch2
, filename2
);
968 mfi
= merge_file_1(o
, one
, a
, b
,
969 side1
? side1
: branch1
, side2
? side2
: branch2
);
975 static struct merge_file_info
merge_file(struct merge_options
*o
,
977 const unsigned char *o_sha
, int o_mode
,
978 const unsigned char *a_sha
, int a_mode
,
979 const unsigned char *b_sha
, int b_mode
,
983 struct diff_filespec one
, a
, b
;
985 one
.path
= a
.path
= b
.path
= (char *)path
;
986 hashcpy(one
.sha1
, o_sha
);
988 hashcpy(a
.sha1
, a_sha
);
990 hashcpy(b
.sha1
, b_sha
);
992 return merge_file_1(o
, &one
, &a
, &b
, branch1
, branch2
);
995 static void handle_change_delete(struct merge_options
*o
,
997 const unsigned char *o_sha
, int o_mode
,
998 const unsigned char *a_sha
, int a_mode
,
999 const unsigned char *b_sha
, int b_mode
,
1000 const char *change
, const char *change_past
)
1002 char *renamed
= NULL
;
1003 if (dir_in_way(path
, !o
->call_depth
)) {
1004 renamed
= unique_path(o
, path
, a_sha
? o
->branch1
: o
->branch2
);
1007 if (o
->call_depth
) {
1009 * We cannot arbitrarily accept either a_sha or b_sha as
1010 * correct; since there is no true "middle point" between
1011 * them, simply reuse the base version for virtual merge base.
1013 remove_file_from_cache(path
);
1014 update_file(o
, 0, o_sha
, o_mode
, renamed
? renamed
: path
);
1015 } else if (!a_sha
) {
1016 output(o
, 1, "CONFLICT (%s/delete): %s deleted in %s "
1017 "and %s in %s. Version %s of %s left in tree%s%s.",
1018 change
, path
, o
->branch1
,
1019 change_past
, o
->branch2
, o
->branch2
, path
,
1020 NULL
== renamed
? "" : " at ",
1021 NULL
== renamed
? "" : renamed
);
1022 update_file(o
, 0, b_sha
, b_mode
, renamed
? renamed
: path
);
1024 output(o
, 1, "CONFLICT (%s/delete): %s deleted in %s "
1025 "and %s in %s. Version %s of %s left in tree%s%s.",
1026 change
, path
, o
->branch2
,
1027 change_past
, o
->branch1
, o
->branch1
, path
,
1028 NULL
== renamed
? "" : " at ",
1029 NULL
== renamed
? "" : renamed
);
1030 update_file(o
, 0, a_sha
, a_mode
, renamed
? renamed
: path
);
1035 static void conflict_rename_delete(struct merge_options
*o
,
1036 struct diff_filepair
*pair
,
1037 const char *rename_branch
,
1038 const char *other_branch
)
1040 const struct diff_filespec
*orig
= pair
->one
;
1041 const struct diff_filespec
*dest
= pair
->two
;
1043 const unsigned char *a_sha
= NULL
;
1044 const unsigned char *b_sha
= NULL
;
1048 if (rename_branch
== o
->branch1
) {
1050 a_mode
= dest
->mode
;
1053 b_mode
= dest
->mode
;
1056 if (o
->call_depth
) {
1057 remove_file_from_cache(dest
->path
);
1061 update_stages(dest
->path
, NULL
,
1062 rename_branch
== o
->branch1
? dest
: NULL
,
1063 rename_branch
== o
->branch1
? NULL
: dest
);
1066 handle_change_delete(o
,
1068 orig
->sha1
, orig
->mode
,
1071 "rename", "renamed");
1074 static struct diff_filespec
*filespec_from_entry(struct diff_filespec
*target
,
1075 struct stage_data
*entry
,
1078 unsigned char *sha
= entry
->stages
[stage
].sha
;
1079 unsigned mode
= entry
->stages
[stage
].mode
;
1080 if (mode
== 0 || is_null_sha1(sha
))
1082 hashcpy(target
->sha1
, sha
);
1083 target
->mode
= mode
;
1087 static void handle_file(struct merge_options
*o
,
1088 struct diff_filespec
*rename
,
1090 struct rename_conflict_info
*ci
)
1092 char *dst_name
= rename
->path
;
1093 struct stage_data
*dst_entry
;
1094 const char *cur_branch
, *other_branch
;
1095 struct diff_filespec other
;
1096 struct diff_filespec
*add
;
1099 dst_entry
= ci
->dst_entry1
;
1100 cur_branch
= ci
->branch1
;
1101 other_branch
= ci
->branch2
;
1103 dst_entry
= ci
->dst_entry2
;
1104 cur_branch
= ci
->branch2
;
1105 other_branch
= ci
->branch1
;
1108 add
= filespec_from_entry(&other
, dst_entry
, stage
^ 1);
1110 update_stages(rename
->path
, NULL
, rename
, add
);
1112 update_stages(rename
->path
, NULL
, add
, rename
);
1115 char *add_name
= unique_path(o
, rename
->path
, other_branch
);
1116 update_file(o
, 0, add
->sha1
, add
->mode
, add_name
);
1118 remove_file(o
, 0, rename
->path
, 0);
1119 dst_name
= unique_path(o
, rename
->path
, cur_branch
);
1121 if (dir_in_way(rename
->path
, !o
->call_depth
)) {
1122 dst_name
= unique_path(o
, rename
->path
, cur_branch
);
1123 output(o
, 1, "%s is a directory in %s adding as %s instead",
1124 rename
->path
, other_branch
, dst_name
);
1127 update_file(o
, 0, rename
->sha1
, rename
->mode
, dst_name
);
1129 if (dst_name
!= rename
->path
)
1133 static void conflict_rename_rename_1to2(struct merge_options
*o
,
1134 struct rename_conflict_info
*ci
)
1136 /* One file was renamed in both branches, but to different names. */
1137 struct diff_filespec
*one
= ci
->pair1
->one
;
1138 struct diff_filespec
*a
= ci
->pair1
->two
;
1139 struct diff_filespec
*b
= ci
->pair2
->two
;
1141 output(o
, 1, "CONFLICT (rename/rename): "
1142 "Rename \"%s\"->\"%s\" in branch \"%s\" "
1143 "rename \"%s\"->\"%s\" in \"%s\"%s",
1144 one
->path
, a
->path
, ci
->branch1
,
1145 one
->path
, b
->path
, ci
->branch2
,
1146 o
->call_depth
? " (left unresolved)" : "");
1147 if (o
->call_depth
) {
1148 struct merge_file_info mfi
;
1149 mfi
= merge_file(o
, one
->path
,
1150 one
->sha1
, one
->mode
,
1153 ci
->branch1
, ci
->branch2
);
1155 * FIXME: For rename/add-source conflicts (if we could detect
1156 * such), this is wrong. We should instead find a unique
1157 * pathname and then either rename the add-source file to that
1158 * unique path, or use that unique path instead of src here.
1160 update_file(o
, 0, mfi
.sha
, mfi
.mode
, one
->path
);
1161 remove_file_from_cache(a
->path
);
1162 remove_file_from_cache(b
->path
);
1164 handle_file(o
, a
, 2, ci
);
1165 handle_file(o
, b
, 3, ci
);
1169 static void conflict_rename_rename_2to1(struct merge_options
*o
,
1170 struct rename_conflict_info
*ci
)
1172 /* Two files, a & b, were renamed to the same thing, c. */
1173 struct diff_filespec
*a
= ci
->pair1
->one
;
1174 struct diff_filespec
*b
= ci
->pair2
->one
;
1175 struct diff_filespec
*c1
= ci
->pair1
->two
;
1176 struct diff_filespec
*c2
= ci
->pair2
->two
;
1177 char *path
= c1
->path
; /* == c2->path */
1178 struct merge_file_info mfi_c1
;
1179 struct merge_file_info mfi_c2
;
1181 output(o
, 1, "CONFLICT (rename/rename): "
1182 "Rename %s->%s in %s. "
1183 "Rename %s->%s in %s",
1184 a
->path
, c1
->path
, ci
->branch1
,
1185 b
->path
, c2
->path
, ci
->branch2
);
1187 remove_file(o
, 1, a
->path
, would_lose_untracked(a
->path
));
1188 remove_file(o
, 1, b
->path
, would_lose_untracked(b
->path
));
1190 mfi_c1
= merge_file_special_markers(o
, a
, c1
, &ci
->ren1_other
,
1191 o
->branch1
, c1
->path
,
1192 o
->branch2
, ci
->ren1_other
.path
);
1193 mfi_c2
= merge_file_special_markers(o
, b
, &ci
->ren2_other
, c2
,
1194 o
->branch1
, ci
->ren2_other
.path
,
1195 o
->branch2
, c2
->path
);
1197 if (o
->call_depth
) {
1199 * If mfi_c1.clean && mfi_c2.clean, then it might make
1200 * sense to do a two-way merge of those results. But, I
1201 * think in all cases, it makes sense to have the virtual
1202 * merge base just undo the renames; they can be detected
1203 * again later for the non-recursive merge.
1205 remove_file(o
, 0, path
, 0);
1206 update_file(o
, 0, mfi_c1
.sha
, mfi_c1
.mode
, a
->path
);
1207 update_file(o
, 0, mfi_c2
.sha
, mfi_c2
.mode
, b
->path
);
1209 char *new_path1
= unique_path(o
, path
, ci
->branch1
);
1210 char *new_path2
= unique_path(o
, path
, ci
->branch2
);
1211 output(o
, 1, "Renaming %s to %s and %s to %s instead",
1212 a
->path
, new_path1
, b
->path
, new_path2
);
1213 remove_file(o
, 0, path
, 0);
1214 update_file(o
, 0, mfi_c1
.sha
, mfi_c1
.mode
, new_path1
);
1215 update_file(o
, 0, mfi_c2
.sha
, mfi_c2
.mode
, new_path2
);
1221 static int process_renames(struct merge_options
*o
,
1222 struct string_list
*a_renames
,
1223 struct string_list
*b_renames
)
1225 int clean_merge
= 1, i
, j
;
1226 struct string_list a_by_dst
= STRING_LIST_INIT_NODUP
;
1227 struct string_list b_by_dst
= STRING_LIST_INIT_NODUP
;
1228 const struct rename
*sre
;
1230 for (i
= 0; i
< a_renames
->nr
; i
++) {
1231 sre
= a_renames
->items
[i
].util
;
1232 string_list_insert(&a_by_dst
, sre
->pair
->two
->path
)->util
1235 for (i
= 0; i
< b_renames
->nr
; i
++) {
1236 sre
= b_renames
->items
[i
].util
;
1237 string_list_insert(&b_by_dst
, sre
->pair
->two
->path
)->util
1241 for (i
= 0, j
= 0; i
< a_renames
->nr
|| j
< b_renames
->nr
;) {
1242 struct string_list
*renames1
, *renames2Dst
;
1243 struct rename
*ren1
= NULL
, *ren2
= NULL
;
1244 const char *branch1
, *branch2
;
1245 const char *ren1_src
, *ren1_dst
;
1246 struct string_list_item
*lookup
;
1248 if (i
>= a_renames
->nr
) {
1249 ren2
= b_renames
->items
[j
++].util
;
1250 } else if (j
>= b_renames
->nr
) {
1251 ren1
= a_renames
->items
[i
++].util
;
1253 int compare
= strcmp(a_renames
->items
[i
].string
,
1254 b_renames
->items
[j
].string
);
1256 ren1
= a_renames
->items
[i
++].util
;
1258 ren2
= b_renames
->items
[j
++].util
;
1261 /* TODO: refactor, so that 1/2 are not needed */
1263 renames1
= a_renames
;
1264 renames2Dst
= &b_by_dst
;
1265 branch1
= o
->branch1
;
1266 branch2
= o
->branch2
;
1269 renames1
= b_renames
;
1270 renames2Dst
= &a_by_dst
;
1271 branch1
= o
->branch2
;
1272 branch2
= o
->branch1
;
1278 if (ren1
->processed
)
1280 ren1
->processed
= 1;
1281 ren1
->dst_entry
->processed
= 1;
1282 /* BUG: We should only mark src_entry as processed if we
1283 * are not dealing with a rename + add-source case.
1285 ren1
->src_entry
->processed
= 1;
1287 ren1_src
= ren1
->pair
->one
->path
;
1288 ren1_dst
= ren1
->pair
->two
->path
;
1291 /* One file renamed on both sides */
1292 const char *ren2_src
= ren2
->pair
->one
->path
;
1293 const char *ren2_dst
= ren2
->pair
->two
->path
;
1294 enum rename_type rename_type
;
1295 if (strcmp(ren1_src
, ren2_src
) != 0)
1296 die("ren1_src != ren2_src");
1297 ren2
->dst_entry
->processed
= 1;
1298 ren2
->processed
= 1;
1299 if (strcmp(ren1_dst
, ren2_dst
) != 0) {
1300 rename_type
= RENAME_ONE_FILE_TO_TWO
;
1303 rename_type
= RENAME_ONE_FILE_TO_ONE
;
1304 /* BUG: We should only remove ren1_src in
1305 * the base stage (think of rename +
1306 * add-source cases).
1308 remove_file(o
, 1, ren1_src
, 1);
1309 update_entry(ren1
->dst_entry
,
1314 setup_rename_conflict_info(rename_type
,
1324 } else if ((lookup
= string_list_lookup(renames2Dst
, ren1_dst
))) {
1325 /* Two different files renamed to the same thing */
1327 ren2
= lookup
->util
;
1328 ren2_dst
= ren2
->pair
->two
->path
;
1329 if (strcmp(ren1_dst
, ren2_dst
) != 0)
1330 die("ren1_dst != ren2_dst");
1333 ren2
->processed
= 1;
1335 * BUG: We should only mark src_entry as processed
1336 * if we are not dealing with a rename + add-source
1339 ren2
->src_entry
->processed
= 1;
1341 setup_rename_conflict_info(RENAME_TWO_FILES_TO_ONE
,
1353 /* Renamed in 1, maybe changed in 2 */
1354 /* we only use sha1 and mode of these */
1355 struct diff_filespec src_other
, dst_other
;
1359 * unpack_trees loads entries from common-commit
1360 * into stage 1, from head-commit into stage 2, and
1361 * from merge-commit into stage 3. We keep track
1362 * of which side corresponds to the rename.
1364 int renamed_stage
= a_renames
== renames1
? 2 : 3;
1365 int other_stage
= a_renames
== renames1
? 3 : 2;
1367 /* BUG: We should only remove ren1_src in the base
1368 * stage and in other_stage (think of rename +
1371 remove_file(o
, 1, ren1_src
,
1372 renamed_stage
== 2 || !was_tracked(ren1_src
));
1374 hashcpy(src_other
.sha1
, ren1
->src_entry
->stages
[other_stage
].sha
);
1375 src_other
.mode
= ren1
->src_entry
->stages
[other_stage
].mode
;
1376 hashcpy(dst_other
.sha1
, ren1
->dst_entry
->stages
[other_stage
].sha
);
1377 dst_other
.mode
= ren1
->dst_entry
->stages
[other_stage
].mode
;
1380 if (sha_eq(src_other
.sha1
, null_sha1
)) {
1381 setup_rename_conflict_info(RENAME_DELETE
,
1391 } else if ((dst_other
.mode
== ren1
->pair
->two
->mode
) &&
1392 sha_eq(dst_other
.sha1
, ren1
->pair
->two
->sha1
)) {
1393 /* Added file on the other side
1394 identical to the file being
1395 renamed: clean merge */
1396 update_file(o
, 1, ren1
->pair
->two
->sha1
, ren1
->pair
->two
->mode
, ren1_dst
);
1397 } else if (!sha_eq(dst_other
.sha1
, null_sha1
)) {
1400 output(o
, 1, "CONFLICT (rename/add): Rename %s->%s in %s. "
1402 ren1_src
, ren1_dst
, branch1
,
1404 if (o
->call_depth
) {
1405 struct merge_file_info mfi
;
1406 mfi
= merge_file(o
, ren1_dst
, null_sha1
, 0,
1407 ren1
->pair
->two
->sha1
, ren1
->pair
->two
->mode
,
1408 dst_other
.sha1
, dst_other
.mode
,
1410 output(o
, 1, "Adding merged %s", ren1_dst
);
1411 update_file(o
, 0, mfi
.sha
, mfi
.mode
, ren1_dst
);
1414 char *new_path
= unique_path(o
, ren1_dst
, branch2
);
1415 output(o
, 1, "Adding as %s instead", new_path
);
1416 update_file(o
, 0, dst_other
.sha1
, dst_other
.mode
, new_path
);
1423 struct diff_filespec
*one
, *a
, *b
;
1424 src_other
.path
= (char *)ren1_src
;
1426 one
= ren1
->pair
->one
;
1427 if (a_renames
== renames1
) {
1428 a
= ren1
->pair
->two
;
1431 b
= ren1
->pair
->two
;
1434 update_entry(ren1
->dst_entry
, one
, a
, b
);
1435 setup_rename_conflict_info(RENAME_NORMAL
,
1448 string_list_clear(&a_by_dst
, 0);
1449 string_list_clear(&b_by_dst
, 0);
1454 static unsigned char *stage_sha(const unsigned char *sha
, unsigned mode
)
1456 return (is_null_sha1(sha
) || mode
== 0) ? NULL
: (unsigned char *)sha
;
1459 static int read_sha1_strbuf(const unsigned char *sha1
, struct strbuf
*dst
)
1462 enum object_type type
;
1464 buf
= read_sha1_file(sha1
, &type
, &size
);
1466 return error("cannot read object %s", sha1_to_hex(sha1
));
1467 if (type
!= OBJ_BLOB
) {
1469 return error("object %s is not a blob", sha1_to_hex(sha1
));
1471 strbuf_attach(dst
, buf
, size
, size
+ 1);
1475 static int blob_unchanged(const unsigned char *o_sha
,
1476 const unsigned char *a_sha
,
1477 int renormalize
, const char *path
)
1479 struct strbuf o
= STRBUF_INIT
;
1480 struct strbuf a
= STRBUF_INIT
;
1481 int ret
= 0; /* assume changed for safety */
1483 if (sha_eq(o_sha
, a_sha
))
1488 assert(o_sha
&& a_sha
);
1489 if (read_sha1_strbuf(o_sha
, &o
) || read_sha1_strbuf(a_sha
, &a
))
1492 * Note: binary | is used so that both renormalizations are
1493 * performed. Comparison can be skipped if both files are
1494 * unchanged since their sha1s have already been compared.
1496 if (renormalize_buffer(path
, o
.buf
, o
.len
, &o
) |
1497 renormalize_buffer(path
, a
.buf
, o
.len
, &a
))
1498 ret
= (o
.len
== a
.len
&& !memcmp(o
.buf
, a
.buf
, o
.len
));
1506 static void handle_modify_delete(struct merge_options
*o
,
1508 unsigned char *o_sha
, int o_mode
,
1509 unsigned char *a_sha
, int a_mode
,
1510 unsigned char *b_sha
, int b_mode
)
1512 handle_change_delete(o
,
1517 "modify", "modified");
1520 static int merge_content(struct merge_options
*o
,
1522 unsigned char *o_sha
, int o_mode
,
1523 unsigned char *a_sha
, int a_mode
,
1524 unsigned char *b_sha
, int b_mode
,
1525 struct rename_conflict_info
*rename_conflict_info
)
1527 const char *reason
= "content";
1528 const char *path1
= NULL
, *path2
= NULL
;
1529 struct merge_file_info mfi
;
1530 struct diff_filespec one
, a
, b
;
1531 unsigned df_conflict_remains
= 0;
1535 o_sha
= (unsigned char *)null_sha1
;
1537 one
.path
= a
.path
= b
.path
= (char *)path
;
1538 hashcpy(one
.sha1
, o_sha
);
1540 hashcpy(a
.sha1
, a_sha
);
1542 hashcpy(b
.sha1
, b_sha
);
1545 if (rename_conflict_info
) {
1546 struct diff_filepair
*pair1
= rename_conflict_info
->pair1
;
1548 path1
= (o
->branch1
== rename_conflict_info
->branch1
) ?
1549 pair1
->two
->path
: pair1
->one
->path
;
1550 /* If rename_conflict_info->pair2 != NULL, we are in
1551 * RENAME_ONE_FILE_TO_ONE case. Otherwise, we have a
1554 path2
= (rename_conflict_info
->pair2
||
1555 o
->branch2
== rename_conflict_info
->branch1
) ?
1556 pair1
->two
->path
: pair1
->one
->path
;
1558 if (dir_in_way(path
, !o
->call_depth
))
1559 df_conflict_remains
= 1;
1561 mfi
= merge_file_special_markers(o
, &one
, &a
, &b
,
1565 if (mfi
.clean
&& !df_conflict_remains
&&
1566 sha_eq(mfi
.sha
, a_sha
) && mfi
.mode
== a_mode
) {
1567 int path_renamed_outside_HEAD
;
1568 output(o
, 3, "Skipped %s (merged same as existing)", path
);
1570 * The content merge resulted in the same file contents we
1571 * already had. We can return early if those file contents
1572 * are recorded at the correct path (which may not be true
1573 * if the merge involves a rename).
1575 path_renamed_outside_HEAD
= !path2
|| !strcmp(path
, path2
);
1576 if (!path_renamed_outside_HEAD
) {
1577 add_cacheinfo(mfi
.mode
, mfi
.sha
, path
,
1578 0 /*stage*/, 1 /*refresh*/, 0 /*options*/);
1582 output(o
, 2, "Auto-merging %s", path
);
1585 if (S_ISGITLINK(mfi
.mode
))
1586 reason
= "submodule";
1587 output(o
, 1, "CONFLICT (%s): Merge conflict in %s",
1589 if (rename_conflict_info
&& !df_conflict_remains
)
1590 update_stages(path
, &one
, &a
, &b
);
1593 if (df_conflict_remains
) {
1595 if (o
->call_depth
) {
1596 remove_file_from_cache(path
);
1599 update_stages(path
, &one
, &a
, &b
);
1601 int file_from_stage2
= was_tracked(path
);
1602 struct diff_filespec merged
;
1603 hashcpy(merged
.sha1
, mfi
.sha
);
1604 merged
.mode
= mfi
.mode
;
1606 update_stages(path
, NULL
,
1607 file_from_stage2
? &merged
: NULL
,
1608 file_from_stage2
? NULL
: &merged
);
1612 new_path
= unique_path(o
, path
, rename_conflict_info
->branch1
);
1613 output(o
, 1, "Adding as %s instead", new_path
);
1614 update_file(o
, 0, mfi
.sha
, mfi
.mode
, new_path
);
1618 update_file(o
, mfi
.clean
, mfi
.sha
, mfi
.mode
, path
);
1624 /* Per entry merge function */
1625 static int process_entry(struct merge_options
*o
,
1626 const char *path
, struct stage_data
*entry
)
1629 printf("processing entry, clean cache: %s\n", index_only ? "yes": "no");
1630 print_index_entry("\tpath: ", entry);
1632 int clean_merge
= 1;
1633 int normalize
= o
->renormalize
;
1634 unsigned o_mode
= entry
->stages
[1].mode
;
1635 unsigned a_mode
= entry
->stages
[2].mode
;
1636 unsigned b_mode
= entry
->stages
[3].mode
;
1637 unsigned char *o_sha
= stage_sha(entry
->stages
[1].sha
, o_mode
);
1638 unsigned char *a_sha
= stage_sha(entry
->stages
[2].sha
, a_mode
);
1639 unsigned char *b_sha
= stage_sha(entry
->stages
[3].sha
, b_mode
);
1641 entry
->processed
= 1;
1642 if (entry
->rename_conflict_info
) {
1643 struct rename_conflict_info
*conflict_info
= entry
->rename_conflict_info
;
1644 switch (conflict_info
->rename_type
) {
1646 case RENAME_ONE_FILE_TO_ONE
:
1647 clean_merge
= merge_content(o
, path
,
1648 o_sha
, o_mode
, a_sha
, a_mode
, b_sha
, b_mode
,
1653 conflict_rename_delete(o
, conflict_info
->pair1
,
1654 conflict_info
->branch1
,
1655 conflict_info
->branch2
);
1657 case RENAME_ONE_FILE_TO_TWO
:
1659 conflict_rename_rename_1to2(o
, conflict_info
);
1661 case RENAME_TWO_FILES_TO_ONE
:
1663 conflict_rename_rename_2to1(o
, conflict_info
);
1666 entry
->processed
= 0;
1669 } else if (o_sha
&& (!a_sha
|| !b_sha
)) {
1670 /* Case A: Deleted in one */
1671 if ((!a_sha
&& !b_sha
) ||
1672 (!b_sha
&& blob_unchanged(o_sha
, a_sha
, normalize
, path
)) ||
1673 (!a_sha
&& blob_unchanged(o_sha
, b_sha
, normalize
, path
))) {
1674 /* Deleted in both or deleted in one and
1675 * unchanged in the other */
1677 output(o
, 2, "Removing %s", path
);
1678 /* do not touch working file if it did not exist */
1679 remove_file(o
, 1, path
, !a_sha
);
1681 /* Modify/delete; deleted side may have put a directory in the way */
1683 handle_modify_delete(o
, path
, o_sha
, o_mode
,
1684 a_sha
, a_mode
, b_sha
, b_mode
);
1686 } else if ((!o_sha
&& a_sha
&& !b_sha
) ||
1687 (!o_sha
&& !a_sha
&& b_sha
)) {
1688 /* Case B: Added in one. */
1689 /* [nothing|directory] -> ([nothing|directory], file) */
1691 const char *add_branch
;
1692 const char *other_branch
;
1694 const unsigned char *sha
;
1698 add_branch
= o
->branch1
;
1699 other_branch
= o
->branch2
;
1702 conf
= "file/directory";
1704 add_branch
= o
->branch2
;
1705 other_branch
= o
->branch1
;
1708 conf
= "directory/file";
1710 if (dir_in_way(path
, !o
->call_depth
)) {
1711 char *new_path
= unique_path(o
, path
, add_branch
);
1713 output(o
, 1, "CONFLICT (%s): There is a directory with name %s in %s. "
1715 conf
, path
, other_branch
, path
, new_path
);
1717 remove_file_from_cache(path
);
1718 update_file(o
, 0, sha
, mode
, new_path
);
1720 remove_file_from_cache(path
);
1723 output(o
, 2, "Adding %s", path
);
1724 update_file(o
, 1, sha
, mode
, path
);
1726 } else if (a_sha
&& b_sha
) {
1727 /* Case C: Added in both (check for same permissions) and */
1728 /* case D: Modified in both, but differently. */
1729 clean_merge
= merge_content(o
, path
,
1730 o_sha
, o_mode
, a_sha
, a_mode
, b_sha
, b_mode
,
1732 } else if (!o_sha
&& !a_sha
&& !b_sha
) {
1734 * this entry was deleted altogether. a_mode == 0 means
1735 * we had that path and want to actively remove it.
1737 remove_file(o
, 1, path
, !a_mode
);
1739 die("Fatal merge failure, shouldn't happen.");
1744 int merge_trees(struct merge_options
*o
,
1747 struct tree
*common
,
1748 struct tree
**result
)
1752 if (o
->subtree_shift
) {
1753 merge
= shift_tree_object(head
, merge
, o
->subtree_shift
);
1754 common
= shift_tree_object(head
, common
, o
->subtree_shift
);
1757 if (sha_eq(common
->object
.sha1
, merge
->object
.sha1
)) {
1758 output(o
, 0, "Already up-to-date!");
1763 code
= git_merge_trees(o
->call_depth
, common
, head
, merge
);
1766 if (show(o
, 4) || o
->call_depth
)
1767 die("merging of trees %s and %s failed",
1768 sha1_to_hex(head
->object
.sha1
),
1769 sha1_to_hex(merge
->object
.sha1
));
1774 if (unmerged_cache()) {
1775 struct string_list
*entries
, *re_head
, *re_merge
;
1777 string_list_clear(&o
->current_file_set
, 1);
1778 string_list_clear(&o
->current_directory_set
, 1);
1779 get_files_dirs(o
, head
);
1780 get_files_dirs(o
, merge
);
1782 entries
= get_unmerged();
1783 record_df_conflict_files(o
, entries
);
1784 re_head
= get_renames(o
, head
, common
, head
, merge
, entries
);
1785 re_merge
= get_renames(o
, merge
, common
, head
, merge
, entries
);
1786 clean
= process_renames(o
, re_head
, re_merge
);
1787 for (i
= entries
->nr
-1; 0 <= i
; i
--) {
1788 const char *path
= entries
->items
[i
].string
;
1789 struct stage_data
*e
= entries
->items
[i
].util
;
1791 && !process_entry(o
, path
, e
))
1794 for (i
= 0; i
< entries
->nr
; i
++) {
1795 struct stage_data
*e
= entries
->items
[i
].util
;
1797 die("Unprocessed path??? %s",
1798 entries
->items
[i
].string
);
1801 string_list_clear(re_merge
, 0);
1802 string_list_clear(re_head
, 0);
1803 string_list_clear(entries
, 1);
1810 *result
= write_tree_from_memory(o
);
1815 static struct commit_list
*reverse_commit_list(struct commit_list
*list
)
1817 struct commit_list
*next
= NULL
, *current
, *backup
;
1818 for (current
= list
; current
; current
= backup
) {
1819 backup
= current
->next
;
1820 current
->next
= next
;
1827 * Merge the commits h1 and h2, return the resulting virtual
1828 * commit object and a flag indicating the cleanness of the merge.
1830 int merge_recursive(struct merge_options
*o
,
1833 struct commit_list
*ca
,
1834 struct commit
**result
)
1836 struct commit_list
*iter
;
1837 struct commit
*merged_common_ancestors
;
1838 struct tree
*mrtree
= mrtree
;
1842 output(o
, 4, "Merging:");
1843 output_commit_title(o
, h1
);
1844 output_commit_title(o
, h2
);
1848 ca
= get_merge_bases(h1
, h2
, 1);
1849 ca
= reverse_commit_list(ca
);
1853 output(o
, 5, "found %u common ancestor(s):", commit_list_count(ca
));
1854 for (iter
= ca
; iter
; iter
= iter
->next
)
1855 output_commit_title(o
, iter
->item
);
1858 merged_common_ancestors
= pop_commit(&ca
);
1859 if (merged_common_ancestors
== NULL
) {
1860 /* if there is no common ancestor, make an empty tree */
1861 struct tree
*tree
= xcalloc(1, sizeof(struct tree
));
1863 tree
->object
.parsed
= 1;
1864 tree
->object
.type
= OBJ_TREE
;
1865 pretend_sha1_file(NULL
, 0, OBJ_TREE
, tree
->object
.sha1
);
1866 merged_common_ancestors
= make_virtual_commit(tree
, "ancestor");
1869 for (iter
= ca
; iter
; iter
= iter
->next
) {
1870 const char *saved_b1
, *saved_b2
;
1873 * When the merge fails, the result contains files
1874 * with conflict markers. The cleanness flag is
1875 * ignored, it was never actually used, as result of
1876 * merge_trees has always overwritten it: the committed
1877 * "conflicts" were already resolved.
1880 saved_b1
= o
->branch1
;
1881 saved_b2
= o
->branch2
;
1882 o
->branch1
= "Temporary merge branch 1";
1883 o
->branch2
= "Temporary merge branch 2";
1884 merge_recursive(o
, merged_common_ancestors
, iter
->item
,
1885 NULL
, &merged_common_ancestors
);
1886 o
->branch1
= saved_b1
;
1887 o
->branch2
= saved_b2
;
1890 if (!merged_common_ancestors
)
1891 die("merge returned no commit");
1898 o
->ancestor
= "merged common ancestors";
1899 clean
= merge_trees(o
, h1
->tree
, h2
->tree
, merged_common_ancestors
->tree
,
1902 if (o
->call_depth
) {
1903 *result
= make_virtual_commit(mrtree
, "merged tree");
1904 commit_list_insert(h1
, &(*result
)->parents
);
1905 commit_list_insert(h2
, &(*result
)->parents
->next
);
1909 diff_warn_rename_limit("merge.renamelimit",
1910 o
->needed_rename_limit
, 0);
1914 static struct commit
*get_ref(const unsigned char *sha1
, const char *name
)
1916 struct object
*object
;
1918 object
= deref_tag(parse_object(sha1
), name
, strlen(name
));
1921 if (object
->type
== OBJ_TREE
)
1922 return make_virtual_commit((struct tree
*)object
, name
);
1923 if (object
->type
!= OBJ_COMMIT
)
1925 if (parse_commit((struct commit
*)object
))
1927 return (struct commit
*)object
;
1930 int merge_recursive_generic(struct merge_options
*o
,
1931 const unsigned char *head
,
1932 const unsigned char *merge
,
1934 const unsigned char **base_list
,
1935 struct commit
**result
)
1937 int clean
, index_fd
;
1938 struct lock_file
*lock
= xcalloc(1, sizeof(struct lock_file
));
1939 struct commit
*head_commit
= get_ref(head
, o
->branch1
);
1940 struct commit
*next_commit
= get_ref(merge
, o
->branch2
);
1941 struct commit_list
*ca
= NULL
;
1945 for (i
= 0; i
< num_base_list
; ++i
) {
1946 struct commit
*base
;
1947 if (!(base
= get_ref(base_list
[i
], sha1_to_hex(base_list
[i
]))))
1948 return error("Could not parse object '%s'",
1949 sha1_to_hex(base_list
[i
]));
1950 commit_list_insert(base
, &ca
);
1954 index_fd
= hold_locked_index(lock
, 1);
1955 clean
= merge_recursive(o
, head_commit
, next_commit
, ca
,
1957 if (active_cache_changed
&&
1958 (write_cache(index_fd
, active_cache
, active_nr
) ||
1959 commit_locked_index(lock
)))
1960 return error("Unable to write index.");
1962 return clean
? 0 : 1;
1965 static int merge_recursive_config(const char *var
, const char *value
, void *cb
)
1967 struct merge_options
*o
= cb
;
1968 if (!strcmp(var
, "merge.verbosity")) {
1969 o
->verbosity
= git_config_int(var
, value
);
1972 if (!strcmp(var
, "diff.renamelimit")) {
1973 o
->diff_rename_limit
= git_config_int(var
, value
);
1976 if (!strcmp(var
, "merge.renamelimit")) {
1977 o
->merge_rename_limit
= git_config_int(var
, value
);
1980 return git_xmerge_config(var
, value
, cb
);
1983 void init_merge_options(struct merge_options
*o
)
1985 memset(o
, 0, sizeof(struct merge_options
));
1987 o
->buffer_output
= 1;
1988 o
->diff_rename_limit
= -1;
1989 o
->merge_rename_limit
= -1;
1991 git_config(merge_recursive_config
, o
);
1992 if (getenv("GIT_MERGE_VERBOSITY"))
1994 strtol(getenv("GIT_MERGE_VERBOSITY"), NULL
, 10);
1995 if (o
->verbosity
>= 5)
1996 o
->buffer_output
= 0;
1997 strbuf_init(&o
->obuf
, 0);
1998 memset(&o
->current_file_set
, 0, sizeof(struct string_list
));
1999 o
->current_file_set
.strdup_strings
= 1;
2000 memset(&o
->current_directory_set
, 0, sizeof(struct string_list
));
2001 o
->current_directory_set
.strdup_strings
= 1;
2002 memset(&o
->df_conflict_file_set
, 0, sizeof(struct string_list
));
2003 o
->df_conflict_file_set
.strdup_strings
= 1;
2006 int parse_merge_opt(struct merge_options
*o
, const char *s
)
2010 if (!strcmp(s
, "ours"))
2011 o
->recursive_variant
= MERGE_RECURSIVE_OURS
;
2012 else if (!strcmp(s
, "theirs"))
2013 o
->recursive_variant
= MERGE_RECURSIVE_THEIRS
;
2014 else if (!strcmp(s
, "subtree"))
2015 o
->subtree_shift
= "";
2016 else if (!prefixcmp(s
, "subtree="))
2017 o
->subtree_shift
= s
+ strlen("subtree=");
2018 else if (!strcmp(s
, "patience"))
2019 o
->xdl_opts
|= XDF_PATIENCE_DIFF
;
2020 else if (!strcmp(s
, "ignore-space-change"))
2021 o
->xdl_opts
|= XDF_IGNORE_WHITESPACE_CHANGE
;
2022 else if (!strcmp(s
, "ignore-all-space"))
2023 o
->xdl_opts
|= XDF_IGNORE_WHITESPACE
;
2024 else if (!strcmp(s
, "ignore-space-at-eol"))
2025 o
->xdl_opts
|= XDF_IGNORE_WHITESPACE_AT_EOL
;
2026 else if (!strcmp(s
, "renormalize"))
2028 else if (!strcmp(s
, "no-renormalize"))
2030 else if (!prefixcmp(s
, "rename-threshold=")) {
2031 const char *score
= s
+ strlen("rename-threshold=");
2032 if ((o
->rename_score
= parse_rename_score(&score
)) == -1 || *score
!= 0)