2 * Recursive Merge algorithm stolen from git-merge-recursive.py by
4 * The thieves were Alex Riesen and Johannes Schindelin, in June/July 2006
9 #include "cache-tree.h"
13 #include "tree-walk.h"
17 #include "unpack-trees.h"
18 #include "string-list.h"
19 #include "xdiff-interface.h"
22 #include "merge-recursive.h"
24 #include "submodule.h"
26 static void flush_output(struct merge_options
*o
)
28 if (o
->buffer_output
< 2 && o
->obuf
.len
) {
29 fputs(o
->obuf
.buf
, stdout
);
30 strbuf_reset(&o
->obuf
);
34 static int err(struct merge_options
*o
, const char *err
, ...)
38 if (o
->buffer_output
< 2)
41 strbuf_complete(&o
->obuf
, '\n');
42 strbuf_addstr(&o
->obuf
, "error: ");
44 va_start(params
, err
);
45 strbuf_vaddf(&o
->obuf
, err
, params
);
47 if (o
->buffer_output
> 1)
48 strbuf_addch(&o
->obuf
, '\n');
50 error("%s", o
->obuf
.buf
);
51 strbuf_reset(&o
->obuf
);
57 static struct tree
*shift_tree_object(struct tree
*one
, struct tree
*two
,
58 const char *subtree_shift
)
60 struct object_id shifted
;
62 if (!*subtree_shift
) {
63 shift_tree(&one
->object
.oid
, &two
->object
.oid
, &shifted
, 0);
65 shift_tree_by(&one
->object
.oid
, &two
->object
.oid
, &shifted
,
68 if (!oidcmp(&two
->object
.oid
, &shifted
))
70 return lookup_tree(shifted
.hash
);
73 static struct commit
*make_virtual_commit(struct tree
*tree
, const char *comment
)
75 struct commit
*commit
= alloc_commit_node();
77 set_merge_remote_desc(commit
, comment
, (struct object
*)commit
);
79 commit
->object
.parsed
= 1;
84 * Since we use get_tree_entry(), which does not put the read object into
85 * the object pool, we cannot rely on a == b.
87 static int oid_eq(const struct object_id
*a
, const struct object_id
*b
)
91 return a
&& b
&& oidcmp(a
, b
) == 0;
97 RENAME_ONE_FILE_TO_ONE
,
98 RENAME_ONE_FILE_TO_TWO
,
99 RENAME_TWO_FILES_TO_ONE
102 struct rename_conflict_info
{
103 enum rename_type rename_type
;
104 struct diff_filepair
*pair1
;
105 struct diff_filepair
*pair2
;
108 struct stage_data
*dst_entry1
;
109 struct stage_data
*dst_entry2
;
110 struct diff_filespec ren1_other
;
111 struct diff_filespec ren2_other
;
115 * Since we want to write the index eventually, we cannot reuse the index
116 * for these (temporary) data.
121 struct object_id oid
;
123 struct rename_conflict_info
*rename_conflict_info
;
124 unsigned processed
:1;
127 static inline void setup_rename_conflict_info(enum rename_type rename_type
,
128 struct diff_filepair
*pair1
,
129 struct diff_filepair
*pair2
,
132 struct stage_data
*dst_entry1
,
133 struct stage_data
*dst_entry2
,
134 struct merge_options
*o
,
135 struct stage_data
*src_entry1
,
136 struct stage_data
*src_entry2
)
138 struct rename_conflict_info
*ci
= xcalloc(1, sizeof(struct rename_conflict_info
));
139 ci
->rename_type
= rename_type
;
141 ci
->branch1
= branch1
;
142 ci
->branch2
= branch2
;
144 ci
->dst_entry1
= dst_entry1
;
145 dst_entry1
->rename_conflict_info
= ci
;
146 dst_entry1
->processed
= 0;
148 assert(!pair2
== !dst_entry2
);
150 ci
->dst_entry2
= dst_entry2
;
152 dst_entry2
->rename_conflict_info
= ci
;
155 if (rename_type
== RENAME_TWO_FILES_TO_ONE
) {
157 * For each rename, there could have been
158 * modifications on the side of history where that
159 * file was not renamed.
161 int ostage1
= o
->branch1
== branch1
? 3 : 2;
162 int ostage2
= ostage1
^ 1;
164 ci
->ren1_other
.path
= pair1
->one
->path
;
165 oidcpy(&ci
->ren1_other
.oid
, &src_entry1
->stages
[ostage1
].oid
);
166 ci
->ren1_other
.mode
= src_entry1
->stages
[ostage1
].mode
;
168 ci
->ren2_other
.path
= pair2
->one
->path
;
169 oidcpy(&ci
->ren2_other
.oid
, &src_entry2
->stages
[ostage2
].oid
);
170 ci
->ren2_other
.mode
= src_entry2
->stages
[ostage2
].mode
;
174 static int show(struct merge_options
*o
, int v
)
176 return (!o
->call_depth
&& o
->verbosity
>= v
) || o
->verbosity
>= 5;
179 __attribute__((format (printf
, 3, 4)))
180 static void output(struct merge_options
*o
, int v
, const char *fmt
, ...)
187 strbuf_addchars(&o
->obuf
, ' ', o
->call_depth
* 2);
190 strbuf_vaddf(&o
->obuf
, fmt
, ap
);
193 strbuf_addch(&o
->obuf
, '\n');
194 if (!o
->buffer_output
)
198 static void output_commit_title(struct merge_options
*o
, struct commit
*commit
)
200 strbuf_addchars(&o
->obuf
, ' ', o
->call_depth
* 2);
202 strbuf_addf(&o
->obuf
, "virtual %s\n",
203 merge_remote_util(commit
)->name
);
205 strbuf_add_unique_abbrev(&o
->obuf
, commit
->object
.oid
.hash
,
207 strbuf_addch(&o
->obuf
, ' ');
208 if (parse_commit(commit
) != 0)
209 strbuf_addstr(&o
->obuf
, _("(bad commit)\n"));
212 const char *msg
= get_commit_buffer(commit
, NULL
);
213 int len
= find_commit_subject(msg
, &title
);
215 strbuf_addf(&o
->obuf
, "%.*s\n", len
, title
);
216 unuse_commit_buffer(commit
, msg
);
222 static int add_cacheinfo(struct merge_options
*o
,
223 unsigned int mode
, const struct object_id
*oid
,
224 const char *path
, int stage
, int refresh
, int options
)
226 struct cache_entry
*ce
;
229 ce
= make_cache_entry(mode
, oid
? oid
->hash
: null_sha1
, path
, stage
, 0);
231 return err(o
, _("addinfo_cache failed for path '%s'"), path
);
233 ret
= add_cache_entry(ce
, options
);
235 struct cache_entry
*nce
;
237 nce
= refresh_cache_entry(ce
, CE_MATCH_REFRESH
| CE_MATCH_IGNORE_MISSING
);
239 ret
= add_cache_entry(nce
, options
);
244 static void init_tree_desc_from_tree(struct tree_desc
*desc
, struct tree
*tree
)
247 init_tree_desc(desc
, tree
->buffer
, tree
->size
);
250 static int git_merge_trees(int index_only
,
256 struct tree_desc t
[3];
257 struct unpack_trees_options opts
;
259 memset(&opts
, 0, sizeof(opts
));
266 opts
.fn
= threeway_merge
;
267 opts
.src_index
= &the_index
;
268 opts
.dst_index
= &the_index
;
269 setup_unpack_trees_porcelain(&opts
, "merge");
271 init_tree_desc_from_tree(t
+0, common
);
272 init_tree_desc_from_tree(t
+1, head
);
273 init_tree_desc_from_tree(t
+2, merge
);
275 rc
= unpack_trees(3, t
, &opts
);
276 cache_tree_free(&active_cache_tree
);
280 struct tree
*write_tree_from_memory(struct merge_options
*o
)
282 struct tree
*result
= NULL
;
284 if (unmerged_cache()) {
286 fprintf(stderr
, "BUG: There are unmerged index entries:\n");
287 for (i
= 0; i
< active_nr
; i
++) {
288 const struct cache_entry
*ce
= active_cache
[i
];
290 fprintf(stderr
, "BUG: %d %.*s\n", ce_stage(ce
),
291 (int)ce_namelen(ce
), ce
->name
);
293 die("BUG: unmerged index entries in merge-recursive.c");
296 if (!active_cache_tree
)
297 active_cache_tree
= cache_tree();
299 if (!cache_tree_fully_valid(active_cache_tree
) &&
300 cache_tree_update(&the_index
, 0) < 0) {
301 err(o
, _("error building trees"));
305 result
= lookup_tree(active_cache_tree
->sha1
);
310 static int save_files_dirs(const unsigned char *sha1
,
311 struct strbuf
*base
, const char *path
,
312 unsigned int mode
, int stage
, void *context
)
314 int baselen
= base
->len
;
315 struct merge_options
*o
= context
;
317 strbuf_addstr(base
, path
);
320 string_list_insert(&o
->current_directory_set
, base
->buf
);
322 string_list_insert(&o
->current_file_set
, base
->buf
);
324 strbuf_setlen(base
, baselen
);
325 return (S_ISDIR(mode
) ? READ_TREE_RECURSIVE
: 0);
328 static int get_files_dirs(struct merge_options
*o
, struct tree
*tree
)
331 struct pathspec match_all
;
332 memset(&match_all
, 0, sizeof(match_all
));
333 if (read_tree_recursive(tree
, "", 0, 0, &match_all
, save_files_dirs
, o
))
335 n
= o
->current_file_set
.nr
+ o
->current_directory_set
.nr
;
340 * Returns an index_entry instance which doesn't have to correspond to
341 * a real cache entry in Git's index.
343 static struct stage_data
*insert_stage_data(const char *path
,
344 struct tree
*o
, struct tree
*a
, struct tree
*b
,
345 struct string_list
*entries
)
347 struct string_list_item
*item
;
348 struct stage_data
*e
= xcalloc(1, sizeof(struct stage_data
));
349 get_tree_entry(o
->object
.oid
.hash
, path
,
350 e
->stages
[1].oid
.hash
, &e
->stages
[1].mode
);
351 get_tree_entry(a
->object
.oid
.hash
, path
,
352 e
->stages
[2].oid
.hash
, &e
->stages
[2].mode
);
353 get_tree_entry(b
->object
.oid
.hash
, path
,
354 e
->stages
[3].oid
.hash
, &e
->stages
[3].mode
);
355 item
= string_list_insert(entries
, path
);
361 * Create a dictionary mapping file names to stage_data objects. The
362 * dictionary contains one entry for every path with a non-zero stage entry.
364 static struct string_list
*get_unmerged(void)
366 struct string_list
*unmerged
= xcalloc(1, sizeof(struct string_list
));
369 unmerged
->strdup_strings
= 1;
371 for (i
= 0; i
< active_nr
; i
++) {
372 struct string_list_item
*item
;
373 struct stage_data
*e
;
374 const struct cache_entry
*ce
= active_cache
[i
];
378 item
= string_list_lookup(unmerged
, ce
->name
);
380 item
= string_list_insert(unmerged
, ce
->name
);
381 item
->util
= xcalloc(1, sizeof(struct stage_data
));
384 e
->stages
[ce_stage(ce
)].mode
= ce
->ce_mode
;
385 hashcpy(e
->stages
[ce_stage(ce
)].oid
.hash
, ce
->sha1
);
391 static int string_list_df_name_compare(const void *a
, const void *b
)
393 const struct string_list_item
*one
= a
;
394 const struct string_list_item
*two
= b
;
395 int onelen
= strlen(one
->string
);
396 int twolen
= strlen(two
->string
);
398 * Here we only care that entries for D/F conflicts are
399 * adjacent, in particular with the file of the D/F conflict
400 * appearing before files below the corresponding directory.
401 * The order of the rest of the list is irrelevant for us.
403 * To achieve this, we sort with df_name_compare and provide
404 * the mode S_IFDIR so that D/F conflicts will sort correctly.
405 * We use the mode S_IFDIR for everything else for simplicity,
406 * since in other cases any changes in their order due to
407 * sorting cause no problems for us.
409 int cmp
= df_name_compare(one
->string
, onelen
, S_IFDIR
,
410 two
->string
, twolen
, S_IFDIR
);
412 * Now that 'foo' and 'foo/bar' compare equal, we have to make sure
413 * that 'foo' comes before 'foo/bar'.
417 return onelen
- twolen
;
420 static void record_df_conflict_files(struct merge_options
*o
,
421 struct string_list
*entries
)
423 /* If there is a D/F conflict and the file for such a conflict
424 * currently exist in the working tree, we want to allow it to be
425 * removed to make room for the corresponding directory if needed.
426 * The files underneath the directories of such D/F conflicts will
427 * be processed before the corresponding file involved in the D/F
428 * conflict. If the D/F directory ends up being removed by the
429 * merge, then we won't have to touch the D/F file. If the D/F
430 * directory needs to be written to the working copy, then the D/F
431 * file will simply be removed (in make_room_for_path()) to make
432 * room for the necessary paths. Note that if both the directory
433 * and the file need to be present, then the D/F file will be
434 * reinstated with a new unique name at the time it is processed.
436 struct string_list df_sorted_entries
= STRING_LIST_INIT_NODUP
;
437 const char *last_file
= NULL
;
442 * If we're merging merge-bases, we don't want to bother with
443 * any working directory changes.
448 /* Ensure D/F conflicts are adjacent in the entries list. */
449 for (i
= 0; i
< entries
->nr
; i
++) {
450 struct string_list_item
*next
= &entries
->items
[i
];
451 string_list_append(&df_sorted_entries
, next
->string
)->util
=
454 qsort(df_sorted_entries
.items
, entries
->nr
, sizeof(*entries
->items
),
455 string_list_df_name_compare
);
457 string_list_clear(&o
->df_conflict_file_set
, 1);
458 for (i
= 0; i
< df_sorted_entries
.nr
; i
++) {
459 const char *path
= df_sorted_entries
.items
[i
].string
;
460 int len
= strlen(path
);
461 struct stage_data
*e
= df_sorted_entries
.items
[i
].util
;
464 * Check if last_file & path correspond to a D/F conflict;
465 * i.e. whether path is last_file+'/'+<something>.
466 * If so, record that it's okay to remove last_file to make
467 * room for path and friends if needed.
471 memcmp(path
, last_file
, last_len
) == 0 &&
472 path
[last_len
] == '/') {
473 string_list_insert(&o
->df_conflict_file_set
, last_file
);
477 * Determine whether path could exist as a file in the
478 * working directory as a possible D/F conflict. This
479 * will only occur when it exists in stage 2 as a
482 if (S_ISREG(e
->stages
[2].mode
) || S_ISLNK(e
->stages
[2].mode
)) {
489 string_list_clear(&df_sorted_entries
, 0);
493 struct diff_filepair
*pair
;
494 struct stage_data
*src_entry
;
495 struct stage_data
*dst_entry
;
496 unsigned processed
:1;
500 * Get information of all renames which occurred between 'o_tree' and
501 * 'tree'. We need the three trees in the merge ('o_tree', 'a_tree' and
502 * 'b_tree') to be able to associate the correct cache entries with
503 * the rename information. 'tree' is always equal to either a_tree or b_tree.
505 static struct string_list
*get_renames(struct merge_options
*o
,
510 struct string_list
*entries
)
513 struct string_list
*renames
;
514 struct diff_options opts
;
516 renames
= xcalloc(1, sizeof(struct string_list
));
517 if (!o
->detect_rename
)
521 DIFF_OPT_SET(&opts
, RECURSIVE
);
522 DIFF_OPT_CLR(&opts
, RENAME_EMPTY
);
523 opts
.detect_rename
= DIFF_DETECT_RENAME
;
524 opts
.rename_limit
= o
->merge_rename_limit
>= 0 ? o
->merge_rename_limit
:
525 o
->diff_rename_limit
>= 0 ? o
->diff_rename_limit
:
527 opts
.rename_score
= o
->rename_score
;
528 opts
.show_rename_progress
= o
->show_rename_progress
;
529 opts
.output_format
= DIFF_FORMAT_NO_OUTPUT
;
530 diff_setup_done(&opts
);
531 diff_tree_sha1(o_tree
->object
.oid
.hash
, tree
->object
.oid
.hash
, "", &opts
);
533 if (opts
.needed_rename_limit
> o
->needed_rename_limit
)
534 o
->needed_rename_limit
= opts
.needed_rename_limit
;
535 for (i
= 0; i
< diff_queued_diff
.nr
; ++i
) {
536 struct string_list_item
*item
;
538 struct diff_filepair
*pair
= diff_queued_diff
.queue
[i
];
539 if (pair
->status
!= 'R') {
540 diff_free_filepair(pair
);
543 re
= xmalloc(sizeof(*re
));
546 item
= string_list_lookup(entries
, re
->pair
->one
->path
);
548 re
->src_entry
= insert_stage_data(re
->pair
->one
->path
,
549 o_tree
, a_tree
, b_tree
, entries
);
551 re
->src_entry
= item
->util
;
553 item
= string_list_lookup(entries
, re
->pair
->two
->path
);
555 re
->dst_entry
= insert_stage_data(re
->pair
->two
->path
,
556 o_tree
, a_tree
, b_tree
, entries
);
558 re
->dst_entry
= item
->util
;
559 item
= string_list_insert(renames
, pair
->one
->path
);
562 opts
.output_format
= DIFF_FORMAT_NO_OUTPUT
;
563 diff_queued_diff
.nr
= 0;
568 static int update_stages(struct merge_options
*opt
, const char *path
,
569 const struct diff_filespec
*o
,
570 const struct diff_filespec
*a
,
571 const struct diff_filespec
*b
)
575 * NOTE: It is usually a bad idea to call update_stages on a path
576 * before calling update_file on that same path, since it can
577 * sometimes lead to spurious "refusing to lose untracked file..."
578 * messages from update_file (via make_room_for path via
579 * would_lose_untracked). Instead, reverse the order of the calls
580 * (executing update_file first and then update_stages).
583 int options
= ADD_CACHE_OK_TO_ADD
| ADD_CACHE_SKIP_DFCHECK
;
585 if (remove_file_from_cache(path
))
588 if (add_cacheinfo(opt
, o
->mode
, &o
->oid
, path
, 1, 0, options
))
591 if (add_cacheinfo(opt
, a
->mode
, &a
->oid
, path
, 2, 0, options
))
594 if (add_cacheinfo(opt
, b
->mode
, &b
->oid
, path
, 3, 0, options
))
599 static void update_entry(struct stage_data
*entry
,
600 struct diff_filespec
*o
,
601 struct diff_filespec
*a
,
602 struct diff_filespec
*b
)
604 entry
->processed
= 0;
605 entry
->stages
[1].mode
= o
->mode
;
606 entry
->stages
[2].mode
= a
->mode
;
607 entry
->stages
[3].mode
= b
->mode
;
608 oidcpy(&entry
->stages
[1].oid
, &o
->oid
);
609 oidcpy(&entry
->stages
[2].oid
, &a
->oid
);
610 oidcpy(&entry
->stages
[3].oid
, &b
->oid
);
613 static int remove_file(struct merge_options
*o
, int clean
,
614 const char *path
, int no_wd
)
616 int update_cache
= o
->call_depth
|| clean
;
617 int update_working_directory
= !o
->call_depth
&& !no_wd
;
620 if (remove_file_from_cache(path
))
623 if (update_working_directory
) {
625 struct cache_entry
*ce
;
626 ce
= cache_file_exists(path
, strlen(path
), ignore_case
);
627 if (ce
&& ce_stage(ce
) == 0)
630 if (remove_path(path
))
636 /* add a string to a strbuf, but converting "/" to "_" */
637 static void add_flattened_path(struct strbuf
*out
, const char *s
)
640 strbuf_addstr(out
, s
);
641 for (; i
< out
->len
; i
++)
642 if (out
->buf
[i
] == '/')
646 static char *unique_path(struct merge_options
*o
, const char *path
, const char *branch
)
648 struct strbuf newpath
= STRBUF_INIT
;
652 strbuf_addf(&newpath
, "%s~", path
);
653 add_flattened_path(&newpath
, branch
);
655 base_len
= newpath
.len
;
656 while (string_list_has_string(&o
->current_file_set
, newpath
.buf
) ||
657 string_list_has_string(&o
->current_directory_set
, newpath
.buf
) ||
658 (!o
->call_depth
&& file_exists(newpath
.buf
))) {
659 strbuf_setlen(&newpath
, base_len
);
660 strbuf_addf(&newpath
, "_%d", suffix
++);
663 string_list_insert(&o
->current_file_set
, newpath
.buf
);
664 return strbuf_detach(&newpath
, NULL
);
667 static int dir_in_way(const char *path
, int check_working_copy
)
670 struct strbuf dirpath
= STRBUF_INIT
;
673 strbuf_addstr(&dirpath
, path
);
674 strbuf_addch(&dirpath
, '/');
676 pos
= cache_name_pos(dirpath
.buf
, dirpath
.len
);
680 if (pos
< active_nr
&&
681 !strncmp(dirpath
.buf
, active_cache
[pos
]->name
, dirpath
.len
)) {
682 strbuf_release(&dirpath
);
686 strbuf_release(&dirpath
);
687 return check_working_copy
&& !lstat(path
, &st
) && S_ISDIR(st
.st_mode
);
690 static int was_tracked(const char *path
)
692 int pos
= cache_name_pos(path
, strlen(path
));
695 /* we have been tracking this path */
699 * Look for an unmerged entry for the path,
700 * specifically stage #2, which would indicate
701 * that "our" side before the merge started
702 * had the path tracked (and resulted in a conflict).
705 pos
< active_nr
&& !strcmp(path
, active_cache
[pos
]->name
);
707 if (ce_stage(active_cache
[pos
]) == 2)
712 static int would_lose_untracked(const char *path
)
714 return !was_tracked(path
) && file_exists(path
);
717 static int make_room_for_path(struct merge_options
*o
, const char *path
)
720 const char *msg
= _("failed to create path '%s'%s");
722 /* Unlink any D/F conflict files that are in the way */
723 for (i
= 0; i
< o
->df_conflict_file_set
.nr
; i
++) {
724 const char *df_path
= o
->df_conflict_file_set
.items
[i
].string
;
725 size_t pathlen
= strlen(path
);
726 size_t df_pathlen
= strlen(df_path
);
727 if (df_pathlen
< pathlen
&&
728 path
[df_pathlen
] == '/' &&
729 strncmp(path
, df_path
, df_pathlen
) == 0) {
731 _("Removing %s to make room for subdirectory\n"),
734 unsorted_string_list_delete_item(&o
->df_conflict_file_set
,
740 /* Make sure leading directories are created */
741 status
= safe_create_leading_directories_const(path
);
743 if (status
== SCLD_EXISTS
)
744 /* something else exists */
745 return err(o
, msg
, path
, _(": perhaps a D/F conflict?"));
746 return err(o
, msg
, path
, "");
750 * Do not unlink a file in the work tree if we are not
753 if (would_lose_untracked(path
))
754 return err(o
, _("refusing to lose untracked file at '%s'"),
757 /* Successful unlink is good.. */
760 /* .. and so is no existing file */
763 /* .. but not some other error (who really cares what?) */
764 return err(o
, msg
, path
, _(": perhaps a D/F conflict?"));
767 static int update_file_flags(struct merge_options
*o
,
768 const struct object_id
*oid
,
780 enum object_type type
;
784 if (S_ISGITLINK(mode
)) {
786 * We may later decide to recursively descend into
787 * the submodule directory and update its index
788 * and/or work tree, but we do not do that now.
794 buf
= read_sha1_file(oid
->hash
, &type
, &size
);
796 return err(o
, _("cannot read object %s '%s'"), oid_to_hex(oid
), path
);
797 if (type
!= OBJ_BLOB
) {
798 ret
= err(o
, _("blob expected for %s '%s'"), oid_to_hex(oid
), path
);
802 struct strbuf strbuf
= STRBUF_INIT
;
803 if (convert_to_working_tree(path
, buf
, size
, &strbuf
)) {
806 buf
= strbuf_detach(&strbuf
, NULL
);
810 if (make_room_for_path(o
, path
) < 0) {
814 if (S_ISREG(mode
) || (!has_symlinks
&& S_ISLNK(mode
))) {
820 fd
= open(path
, O_WRONLY
| O_TRUNC
| O_CREAT
, mode
);
822 ret
= err(o
, _("failed to open '%s': %s"),
823 path
, strerror(errno
));
826 write_in_full(fd
, buf
, size
);
828 } else if (S_ISLNK(mode
)) {
829 char *lnk
= xmemdupz(buf
, size
);
830 safe_create_leading_directories_const(path
);
832 if (symlink(lnk
, path
))
833 ret
= err(o
, _("failed to symlink '%s': %s"),
834 path
, strerror(errno
));
838 _("do not know what to do with %06o %s '%s'"),
839 mode
, oid_to_hex(oid
), path
);
844 if (!ret
&& update_cache
)
845 add_cacheinfo(o
, mode
, oid
, path
, 0, update_wd
, ADD_CACHE_OK_TO_ADD
);
849 static int update_file(struct merge_options
*o
,
851 const struct object_id
*oid
,
855 return update_file_flags(o
, oid
, mode
, path
, o
->call_depth
|| clean
, !o
->call_depth
);
858 /* Low level file merging, update and removal */
860 struct merge_file_info
{
861 struct object_id oid
;
867 static int merge_3way(struct merge_options
*o
,
868 mmbuffer_t
*result_buf
,
869 const struct diff_filespec
*one
,
870 const struct diff_filespec
*a
,
871 const struct diff_filespec
*b
,
875 mmfile_t orig
, src1
, src2
;
876 struct ll_merge_options ll_opts
= {0};
877 char *base_name
, *name1
, *name2
;
880 ll_opts
.renormalize
= o
->renormalize
;
881 ll_opts
.xdl_opts
= o
->xdl_opts
;
884 ll_opts
.virtual_ancestor
= 1;
887 switch (o
->recursive_variant
) {
888 case MERGE_RECURSIVE_OURS
:
889 ll_opts
.variant
= XDL_MERGE_FAVOR_OURS
;
891 case MERGE_RECURSIVE_THEIRS
:
892 ll_opts
.variant
= XDL_MERGE_FAVOR_THEIRS
;
900 if (strcmp(a
->path
, b
->path
) ||
901 (o
->ancestor
!= NULL
&& strcmp(a
->path
, one
->path
) != 0)) {
902 base_name
= o
->ancestor
== NULL
? NULL
:
903 mkpathdup("%s:%s", o
->ancestor
, one
->path
);
904 name1
= mkpathdup("%s:%s", branch1
, a
->path
);
905 name2
= mkpathdup("%s:%s", branch2
, b
->path
);
907 base_name
= o
->ancestor
== NULL
? NULL
:
908 mkpathdup("%s", o
->ancestor
);
909 name1
= mkpathdup("%s", branch1
);
910 name2
= mkpathdup("%s", branch2
);
913 read_mmblob(&orig
, one
->oid
.hash
);
914 read_mmblob(&src1
, a
->oid
.hash
);
915 read_mmblob(&src2
, b
->oid
.hash
);
917 merge_status
= ll_merge(result_buf
, a
->path
, &orig
, base_name
,
918 &src1
, name1
, &src2
, name2
, &ll_opts
);
929 static int merge_file_1(struct merge_options
*o
,
930 const struct diff_filespec
*one
,
931 const struct diff_filespec
*a
,
932 const struct diff_filespec
*b
,
935 struct merge_file_info
*result
)
940 if ((S_IFMT
& a
->mode
) != (S_IFMT
& b
->mode
)) {
942 if (S_ISREG(a
->mode
)) {
943 result
->mode
= a
->mode
;
944 oidcpy(&result
->oid
, &a
->oid
);
946 result
->mode
= b
->mode
;
947 oidcpy(&result
->oid
, &b
->oid
);
950 if (!oid_eq(&a
->oid
, &one
->oid
) && !oid_eq(&b
->oid
, &one
->oid
))
956 if (a
->mode
== b
->mode
|| a
->mode
== one
->mode
)
957 result
->mode
= b
->mode
;
959 result
->mode
= a
->mode
;
960 if (b
->mode
!= one
->mode
) {
966 if (oid_eq(&a
->oid
, &b
->oid
) || oid_eq(&a
->oid
, &one
->oid
))
967 oidcpy(&result
->oid
, &b
->oid
);
968 else if (oid_eq(&b
->oid
, &one
->oid
))
969 oidcpy(&result
->oid
, &a
->oid
);
970 else if (S_ISREG(a
->mode
)) {
971 mmbuffer_t result_buf
;
972 int ret
= 0, merge_status
;
974 merge_status
= merge_3way(o
, &result_buf
, one
, a
, b
,
977 if ((merge_status
< 0) || !result_buf
.ptr
)
978 ret
= err(o
, _("Failed to execute internal merge"));
980 if (!ret
&& write_sha1_file(result_buf
.ptr
, result_buf
.size
,
981 blob_type
, result
->oid
.hash
))
982 ret
= err(o
, _("Unable to add %s to database"),
985 free(result_buf
.ptr
);
988 result
->clean
= (merge_status
== 0);
989 } else if (S_ISGITLINK(a
->mode
)) {
990 result
->clean
= merge_submodule(result
->oid
.hash
,
996 } else if (S_ISLNK(a
->mode
)) {
997 oidcpy(&result
->oid
, &a
->oid
);
999 if (!oid_eq(&a
->oid
, &b
->oid
))
1002 die("BUG: unsupported object type in the tree");
1008 static int merge_file_special_markers(struct merge_options
*o
,
1009 const struct diff_filespec
*one
,
1010 const struct diff_filespec
*a
,
1011 const struct diff_filespec
*b
,
1012 const char *branch1
,
1013 const char *filename1
,
1014 const char *branch2
,
1015 const char *filename2
,
1016 struct merge_file_info
*mfi
)
1023 side1
= xstrfmt("%s:%s", branch1
, filename1
);
1025 side2
= xstrfmt("%s:%s", branch2
, filename2
);
1027 ret
= merge_file_1(o
, one
, a
, b
,
1028 side1
? side1
: branch1
,
1029 side2
? side2
: branch2
, mfi
);
1035 static int merge_file_one(struct merge_options
*o
,
1037 const struct object_id
*o_oid
, int o_mode
,
1038 const struct object_id
*a_oid
, int a_mode
,
1039 const struct object_id
*b_oid
, int b_mode
,
1040 const char *branch1
,
1041 const char *branch2
,
1042 struct merge_file_info
*mfi
)
1044 struct diff_filespec one
, a
, b
;
1046 one
.path
= a
.path
= b
.path
= (char *)path
;
1047 oidcpy(&one
.oid
, o_oid
);
1049 oidcpy(&a
.oid
, a_oid
);
1051 oidcpy(&b
.oid
, b_oid
);
1053 return merge_file_1(o
, &one
, &a
, &b
, branch1
, branch2
, mfi
);
1056 static int handle_change_delete(struct merge_options
*o
,
1058 const struct object_id
*o_oid
, int o_mode
,
1059 const struct object_id
*a_oid
, int a_mode
,
1060 const struct object_id
*b_oid
, int b_mode
,
1061 const char *change
, const char *change_past
)
1063 char *renamed
= NULL
;
1065 if (dir_in_way(path
, !o
->call_depth
)) {
1066 renamed
= unique_path(o
, path
, a_oid
? o
->branch1
: o
->branch2
);
1069 if (o
->call_depth
) {
1071 * We cannot arbitrarily accept either a_sha or b_sha as
1072 * correct; since there is no true "middle point" between
1073 * them, simply reuse the base version for virtual merge base.
1075 ret
= remove_file_from_cache(path
);
1077 ret
= update_file(o
, 0, o_oid
, o_mode
,
1078 renamed
? renamed
: path
);
1079 } else if (!a_oid
) {
1081 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1082 "and %s in %s. Version %s of %s left in tree."),
1083 change
, path
, o
->branch1
, change_past
,
1084 o
->branch2
, o
->branch2
, path
);
1085 ret
= update_file(o
, 0, b_oid
, b_mode
, path
);
1087 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1088 "and %s in %s. Version %s of %s left in tree at %s."),
1089 change
, path
, o
->branch1
, change_past
,
1090 o
->branch2
, o
->branch2
, path
, renamed
);
1091 ret
= update_file(o
, 0, b_oid
, b_mode
, renamed
);
1095 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1096 "and %s in %s. Version %s of %s left in tree."),
1097 change
, path
, o
->branch2
, change_past
,
1098 o
->branch1
, o
->branch1
, path
);
1100 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1101 "and %s in %s. Version %s of %s left in tree at %s."),
1102 change
, path
, o
->branch2
, change_past
,
1103 o
->branch1
, o
->branch1
, path
, renamed
);
1104 ret
= update_file(o
, 0, a_oid
, a_mode
, renamed
);
1107 * No need to call update_file() on path when !renamed, since
1108 * that would needlessly touch path. We could call
1109 * update_file_flags() with update_cache=0 and update_wd=0,
1110 * but that's a no-op.
1118 static int conflict_rename_delete(struct merge_options
*o
,
1119 struct diff_filepair
*pair
,
1120 const char *rename_branch
,
1121 const char *other_branch
)
1123 const struct diff_filespec
*orig
= pair
->one
;
1124 const struct diff_filespec
*dest
= pair
->two
;
1125 const struct object_id
*a_oid
= NULL
;
1126 const struct object_id
*b_oid
= NULL
;
1130 if (rename_branch
== o
->branch1
) {
1132 a_mode
= dest
->mode
;
1135 b_mode
= dest
->mode
;
1138 if (handle_change_delete(o
,
1139 o
->call_depth
? orig
->path
: dest
->path
,
1140 &orig
->oid
, orig
->mode
,
1143 _("rename"), _("renamed")))
1147 return remove_file_from_cache(dest
->path
);
1149 return update_stages(o
, dest
->path
, NULL
,
1150 rename_branch
== o
->branch1
? dest
: NULL
,
1151 rename_branch
== o
->branch1
? NULL
: dest
);
1154 static struct diff_filespec
*filespec_from_entry(struct diff_filespec
*target
,
1155 struct stage_data
*entry
,
1158 struct object_id
*oid
= &entry
->stages
[stage
].oid
;
1159 unsigned mode
= entry
->stages
[stage
].mode
;
1160 if (mode
== 0 || is_null_oid(oid
))
1162 oidcpy(&target
->oid
, oid
);
1163 target
->mode
= mode
;
1167 static int handle_file(struct merge_options
*o
,
1168 struct diff_filespec
*rename
,
1170 struct rename_conflict_info
*ci
)
1172 char *dst_name
= rename
->path
;
1173 struct stage_data
*dst_entry
;
1174 const char *cur_branch
, *other_branch
;
1175 struct diff_filespec other
;
1176 struct diff_filespec
*add
;
1180 dst_entry
= ci
->dst_entry1
;
1181 cur_branch
= ci
->branch1
;
1182 other_branch
= ci
->branch2
;
1184 dst_entry
= ci
->dst_entry2
;
1185 cur_branch
= ci
->branch2
;
1186 other_branch
= ci
->branch1
;
1189 add
= filespec_from_entry(&other
, dst_entry
, stage
^ 1);
1191 char *add_name
= unique_path(o
, rename
->path
, other_branch
);
1192 if (update_file(o
, 0, &add
->oid
, add
->mode
, add_name
))
1195 remove_file(o
, 0, rename
->path
, 0);
1196 dst_name
= unique_path(o
, rename
->path
, cur_branch
);
1198 if (dir_in_way(rename
->path
, !o
->call_depth
)) {
1199 dst_name
= unique_path(o
, rename
->path
, cur_branch
);
1200 output(o
, 1, _("%s is a directory in %s adding as %s instead"),
1201 rename
->path
, other_branch
, dst_name
);
1204 if ((ret
= update_file(o
, 0, &rename
->oid
, rename
->mode
, dst_name
)))
1205 ; /* fall through, do allow dst_name to be released */
1206 else if (stage
== 2)
1207 ret
= update_stages(o
, rename
->path
, NULL
, rename
, add
);
1209 ret
= update_stages(o
, rename
->path
, NULL
, add
, rename
);
1211 if (dst_name
!= rename
->path
)
1217 static int conflict_rename_rename_1to2(struct merge_options
*o
,
1218 struct rename_conflict_info
*ci
)
1220 /* One file was renamed in both branches, but to different names. */
1221 struct diff_filespec
*one
= ci
->pair1
->one
;
1222 struct diff_filespec
*a
= ci
->pair1
->two
;
1223 struct diff_filespec
*b
= ci
->pair2
->two
;
1225 output(o
, 1, _("CONFLICT (rename/rename): "
1226 "Rename \"%s\"->\"%s\" in branch \"%s\" "
1227 "rename \"%s\"->\"%s\" in \"%s\"%s"),
1228 one
->path
, a
->path
, ci
->branch1
,
1229 one
->path
, b
->path
, ci
->branch2
,
1230 o
->call_depth
? _(" (left unresolved)") : "");
1231 if (o
->call_depth
) {
1232 struct merge_file_info mfi
;
1233 struct diff_filespec other
;
1234 struct diff_filespec
*add
;
1235 if (merge_file_one(o
, one
->path
,
1236 &one
->oid
, one
->mode
,
1239 ci
->branch1
, ci
->branch2
, &mfi
))
1243 * FIXME: For rename/add-source conflicts (if we could detect
1244 * such), this is wrong. We should instead find a unique
1245 * pathname and then either rename the add-source file to that
1246 * unique path, or use that unique path instead of src here.
1248 if (update_file(o
, 0, &mfi
.oid
, mfi
.mode
, one
->path
))
1252 * Above, we put the merged content at the merge-base's
1253 * path. Now we usually need to delete both a->path and
1254 * b->path. However, the rename on each side of the merge
1255 * could also be involved in a rename/add conflict. In
1256 * such cases, we should keep the added file around,
1257 * resolving the conflict at that path in its favor.
1259 add
= filespec_from_entry(&other
, ci
->dst_entry1
, 2 ^ 1);
1261 if (update_file(o
, 0, &add
->oid
, add
->mode
, a
->path
))
1265 remove_file_from_cache(a
->path
);
1266 add
= filespec_from_entry(&other
, ci
->dst_entry2
, 3 ^ 1);
1268 if (update_file(o
, 0, &add
->oid
, add
->mode
, b
->path
))
1272 remove_file_from_cache(b
->path
);
1273 } else if (handle_file(o
, a
, 2, ci
) || handle_file(o
, b
, 3, ci
))
1279 static int conflict_rename_rename_2to1(struct merge_options
*o
,
1280 struct rename_conflict_info
*ci
)
1282 /* Two files, a & b, were renamed to the same thing, c. */
1283 struct diff_filespec
*a
= ci
->pair1
->one
;
1284 struct diff_filespec
*b
= ci
->pair2
->one
;
1285 struct diff_filespec
*c1
= ci
->pair1
->two
;
1286 struct diff_filespec
*c2
= ci
->pair2
->two
;
1287 char *path
= c1
->path
; /* == c2->path */
1288 struct merge_file_info mfi_c1
;
1289 struct merge_file_info mfi_c2
;
1292 output(o
, 1, _("CONFLICT (rename/rename): "
1293 "Rename %s->%s in %s. "
1294 "Rename %s->%s in %s"),
1295 a
->path
, c1
->path
, ci
->branch1
,
1296 b
->path
, c2
->path
, ci
->branch2
);
1298 remove_file(o
, 1, a
->path
, o
->call_depth
|| would_lose_untracked(a
->path
));
1299 remove_file(o
, 1, b
->path
, o
->call_depth
|| would_lose_untracked(b
->path
));
1301 if (merge_file_special_markers(o
, a
, c1
, &ci
->ren1_other
,
1302 o
->branch1
, c1
->path
,
1303 o
->branch2
, ci
->ren1_other
.path
, &mfi_c1
) ||
1304 merge_file_special_markers(o
, b
, &ci
->ren2_other
, c2
,
1305 o
->branch1
, ci
->ren2_other
.path
,
1306 o
->branch2
, c2
->path
, &mfi_c2
))
1309 if (o
->call_depth
) {
1311 * If mfi_c1.clean && mfi_c2.clean, then it might make
1312 * sense to do a two-way merge of those results. But, I
1313 * think in all cases, it makes sense to have the virtual
1314 * merge base just undo the renames; they can be detected
1315 * again later for the non-recursive merge.
1317 remove_file(o
, 0, path
, 0);
1318 ret
= update_file(o
, 0, &mfi_c1
.oid
, mfi_c1
.mode
, a
->path
);
1320 ret
= update_file(o
, 0, &mfi_c2
.oid
, mfi_c2
.mode
,
1323 char *new_path1
= unique_path(o
, path
, ci
->branch1
);
1324 char *new_path2
= unique_path(o
, path
, ci
->branch2
);
1325 output(o
, 1, _("Renaming %s to %s and %s to %s instead"),
1326 a
->path
, new_path1
, b
->path
, new_path2
);
1327 remove_file(o
, 0, path
, 0);
1328 ret
= update_file(o
, 0, &mfi_c1
.oid
, mfi_c1
.mode
, new_path1
);
1330 ret
= update_file(o
, 0, &mfi_c2
.oid
, mfi_c2
.mode
,
1339 static int process_renames(struct merge_options
*o
,
1340 struct string_list
*a_renames
,
1341 struct string_list
*b_renames
)
1343 int clean_merge
= 1, i
, j
;
1344 struct string_list a_by_dst
= STRING_LIST_INIT_NODUP
;
1345 struct string_list b_by_dst
= STRING_LIST_INIT_NODUP
;
1346 const struct rename
*sre
;
1348 for (i
= 0; i
< a_renames
->nr
; i
++) {
1349 sre
= a_renames
->items
[i
].util
;
1350 string_list_insert(&a_by_dst
, sre
->pair
->two
->path
)->util
1353 for (i
= 0; i
< b_renames
->nr
; i
++) {
1354 sre
= b_renames
->items
[i
].util
;
1355 string_list_insert(&b_by_dst
, sre
->pair
->two
->path
)->util
1359 for (i
= 0, j
= 0; i
< a_renames
->nr
|| j
< b_renames
->nr
;) {
1360 struct string_list
*renames1
, *renames2Dst
;
1361 struct rename
*ren1
= NULL
, *ren2
= NULL
;
1362 const char *branch1
, *branch2
;
1363 const char *ren1_src
, *ren1_dst
;
1364 struct string_list_item
*lookup
;
1366 if (i
>= a_renames
->nr
) {
1367 ren2
= b_renames
->items
[j
++].util
;
1368 } else if (j
>= b_renames
->nr
) {
1369 ren1
= a_renames
->items
[i
++].util
;
1371 int compare
= strcmp(a_renames
->items
[i
].string
,
1372 b_renames
->items
[j
].string
);
1374 ren1
= a_renames
->items
[i
++].util
;
1376 ren2
= b_renames
->items
[j
++].util
;
1379 /* TODO: refactor, so that 1/2 are not needed */
1381 renames1
= a_renames
;
1382 renames2Dst
= &b_by_dst
;
1383 branch1
= o
->branch1
;
1384 branch2
= o
->branch2
;
1387 renames1
= b_renames
;
1388 renames2Dst
= &a_by_dst
;
1389 branch1
= o
->branch2
;
1390 branch2
= o
->branch1
;
1396 if (ren1
->processed
)
1398 ren1
->processed
= 1;
1399 ren1
->dst_entry
->processed
= 1;
1400 /* BUG: We should only mark src_entry as processed if we
1401 * are not dealing with a rename + add-source case.
1403 ren1
->src_entry
->processed
= 1;
1405 ren1_src
= ren1
->pair
->one
->path
;
1406 ren1_dst
= ren1
->pair
->two
->path
;
1409 /* One file renamed on both sides */
1410 const char *ren2_src
= ren2
->pair
->one
->path
;
1411 const char *ren2_dst
= ren2
->pair
->two
->path
;
1412 enum rename_type rename_type
;
1413 if (strcmp(ren1_src
, ren2_src
) != 0)
1414 die("BUG: ren1_src != ren2_src");
1415 ren2
->dst_entry
->processed
= 1;
1416 ren2
->processed
= 1;
1417 if (strcmp(ren1_dst
, ren2_dst
) != 0) {
1418 rename_type
= RENAME_ONE_FILE_TO_TWO
;
1421 rename_type
= RENAME_ONE_FILE_TO_ONE
;
1422 /* BUG: We should only remove ren1_src in
1423 * the base stage (think of rename +
1424 * add-source cases).
1426 remove_file(o
, 1, ren1_src
, 1);
1427 update_entry(ren1
->dst_entry
,
1432 setup_rename_conflict_info(rename_type
,
1442 } else if ((lookup
= string_list_lookup(renames2Dst
, ren1_dst
))) {
1443 /* Two different files renamed to the same thing */
1445 ren2
= lookup
->util
;
1446 ren2_dst
= ren2
->pair
->two
->path
;
1447 if (strcmp(ren1_dst
, ren2_dst
) != 0)
1448 die("BUG: ren1_dst != ren2_dst");
1451 ren2
->processed
= 1;
1453 * BUG: We should only mark src_entry as processed
1454 * if we are not dealing with a rename + add-source
1457 ren2
->src_entry
->processed
= 1;
1459 setup_rename_conflict_info(RENAME_TWO_FILES_TO_ONE
,
1471 /* Renamed in 1, maybe changed in 2 */
1472 /* we only use sha1 and mode of these */
1473 struct diff_filespec src_other
, dst_other
;
1477 * unpack_trees loads entries from common-commit
1478 * into stage 1, from head-commit into stage 2, and
1479 * from merge-commit into stage 3. We keep track
1480 * of which side corresponds to the rename.
1482 int renamed_stage
= a_renames
== renames1
? 2 : 3;
1483 int other_stage
= a_renames
== renames1
? 3 : 2;
1485 /* BUG: We should only remove ren1_src in the base
1486 * stage and in other_stage (think of rename +
1489 remove_file(o
, 1, ren1_src
,
1490 renamed_stage
== 2 || !was_tracked(ren1_src
));
1492 oidcpy(&src_other
.oid
,
1493 &ren1
->src_entry
->stages
[other_stage
].oid
);
1494 src_other
.mode
= ren1
->src_entry
->stages
[other_stage
].mode
;
1495 oidcpy(&dst_other
.oid
,
1496 &ren1
->dst_entry
->stages
[other_stage
].oid
);
1497 dst_other
.mode
= ren1
->dst_entry
->stages
[other_stage
].mode
;
1500 if (oid_eq(&src_other
.oid
, &null_oid
)) {
1501 setup_rename_conflict_info(RENAME_DELETE
,
1511 } else if ((dst_other
.mode
== ren1
->pair
->two
->mode
) &&
1512 oid_eq(&dst_other
.oid
, &ren1
->pair
->two
->oid
)) {
1514 * Added file on the other side identical to
1515 * the file being renamed: clean merge.
1516 * Also, there is no need to overwrite the
1517 * file already in the working copy, so call
1518 * update_file_flags() instead of
1521 if (update_file_flags(o
,
1522 &ren1
->pair
->two
->oid
,
1523 ren1
->pair
->two
->mode
,
1525 1, /* update_cache */
1528 } else if (!oid_eq(&dst_other
.oid
, &null_oid
)) {
1531 output(o
, 1, _("CONFLICT (rename/add): Rename %s->%s in %s. "
1533 ren1_src
, ren1_dst
, branch1
,
1535 if (o
->call_depth
) {
1536 struct merge_file_info mfi
;
1537 if (merge_file_one(o
, ren1_dst
, &null_oid
, 0,
1538 &ren1
->pair
->two
->oid
,
1539 ren1
->pair
->two
->mode
,
1542 branch1
, branch2
, &mfi
)) {
1544 goto cleanup_and_return
;
1546 output(o
, 1, _("Adding merged %s"), ren1_dst
);
1547 if (update_file(o
, 0, &mfi
.oid
,
1548 mfi
.mode
, ren1_dst
))
1552 char *new_path
= unique_path(o
, ren1_dst
, branch2
);
1553 output(o
, 1, _("Adding as %s instead"), new_path
);
1554 if (update_file(o
, 0, &dst_other
.oid
,
1555 dst_other
.mode
, new_path
))
1562 if (clean_merge
< 0)
1563 goto cleanup_and_return
;
1565 struct diff_filespec
*one
, *a
, *b
;
1566 src_other
.path
= (char *)ren1_src
;
1568 one
= ren1
->pair
->one
;
1569 if (a_renames
== renames1
) {
1570 a
= ren1
->pair
->two
;
1573 b
= ren1
->pair
->two
;
1576 update_entry(ren1
->dst_entry
, one
, a
, b
);
1577 setup_rename_conflict_info(RENAME_NORMAL
,
1591 string_list_clear(&a_by_dst
, 0);
1592 string_list_clear(&b_by_dst
, 0);
1597 static struct object_id
*stage_oid(const struct object_id
*oid
, unsigned mode
)
1599 return (is_null_oid(oid
) || mode
== 0) ? NULL
: (struct object_id
*)oid
;
1602 static int read_oid_strbuf(struct merge_options
*o
,
1603 const struct object_id
*oid
, struct strbuf
*dst
)
1606 enum object_type type
;
1608 buf
= read_sha1_file(oid
->hash
, &type
, &size
);
1610 return err(o
, _("cannot read object %s"), oid_to_hex(oid
));
1611 if (type
!= OBJ_BLOB
) {
1613 return err(o
, _("object %s is not a blob"), oid_to_hex(oid
));
1615 strbuf_attach(dst
, buf
, size
, size
+ 1);
1619 static int blob_unchanged(struct merge_options
*opt
,
1620 const struct object_id
*o_oid
,
1622 const struct object_id
*a_oid
,
1624 int renormalize
, const char *path
)
1626 struct strbuf o
= STRBUF_INIT
;
1627 struct strbuf a
= STRBUF_INIT
;
1628 int ret
= 0; /* assume changed for safety */
1630 if (a_mode
!= o_mode
)
1632 if (oid_eq(o_oid
, a_oid
))
1637 assert(o_oid
&& a_oid
);
1638 if (read_oid_strbuf(opt
, o_oid
, &o
) || read_oid_strbuf(opt
, a_oid
, &a
))
1641 * Note: binary | is used so that both renormalizations are
1642 * performed. Comparison can be skipped if both files are
1643 * unchanged since their sha1s have already been compared.
1645 if (renormalize_buffer(path
, o
.buf
, o
.len
, &o
) |
1646 renormalize_buffer(path
, a
.buf
, a
.len
, &a
))
1647 ret
= (o
.len
== a
.len
&& !memcmp(o
.buf
, a
.buf
, o
.len
));
1655 static int handle_modify_delete(struct merge_options
*o
,
1657 struct object_id
*o_oid
, int o_mode
,
1658 struct object_id
*a_oid
, int a_mode
,
1659 struct object_id
*b_oid
, int b_mode
)
1661 return handle_change_delete(o
,
1666 _("modify"), _("modified"));
1669 static int merge_content(struct merge_options
*o
,
1671 struct object_id
*o_oid
, int o_mode
,
1672 struct object_id
*a_oid
, int a_mode
,
1673 struct object_id
*b_oid
, int b_mode
,
1674 struct rename_conflict_info
*rename_conflict_info
)
1676 const char *reason
= _("content");
1677 const char *path1
= NULL
, *path2
= NULL
;
1678 struct merge_file_info mfi
;
1679 struct diff_filespec one
, a
, b
;
1680 unsigned df_conflict_remains
= 0;
1683 reason
= _("add/add");
1684 o_oid
= (struct object_id
*)&null_oid
;
1686 one
.path
= a
.path
= b
.path
= (char *)path
;
1687 oidcpy(&one
.oid
, o_oid
);
1689 oidcpy(&a
.oid
, a_oid
);
1691 oidcpy(&b
.oid
, b_oid
);
1694 if (rename_conflict_info
) {
1695 struct diff_filepair
*pair1
= rename_conflict_info
->pair1
;
1697 path1
= (o
->branch1
== rename_conflict_info
->branch1
) ?
1698 pair1
->two
->path
: pair1
->one
->path
;
1699 /* If rename_conflict_info->pair2 != NULL, we are in
1700 * RENAME_ONE_FILE_TO_ONE case. Otherwise, we have a
1703 path2
= (rename_conflict_info
->pair2
||
1704 o
->branch2
== rename_conflict_info
->branch1
) ?
1705 pair1
->two
->path
: pair1
->one
->path
;
1707 if (dir_in_way(path
, !o
->call_depth
))
1708 df_conflict_remains
= 1;
1710 if (merge_file_special_markers(o
, &one
, &a
, &b
,
1712 o
->branch2
, path2
, &mfi
))
1715 if (mfi
.clean
&& !df_conflict_remains
&&
1716 oid_eq(&mfi
.oid
, a_oid
) && mfi
.mode
== a_mode
) {
1717 int path_renamed_outside_HEAD
;
1718 output(o
, 3, _("Skipped %s (merged same as existing)"), path
);
1720 * The content merge resulted in the same file contents we
1721 * already had. We can return early if those file contents
1722 * are recorded at the correct path (which may not be true
1723 * if the merge involves a rename).
1725 path_renamed_outside_HEAD
= !path2
|| !strcmp(path
, path2
);
1726 if (!path_renamed_outside_HEAD
) {
1727 add_cacheinfo(o
, mfi
.mode
, &mfi
.oid
, path
,
1728 0, (!o
->call_depth
), 0);
1732 output(o
, 2, _("Auto-merging %s"), path
);
1735 if (S_ISGITLINK(mfi
.mode
))
1736 reason
= _("submodule");
1737 output(o
, 1, _("CONFLICT (%s): Merge conflict in %s"),
1739 if (rename_conflict_info
&& !df_conflict_remains
)
1740 if (update_stages(o
, path
, &one
, &a
, &b
))
1744 if (df_conflict_remains
) {
1746 if (o
->call_depth
) {
1747 remove_file_from_cache(path
);
1750 if (update_stages(o
, path
, &one
, &a
, &b
))
1753 int file_from_stage2
= was_tracked(path
);
1754 struct diff_filespec merged
;
1755 oidcpy(&merged
.oid
, &mfi
.oid
);
1756 merged
.mode
= mfi
.mode
;
1758 if (update_stages(o
, path
, NULL
,
1759 file_from_stage2
? &merged
: NULL
,
1760 file_from_stage2
? NULL
: &merged
))
1765 new_path
= unique_path(o
, path
, rename_conflict_info
->branch1
);
1766 output(o
, 1, _("Adding as %s instead"), new_path
);
1767 if (update_file(o
, 0, &mfi
.oid
, mfi
.mode
, new_path
)) {
1773 } else if (update_file(o
, mfi
.clean
, &mfi
.oid
, mfi
.mode
, path
))
1778 /* Per entry merge function */
1779 static int process_entry(struct merge_options
*o
,
1780 const char *path
, struct stage_data
*entry
)
1782 int clean_merge
= 1;
1783 int normalize
= o
->renormalize
;
1784 unsigned o_mode
= entry
->stages
[1].mode
;
1785 unsigned a_mode
= entry
->stages
[2].mode
;
1786 unsigned b_mode
= entry
->stages
[3].mode
;
1787 struct object_id
*o_oid
= stage_oid(&entry
->stages
[1].oid
, o_mode
);
1788 struct object_id
*a_oid
= stage_oid(&entry
->stages
[2].oid
, a_mode
);
1789 struct object_id
*b_oid
= stage_oid(&entry
->stages
[3].oid
, b_mode
);
1791 entry
->processed
= 1;
1792 if (entry
->rename_conflict_info
) {
1793 struct rename_conflict_info
*conflict_info
= entry
->rename_conflict_info
;
1794 switch (conflict_info
->rename_type
) {
1796 case RENAME_ONE_FILE_TO_ONE
:
1797 clean_merge
= merge_content(o
, path
,
1798 o_oid
, o_mode
, a_oid
, a_mode
, b_oid
, b_mode
,
1803 if (conflict_rename_delete(o
,
1804 conflict_info
->pair1
,
1805 conflict_info
->branch1
,
1806 conflict_info
->branch2
))
1809 case RENAME_ONE_FILE_TO_TWO
:
1811 if (conflict_rename_rename_1to2(o
, conflict_info
))
1814 case RENAME_TWO_FILES_TO_ONE
:
1816 if (conflict_rename_rename_2to1(o
, conflict_info
))
1820 entry
->processed
= 0;
1823 } else if (o_oid
&& (!a_oid
|| !b_oid
)) {
1824 /* Case A: Deleted in one */
1825 if ((!a_oid
&& !b_oid
) ||
1826 (!b_oid
&& blob_unchanged(o
, o_oid
, o_mode
, a_oid
, a_mode
, normalize
, path
)) ||
1827 (!a_oid
&& blob_unchanged(o
, o_oid
, o_mode
, b_oid
, b_mode
, normalize
, path
))) {
1828 /* Deleted in both or deleted in one and
1829 * unchanged in the other */
1831 output(o
, 2, _("Removing %s"), path
);
1832 /* do not touch working file if it did not exist */
1833 remove_file(o
, 1, path
, !a_oid
);
1835 /* Modify/delete; deleted side may have put a directory in the way */
1837 if (handle_modify_delete(o
, path
, o_oid
, o_mode
,
1838 a_oid
, a_mode
, b_oid
, b_mode
))
1841 } else if ((!o_oid
&& a_oid
&& !b_oid
) ||
1842 (!o_oid
&& !a_oid
&& b_oid
)) {
1843 /* Case B: Added in one. */
1844 /* [nothing|directory] -> ([nothing|directory], file) */
1846 const char *add_branch
;
1847 const char *other_branch
;
1849 const struct object_id
*oid
;
1853 add_branch
= o
->branch1
;
1854 other_branch
= o
->branch2
;
1857 conf
= _("file/directory");
1859 add_branch
= o
->branch2
;
1860 other_branch
= o
->branch1
;
1863 conf
= _("directory/file");
1865 if (dir_in_way(path
, !o
->call_depth
)) {
1866 char *new_path
= unique_path(o
, path
, add_branch
);
1868 output(o
, 1, _("CONFLICT (%s): There is a directory with name %s in %s. "
1870 conf
, path
, other_branch
, path
, new_path
);
1871 if (update_file(o
, 0, oid
, mode
, new_path
))
1873 else if (o
->call_depth
)
1874 remove_file_from_cache(path
);
1877 output(o
, 2, _("Adding %s"), path
);
1878 /* do not overwrite file if already present */
1879 if (update_file_flags(o
, oid
, mode
, path
, 1, !a_oid
))
1882 } else if (a_oid
&& b_oid
) {
1883 /* Case C: Added in both (check for same permissions) and */
1884 /* case D: Modified in both, but differently. */
1885 clean_merge
= merge_content(o
, path
,
1886 o_oid
, o_mode
, a_oid
, a_mode
, b_oid
, b_mode
,
1888 } else if (!o_oid
&& !a_oid
&& !b_oid
) {
1890 * this entry was deleted altogether. a_mode == 0 means
1891 * we had that path and want to actively remove it.
1893 remove_file(o
, 1, path
, !a_mode
);
1895 die("BUG: fatal merge failure, shouldn't happen.");
1900 int merge_trees(struct merge_options
*o
,
1903 struct tree
*common
,
1904 struct tree
**result
)
1908 if (o
->subtree_shift
) {
1909 merge
= shift_tree_object(head
, merge
, o
->subtree_shift
);
1910 common
= shift_tree_object(head
, common
, o
->subtree_shift
);
1913 if (oid_eq(&common
->object
.oid
, &merge
->object
.oid
)) {
1914 output(o
, 0, _("Already up-to-date!"));
1919 code
= git_merge_trees(o
->call_depth
, common
, head
, merge
);
1922 if (show(o
, 4) || o
->call_depth
)
1923 err(o
, _("merging of trees %s and %s failed"),
1924 oid_to_hex(&head
->object
.oid
),
1925 oid_to_hex(&merge
->object
.oid
));
1929 if (unmerged_cache()) {
1930 struct string_list
*entries
, *re_head
, *re_merge
;
1932 string_list_clear(&o
->current_file_set
, 1);
1933 string_list_clear(&o
->current_directory_set
, 1);
1934 get_files_dirs(o
, head
);
1935 get_files_dirs(o
, merge
);
1937 entries
= get_unmerged();
1938 record_df_conflict_files(o
, entries
);
1939 re_head
= get_renames(o
, head
, common
, head
, merge
, entries
);
1940 re_merge
= get_renames(o
, merge
, common
, head
, merge
, entries
);
1941 clean
= process_renames(o
, re_head
, re_merge
);
1944 for (i
= entries
->nr
-1; 0 <= i
; i
--) {
1945 const char *path
= entries
->items
[i
].string
;
1946 struct stage_data
*e
= entries
->items
[i
].util
;
1947 if (!e
->processed
) {
1948 int ret
= process_entry(o
, path
, e
);
1955 for (i
= 0; i
< entries
->nr
; i
++) {
1956 struct stage_data
*e
= entries
->items
[i
].util
;
1958 die("BUG: unprocessed path??? %s",
1959 entries
->items
[i
].string
);
1962 string_list_clear(re_merge
, 0);
1963 string_list_clear(re_head
, 0);
1964 string_list_clear(entries
, 1);
1973 if (o
->call_depth
&& !(*result
= write_tree_from_memory(o
)))
1979 static struct commit_list
*reverse_commit_list(struct commit_list
*list
)
1981 struct commit_list
*next
= NULL
, *current
, *backup
;
1982 for (current
= list
; current
; current
= backup
) {
1983 backup
= current
->next
;
1984 current
->next
= next
;
1991 * Merge the commits h1 and h2, return the resulting virtual
1992 * commit object and a flag indicating the cleanness of the merge.
1994 int merge_recursive(struct merge_options
*o
,
1997 struct commit_list
*ca
,
1998 struct commit
**result
)
2000 struct commit_list
*iter
;
2001 struct commit
*merged_common_ancestors
;
2002 struct tree
*mrtree
= mrtree
;
2006 output(o
, 4, _("Merging:"));
2007 output_commit_title(o
, h1
);
2008 output_commit_title(o
, h2
);
2012 ca
= get_merge_bases(h1
, h2
);
2013 ca
= reverse_commit_list(ca
);
2017 unsigned cnt
= commit_list_count(ca
);
2019 output(o
, 5, Q_("found %u common ancestor:",
2020 "found %u common ancestors:", cnt
), cnt
);
2021 for (iter
= ca
; iter
; iter
= iter
->next
)
2022 output_commit_title(o
, iter
->item
);
2025 merged_common_ancestors
= pop_commit(&ca
);
2026 if (merged_common_ancestors
== NULL
) {
2027 /* if there is no common ancestor, use an empty tree */
2030 tree
= lookup_tree(EMPTY_TREE_SHA1_BIN
);
2031 merged_common_ancestors
= make_virtual_commit(tree
, "ancestor");
2034 for (iter
= ca
; iter
; iter
= iter
->next
) {
2035 const char *saved_b1
, *saved_b2
;
2038 * When the merge fails, the result contains files
2039 * with conflict markers. The cleanness flag is
2040 * ignored (unless indicating an error), it was never
2041 * actually used, as result of merge_trees has always
2042 * overwritten it: the committed "conflicts" were
2046 saved_b1
= o
->branch1
;
2047 saved_b2
= o
->branch2
;
2048 o
->branch1
= "Temporary merge branch 1";
2049 o
->branch2
= "Temporary merge branch 2";
2050 if (merge_recursive(o
, merged_common_ancestors
, iter
->item
,
2051 NULL
, &merged_common_ancestors
) < 0)
2053 o
->branch1
= saved_b1
;
2054 o
->branch2
= saved_b2
;
2057 if (!merged_common_ancestors
)
2058 return err(o
, _("merge returned no commit"));
2065 o
->ancestor
= "merged common ancestors";
2066 clean
= merge_trees(o
, h1
->tree
, h2
->tree
, merged_common_ancestors
->tree
,
2073 if (o
->call_depth
) {
2074 *result
= make_virtual_commit(mrtree
, "merged tree");
2075 commit_list_insert(h1
, &(*result
)->parents
);
2076 commit_list_insert(h2
, &(*result
)->parents
->next
);
2079 if (!o
->call_depth
&& o
->buffer_output
< 2)
2080 strbuf_release(&o
->obuf
);
2082 diff_warn_rename_limit("merge.renamelimit",
2083 o
->needed_rename_limit
, 0);
2087 static struct commit
*get_ref(const struct object_id
*oid
, const char *name
)
2089 struct object
*object
;
2091 object
= deref_tag(parse_object(oid
->hash
), name
, strlen(name
));
2094 if (object
->type
== OBJ_TREE
)
2095 return make_virtual_commit((struct tree
*)object
, name
);
2096 if (object
->type
!= OBJ_COMMIT
)
2098 if (parse_commit((struct commit
*)object
))
2100 return (struct commit
*)object
;
2103 int merge_recursive_generic(struct merge_options
*o
,
2104 const struct object_id
*head
,
2105 const struct object_id
*merge
,
2107 const struct object_id
**base_list
,
2108 struct commit
**result
)
2111 struct lock_file
*lock
= xcalloc(1, sizeof(struct lock_file
));
2112 struct commit
*head_commit
= get_ref(head
, o
->branch1
);
2113 struct commit
*next_commit
= get_ref(merge
, o
->branch2
);
2114 struct commit_list
*ca
= NULL
;
2118 for (i
= 0; i
< num_base_list
; ++i
) {
2119 struct commit
*base
;
2120 if (!(base
= get_ref(base_list
[i
], oid_to_hex(base_list
[i
]))))
2121 return err(o
, _("Could not parse object '%s'"),
2122 oid_to_hex(base_list
[i
]));
2123 commit_list_insert(base
, &ca
);
2127 hold_locked_index(lock
, 1);
2128 clean
= merge_recursive(o
, head_commit
, next_commit
, ca
,
2133 if (active_cache_changed
&&
2134 write_locked_index(&the_index
, lock
, COMMIT_LOCK
))
2135 return err(o
, _("Unable to write index."));
2137 return clean
? 0 : 1;
2140 static void merge_recursive_config(struct merge_options
*o
)
2142 git_config_get_int("merge.verbosity", &o
->verbosity
);
2143 git_config_get_int("diff.renamelimit", &o
->diff_rename_limit
);
2144 git_config_get_int("merge.renamelimit", &o
->merge_rename_limit
);
2145 git_config(git_xmerge_config
, NULL
);
2148 void init_merge_options(struct merge_options
*o
)
2150 memset(o
, 0, sizeof(struct merge_options
));
2152 o
->buffer_output
= 1;
2153 o
->diff_rename_limit
= -1;
2154 o
->merge_rename_limit
= -1;
2156 o
->detect_rename
= 1;
2157 merge_recursive_config(o
);
2158 if (getenv("GIT_MERGE_VERBOSITY"))
2160 strtol(getenv("GIT_MERGE_VERBOSITY"), NULL
, 10);
2161 if (o
->verbosity
>= 5)
2162 o
->buffer_output
= 0;
2163 strbuf_init(&o
->obuf
, 0);
2164 string_list_init(&o
->current_file_set
, 1);
2165 string_list_init(&o
->current_directory_set
, 1);
2166 string_list_init(&o
->df_conflict_file_set
, 1);
2169 int parse_merge_opt(struct merge_options
*o
, const char *s
)
2175 if (!strcmp(s
, "ours"))
2176 o
->recursive_variant
= MERGE_RECURSIVE_OURS
;
2177 else if (!strcmp(s
, "theirs"))
2178 o
->recursive_variant
= MERGE_RECURSIVE_THEIRS
;
2179 else if (!strcmp(s
, "subtree"))
2180 o
->subtree_shift
= "";
2181 else if (skip_prefix(s
, "subtree=", &arg
))
2182 o
->subtree_shift
= arg
;
2183 else if (!strcmp(s
, "patience"))
2184 o
->xdl_opts
= DIFF_WITH_ALG(o
, PATIENCE_DIFF
);
2185 else if (!strcmp(s
, "histogram"))
2186 o
->xdl_opts
= DIFF_WITH_ALG(o
, HISTOGRAM_DIFF
);
2187 else if (skip_prefix(s
, "diff-algorithm=", &arg
)) {
2188 long value
= parse_algorithm_value(arg
);
2191 /* clear out previous settings */
2192 DIFF_XDL_CLR(o
, NEED_MINIMAL
);
2193 o
->xdl_opts
&= ~XDF_DIFF_ALGORITHM_MASK
;
2194 o
->xdl_opts
|= value
;
2196 else if (!strcmp(s
, "ignore-space-change"))
2197 o
->xdl_opts
|= XDF_IGNORE_WHITESPACE_CHANGE
;
2198 else if (!strcmp(s
, "ignore-all-space"))
2199 o
->xdl_opts
|= XDF_IGNORE_WHITESPACE
;
2200 else if (!strcmp(s
, "ignore-space-at-eol"))
2201 o
->xdl_opts
|= XDF_IGNORE_WHITESPACE_AT_EOL
;
2202 else if (!strcmp(s
, "renormalize"))
2204 else if (!strcmp(s
, "no-renormalize"))
2206 else if (!strcmp(s
, "no-renames"))
2207 o
->detect_rename
= 0;
2208 else if (!strcmp(s
, "find-renames")) {
2209 o
->detect_rename
= 1;
2210 o
->rename_score
= 0;
2212 else if (skip_prefix(s
, "find-renames=", &arg
) ||
2213 skip_prefix(s
, "rename-threshold=", &arg
)) {
2214 if ((o
->rename_score
= parse_rename_score(&arg
)) == -1 || *arg
!= 0)
2216 o
->detect_rename
= 1;