2 * Recursive Merge algorithm stolen from git-merge-recursive.py by
4 * The thieves were Alex Riesen and Johannes Schindelin, in June/July 2006
10 #include "cache-tree.h"
14 #include "tree-walk.h"
18 #include "unpack-trees.h"
19 #include "string-list.h"
20 #include "xdiff-interface.h"
23 #include "merge-recursive.h"
25 #include "submodule.h"
27 struct path_hashmap_entry
{
28 struct hashmap_entry e
;
29 char path
[FLEX_ARRAY
];
32 static int path_hashmap_cmp(const void *cmp_data
,
34 const void *entry_or_key
,
37 const struct path_hashmap_entry
*a
= entry
;
38 const struct path_hashmap_entry
*b
= entry_or_key
;
39 const char *key
= keydata
;
42 return strcasecmp(a
->path
, key
? key
: b
->path
);
44 return strcmp(a
->path
, key
? key
: b
->path
);
47 static unsigned int path_hash(const char *path
)
49 return ignore_case
? strihash(path
) : strhash(path
);
52 static void flush_output(struct merge_options
*o
)
54 if (o
->buffer_output
< 2 && o
->obuf
.len
) {
55 fputs(o
->obuf
.buf
, stdout
);
56 strbuf_reset(&o
->obuf
);
60 static int err(struct merge_options
*o
, const char *err
, ...)
64 if (o
->buffer_output
< 2)
67 strbuf_complete(&o
->obuf
, '\n');
68 strbuf_addstr(&o
->obuf
, "error: ");
70 va_start(params
, err
);
71 strbuf_vaddf(&o
->obuf
, err
, params
);
73 if (o
->buffer_output
> 1)
74 strbuf_addch(&o
->obuf
, '\n');
76 error("%s", o
->obuf
.buf
);
77 strbuf_reset(&o
->obuf
);
83 static struct tree
*shift_tree_object(struct tree
*one
, struct tree
*two
,
84 const char *subtree_shift
)
86 struct object_id shifted
;
88 if (!*subtree_shift
) {
89 shift_tree(&one
->object
.oid
, &two
->object
.oid
, &shifted
, 0);
91 shift_tree_by(&one
->object
.oid
, &two
->object
.oid
, &shifted
,
94 if (!oidcmp(&two
->object
.oid
, &shifted
))
96 return lookup_tree(&shifted
);
99 static struct commit
*make_virtual_commit(struct tree
*tree
, const char *comment
)
101 struct commit
*commit
= alloc_commit_node(the_repository
);
103 set_merge_remote_desc(commit
, comment
, (struct object
*)commit
);
105 commit
->object
.parsed
= 1;
110 * Since we use get_tree_entry(), which does not put the read object into
111 * the object pool, we cannot rely on a == b.
113 static int oid_eq(const struct object_id
*a
, const struct object_id
*b
)
117 return a
&& b
&& oidcmp(a
, b
) == 0;
123 RENAME_ONE_FILE_TO_ONE
,
124 RENAME_ONE_FILE_TO_TWO
,
125 RENAME_TWO_FILES_TO_ONE
128 struct rename_conflict_info
{
129 enum rename_type rename_type
;
130 struct diff_filepair
*pair1
;
131 struct diff_filepair
*pair2
;
134 struct stage_data
*dst_entry1
;
135 struct stage_data
*dst_entry2
;
136 struct diff_filespec ren1_other
;
137 struct diff_filespec ren2_other
;
141 * Since we want to write the index eventually, we cannot reuse the index
142 * for these (temporary) data.
147 struct object_id oid
;
149 struct rename_conflict_info
*rename_conflict_info
;
150 unsigned processed
:1;
153 static inline void setup_rename_conflict_info(enum rename_type rename_type
,
154 struct diff_filepair
*pair1
,
155 struct diff_filepair
*pair2
,
158 struct stage_data
*dst_entry1
,
159 struct stage_data
*dst_entry2
,
160 struct merge_options
*o
,
161 struct stage_data
*src_entry1
,
162 struct stage_data
*src_entry2
)
164 struct rename_conflict_info
*ci
= xcalloc(1, sizeof(struct rename_conflict_info
));
165 ci
->rename_type
= rename_type
;
167 ci
->branch1
= branch1
;
168 ci
->branch2
= branch2
;
170 ci
->dst_entry1
= dst_entry1
;
171 dst_entry1
->rename_conflict_info
= ci
;
172 dst_entry1
->processed
= 0;
174 assert(!pair2
== !dst_entry2
);
176 ci
->dst_entry2
= dst_entry2
;
178 dst_entry2
->rename_conflict_info
= ci
;
181 if (rename_type
== RENAME_TWO_FILES_TO_ONE
) {
183 * For each rename, there could have been
184 * modifications on the side of history where that
185 * file was not renamed.
187 int ostage1
= o
->branch1
== branch1
? 3 : 2;
188 int ostage2
= ostage1
^ 1;
190 ci
->ren1_other
.path
= pair1
->one
->path
;
191 oidcpy(&ci
->ren1_other
.oid
, &src_entry1
->stages
[ostage1
].oid
);
192 ci
->ren1_other
.mode
= src_entry1
->stages
[ostage1
].mode
;
194 ci
->ren2_other
.path
= pair2
->one
->path
;
195 oidcpy(&ci
->ren2_other
.oid
, &src_entry2
->stages
[ostage2
].oid
);
196 ci
->ren2_other
.mode
= src_entry2
->stages
[ostage2
].mode
;
200 static int show(struct merge_options
*o
, int v
)
202 return (!o
->call_depth
&& o
->verbosity
>= v
) || o
->verbosity
>= 5;
205 __attribute__((format (printf
, 3, 4)))
206 static void output(struct merge_options
*o
, int v
, const char *fmt
, ...)
213 strbuf_addchars(&o
->obuf
, ' ', o
->call_depth
* 2);
216 strbuf_vaddf(&o
->obuf
, fmt
, ap
);
219 strbuf_addch(&o
->obuf
, '\n');
220 if (!o
->buffer_output
)
224 static void output_commit_title(struct merge_options
*o
, struct commit
*commit
)
226 strbuf_addchars(&o
->obuf
, ' ', o
->call_depth
* 2);
228 strbuf_addf(&o
->obuf
, "virtual %s\n",
229 merge_remote_util(commit
)->name
);
231 strbuf_add_unique_abbrev(&o
->obuf
, &commit
->object
.oid
,
233 strbuf_addch(&o
->obuf
, ' ');
234 if (parse_commit(commit
) != 0)
235 strbuf_addstr(&o
->obuf
, _("(bad commit)\n"));
238 const char *msg
= get_commit_buffer(commit
, NULL
);
239 int len
= find_commit_subject(msg
, &title
);
241 strbuf_addf(&o
->obuf
, "%.*s\n", len
, title
);
242 unuse_commit_buffer(commit
, msg
);
248 static int add_cacheinfo(struct merge_options
*o
,
249 unsigned int mode
, const struct object_id
*oid
,
250 const char *path
, int stage
, int refresh
, int options
)
252 struct cache_entry
*ce
;
255 ce
= make_cache_entry(mode
, oid
? oid
->hash
: null_sha1
, path
, stage
, 0);
257 return err(o
, _("addinfo_cache failed for path '%s'"), path
);
259 ret
= add_cache_entry(ce
, options
);
261 struct cache_entry
*nce
;
263 nce
= refresh_cache_entry(ce
, CE_MATCH_REFRESH
| CE_MATCH_IGNORE_MISSING
);
265 return err(o
, _("addinfo_cache failed for path '%s'"), path
);
267 ret
= add_cache_entry(nce
, options
);
272 static void init_tree_desc_from_tree(struct tree_desc
*desc
, struct tree
*tree
)
275 init_tree_desc(desc
, tree
->buffer
, tree
->size
);
278 static int git_merge_trees(int index_only
,
284 struct tree_desc t
[3];
285 struct unpack_trees_options opts
;
287 memset(&opts
, 0, sizeof(opts
));
294 opts
.fn
= threeway_merge
;
295 opts
.src_index
= &the_index
;
296 opts
.dst_index
= &the_index
;
297 setup_unpack_trees_porcelain(&opts
, "merge");
299 init_tree_desc_from_tree(t
+0, common
);
300 init_tree_desc_from_tree(t
+1, head
);
301 init_tree_desc_from_tree(t
+2, merge
);
303 rc
= unpack_trees(3, t
, &opts
);
304 cache_tree_free(&active_cache_tree
);
308 struct tree
*write_tree_from_memory(struct merge_options
*o
)
310 struct tree
*result
= NULL
;
312 if (unmerged_cache()) {
314 fprintf(stderr
, "BUG: There are unmerged index entries:\n");
315 for (i
= 0; i
< active_nr
; i
++) {
316 const struct cache_entry
*ce
= active_cache
[i
];
318 fprintf(stderr
, "BUG: %d %.*s\n", ce_stage(ce
),
319 (int)ce_namelen(ce
), ce
->name
);
321 die("BUG: unmerged index entries in merge-recursive.c");
324 if (!active_cache_tree
)
325 active_cache_tree
= cache_tree();
327 if (!cache_tree_fully_valid(active_cache_tree
) &&
328 cache_tree_update(&the_index
, 0) < 0) {
329 err(o
, _("error building trees"));
333 result
= lookup_tree(&active_cache_tree
->oid
);
338 static int save_files_dirs(const struct object_id
*oid
,
339 struct strbuf
*base
, const char *path
,
340 unsigned int mode
, int stage
, void *context
)
342 struct path_hashmap_entry
*entry
;
343 int baselen
= base
->len
;
344 struct merge_options
*o
= context
;
346 strbuf_addstr(base
, path
);
348 FLEX_ALLOC_MEM(entry
, path
, base
->buf
, base
->len
);
349 hashmap_entry_init(entry
, path_hash(entry
->path
));
350 hashmap_add(&o
->current_file_dir_set
, entry
);
352 strbuf_setlen(base
, baselen
);
353 return (S_ISDIR(mode
) ? READ_TREE_RECURSIVE
: 0);
356 static void get_files_dirs(struct merge_options
*o
, struct tree
*tree
)
358 struct pathspec match_all
;
359 memset(&match_all
, 0, sizeof(match_all
));
360 read_tree_recursive(tree
, "", 0, 0, &match_all
, save_files_dirs
, o
);
364 * Returns an index_entry instance which doesn't have to correspond to
365 * a real cache entry in Git's index.
367 static struct stage_data
*insert_stage_data(const char *path
,
368 struct tree
*o
, struct tree
*a
, struct tree
*b
,
369 struct string_list
*entries
)
371 struct string_list_item
*item
;
372 struct stage_data
*e
= xcalloc(1, sizeof(struct stage_data
));
373 get_tree_entry(&o
->object
.oid
, path
,
374 &e
->stages
[1].oid
, &e
->stages
[1].mode
);
375 get_tree_entry(&a
->object
.oid
, path
,
376 &e
->stages
[2].oid
, &e
->stages
[2].mode
);
377 get_tree_entry(&b
->object
.oid
, path
,
378 &e
->stages
[3].oid
, &e
->stages
[3].mode
);
379 item
= string_list_insert(entries
, path
);
385 * Create a dictionary mapping file names to stage_data objects. The
386 * dictionary contains one entry for every path with a non-zero stage entry.
388 static struct string_list
*get_unmerged(void)
390 struct string_list
*unmerged
= xcalloc(1, sizeof(struct string_list
));
393 unmerged
->strdup_strings
= 1;
395 for (i
= 0; i
< active_nr
; i
++) {
396 struct string_list_item
*item
;
397 struct stage_data
*e
;
398 const struct cache_entry
*ce
= active_cache
[i
];
402 item
= string_list_lookup(unmerged
, ce
->name
);
404 item
= string_list_insert(unmerged
, ce
->name
);
405 item
->util
= xcalloc(1, sizeof(struct stage_data
));
408 e
->stages
[ce_stage(ce
)].mode
= ce
->ce_mode
;
409 oidcpy(&e
->stages
[ce_stage(ce
)].oid
, &ce
->oid
);
415 static int string_list_df_name_compare(const char *one
, const char *two
)
417 int onelen
= strlen(one
);
418 int twolen
= strlen(two
);
420 * Here we only care that entries for D/F conflicts are
421 * adjacent, in particular with the file of the D/F conflict
422 * appearing before files below the corresponding directory.
423 * The order of the rest of the list is irrelevant for us.
425 * To achieve this, we sort with df_name_compare and provide
426 * the mode S_IFDIR so that D/F conflicts will sort correctly.
427 * We use the mode S_IFDIR for everything else for simplicity,
428 * since in other cases any changes in their order due to
429 * sorting cause no problems for us.
431 int cmp
= df_name_compare(one
, onelen
, S_IFDIR
,
432 two
, twolen
, S_IFDIR
);
434 * Now that 'foo' and 'foo/bar' compare equal, we have to make sure
435 * that 'foo' comes before 'foo/bar'.
439 return onelen
- twolen
;
442 static void record_df_conflict_files(struct merge_options
*o
,
443 struct string_list
*entries
)
445 /* If there is a D/F conflict and the file for such a conflict
446 * currently exist in the working tree, we want to allow it to be
447 * removed to make room for the corresponding directory if needed.
448 * The files underneath the directories of such D/F conflicts will
449 * be processed before the corresponding file involved in the D/F
450 * conflict. If the D/F directory ends up being removed by the
451 * merge, then we won't have to touch the D/F file. If the D/F
452 * directory needs to be written to the working copy, then the D/F
453 * file will simply be removed (in make_room_for_path()) to make
454 * room for the necessary paths. Note that if both the directory
455 * and the file need to be present, then the D/F file will be
456 * reinstated with a new unique name at the time it is processed.
458 struct string_list df_sorted_entries
= STRING_LIST_INIT_NODUP
;
459 const char *last_file
= NULL
;
464 * If we're merging merge-bases, we don't want to bother with
465 * any working directory changes.
470 /* Ensure D/F conflicts are adjacent in the entries list. */
471 for (i
= 0; i
< entries
->nr
; i
++) {
472 struct string_list_item
*next
= &entries
->items
[i
];
473 string_list_append(&df_sorted_entries
, next
->string
)->util
=
476 df_sorted_entries
.cmp
= string_list_df_name_compare
;
477 string_list_sort(&df_sorted_entries
);
479 string_list_clear(&o
->df_conflict_file_set
, 1);
480 for (i
= 0; i
< df_sorted_entries
.nr
; i
++) {
481 const char *path
= df_sorted_entries
.items
[i
].string
;
482 int len
= strlen(path
);
483 struct stage_data
*e
= df_sorted_entries
.items
[i
].util
;
486 * Check if last_file & path correspond to a D/F conflict;
487 * i.e. whether path is last_file+'/'+<something>.
488 * If so, record that it's okay to remove last_file to make
489 * room for path and friends if needed.
493 memcmp(path
, last_file
, last_len
) == 0 &&
494 path
[last_len
] == '/') {
495 string_list_insert(&o
->df_conflict_file_set
, last_file
);
499 * Determine whether path could exist as a file in the
500 * working directory as a possible D/F conflict. This
501 * will only occur when it exists in stage 2 as a
504 if (S_ISREG(e
->stages
[2].mode
) || S_ISLNK(e
->stages
[2].mode
)) {
511 string_list_clear(&df_sorted_entries
, 0);
515 struct diff_filepair
*pair
;
517 * Purpose of src_entry and dst_entry:
519 * If 'before' is renamed to 'after' then src_entry will contain
520 * the versions of 'before' from the merge_base, HEAD, and MERGE in
521 * stages 1, 2, and 3; dst_entry will contain the respective
522 * versions of 'after' in corresponding locations. Thus, we have a
523 * total of six modes and oids, though some will be null. (Stage 0
524 * is ignored; we're interested in handling conflicts.)
526 * Since we don't turn on break-rewrites by default, neither
527 * src_entry nor dst_entry can have all three of their stages have
528 * non-null oids, meaning at most four of the six will be non-null.
529 * Also, since this is a rename, both src_entry and dst_entry will
530 * have at least one non-null oid, meaning at least two will be
531 * non-null. Of the six oids, a typical rename will have three be
532 * non-null. Only two implies a rename/delete, and four implies a
535 struct stage_data
*src_entry
;
536 struct stage_data
*dst_entry
;
537 unsigned processed
:1;
541 * Get information of all renames which occurred between 'o_tree' and
542 * 'tree'. We need the three trees in the merge ('o_tree', 'a_tree' and
543 * 'b_tree') to be able to associate the correct cache entries with
544 * the rename information. 'tree' is always equal to either a_tree or b_tree.
546 static struct string_list
*get_renames(struct merge_options
*o
,
551 struct string_list
*entries
)
554 struct string_list
*renames
;
555 struct diff_options opts
;
557 renames
= xcalloc(1, sizeof(struct string_list
));
558 if (!o
->detect_rename
)
562 opts
.flags
.recursive
= 1;
563 opts
.flags
.rename_empty
= 0;
564 opts
.detect_rename
= DIFF_DETECT_RENAME
;
565 opts
.rename_limit
= o
->merge_rename_limit
>= 0 ? o
->merge_rename_limit
:
566 o
->diff_rename_limit
>= 0 ? o
->diff_rename_limit
:
568 opts
.rename_score
= o
->rename_score
;
569 opts
.show_rename_progress
= o
->show_rename_progress
;
570 opts
.output_format
= DIFF_FORMAT_NO_OUTPUT
;
571 diff_setup_done(&opts
);
572 diff_tree_oid(&o_tree
->object
.oid
, &tree
->object
.oid
, "", &opts
);
574 if (opts
.needed_rename_limit
> o
->needed_rename_limit
)
575 o
->needed_rename_limit
= opts
.needed_rename_limit
;
576 for (i
= 0; i
< diff_queued_diff
.nr
; ++i
) {
577 struct string_list_item
*item
;
579 struct diff_filepair
*pair
= diff_queued_diff
.queue
[i
];
580 if (pair
->status
!= 'R') {
581 diff_free_filepair(pair
);
584 re
= xmalloc(sizeof(*re
));
587 item
= string_list_lookup(entries
, re
->pair
->one
->path
);
589 re
->src_entry
= insert_stage_data(re
->pair
->one
->path
,
590 o_tree
, a_tree
, b_tree
, entries
);
592 re
->src_entry
= item
->util
;
594 item
= string_list_lookup(entries
, re
->pair
->two
->path
);
596 re
->dst_entry
= insert_stage_data(re
->pair
->two
->path
,
597 o_tree
, a_tree
, b_tree
, entries
);
599 re
->dst_entry
= item
->util
;
600 item
= string_list_insert(renames
, pair
->one
->path
);
603 opts
.output_format
= DIFF_FORMAT_NO_OUTPUT
;
604 diff_queued_diff
.nr
= 0;
609 static int update_stages(struct merge_options
*opt
, const char *path
,
610 const struct diff_filespec
*o
,
611 const struct diff_filespec
*a
,
612 const struct diff_filespec
*b
)
616 * NOTE: It is usually a bad idea to call update_stages on a path
617 * before calling update_file on that same path, since it can
618 * sometimes lead to spurious "refusing to lose untracked file..."
619 * messages from update_file (via make_room_for path via
620 * would_lose_untracked). Instead, reverse the order of the calls
621 * (executing update_file first and then update_stages).
624 int options
= ADD_CACHE_OK_TO_ADD
| ADD_CACHE_SKIP_DFCHECK
;
626 if (remove_file_from_cache(path
))
629 if (add_cacheinfo(opt
, o
->mode
, &o
->oid
, path
, 1, 0, options
))
632 if (add_cacheinfo(opt
, a
->mode
, &a
->oid
, path
, 2, 0, options
))
635 if (add_cacheinfo(opt
, b
->mode
, &b
->oid
, path
, 3, 0, options
))
640 static void update_entry(struct stage_data
*entry
,
641 struct diff_filespec
*o
,
642 struct diff_filespec
*a
,
643 struct diff_filespec
*b
)
645 entry
->processed
= 0;
646 entry
->stages
[1].mode
= o
->mode
;
647 entry
->stages
[2].mode
= a
->mode
;
648 entry
->stages
[3].mode
= b
->mode
;
649 oidcpy(&entry
->stages
[1].oid
, &o
->oid
);
650 oidcpy(&entry
->stages
[2].oid
, &a
->oid
);
651 oidcpy(&entry
->stages
[3].oid
, &b
->oid
);
654 static int remove_file(struct merge_options
*o
, int clean
,
655 const char *path
, int no_wd
)
657 int update_cache
= o
->call_depth
|| clean
;
658 int update_working_directory
= !o
->call_depth
&& !no_wd
;
661 if (remove_file_from_cache(path
))
664 if (update_working_directory
) {
666 struct cache_entry
*ce
;
667 ce
= cache_file_exists(path
, strlen(path
), ignore_case
);
668 if (ce
&& ce_stage(ce
) == 0 && strcmp(path
, ce
->name
))
671 if (remove_path(path
))
677 /* add a string to a strbuf, but converting "/" to "_" */
678 static void add_flattened_path(struct strbuf
*out
, const char *s
)
681 strbuf_addstr(out
, s
);
682 for (; i
< out
->len
; i
++)
683 if (out
->buf
[i
] == '/')
687 static char *unique_path(struct merge_options
*o
, const char *path
, const char *branch
)
689 struct path_hashmap_entry
*entry
;
690 struct strbuf newpath
= STRBUF_INIT
;
694 strbuf_addf(&newpath
, "%s~", path
);
695 add_flattened_path(&newpath
, branch
);
697 base_len
= newpath
.len
;
698 while (hashmap_get_from_hash(&o
->current_file_dir_set
,
699 path_hash(newpath
.buf
), newpath
.buf
) ||
700 (!o
->call_depth
&& file_exists(newpath
.buf
))) {
701 strbuf_setlen(&newpath
, base_len
);
702 strbuf_addf(&newpath
, "_%d", suffix
++);
705 FLEX_ALLOC_MEM(entry
, path
, newpath
.buf
, newpath
.len
);
706 hashmap_entry_init(entry
, path_hash(entry
->path
));
707 hashmap_add(&o
->current_file_dir_set
, entry
);
708 return strbuf_detach(&newpath
, NULL
);
712 * Check whether a directory in the index is in the way of an incoming
713 * file. Return 1 if so. If check_working_copy is non-zero, also
714 * check the working directory. If empty_ok is non-zero, also return
715 * 0 in the case where the working-tree dir exists but is empty.
717 static int dir_in_way(const char *path
, int check_working_copy
, int empty_ok
)
720 struct strbuf dirpath
= STRBUF_INIT
;
723 strbuf_addstr(&dirpath
, path
);
724 strbuf_addch(&dirpath
, '/');
726 pos
= cache_name_pos(dirpath
.buf
, dirpath
.len
);
730 if (pos
< active_nr
&&
731 !strncmp(dirpath
.buf
, active_cache
[pos
]->name
, dirpath
.len
)) {
732 strbuf_release(&dirpath
);
736 strbuf_release(&dirpath
);
737 return check_working_copy
&& !lstat(path
, &st
) && S_ISDIR(st
.st_mode
) &&
738 !(empty_ok
&& is_empty_dir(path
));
741 static int was_tracked(const char *path
)
743 int pos
= cache_name_pos(path
, strlen(path
));
746 /* we have been tracking this path */
750 * Look for an unmerged entry for the path,
751 * specifically stage #2, which would indicate
752 * that "our" side before the merge started
753 * had the path tracked (and resulted in a conflict).
756 pos
< active_nr
&& !strcmp(path
, active_cache
[pos
]->name
);
758 if (ce_stage(active_cache
[pos
]) == 2)
763 static int would_lose_untracked(const char *path
)
765 return !was_tracked(path
) && file_exists(path
);
768 static int make_room_for_path(struct merge_options
*o
, const char *path
)
771 const char *msg
= _("failed to create path '%s'%s");
773 /* Unlink any D/F conflict files that are in the way */
774 for (i
= 0; i
< o
->df_conflict_file_set
.nr
; i
++) {
775 const char *df_path
= o
->df_conflict_file_set
.items
[i
].string
;
776 size_t pathlen
= strlen(path
);
777 size_t df_pathlen
= strlen(df_path
);
778 if (df_pathlen
< pathlen
&&
779 path
[df_pathlen
] == '/' &&
780 strncmp(path
, df_path
, df_pathlen
) == 0) {
782 _("Removing %s to make room for subdirectory\n"),
785 unsorted_string_list_delete_item(&o
->df_conflict_file_set
,
791 /* Make sure leading directories are created */
792 status
= safe_create_leading_directories_const(path
);
794 if (status
== SCLD_EXISTS
)
795 /* something else exists */
796 return err(o
, msg
, path
, _(": perhaps a D/F conflict?"));
797 return err(o
, msg
, path
, "");
801 * Do not unlink a file in the work tree if we are not
804 if (would_lose_untracked(path
))
805 return err(o
, _("refusing to lose untracked file at '%s'"),
808 /* Successful unlink is good.. */
811 /* .. and so is no existing file */
814 /* .. but not some other error (who really cares what?) */
815 return err(o
, msg
, path
, _(": perhaps a D/F conflict?"));
818 static int update_file_flags(struct merge_options
*o
,
819 const struct object_id
*oid
,
831 enum object_type type
;
835 if (S_ISGITLINK(mode
)) {
837 * We may later decide to recursively descend into
838 * the submodule directory and update its index
839 * and/or work tree, but we do not do that now.
845 buf
= read_object_file(oid
, &type
, &size
);
847 return err(o
, _("cannot read object %s '%s'"), oid_to_hex(oid
), path
);
848 if (type
!= OBJ_BLOB
) {
849 ret
= err(o
, _("blob expected for %s '%s'"), oid_to_hex(oid
), path
);
853 struct strbuf strbuf
= STRBUF_INIT
;
854 if (convert_to_working_tree(path
, buf
, size
, &strbuf
)) {
857 buf
= strbuf_detach(&strbuf
, NULL
);
861 if (make_room_for_path(o
, path
) < 0) {
865 if (S_ISREG(mode
) || (!has_symlinks
&& S_ISLNK(mode
))) {
871 fd
= open(path
, O_WRONLY
| O_TRUNC
| O_CREAT
, mode
);
873 ret
= err(o
, _("failed to open '%s': %s"),
874 path
, strerror(errno
));
877 write_in_full(fd
, buf
, size
);
879 } else if (S_ISLNK(mode
)) {
880 char *lnk
= xmemdupz(buf
, size
);
881 safe_create_leading_directories_const(path
);
883 if (symlink(lnk
, path
))
884 ret
= err(o
, _("failed to symlink '%s': %s"),
885 path
, strerror(errno
));
889 _("do not know what to do with %06o %s '%s'"),
890 mode
, oid_to_hex(oid
), path
);
895 if (!ret
&& update_cache
)
896 add_cacheinfo(o
, mode
, oid
, path
, 0, update_wd
, ADD_CACHE_OK_TO_ADD
);
900 static int update_file(struct merge_options
*o
,
902 const struct object_id
*oid
,
906 return update_file_flags(o
, oid
, mode
, path
, o
->call_depth
|| clean
, !o
->call_depth
);
909 /* Low level file merging, update and removal */
911 struct merge_file_info
{
912 struct object_id oid
;
918 static int merge_3way(struct merge_options
*o
,
919 mmbuffer_t
*result_buf
,
920 const struct diff_filespec
*one
,
921 const struct diff_filespec
*a
,
922 const struct diff_filespec
*b
,
926 mmfile_t orig
, src1
, src2
;
927 struct ll_merge_options ll_opts
= {0};
928 char *base_name
, *name1
, *name2
;
931 ll_opts
.renormalize
= o
->renormalize
;
932 ll_opts
.xdl_opts
= o
->xdl_opts
;
935 ll_opts
.virtual_ancestor
= 1;
938 switch (o
->recursive_variant
) {
939 case MERGE_RECURSIVE_OURS
:
940 ll_opts
.variant
= XDL_MERGE_FAVOR_OURS
;
942 case MERGE_RECURSIVE_THEIRS
:
943 ll_opts
.variant
= XDL_MERGE_FAVOR_THEIRS
;
951 if (strcmp(a
->path
, b
->path
) ||
952 (o
->ancestor
!= NULL
&& strcmp(a
->path
, one
->path
) != 0)) {
953 base_name
= o
->ancestor
== NULL
? NULL
:
954 mkpathdup("%s:%s", o
->ancestor
, one
->path
);
955 name1
= mkpathdup("%s:%s", branch1
, a
->path
);
956 name2
= mkpathdup("%s:%s", branch2
, b
->path
);
958 base_name
= o
->ancestor
== NULL
? NULL
:
959 mkpathdup("%s", o
->ancestor
);
960 name1
= mkpathdup("%s", branch1
);
961 name2
= mkpathdup("%s", branch2
);
964 read_mmblob(&orig
, &one
->oid
);
965 read_mmblob(&src1
, &a
->oid
);
966 read_mmblob(&src2
, &b
->oid
);
968 merge_status
= ll_merge(result_buf
, a
->path
, &orig
, base_name
,
969 &src1
, name1
, &src2
, name2
, &ll_opts
);
980 static int merge_file_1(struct merge_options
*o
,
981 const struct diff_filespec
*one
,
982 const struct diff_filespec
*a
,
983 const struct diff_filespec
*b
,
986 struct merge_file_info
*result
)
991 if ((S_IFMT
& a
->mode
) != (S_IFMT
& b
->mode
)) {
993 if (S_ISREG(a
->mode
)) {
994 result
->mode
= a
->mode
;
995 oidcpy(&result
->oid
, &a
->oid
);
997 result
->mode
= b
->mode
;
998 oidcpy(&result
->oid
, &b
->oid
);
1001 if (!oid_eq(&a
->oid
, &one
->oid
) && !oid_eq(&b
->oid
, &one
->oid
))
1007 if (a
->mode
== b
->mode
|| a
->mode
== one
->mode
)
1008 result
->mode
= b
->mode
;
1010 result
->mode
= a
->mode
;
1011 if (b
->mode
!= one
->mode
) {
1017 if (oid_eq(&a
->oid
, &b
->oid
) || oid_eq(&a
->oid
, &one
->oid
))
1018 oidcpy(&result
->oid
, &b
->oid
);
1019 else if (oid_eq(&b
->oid
, &one
->oid
))
1020 oidcpy(&result
->oid
, &a
->oid
);
1021 else if (S_ISREG(a
->mode
)) {
1022 mmbuffer_t result_buf
;
1023 int ret
= 0, merge_status
;
1025 merge_status
= merge_3way(o
, &result_buf
, one
, a
, b
,
1028 if ((merge_status
< 0) || !result_buf
.ptr
)
1029 ret
= err(o
, _("Failed to execute internal merge"));
1032 write_object_file(result_buf
.ptr
, result_buf
.size
,
1033 blob_type
, &result
->oid
))
1034 ret
= err(o
, _("Unable to add %s to database"),
1037 free(result_buf
.ptr
);
1040 result
->clean
= (merge_status
== 0);
1041 } else if (S_ISGITLINK(a
->mode
)) {
1042 result
->clean
= merge_submodule(&result
->oid
,
1048 } else if (S_ISLNK(a
->mode
)) {
1049 switch (o
->recursive_variant
) {
1050 case MERGE_RECURSIVE_NORMAL
:
1051 oidcpy(&result
->oid
, &a
->oid
);
1052 if (!oid_eq(&a
->oid
, &b
->oid
))
1055 case MERGE_RECURSIVE_OURS
:
1056 oidcpy(&result
->oid
, &a
->oid
);
1058 case MERGE_RECURSIVE_THEIRS
:
1059 oidcpy(&result
->oid
, &b
->oid
);
1063 die("BUG: unsupported object type in the tree");
1069 static int merge_file_special_markers(struct merge_options
*o
,
1070 const struct diff_filespec
*one
,
1071 const struct diff_filespec
*a
,
1072 const struct diff_filespec
*b
,
1073 const char *branch1
,
1074 const char *filename1
,
1075 const char *branch2
,
1076 const char *filename2
,
1077 struct merge_file_info
*mfi
)
1084 side1
= xstrfmt("%s:%s", branch1
, filename1
);
1086 side2
= xstrfmt("%s:%s", branch2
, filename2
);
1088 ret
= merge_file_1(o
, one
, a
, b
,
1089 side1
? side1
: branch1
,
1090 side2
? side2
: branch2
, mfi
);
1096 static int merge_file_one(struct merge_options
*o
,
1098 const struct object_id
*o_oid
, int o_mode
,
1099 const struct object_id
*a_oid
, int a_mode
,
1100 const struct object_id
*b_oid
, int b_mode
,
1101 const char *branch1
,
1102 const char *branch2
,
1103 struct merge_file_info
*mfi
)
1105 struct diff_filespec one
, a
, b
;
1107 one
.path
= a
.path
= b
.path
= (char *)path
;
1108 oidcpy(&one
.oid
, o_oid
);
1110 oidcpy(&a
.oid
, a_oid
);
1112 oidcpy(&b
.oid
, b_oid
);
1114 return merge_file_1(o
, &one
, &a
, &b
, branch1
, branch2
, mfi
);
1117 static int handle_change_delete(struct merge_options
*o
,
1118 const char *path
, const char *old_path
,
1119 const struct object_id
*o_oid
, int o_mode
,
1120 const struct object_id
*changed_oid
,
1122 const char *change_branch
,
1123 const char *delete_branch
,
1124 const char *change
, const char *change_past
)
1126 char *alt_path
= NULL
;
1127 const char *update_path
= path
;
1130 if (dir_in_way(path
, !o
->call_depth
, 0)) {
1131 update_path
= alt_path
= unique_path(o
, path
, change_branch
);
1134 if (o
->call_depth
) {
1136 * We cannot arbitrarily accept either a_sha or b_sha as
1137 * correct; since there is no true "middle point" between
1138 * them, simply reuse the base version for virtual merge base.
1140 ret
= remove_file_from_cache(path
);
1142 ret
= update_file(o
, 0, o_oid
, o_mode
, update_path
);
1146 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1147 "and %s in %s. Version %s of %s left in tree."),
1148 change
, path
, delete_branch
, change_past
,
1149 change_branch
, change_branch
, path
);
1151 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1152 "and %s to %s in %s. Version %s of %s left in tree."),
1153 change
, old_path
, delete_branch
, change_past
, path
,
1154 change_branch
, change_branch
, path
);
1158 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1159 "and %s in %s. Version %s of %s left in tree at %s."),
1160 change
, path
, delete_branch
, change_past
,
1161 change_branch
, change_branch
, path
, alt_path
);
1163 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1164 "and %s to %s in %s. Version %s of %s left in tree at %s."),
1165 change
, old_path
, delete_branch
, change_past
, path
,
1166 change_branch
, change_branch
, path
, alt_path
);
1170 * No need to call update_file() on path when change_branch ==
1171 * o->branch1 && !alt_path, since that would needlessly touch
1172 * path. We could call update_file_flags() with update_cache=0
1173 * and update_wd=0, but that's a no-op.
1175 if (change_branch
!= o
->branch1
|| alt_path
)
1176 ret
= update_file(o
, 0, changed_oid
, changed_mode
, update_path
);
1183 static int conflict_rename_delete(struct merge_options
*o
,
1184 struct diff_filepair
*pair
,
1185 const char *rename_branch
,
1186 const char *delete_branch
)
1188 const struct diff_filespec
*orig
= pair
->one
;
1189 const struct diff_filespec
*dest
= pair
->two
;
1191 if (handle_change_delete(o
,
1192 o
->call_depth
? orig
->path
: dest
->path
,
1193 o
->call_depth
? NULL
: orig
->path
,
1194 &orig
->oid
, orig
->mode
,
1195 &dest
->oid
, dest
->mode
,
1196 rename_branch
, delete_branch
,
1197 _("rename"), _("renamed")))
1201 return remove_file_from_cache(dest
->path
);
1203 return update_stages(o
, dest
->path
, NULL
,
1204 rename_branch
== o
->branch1
? dest
: NULL
,
1205 rename_branch
== o
->branch1
? NULL
: dest
);
1208 static struct diff_filespec
*filespec_from_entry(struct diff_filespec
*target
,
1209 struct stage_data
*entry
,
1212 struct object_id
*oid
= &entry
->stages
[stage
].oid
;
1213 unsigned mode
= entry
->stages
[stage
].mode
;
1214 if (mode
== 0 || is_null_oid(oid
))
1216 oidcpy(&target
->oid
, oid
);
1217 target
->mode
= mode
;
1221 static int handle_file(struct merge_options
*o
,
1222 struct diff_filespec
*rename
,
1224 struct rename_conflict_info
*ci
)
1226 char *dst_name
= rename
->path
;
1227 struct stage_data
*dst_entry
;
1228 const char *cur_branch
, *other_branch
;
1229 struct diff_filespec other
;
1230 struct diff_filespec
*add
;
1234 dst_entry
= ci
->dst_entry1
;
1235 cur_branch
= ci
->branch1
;
1236 other_branch
= ci
->branch2
;
1238 dst_entry
= ci
->dst_entry2
;
1239 cur_branch
= ci
->branch2
;
1240 other_branch
= ci
->branch1
;
1243 add
= filespec_from_entry(&other
, dst_entry
, stage
^ 1);
1245 char *add_name
= unique_path(o
, rename
->path
, other_branch
);
1246 if (update_file(o
, 0, &add
->oid
, add
->mode
, add_name
))
1249 remove_file(o
, 0, rename
->path
, 0);
1250 dst_name
= unique_path(o
, rename
->path
, cur_branch
);
1252 if (dir_in_way(rename
->path
, !o
->call_depth
, 0)) {
1253 dst_name
= unique_path(o
, rename
->path
, cur_branch
);
1254 output(o
, 1, _("%s is a directory in %s adding as %s instead"),
1255 rename
->path
, other_branch
, dst_name
);
1258 if ((ret
= update_file(o
, 0, &rename
->oid
, rename
->mode
, dst_name
)))
1259 ; /* fall through, do allow dst_name to be released */
1260 else if (stage
== 2)
1261 ret
= update_stages(o
, rename
->path
, NULL
, rename
, add
);
1263 ret
= update_stages(o
, rename
->path
, NULL
, add
, rename
);
1265 if (dst_name
!= rename
->path
)
1271 static int conflict_rename_rename_1to2(struct merge_options
*o
,
1272 struct rename_conflict_info
*ci
)
1274 /* One file was renamed in both branches, but to different names. */
1275 struct diff_filespec
*one
= ci
->pair1
->one
;
1276 struct diff_filespec
*a
= ci
->pair1
->two
;
1277 struct diff_filespec
*b
= ci
->pair2
->two
;
1279 output(o
, 1, _("CONFLICT (rename/rename): "
1280 "Rename \"%s\"->\"%s\" in branch \"%s\" "
1281 "rename \"%s\"->\"%s\" in \"%s\"%s"),
1282 one
->path
, a
->path
, ci
->branch1
,
1283 one
->path
, b
->path
, ci
->branch2
,
1284 o
->call_depth
? _(" (left unresolved)") : "");
1285 if (o
->call_depth
) {
1286 struct merge_file_info mfi
;
1287 struct diff_filespec other
;
1288 struct diff_filespec
*add
;
1289 if (merge_file_one(o
, one
->path
,
1290 &one
->oid
, one
->mode
,
1293 ci
->branch1
, ci
->branch2
, &mfi
))
1297 * FIXME: For rename/add-source conflicts (if we could detect
1298 * such), this is wrong. We should instead find a unique
1299 * pathname and then either rename the add-source file to that
1300 * unique path, or use that unique path instead of src here.
1302 if (update_file(o
, 0, &mfi
.oid
, mfi
.mode
, one
->path
))
1306 * Above, we put the merged content at the merge-base's
1307 * path. Now we usually need to delete both a->path and
1308 * b->path. However, the rename on each side of the merge
1309 * could also be involved in a rename/add conflict. In
1310 * such cases, we should keep the added file around,
1311 * resolving the conflict at that path in its favor.
1313 add
= filespec_from_entry(&other
, ci
->dst_entry1
, 2 ^ 1);
1315 if (update_file(o
, 0, &add
->oid
, add
->mode
, a
->path
))
1319 remove_file_from_cache(a
->path
);
1320 add
= filespec_from_entry(&other
, ci
->dst_entry2
, 3 ^ 1);
1322 if (update_file(o
, 0, &add
->oid
, add
->mode
, b
->path
))
1326 remove_file_from_cache(b
->path
);
1327 } else if (handle_file(o
, a
, 2, ci
) || handle_file(o
, b
, 3, ci
))
1333 static int conflict_rename_rename_2to1(struct merge_options
*o
,
1334 struct rename_conflict_info
*ci
)
1336 /* Two files, a & b, were renamed to the same thing, c. */
1337 struct diff_filespec
*a
= ci
->pair1
->one
;
1338 struct diff_filespec
*b
= ci
->pair2
->one
;
1339 struct diff_filespec
*c1
= ci
->pair1
->two
;
1340 struct diff_filespec
*c2
= ci
->pair2
->two
;
1341 char *path
= c1
->path
; /* == c2->path */
1342 struct merge_file_info mfi_c1
;
1343 struct merge_file_info mfi_c2
;
1346 output(o
, 1, _("CONFLICT (rename/rename): "
1347 "Rename %s->%s in %s. "
1348 "Rename %s->%s in %s"),
1349 a
->path
, c1
->path
, ci
->branch1
,
1350 b
->path
, c2
->path
, ci
->branch2
);
1352 remove_file(o
, 1, a
->path
, o
->call_depth
|| would_lose_untracked(a
->path
));
1353 remove_file(o
, 1, b
->path
, o
->call_depth
|| would_lose_untracked(b
->path
));
1355 if (merge_file_special_markers(o
, a
, c1
, &ci
->ren1_other
,
1356 o
->branch1
, c1
->path
,
1357 o
->branch2
, ci
->ren1_other
.path
, &mfi_c1
) ||
1358 merge_file_special_markers(o
, b
, &ci
->ren2_other
, c2
,
1359 o
->branch1
, ci
->ren2_other
.path
,
1360 o
->branch2
, c2
->path
, &mfi_c2
))
1363 if (o
->call_depth
) {
1365 * If mfi_c1.clean && mfi_c2.clean, then it might make
1366 * sense to do a two-way merge of those results. But, I
1367 * think in all cases, it makes sense to have the virtual
1368 * merge base just undo the renames; they can be detected
1369 * again later for the non-recursive merge.
1371 remove_file(o
, 0, path
, 0);
1372 ret
= update_file(o
, 0, &mfi_c1
.oid
, mfi_c1
.mode
, a
->path
);
1374 ret
= update_file(o
, 0, &mfi_c2
.oid
, mfi_c2
.mode
,
1377 char *new_path1
= unique_path(o
, path
, ci
->branch1
);
1378 char *new_path2
= unique_path(o
, path
, ci
->branch2
);
1379 output(o
, 1, _("Renaming %s to %s and %s to %s instead"),
1380 a
->path
, new_path1
, b
->path
, new_path2
);
1381 remove_file(o
, 0, path
, 0);
1382 ret
= update_file(o
, 0, &mfi_c1
.oid
, mfi_c1
.mode
, new_path1
);
1384 ret
= update_file(o
, 0, &mfi_c2
.oid
, mfi_c2
.mode
,
1393 static int process_renames(struct merge_options
*o
,
1394 struct string_list
*a_renames
,
1395 struct string_list
*b_renames
)
1397 int clean_merge
= 1, i
, j
;
1398 struct string_list a_by_dst
= STRING_LIST_INIT_NODUP
;
1399 struct string_list b_by_dst
= STRING_LIST_INIT_NODUP
;
1400 const struct rename
*sre
;
1402 for (i
= 0; i
< a_renames
->nr
; i
++) {
1403 sre
= a_renames
->items
[i
].util
;
1404 string_list_insert(&a_by_dst
, sre
->pair
->two
->path
)->util
1407 for (i
= 0; i
< b_renames
->nr
; i
++) {
1408 sre
= b_renames
->items
[i
].util
;
1409 string_list_insert(&b_by_dst
, sre
->pair
->two
->path
)->util
1413 for (i
= 0, j
= 0; i
< a_renames
->nr
|| j
< b_renames
->nr
;) {
1414 struct string_list
*renames1
, *renames2Dst
;
1415 struct rename
*ren1
= NULL
, *ren2
= NULL
;
1416 const char *branch1
, *branch2
;
1417 const char *ren1_src
, *ren1_dst
;
1418 struct string_list_item
*lookup
;
1420 if (i
>= a_renames
->nr
) {
1421 ren2
= b_renames
->items
[j
++].util
;
1422 } else if (j
>= b_renames
->nr
) {
1423 ren1
= a_renames
->items
[i
++].util
;
1425 int compare
= strcmp(a_renames
->items
[i
].string
,
1426 b_renames
->items
[j
].string
);
1428 ren1
= a_renames
->items
[i
++].util
;
1430 ren2
= b_renames
->items
[j
++].util
;
1433 /* TODO: refactor, so that 1/2 are not needed */
1435 renames1
= a_renames
;
1436 renames2Dst
= &b_by_dst
;
1437 branch1
= o
->branch1
;
1438 branch2
= o
->branch2
;
1440 renames1
= b_renames
;
1441 renames2Dst
= &a_by_dst
;
1442 branch1
= o
->branch2
;
1443 branch2
= o
->branch1
;
1447 if (ren1
->processed
)
1449 ren1
->processed
= 1;
1450 ren1
->dst_entry
->processed
= 1;
1451 /* BUG: We should only mark src_entry as processed if we
1452 * are not dealing with a rename + add-source case.
1454 ren1
->src_entry
->processed
= 1;
1456 ren1_src
= ren1
->pair
->one
->path
;
1457 ren1_dst
= ren1
->pair
->two
->path
;
1460 /* One file renamed on both sides */
1461 const char *ren2_src
= ren2
->pair
->one
->path
;
1462 const char *ren2_dst
= ren2
->pair
->two
->path
;
1463 enum rename_type rename_type
;
1464 if (strcmp(ren1_src
, ren2_src
) != 0)
1465 die("BUG: ren1_src != ren2_src");
1466 ren2
->dst_entry
->processed
= 1;
1467 ren2
->processed
= 1;
1468 if (strcmp(ren1_dst
, ren2_dst
) != 0) {
1469 rename_type
= RENAME_ONE_FILE_TO_TWO
;
1472 rename_type
= RENAME_ONE_FILE_TO_ONE
;
1473 /* BUG: We should only remove ren1_src in
1474 * the base stage (think of rename +
1475 * add-source cases).
1477 remove_file(o
, 1, ren1_src
, 1);
1478 update_entry(ren1
->dst_entry
,
1483 setup_rename_conflict_info(rename_type
,
1493 } else if ((lookup
= string_list_lookup(renames2Dst
, ren1_dst
))) {
1494 /* Two different files renamed to the same thing */
1496 ren2
= lookup
->util
;
1497 ren2_dst
= ren2
->pair
->two
->path
;
1498 if (strcmp(ren1_dst
, ren2_dst
) != 0)
1499 die("BUG: ren1_dst != ren2_dst");
1502 ren2
->processed
= 1;
1504 * BUG: We should only mark src_entry as processed
1505 * if we are not dealing with a rename + add-source
1508 ren2
->src_entry
->processed
= 1;
1510 setup_rename_conflict_info(RENAME_TWO_FILES_TO_ONE
,
1522 /* Renamed in 1, maybe changed in 2 */
1523 /* we only use sha1 and mode of these */
1524 struct diff_filespec src_other
, dst_other
;
1528 * unpack_trees loads entries from common-commit
1529 * into stage 1, from head-commit into stage 2, and
1530 * from merge-commit into stage 3. We keep track
1531 * of which side corresponds to the rename.
1533 int renamed_stage
= a_renames
== renames1
? 2 : 3;
1534 int other_stage
= a_renames
== renames1
? 3 : 2;
1536 /* BUG: We should only remove ren1_src in the base
1537 * stage and in other_stage (think of rename +
1540 remove_file(o
, 1, ren1_src
,
1541 renamed_stage
== 2 || !was_tracked(ren1_src
));
1543 oidcpy(&src_other
.oid
,
1544 &ren1
->src_entry
->stages
[other_stage
].oid
);
1545 src_other
.mode
= ren1
->src_entry
->stages
[other_stage
].mode
;
1546 oidcpy(&dst_other
.oid
,
1547 &ren1
->dst_entry
->stages
[other_stage
].oid
);
1548 dst_other
.mode
= ren1
->dst_entry
->stages
[other_stage
].mode
;
1551 if (oid_eq(&src_other
.oid
, &null_oid
)) {
1552 setup_rename_conflict_info(RENAME_DELETE
,
1562 } else if ((dst_other
.mode
== ren1
->pair
->two
->mode
) &&
1563 oid_eq(&dst_other
.oid
, &ren1
->pair
->two
->oid
)) {
1565 * Added file on the other side identical to
1566 * the file being renamed: clean merge.
1567 * Also, there is no need to overwrite the
1568 * file already in the working copy, so call
1569 * update_file_flags() instead of
1572 if (update_file_flags(o
,
1573 &ren1
->pair
->two
->oid
,
1574 ren1
->pair
->two
->mode
,
1576 1, /* update_cache */
1579 } else if (!oid_eq(&dst_other
.oid
, &null_oid
)) {
1582 output(o
, 1, _("CONFLICT (rename/add): Rename %s->%s in %s. "
1584 ren1_src
, ren1_dst
, branch1
,
1586 if (o
->call_depth
) {
1587 struct merge_file_info mfi
;
1588 if (merge_file_one(o
, ren1_dst
, &null_oid
, 0,
1589 &ren1
->pair
->two
->oid
,
1590 ren1
->pair
->two
->mode
,
1593 branch1
, branch2
, &mfi
)) {
1595 goto cleanup_and_return
;
1597 output(o
, 1, _("Adding merged %s"), ren1_dst
);
1598 if (update_file(o
, 0, &mfi
.oid
,
1599 mfi
.mode
, ren1_dst
))
1603 char *new_path
= unique_path(o
, ren1_dst
, branch2
);
1604 output(o
, 1, _("Adding as %s instead"), new_path
);
1605 if (update_file(o
, 0, &dst_other
.oid
,
1606 dst_other
.mode
, new_path
))
1613 if (clean_merge
< 0)
1614 goto cleanup_and_return
;
1616 struct diff_filespec
*one
, *a
, *b
;
1617 src_other
.path
= (char *)ren1_src
;
1619 one
= ren1
->pair
->one
;
1620 if (a_renames
== renames1
) {
1621 a
= ren1
->pair
->two
;
1624 b
= ren1
->pair
->two
;
1627 update_entry(ren1
->dst_entry
, one
, a
, b
);
1628 setup_rename_conflict_info(RENAME_NORMAL
,
1642 string_list_clear(&a_by_dst
, 0);
1643 string_list_clear(&b_by_dst
, 0);
1648 static struct object_id
*stage_oid(const struct object_id
*oid
, unsigned mode
)
1650 return (is_null_oid(oid
) || mode
== 0) ? NULL
: (struct object_id
*)oid
;
1653 static int read_oid_strbuf(struct merge_options
*o
,
1654 const struct object_id
*oid
, struct strbuf
*dst
)
1657 enum object_type type
;
1659 buf
= read_object_file(oid
, &type
, &size
);
1661 return err(o
, _("cannot read object %s"), oid_to_hex(oid
));
1662 if (type
!= OBJ_BLOB
) {
1664 return err(o
, _("object %s is not a blob"), oid_to_hex(oid
));
1666 strbuf_attach(dst
, buf
, size
, size
+ 1);
1670 static int blob_unchanged(struct merge_options
*opt
,
1671 const struct object_id
*o_oid
,
1673 const struct object_id
*a_oid
,
1675 int renormalize
, const char *path
)
1677 struct strbuf o
= STRBUF_INIT
;
1678 struct strbuf a
= STRBUF_INIT
;
1679 int ret
= 0; /* assume changed for safety */
1681 if (a_mode
!= o_mode
)
1683 if (oid_eq(o_oid
, a_oid
))
1688 assert(o_oid
&& a_oid
);
1689 if (read_oid_strbuf(opt
, o_oid
, &o
) || read_oid_strbuf(opt
, a_oid
, &a
))
1692 * Note: binary | is used so that both renormalizations are
1693 * performed. Comparison can be skipped if both files are
1694 * unchanged since their sha1s have already been compared.
1696 if (renormalize_buffer(&the_index
, path
, o
.buf
, o
.len
, &o
) |
1697 renormalize_buffer(&the_index
, path
, a
.buf
, a
.len
, &a
))
1698 ret
= (o
.len
== a
.len
&& !memcmp(o
.buf
, a
.buf
, o
.len
));
1706 static int handle_modify_delete(struct merge_options
*o
,
1708 struct object_id
*o_oid
, int o_mode
,
1709 struct object_id
*a_oid
, int a_mode
,
1710 struct object_id
*b_oid
, int b_mode
)
1712 const char *modify_branch
, *delete_branch
;
1713 struct object_id
*changed_oid
;
1717 modify_branch
= o
->branch1
;
1718 delete_branch
= o
->branch2
;
1719 changed_oid
= a_oid
;
1720 changed_mode
= a_mode
;
1722 modify_branch
= o
->branch2
;
1723 delete_branch
= o
->branch1
;
1724 changed_oid
= b_oid
;
1725 changed_mode
= b_mode
;
1728 return handle_change_delete(o
,
1731 changed_oid
, changed_mode
,
1732 modify_branch
, delete_branch
,
1733 _("modify"), _("modified"));
1736 static int merge_content(struct merge_options
*o
,
1738 struct object_id
*o_oid
, int o_mode
,
1739 struct object_id
*a_oid
, int a_mode
,
1740 struct object_id
*b_oid
, int b_mode
,
1741 struct rename_conflict_info
*rename_conflict_info
)
1743 const char *reason
= _("content");
1744 const char *path1
= NULL
, *path2
= NULL
;
1745 struct merge_file_info mfi
;
1746 struct diff_filespec one
, a
, b
;
1747 unsigned df_conflict_remains
= 0;
1750 reason
= _("add/add");
1751 o_oid
= (struct object_id
*)&null_oid
;
1753 one
.path
= a
.path
= b
.path
= (char *)path
;
1754 oidcpy(&one
.oid
, o_oid
);
1756 oidcpy(&a
.oid
, a_oid
);
1758 oidcpy(&b
.oid
, b_oid
);
1761 if (rename_conflict_info
) {
1762 struct diff_filepair
*pair1
= rename_conflict_info
->pair1
;
1764 path1
= (o
->branch1
== rename_conflict_info
->branch1
) ?
1765 pair1
->two
->path
: pair1
->one
->path
;
1766 /* If rename_conflict_info->pair2 != NULL, we are in
1767 * RENAME_ONE_FILE_TO_ONE case. Otherwise, we have a
1770 path2
= (rename_conflict_info
->pair2
||
1771 o
->branch2
== rename_conflict_info
->branch1
) ?
1772 pair1
->two
->path
: pair1
->one
->path
;
1774 if (dir_in_way(path
, !o
->call_depth
,
1775 S_ISGITLINK(pair1
->two
->mode
)))
1776 df_conflict_remains
= 1;
1778 if (merge_file_special_markers(o
, &one
, &a
, &b
,
1780 o
->branch2
, path2
, &mfi
))
1783 if (mfi
.clean
&& !df_conflict_remains
&&
1784 oid_eq(&mfi
.oid
, a_oid
) && mfi
.mode
== a_mode
) {
1785 int path_renamed_outside_HEAD
;
1786 output(o
, 3, _("Skipped %s (merged same as existing)"), path
);
1788 * The content merge resulted in the same file contents we
1789 * already had. We can return early if those file contents
1790 * are recorded at the correct path (which may not be true
1791 * if the merge involves a rename).
1793 path_renamed_outside_HEAD
= !path2
|| !strcmp(path
, path2
);
1794 if (!path_renamed_outside_HEAD
) {
1795 add_cacheinfo(o
, mfi
.mode
, &mfi
.oid
, path
,
1796 0, (!o
->call_depth
), 0);
1800 output(o
, 2, _("Auto-merging %s"), path
);
1803 if (S_ISGITLINK(mfi
.mode
))
1804 reason
= _("submodule");
1805 output(o
, 1, _("CONFLICT (%s): Merge conflict in %s"),
1807 if (rename_conflict_info
&& !df_conflict_remains
)
1808 if (update_stages(o
, path
, &one
, &a
, &b
))
1812 if (df_conflict_remains
) {
1814 if (o
->call_depth
) {
1815 remove_file_from_cache(path
);
1818 if (update_stages(o
, path
, &one
, &a
, &b
))
1821 int file_from_stage2
= was_tracked(path
);
1822 struct diff_filespec merged
;
1823 oidcpy(&merged
.oid
, &mfi
.oid
);
1824 merged
.mode
= mfi
.mode
;
1826 if (update_stages(o
, path
, NULL
,
1827 file_from_stage2
? &merged
: NULL
,
1828 file_from_stage2
? NULL
: &merged
))
1833 new_path
= unique_path(o
, path
, rename_conflict_info
->branch1
);
1834 output(o
, 1, _("Adding as %s instead"), new_path
);
1835 if (update_file(o
, 0, &mfi
.oid
, mfi
.mode
, new_path
)) {
1841 } else if (update_file(o
, mfi
.clean
, &mfi
.oid
, mfi
.mode
, path
))
1846 /* Per entry merge function */
1847 static int process_entry(struct merge_options
*o
,
1848 const char *path
, struct stage_data
*entry
)
1850 int clean_merge
= 1;
1851 int normalize
= o
->renormalize
;
1852 unsigned o_mode
= entry
->stages
[1].mode
;
1853 unsigned a_mode
= entry
->stages
[2].mode
;
1854 unsigned b_mode
= entry
->stages
[3].mode
;
1855 struct object_id
*o_oid
= stage_oid(&entry
->stages
[1].oid
, o_mode
);
1856 struct object_id
*a_oid
= stage_oid(&entry
->stages
[2].oid
, a_mode
);
1857 struct object_id
*b_oid
= stage_oid(&entry
->stages
[3].oid
, b_mode
);
1859 entry
->processed
= 1;
1860 if (entry
->rename_conflict_info
) {
1861 struct rename_conflict_info
*conflict_info
= entry
->rename_conflict_info
;
1862 switch (conflict_info
->rename_type
) {
1864 case RENAME_ONE_FILE_TO_ONE
:
1865 clean_merge
= merge_content(o
, path
,
1866 o_oid
, o_mode
, a_oid
, a_mode
, b_oid
, b_mode
,
1871 if (conflict_rename_delete(o
,
1872 conflict_info
->pair1
,
1873 conflict_info
->branch1
,
1874 conflict_info
->branch2
))
1877 case RENAME_ONE_FILE_TO_TWO
:
1879 if (conflict_rename_rename_1to2(o
, conflict_info
))
1882 case RENAME_TWO_FILES_TO_ONE
:
1884 if (conflict_rename_rename_2to1(o
, conflict_info
))
1888 entry
->processed
= 0;
1891 } else if (o_oid
&& (!a_oid
|| !b_oid
)) {
1892 /* Case A: Deleted in one */
1893 if ((!a_oid
&& !b_oid
) ||
1894 (!b_oid
&& blob_unchanged(o
, o_oid
, o_mode
, a_oid
, a_mode
, normalize
, path
)) ||
1895 (!a_oid
&& blob_unchanged(o
, o_oid
, o_mode
, b_oid
, b_mode
, normalize
, path
))) {
1896 /* Deleted in both or deleted in one and
1897 * unchanged in the other */
1899 output(o
, 2, _("Removing %s"), path
);
1900 /* do not touch working file if it did not exist */
1901 remove_file(o
, 1, path
, !a_oid
);
1903 /* Modify/delete; deleted side may have put a directory in the way */
1905 if (handle_modify_delete(o
, path
, o_oid
, o_mode
,
1906 a_oid
, a_mode
, b_oid
, b_mode
))
1909 } else if ((!o_oid
&& a_oid
&& !b_oid
) ||
1910 (!o_oid
&& !a_oid
&& b_oid
)) {
1911 /* Case B: Added in one. */
1912 /* [nothing|directory] -> ([nothing|directory], file) */
1914 const char *add_branch
;
1915 const char *other_branch
;
1917 const struct object_id
*oid
;
1921 add_branch
= o
->branch1
;
1922 other_branch
= o
->branch2
;
1925 conf
= _("file/directory");
1927 add_branch
= o
->branch2
;
1928 other_branch
= o
->branch1
;
1931 conf
= _("directory/file");
1933 if (dir_in_way(path
,
1934 !o
->call_depth
&& !S_ISGITLINK(a_mode
),
1936 char *new_path
= unique_path(o
, path
, add_branch
);
1938 output(o
, 1, _("CONFLICT (%s): There is a directory with name %s in %s. "
1940 conf
, path
, other_branch
, path
, new_path
);
1941 if (update_file(o
, 0, oid
, mode
, new_path
))
1943 else if (o
->call_depth
)
1944 remove_file_from_cache(path
);
1947 output(o
, 2, _("Adding %s"), path
);
1948 /* do not overwrite file if already present */
1949 if (update_file_flags(o
, oid
, mode
, path
, 1, !a_oid
))
1952 } else if (a_oid
&& b_oid
) {
1953 /* Case C: Added in both (check for same permissions) and */
1954 /* case D: Modified in both, but differently. */
1955 clean_merge
= merge_content(o
, path
,
1956 o_oid
, o_mode
, a_oid
, a_mode
, b_oid
, b_mode
,
1958 } else if (!o_oid
&& !a_oid
&& !b_oid
) {
1960 * this entry was deleted altogether. a_mode == 0 means
1961 * we had that path and want to actively remove it.
1963 remove_file(o
, 1, path
, !a_mode
);
1965 die("BUG: fatal merge failure, shouldn't happen.");
1970 int merge_trees(struct merge_options
*o
,
1973 struct tree
*common
,
1974 struct tree
**result
)
1978 if (o
->subtree_shift
) {
1979 merge
= shift_tree_object(head
, merge
, o
->subtree_shift
);
1980 common
= shift_tree_object(head
, common
, o
->subtree_shift
);
1983 if (oid_eq(&common
->object
.oid
, &merge
->object
.oid
)) {
1984 struct strbuf sb
= STRBUF_INIT
;
1986 if (!o
->call_depth
&& index_has_changes(&sb
)) {
1987 err(o
, _("Dirty index: cannot merge (dirty: %s)"),
1991 output(o
, 0, _("Already up to date!"));
1996 code
= git_merge_trees(o
->call_depth
, common
, head
, merge
);
1999 if (show(o
, 4) || o
->call_depth
)
2000 err(o
, _("merging of trees %s and %s failed"),
2001 oid_to_hex(&head
->object
.oid
),
2002 oid_to_hex(&merge
->object
.oid
));
2006 if (unmerged_cache()) {
2007 struct string_list
*entries
, *re_head
, *re_merge
;
2010 * Only need the hashmap while processing entries, so
2011 * initialize it here and free it when we are done running
2012 * through the entries. Keeping it in the merge_options as
2013 * opposed to decaring a local hashmap is for convenience
2014 * so that we don't have to pass it to around.
2016 hashmap_init(&o
->current_file_dir_set
, path_hashmap_cmp
, NULL
, 512);
2017 get_files_dirs(o
, head
);
2018 get_files_dirs(o
, merge
);
2020 entries
= get_unmerged();
2021 re_head
= get_renames(o
, head
, common
, head
, merge
, entries
);
2022 re_merge
= get_renames(o
, merge
, common
, head
, merge
, entries
);
2023 clean
= process_renames(o
, re_head
, re_merge
);
2024 record_df_conflict_files(o
, entries
);
2027 for (i
= entries
->nr
-1; 0 <= i
; i
--) {
2028 const char *path
= entries
->items
[i
].string
;
2029 struct stage_data
*e
= entries
->items
[i
].util
;
2030 if (!e
->processed
) {
2031 int ret
= process_entry(o
, path
, e
);
2040 for (i
= 0; i
< entries
->nr
; i
++) {
2041 struct stage_data
*e
= entries
->items
[i
].util
;
2043 die("BUG: unprocessed path??? %s",
2044 entries
->items
[i
].string
);
2048 string_list_clear(re_merge
, 0);
2049 string_list_clear(re_head
, 0);
2050 string_list_clear(entries
, 1);
2052 hashmap_free(&o
->current_file_dir_set
, 1);
2064 if (o
->call_depth
&& !(*result
= write_tree_from_memory(o
)))
2070 static struct commit_list
*reverse_commit_list(struct commit_list
*list
)
2072 struct commit_list
*next
= NULL
, *current
, *backup
;
2073 for (current
= list
; current
; current
= backup
) {
2074 backup
= current
->next
;
2075 current
->next
= next
;
2082 * Merge the commits h1 and h2, return the resulting virtual
2083 * commit object and a flag indicating the cleanness of the merge.
2085 int merge_recursive(struct merge_options
*o
,
2088 struct commit_list
*ca
,
2089 struct commit
**result
)
2091 struct commit_list
*iter
;
2092 struct commit
*merged_common_ancestors
;
2093 struct tree
*mrtree
;
2097 output(o
, 4, _("Merging:"));
2098 output_commit_title(o
, h1
);
2099 output_commit_title(o
, h2
);
2103 ca
= get_merge_bases(h1
, h2
);
2104 ca
= reverse_commit_list(ca
);
2108 unsigned cnt
= commit_list_count(ca
);
2110 output(o
, 5, Q_("found %u common ancestor:",
2111 "found %u common ancestors:", cnt
), cnt
);
2112 for (iter
= ca
; iter
; iter
= iter
->next
)
2113 output_commit_title(o
, iter
->item
);
2116 merged_common_ancestors
= pop_commit(&ca
);
2117 if (merged_common_ancestors
== NULL
) {
2118 /* if there is no common ancestor, use an empty tree */
2121 tree
= lookup_tree(the_hash_algo
->empty_tree
);
2122 merged_common_ancestors
= make_virtual_commit(tree
, "ancestor");
2125 for (iter
= ca
; iter
; iter
= iter
->next
) {
2126 const char *saved_b1
, *saved_b2
;
2129 * When the merge fails, the result contains files
2130 * with conflict markers. The cleanness flag is
2131 * ignored (unless indicating an error), it was never
2132 * actually used, as result of merge_trees has always
2133 * overwritten it: the committed "conflicts" were
2137 saved_b1
= o
->branch1
;
2138 saved_b2
= o
->branch2
;
2139 o
->branch1
= "Temporary merge branch 1";
2140 o
->branch2
= "Temporary merge branch 2";
2141 if (merge_recursive(o
, merged_common_ancestors
, iter
->item
,
2142 NULL
, &merged_common_ancestors
) < 0)
2144 o
->branch1
= saved_b1
;
2145 o
->branch2
= saved_b2
;
2148 if (!merged_common_ancestors
)
2149 return err(o
, _("merge returned no commit"));
2156 o
->ancestor
= "merged common ancestors";
2157 clean
= merge_trees(o
, h1
->tree
, h2
->tree
, merged_common_ancestors
->tree
,
2164 if (o
->call_depth
) {
2165 *result
= make_virtual_commit(mrtree
, "merged tree");
2166 commit_list_insert(h1
, &(*result
)->parents
);
2167 commit_list_insert(h2
, &(*result
)->parents
->next
);
2170 if (!o
->call_depth
&& o
->buffer_output
< 2)
2171 strbuf_release(&o
->obuf
);
2173 diff_warn_rename_limit("merge.renamelimit",
2174 o
->needed_rename_limit
, 0);
2178 static struct commit
*get_ref(const struct object_id
*oid
, const char *name
)
2180 struct object
*object
;
2182 object
= deref_tag(parse_object(oid
), name
, strlen(name
));
2185 if (object
->type
== OBJ_TREE
)
2186 return make_virtual_commit((struct tree
*)object
, name
);
2187 if (object
->type
!= OBJ_COMMIT
)
2189 if (parse_commit((struct commit
*)object
))
2191 return (struct commit
*)object
;
2194 int merge_recursive_generic(struct merge_options
*o
,
2195 const struct object_id
*head
,
2196 const struct object_id
*merge
,
2198 const struct object_id
**base_list
,
2199 struct commit
**result
)
2202 struct lock_file lock
= LOCK_INIT
;
2203 struct commit
*head_commit
= get_ref(head
, o
->branch1
);
2204 struct commit
*next_commit
= get_ref(merge
, o
->branch2
);
2205 struct commit_list
*ca
= NULL
;
2209 for (i
= 0; i
< num_base_list
; ++i
) {
2210 struct commit
*base
;
2211 if (!(base
= get_ref(base_list
[i
], oid_to_hex(base_list
[i
]))))
2212 return err(o
, _("Could not parse object '%s'"),
2213 oid_to_hex(base_list
[i
]));
2214 commit_list_insert(base
, &ca
);
2218 hold_locked_index(&lock
, LOCK_DIE_ON_ERROR
);
2219 clean
= merge_recursive(o
, head_commit
, next_commit
, ca
,
2222 rollback_lock_file(&lock
);
2226 if (write_locked_index(&the_index
, &lock
,
2227 COMMIT_LOCK
| SKIP_IF_UNCHANGED
))
2228 return err(o
, _("Unable to write index."));
2230 return clean
? 0 : 1;
2233 static void merge_recursive_config(struct merge_options
*o
)
2235 git_config_get_int("merge.verbosity", &o
->verbosity
);
2236 git_config_get_int("diff.renamelimit", &o
->diff_rename_limit
);
2237 git_config_get_int("merge.renamelimit", &o
->merge_rename_limit
);
2238 git_config(git_xmerge_config
, NULL
);
2241 void init_merge_options(struct merge_options
*o
)
2243 const char *merge_verbosity
;
2244 memset(o
, 0, sizeof(struct merge_options
));
2246 o
->buffer_output
= 1;
2247 o
->diff_rename_limit
= -1;
2248 o
->merge_rename_limit
= -1;
2250 o
->detect_rename
= 1;
2251 merge_recursive_config(o
);
2252 merge_verbosity
= getenv("GIT_MERGE_VERBOSITY");
2253 if (merge_verbosity
)
2254 o
->verbosity
= strtol(merge_verbosity
, NULL
, 10);
2255 if (o
->verbosity
>= 5)
2256 o
->buffer_output
= 0;
2257 strbuf_init(&o
->obuf
, 0);
2258 string_list_init(&o
->df_conflict_file_set
, 1);
2261 int parse_merge_opt(struct merge_options
*o
, const char *s
)
2267 if (!strcmp(s
, "ours"))
2268 o
->recursive_variant
= MERGE_RECURSIVE_OURS
;
2269 else if (!strcmp(s
, "theirs"))
2270 o
->recursive_variant
= MERGE_RECURSIVE_THEIRS
;
2271 else if (!strcmp(s
, "subtree"))
2272 o
->subtree_shift
= "";
2273 else if (skip_prefix(s
, "subtree=", &arg
))
2274 o
->subtree_shift
= arg
;
2275 else if (!strcmp(s
, "patience"))
2276 o
->xdl_opts
= DIFF_WITH_ALG(o
, PATIENCE_DIFF
);
2277 else if (!strcmp(s
, "histogram"))
2278 o
->xdl_opts
= DIFF_WITH_ALG(o
, HISTOGRAM_DIFF
);
2279 else if (skip_prefix(s
, "diff-algorithm=", &arg
)) {
2280 long value
= parse_algorithm_value(arg
);
2283 /* clear out previous settings */
2284 DIFF_XDL_CLR(o
, NEED_MINIMAL
);
2285 o
->xdl_opts
&= ~XDF_DIFF_ALGORITHM_MASK
;
2286 o
->xdl_opts
|= value
;
2288 else if (!strcmp(s
, "ignore-space-change"))
2289 DIFF_XDL_SET(o
, IGNORE_WHITESPACE_CHANGE
);
2290 else if (!strcmp(s
, "ignore-all-space"))
2291 DIFF_XDL_SET(o
, IGNORE_WHITESPACE
);
2292 else if (!strcmp(s
, "ignore-space-at-eol"))
2293 DIFF_XDL_SET(o
, IGNORE_WHITESPACE_AT_EOL
);
2294 else if (!strcmp(s
, "ignore-cr-at-eol"))
2295 DIFF_XDL_SET(o
, IGNORE_CR_AT_EOL
);
2296 else if (!strcmp(s
, "renormalize"))
2298 else if (!strcmp(s
, "no-renormalize"))
2300 else if (!strcmp(s
, "no-renames"))
2301 o
->detect_rename
= 0;
2302 else if (!strcmp(s
, "find-renames")) {
2303 o
->detect_rename
= 1;
2304 o
->rename_score
= 0;
2306 else if (skip_prefix(s
, "find-renames=", &arg
) ||
2307 skip_prefix(s
, "rename-threshold=", &arg
)) {
2308 if ((o
->rename_score
= parse_rename_score(&arg
)) == -1 || *arg
!= 0)
2310 o
->detect_rename
= 1;