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"
11 #include "object-store.h"
12 #include "repository.h"
16 #include "tree-walk.h"
21 #include "unpack-trees.h"
22 #include "string-list.h"
23 #include "xdiff-interface.h"
26 #include "merge-recursive.h"
28 #include "submodule.h"
30 #include "commit-reach.h"
32 struct path_hashmap_entry
{
33 struct hashmap_entry e
;
34 char path
[FLEX_ARRAY
];
37 static int path_hashmap_cmp(const void *cmp_data
,
39 const void *entry_or_key
,
42 const struct path_hashmap_entry
*a
= entry
;
43 const struct path_hashmap_entry
*b
= entry_or_key
;
44 const char *key
= keydata
;
47 return strcasecmp(a
->path
, key
? key
: b
->path
);
49 return strcmp(a
->path
, key
? key
: b
->path
);
52 static unsigned int path_hash(const char *path
)
54 return ignore_case
? strihash(path
) : strhash(path
);
57 static struct dir_rename_entry
*dir_rename_find_entry(struct hashmap
*hashmap
,
60 struct dir_rename_entry key
;
64 hashmap_entry_init(&key
, strhash(dir
));
66 return hashmap_get(hashmap
, &key
, NULL
);
69 static int dir_rename_cmp(const void *unused_cmp_data
,
71 const void *entry_or_key
,
72 const void *unused_keydata
)
74 const struct dir_rename_entry
*e1
= entry
;
75 const struct dir_rename_entry
*e2
= entry_or_key
;
77 return strcmp(e1
->dir
, e2
->dir
);
80 static void dir_rename_init(struct hashmap
*map
)
82 hashmap_init(map
, dir_rename_cmp
, NULL
, 0);
85 static void dir_rename_entry_init(struct dir_rename_entry
*entry
,
88 hashmap_entry_init(entry
, strhash(directory
));
89 entry
->dir
= directory
;
90 entry
->non_unique_new_dir
= 0;
91 strbuf_init(&entry
->new_dir
, 0);
92 string_list_init(&entry
->possible_new_dirs
, 0);
95 static struct collision_entry
*collision_find_entry(struct hashmap
*hashmap
,
98 struct collision_entry key
;
100 hashmap_entry_init(&key
, strhash(target_file
));
101 key
.target_file
= target_file
;
102 return hashmap_get(hashmap
, &key
, NULL
);
105 static int collision_cmp(void *unused_cmp_data
,
106 const struct collision_entry
*e1
,
107 const struct collision_entry
*e2
,
108 const void *unused_keydata
)
110 return strcmp(e1
->target_file
, e2
->target_file
);
113 static void collision_init(struct hashmap
*map
)
115 hashmap_init(map
, (hashmap_cmp_fn
) collision_cmp
, NULL
, 0);
118 static void flush_output(struct merge_options
*o
)
120 if (o
->buffer_output
< 2 && o
->obuf
.len
) {
121 fputs(o
->obuf
.buf
, stdout
);
122 strbuf_reset(&o
->obuf
);
126 static int err(struct merge_options
*o
, const char *err
, ...)
130 if (o
->buffer_output
< 2)
133 strbuf_complete(&o
->obuf
, '\n');
134 strbuf_addstr(&o
->obuf
, "error: ");
136 va_start(params
, err
);
137 strbuf_vaddf(&o
->obuf
, err
, params
);
139 if (o
->buffer_output
> 1)
140 strbuf_addch(&o
->obuf
, '\n');
142 error("%s", o
->obuf
.buf
);
143 strbuf_reset(&o
->obuf
);
149 static struct tree
*shift_tree_object(struct tree
*one
, struct tree
*two
,
150 const char *subtree_shift
)
152 struct object_id shifted
;
154 if (!*subtree_shift
) {
155 shift_tree(&one
->object
.oid
, &two
->object
.oid
, &shifted
, 0);
157 shift_tree_by(&one
->object
.oid
, &two
->object
.oid
, &shifted
,
160 if (oideq(&two
->object
.oid
, &shifted
))
162 return lookup_tree(the_repository
, &shifted
);
165 static struct commit
*make_virtual_commit(struct tree
*tree
, const char *comment
)
167 struct commit
*commit
= alloc_commit_node(the_repository
);
169 set_merge_remote_desc(commit
, comment
, (struct object
*)commit
);
170 commit
->maybe_tree
= tree
;
171 commit
->object
.parsed
= 1;
176 * Since we use get_tree_entry(), which does not put the read object into
177 * the object pool, we cannot rely on a == b.
179 static int oid_eq(const struct object_id
*a
, const struct object_id
*b
)
183 return a
&& b
&& oideq(a
, b
);
190 RENAME_ONE_FILE_TO_ONE
,
191 RENAME_ONE_FILE_TO_TWO
,
192 RENAME_TWO_FILES_TO_ONE
195 struct rename_conflict_info
{
196 enum rename_type rename_type
;
197 struct diff_filepair
*pair1
;
198 struct diff_filepair
*pair2
;
201 struct stage_data
*dst_entry1
;
202 struct stage_data
*dst_entry2
;
203 struct diff_filespec ren1_other
;
204 struct diff_filespec ren2_other
;
208 * Since we want to write the index eventually, we cannot reuse the index
209 * for these (temporary) data.
214 struct object_id oid
;
216 struct rename_conflict_info
*rename_conflict_info
;
217 unsigned processed
:1;
220 static inline void setup_rename_conflict_info(enum rename_type rename_type
,
221 struct diff_filepair
*pair1
,
222 struct diff_filepair
*pair2
,
225 struct stage_data
*dst_entry1
,
226 struct stage_data
*dst_entry2
,
227 struct merge_options
*o
,
228 struct stage_data
*src_entry1
,
229 struct stage_data
*src_entry2
)
231 struct rename_conflict_info
*ci
= xcalloc(1, sizeof(struct rename_conflict_info
));
232 ci
->rename_type
= rename_type
;
234 ci
->branch1
= branch1
;
235 ci
->branch2
= branch2
;
237 ci
->dst_entry1
= dst_entry1
;
238 dst_entry1
->rename_conflict_info
= ci
;
239 dst_entry1
->processed
= 0;
241 assert(!pair2
== !dst_entry2
);
243 ci
->dst_entry2
= dst_entry2
;
245 dst_entry2
->rename_conflict_info
= ci
;
248 if (rename_type
== RENAME_TWO_FILES_TO_ONE
) {
250 * For each rename, there could have been
251 * modifications on the side of history where that
252 * file was not renamed.
254 int ostage1
= o
->branch1
== branch1
? 3 : 2;
255 int ostage2
= ostage1
^ 1;
257 ci
->ren1_other
.path
= pair1
->one
->path
;
258 oidcpy(&ci
->ren1_other
.oid
, &src_entry1
->stages
[ostage1
].oid
);
259 ci
->ren1_other
.mode
= src_entry1
->stages
[ostage1
].mode
;
261 ci
->ren2_other
.path
= pair2
->one
->path
;
262 oidcpy(&ci
->ren2_other
.oid
, &src_entry2
->stages
[ostage2
].oid
);
263 ci
->ren2_other
.mode
= src_entry2
->stages
[ostage2
].mode
;
267 static int show(struct merge_options
*o
, int v
)
269 return (!o
->call_depth
&& o
->verbosity
>= v
) || o
->verbosity
>= 5;
272 __attribute__((format (printf
, 3, 4)))
273 static void output(struct merge_options
*o
, int v
, const char *fmt
, ...)
280 strbuf_addchars(&o
->obuf
, ' ', o
->call_depth
* 2);
283 strbuf_vaddf(&o
->obuf
, fmt
, ap
);
286 strbuf_addch(&o
->obuf
, '\n');
287 if (!o
->buffer_output
)
291 static void output_commit_title(struct merge_options
*o
, struct commit
*commit
)
293 struct merge_remote_desc
*desc
;
295 strbuf_addchars(&o
->obuf
, ' ', o
->call_depth
* 2);
296 desc
= merge_remote_util(commit
);
298 strbuf_addf(&o
->obuf
, "virtual %s\n", desc
->name
);
300 strbuf_add_unique_abbrev(&o
->obuf
, &commit
->object
.oid
,
302 strbuf_addch(&o
->obuf
, ' ');
303 if (parse_commit(commit
) != 0)
304 strbuf_addstr(&o
->obuf
, _("(bad commit)\n"));
307 const char *msg
= get_commit_buffer(commit
, NULL
);
308 int len
= find_commit_subject(msg
, &title
);
310 strbuf_addf(&o
->obuf
, "%.*s\n", len
, title
);
311 unuse_commit_buffer(commit
, msg
);
317 static int add_cacheinfo(struct merge_options
*o
,
318 unsigned int mode
, const struct object_id
*oid
,
319 const char *path
, int stage
, int refresh
, int options
)
321 struct cache_entry
*ce
;
324 ce
= make_cache_entry(&the_index
, mode
, oid
? oid
: &null_oid
, path
, stage
, 0);
326 return err(o
, _("add_cacheinfo failed for path '%s'; merge aborting."), path
);
328 ret
= add_cache_entry(ce
, options
);
330 struct cache_entry
*nce
;
332 nce
= refresh_cache_entry(&the_index
, ce
, CE_MATCH_REFRESH
| CE_MATCH_IGNORE_MISSING
);
334 return err(o
, _("add_cacheinfo failed to refresh for path '%s'; merge aborting."), path
);
336 ret
= add_cache_entry(nce
, options
);
341 static void init_tree_desc_from_tree(struct tree_desc
*desc
, struct tree
*tree
)
344 init_tree_desc(desc
, tree
->buffer
, tree
->size
);
347 static int unpack_trees_start(struct merge_options
*o
,
353 struct tree_desc t
[3];
354 struct index_state tmp_index
= { NULL
};
356 memset(&o
->unpack_opts
, 0, sizeof(o
->unpack_opts
));
358 o
->unpack_opts
.index_only
= 1;
360 o
->unpack_opts
.update
= 1;
361 o
->unpack_opts
.merge
= 1;
362 o
->unpack_opts
.head_idx
= 2;
363 o
->unpack_opts
.fn
= threeway_merge
;
364 o
->unpack_opts
.src_index
= &the_index
;
365 o
->unpack_opts
.dst_index
= &tmp_index
;
366 o
->unpack_opts
.aggressive
= !merge_detect_rename(o
);
367 setup_unpack_trees_porcelain(&o
->unpack_opts
, "merge");
369 init_tree_desc_from_tree(t
+0, common
);
370 init_tree_desc_from_tree(t
+1, head
);
371 init_tree_desc_from_tree(t
+2, merge
);
373 rc
= unpack_trees(3, t
, &o
->unpack_opts
);
374 cache_tree_free(&active_cache_tree
);
377 * Update the_index to match the new results, AFTER saving a copy
378 * in o->orig_index. Update src_index to point to the saved copy.
379 * (verify_uptodate() checks src_index, and the original index is
380 * the one that had the necessary modification timestamps.)
382 o
->orig_index
= the_index
;
383 the_index
= tmp_index
;
384 o
->unpack_opts
.src_index
= &o
->orig_index
;
389 static void unpack_trees_finish(struct merge_options
*o
)
391 discard_index(&o
->orig_index
);
392 clear_unpack_trees_porcelain(&o
->unpack_opts
);
395 struct tree
*write_tree_from_memory(struct merge_options
*o
)
397 struct tree
*result
= NULL
;
399 if (unmerged_cache()) {
401 fprintf(stderr
, "BUG: There are unmerged index entries:\n");
402 for (i
= 0; i
< active_nr
; i
++) {
403 const struct cache_entry
*ce
= active_cache
[i
];
405 fprintf(stderr
, "BUG: %d %.*s\n", ce_stage(ce
),
406 (int)ce_namelen(ce
), ce
->name
);
408 BUG("unmerged index entries in merge-recursive.c");
411 if (!active_cache_tree
)
412 active_cache_tree
= cache_tree();
414 if (!cache_tree_fully_valid(active_cache_tree
) &&
415 cache_tree_update(&the_index
, 0) < 0) {
416 err(o
, _("error building trees"));
420 result
= lookup_tree(the_repository
, &active_cache_tree
->oid
);
425 static int save_files_dirs(const struct object_id
*oid
,
426 struct strbuf
*base
, const char *path
,
427 unsigned int mode
, int stage
, void *context
)
429 struct path_hashmap_entry
*entry
;
430 int baselen
= base
->len
;
431 struct merge_options
*o
= context
;
433 strbuf_addstr(base
, path
);
435 FLEX_ALLOC_MEM(entry
, path
, base
->buf
, base
->len
);
436 hashmap_entry_init(entry
, path_hash(entry
->path
));
437 hashmap_add(&o
->current_file_dir_set
, entry
);
439 strbuf_setlen(base
, baselen
);
440 return (S_ISDIR(mode
) ? READ_TREE_RECURSIVE
: 0);
443 static void get_files_dirs(struct merge_options
*o
, struct tree
*tree
)
445 struct pathspec match_all
;
446 memset(&match_all
, 0, sizeof(match_all
));
447 read_tree_recursive(tree
, "", 0, 0, &match_all
, save_files_dirs
, o
);
450 static int get_tree_entry_if_blob(const struct object_id
*tree
,
452 struct object_id
*hashy
,
453 unsigned int *mode_o
)
457 ret
= get_tree_entry(tree
, path
, hashy
, mode_o
);
458 if (S_ISDIR(*mode_o
)) {
459 oidcpy(hashy
, &null_oid
);
466 * Returns an index_entry instance which doesn't have to correspond to
467 * a real cache entry in Git's index.
469 static struct stage_data
*insert_stage_data(const char *path
,
470 struct tree
*o
, struct tree
*a
, struct tree
*b
,
471 struct string_list
*entries
)
473 struct string_list_item
*item
;
474 struct stage_data
*e
= xcalloc(1, sizeof(struct stage_data
));
475 get_tree_entry_if_blob(&o
->object
.oid
, path
,
476 &e
->stages
[1].oid
, &e
->stages
[1].mode
);
477 get_tree_entry_if_blob(&a
->object
.oid
, path
,
478 &e
->stages
[2].oid
, &e
->stages
[2].mode
);
479 get_tree_entry_if_blob(&b
->object
.oid
, path
,
480 &e
->stages
[3].oid
, &e
->stages
[3].mode
);
481 item
= string_list_insert(entries
, path
);
487 * Create a dictionary mapping file names to stage_data objects. The
488 * dictionary contains one entry for every path with a non-zero stage entry.
490 static struct string_list
*get_unmerged(void)
492 struct string_list
*unmerged
= xcalloc(1, sizeof(struct string_list
));
495 unmerged
->strdup_strings
= 1;
497 for (i
= 0; i
< active_nr
; i
++) {
498 struct string_list_item
*item
;
499 struct stage_data
*e
;
500 const struct cache_entry
*ce
= active_cache
[i
];
504 item
= string_list_lookup(unmerged
, ce
->name
);
506 item
= string_list_insert(unmerged
, ce
->name
);
507 item
->util
= xcalloc(1, sizeof(struct stage_data
));
510 e
->stages
[ce_stage(ce
)].mode
= ce
->ce_mode
;
511 oidcpy(&e
->stages
[ce_stage(ce
)].oid
, &ce
->oid
);
517 static int string_list_df_name_compare(const char *one
, const char *two
)
519 int onelen
= strlen(one
);
520 int twolen
= strlen(two
);
522 * Here we only care that entries for D/F conflicts are
523 * adjacent, in particular with the file of the D/F conflict
524 * appearing before files below the corresponding directory.
525 * The order of the rest of the list is irrelevant for us.
527 * To achieve this, we sort with df_name_compare and provide
528 * the mode S_IFDIR so that D/F conflicts will sort correctly.
529 * We use the mode S_IFDIR for everything else for simplicity,
530 * since in other cases any changes in their order due to
531 * sorting cause no problems for us.
533 int cmp
= df_name_compare(one
, onelen
, S_IFDIR
,
534 two
, twolen
, S_IFDIR
);
536 * Now that 'foo' and 'foo/bar' compare equal, we have to make sure
537 * that 'foo' comes before 'foo/bar'.
541 return onelen
- twolen
;
544 static void record_df_conflict_files(struct merge_options
*o
,
545 struct string_list
*entries
)
547 /* If there is a D/F conflict and the file for such a conflict
548 * currently exists in the working tree, we want to allow it to be
549 * removed to make room for the corresponding directory if needed.
550 * The files underneath the directories of such D/F conflicts will
551 * be processed before the corresponding file involved in the D/F
552 * conflict. If the D/F directory ends up being removed by the
553 * merge, then we won't have to touch the D/F file. If the D/F
554 * directory needs to be written to the working copy, then the D/F
555 * file will simply be removed (in make_room_for_path()) to make
556 * room for the necessary paths. Note that if both the directory
557 * and the file need to be present, then the D/F file will be
558 * reinstated with a new unique name at the time it is processed.
560 struct string_list df_sorted_entries
= STRING_LIST_INIT_NODUP
;
561 const char *last_file
= NULL
;
566 * If we're merging merge-bases, we don't want to bother with
567 * any working directory changes.
572 /* Ensure D/F conflicts are adjacent in the entries list. */
573 for (i
= 0; i
< entries
->nr
; i
++) {
574 struct string_list_item
*next
= &entries
->items
[i
];
575 string_list_append(&df_sorted_entries
, next
->string
)->util
=
578 df_sorted_entries
.cmp
= string_list_df_name_compare
;
579 string_list_sort(&df_sorted_entries
);
581 string_list_clear(&o
->df_conflict_file_set
, 1);
582 for (i
= 0; i
< df_sorted_entries
.nr
; i
++) {
583 const char *path
= df_sorted_entries
.items
[i
].string
;
584 int len
= strlen(path
);
585 struct stage_data
*e
= df_sorted_entries
.items
[i
].util
;
588 * Check if last_file & path correspond to a D/F conflict;
589 * i.e. whether path is last_file+'/'+<something>.
590 * If so, record that it's okay to remove last_file to make
591 * room for path and friends if needed.
595 memcmp(path
, last_file
, last_len
) == 0 &&
596 path
[last_len
] == '/') {
597 string_list_insert(&o
->df_conflict_file_set
, last_file
);
601 * Determine whether path could exist as a file in the
602 * working directory as a possible D/F conflict. This
603 * will only occur when it exists in stage 2 as a
606 if (S_ISREG(e
->stages
[2].mode
) || S_ISLNK(e
->stages
[2].mode
)) {
613 string_list_clear(&df_sorted_entries
, 0);
617 struct diff_filepair
*pair
;
619 * Purpose of src_entry and dst_entry:
621 * If 'before' is renamed to 'after' then src_entry will contain
622 * the versions of 'before' from the merge_base, HEAD, and MERGE in
623 * stages 1, 2, and 3; dst_entry will contain the respective
624 * versions of 'after' in corresponding locations. Thus, we have a
625 * total of six modes and oids, though some will be null. (Stage 0
626 * is ignored; we're interested in handling conflicts.)
628 * Since we don't turn on break-rewrites by default, neither
629 * src_entry nor dst_entry can have all three of their stages have
630 * non-null oids, meaning at most four of the six will be non-null.
631 * Also, since this is a rename, both src_entry and dst_entry will
632 * have at least one non-null oid, meaning at least two will be
633 * non-null. Of the six oids, a typical rename will have three be
634 * non-null. Only two implies a rename/delete, and four implies a
637 struct stage_data
*src_entry
;
638 struct stage_data
*dst_entry
;
639 unsigned add_turned_into_rename
:1;
640 unsigned processed
:1;
643 static int update_stages(struct merge_options
*opt
, const char *path
,
644 const struct diff_filespec
*o
,
645 const struct diff_filespec
*a
,
646 const struct diff_filespec
*b
)
650 * NOTE: It is usually a bad idea to call update_stages on a path
651 * before calling update_file on that same path, since it can
652 * sometimes lead to spurious "refusing to lose untracked file..."
653 * messages from update_file (via make_room_for path via
654 * would_lose_untracked). Instead, reverse the order of the calls
655 * (executing update_file first and then update_stages).
658 int options
= ADD_CACHE_OK_TO_ADD
| ADD_CACHE_SKIP_DFCHECK
;
660 if (remove_file_from_cache(path
))
663 if (add_cacheinfo(opt
, o
->mode
, &o
->oid
, path
, 1, 0, options
))
666 if (add_cacheinfo(opt
, a
->mode
, &a
->oid
, path
, 2, 0, options
))
669 if (add_cacheinfo(opt
, b
->mode
, &b
->oid
, path
, 3, 0, options
))
674 static int update_stages_for_stage_data(struct merge_options
*opt
,
676 const struct stage_data
*stage_data
)
678 struct diff_filespec o
, a
, b
;
680 o
.mode
= stage_data
->stages
[1].mode
;
681 oidcpy(&o
.oid
, &stage_data
->stages
[1].oid
);
683 a
.mode
= stage_data
->stages
[2].mode
;
684 oidcpy(&a
.oid
, &stage_data
->stages
[2].oid
);
686 b
.mode
= stage_data
->stages
[3].mode
;
687 oidcpy(&b
.oid
, &stage_data
->stages
[3].oid
);
689 return update_stages(opt
, path
,
690 is_null_oid(&o
.oid
) ? NULL
: &o
,
691 is_null_oid(&a
.oid
) ? NULL
: &a
,
692 is_null_oid(&b
.oid
) ? NULL
: &b
);
695 static void update_entry(struct stage_data
*entry
,
696 struct diff_filespec
*o
,
697 struct diff_filespec
*a
,
698 struct diff_filespec
*b
)
700 entry
->processed
= 0;
701 entry
->stages
[1].mode
= o
->mode
;
702 entry
->stages
[2].mode
= a
->mode
;
703 entry
->stages
[3].mode
= b
->mode
;
704 oidcpy(&entry
->stages
[1].oid
, &o
->oid
);
705 oidcpy(&entry
->stages
[2].oid
, &a
->oid
);
706 oidcpy(&entry
->stages
[3].oid
, &b
->oid
);
709 static int remove_file(struct merge_options
*o
, int clean
,
710 const char *path
, int no_wd
)
712 int update_cache
= o
->call_depth
|| clean
;
713 int update_working_directory
= !o
->call_depth
&& !no_wd
;
716 if (remove_file_from_cache(path
))
719 if (update_working_directory
) {
721 struct cache_entry
*ce
;
722 ce
= cache_file_exists(path
, strlen(path
), ignore_case
);
723 if (ce
&& ce_stage(ce
) == 0 && strcmp(path
, ce
->name
))
726 if (remove_path(path
))
732 /* add a string to a strbuf, but converting "/" to "_" */
733 static void add_flattened_path(struct strbuf
*out
, const char *s
)
736 strbuf_addstr(out
, s
);
737 for (; i
< out
->len
; i
++)
738 if (out
->buf
[i
] == '/')
742 static char *unique_path(struct merge_options
*o
, const char *path
, const char *branch
)
744 struct path_hashmap_entry
*entry
;
745 struct strbuf newpath
= STRBUF_INIT
;
749 strbuf_addf(&newpath
, "%s~", path
);
750 add_flattened_path(&newpath
, branch
);
752 base_len
= newpath
.len
;
753 while (hashmap_get_from_hash(&o
->current_file_dir_set
,
754 path_hash(newpath
.buf
), newpath
.buf
) ||
755 (!o
->call_depth
&& file_exists(newpath
.buf
))) {
756 strbuf_setlen(&newpath
, base_len
);
757 strbuf_addf(&newpath
, "_%d", suffix
++);
760 FLEX_ALLOC_MEM(entry
, path
, newpath
.buf
, newpath
.len
);
761 hashmap_entry_init(entry
, path_hash(entry
->path
));
762 hashmap_add(&o
->current_file_dir_set
, entry
);
763 return strbuf_detach(&newpath
, NULL
);
767 * Check whether a directory in the index is in the way of an incoming
768 * file. Return 1 if so. If check_working_copy is non-zero, also
769 * check the working directory. If empty_ok is non-zero, also return
770 * 0 in the case where the working-tree dir exists but is empty.
772 static int dir_in_way(const char *path
, int check_working_copy
, int empty_ok
)
775 struct strbuf dirpath
= STRBUF_INIT
;
778 strbuf_addstr(&dirpath
, path
);
779 strbuf_addch(&dirpath
, '/');
781 pos
= cache_name_pos(dirpath
.buf
, dirpath
.len
);
785 if (pos
< active_nr
&&
786 !strncmp(dirpath
.buf
, active_cache
[pos
]->name
, dirpath
.len
)) {
787 strbuf_release(&dirpath
);
791 strbuf_release(&dirpath
);
792 return check_working_copy
&& !lstat(path
, &st
) && S_ISDIR(st
.st_mode
) &&
793 !(empty_ok
&& is_empty_dir(path
));
797 * Returns whether path was tracked in the index before the merge started,
798 * and its oid and mode match the specified values
800 static int was_tracked_and_matches(struct merge_options
*o
, const char *path
,
801 const struct object_id
*oid
, unsigned mode
)
803 int pos
= index_name_pos(&o
->orig_index
, path
, strlen(path
));
804 struct cache_entry
*ce
;
807 /* we were not tracking this path before the merge */
810 /* See if the file we were tracking before matches */
811 ce
= o
->orig_index
.cache
[pos
];
812 return (oid_eq(&ce
->oid
, oid
) && ce
->ce_mode
== mode
);
816 * Returns whether path was tracked in the index before the merge started
818 static int was_tracked(struct merge_options
*o
, const char *path
)
820 int pos
= index_name_pos(&o
->orig_index
, path
, strlen(path
));
823 /* we were tracking this path before the merge */
829 static int would_lose_untracked(const char *path
)
832 * This may look like it can be simplified to:
833 * return !was_tracked(o, path) && file_exists(path)
834 * but it can't. This function needs to know whether path was in
835 * the working tree due to EITHER having been tracked in the index
836 * before the merge OR having been put into the working copy and
837 * index by unpack_trees(). Due to that either-or requirement, we
838 * check the current index instead of the original one.
840 * Note that we do not need to worry about merge-recursive itself
841 * updating the index after unpack_trees() and before calling this
842 * function, because we strictly require all code paths in
843 * merge-recursive to update the working tree first and the index
844 * second. Doing otherwise would break
845 * update_file()/would_lose_untracked(); see every comment in this
846 * file which mentions "update_stages".
848 int pos
= cache_name_pos(path
, strlen(path
));
852 while (pos
< active_nr
&&
853 !strcmp(path
, active_cache
[pos
]->name
)) {
855 * If stage #0, it is definitely tracked.
856 * If it has stage #2 then it was tracked
857 * before this merge started. All other
858 * cases the path was not tracked.
860 switch (ce_stage(active_cache
[pos
])) {
867 return file_exists(path
);
870 static int was_dirty(struct merge_options
*o
, const char *path
)
872 struct cache_entry
*ce
;
875 if (o
->call_depth
|| !was_tracked(o
, path
))
878 ce
= index_file_exists(o
->unpack_opts
.src_index
,
879 path
, strlen(path
), ignore_case
);
880 dirty
= verify_uptodate(ce
, &o
->unpack_opts
) != 0;
884 static int make_room_for_path(struct merge_options
*o
, const char *path
)
887 const char *msg
= _("failed to create path '%s'%s");
889 /* Unlink any D/F conflict files that are in the way */
890 for (i
= 0; i
< o
->df_conflict_file_set
.nr
; i
++) {
891 const char *df_path
= o
->df_conflict_file_set
.items
[i
].string
;
892 size_t pathlen
= strlen(path
);
893 size_t df_pathlen
= strlen(df_path
);
894 if (df_pathlen
< pathlen
&&
895 path
[df_pathlen
] == '/' &&
896 strncmp(path
, df_path
, df_pathlen
) == 0) {
898 _("Removing %s to make room for subdirectory\n"),
901 unsorted_string_list_delete_item(&o
->df_conflict_file_set
,
907 /* Make sure leading directories are created */
908 status
= safe_create_leading_directories_const(path
);
910 if (status
== SCLD_EXISTS
)
911 /* something else exists */
912 return err(o
, msg
, path
, _(": perhaps a D/F conflict?"));
913 return err(o
, msg
, path
, "");
917 * Do not unlink a file in the work tree if we are not
920 if (would_lose_untracked(path
))
921 return err(o
, _("refusing to lose untracked file at '%s'"),
924 /* Successful unlink is good.. */
927 /* .. and so is no existing file */
930 /* .. but not some other error (who really cares what?) */
931 return err(o
, msg
, path
, _(": perhaps a D/F conflict?"));
934 static int update_file_flags(struct merge_options
*o
,
935 const struct object_id
*oid
,
947 enum object_type type
;
951 if (S_ISGITLINK(mode
)) {
953 * We may later decide to recursively descend into
954 * the submodule directory and update its index
955 * and/or work tree, but we do not do that now.
961 buf
= read_object_file(oid
, &type
, &size
);
963 return err(o
, _("cannot read object %s '%s'"), oid_to_hex(oid
), path
);
964 if (type
!= OBJ_BLOB
) {
965 ret
= err(o
, _("blob expected for %s '%s'"), oid_to_hex(oid
), path
);
969 struct strbuf strbuf
= STRBUF_INIT
;
970 if (convert_to_working_tree(&the_index
, path
, buf
, size
, &strbuf
)) {
973 buf
= strbuf_detach(&strbuf
, NULL
);
977 if (make_room_for_path(o
, path
) < 0) {
981 if (S_ISREG(mode
) || (!has_symlinks
&& S_ISLNK(mode
))) {
987 fd
= open(path
, O_WRONLY
| O_TRUNC
| O_CREAT
, mode
);
989 ret
= err(o
, _("failed to open '%s': %s"),
990 path
, strerror(errno
));
993 write_in_full(fd
, buf
, size
);
995 } else if (S_ISLNK(mode
)) {
996 char *lnk
= xmemdupz(buf
, size
);
997 safe_create_leading_directories_const(path
);
999 if (symlink(lnk
, path
))
1000 ret
= err(o
, _("failed to symlink '%s': %s"),
1001 path
, strerror(errno
));
1005 _("do not know what to do with %06o %s '%s'"),
1006 mode
, oid_to_hex(oid
), path
);
1011 if (!ret
&& update_cache
)
1012 if (add_cacheinfo(o
, mode
, oid
, path
, 0, update_wd
,
1013 ADD_CACHE_OK_TO_ADD
))
1018 static int update_file(struct merge_options
*o
,
1020 const struct object_id
*oid
,
1024 return update_file_flags(o
, oid
, mode
, path
, o
->call_depth
|| clean
, !o
->call_depth
);
1027 /* Low level file merging, update and removal */
1029 struct merge_file_info
{
1030 struct object_id oid
;
1036 static int merge_3way(struct merge_options
*o
,
1037 mmbuffer_t
*result_buf
,
1038 const struct diff_filespec
*one
,
1039 const struct diff_filespec
*a
,
1040 const struct diff_filespec
*b
,
1041 const char *branch1
,
1042 const char *branch2
)
1044 mmfile_t orig
, src1
, src2
;
1045 struct ll_merge_options ll_opts
= {0};
1046 char *base_name
, *name1
, *name2
;
1049 ll_opts
.renormalize
= o
->renormalize
;
1050 ll_opts
.xdl_opts
= o
->xdl_opts
;
1052 if (o
->call_depth
) {
1053 ll_opts
.virtual_ancestor
= 1;
1054 ll_opts
.variant
= 0;
1056 switch (o
->recursive_variant
) {
1057 case MERGE_RECURSIVE_OURS
:
1058 ll_opts
.variant
= XDL_MERGE_FAVOR_OURS
;
1060 case MERGE_RECURSIVE_THEIRS
:
1061 ll_opts
.variant
= XDL_MERGE_FAVOR_THEIRS
;
1064 ll_opts
.variant
= 0;
1069 if (strcmp(a
->path
, b
->path
) ||
1070 (o
->ancestor
!= NULL
&& strcmp(a
->path
, one
->path
) != 0)) {
1071 base_name
= o
->ancestor
== NULL
? NULL
:
1072 mkpathdup("%s:%s", o
->ancestor
, one
->path
);
1073 name1
= mkpathdup("%s:%s", branch1
, a
->path
);
1074 name2
= mkpathdup("%s:%s", branch2
, b
->path
);
1076 base_name
= o
->ancestor
== NULL
? NULL
:
1077 mkpathdup("%s", o
->ancestor
);
1078 name1
= mkpathdup("%s", branch1
);
1079 name2
= mkpathdup("%s", branch2
);
1082 read_mmblob(&orig
, &one
->oid
);
1083 read_mmblob(&src1
, &a
->oid
);
1084 read_mmblob(&src2
, &b
->oid
);
1086 merge_status
= ll_merge(result_buf
, a
->path
, &orig
, base_name
,
1087 &src1
, name1
, &src2
, name2
, &ll_opts
);
1095 return merge_status
;
1098 static int find_first_merges(struct object_array
*result
, const char *path
,
1099 struct commit
*a
, struct commit
*b
)
1102 struct object_array merges
= OBJECT_ARRAY_INIT
;
1103 struct commit
*commit
;
1104 int contains_another
;
1106 char merged_revision
[42];
1107 const char *rev_args
[] = { "rev-list", "--merges", "--ancestry-path",
1108 "--all", merged_revision
, NULL
};
1109 struct rev_info revs
;
1110 struct setup_revision_opt rev_opts
;
1112 memset(result
, 0, sizeof(struct object_array
));
1113 memset(&rev_opts
, 0, sizeof(rev_opts
));
1115 /* get all revisions that merge commit a */
1116 xsnprintf(merged_revision
, sizeof(merged_revision
), "^%s",
1117 oid_to_hex(&a
->object
.oid
));
1118 init_revisions(&revs
, NULL
);
1119 rev_opts
.submodule
= path
;
1120 /* FIXME: can't handle linked worktrees in submodules yet */
1121 revs
.single_worktree
= path
!= NULL
;
1122 setup_revisions(ARRAY_SIZE(rev_args
)-1, rev_args
, &revs
, &rev_opts
);
1124 /* save all revisions from the above list that contain b */
1125 if (prepare_revision_walk(&revs
))
1126 die("revision walk setup failed");
1127 while ((commit
= get_revision(&revs
)) != NULL
) {
1128 struct object
*o
= &(commit
->object
);
1129 if (in_merge_bases(b
, commit
))
1130 add_object_array(o
, NULL
, &merges
);
1132 reset_revision_walk();
1134 /* Now we've got all merges that contain a and b. Prune all
1135 * merges that contain another found merge and save them in
1138 for (i
= 0; i
< merges
.nr
; i
++) {
1139 struct commit
*m1
= (struct commit
*) merges
.objects
[i
].item
;
1141 contains_another
= 0;
1142 for (j
= 0; j
< merges
.nr
; j
++) {
1143 struct commit
*m2
= (struct commit
*) merges
.objects
[j
].item
;
1144 if (i
!= j
&& in_merge_bases(m2
, m1
)) {
1145 contains_another
= 1;
1150 if (!contains_another
)
1151 add_object_array(merges
.objects
[i
].item
, NULL
, result
);
1154 object_array_clear(&merges
);
1158 static void print_commit(struct commit
*commit
)
1160 struct strbuf sb
= STRBUF_INIT
;
1161 struct pretty_print_context ctx
= {0};
1162 ctx
.date_mode
.type
= DATE_NORMAL
;
1163 format_commit_message(commit
, " %h: %m %s", &sb
, &ctx
);
1164 fprintf(stderr
, "%s\n", sb
.buf
);
1165 strbuf_release(&sb
);
1168 static int merge_submodule(struct merge_options
*o
,
1169 struct object_id
*result
, const char *path
,
1170 const struct object_id
*base
, const struct object_id
*a
,
1171 const struct object_id
*b
)
1173 struct commit
*commit_base
, *commit_a
, *commit_b
;
1175 struct object_array merges
;
1178 int search
= !o
->call_depth
;
1180 /* store a in result in case we fail */
1183 /* we can not handle deletion conflicts */
1184 if (is_null_oid(base
))
1191 if (add_submodule_odb(path
)) {
1192 output(o
, 1, _("Failed to merge submodule %s (not checked out)"), path
);
1196 if (!(commit_base
= lookup_commit_reference(the_repository
, base
)) ||
1197 !(commit_a
= lookup_commit_reference(the_repository
, a
)) ||
1198 !(commit_b
= lookup_commit_reference(the_repository
, b
))) {
1199 output(o
, 1, _("Failed to merge submodule %s (commits not present)"), path
);
1203 /* check whether both changes are forward */
1204 if (!in_merge_bases(commit_base
, commit_a
) ||
1205 !in_merge_bases(commit_base
, commit_b
)) {
1206 output(o
, 1, _("Failed to merge submodule %s (commits don't follow merge-base)"), path
);
1210 /* Case #1: a is contained in b or vice versa */
1211 if (in_merge_bases(commit_a
, commit_b
)) {
1214 output(o
, 3, _("Fast-forwarding submodule %s to the following commit:"), path
);
1215 output_commit_title(o
, commit_b
);
1216 } else if (show(o
, 2))
1217 output(o
, 2, _("Fast-forwarding submodule %s"), path
);
1223 if (in_merge_bases(commit_b
, commit_a
)) {
1226 output(o
, 3, _("Fast-forwarding submodule %s to the following commit:"), path
);
1227 output_commit_title(o
, commit_a
);
1228 } else if (show(o
, 2))
1229 output(o
, 2, _("Fast-forwarding submodule %s"), path
);
1237 * Case #2: There are one or more merges that contain a and b in
1238 * the submodule. If there is only one, then present it as a
1239 * suggestion to the user, but leave it marked unmerged so the
1240 * user needs to confirm the resolution.
1243 /* Skip the search if makes no sense to the calling context. */
1247 /* find commit which merges them */
1248 parent_count
= find_first_merges(&merges
, path
, commit_a
, commit_b
);
1249 switch (parent_count
) {
1251 output(o
, 1, _("Failed to merge submodule %s (merge following commits not found)"), path
);
1255 output(o
, 1, _("Failed to merge submodule %s (not fast-forward)"), path
);
1256 output(o
, 2, _("Found a possible merge resolution for the submodule:\n"));
1257 print_commit((struct commit
*) merges
.objects
[0].item
);
1259 "If this is correct simply add it to the index "
1262 " git update-index --cacheinfo 160000 %s \"%s\"\n\n"
1263 "which will accept this suggestion.\n"),
1264 oid_to_hex(&merges
.objects
[0].item
->oid
), path
);
1268 output(o
, 1, _("Failed to merge submodule %s (multiple merges found)"), path
);
1269 for (i
= 0; i
< merges
.nr
; i
++)
1270 print_commit((struct commit
*) merges
.objects
[i
].item
);
1273 object_array_clear(&merges
);
1277 static int merge_mode_and_contents(struct merge_options
*o
,
1278 const struct diff_filespec
*one
,
1279 const struct diff_filespec
*a
,
1280 const struct diff_filespec
*b
,
1281 const char *filename
,
1282 const char *branch1
,
1283 const char *branch2
,
1284 struct merge_file_info
*result
)
1289 if ((S_IFMT
& a
->mode
) != (S_IFMT
& b
->mode
)) {
1291 if (S_ISREG(a
->mode
)) {
1292 result
->mode
= a
->mode
;
1293 oidcpy(&result
->oid
, &a
->oid
);
1295 result
->mode
= b
->mode
;
1296 oidcpy(&result
->oid
, &b
->oid
);
1299 if (!oid_eq(&a
->oid
, &one
->oid
) && !oid_eq(&b
->oid
, &one
->oid
))
1305 if (a
->mode
== b
->mode
|| a
->mode
== one
->mode
)
1306 result
->mode
= b
->mode
;
1308 result
->mode
= a
->mode
;
1309 if (b
->mode
!= one
->mode
) {
1315 if (oid_eq(&a
->oid
, &b
->oid
) || oid_eq(&a
->oid
, &one
->oid
))
1316 oidcpy(&result
->oid
, &b
->oid
);
1317 else if (oid_eq(&b
->oid
, &one
->oid
))
1318 oidcpy(&result
->oid
, &a
->oid
);
1319 else if (S_ISREG(a
->mode
)) {
1320 mmbuffer_t result_buf
;
1321 int ret
= 0, merge_status
;
1323 merge_status
= merge_3way(o
, &result_buf
, one
, a
, b
,
1326 if ((merge_status
< 0) || !result_buf
.ptr
)
1327 ret
= err(o
, _("Failed to execute internal merge"));
1330 write_object_file(result_buf
.ptr
, result_buf
.size
,
1331 blob_type
, &result
->oid
))
1332 ret
= err(o
, _("Unable to add %s to database"),
1335 free(result_buf
.ptr
);
1338 result
->clean
= (merge_status
== 0);
1339 } else if (S_ISGITLINK(a
->mode
)) {
1340 result
->clean
= merge_submodule(o
, &result
->oid
,
1345 } else if (S_ISLNK(a
->mode
)) {
1346 switch (o
->recursive_variant
) {
1347 case MERGE_RECURSIVE_NORMAL
:
1348 oidcpy(&result
->oid
, &a
->oid
);
1349 if (!oid_eq(&a
->oid
, &b
->oid
))
1352 case MERGE_RECURSIVE_OURS
:
1353 oidcpy(&result
->oid
, &a
->oid
);
1355 case MERGE_RECURSIVE_THEIRS
:
1356 oidcpy(&result
->oid
, &b
->oid
);
1360 BUG("unsupported object type in the tree");
1364 output(o
, 2, _("Auto-merging %s"), filename
);
1369 static int handle_rename_via_dir(struct merge_options
*o
,
1370 struct diff_filepair
*pair
,
1371 const char *rename_branch
,
1372 const char *other_branch
)
1375 * Handle file adds that need to be renamed due to directory rename
1376 * detection. This differs from handle_rename_normal, because
1377 * there is no content merge to do; just move the file into the
1378 * desired final location.
1380 const struct diff_filespec
*dest
= pair
->two
;
1382 if (!o
->call_depth
&& would_lose_untracked(dest
->path
)) {
1383 char *alt_path
= unique_path(o
, dest
->path
, rename_branch
);
1385 output(o
, 1, _("Error: Refusing to lose untracked file at %s; "
1386 "writing to %s instead."),
1387 dest
->path
, alt_path
);
1389 * Write the file in worktree at alt_path, but not in the
1390 * index. Instead, write to dest->path for the index but
1391 * only at the higher appropriate stage.
1393 if (update_file(o
, 0, &dest
->oid
, dest
->mode
, alt_path
))
1396 return update_stages(o
, dest
->path
, NULL
,
1397 rename_branch
== o
->branch1
? dest
: NULL
,
1398 rename_branch
== o
->branch1
? NULL
: dest
);
1401 /* Update dest->path both in index and in worktree */
1402 if (update_file(o
, 1, &dest
->oid
, dest
->mode
, dest
->path
))
1407 static int handle_change_delete(struct merge_options
*o
,
1408 const char *path
, const char *old_path
,
1409 const struct object_id
*o_oid
, int o_mode
,
1410 const struct object_id
*changed_oid
,
1412 const char *change_branch
,
1413 const char *delete_branch
,
1414 const char *change
, const char *change_past
)
1416 char *alt_path
= NULL
;
1417 const char *update_path
= path
;
1420 if (dir_in_way(path
, !o
->call_depth
, 0) ||
1421 (!o
->call_depth
&& would_lose_untracked(path
))) {
1422 update_path
= alt_path
= unique_path(o
, path
, change_branch
);
1425 if (o
->call_depth
) {
1427 * We cannot arbitrarily accept either a_sha or b_sha as
1428 * correct; since there is no true "middle point" between
1429 * them, simply reuse the base version for virtual merge base.
1431 ret
= remove_file_from_cache(path
);
1433 ret
= update_file(o
, 0, o_oid
, o_mode
, update_path
);
1436 * Despite the four nearly duplicate messages and argument
1437 * lists below and the ugliness of the nested if-statements,
1438 * having complete messages makes the job easier for
1441 * The slight variance among the cases is due to the fact
1443 * 1) directory/file conflicts (in effect if
1444 * !alt_path) could cause us to need to write the
1445 * file to a different path.
1446 * 2) renames (in effect if !old_path) could mean that
1447 * there are two names for the path that the user
1448 * may know the file by.
1452 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1453 "and %s in %s. Version %s of %s left in tree."),
1454 change
, path
, delete_branch
, change_past
,
1455 change_branch
, change_branch
, path
);
1457 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1458 "and %s to %s in %s. Version %s of %s left in tree."),
1459 change
, old_path
, delete_branch
, change_past
, path
,
1460 change_branch
, change_branch
, path
);
1464 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1465 "and %s in %s. Version %s of %s left in tree at %s."),
1466 change
, path
, delete_branch
, change_past
,
1467 change_branch
, change_branch
, path
, alt_path
);
1469 output(o
, 1, _("CONFLICT (%s/delete): %s deleted in %s "
1470 "and %s to %s in %s. Version %s of %s left in tree at %s."),
1471 change
, old_path
, delete_branch
, change_past
, path
,
1472 change_branch
, change_branch
, path
, alt_path
);
1476 * No need to call update_file() on path when change_branch ==
1477 * o->branch1 && !alt_path, since that would needlessly touch
1478 * path. We could call update_file_flags() with update_cache=0
1479 * and update_wd=0, but that's a no-op.
1481 if (change_branch
!= o
->branch1
|| alt_path
)
1482 ret
= update_file(o
, 0, changed_oid
, changed_mode
, update_path
);
1489 static int handle_rename_delete(struct merge_options
*o
,
1490 struct diff_filepair
*pair
,
1491 const char *rename_branch
,
1492 const char *delete_branch
)
1494 const struct diff_filespec
*orig
= pair
->one
;
1495 const struct diff_filespec
*dest
= pair
->two
;
1497 if (handle_change_delete(o
,
1498 o
->call_depth
? orig
->path
: dest
->path
,
1499 o
->call_depth
? NULL
: orig
->path
,
1500 &orig
->oid
, orig
->mode
,
1501 &dest
->oid
, dest
->mode
,
1502 rename_branch
, delete_branch
,
1503 _("rename"), _("renamed")))
1507 return remove_file_from_cache(dest
->path
);
1509 return update_stages(o
, dest
->path
, NULL
,
1510 rename_branch
== o
->branch1
? dest
: NULL
,
1511 rename_branch
== o
->branch1
? NULL
: dest
);
1514 static struct diff_filespec
*filespec_from_entry(struct diff_filespec
*target
,
1515 struct stage_data
*entry
,
1518 struct object_id
*oid
= &entry
->stages
[stage
].oid
;
1519 unsigned mode
= entry
->stages
[stage
].mode
;
1520 if (mode
== 0 || is_null_oid(oid
))
1522 oidcpy(&target
->oid
, oid
);
1523 target
->mode
= mode
;
1527 static int handle_file(struct merge_options
*o
,
1528 struct diff_filespec
*rename
,
1530 struct rename_conflict_info
*ci
)
1532 char *dst_name
= rename
->path
;
1533 struct stage_data
*dst_entry
;
1534 const char *cur_branch
, *other_branch
;
1535 struct diff_filespec other
;
1536 struct diff_filespec
*add
;
1540 dst_entry
= ci
->dst_entry1
;
1541 cur_branch
= ci
->branch1
;
1542 other_branch
= ci
->branch2
;
1544 dst_entry
= ci
->dst_entry2
;
1545 cur_branch
= ci
->branch2
;
1546 other_branch
= ci
->branch1
;
1549 add
= filespec_from_entry(&other
, dst_entry
, stage
^ 1);
1551 int ren_src_was_dirty
= was_dirty(o
, rename
->path
);
1552 char *add_name
= unique_path(o
, rename
->path
, other_branch
);
1553 if (update_file(o
, 0, &add
->oid
, add
->mode
, add_name
))
1556 if (ren_src_was_dirty
) {
1557 output(o
, 1, _("Refusing to lose dirty file at %s"),
1561 * Because the double negatives somehow keep confusing me...
1562 * 1) update_wd iff !ren_src_was_dirty.
1563 * 2) no_wd iff !update_wd
1564 * 3) so, no_wd == !!ren_src_was_dirty == ren_src_was_dirty
1566 remove_file(o
, 0, rename
->path
, ren_src_was_dirty
);
1567 dst_name
= unique_path(o
, rename
->path
, cur_branch
);
1569 if (dir_in_way(rename
->path
, !o
->call_depth
, 0)) {
1570 dst_name
= unique_path(o
, rename
->path
, cur_branch
);
1571 output(o
, 1, _("%s is a directory in %s adding as %s instead"),
1572 rename
->path
, other_branch
, dst_name
);
1573 } else if (!o
->call_depth
&&
1574 would_lose_untracked(rename
->path
)) {
1575 dst_name
= unique_path(o
, rename
->path
, cur_branch
);
1576 output(o
, 1, _("Refusing to lose untracked file at %s; "
1577 "adding as %s instead"),
1578 rename
->path
, dst_name
);
1581 if ((ret
= update_file(o
, 0, &rename
->oid
, rename
->mode
, dst_name
)))
1582 ; /* fall through, do allow dst_name to be released */
1583 else if (stage
== 2)
1584 ret
= update_stages(o
, rename
->path
, NULL
, rename
, add
);
1586 ret
= update_stages(o
, rename
->path
, NULL
, add
, rename
);
1588 if (dst_name
!= rename
->path
)
1594 static int handle_rename_rename_1to2(struct merge_options
*o
,
1595 struct rename_conflict_info
*ci
)
1597 /* One file was renamed in both branches, but to different names. */
1598 struct diff_filespec
*one
= ci
->pair1
->one
;
1599 struct diff_filespec
*a
= ci
->pair1
->two
;
1600 struct diff_filespec
*b
= ci
->pair2
->two
;
1602 output(o
, 1, _("CONFLICT (rename/rename): "
1603 "Rename \"%s\"->\"%s\" in branch \"%s\" "
1604 "rename \"%s\"->\"%s\" in \"%s\"%s"),
1605 one
->path
, a
->path
, ci
->branch1
,
1606 one
->path
, b
->path
, ci
->branch2
,
1607 o
->call_depth
? _(" (left unresolved)") : "");
1608 if (o
->call_depth
) {
1609 struct merge_file_info mfi
;
1610 struct diff_filespec other
;
1611 struct diff_filespec
*add
;
1612 if (merge_mode_and_contents(o
, one
, a
, b
, one
->path
,
1613 ci
->branch1
, ci
->branch2
, &mfi
))
1617 * FIXME: For rename/add-source conflicts (if we could detect
1618 * such), this is wrong. We should instead find a unique
1619 * pathname and then either rename the add-source file to that
1620 * unique path, or use that unique path instead of src here.
1622 if (update_file(o
, 0, &mfi
.oid
, mfi
.mode
, one
->path
))
1626 * Above, we put the merged content at the merge-base's
1627 * path. Now we usually need to delete both a->path and
1628 * b->path. However, the rename on each side of the merge
1629 * could also be involved in a rename/add conflict. In
1630 * such cases, we should keep the added file around,
1631 * resolving the conflict at that path in its favor.
1633 add
= filespec_from_entry(&other
, ci
->dst_entry1
, 2 ^ 1);
1635 if (update_file(o
, 0, &add
->oid
, add
->mode
, a
->path
))
1639 remove_file_from_cache(a
->path
);
1640 add
= filespec_from_entry(&other
, ci
->dst_entry2
, 3 ^ 1);
1642 if (update_file(o
, 0, &add
->oid
, add
->mode
, b
->path
))
1646 remove_file_from_cache(b
->path
);
1647 } else if (handle_file(o
, a
, 2, ci
) || handle_file(o
, b
, 3, ci
))
1653 static int handle_rename_rename_2to1(struct merge_options
*o
,
1654 struct rename_conflict_info
*ci
)
1656 /* Two files, a & b, were renamed to the same thing, c. */
1657 struct diff_filespec
*a
= ci
->pair1
->one
;
1658 struct diff_filespec
*b
= ci
->pair2
->one
;
1659 struct diff_filespec
*c1
= ci
->pair1
->two
;
1660 struct diff_filespec
*c2
= ci
->pair2
->two
;
1661 char *path
= c1
->path
; /* == c2->path */
1662 char *path_side_1_desc
;
1663 char *path_side_2_desc
;
1664 struct merge_file_info mfi_c1
;
1665 struct merge_file_info mfi_c2
;
1668 output(o
, 1, _("CONFLICT (rename/rename): "
1669 "Rename %s->%s in %s. "
1670 "Rename %s->%s in %s"),
1671 a
->path
, c1
->path
, ci
->branch1
,
1672 b
->path
, c2
->path
, ci
->branch2
);
1674 remove_file(o
, 1, a
->path
, o
->call_depth
|| would_lose_untracked(a
->path
));
1675 remove_file(o
, 1, b
->path
, o
->call_depth
|| would_lose_untracked(b
->path
));
1677 path_side_1_desc
= xstrfmt("%s (was %s)", path
, a
->path
);
1678 path_side_2_desc
= xstrfmt("%s (was %s)", path
, b
->path
);
1679 if (merge_mode_and_contents(o
, a
, c1
, &ci
->ren1_other
, path_side_1_desc
,
1680 o
->branch1
, o
->branch2
, &mfi_c1
) ||
1681 merge_mode_and_contents(o
, b
, &ci
->ren2_other
, c2
, path_side_2_desc
,
1682 o
->branch1
, o
->branch2
, &mfi_c2
))
1684 free(path_side_1_desc
);
1685 free(path_side_2_desc
);
1687 if (o
->call_depth
) {
1689 * If mfi_c1.clean && mfi_c2.clean, then it might make
1690 * sense to do a two-way merge of those results. But, I
1691 * think in all cases, it makes sense to have the virtual
1692 * merge base just undo the renames; they can be detected
1693 * again later for the non-recursive merge.
1695 remove_file(o
, 0, path
, 0);
1696 ret
= update_file(o
, 0, &mfi_c1
.oid
, mfi_c1
.mode
, a
->path
);
1698 ret
= update_file(o
, 0, &mfi_c2
.oid
, mfi_c2
.mode
,
1701 char *new_path1
= unique_path(o
, path
, ci
->branch1
);
1702 char *new_path2
= unique_path(o
, path
, ci
->branch2
);
1703 output(o
, 1, _("Renaming %s to %s and %s to %s instead"),
1704 a
->path
, new_path1
, b
->path
, new_path2
);
1705 if (was_dirty(o
, path
))
1706 output(o
, 1, _("Refusing to lose dirty file at %s"),
1708 else if (would_lose_untracked(path
))
1710 * Only way we get here is if both renames were from
1711 * a directory rename AND user had an untracked file
1712 * at the location where both files end up after the
1713 * two directory renames. See testcase 10d of t6043.
1715 output(o
, 1, _("Refusing to lose untracked file at "
1716 "%s, even though it's in the way."),
1719 remove_file(o
, 0, path
, 0);
1720 ret
= update_file(o
, 0, &mfi_c1
.oid
, mfi_c1
.mode
, new_path1
);
1722 ret
= update_file(o
, 0, &mfi_c2
.oid
, mfi_c2
.mode
,
1725 * unpack_trees() actually populates the index for us for
1726 * "normal" rename/rename(2to1) situtations so that the
1727 * correct entries are at the higher stages, which would
1728 * make the call below to update_stages_for_stage_data
1729 * unnecessary. However, if either of the renames came
1730 * from a directory rename, then unpack_trees() will not
1731 * have gotten the right data loaded into the index, so we
1732 * need to do so now. (While it'd be tempting to move this
1733 * call to update_stages_for_stage_data() to
1734 * apply_directory_rename_modifications(), that would break
1735 * our intermediate calls to would_lose_untracked() since
1736 * those rely on the current in-memory index. See also the
1737 * big "NOTE" in update_stages()).
1739 if (update_stages_for_stage_data(o
, path
, ci
->dst_entry1
))
1750 * Get the diff_filepairs changed between o_tree and tree.
1752 static struct diff_queue_struct
*get_diffpairs(struct merge_options
*o
,
1753 struct tree
*o_tree
,
1756 struct diff_queue_struct
*ret
;
1757 struct diff_options opts
;
1760 opts
.flags
.recursive
= 1;
1761 opts
.flags
.rename_empty
= 0;
1762 opts
.detect_rename
= merge_detect_rename(o
);
1764 * We do not have logic to handle the detection of copies. In
1765 * fact, it may not even make sense to add such logic: would we
1766 * really want a change to a base file to be propagated through
1767 * multiple other files by a merge?
1769 if (opts
.detect_rename
> DIFF_DETECT_RENAME
)
1770 opts
.detect_rename
= DIFF_DETECT_RENAME
;
1771 opts
.rename_limit
= o
->merge_rename_limit
>= 0 ? o
->merge_rename_limit
:
1772 o
->diff_rename_limit
>= 0 ? o
->diff_rename_limit
:
1774 opts
.rename_score
= o
->rename_score
;
1775 opts
.show_rename_progress
= o
->show_rename_progress
;
1776 opts
.output_format
= DIFF_FORMAT_NO_OUTPUT
;
1777 diff_setup_done(&opts
);
1778 diff_tree_oid(&o_tree
->object
.oid
, &tree
->object
.oid
, "", &opts
);
1779 diffcore_std(&opts
);
1780 if (opts
.needed_rename_limit
> o
->needed_rename_limit
)
1781 o
->needed_rename_limit
= opts
.needed_rename_limit
;
1783 ret
= xmalloc(sizeof(*ret
));
1784 *ret
= diff_queued_diff
;
1786 opts
.output_format
= DIFF_FORMAT_NO_OUTPUT
;
1787 diff_queued_diff
.nr
= 0;
1788 diff_queued_diff
.queue
= NULL
;
1793 static int tree_has_path(struct tree
*tree
, const char *path
)
1795 struct object_id hashy
;
1796 unsigned int mode_o
;
1798 return !get_tree_entry(&tree
->object
.oid
, path
,
1803 * Return a new string that replaces the beginning portion (which matches
1804 * entry->dir), with entry->new_dir. In perl-speak:
1805 * new_path_name = (old_path =~ s/entry->dir/entry->new_dir/);
1807 * Caller must ensure that old_path starts with entry->dir + '/'.
1809 static char *apply_dir_rename(struct dir_rename_entry
*entry
,
1810 const char *old_path
)
1812 struct strbuf new_path
= STRBUF_INIT
;
1815 if (entry
->non_unique_new_dir
)
1818 oldlen
= strlen(entry
->dir
);
1819 newlen
= entry
->new_dir
.len
+ (strlen(old_path
) - oldlen
) + 1;
1820 strbuf_grow(&new_path
, newlen
);
1821 strbuf_addbuf(&new_path
, &entry
->new_dir
);
1822 strbuf_addstr(&new_path
, &old_path
[oldlen
]);
1824 return strbuf_detach(&new_path
, NULL
);
1827 static void get_renamed_dir_portion(const char *old_path
, const char *new_path
,
1828 char **old_dir
, char **new_dir
)
1830 char *end_of_old
, *end_of_new
;
1831 int old_len
, new_len
;
1838 * "a/b/c/d/e/foo.c" -> "a/b/some/thing/else/e/foo.c"
1839 * the "e/foo.c" part is the same, we just want to know that
1840 * "a/b/c/d" was renamed to "a/b/some/thing/else"
1841 * so, for this example, this function returns "a/b/c/d" in
1842 * *old_dir and "a/b/some/thing/else" in *new_dir.
1844 * Also, if the basename of the file changed, we don't care. We
1845 * want to know which portion of the directory, if any, changed.
1847 end_of_old
= strrchr(old_path
, '/');
1848 end_of_new
= strrchr(new_path
, '/');
1850 if (end_of_old
== NULL
|| end_of_new
== NULL
)
1852 while (*--end_of_new
== *--end_of_old
&&
1853 end_of_old
!= old_path
&&
1854 end_of_new
!= new_path
)
1855 ; /* Do nothing; all in the while loop */
1857 * We've found the first non-matching character in the directory
1858 * paths. That means the current directory we were comparing
1859 * represents the rename. Move end_of_old and end_of_new back
1860 * to the full directory name.
1862 if (*end_of_old
== '/')
1864 if (*end_of_old
!= '/')
1866 end_of_old
= strchr(end_of_old
, '/');
1867 end_of_new
= strchr(end_of_new
, '/');
1870 * It may have been the case that old_path and new_path were the same
1871 * directory all along. Don't claim a rename if they're the same.
1873 old_len
= end_of_old
- old_path
;
1874 new_len
= end_of_new
- new_path
;
1876 if (old_len
!= new_len
|| strncmp(old_path
, new_path
, old_len
)) {
1877 *old_dir
= xstrndup(old_path
, old_len
);
1878 *new_dir
= xstrndup(new_path
, new_len
);
1882 static void remove_hashmap_entries(struct hashmap
*dir_renames
,
1883 struct string_list
*items_to_remove
)
1886 struct dir_rename_entry
*entry
;
1888 for (i
= 0; i
< items_to_remove
->nr
; i
++) {
1889 entry
= items_to_remove
->items
[i
].util
;
1890 hashmap_remove(dir_renames
, entry
, NULL
);
1892 string_list_clear(items_to_remove
, 0);
1896 * See if there is a directory rename for path, and if there are any file
1897 * level conflicts for the renamed location. If there is a rename and
1898 * there are no conflicts, return the new name. Otherwise, return NULL.
1900 static char *handle_path_level_conflicts(struct merge_options
*o
,
1902 struct dir_rename_entry
*entry
,
1903 struct hashmap
*collisions
,
1906 char *new_path
= NULL
;
1907 struct collision_entry
*collision_ent
;
1909 struct strbuf collision_paths
= STRBUF_INIT
;
1912 * entry has the mapping of old directory name to new directory name
1913 * that we want to apply to path.
1915 new_path
= apply_dir_rename(entry
, path
);
1918 /* This should only happen when entry->non_unique_new_dir set */
1919 if (!entry
->non_unique_new_dir
)
1920 BUG("entry->non_unqiue_dir not set and !new_path");
1921 output(o
, 1, _("CONFLICT (directory rename split): "
1922 "Unclear where to place %s because directory "
1923 "%s was renamed to multiple other directories, "
1924 "with no destination getting a majority of the "
1932 * The caller needs to have ensured that it has pre-populated
1933 * collisions with all paths that map to new_path. Do a quick check
1934 * to ensure that's the case.
1936 collision_ent
= collision_find_entry(collisions
, new_path
);
1937 if (collision_ent
== NULL
)
1938 BUG("collision_ent is NULL");
1941 * Check for one-sided add/add/.../add conflicts, i.e.
1942 * where implicit renames from the other side doing
1943 * directory rename(s) can affect this side of history
1944 * to put multiple paths into the same location. Warn
1945 * and bail on directory renames for such paths.
1947 if (collision_ent
->reported_already
) {
1949 } else if (tree_has_path(tree
, new_path
)) {
1950 collision_ent
->reported_already
= 1;
1951 strbuf_add_separated_string_list(&collision_paths
, ", ",
1952 &collision_ent
->source_files
);
1953 output(o
, 1, _("CONFLICT (implicit dir rename): Existing "
1954 "file/dir at %s in the way of implicit "
1955 "directory rename(s) putting the following "
1956 "path(s) there: %s."),
1957 new_path
, collision_paths
.buf
);
1959 } else if (collision_ent
->source_files
.nr
> 1) {
1960 collision_ent
->reported_already
= 1;
1961 strbuf_add_separated_string_list(&collision_paths
, ", ",
1962 &collision_ent
->source_files
);
1963 output(o
, 1, _("CONFLICT (implicit dir rename): Cannot map "
1964 "more than one path to %s; implicit directory "
1965 "renames tried to put these paths there: %s"),
1966 new_path
, collision_paths
.buf
);
1970 /* Free memory we no longer need */
1971 strbuf_release(&collision_paths
);
1972 if (!clean
&& new_path
) {
1981 * There are a couple things we want to do at the directory level:
1982 * 1. Check for both sides renaming to the same thing, in order to avoid
1983 * implicit renaming of files that should be left in place. (See
1984 * testcase 6b in t6043 for details.)
1985 * 2. Prune directory renames if there are still files left in the
1986 * the original directory. These represent a partial directory rename,
1987 * i.e. a rename where only some of the files within the directory
1988 * were renamed elsewhere. (Technically, this could be done earlier
1989 * in get_directory_renames(), except that would prevent us from
1990 * doing the previous check and thus failing testcase 6b.)
1991 * 3. Check for rename/rename(1to2) conflicts (at the directory level).
1992 * In the future, we could potentially record this info as well and
1993 * omit reporting rename/rename(1to2) conflicts for each path within
1994 * the affected directories, thus cleaning up the merge output.
1995 * NOTE: We do NOT check for rename/rename(2to1) conflicts at the
1996 * directory level, because merging directories is fine. If it
1997 * causes conflicts for files within those merged directories, then
1998 * that should be detected at the individual path level.
2000 static void handle_directory_level_conflicts(struct merge_options
*o
,
2001 struct hashmap
*dir_re_head
,
2003 struct hashmap
*dir_re_merge
,
2006 struct hashmap_iter iter
;
2007 struct dir_rename_entry
*head_ent
;
2008 struct dir_rename_entry
*merge_ent
;
2010 struct string_list remove_from_head
= STRING_LIST_INIT_NODUP
;
2011 struct string_list remove_from_merge
= STRING_LIST_INIT_NODUP
;
2013 hashmap_iter_init(dir_re_head
, &iter
);
2014 while ((head_ent
= hashmap_iter_next(&iter
))) {
2015 merge_ent
= dir_rename_find_entry(dir_re_merge
, head_ent
->dir
);
2017 !head_ent
->non_unique_new_dir
&&
2018 !merge_ent
->non_unique_new_dir
&&
2019 !strbuf_cmp(&head_ent
->new_dir
, &merge_ent
->new_dir
)) {
2020 /* 1. Renamed identically; remove it from both sides */
2021 string_list_append(&remove_from_head
,
2022 head_ent
->dir
)->util
= head_ent
;
2023 strbuf_release(&head_ent
->new_dir
);
2024 string_list_append(&remove_from_merge
,
2025 merge_ent
->dir
)->util
= merge_ent
;
2026 strbuf_release(&merge_ent
->new_dir
);
2027 } else if (tree_has_path(head
, head_ent
->dir
)) {
2028 /* 2. This wasn't a directory rename after all */
2029 string_list_append(&remove_from_head
,
2030 head_ent
->dir
)->util
= head_ent
;
2031 strbuf_release(&head_ent
->new_dir
);
2035 remove_hashmap_entries(dir_re_head
, &remove_from_head
);
2036 remove_hashmap_entries(dir_re_merge
, &remove_from_merge
);
2038 hashmap_iter_init(dir_re_merge
, &iter
);
2039 while ((merge_ent
= hashmap_iter_next(&iter
))) {
2040 head_ent
= dir_rename_find_entry(dir_re_head
, merge_ent
->dir
);
2041 if (tree_has_path(merge
, merge_ent
->dir
)) {
2042 /* 2. This wasn't a directory rename after all */
2043 string_list_append(&remove_from_merge
,
2044 merge_ent
->dir
)->util
= merge_ent
;
2045 } else if (head_ent
&&
2046 !head_ent
->non_unique_new_dir
&&
2047 !merge_ent
->non_unique_new_dir
) {
2048 /* 3. rename/rename(1to2) */
2050 * We can assume it's not rename/rename(1to1) because
2051 * that was case (1), already checked above. So we
2052 * know that head_ent->new_dir and merge_ent->new_dir
2053 * are different strings.
2055 output(o
, 1, _("CONFLICT (rename/rename): "
2056 "Rename directory %s->%s in %s. "
2057 "Rename directory %s->%s in %s"),
2058 head_ent
->dir
, head_ent
->new_dir
.buf
, o
->branch1
,
2059 head_ent
->dir
, merge_ent
->new_dir
.buf
, o
->branch2
);
2060 string_list_append(&remove_from_head
,
2061 head_ent
->dir
)->util
= head_ent
;
2062 strbuf_release(&head_ent
->new_dir
);
2063 string_list_append(&remove_from_merge
,
2064 merge_ent
->dir
)->util
= merge_ent
;
2065 strbuf_release(&merge_ent
->new_dir
);
2069 remove_hashmap_entries(dir_re_head
, &remove_from_head
);
2070 remove_hashmap_entries(dir_re_merge
, &remove_from_merge
);
2073 static struct hashmap
*get_directory_renames(struct diff_queue_struct
*pairs
,
2076 struct hashmap
*dir_renames
;
2077 struct hashmap_iter iter
;
2078 struct dir_rename_entry
*entry
;
2082 * Typically, we think of a directory rename as all files from a
2083 * certain directory being moved to a target directory. However,
2084 * what if someone first moved two files from the original
2085 * directory in one commit, and then renamed the directory
2086 * somewhere else in a later commit? At merge time, we just know
2087 * that files from the original directory went to two different
2088 * places, and that the bulk of them ended up in the same place.
2089 * We want each directory rename to represent where the bulk of the
2090 * files from that directory end up; this function exists to find
2091 * where the bulk of the files went.
2093 * The first loop below simply iterates through the list of file
2094 * renames, finding out how often each directory rename pair
2095 * possibility occurs.
2097 dir_renames
= xmalloc(sizeof(*dir_renames
));
2098 dir_rename_init(dir_renames
);
2099 for (i
= 0; i
< pairs
->nr
; ++i
) {
2100 struct string_list_item
*item
;
2102 struct diff_filepair
*pair
= pairs
->queue
[i
];
2103 char *old_dir
, *new_dir
;
2105 /* File not part of directory rename if it wasn't renamed */
2106 if (pair
->status
!= 'R')
2109 get_renamed_dir_portion(pair
->one
->path
, pair
->two
->path
,
2110 &old_dir
, &new_dir
);
2112 /* Directory didn't change at all; ignore this one. */
2115 entry
= dir_rename_find_entry(dir_renames
, old_dir
);
2117 entry
= xmalloc(sizeof(*entry
));
2118 dir_rename_entry_init(entry
, old_dir
);
2119 hashmap_put(dir_renames
, entry
);
2123 item
= string_list_lookup(&entry
->possible_new_dirs
, new_dir
);
2125 item
= string_list_insert(&entry
->possible_new_dirs
,
2127 item
->util
= xcalloc(1, sizeof(int));
2136 * For each directory with files moved out of it, we find out which
2137 * target directory received the most files so we can declare it to
2138 * be the "winning" target location for the directory rename. This
2139 * winner gets recorded in new_dir. If there is no winner
2140 * (multiple target directories received the same number of files),
2141 * we set non_unique_new_dir. Once we've determined the winner (or
2142 * that there is no winner), we no longer need possible_new_dirs.
2144 hashmap_iter_init(dir_renames
, &iter
);
2145 while ((entry
= hashmap_iter_next(&iter
))) {
2150 for (i
= 0; i
< entry
->possible_new_dirs
.nr
; i
++) {
2151 int *count
= entry
->possible_new_dirs
.items
[i
].util
;
2155 else if (*count
> max
) {
2157 best
= entry
->possible_new_dirs
.items
[i
].string
;
2161 entry
->non_unique_new_dir
= 1;
2163 assert(entry
->new_dir
.len
== 0);
2164 strbuf_addstr(&entry
->new_dir
, best
);
2167 * The relevant directory sub-portion of the original full
2168 * filepaths were xstrndup'ed before inserting into
2169 * possible_new_dirs, and instead of manually iterating the
2170 * list and free'ing each, just lie and tell
2171 * possible_new_dirs that it did the strdup'ing so that it
2172 * will free them for us.
2174 entry
->possible_new_dirs
.strdup_strings
= 1;
2175 string_list_clear(&entry
->possible_new_dirs
, 1);
2181 static struct dir_rename_entry
*check_dir_renamed(const char *path
,
2182 struct hashmap
*dir_renames
)
2184 char *temp
= xstrdup(path
);
2186 struct dir_rename_entry
*entry
= NULL
;
2188 while ((end
= strrchr(temp
, '/'))) {
2190 entry
= dir_rename_find_entry(dir_renames
, temp
);
2198 static void compute_collisions(struct hashmap
*collisions
,
2199 struct hashmap
*dir_renames
,
2200 struct diff_queue_struct
*pairs
)
2205 * Multiple files can be mapped to the same path due to directory
2206 * renames done by the other side of history. Since that other
2207 * side of history could have merged multiple directories into one,
2208 * if our side of history added the same file basename to each of
2209 * those directories, then all N of them would get implicitly
2210 * renamed by the directory rename detection into the same path,
2211 * and we'd get an add/add/.../add conflict, and all those adds
2212 * from *this* side of history. This is not representable in the
2213 * index, and users aren't going to easily be able to make sense of
2214 * it. So we need to provide a good warning about what's
2215 * happening, and fall back to no-directory-rename detection
2216 * behavior for those paths.
2218 * See testcases 9e and all of section 5 from t6043 for examples.
2220 collision_init(collisions
);
2222 for (i
= 0; i
< pairs
->nr
; ++i
) {
2223 struct dir_rename_entry
*dir_rename_ent
;
2224 struct collision_entry
*collision_ent
;
2226 struct diff_filepair
*pair
= pairs
->queue
[i
];
2228 if (pair
->status
!= 'A' && pair
->status
!= 'R')
2230 dir_rename_ent
= check_dir_renamed(pair
->two
->path
,
2232 if (!dir_rename_ent
)
2235 new_path
= apply_dir_rename(dir_rename_ent
, pair
->two
->path
);
2238 * dir_rename_ent->non_unique_new_path is true, which
2239 * means there is no directory rename for us to use,
2240 * which means it won't cause us any additional
2244 collision_ent
= collision_find_entry(collisions
, new_path
);
2245 if (!collision_ent
) {
2246 collision_ent
= xcalloc(1,
2247 sizeof(struct collision_entry
));
2248 hashmap_entry_init(collision_ent
, strhash(new_path
));
2249 hashmap_put(collisions
, collision_ent
);
2250 collision_ent
->target_file
= new_path
;
2254 string_list_insert(&collision_ent
->source_files
,
2259 static char *check_for_directory_rename(struct merge_options
*o
,
2262 struct hashmap
*dir_renames
,
2263 struct hashmap
*dir_rename_exclusions
,
2264 struct hashmap
*collisions
,
2267 char *new_path
= NULL
;
2268 struct dir_rename_entry
*entry
= check_dir_renamed(path
, dir_renames
);
2269 struct dir_rename_entry
*oentry
= NULL
;
2275 * This next part is a little weird. We do not want to do an
2276 * implicit rename into a directory we renamed on our side, because
2277 * that will result in a spurious rename/rename(1to2) conflict. An
2279 * Base commit: dumbdir/afile, otherdir/bfile
2280 * Side 1: smrtdir/afile, otherdir/bfile
2281 * Side 2: dumbdir/afile, dumbdir/bfile
2282 * Here, while working on Side 1, we could notice that otherdir was
2283 * renamed/merged to dumbdir, and change the diff_filepair for
2284 * otherdir/bfile into a rename into dumbdir/bfile. However, Side
2285 * 2 will notice the rename from dumbdir to smrtdir, and do the
2286 * transitive rename to move it from dumbdir/bfile to
2287 * smrtdir/bfile. That gives us bfile in dumbdir vs being in
2288 * smrtdir, a rename/rename(1to2) conflict. We really just want
2289 * the file to end up in smrtdir. And the way to achieve that is
2290 * to not let Side1 do the rename to dumbdir, since we know that is
2291 * the source of one of our directory renames.
2293 * That's why oentry and dir_rename_exclusions is here.
2295 * As it turns out, this also prevents N-way transient rename
2296 * confusion; See testcases 9c and 9d of t6043.
2298 oentry
= dir_rename_find_entry(dir_rename_exclusions
, entry
->new_dir
.buf
);
2300 output(o
, 1, _("WARNING: Avoiding applying %s -> %s rename "
2301 "to %s, because %s itself was renamed."),
2302 entry
->dir
, entry
->new_dir
.buf
, path
, entry
->new_dir
.buf
);
2304 new_path
= handle_path_level_conflicts(o
, path
, entry
,
2306 *clean_merge
&= (new_path
!= NULL
);
2312 static void apply_directory_rename_modifications(struct merge_options
*o
,
2313 struct diff_filepair
*pair
,
2317 struct tree
*o_tree
,
2318 struct tree
*a_tree
,
2319 struct tree
*b_tree
,
2320 struct string_list
*entries
,
2323 struct string_list_item
*item
;
2324 int stage
= (tree
== a_tree
? 2 : 3);
2328 * In all cases where we can do directory rename detection,
2329 * unpack_trees() will have read pair->two->path into the
2330 * index and the working copy. We need to remove it so that
2331 * we can instead place it at new_path. It is guaranteed to
2332 * not be untracked (unpack_trees() would have errored out
2333 * saying the file would have been overwritten), but it might
2336 update_wd
= !was_dirty(o
, pair
->two
->path
);
2338 output(o
, 1, _("Refusing to lose dirty file at %s"),
2340 remove_file(o
, 1, pair
->two
->path
, !update_wd
);
2342 /* Find or create a new re->dst_entry */
2343 item
= string_list_lookup(entries
, new_path
);
2346 * Since we're renaming on this side of history, and it's
2347 * due to a directory rename on the other side of history
2348 * (which we only allow when the directory in question no
2349 * longer exists on the other side of history), the
2350 * original entry for re->dst_entry is no longer
2353 re
->dst_entry
->processed
= 1;
2356 * ...because we'll be using this new one.
2358 re
->dst_entry
= item
->util
;
2361 * re->dst_entry is for the before-dir-rename path, and we
2362 * need it to hold information for the after-dir-rename
2363 * path. Before creating a new entry, we need to mark the
2364 * old one as unnecessary (...unless it is shared by
2365 * src_entry, i.e. this didn't use to be a rename, in which
2366 * case we can just allow the normal processing to happen
2369 if (pair
->status
== 'R')
2370 re
->dst_entry
->processed
= 1;
2372 re
->dst_entry
= insert_stage_data(new_path
,
2373 o_tree
, a_tree
, b_tree
,
2375 item
= string_list_insert(entries
, new_path
);
2376 item
->util
= re
->dst_entry
;
2380 * Update the stage_data with the information about the path we are
2381 * moving into place. That slot will be empty and available for us
2382 * to write to because of the collision checks in
2383 * handle_path_level_conflicts(). In other words,
2384 * re->dst_entry->stages[stage].oid will be the null_oid, so it's
2385 * open for us to write to.
2387 * It may be tempting to actually update the index at this point as
2388 * well, using update_stages_for_stage_data(), but as per the big
2389 * "NOTE" in update_stages(), doing so will modify the current
2390 * in-memory index which will break calls to would_lose_untracked()
2391 * that we need to make. Instead, we need to just make sure that
2392 * the various handle_rename_*() functions update the index
2393 * explicitly rather than relying on unpack_trees() to have done it.
2395 get_tree_entry(&tree
->object
.oid
,
2397 &re
->dst_entry
->stages
[stage
].oid
,
2398 &re
->dst_entry
->stages
[stage
].mode
);
2400 /* Update pair status */
2401 if (pair
->status
== 'A') {
2403 * Recording rename information for this add makes it look
2404 * like a rename/delete conflict. Make sure we can
2405 * correctly handle this as an add that was moved to a new
2406 * directory instead of reporting a rename/delete conflict.
2408 re
->add_turned_into_rename
= 1;
2411 * We don't actually look at pair->status again, but it seems
2412 * pedagogically correct to adjust it.
2417 * Finally, record the new location.
2419 pair
->two
->path
= new_path
;
2423 * Get information of all renames which occurred in 'pairs', making use of
2424 * any implicit directory renames inferred from the other side of history.
2425 * We need the three trees in the merge ('o_tree', 'a_tree' and 'b_tree')
2426 * to be able to associate the correct cache entries with the rename
2427 * information; tree is always equal to either a_tree or b_tree.
2429 static struct string_list
*get_renames(struct merge_options
*o
,
2430 struct diff_queue_struct
*pairs
,
2431 struct hashmap
*dir_renames
,
2432 struct hashmap
*dir_rename_exclusions
,
2434 struct tree
*o_tree
,
2435 struct tree
*a_tree
,
2436 struct tree
*b_tree
,
2437 struct string_list
*entries
,
2441 struct hashmap collisions
;
2442 struct hashmap_iter iter
;
2443 struct collision_entry
*e
;
2444 struct string_list
*renames
;
2446 compute_collisions(&collisions
, dir_renames
, pairs
);
2447 renames
= xcalloc(1, sizeof(struct string_list
));
2449 for (i
= 0; i
< pairs
->nr
; ++i
) {
2450 struct string_list_item
*item
;
2452 struct diff_filepair
*pair
= pairs
->queue
[i
];
2453 char *new_path
; /* non-NULL only with directory renames */
2455 if (pair
->status
!= 'A' && pair
->status
!= 'R') {
2456 diff_free_filepair(pair
);
2459 new_path
= check_for_directory_rename(o
, pair
->two
->path
, tree
,
2461 dir_rename_exclusions
,
2464 if (pair
->status
!= 'R' && !new_path
) {
2465 diff_free_filepair(pair
);
2469 re
= xmalloc(sizeof(*re
));
2471 re
->add_turned_into_rename
= 0;
2473 item
= string_list_lookup(entries
, re
->pair
->one
->path
);
2475 re
->src_entry
= insert_stage_data(re
->pair
->one
->path
,
2476 o_tree
, a_tree
, b_tree
, entries
);
2478 re
->src_entry
= item
->util
;
2480 item
= string_list_lookup(entries
, re
->pair
->two
->path
);
2482 re
->dst_entry
= insert_stage_data(re
->pair
->two
->path
,
2483 o_tree
, a_tree
, b_tree
, entries
);
2485 re
->dst_entry
= item
->util
;
2486 item
= string_list_insert(renames
, pair
->one
->path
);
2489 apply_directory_rename_modifications(o
, pair
, new_path
,
2496 hashmap_iter_init(&collisions
, &iter
);
2497 while ((e
= hashmap_iter_next(&iter
))) {
2498 free(e
->target_file
);
2499 string_list_clear(&e
->source_files
, 0);
2501 hashmap_free(&collisions
, 1);
2505 static int process_renames(struct merge_options
*o
,
2506 struct string_list
*a_renames
,
2507 struct string_list
*b_renames
)
2509 int clean_merge
= 1, i
, j
;
2510 struct string_list a_by_dst
= STRING_LIST_INIT_NODUP
;
2511 struct string_list b_by_dst
= STRING_LIST_INIT_NODUP
;
2512 const struct rename
*sre
;
2514 for (i
= 0; i
< a_renames
->nr
; i
++) {
2515 sre
= a_renames
->items
[i
].util
;
2516 string_list_insert(&a_by_dst
, sre
->pair
->two
->path
)->util
2519 for (i
= 0; i
< b_renames
->nr
; i
++) {
2520 sre
= b_renames
->items
[i
].util
;
2521 string_list_insert(&b_by_dst
, sre
->pair
->two
->path
)->util
2525 for (i
= 0, j
= 0; i
< a_renames
->nr
|| j
< b_renames
->nr
;) {
2526 struct string_list
*renames1
, *renames2Dst
;
2527 struct rename
*ren1
= NULL
, *ren2
= NULL
;
2528 const char *branch1
, *branch2
;
2529 const char *ren1_src
, *ren1_dst
;
2530 struct string_list_item
*lookup
;
2532 if (i
>= a_renames
->nr
) {
2533 ren2
= b_renames
->items
[j
++].util
;
2534 } else if (j
>= b_renames
->nr
) {
2535 ren1
= a_renames
->items
[i
++].util
;
2537 int compare
= strcmp(a_renames
->items
[i
].string
,
2538 b_renames
->items
[j
].string
);
2540 ren1
= a_renames
->items
[i
++].util
;
2542 ren2
= b_renames
->items
[j
++].util
;
2545 /* TODO: refactor, so that 1/2 are not needed */
2547 renames1
= a_renames
;
2548 renames2Dst
= &b_by_dst
;
2549 branch1
= o
->branch1
;
2550 branch2
= o
->branch2
;
2552 renames1
= b_renames
;
2553 renames2Dst
= &a_by_dst
;
2554 branch1
= o
->branch2
;
2555 branch2
= o
->branch1
;
2559 if (ren1
->processed
)
2561 ren1
->processed
= 1;
2562 ren1
->dst_entry
->processed
= 1;
2563 /* BUG: We should only mark src_entry as processed if we
2564 * are not dealing with a rename + add-source case.
2566 ren1
->src_entry
->processed
= 1;
2568 ren1_src
= ren1
->pair
->one
->path
;
2569 ren1_dst
= ren1
->pair
->two
->path
;
2572 /* One file renamed on both sides */
2573 const char *ren2_src
= ren2
->pair
->one
->path
;
2574 const char *ren2_dst
= ren2
->pair
->two
->path
;
2575 enum rename_type rename_type
;
2576 if (strcmp(ren1_src
, ren2_src
) != 0)
2577 BUG("ren1_src != ren2_src");
2578 ren2
->dst_entry
->processed
= 1;
2579 ren2
->processed
= 1;
2580 if (strcmp(ren1_dst
, ren2_dst
) != 0) {
2581 rename_type
= RENAME_ONE_FILE_TO_TWO
;
2584 rename_type
= RENAME_ONE_FILE_TO_ONE
;
2585 /* BUG: We should only remove ren1_src in
2586 * the base stage (think of rename +
2587 * add-source cases).
2589 remove_file(o
, 1, ren1_src
, 1);
2590 update_entry(ren1
->dst_entry
,
2595 setup_rename_conflict_info(rename_type
,
2605 } else if ((lookup
= string_list_lookup(renames2Dst
, ren1_dst
))) {
2606 /* Two different files renamed to the same thing */
2608 ren2
= lookup
->util
;
2609 ren2_dst
= ren2
->pair
->two
->path
;
2610 if (strcmp(ren1_dst
, ren2_dst
) != 0)
2611 BUG("ren1_dst != ren2_dst");
2614 ren2
->processed
= 1;
2616 * BUG: We should only mark src_entry as processed
2617 * if we are not dealing with a rename + add-source
2620 ren2
->src_entry
->processed
= 1;
2622 setup_rename_conflict_info(RENAME_TWO_FILES_TO_ONE
,
2634 /* Renamed in 1, maybe changed in 2 */
2635 /* we only use sha1 and mode of these */
2636 struct diff_filespec src_other
, dst_other
;
2640 * unpack_trees loads entries from common-commit
2641 * into stage 1, from head-commit into stage 2, and
2642 * from merge-commit into stage 3. We keep track
2643 * of which side corresponds to the rename.
2645 int renamed_stage
= a_renames
== renames1
? 2 : 3;
2646 int other_stage
= a_renames
== renames1
? 3 : 2;
2648 /* BUG: We should only remove ren1_src in the base
2649 * stage and in other_stage (think of rename +
2652 remove_file(o
, 1, ren1_src
,
2653 renamed_stage
== 2 || !was_tracked(o
, ren1_src
));
2655 oidcpy(&src_other
.oid
,
2656 &ren1
->src_entry
->stages
[other_stage
].oid
);
2657 src_other
.mode
= ren1
->src_entry
->stages
[other_stage
].mode
;
2658 oidcpy(&dst_other
.oid
,
2659 &ren1
->dst_entry
->stages
[other_stage
].oid
);
2660 dst_other
.mode
= ren1
->dst_entry
->stages
[other_stage
].mode
;
2663 if (oid_eq(&src_other
.oid
, &null_oid
) &&
2664 ren1
->add_turned_into_rename
) {
2665 setup_rename_conflict_info(RENAME_VIA_DIR
,
2675 } else if (oid_eq(&src_other
.oid
, &null_oid
)) {
2676 setup_rename_conflict_info(RENAME_DELETE
,
2686 } else if ((dst_other
.mode
== ren1
->pair
->two
->mode
) &&
2687 oid_eq(&dst_other
.oid
, &ren1
->pair
->two
->oid
)) {
2689 * Added file on the other side identical to
2690 * the file being renamed: clean merge.
2691 * Also, there is no need to overwrite the
2692 * file already in the working copy, so call
2693 * update_file_flags() instead of
2696 if (update_file_flags(o
,
2697 &ren1
->pair
->two
->oid
,
2698 ren1
->pair
->two
->mode
,
2700 1, /* update_cache */
2703 } else if (!oid_eq(&dst_other
.oid
, &null_oid
)) {
2706 output(o
, 1, _("CONFLICT (rename/add): Rename %s->%s in %s. "
2708 ren1_src
, ren1_dst
, branch1
,
2710 if (o
->call_depth
) {
2711 struct merge_file_info mfi
;
2712 struct diff_filespec one
, a
, b
;
2714 oidcpy(&one
.oid
, &null_oid
);
2716 one
.path
= ren1
->pair
->two
->path
;
2718 oidcpy(&a
.oid
, &ren1
->pair
->two
->oid
);
2719 a
.mode
= ren1
->pair
->two
->mode
;
2722 oidcpy(&b
.oid
, &dst_other
.oid
);
2723 b
.mode
= dst_other
.mode
;
2726 if (merge_mode_and_contents(o
, &one
, &a
, &b
, ren1_dst
,
2730 goto cleanup_and_return
;
2732 output(o
, 1, _("Adding merged %s"), ren1_dst
);
2733 if (update_file(o
, 0, &mfi
.oid
,
2734 mfi
.mode
, ren1_dst
))
2738 char *new_path
= unique_path(o
, ren1_dst
, branch2
);
2739 output(o
, 1, _("Adding as %s instead"), new_path
);
2740 if (update_file(o
, 0, &dst_other
.oid
,
2741 dst_other
.mode
, new_path
))
2748 if (clean_merge
< 0)
2749 goto cleanup_and_return
;
2751 struct diff_filespec
*one
, *a
, *b
;
2752 src_other
.path
= (char *)ren1_src
;
2754 one
= ren1
->pair
->one
;
2755 if (a_renames
== renames1
) {
2756 a
= ren1
->pair
->two
;
2759 b
= ren1
->pair
->two
;
2762 update_entry(ren1
->dst_entry
, one
, a
, b
);
2763 setup_rename_conflict_info(RENAME_NORMAL
,
2777 string_list_clear(&a_by_dst
, 0);
2778 string_list_clear(&b_by_dst
, 0);
2783 struct rename_info
{
2784 struct string_list
*head_renames
;
2785 struct string_list
*merge_renames
;
2788 static void initial_cleanup_rename(struct diff_queue_struct
*pairs
,
2789 struct hashmap
*dir_renames
)
2791 struct hashmap_iter iter
;
2792 struct dir_rename_entry
*e
;
2794 hashmap_iter_init(dir_renames
, &iter
);
2795 while ((e
= hashmap_iter_next(&iter
))) {
2797 strbuf_release(&e
->new_dir
);
2798 /* possible_new_dirs already cleared in get_directory_renames */
2800 hashmap_free(dir_renames
, 1);
2807 static int detect_and_process_renames(struct merge_options
*o
,
2808 struct tree
*common
,
2811 struct string_list
*entries
,
2812 struct rename_info
*ri
)
2814 struct diff_queue_struct
*head_pairs
, *merge_pairs
;
2815 struct hashmap
*dir_re_head
, *dir_re_merge
;
2818 ri
->head_renames
= NULL
;
2819 ri
->merge_renames
= NULL
;
2821 if (!merge_detect_rename(o
))
2824 head_pairs
= get_diffpairs(o
, common
, head
);
2825 merge_pairs
= get_diffpairs(o
, common
, merge
);
2827 if (o
->detect_directory_renames
) {
2828 dir_re_head
= get_directory_renames(head_pairs
, head
);
2829 dir_re_merge
= get_directory_renames(merge_pairs
, merge
);
2831 handle_directory_level_conflicts(o
,
2833 dir_re_merge
, merge
);
2835 dir_re_head
= xmalloc(sizeof(*dir_re_head
));
2836 dir_re_merge
= xmalloc(sizeof(*dir_re_merge
));
2837 dir_rename_init(dir_re_head
);
2838 dir_rename_init(dir_re_merge
);
2841 ri
->head_renames
= get_renames(o
, head_pairs
,
2842 dir_re_merge
, dir_re_head
, head
,
2843 common
, head
, merge
, entries
,
2847 ri
->merge_renames
= get_renames(o
, merge_pairs
,
2848 dir_re_head
, dir_re_merge
, merge
,
2849 common
, head
, merge
, entries
,
2853 clean
&= process_renames(o
, ri
->head_renames
, ri
->merge_renames
);
2857 * Some cleanup is deferred until cleanup_renames() because the
2858 * data structures are still needed and referenced in
2859 * process_entry(). But there are a few things we can free now.
2861 initial_cleanup_rename(head_pairs
, dir_re_head
);
2862 initial_cleanup_rename(merge_pairs
, dir_re_merge
);
2867 static void final_cleanup_rename(struct string_list
*rename
)
2869 const struct rename
*re
;
2875 for (i
= 0; i
< rename
->nr
; i
++) {
2876 re
= rename
->items
[i
].util
;
2877 diff_free_filepair(re
->pair
);
2879 string_list_clear(rename
, 1);
2883 static void final_cleanup_renames(struct rename_info
*re_info
)
2885 final_cleanup_rename(re_info
->head_renames
);
2886 final_cleanup_rename(re_info
->merge_renames
);
2889 static struct object_id
*stage_oid(const struct object_id
*oid
, unsigned mode
)
2891 return (is_null_oid(oid
) || mode
== 0) ? NULL
: (struct object_id
*)oid
;
2894 static int read_oid_strbuf(struct merge_options
*o
,
2895 const struct object_id
*oid
,
2899 enum object_type type
;
2901 buf
= read_object_file(oid
, &type
, &size
);
2903 return err(o
, _("cannot read object %s"), oid_to_hex(oid
));
2904 if (type
!= OBJ_BLOB
) {
2906 return err(o
, _("object %s is not a blob"), oid_to_hex(oid
));
2908 strbuf_attach(dst
, buf
, size
, size
+ 1);
2912 static int blob_unchanged(struct merge_options
*opt
,
2913 const struct object_id
*o_oid
,
2915 const struct object_id
*a_oid
,
2917 int renormalize
, const char *path
)
2919 struct strbuf o
= STRBUF_INIT
;
2920 struct strbuf a
= STRBUF_INIT
;
2921 int ret
= 0; /* assume changed for safety */
2923 if (a_mode
!= o_mode
)
2925 if (oid_eq(o_oid
, a_oid
))
2930 assert(o_oid
&& a_oid
);
2931 if (read_oid_strbuf(opt
, o_oid
, &o
) || read_oid_strbuf(opt
, a_oid
, &a
))
2934 * Note: binary | is used so that both renormalizations are
2935 * performed. Comparison can be skipped if both files are
2936 * unchanged since their sha1s have already been compared.
2938 if (renormalize_buffer(&the_index
, path
, o
.buf
, o
.len
, &o
) |
2939 renormalize_buffer(&the_index
, path
, a
.buf
, a
.len
, &a
))
2940 ret
= (o
.len
== a
.len
&& !memcmp(o
.buf
, a
.buf
, o
.len
));
2948 static int handle_modify_delete(struct merge_options
*o
,
2950 struct object_id
*o_oid
, int o_mode
,
2951 struct object_id
*a_oid
, int a_mode
,
2952 struct object_id
*b_oid
, int b_mode
)
2954 const char *modify_branch
, *delete_branch
;
2955 struct object_id
*changed_oid
;
2959 modify_branch
= o
->branch1
;
2960 delete_branch
= o
->branch2
;
2961 changed_oid
= a_oid
;
2962 changed_mode
= a_mode
;
2964 modify_branch
= o
->branch2
;
2965 delete_branch
= o
->branch1
;
2966 changed_oid
= b_oid
;
2967 changed_mode
= b_mode
;
2970 return handle_change_delete(o
,
2973 changed_oid
, changed_mode
,
2974 modify_branch
, delete_branch
,
2975 _("modify"), _("modified"));
2978 static int handle_content_merge(struct merge_options
*o
,
2981 struct object_id
*o_oid
, int o_mode
,
2982 struct object_id
*a_oid
, int a_mode
,
2983 struct object_id
*b_oid
, int b_mode
,
2984 struct rename_conflict_info
*rename_conflict_info
)
2986 const char *reason
= _("content");
2987 const char *path1
= NULL
, *path2
= NULL
;
2988 struct merge_file_info mfi
;
2989 struct diff_filespec one
, a
, b
;
2990 unsigned df_conflict_remains
= 0;
2993 reason
= _("add/add");
2994 o_oid
= (struct object_id
*)&null_oid
;
2996 one
.path
= a
.path
= b
.path
= (char *)path
;
2997 oidcpy(&one
.oid
, o_oid
);
2999 oidcpy(&a
.oid
, a_oid
);
3001 oidcpy(&b
.oid
, b_oid
);
3004 if (rename_conflict_info
) {
3005 struct diff_filepair
*pair1
= rename_conflict_info
->pair1
;
3007 path1
= (o
->branch1
== rename_conflict_info
->branch1
) ?
3008 pair1
->two
->path
: pair1
->one
->path
;
3009 /* If rename_conflict_info->pair2 != NULL, we are in
3010 * RENAME_ONE_FILE_TO_ONE case. Otherwise, we have a
3013 path2
= (rename_conflict_info
->pair2
||
3014 o
->branch2
== rename_conflict_info
->branch1
) ?
3015 pair1
->two
->path
: pair1
->one
->path
;
3016 one
.path
= pair1
->one
->path
;
3017 a
.path
= (char *)path1
;
3018 b
.path
= (char *)path2
;
3020 if (dir_in_way(path
, !o
->call_depth
,
3021 S_ISGITLINK(pair1
->two
->mode
)))
3022 df_conflict_remains
= 1;
3024 if (merge_mode_and_contents(o
, &one
, &a
, &b
, path
,
3025 o
->branch1
, o
->branch2
, &mfi
))
3029 * We can skip updating the working tree file iff:
3030 * a) The merge is clean
3031 * b) The merge matches what was in HEAD (content, mode, pathname)
3032 * c) The target path is usable (i.e. not involved in D/F conflict)
3035 was_tracked_and_matches(o
, path
, &mfi
.oid
, mfi
.mode
) &&
3036 !df_conflict_remains
) {
3038 struct cache_entry
*ce
;
3040 output(o
, 3, _("Skipped %s (merged same as existing)"), path
);
3041 if (add_cacheinfo(o
, mfi
.mode
, &mfi
.oid
, path
,
3042 0, (!o
->call_depth
&& !is_dirty
), 0))
3045 * However, add_cacheinfo() will delete the old cache entry
3046 * and add a new one. We need to copy over any skip_worktree
3047 * flag to avoid making the file appear as if it were
3048 * deleted by the user.
3050 pos
= index_name_pos(&o
->orig_index
, path
, strlen(path
));
3051 ce
= o
->orig_index
.cache
[pos
];
3052 if (ce_skip_worktree(ce
)) {
3053 pos
= index_name_pos(&the_index
, path
, strlen(path
));
3054 ce
= the_index
.cache
[pos
];
3055 ce
->ce_flags
|= CE_SKIP_WORKTREE
;
3061 if (S_ISGITLINK(mfi
.mode
))
3062 reason
= _("submodule");
3063 output(o
, 1, _("CONFLICT (%s): Merge conflict in %s"),
3065 if (rename_conflict_info
&& !df_conflict_remains
)
3066 if (update_stages(o
, path
, &one
, &a
, &b
))
3070 if (df_conflict_remains
|| is_dirty
) {
3072 if (o
->call_depth
) {
3073 remove_file_from_cache(path
);
3076 if (update_stages(o
, path
, &one
, &a
, &b
))
3079 int file_from_stage2
= was_tracked(o
, path
);
3080 struct diff_filespec merged
;
3081 oidcpy(&merged
.oid
, &mfi
.oid
);
3082 merged
.mode
= mfi
.mode
;
3084 if (update_stages(o
, path
, NULL
,
3085 file_from_stage2
? &merged
: NULL
,
3086 file_from_stage2
? NULL
: &merged
))
3091 new_path
= unique_path(o
, path
, rename_conflict_info
->branch1
);
3093 output(o
, 1, _("Refusing to lose dirty file at %s"),
3096 output(o
, 1, _("Adding as %s instead"), new_path
);
3097 if (update_file(o
, 0, &mfi
.oid
, mfi
.mode
, new_path
)) {
3103 } else if (update_file(o
, mfi
.clean
, &mfi
.oid
, mfi
.mode
, path
))
3105 return !is_dirty
&& mfi
.clean
;
3108 static int handle_rename_normal(struct merge_options
*o
,
3110 struct object_id
*o_oid
, unsigned int o_mode
,
3111 struct object_id
*a_oid
, unsigned int a_mode
,
3112 struct object_id
*b_oid
, unsigned int b_mode
,
3113 struct rename_conflict_info
*ci
)
3115 /* Merge the content and write it out */
3116 return handle_content_merge(o
, path
, was_dirty(o
, path
),
3117 o_oid
, o_mode
, a_oid
, a_mode
, b_oid
, b_mode
,
3121 /* Per entry merge function */
3122 static int process_entry(struct merge_options
*o
,
3123 const char *path
, struct stage_data
*entry
)
3125 int clean_merge
= 1;
3126 int normalize
= o
->renormalize
;
3127 unsigned o_mode
= entry
->stages
[1].mode
;
3128 unsigned a_mode
= entry
->stages
[2].mode
;
3129 unsigned b_mode
= entry
->stages
[3].mode
;
3130 struct object_id
*o_oid
= stage_oid(&entry
->stages
[1].oid
, o_mode
);
3131 struct object_id
*a_oid
= stage_oid(&entry
->stages
[2].oid
, a_mode
);
3132 struct object_id
*b_oid
= stage_oid(&entry
->stages
[3].oid
, b_mode
);
3134 entry
->processed
= 1;
3135 if (entry
->rename_conflict_info
) {
3136 struct rename_conflict_info
*conflict_info
= entry
->rename_conflict_info
;
3137 switch (conflict_info
->rename_type
) {
3139 case RENAME_ONE_FILE_TO_ONE
:
3140 clean_merge
= handle_rename_normal(o
,
3147 case RENAME_VIA_DIR
:
3149 if (handle_rename_via_dir(o
,
3150 conflict_info
->pair1
,
3151 conflict_info
->branch1
,
3152 conflict_info
->branch2
))
3157 if (handle_rename_delete(o
,
3158 conflict_info
->pair1
,
3159 conflict_info
->branch1
,
3160 conflict_info
->branch2
))
3163 case RENAME_ONE_FILE_TO_TWO
:
3165 if (handle_rename_rename_1to2(o
, conflict_info
))
3168 case RENAME_TWO_FILES_TO_ONE
:
3170 if (handle_rename_rename_2to1(o
, conflict_info
))
3174 entry
->processed
= 0;
3177 } else if (o_oid
&& (!a_oid
|| !b_oid
)) {
3178 /* Case A: Deleted in one */
3179 if ((!a_oid
&& !b_oid
) ||
3180 (!b_oid
&& blob_unchanged(o
, o_oid
, o_mode
, a_oid
, a_mode
, normalize
, path
)) ||
3181 (!a_oid
&& blob_unchanged(o
, o_oid
, o_mode
, b_oid
, b_mode
, normalize
, path
))) {
3182 /* Deleted in both or deleted in one and
3183 * unchanged in the other */
3185 output(o
, 2, _("Removing %s"), path
);
3186 /* do not touch working file if it did not exist */
3187 remove_file(o
, 1, path
, !a_oid
);
3189 /* Modify/delete; deleted side may have put a directory in the way */
3191 if (handle_modify_delete(o
, path
, o_oid
, o_mode
,
3192 a_oid
, a_mode
, b_oid
, b_mode
))
3195 } else if ((!o_oid
&& a_oid
&& !b_oid
) ||
3196 (!o_oid
&& !a_oid
&& b_oid
)) {
3197 /* Case B: Added in one. */
3198 /* [nothing|directory] -> ([nothing|directory], file) */
3200 const char *add_branch
;
3201 const char *other_branch
;
3203 const struct object_id
*oid
;
3207 add_branch
= o
->branch1
;
3208 other_branch
= o
->branch2
;
3211 conf
= _("file/directory");
3213 add_branch
= o
->branch2
;
3214 other_branch
= o
->branch1
;
3217 conf
= _("directory/file");
3219 if (dir_in_way(path
,
3220 !o
->call_depth
&& !S_ISGITLINK(a_mode
),
3222 char *new_path
= unique_path(o
, path
, add_branch
);
3224 output(o
, 1, _("CONFLICT (%s): There is a directory with name %s in %s. "
3226 conf
, path
, other_branch
, path
, new_path
);
3227 if (update_file(o
, 0, oid
, mode
, new_path
))
3229 else if (o
->call_depth
)
3230 remove_file_from_cache(path
);
3233 output(o
, 2, _("Adding %s"), path
);
3234 /* do not overwrite file if already present */
3235 if (update_file_flags(o
, oid
, mode
, path
, 1, !a_oid
))
3238 } else if (a_oid
&& b_oid
) {
3239 /* Case C: Added in both (check for same permissions) and */
3240 /* case D: Modified in both, but differently. */
3241 int is_dirty
= 0; /* unpack_trees would have bailed if dirty */
3242 clean_merge
= handle_content_merge(o
, path
, is_dirty
,
3247 } else if (!o_oid
&& !a_oid
&& !b_oid
) {
3249 * this entry was deleted altogether. a_mode == 0 means
3250 * we had that path and want to actively remove it.
3252 remove_file(o
, 1, path
, !a_mode
);
3254 BUG("fatal merge failure, shouldn't happen.");
3259 int merge_trees(struct merge_options
*o
,
3262 struct tree
*common
,
3263 struct tree
**result
)
3266 struct strbuf sb
= STRBUF_INIT
;
3268 if (!o
->call_depth
&& index_has_changes(&the_index
, head
, &sb
)) {
3269 err(o
, _("Your local changes to the following files would be overwritten by merge:\n %s"),
3274 if (o
->subtree_shift
) {
3275 merge
= shift_tree_object(head
, merge
, o
->subtree_shift
);
3276 common
= shift_tree_object(head
, common
, o
->subtree_shift
);
3279 if (oid_eq(&common
->object
.oid
, &merge
->object
.oid
)) {
3280 output(o
, 0, _("Already up to date!"));
3285 code
= unpack_trees_start(o
, common
, head
, merge
);
3288 if (show(o
, 4) || o
->call_depth
)
3289 err(o
, _("merging of trees %s and %s failed"),
3290 oid_to_hex(&head
->object
.oid
),
3291 oid_to_hex(&merge
->object
.oid
));
3292 unpack_trees_finish(o
);
3296 if (unmerged_cache()) {
3297 struct string_list
*entries
;
3298 struct rename_info re_info
;
3301 * Only need the hashmap while processing entries, so
3302 * initialize it here and free it when we are done running
3303 * through the entries. Keeping it in the merge_options as
3304 * opposed to decaring a local hashmap is for convenience
3305 * so that we don't have to pass it to around.
3307 hashmap_init(&o
->current_file_dir_set
, path_hashmap_cmp
, NULL
, 512);
3308 get_files_dirs(o
, head
);
3309 get_files_dirs(o
, merge
);
3311 entries
= get_unmerged();
3312 clean
= detect_and_process_renames(o
, common
, head
, merge
,
3314 record_df_conflict_files(o
, entries
);
3317 for (i
= entries
->nr
-1; 0 <= i
; i
--) {
3318 const char *path
= entries
->items
[i
].string
;
3319 struct stage_data
*e
= entries
->items
[i
].util
;
3320 if (!e
->processed
) {
3321 int ret
= process_entry(o
, path
, e
);
3330 for (i
= 0; i
< entries
->nr
; i
++) {
3331 struct stage_data
*e
= entries
->items
[i
].util
;
3333 BUG("unprocessed path??? %s",
3334 entries
->items
[i
].string
);
3338 final_cleanup_renames(&re_info
);
3340 string_list_clear(entries
, 1);
3343 hashmap_free(&o
->current_file_dir_set
, 1);
3346 unpack_trees_finish(o
);
3353 unpack_trees_finish(o
);
3355 if (o
->call_depth
&& !(*result
= write_tree_from_memory(o
)))
3361 static struct commit_list
*reverse_commit_list(struct commit_list
*list
)
3363 struct commit_list
*next
= NULL
, *current
, *backup
;
3364 for (current
= list
; current
; current
= backup
) {
3365 backup
= current
->next
;
3366 current
->next
= next
;
3373 * Merge the commits h1 and h2, return the resulting virtual
3374 * commit object and a flag indicating the cleanness of the merge.
3376 int merge_recursive(struct merge_options
*o
,
3379 struct commit_list
*ca
,
3380 struct commit
**result
)
3382 struct commit_list
*iter
;
3383 struct commit
*merged_common_ancestors
;
3384 struct tree
*mrtree
;
3388 output(o
, 4, _("Merging:"));
3389 output_commit_title(o
, h1
);
3390 output_commit_title(o
, h2
);
3394 ca
= get_merge_bases(h1
, h2
);
3395 ca
= reverse_commit_list(ca
);
3399 unsigned cnt
= commit_list_count(ca
);
3401 output(o
, 5, Q_("found %u common ancestor:",
3402 "found %u common ancestors:", cnt
), cnt
);
3403 for (iter
= ca
; iter
; iter
= iter
->next
)
3404 output_commit_title(o
, iter
->item
);
3407 merged_common_ancestors
= pop_commit(&ca
);
3408 if (merged_common_ancestors
== NULL
) {
3409 /* if there is no common ancestor, use an empty tree */
3412 tree
= lookup_tree(the_repository
, the_repository
->hash_algo
->empty_tree
);
3413 merged_common_ancestors
= make_virtual_commit(tree
, "ancestor");
3416 for (iter
= ca
; iter
; iter
= iter
->next
) {
3417 const char *saved_b1
, *saved_b2
;
3420 * When the merge fails, the result contains files
3421 * with conflict markers. The cleanness flag is
3422 * ignored (unless indicating an error), it was never
3423 * actually used, as result of merge_trees has always
3424 * overwritten it: the committed "conflicts" were
3428 saved_b1
= o
->branch1
;
3429 saved_b2
= o
->branch2
;
3430 o
->branch1
= "Temporary merge branch 1";
3431 o
->branch2
= "Temporary merge branch 2";
3432 if (merge_recursive(o
, merged_common_ancestors
, iter
->item
,
3433 NULL
, &merged_common_ancestors
) < 0)
3435 o
->branch1
= saved_b1
;
3436 o
->branch2
= saved_b2
;
3439 if (!merged_common_ancestors
)
3440 return err(o
, _("merge returned no commit"));
3447 o
->ancestor
= "merged common ancestors";
3448 clean
= merge_trees(o
, get_commit_tree(h1
), get_commit_tree(h2
),
3449 get_commit_tree(merged_common_ancestors
),
3456 if (o
->call_depth
) {
3457 *result
= make_virtual_commit(mrtree
, "merged tree");
3458 commit_list_insert(h1
, &(*result
)->parents
);
3459 commit_list_insert(h2
, &(*result
)->parents
->next
);
3462 if (!o
->call_depth
&& o
->buffer_output
< 2)
3463 strbuf_release(&o
->obuf
);
3465 diff_warn_rename_limit("merge.renamelimit",
3466 o
->needed_rename_limit
, 0);
3470 static struct commit
*get_ref(const struct object_id
*oid
, const char *name
)
3472 struct object
*object
;
3474 object
= deref_tag(the_repository
, parse_object(the_repository
, oid
),
3479 if (object
->type
== OBJ_TREE
)
3480 return make_virtual_commit((struct tree
*)object
, name
);
3481 if (object
->type
!= OBJ_COMMIT
)
3483 if (parse_commit((struct commit
*)object
))
3485 return (struct commit
*)object
;
3488 int merge_recursive_generic(struct merge_options
*o
,
3489 const struct object_id
*head
,
3490 const struct object_id
*merge
,
3492 const struct object_id
**base_list
,
3493 struct commit
**result
)
3496 struct lock_file lock
= LOCK_INIT
;
3497 struct commit
*head_commit
= get_ref(head
, o
->branch1
);
3498 struct commit
*next_commit
= get_ref(merge
, o
->branch2
);
3499 struct commit_list
*ca
= NULL
;
3503 for (i
= 0; i
< num_base_list
; ++i
) {
3504 struct commit
*base
;
3505 if (!(base
= get_ref(base_list
[i
], oid_to_hex(base_list
[i
]))))
3506 return err(o
, _("Could not parse object '%s'"),
3507 oid_to_hex(base_list
[i
]));
3508 commit_list_insert(base
, &ca
);
3512 hold_locked_index(&lock
, LOCK_DIE_ON_ERROR
);
3513 clean
= merge_recursive(o
, head_commit
, next_commit
, ca
,
3516 rollback_lock_file(&lock
);
3520 if (write_locked_index(&the_index
, &lock
,
3521 COMMIT_LOCK
| SKIP_IF_UNCHANGED
))
3522 return err(o
, _("Unable to write index."));
3524 return clean
? 0 : 1;
3527 static void merge_recursive_config(struct merge_options
*o
)
3530 git_config_get_int("merge.verbosity", &o
->verbosity
);
3531 git_config_get_int("diff.renamelimit", &o
->diff_rename_limit
);
3532 git_config_get_int("merge.renamelimit", &o
->merge_rename_limit
);
3533 if (!git_config_get_string("diff.renames", &value
)) {
3534 o
->diff_detect_rename
= git_config_rename("diff.renames", value
);
3537 if (!git_config_get_string("merge.renames", &value
)) {
3538 o
->merge_detect_rename
= git_config_rename("merge.renames", value
);
3541 git_config(git_xmerge_config
, NULL
);
3544 void init_merge_options(struct merge_options
*o
)
3546 const char *merge_verbosity
;
3547 memset(o
, 0, sizeof(struct merge_options
));
3549 o
->buffer_output
= 1;
3550 o
->diff_rename_limit
= -1;
3551 o
->merge_rename_limit
= -1;
3553 o
->diff_detect_rename
= -1;
3554 o
->merge_detect_rename
= -1;
3555 o
->detect_directory_renames
= 1;
3556 merge_recursive_config(o
);
3557 merge_verbosity
= getenv("GIT_MERGE_VERBOSITY");
3558 if (merge_verbosity
)
3559 o
->verbosity
= strtol(merge_verbosity
, NULL
, 10);
3560 if (o
->verbosity
>= 5)
3561 o
->buffer_output
= 0;
3562 strbuf_init(&o
->obuf
, 0);
3563 string_list_init(&o
->df_conflict_file_set
, 1);
3566 int parse_merge_opt(struct merge_options
*o
, const char *s
)
3572 if (!strcmp(s
, "ours"))
3573 o
->recursive_variant
= MERGE_RECURSIVE_OURS
;
3574 else if (!strcmp(s
, "theirs"))
3575 o
->recursive_variant
= MERGE_RECURSIVE_THEIRS
;
3576 else if (!strcmp(s
, "subtree"))
3577 o
->subtree_shift
= "";
3578 else if (skip_prefix(s
, "subtree=", &arg
))
3579 o
->subtree_shift
= arg
;
3580 else if (!strcmp(s
, "patience"))
3581 o
->xdl_opts
= DIFF_WITH_ALG(o
, PATIENCE_DIFF
);
3582 else if (!strcmp(s
, "histogram"))
3583 o
->xdl_opts
= DIFF_WITH_ALG(o
, HISTOGRAM_DIFF
);
3584 else if (skip_prefix(s
, "diff-algorithm=", &arg
)) {
3585 long value
= parse_algorithm_value(arg
);
3588 /* clear out previous settings */
3589 DIFF_XDL_CLR(o
, NEED_MINIMAL
);
3590 o
->xdl_opts
&= ~XDF_DIFF_ALGORITHM_MASK
;
3591 o
->xdl_opts
|= value
;
3593 else if (!strcmp(s
, "ignore-space-change"))
3594 DIFF_XDL_SET(o
, IGNORE_WHITESPACE_CHANGE
);
3595 else if (!strcmp(s
, "ignore-all-space"))
3596 DIFF_XDL_SET(o
, IGNORE_WHITESPACE
);
3597 else if (!strcmp(s
, "ignore-space-at-eol"))
3598 DIFF_XDL_SET(o
, IGNORE_WHITESPACE_AT_EOL
);
3599 else if (!strcmp(s
, "ignore-cr-at-eol"))
3600 DIFF_XDL_SET(o
, IGNORE_CR_AT_EOL
);
3601 else if (!strcmp(s
, "renormalize"))
3603 else if (!strcmp(s
, "no-renormalize"))
3605 else if (!strcmp(s
, "no-renames"))
3606 o
->merge_detect_rename
= 0;
3607 else if (!strcmp(s
, "find-renames")) {
3608 o
->merge_detect_rename
= 1;
3609 o
->rename_score
= 0;
3611 else if (skip_prefix(s
, "find-renames=", &arg
) ||
3612 skip_prefix(s
, "rename-threshold=", &arg
)) {
3613 if ((o
->rename_score
= parse_rename_score(&arg
)) == -1 || *arg
!= 0)
3615 o
->merge_detect_rename
= 1;