]>
Commit | Line | Data |
---|---|---|
9047ebbc MV |
1 | /* |
2 | * Recursive Merge algorithm stolen from git-merge-recursive.py by | |
3 | * Fredrik Kuivinen. | |
4 | * The thieves were Alex Riesen and Johannes Schindelin, in June/July 2006 | |
5 | */ | |
6 | #include "cache.h" | |
4615a8cb EN |
7 | #include "merge-recursive.h" |
8 | ||
1c4b6604 | 9 | #include "advice.h" |
4615a8cb EN |
10 | #include "alloc.h" |
11 | #include "attr.h" | |
9047ebbc MV |
12 | #include "blob.h" |
13 | #include "builtin.h" | |
4615a8cb EN |
14 | #include "cache-tree.h" |
15 | #include "commit.h" | |
16 | #include "commit-reach.h" | |
17 | #include "config.h" | |
9047ebbc MV |
18 | #include "diff.h" |
19 | #include "diffcore.h" | |
4615a8cb EN |
20 | #include "dir.h" |
21 | #include "ll-merge.h" | |
22 | #include "lockfile.h" | |
23 | #include "object-store.h" | |
24 | #include "repository.h" | |
25 | #include "revision.h" | |
26 | #include "string-list.h" | |
27 | #include "submodule.h" | |
9047ebbc | 28 | #include "tag.h" |
4615a8cb | 29 | #include "tree-walk.h" |
9047ebbc | 30 | #include "unpack-trees.h" |
9047ebbc | 31 | #include "xdiff-interface.h" |
9047ebbc | 32 | |
5bf7e577 EN |
33 | struct merge_options_internal { |
34 | int call_depth; | |
35 | int needed_rename_limit; | |
36 | struct hashmap current_file_dir_set; | |
37 | struct string_list df_conflict_file_set; | |
38 | struct unpack_trees_options unpack_opts; | |
39 | struct index_state orig_index; | |
40 | }; | |
9047ebbc | 41 | |
fc65b00d KW |
42 | struct path_hashmap_entry { |
43 | struct hashmap_entry e; | |
44 | char path[FLEX_ARRAY]; | |
45 | }; | |
46 | ||
47 | static int path_hashmap_cmp(const void *cmp_data, | |
939af16e EW |
48 | const struct hashmap_entry *eptr, |
49 | const struct hashmap_entry *entry_or_key, | |
fc65b00d KW |
50 | const void *keydata) |
51 | { | |
939af16e | 52 | const struct path_hashmap_entry *a, *b; |
fc65b00d KW |
53 | const char *key = keydata; |
54 | ||
939af16e EW |
55 | a = container_of(eptr, const struct path_hashmap_entry, e); |
56 | b = container_of(entry_or_key, const struct path_hashmap_entry, e); | |
57 | ||
fc65b00d KW |
58 | if (ignore_case) |
59 | return strcasecmp(a->path, key ? key : b->path); | |
60 | else | |
61 | return strcmp(a->path, key ? key : b->path); | |
62 | } | |
63 | ||
64 | static unsigned int path_hash(const char *path) | |
65 | { | |
66 | return ignore_case ? strihash(path) : strhash(path); | |
67 | } | |
68 | ||
7c0a6c8e EN |
69 | /* |
70 | * For dir_rename_entry, directory names are stored as a full path from the | |
71 | * toplevel of the repository and do not include a trailing '/'. Also: | |
72 | * | |
73 | * dir: original name of directory being renamed | |
74 | * non_unique_new_dir: if true, could not determine new_dir | |
75 | * new_dir: final name of directory being renamed | |
76 | * possible_new_dirs: temporary used to help determine new_dir; see comments | |
77 | * in get_directory_renames() for details | |
78 | */ | |
79 | struct dir_rename_entry { | |
5efabc7e | 80 | struct hashmap_entry ent; |
7c0a6c8e EN |
81 | char *dir; |
82 | unsigned non_unique_new_dir:1; | |
83 | struct strbuf new_dir; | |
84 | struct string_list possible_new_dirs; | |
85 | }; | |
86 | ||
7fe40b88 EN |
87 | static struct dir_rename_entry *dir_rename_find_entry(struct hashmap *hashmap, |
88 | char *dir) | |
89 | { | |
90 | struct dir_rename_entry key; | |
91 | ||
92 | if (dir == NULL) | |
93 | return NULL; | |
d22245a2 | 94 | hashmap_entry_init(&key.ent, strhash(dir)); |
7fe40b88 | 95 | key.dir = dir; |
404ab78e | 96 | return hashmap_get_entry(hashmap, &key, ent, NULL); |
7fe40b88 EN |
97 | } |
98 | ||
99 | static int dir_rename_cmp(const void *unused_cmp_data, | |
939af16e EW |
100 | const struct hashmap_entry *eptr, |
101 | const struct hashmap_entry *entry_or_key, | |
7fe40b88 EN |
102 | const void *unused_keydata) |
103 | { | |
939af16e EW |
104 | const struct dir_rename_entry *e1, *e2; |
105 | ||
106 | e1 = container_of(eptr, const struct dir_rename_entry, ent); | |
107 | e2 = container_of(entry_or_key, const struct dir_rename_entry, ent); | |
7fe40b88 EN |
108 | |
109 | return strcmp(e1->dir, e2->dir); | |
110 | } | |
111 | ||
112 | static void dir_rename_init(struct hashmap *map) | |
113 | { | |
114 | hashmap_init(map, dir_rename_cmp, NULL, 0); | |
115 | } | |
116 | ||
117 | static void dir_rename_entry_init(struct dir_rename_entry *entry, | |
118 | char *directory) | |
119 | { | |
d22245a2 | 120 | hashmap_entry_init(&entry->ent, strhash(directory)); |
7fe40b88 EN |
121 | entry->dir = directory; |
122 | entry->non_unique_new_dir = 0; | |
123 | strbuf_init(&entry->new_dir, 0); | |
124 | string_list_init(&entry->possible_new_dirs, 0); | |
125 | } | |
126 | ||
7c0a6c8e | 127 | struct collision_entry { |
5efabc7e | 128 | struct hashmap_entry ent; |
7c0a6c8e EN |
129 | char *target_file; |
130 | struct string_list source_files; | |
131 | unsigned reported_already:1; | |
132 | }; | |
133 | ||
e95ab70a EN |
134 | static struct collision_entry *collision_find_entry(struct hashmap *hashmap, |
135 | char *target_file) | |
136 | { | |
137 | struct collision_entry key; | |
138 | ||
d22245a2 | 139 | hashmap_entry_init(&key.ent, strhash(target_file)); |
e95ab70a | 140 | key.target_file = target_file; |
404ab78e | 141 | return hashmap_get_entry(hashmap, &key, ent, NULL); |
e95ab70a EN |
142 | } |
143 | ||
939af16e EW |
144 | static int collision_cmp(const void *unused_cmp_data, |
145 | const struct hashmap_entry *eptr, | |
146 | const struct hashmap_entry *entry_or_key, | |
e95ab70a EN |
147 | const void *unused_keydata) |
148 | { | |
939af16e EW |
149 | const struct collision_entry *e1, *e2; |
150 | ||
151 | e1 = container_of(eptr, const struct collision_entry, ent); | |
152 | e2 = container_of(entry_or_key, const struct collision_entry, ent); | |
153 | ||
e95ab70a EN |
154 | return strcmp(e1->target_file, e2->target_file); |
155 | } | |
156 | ||
157 | static void collision_init(struct hashmap *map) | |
158 | { | |
939af16e | 159 | hashmap_init(map, collision_cmp, NULL, 0); |
e95ab70a EN |
160 | } |
161 | ||
259ccb6c | 162 | static void flush_output(struct merge_options *opt) |
bc9204d4 | 163 | { |
259ccb6c EN |
164 | if (opt->buffer_output < 2 && opt->obuf.len) { |
165 | fputs(opt->obuf.buf, stdout); | |
166 | strbuf_reset(&opt->obuf); | |
bc9204d4 JS |
167 | } |
168 | } | |
169 | ||
259ccb6c | 170 | static int err(struct merge_options *opt, const char *err, ...) |
bc9204d4 JS |
171 | { |
172 | va_list params; | |
173 | ||
259ccb6c EN |
174 | if (opt->buffer_output < 2) |
175 | flush_output(opt); | |
f1e2426b | 176 | else { |
259ccb6c EN |
177 | strbuf_complete(&opt->obuf, '\n'); |
178 | strbuf_addstr(&opt->obuf, "error: "); | |
f1e2426b | 179 | } |
bc9204d4 | 180 | va_start(params, err); |
259ccb6c | 181 | strbuf_vaddf(&opt->obuf, err, params); |
bc9204d4 | 182 | va_end(params); |
259ccb6c EN |
183 | if (opt->buffer_output > 1) |
184 | strbuf_addch(&opt->obuf, '\n'); | |
f1e2426b | 185 | else { |
259ccb6c EN |
186 | error("%s", opt->obuf.buf); |
187 | strbuf_reset(&opt->obuf); | |
f1e2426b | 188 | } |
bc9204d4 JS |
189 | |
190 | return -1; | |
191 | } | |
192 | ||
d7cf3a96 NTND |
193 | static struct tree *shift_tree_object(struct repository *repo, |
194 | struct tree *one, struct tree *two, | |
85e51b78 | 195 | const char *subtree_shift) |
9047ebbc | 196 | { |
f2fd0760 | 197 | struct object_id shifted; |
9047ebbc | 198 | |
85e51b78 | 199 | if (!*subtree_shift) { |
90d34051 | 200 | shift_tree(repo, &one->object.oid, &two->object.oid, &shifted, 0); |
85e51b78 | 201 | } else { |
90d34051 | 202 | shift_tree_by(repo, &one->object.oid, &two->object.oid, &shifted, |
85e51b78 JH |
203 | subtree_shift); |
204 | } | |
4a7e27e9 | 205 | if (oideq(&two->object.oid, &shifted)) |
9047ebbc | 206 | return two; |
d7cf3a96 | 207 | return lookup_tree(repo, &shifted); |
9047ebbc MV |
208 | } |
209 | ||
a133c40b NTND |
210 | static inline void set_commit_tree(struct commit *c, struct tree *t) |
211 | { | |
212 | c->maybe_tree = t; | |
213 | } | |
214 | ||
d7cf3a96 NTND |
215 | static struct commit *make_virtual_commit(struct repository *repo, |
216 | struct tree *tree, | |
217 | const char *comment) | |
9047ebbc | 218 | { |
d7cf3a96 | 219 | struct commit *commit = alloc_commit_node(repo); |
ae8e4c9c | 220 | |
a2571653 | 221 | set_merge_remote_desc(commit, comment, (struct object *)commit); |
a133c40b | 222 | set_commit_tree(commit, tree); |
9047ebbc MV |
223 | commit->object.parsed = 1; |
224 | return commit; | |
225 | } | |
226 | ||
25c39363 EN |
227 | enum rename_type { |
228 | RENAME_NORMAL = 0, | |
5455c338 | 229 | RENAME_VIA_DIR, |
7f867165 | 230 | RENAME_ADD, |
25c39363 | 231 | RENAME_DELETE, |
4f66dade | 232 | RENAME_ONE_FILE_TO_ONE, |
461f5041 EN |
233 | RENAME_ONE_FILE_TO_TWO, |
234 | RENAME_TWO_FILES_TO_ONE | |
25c39363 EN |
235 | }; |
236 | ||
9047ebbc MV |
237 | /* |
238 | * Since we want to write the index eventually, we cannot reuse the index | |
239 | * for these (temporary) data. | |
240 | */ | |
9cba13ca | 241 | struct stage_data { |
8daec1df | 242 | struct diff_filespec stages[4]; /* mostly for oid & mode; maybe path */ |
4f66dade | 243 | struct rename_conflict_info *rename_conflict_info; |
9047ebbc MV |
244 | unsigned processed:1; |
245 | }; | |
246 | ||
967d6be7 | 247 | struct rename { |
6d169fd3 | 248 | unsigned processed:1; |
967d6be7 | 249 | struct diff_filepair *pair; |
c336ab85 | 250 | const char *branch; /* branch that the rename occurred on */ |
6d169fd3 EN |
251 | /* |
252 | * If directory rename detection affected this rename, what was its | |
253 | * original type ('A' or 'R') and it's original destination before | |
254 | * the directory rename (otherwise, '\0' and NULL for these two vars). | |
255 | */ | |
256 | char dir_rename_original_type; | |
257 | char *dir_rename_original_dest; | |
967d6be7 EN |
258 | /* |
259 | * Purpose of src_entry and dst_entry: | |
260 | * | |
261 | * If 'before' is renamed to 'after' then src_entry will contain | |
262 | * the versions of 'before' from the merge_base, HEAD, and MERGE in | |
263 | * stages 1, 2, and 3; dst_entry will contain the respective | |
264 | * versions of 'after' in corresponding locations. Thus, we have a | |
265 | * total of six modes and oids, though some will be null. (Stage 0 | |
266 | * is ignored; we're interested in handling conflicts.) | |
267 | * | |
268 | * Since we don't turn on break-rewrites by default, neither | |
269 | * src_entry nor dst_entry can have all three of their stages have | |
270 | * non-null oids, meaning at most four of the six will be non-null. | |
271 | * Also, since this is a rename, both src_entry and dst_entry will | |
272 | * have at least one non-null oid, meaning at least two will be | |
273 | * non-null. Of the six oids, a typical rename will have three be | |
274 | * non-null. Only two implies a rename/delete, and four implies a | |
275 | * rename/add. | |
276 | */ | |
277 | struct stage_data *src_entry; | |
278 | struct stage_data *dst_entry; | |
967d6be7 EN |
279 | }; |
280 | ||
281 | struct rename_conflict_info { | |
282 | enum rename_type rename_type; | |
e9cd1b5c EN |
283 | struct rename *ren1; |
284 | struct rename *ren2; | |
967d6be7 EN |
285 | }; |
286 | ||
4f66dade | 287 | static inline void setup_rename_conflict_info(enum rename_type rename_type, |
e9cd1b5c EN |
288 | struct merge_options *opt, |
289 | struct rename *ren1, | |
c336ab85 | 290 | struct rename *ren2) |
25c39363 | 291 | { |
4f445453 EN |
292 | struct rename_conflict_info *ci; |
293 | ||
294 | /* | |
295 | * When we have two renames involved, it's easiest to get the | |
296 | * correct things into stage 2 and 3, and to make sure that the | |
297 | * content merge puts HEAD before the other branch if we just | |
259ccb6c | 298 | * ensure that branch1 == opt->branch1. So, simply flip arguments |
4f445453 EN |
299 | * around if we don't have that. |
300 | */ | |
c336ab85 EN |
301 | if (ren2 && ren1->branch != opt->branch1) { |
302 | setup_rename_conflict_info(rename_type, opt, ren2, ren1); | |
4f445453 EN |
303 | return; |
304 | } | |
305 | ||
306 | ci = xcalloc(1, sizeof(struct rename_conflict_info)); | |
25c39363 | 307 | ci->rename_type = rename_type; |
e9cd1b5c EN |
308 | ci->ren1 = ren1; |
309 | ci->ren2 = ren2; | |
25c39363 | 310 | |
e9cd1b5c EN |
311 | ci->ren1->dst_entry->processed = 0; |
312 | ci->ren1->dst_entry->rename_conflict_info = ci; | |
e9cd1b5c EN |
313 | if (ren2) { |
314 | ci->ren2->dst_entry->rename_conflict_info = ci; | |
25c39363 EN |
315 | } |
316 | } | |
317 | ||
259ccb6c | 318 | static int show(struct merge_options *opt, int v) |
9047ebbc | 319 | { |
5bf7e577 EN |
320 | return (!opt->priv->call_depth && opt->verbosity >= v) || |
321 | opt->verbosity >= 5; | |
9047ebbc MV |
322 | } |
323 | ||
28bea9e5 | 324 | __attribute__((format (printf, 3, 4))) |
259ccb6c | 325 | static void output(struct merge_options *opt, int v, const char *fmt, ...) |
9047ebbc | 326 | { |
9047ebbc MV |
327 | va_list ap; |
328 | ||
259ccb6c | 329 | if (!show(opt, v)) |
9047ebbc MV |
330 | return; |
331 | ||
5bf7e577 | 332 | strbuf_addchars(&opt->obuf, ' ', opt->priv->call_depth * 2); |
9047ebbc MV |
333 | |
334 | va_start(ap, fmt); | |
259ccb6c | 335 | strbuf_vaddf(&opt->obuf, fmt, ap); |
9047ebbc MV |
336 | va_end(ap); |
337 | ||
259ccb6c EN |
338 | strbuf_addch(&opt->obuf, '\n'); |
339 | if (!opt->buffer_output) | |
340 | flush_output(opt); | |
9047ebbc MV |
341 | } |
342 | ||
259ccb6c | 343 | static void output_commit_title(struct merge_options *opt, struct commit *commit) |
9047ebbc | 344 | { |
e2e5ac23 NTND |
345 | struct merge_remote_desc *desc; |
346 | ||
5bf7e577 | 347 | strbuf_addchars(&opt->obuf, ' ', opt->priv->call_depth * 2); |
e2e5ac23 NTND |
348 | desc = merge_remote_util(commit); |
349 | if (desc) | |
259ccb6c | 350 | strbuf_addf(&opt->obuf, "virtual %s\n", desc->name); |
9047ebbc | 351 | else { |
259ccb6c | 352 | strbuf_add_unique_abbrev(&opt->obuf, &commit->object.oid, |
a94bb683 | 353 | DEFAULT_ABBREV); |
259ccb6c | 354 | strbuf_addch(&opt->obuf, ' '); |
9047ebbc | 355 | if (parse_commit(commit) != 0) |
259ccb6c | 356 | strbuf_addstr(&opt->obuf, _("(bad commit)\n")); |
9047ebbc | 357 | else { |
49b7120e | 358 | const char *title; |
8597ea3a | 359 | const char *msg = get_commit_buffer(commit, NULL); |
bc6b8fc1 | 360 | int len = find_commit_subject(msg, &title); |
49b7120e | 361 | if (len) |
259ccb6c | 362 | strbuf_addf(&opt->obuf, "%.*s\n", len, title); |
bc6b8fc1 | 363 | unuse_commit_buffer(commit, msg); |
9047ebbc MV |
364 | } |
365 | } | |
259ccb6c | 366 | flush_output(opt); |
9047ebbc MV |
367 | } |
368 | ||
259ccb6c | 369 | static int add_cacheinfo(struct merge_options *opt, |
8daec1df | 370 | const struct diff_filespec *blob, |
d90e759f | 371 | const char *path, int stage, int refresh, int options) |
9047ebbc | 372 | { |
259ccb6c | 373 | struct index_state *istate = opt->repo->index; |
9047ebbc | 374 | struct cache_entry *ce; |
1335d76e JH |
375 | int ret; |
376 | ||
8daec1df | 377 | ce = make_cache_entry(istate, blob->mode, &blob->oid, path, stage, 0); |
9047ebbc | 378 | if (!ce) |
259ccb6c | 379 | return err(opt, _("add_cacheinfo failed for path '%s'; merge aborting."), path); |
1335d76e | 380 | |
0d6caa2d | 381 | ret = add_index_entry(istate, ce, options); |
1335d76e JH |
382 | if (refresh) { |
383 | struct cache_entry *nce; | |
384 | ||
0d6caa2d NTND |
385 | nce = refresh_cache_entry(istate, ce, |
386 | CE_MATCH_REFRESH | CE_MATCH_IGNORE_MISSING); | |
55e9f0e5 | 387 | if (!nce) |
259ccb6c | 388 | return err(opt, _("add_cacheinfo failed to refresh for path '%s'; merge aborting."), path); |
1335d76e | 389 | if (nce != ce) |
0d6caa2d | 390 | ret = add_index_entry(istate, nce, options); |
1335d76e JH |
391 | } |
392 | return ret; | |
9047ebbc MV |
393 | } |
394 | ||
7c0a6c8e EN |
395 | static inline int merge_detect_rename(struct merge_options *opt) |
396 | { | |
8599ab45 | 397 | return (opt->detect_renames >= 0) ? opt->detect_renames : 1; |
7c0a6c8e EN |
398 | } |
399 | ||
9047ebbc MV |
400 | static void init_tree_desc_from_tree(struct tree_desc *desc, struct tree *tree) |
401 | { | |
402 | parse_tree(tree); | |
403 | init_tree_desc(desc, tree->buffer, tree->size); | |
404 | } | |
405 | ||
259ccb6c | 406 | static int unpack_trees_start(struct merge_options *opt, |
3f1c1c36 EN |
407 | struct tree *common, |
408 | struct tree *head, | |
409 | struct tree *merge) | |
9047ebbc MV |
410 | { |
411 | int rc; | |
412 | struct tree_desc t[3]; | |
a35edc84 | 413 | struct index_state tmp_index = { NULL }; |
9047ebbc | 414 | |
5bf7e577 EN |
415 | memset(&opt->priv->unpack_opts, 0, sizeof(opt->priv->unpack_opts)); |
416 | if (opt->priv->call_depth) | |
417 | opt->priv->unpack_opts.index_only = 1; | |
9047ebbc | 418 | else |
5bf7e577 EN |
419 | opt->priv->unpack_opts.update = 1; |
420 | opt->priv->unpack_opts.merge = 1; | |
421 | opt->priv->unpack_opts.head_idx = 2; | |
422 | opt->priv->unpack_opts.fn = threeway_merge; | |
423 | opt->priv->unpack_opts.src_index = opt->repo->index; | |
424 | opt->priv->unpack_opts.dst_index = &tmp_index; | |
425 | opt->priv->unpack_opts.aggressive = !merge_detect_rename(opt); | |
426 | setup_unpack_trees_porcelain(&opt->priv->unpack_opts, "merge"); | |
9047ebbc MV |
427 | |
428 | init_tree_desc_from_tree(t+0, common); | |
429 | init_tree_desc_from_tree(t+1, head); | |
430 | init_tree_desc_from_tree(t+2, merge); | |
431 | ||
5bf7e577 | 432 | rc = unpack_trees(3, t, &opt->priv->unpack_opts); |
259ccb6c | 433 | cache_tree_free(&opt->repo->index->cache_tree); |
a35edc84 | 434 | |
64b1abe9 | 435 | /* |
5bf7e577 EN |
436 | * Update opt->repo->index to match the new results, AFTER saving a |
437 | * copy in opt->priv->orig_index. Update src_index to point to the | |
438 | * saved copy. (verify_uptodate() checks src_index, and the original | |
439 | * index is the one that had the necessary modification timestamps.) | |
64b1abe9 | 440 | */ |
5bf7e577 | 441 | opt->priv->orig_index = *opt->repo->index; |
259ccb6c | 442 | *opt->repo->index = tmp_index; |
5bf7e577 | 443 | opt->priv->unpack_opts.src_index = &opt->priv->orig_index; |
a35edc84 | 444 | |
9047ebbc MV |
445 | return rc; |
446 | } | |
447 | ||
259ccb6c | 448 | static void unpack_trees_finish(struct merge_options *opt) |
3f1c1c36 | 449 | { |
5bf7e577 EN |
450 | discard_index(&opt->priv->orig_index); |
451 | clear_unpack_trees_porcelain(&opt->priv->unpack_opts); | |
9047ebbc MV |
452 | } |
453 | ||
df46d77e | 454 | static int save_files_dirs(const struct object_id *oid, |
d90e759f EN |
455 | struct strbuf *base, const char *path, |
456 | unsigned int mode, int stage, void *context) | |
9047ebbc | 457 | { |
fc65b00d | 458 | struct path_hashmap_entry *entry; |
6a0b0b6d | 459 | int baselen = base->len; |
259ccb6c | 460 | struct merge_options *opt = context; |
696ee23c | 461 | |
6a0b0b6d | 462 | strbuf_addstr(base, path); |
9047ebbc | 463 | |
fc65b00d | 464 | FLEX_ALLOC_MEM(entry, path, base->buf, base->len); |
d22245a2 | 465 | hashmap_entry_init(&entry->e, path_hash(entry->path)); |
5efabc7e | 466 | hashmap_add(&opt->priv->current_file_dir_set, &entry->e); |
9047ebbc | 467 | |
6a0b0b6d | 468 | strbuf_setlen(base, baselen); |
d3bee161 | 469 | return (S_ISDIR(mode) ? READ_TREE_RECURSIVE : 0); |
9047ebbc MV |
470 | } |
471 | ||
259ccb6c | 472 | static void get_files_dirs(struct merge_options *opt, struct tree *tree) |
9047ebbc | 473 | { |
f0096c06 | 474 | struct pathspec match_all; |
9a087274 | 475 | memset(&match_all, 0, sizeof(match_all)); |
34e7771b | 476 | read_tree_recursive(opt->repo, tree, "", 0, 0, |
259ccb6c | 477 | &match_all, save_files_dirs, opt); |
9047ebbc MV |
478 | } |
479 | ||
34e7771b NTND |
480 | static int get_tree_entry_if_blob(struct repository *r, |
481 | const struct object_id *tree, | |
5b047ac0 | 482 | const char *path, |
8daec1df | 483 | struct diff_filespec *dfs) |
5b047ac0 EN |
484 | { |
485 | int ret; | |
486 | ||
34e7771b | 487 | ret = get_tree_entry(r, tree, path, &dfs->oid, &dfs->mode); |
8daec1df EN |
488 | if (S_ISDIR(dfs->mode)) { |
489 | oidcpy(&dfs->oid, &null_oid); | |
490 | dfs->mode = 0; | |
5b047ac0 EN |
491 | } |
492 | return ret; | |
493 | } | |
494 | ||
9047ebbc MV |
495 | /* |
496 | * Returns an index_entry instance which doesn't have to correspond to | |
497 | * a real cache entry in Git's index. | |
498 | */ | |
34e7771b NTND |
499 | static struct stage_data *insert_stage_data(struct repository *r, |
500 | const char *path, | |
9047ebbc MV |
501 | struct tree *o, struct tree *a, struct tree *b, |
502 | struct string_list *entries) | |
503 | { | |
504 | struct string_list_item *item; | |
505 | struct stage_data *e = xcalloc(1, sizeof(struct stage_data)); | |
34e7771b NTND |
506 | get_tree_entry_if_blob(r, &o->object.oid, path, &e->stages[1]); |
507 | get_tree_entry_if_blob(r, &a->object.oid, path, &e->stages[2]); | |
508 | get_tree_entry_if_blob(r, &b->object.oid, path, &e->stages[3]); | |
78a395d3 | 509 | item = string_list_insert(entries, path); |
9047ebbc MV |
510 | item->util = e; |
511 | return e; | |
512 | } | |
513 | ||
514 | /* | |
515 | * Create a dictionary mapping file names to stage_data objects. The | |
516 | * dictionary contains one entry for every path with a non-zero stage entry. | |
517 | */ | |
0d6caa2d | 518 | static struct string_list *get_unmerged(struct index_state *istate) |
9047ebbc MV |
519 | { |
520 | struct string_list *unmerged = xcalloc(1, sizeof(struct string_list)); | |
521 | int i; | |
522 | ||
523 | unmerged->strdup_strings = 1; | |
524 | ||
0d6caa2d | 525 | for (i = 0; i < istate->cache_nr; i++) { |
9047ebbc MV |
526 | struct string_list_item *item; |
527 | struct stage_data *e; | |
0d6caa2d | 528 | const struct cache_entry *ce = istate->cache[i]; |
9047ebbc MV |
529 | if (!ce_stage(ce)) |
530 | continue; | |
531 | ||
e8c8b713 | 532 | item = string_list_lookup(unmerged, ce->name); |
9047ebbc | 533 | if (!item) { |
78a395d3 | 534 | item = string_list_insert(unmerged, ce->name); |
9047ebbc MV |
535 | item->util = xcalloc(1, sizeof(struct stage_data)); |
536 | } | |
537 | e = item->util; | |
538 | e->stages[ce_stage(ce)].mode = ce->ce_mode; | |
99d1a986 | 539 | oidcpy(&e->stages[ce_stage(ce)].oid, &ce->oid); |
9047ebbc MV |
540 | } |
541 | ||
542 | return unmerged; | |
543 | } | |
544 | ||
fa6ca111 | 545 | static int string_list_df_name_compare(const char *one, const char *two) |
ef02b317 | 546 | { |
fa6ca111 NTND |
547 | int onelen = strlen(one); |
548 | int twolen = strlen(two); | |
f0fd4d05 EN |
549 | /* |
550 | * Here we only care that entries for D/F conflicts are | |
551 | * adjacent, in particular with the file of the D/F conflict | |
552 | * appearing before files below the corresponding directory. | |
553 | * The order of the rest of the list is irrelevant for us. | |
ef02b317 | 554 | * |
f0fd4d05 EN |
555 | * To achieve this, we sort with df_name_compare and provide |
556 | * the mode S_IFDIR so that D/F conflicts will sort correctly. | |
557 | * We use the mode S_IFDIR for everything else for simplicity, | |
558 | * since in other cases any changes in their order due to | |
559 | * sorting cause no problems for us. | |
560 | */ | |
fa6ca111 NTND |
561 | int cmp = df_name_compare(one, onelen, S_IFDIR, |
562 | two, twolen, S_IFDIR); | |
f0fd4d05 EN |
563 | /* |
564 | * Now that 'foo' and 'foo/bar' compare equal, we have to make sure | |
565 | * that 'foo' comes before 'foo/bar'. | |
ef02b317 | 566 | */ |
f0fd4d05 EN |
567 | if (cmp) |
568 | return cmp; | |
569 | return onelen - twolen; | |
570 | } | |
571 | ||
259ccb6c | 572 | static void record_df_conflict_files(struct merge_options *opt, |
70cc3d36 | 573 | struct string_list *entries) |
ef02b317 | 574 | { |
70cc3d36 | 575 | /* If there is a D/F conflict and the file for such a conflict |
2d6bad91 | 576 | * currently exists in the working tree, we want to allow it to be |
edd2faf5 EN |
577 | * removed to make room for the corresponding directory if needed. |
578 | * The files underneath the directories of such D/F conflicts will | |
579 | * be processed before the corresponding file involved in the D/F | |
580 | * conflict. If the D/F directory ends up being removed by the | |
581 | * merge, then we won't have to touch the D/F file. If the D/F | |
582 | * directory needs to be written to the working copy, then the D/F | |
583 | * file will simply be removed (in make_room_for_path()) to make | |
584 | * room for the necessary paths. Note that if both the directory | |
585 | * and the file need to be present, then the D/F file will be | |
586 | * reinstated with a new unique name at the time it is processed. | |
ef02b317 | 587 | */ |
af4941d4 | 588 | struct string_list df_sorted_entries = STRING_LIST_INIT_NODUP; |
ef02b317 | 589 | const char *last_file = NULL; |
c8516500 | 590 | int last_len = 0; |
ef02b317 EN |
591 | int i; |
592 | ||
0b30e812 EN |
593 | /* |
594 | * If we're merging merge-bases, we don't want to bother with | |
595 | * any working directory changes. | |
596 | */ | |
5bf7e577 | 597 | if (opt->priv->call_depth) |
0b30e812 EN |
598 | return; |
599 | ||
f0fd4d05 | 600 | /* Ensure D/F conflicts are adjacent in the entries list. */ |
ef02b317 | 601 | for (i = 0; i < entries->nr; i++) { |
f701aae0 EN |
602 | struct string_list_item *next = &entries->items[i]; |
603 | string_list_append(&df_sorted_entries, next->string)->util = | |
604 | next->util; | |
605 | } | |
fa6ca111 NTND |
606 | df_sorted_entries.cmp = string_list_df_name_compare; |
607 | string_list_sort(&df_sorted_entries); | |
f0fd4d05 | 608 | |
5bf7e577 | 609 | string_list_clear(&opt->priv->df_conflict_file_set, 1); |
f701aae0 EN |
610 | for (i = 0; i < df_sorted_entries.nr; i++) { |
611 | const char *path = df_sorted_entries.items[i].string; | |
ef02b317 | 612 | int len = strlen(path); |
f701aae0 | 613 | struct stage_data *e = df_sorted_entries.items[i].util; |
ef02b317 EN |
614 | |
615 | /* | |
616 | * Check if last_file & path correspond to a D/F conflict; | |
617 | * i.e. whether path is last_file+'/'+<something>. | |
70cc3d36 EN |
618 | * If so, record that it's okay to remove last_file to make |
619 | * room for path and friends if needed. | |
ef02b317 EN |
620 | */ |
621 | if (last_file && | |
622 | len > last_len && | |
623 | memcmp(path, last_file, last_len) == 0 && | |
624 | path[last_len] == '/') { | |
5bf7e577 | 625 | string_list_insert(&opt->priv->df_conflict_file_set, last_file); |
ef02b317 EN |
626 | } |
627 | ||
628 | /* | |
629 | * Determine whether path could exist as a file in the | |
630 | * working directory as a possible D/F conflict. This | |
631 | * will only occur when it exists in stage 2 as a | |
632 | * file. | |
633 | */ | |
634 | if (S_ISREG(e->stages[2].mode) || S_ISLNK(e->stages[2].mode)) { | |
635 | last_file = path; | |
636 | last_len = len; | |
ef02b317 EN |
637 | } else { |
638 | last_file = NULL; | |
639 | } | |
640 | } | |
f701aae0 | 641 | string_list_clear(&df_sorted_entries, 0); |
ef02b317 EN |
642 | } |
643 | ||
bc9204d4 JS |
644 | static int update_stages(struct merge_options *opt, const char *path, |
645 | const struct diff_filespec *o, | |
650467cf EN |
646 | const struct diff_filespec *a, |
647 | const struct diff_filespec *b) | |
9047ebbc | 648 | { |
f53d3977 EN |
649 | |
650 | /* | |
651 | * NOTE: It is usually a bad idea to call update_stages on a path | |
652 | * before calling update_file on that same path, since it can | |
653 | * sometimes lead to spurious "refusing to lose untracked file..." | |
654 | * messages from update_file (via make_room_for path via | |
655 | * would_lose_untracked). Instead, reverse the order of the calls | |
656 | * (executing update_file first and then update_stages). | |
657 | */ | |
650467cf EN |
658 | int clear = 1; |
659 | int options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_SKIP_DFCHECK; | |
9047ebbc | 660 | if (clear) |
0d6caa2d | 661 | if (remove_file_from_index(opt->repo->index, path)) |
9047ebbc MV |
662 | return -1; |
663 | if (o) | |
8daec1df | 664 | if (add_cacheinfo(opt, o, path, 1, 0, options)) |
9047ebbc MV |
665 | return -1; |
666 | if (a) | |
8daec1df | 667 | if (add_cacheinfo(opt, a, path, 2, 0, options)) |
9047ebbc MV |
668 | return -1; |
669 | if (b) | |
8daec1df | 670 | if (add_cacheinfo(opt, b, path, 3, 0, options)) |
9047ebbc MV |
671 | return -1; |
672 | return 0; | |
673 | } | |
674 | ||
b8ddf164 EN |
675 | static void update_entry(struct stage_data *entry, |
676 | struct diff_filespec *o, | |
677 | struct diff_filespec *a, | |
678 | struct diff_filespec *b) | |
2ff739f9 | 679 | { |
2ff739f9 EN |
680 | entry->processed = 0; |
681 | entry->stages[1].mode = o->mode; | |
682 | entry->stages[2].mode = a->mode; | |
683 | entry->stages[3].mode = b->mode; | |
fd429e98 | 684 | oidcpy(&entry->stages[1].oid, &o->oid); |
685 | oidcpy(&entry->stages[2].oid, &a->oid); | |
686 | oidcpy(&entry->stages[3].oid, &b->oid); | |
2ff739f9 EN |
687 | } |
688 | ||
259ccb6c | 689 | static int remove_file(struct merge_options *opt, int clean, |
b7fa51da | 690 | const char *path, int no_wd) |
9047ebbc | 691 | { |
5bf7e577 EN |
692 | int update_cache = opt->priv->call_depth || clean; |
693 | int update_working_directory = !opt->priv->call_depth && !no_wd; | |
9047ebbc MV |
694 | |
695 | if (update_cache) { | |
259ccb6c | 696 | if (remove_file_from_index(opt->repo->index, path)) |
9047ebbc MV |
697 | return -1; |
698 | } | |
699 | if (update_working_directory) { | |
ae352c7f DT |
700 | if (ignore_case) { |
701 | struct cache_entry *ce; | |
259ccb6c | 702 | ce = index_file_exists(opt->repo->index, path, strlen(path), |
0d6caa2d | 703 | ignore_case); |
4cba2b01 | 704 | if (ce && ce_stage(ce) == 0 && strcmp(path, ce->name)) |
ae352c7f DT |
705 | return 0; |
706 | } | |
25755e84 | 707 | if (remove_path(path)) |
9047ebbc | 708 | return -1; |
9047ebbc MV |
709 | } |
710 | return 0; | |
711 | } | |
712 | ||
45bc131d JK |
713 | /* add a string to a strbuf, but converting "/" to "_" */ |
714 | static void add_flattened_path(struct strbuf *out, const char *s) | |
715 | { | |
716 | size_t i = out->len; | |
717 | strbuf_addstr(out, s); | |
718 | for (; i < out->len; i++) | |
719 | if (out->buf[i] == '/') | |
720 | out->buf[i] = '_'; | |
721 | } | |
722 | ||
4d7101e2 EN |
723 | static char *unique_path(struct merge_options *opt, |
724 | const char *path, | |
725 | const char *branch) | |
9047ebbc | 726 | { |
fc65b00d | 727 | struct path_hashmap_entry *entry; |
45bc131d | 728 | struct strbuf newpath = STRBUF_INIT; |
9047ebbc | 729 | int suffix = 0; |
45bc131d JK |
730 | size_t base_len; |
731 | ||
732 | strbuf_addf(&newpath, "%s~", path); | |
733 | add_flattened_path(&newpath, branch); | |
734 | ||
735 | base_len = newpath.len; | |
5bf7e577 | 736 | while (hashmap_get_from_hash(&opt->priv->current_file_dir_set, |
fc65b00d | 737 | path_hash(newpath.buf), newpath.buf) || |
5bf7e577 | 738 | (!opt->priv->call_depth && file_exists(newpath.buf))) { |
45bc131d JK |
739 | strbuf_setlen(&newpath, base_len); |
740 | strbuf_addf(&newpath, "_%d", suffix++); | |
741 | } | |
742 | ||
fc65b00d | 743 | FLEX_ALLOC_MEM(entry, path, newpath.buf, newpath.len); |
d22245a2 | 744 | hashmap_entry_init(&entry->e, path_hash(entry->path)); |
5efabc7e | 745 | hashmap_add(&opt->priv->current_file_dir_set, &entry->e); |
45bc131d | 746 | return strbuf_detach(&newpath, NULL); |
9047ebbc MV |
747 | } |
748 | ||
5423d2e7 DT |
749 | /** |
750 | * Check whether a directory in the index is in the way of an incoming | |
751 | * file. Return 1 if so. If check_working_copy is non-zero, also | |
752 | * check the working directory. If empty_ok is non-zero, also return | |
753 | * 0 in the case where the working-tree dir exists but is empty. | |
754 | */ | |
0d6caa2d NTND |
755 | static int dir_in_way(struct index_state *istate, const char *path, |
756 | int check_working_copy, int empty_ok) | |
f2507b4e | 757 | { |
b4600fbe JK |
758 | int pos; |
759 | struct strbuf dirpath = STRBUF_INIT; | |
f2507b4e EN |
760 | struct stat st; |
761 | ||
b4600fbe JK |
762 | strbuf_addstr(&dirpath, path); |
763 | strbuf_addch(&dirpath, '/'); | |
f2507b4e | 764 | |
0d6caa2d | 765 | pos = index_name_pos(istate, dirpath.buf, dirpath.len); |
f2507b4e EN |
766 | |
767 | if (pos < 0) | |
768 | pos = -1 - pos; | |
0d6caa2d NTND |
769 | if (pos < istate->cache_nr && |
770 | !strncmp(dirpath.buf, istate->cache[pos]->name, dirpath.len)) { | |
b4600fbe | 771 | strbuf_release(&dirpath); |
f2507b4e EN |
772 | return 1; |
773 | } | |
774 | ||
b4600fbe | 775 | strbuf_release(&dirpath); |
5423d2e7 | 776 | return check_working_copy && !lstat(path, &st) && S_ISDIR(st.st_mode) && |
83e3ad3b JT |
777 | !(empty_ok && is_empty_dir(path)) && |
778 | !has_symlink_leading_path(path, strlen(path)); | |
f2507b4e EN |
779 | } |
780 | ||
1de70dbd EN |
781 | /* |
782 | * Returns whether path was tracked in the index before the merge started, | |
783 | * and its oid and mode match the specified values | |
784 | */ | |
259ccb6c | 785 | static int was_tracked_and_matches(struct merge_options *opt, const char *path, |
8daec1df | 786 | const struct diff_filespec *blob) |
60c91181 | 787 | { |
5bf7e577 | 788 | int pos = index_name_pos(&opt->priv->orig_index, path, strlen(path)); |
1de70dbd EN |
789 | struct cache_entry *ce; |
790 | ||
791 | if (0 > pos) | |
792 | /* we were not tracking this path before the merge */ | |
793 | return 0; | |
794 | ||
795 | /* See if the file we were tracking before matches */ | |
5bf7e577 | 796 | ce = opt->priv->orig_index.cache[pos]; |
763a59e7 | 797 | return (oideq(&ce->oid, &blob->oid) && ce->ce_mode == blob->mode); |
1de70dbd EN |
798 | } |
799 | ||
a35edc84 EN |
800 | /* |
801 | * Returns whether path was tracked in the index before the merge started | |
802 | */ | |
259ccb6c | 803 | static int was_tracked(struct merge_options *opt, const char *path) |
60c91181 | 804 | { |
5bf7e577 | 805 | int pos = index_name_pos(&opt->priv->orig_index, path, strlen(path)); |
60c91181 | 806 | |
f8d83fb6 | 807 | if (0 <= pos) |
a35edc84 | 808 | /* we were tracking this path before the merge */ |
f8d83fb6 JS |
809 | return 1; |
810 | ||
aacb82de | 811 | return 0; |
60c91181 JH |
812 | } |
813 | ||
259ccb6c | 814 | static int would_lose_untracked(struct merge_options *opt, const char *path) |
9047ebbc | 815 | { |
259ccb6c | 816 | struct index_state *istate = opt->repo->index; |
0d6caa2d | 817 | |
a35edc84 EN |
818 | /* |
819 | * This may look like it can be simplified to: | |
259ccb6c | 820 | * return !was_tracked(opt, path) && file_exists(path) |
a35edc84 EN |
821 | * but it can't. This function needs to know whether path was in |
822 | * the working tree due to EITHER having been tracked in the index | |
823 | * before the merge OR having been put into the working copy and | |
824 | * index by unpack_trees(). Due to that either-or requirement, we | |
825 | * check the current index instead of the original one. | |
826 | * | |
827 | * Note that we do not need to worry about merge-recursive itself | |
828 | * updating the index after unpack_trees() and before calling this | |
829 | * function, because we strictly require all code paths in | |
830 | * merge-recursive to update the working tree first and the index | |
831 | * second. Doing otherwise would break | |
832 | * update_file()/would_lose_untracked(); see every comment in this | |
833 | * file which mentions "update_stages". | |
834 | */ | |
0d6caa2d | 835 | int pos = index_name_pos(istate, path, strlen(path)); |
a35edc84 EN |
836 | |
837 | if (pos < 0) | |
838 | pos = -1 - pos; | |
0d6caa2d NTND |
839 | while (pos < istate->cache_nr && |
840 | !strcmp(path, istate->cache[pos]->name)) { | |
a35edc84 EN |
841 | /* |
842 | * If stage #0, it is definitely tracked. | |
843 | * If it has stage #2 then it was tracked | |
844 | * before this merge started. All other | |
845 | * cases the path was not tracked. | |
846 | */ | |
0d6caa2d | 847 | switch (ce_stage(istate->cache[pos])) { |
a35edc84 EN |
848 | case 0: |
849 | case 2: | |
850 | return 0; | |
851 | } | |
852 | pos++; | |
853 | } | |
854 | return file_exists(path); | |
60c91181 JH |
855 | } |
856 | ||
259ccb6c | 857 | static int was_dirty(struct merge_options *opt, const char *path) |
64b1abe9 EN |
858 | { |
859 | struct cache_entry *ce; | |
860 | int dirty = 1; | |
861 | ||
5bf7e577 | 862 | if (opt->priv->call_depth || !was_tracked(opt, path)) |
64b1abe9 EN |
863 | return !dirty; |
864 | ||
5bf7e577 | 865 | ce = index_file_exists(opt->priv->unpack_opts.src_index, |
277292d5 | 866 | path, strlen(path), ignore_case); |
5bf7e577 | 867 | dirty = verify_uptodate(ce, &opt->priv->unpack_opts) != 0; |
64b1abe9 | 868 | return dirty; |
60c91181 JH |
869 | } |
870 | ||
259ccb6c | 871 | static int make_room_for_path(struct merge_options *opt, const char *path) |
9047ebbc | 872 | { |
ed0148a5 | 873 | int status, i; |
55653a68 | 874 | const char *msg = _("failed to create path '%s'%s"); |
9047ebbc | 875 | |
ed0148a5 | 876 | /* Unlink any D/F conflict files that are in the way */ |
5bf7e577 EN |
877 | for (i = 0; i < opt->priv->df_conflict_file_set.nr; i++) { |
878 | const char *df_path = opt->priv->df_conflict_file_set.items[i].string; | |
ed0148a5 EN |
879 | size_t pathlen = strlen(path); |
880 | size_t df_pathlen = strlen(df_path); | |
881 | if (df_pathlen < pathlen && | |
882 | path[df_pathlen] == '/' && | |
883 | strncmp(path, df_path, df_pathlen) == 0) { | |
259ccb6c | 884 | output(opt, 3, |
55653a68 | 885 | _("Removing %s to make room for subdirectory\n"), |
ed0148a5 EN |
886 | df_path); |
887 | unlink(df_path); | |
5bf7e577 | 888 | unsorted_string_list_delete_item(&opt->priv->df_conflict_file_set, |
ed0148a5 EN |
889 | i, 0); |
890 | break; | |
891 | } | |
892 | } | |
893 | ||
894 | /* Make sure leading directories are created */ | |
9047ebbc MV |
895 | status = safe_create_leading_directories_const(path); |
896 | if (status) { | |
6003303a | 897 | if (status == SCLD_EXISTS) |
9047ebbc | 898 | /* something else exists */ |
259ccb6c EN |
899 | return err(opt, msg, path, _(": perhaps a D/F conflict?")); |
900 | return err(opt, msg, path, ""); | |
9047ebbc MV |
901 | } |
902 | ||
60c91181 JH |
903 | /* |
904 | * Do not unlink a file in the work tree if we are not | |
905 | * tracking it. | |
906 | */ | |
259ccb6c EN |
907 | if (would_lose_untracked(opt, path)) |
908 | return err(opt, _("refusing to lose untracked file at '%s'"), | |
d90e759f | 909 | path); |
60c91181 | 910 | |
9047ebbc MV |
911 | /* Successful unlink is good.. */ |
912 | if (!unlink(path)) | |
913 | return 0; | |
914 | /* .. and so is no existing file */ | |
915 | if (errno == ENOENT) | |
916 | return 0; | |
917 | /* .. but not some other error (who really cares what?) */ | |
259ccb6c | 918 | return err(opt, msg, path, _(": perhaps a D/F conflict?")); |
9047ebbc MV |
919 | } |
920 | ||
259ccb6c | 921 | static int update_file_flags(struct merge_options *opt, |
8daec1df | 922 | const struct diff_filespec *contents, |
75456f96 JS |
923 | const char *path, |
924 | int update_cache, | |
925 | int update_wd) | |
9047ebbc | 926 | { |
6003303a JS |
927 | int ret = 0; |
928 | ||
5bf7e577 | 929 | if (opt->priv->call_depth) |
9047ebbc MV |
930 | update_wd = 0; |
931 | ||
932 | if (update_wd) { | |
933 | enum object_type type; | |
934 | void *buf; | |
935 | unsigned long size; | |
936 | ||
8daec1df | 937 | if (S_ISGITLINK(contents->mode)) { |
0c44c943 JH |
938 | /* |
939 | * We may later decide to recursively descend into | |
940 | * the submodule directory and update its index | |
941 | * and/or work tree, but we do not do that now. | |
942 | */ | |
68d03e4a | 943 | update_wd = 0; |
0c44c943 | 944 | goto update_index; |
68d03e4a | 945 | } |
9047ebbc | 946 | |
8daec1df | 947 | buf = read_object_file(&contents->oid, &type, &size); |
f836bf39 EN |
948 | if (!buf) { |
949 | ret = err(opt, _("cannot read object %s '%s'"), | |
950 | oid_to_hex(&contents->oid), path); | |
951 | goto free_buf; | |
952 | } | |
6003303a | 953 | if (type != OBJ_BLOB) { |
8daec1df EN |
954 | ret = err(opt, _("blob expected for %s '%s'"), |
955 | oid_to_hex(&contents->oid), path); | |
6003303a JS |
956 | goto free_buf; |
957 | } | |
8daec1df | 958 | if (S_ISREG(contents->mode)) { |
f285a2d7 | 959 | struct strbuf strbuf = STRBUF_INIT; |
4d7101e2 EN |
960 | if (convert_to_working_tree(opt->repo->index, |
961 | path, buf, size, &strbuf)) { | |
9047ebbc MV |
962 | free(buf); |
963 | size = strbuf.len; | |
964 | buf = strbuf_detach(&strbuf, NULL); | |
965 | } | |
966 | } | |
967 | ||
259ccb6c | 968 | if (make_room_for_path(opt, path) < 0) { |
9047ebbc | 969 | update_wd = 0; |
75456f96 | 970 | goto free_buf; |
9047ebbc | 971 | } |
8daec1df EN |
972 | if (S_ISREG(contents->mode) || |
973 | (!has_symlinks && S_ISLNK(contents->mode))) { | |
9047ebbc | 974 | int fd; |
8daec1df EN |
975 | int mode = (contents->mode & 0100 ? 0777 : 0666); |
976 | ||
9047ebbc | 977 | fd = open(path, O_WRONLY | O_TRUNC | O_CREAT, mode); |
6003303a | 978 | if (fd < 0) { |
259ccb6c | 979 | ret = err(opt, _("failed to open '%s': %s"), |
bc9204d4 | 980 | path, strerror(errno)); |
6003303a JS |
981 | goto free_buf; |
982 | } | |
f633ea2c | 983 | write_in_full(fd, buf, size); |
9047ebbc | 984 | close(fd); |
8daec1df | 985 | } else if (S_ISLNK(contents->mode)) { |
9047ebbc MV |
986 | char *lnk = xmemdupz(buf, size); |
987 | safe_create_leading_directories_const(path); | |
988 | unlink(path); | |
304dcf26 | 989 | if (symlink(lnk, path)) |
259ccb6c | 990 | ret = err(opt, _("failed to symlink '%s': %s"), |
d90e759f | 991 | path, strerror(errno)); |
9047ebbc MV |
992 | free(lnk); |
993 | } else | |
259ccb6c | 994 | ret = err(opt, |
bc9204d4 | 995 | _("do not know what to do with %06o %s '%s'"), |
8daec1df | 996 | contents->mode, oid_to_hex(&contents->oid), path); |
93665365 | 997 | free_buf: |
9047ebbc MV |
998 | free(buf); |
999 | } | |
93665365 | 1000 | update_index: |
fb1c18fc EN |
1001 | if (!ret && update_cache) { |
1002 | int refresh = (!opt->priv->call_depth && | |
1003 | contents->mode != S_IFGITLINK); | |
1004 | if (add_cacheinfo(opt, contents, path, 0, refresh, | |
fd53b7ff EN |
1005 | ADD_CACHE_OK_TO_ADD)) |
1006 | return -1; | |
fb1c18fc | 1007 | } |
6003303a | 1008 | return ret; |
9047ebbc MV |
1009 | } |
1010 | ||
259ccb6c | 1011 | static int update_file(struct merge_options *opt, |
75456f96 | 1012 | int clean, |
8daec1df | 1013 | const struct diff_filespec *contents, |
75456f96 | 1014 | const char *path) |
9047ebbc | 1015 | { |
8daec1df | 1016 | return update_file_flags(opt, contents, path, |
5bf7e577 | 1017 | opt->priv->call_depth || clean, !opt->priv->call_depth); |
9047ebbc MV |
1018 | } |
1019 | ||
1020 | /* Low level file merging, update and removal */ | |
1021 | ||
9cba13ca | 1022 | struct merge_file_info { |
8daec1df | 1023 | struct diff_filespec blob; /* mostly use oid & mode; sometimes path */ |
9047ebbc MV |
1024 | unsigned clean:1, |
1025 | merge:1; | |
1026 | }; | |
1027 | ||
259ccb6c | 1028 | static int merge_3way(struct merge_options *opt, |
b7fa51da | 1029 | mmbuffer_t *result_buf, |
e3de888c | 1030 | const struct diff_filespec *o, |
0c059420 EN |
1031 | const struct diff_filespec *a, |
1032 | const struct diff_filespec *b, | |
9047ebbc | 1033 | const char *branch1, |
b2a7942b EN |
1034 | const char *branch2, |
1035 | const int extra_marker_size) | |
9047ebbc MV |
1036 | { |
1037 | mmfile_t orig, src1, src2; | |
712516bc | 1038 | struct ll_merge_options ll_opts = {0}; |
139ef37a | 1039 | char *base, *name1, *name2; |
9047ebbc | 1040 | int merge_status; |
8cc5b290 | 1041 | |
259ccb6c | 1042 | ll_opts.renormalize = opt->renormalize; |
b2a7942b | 1043 | ll_opts.extra_marker_size = extra_marker_size; |
259ccb6c | 1044 | ll_opts.xdl_opts = opt->xdl_opts; |
712516bc | 1045 | |
5bf7e577 | 1046 | if (opt->priv->call_depth) { |
712516bc JN |
1047 | ll_opts.virtual_ancestor = 1; |
1048 | ll_opts.variant = 0; | |
1049 | } else { | |
259ccb6c | 1050 | switch (opt->recursive_variant) { |
f3081dae | 1051 | case MERGE_VARIANT_OURS: |
712516bc | 1052 | ll_opts.variant = XDL_MERGE_FAVOR_OURS; |
8cc5b290 | 1053 | break; |
f3081dae | 1054 | case MERGE_VARIANT_THEIRS: |
712516bc | 1055 | ll_opts.variant = XDL_MERGE_FAVOR_THEIRS; |
8cc5b290 AP |
1056 | break; |
1057 | default: | |
712516bc | 1058 | ll_opts.variant = 0; |
8cc5b290 AP |
1059 | break; |
1060 | } | |
1061 | } | |
9047ebbc | 1062 | |
139ef37a EN |
1063 | assert(a->path && b->path && o->path && opt->ancestor); |
1064 | if (strcmp(a->path, b->path) || strcmp(a->path, o->path) != 0) { | |
1065 | base = mkpathdup("%s:%s", opt->ancestor, o->path); | |
4e2d094d RJ |
1066 | name1 = mkpathdup("%s:%s", branch1, a->path); |
1067 | name2 = mkpathdup("%s:%s", branch2, b->path); | |
606475f3 | 1068 | } else { |
139ef37a | 1069 | base = mkpathdup("%s", opt->ancestor); |
4e2d094d RJ |
1070 | name1 = mkpathdup("%s", branch1); |
1071 | name2 = mkpathdup("%s", branch2); | |
606475f3 | 1072 | } |
9047ebbc | 1073 | |
e3de888c | 1074 | read_mmblob(&orig, &o->oid); |
d449347d | 1075 | read_mmblob(&src1, &a->oid); |
1076 | read_mmblob(&src2, &b->oid); | |
9047ebbc | 1077 | |
139ef37a | 1078 | merge_status = ll_merge(result_buf, a->path, &orig, base, |
32eaa468 | 1079 | &src1, name1, &src2, name2, |
259ccb6c | 1080 | opt->repo->index, &ll_opts); |
9047ebbc | 1081 | |
139ef37a | 1082 | free(base); |
9047ebbc MV |
1083 | free(name1); |
1084 | free(name2); | |
1085 | free(orig.ptr); | |
1086 | free(src1.ptr); | |
1087 | free(src2.ptr); | |
1088 | return merge_status; | |
1089 | } | |
1090 | ||
0d6caa2d NTND |
1091 | static int find_first_merges(struct repository *repo, |
1092 | struct object_array *result, const char *path, | |
d90e759f | 1093 | struct commit *a, struct commit *b) |
18cfc088 SB |
1094 | { |
1095 | int i, j; | |
1096 | struct object_array merges = OBJECT_ARRAY_INIT; | |
1097 | struct commit *commit; | |
1098 | int contains_another; | |
1099 | ||
db1ba2a2 | 1100 | char merged_revision[GIT_MAX_HEXSZ + 2]; |
18cfc088 SB |
1101 | const char *rev_args[] = { "rev-list", "--merges", "--ancestry-path", |
1102 | "--all", merged_revision, NULL }; | |
1103 | struct rev_info revs; | |
1104 | struct setup_revision_opt rev_opts; | |
1105 | ||
1106 | memset(result, 0, sizeof(struct object_array)); | |
1107 | memset(&rev_opts, 0, sizeof(rev_opts)); | |
1108 | ||
1109 | /* get all revisions that merge commit a */ | |
1110 | xsnprintf(merged_revision, sizeof(merged_revision), "^%s", | |
d90e759f | 1111 | oid_to_hex(&a->object.oid)); |
0d6caa2d | 1112 | repo_init_revisions(repo, &revs, NULL); |
18cfc088 SB |
1113 | rev_opts.submodule = path; |
1114 | /* FIXME: can't handle linked worktrees in submodules yet */ | |
1115 | revs.single_worktree = path != NULL; | |
1116 | setup_revisions(ARRAY_SIZE(rev_args)-1, rev_args, &revs, &rev_opts); | |
1117 | ||
1118 | /* save all revisions from the above list that contain b */ | |
1119 | if (prepare_revision_walk(&revs)) | |
1120 | die("revision walk setup failed"); | |
1121 | while ((commit = get_revision(&revs)) != NULL) { | |
1122 | struct object *o = &(commit->object); | |
1123 | if (in_merge_bases(b, commit)) | |
1124 | add_object_array(o, NULL, &merges); | |
1125 | } | |
1126 | reset_revision_walk(); | |
1127 | ||
1128 | /* Now we've got all merges that contain a and b. Prune all | |
1129 | * merges that contain another found merge and save them in | |
1130 | * result. | |
1131 | */ | |
1132 | for (i = 0; i < merges.nr; i++) { | |
1133 | struct commit *m1 = (struct commit *) merges.objects[i].item; | |
1134 | ||
1135 | contains_another = 0; | |
1136 | for (j = 0; j < merges.nr; j++) { | |
1137 | struct commit *m2 = (struct commit *) merges.objects[j].item; | |
1138 | if (i != j && in_merge_bases(m2, m1)) { | |
1139 | contains_another = 1; | |
1140 | break; | |
1141 | } | |
1142 | } | |
1143 | ||
1144 | if (!contains_another) | |
1145 | add_object_array(merges.objects[i].item, NULL, result); | |
1146 | } | |
1147 | ||
1148 | object_array_clear(&merges); | |
1149 | return result->nr; | |
1150 | } | |
1151 | ||
1152 | static void print_commit(struct commit *commit) | |
1153 | { | |
1154 | struct strbuf sb = STRBUF_INIT; | |
1155 | struct pretty_print_context ctx = {0}; | |
1156 | ctx.date_mode.type = DATE_NORMAL; | |
1157 | format_commit_message(commit, " %h: %m %s", &sb, &ctx); | |
1158 | fprintf(stderr, "%s\n", sb.buf); | |
1159 | strbuf_release(&sb); | |
1160 | } | |
1161 | ||
8daec1df EN |
1162 | static int is_valid(const struct diff_filespec *dfs) |
1163 | { | |
1164 | return dfs->mode != 0 && !is_null_oid(&dfs->oid); | |
1165 | } | |
1166 | ||
259ccb6c | 1167 | static int merge_submodule(struct merge_options *opt, |
325f3a8e | 1168 | struct object_id *result, const char *path, |
18cfc088 | 1169 | const struct object_id *base, const struct object_id *a, |
325f3a8e | 1170 | const struct object_id *b) |
18cfc088 SB |
1171 | { |
1172 | struct commit *commit_base, *commit_a, *commit_b; | |
1173 | int parent_count; | |
1174 | struct object_array merges; | |
1175 | ||
1176 | int i; | |
5bf7e577 | 1177 | int search = !opt->priv->call_depth; |
18cfc088 SB |
1178 | |
1179 | /* store a in result in case we fail */ | |
1180 | oidcpy(result, a); | |
1181 | ||
1182 | /* we can not handle deletion conflicts */ | |
1183 | if (is_null_oid(base)) | |
1184 | return 0; | |
1185 | if (is_null_oid(a)) | |
1186 | return 0; | |
1187 | if (is_null_oid(b)) | |
1188 | return 0; | |
1189 | ||
1190 | if (add_submodule_odb(path)) { | |
259ccb6c | 1191 | output(opt, 1, _("Failed to merge submodule %s (not checked out)"), path); |
18cfc088 SB |
1192 | return 0; |
1193 | } | |
1194 | ||
259ccb6c EN |
1195 | if (!(commit_base = lookup_commit_reference(opt->repo, base)) || |
1196 | !(commit_a = lookup_commit_reference(opt->repo, a)) || | |
1197 | !(commit_b = lookup_commit_reference(opt->repo, b))) { | |
1198 | output(opt, 1, _("Failed to merge submodule %s (commits not present)"), path); | |
18cfc088 SB |
1199 | return 0; |
1200 | } | |
1201 | ||
1202 | /* check whether both changes are forward */ | |
1203 | if (!in_merge_bases(commit_base, commit_a) || | |
1204 | !in_merge_bases(commit_base, commit_b)) { | |
259ccb6c | 1205 | output(opt, 1, _("Failed to merge submodule %s (commits don't follow merge-base)"), path); |
18cfc088 SB |
1206 | return 0; |
1207 | } | |
1208 | ||
1209 | /* Case #1: a is contained in b or vice versa */ | |
1210 | if (in_merge_bases(commit_a, commit_b)) { | |
1211 | oidcpy(result, b); | |
259ccb6c EN |
1212 | if (show(opt, 3)) { |
1213 | output(opt, 3, _("Fast-forwarding submodule %s to the following commit:"), path); | |
1214 | output_commit_title(opt, commit_b); | |
1215 | } else if (show(opt, 2)) | |
1216 | output(opt, 2, _("Fast-forwarding submodule %s"), path); | |
76f42125 LM |
1217 | else |
1218 | ; /* no output */ | |
1219 | ||
18cfc088 SB |
1220 | return 1; |
1221 | } | |
1222 | if (in_merge_bases(commit_b, commit_a)) { | |
1223 | oidcpy(result, a); | |
259ccb6c EN |
1224 | if (show(opt, 3)) { |
1225 | output(opt, 3, _("Fast-forwarding submodule %s to the following commit:"), path); | |
1226 | output_commit_title(opt, commit_a); | |
1227 | } else if (show(opt, 2)) | |
1228 | output(opt, 2, _("Fast-forwarding submodule %s"), path); | |
76f42125 LM |
1229 | else |
1230 | ; /* no output */ | |
1231 | ||
18cfc088 SB |
1232 | return 1; |
1233 | } | |
1234 | ||
1235 | /* | |
1236 | * Case #2: There are one or more merges that contain a and b in | |
1237 | * the submodule. If there is only one, then present it as a | |
1238 | * suggestion to the user, but leave it marked unmerged so the | |
1239 | * user needs to confirm the resolution. | |
1240 | */ | |
1241 | ||
1242 | /* Skip the search if makes no sense to the calling context. */ | |
1243 | if (!search) | |
1244 | return 0; | |
1245 | ||
1246 | /* find commit which merges them */ | |
259ccb6c | 1247 | parent_count = find_first_merges(opt->repo, &merges, path, |
0d6caa2d | 1248 | commit_a, commit_b); |
18cfc088 SB |
1249 | switch (parent_count) { |
1250 | case 0: | |
259ccb6c | 1251 | output(opt, 1, _("Failed to merge submodule %s (merge following commits not found)"), path); |
18cfc088 SB |
1252 | break; |
1253 | ||
1254 | case 1: | |
259ccb6c EN |
1255 | output(opt, 1, _("Failed to merge submodule %s (not fast-forward)"), path); |
1256 | output(opt, 2, _("Found a possible merge resolution for the submodule:\n")); | |
18cfc088 | 1257 | print_commit((struct commit *) merges.objects[0].item); |
259ccb6c | 1258 | output(opt, 2, _( |
d90e759f EN |
1259 | "If this is correct simply add it to the index " |
1260 | "for example\n" | |
1261 | "by using:\n\n" | |
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); | |
18cfc088 SB |
1265 | break; |
1266 | ||
1267 | default: | |
259ccb6c | 1268 | output(opt, 1, _("Failed to merge submodule %s (multiple merges found)"), path); |
18cfc088 SB |
1269 | for (i = 0; i < merges.nr; i++) |
1270 | print_commit((struct commit *) merges.objects[i].item); | |
1271 | } | |
1272 | ||
1273 | object_array_clear(&merges); | |
1274 | return 0; | |
1275 | } | |
1276 | ||
259ccb6c | 1277 | static int merge_mode_and_contents(struct merge_options *opt, |
e3de888c | 1278 | const struct diff_filespec *o, |
d9573556 EN |
1279 | const struct diff_filespec *a, |
1280 | const struct diff_filespec *b, | |
1281 | const char *filename, | |
1282 | const char *branch1, | |
1283 | const char *branch2, | |
b2a7942b | 1284 | const int extra_marker_size, |
d9573556 | 1285 | struct merge_file_info *result) |
9047ebbc | 1286 | { |
259ccb6c | 1287 | if (opt->branch1 != branch1) { |
4f445453 EN |
1288 | /* |
1289 | * It's weird getting a reverse merge with HEAD on the bottom | |
1290 | * side of the conflict markers and the other branch on the | |
1291 | * top. Fix that. | |
1292 | */ | |
e3de888c | 1293 | return merge_mode_and_contents(opt, o, b, a, |
4f445453 | 1294 | filename, |
b2a7942b EN |
1295 | branch2, branch1, |
1296 | extra_marker_size, result); | |
4f445453 EN |
1297 | } |
1298 | ||
3c8a51e8 JS |
1299 | result->merge = 0; |
1300 | result->clean = 1; | |
9047ebbc MV |
1301 | |
1302 | if ((S_IFMT & a->mode) != (S_IFMT & b->mode)) { | |
3c8a51e8 | 1303 | result->clean = 0; |
9047ebbc | 1304 | if (S_ISREG(a->mode)) { |
8daec1df EN |
1305 | result->blob.mode = a->mode; |
1306 | oidcpy(&result->blob.oid, &a->oid); | |
9047ebbc | 1307 | } else { |
8daec1df EN |
1308 | result->blob.mode = b->mode; |
1309 | oidcpy(&result->blob.oid, &b->oid); | |
9047ebbc MV |
1310 | } |
1311 | } else { | |
763a59e7 | 1312 | if (!oideq(&a->oid, &o->oid) && !oideq(&b->oid, &o->oid)) |
3c8a51e8 | 1313 | result->merge = 1; |
9047ebbc MV |
1314 | |
1315 | /* | |
1316 | * Merge modes | |
1317 | */ | |
e3de888c | 1318 | if (a->mode == b->mode || a->mode == o->mode) |
8daec1df | 1319 | result->blob.mode = b->mode; |
9047ebbc | 1320 | else { |
8daec1df | 1321 | result->blob.mode = a->mode; |
e3de888c | 1322 | if (b->mode != o->mode) { |
3c8a51e8 JS |
1323 | result->clean = 0; |
1324 | result->merge = 1; | |
9047ebbc MV |
1325 | } |
1326 | } | |
1327 | ||
763a59e7 | 1328 | if (oideq(&a->oid, &b->oid) || oideq(&a->oid, &o->oid)) |
8daec1df | 1329 | oidcpy(&result->blob.oid, &b->oid); |
763a59e7 | 1330 | else if (oideq(&b->oid, &o->oid)) |
8daec1df | 1331 | oidcpy(&result->blob.oid, &a->oid); |
9047ebbc MV |
1332 | else if (S_ISREG(a->mode)) { |
1333 | mmbuffer_t result_buf; | |
6003303a | 1334 | int ret = 0, merge_status; |
9047ebbc | 1335 | |
e3de888c | 1336 | merge_status = merge_3way(opt, &result_buf, o, a, b, |
b2a7942b EN |
1337 | branch1, branch2, |
1338 | extra_marker_size); | |
9047ebbc MV |
1339 | |
1340 | if ((merge_status < 0) || !result_buf.ptr) | |
259ccb6c | 1341 | ret = err(opt, _("Failed to execute internal merge")); |
9047ebbc | 1342 | |
a09c985e PO |
1343 | if (!ret && |
1344 | write_object_file(result_buf.ptr, result_buf.size, | |
8daec1df | 1345 | blob_type, &result->blob.oid)) |
259ccb6c | 1346 | ret = err(opt, _("Unable to add %s to database"), |
bc9204d4 | 1347 | a->path); |
9047ebbc MV |
1348 | |
1349 | free(result_buf.ptr); | |
6003303a JS |
1350 | if (ret) |
1351 | return ret; | |
3c8a51e8 | 1352 | result->clean = (merge_status == 0); |
9047ebbc | 1353 | } else if (S_ISGITLINK(a->mode)) { |
8daec1df | 1354 | result->clean = merge_submodule(opt, &result->blob.oid, |
e3de888c EN |
1355 | o->path, |
1356 | &o->oid, | |
d90e759f EN |
1357 | &a->oid, |
1358 | &b->oid); | |
9047ebbc | 1359 | } else if (S_ISLNK(a->mode)) { |
259ccb6c | 1360 | switch (opt->recursive_variant) { |
f3081dae | 1361 | case MERGE_VARIANT_NORMAL: |
8daec1df | 1362 | oidcpy(&result->blob.oid, &a->oid); |
763a59e7 | 1363 | if (!oideq(&a->oid, &b->oid)) |
fd48b464 JH |
1364 | result->clean = 0; |
1365 | break; | |
f3081dae | 1366 | case MERGE_VARIANT_OURS: |
8daec1df | 1367 | oidcpy(&result->blob.oid, &a->oid); |
fd48b464 | 1368 | break; |
f3081dae | 1369 | case MERGE_VARIANT_THEIRS: |
8daec1df | 1370 | oidcpy(&result->blob.oid, &b->oid); |
fd48b464 JH |
1371 | break; |
1372 | } | |
ef1177d1 | 1373 | } else |
033abf97 | 1374 | BUG("unsupported object type in the tree"); |
9047ebbc MV |
1375 | } |
1376 | ||
05cf21eb | 1377 | if (result->merge) |
259ccb6c | 1378 | output(opt, 2, _("Auto-merging %s"), filename); |
05cf21eb | 1379 | |
3c8a51e8 | 1380 | return 0; |
9047ebbc MV |
1381 | } |
1382 | ||
259ccb6c | 1383 | static int handle_rename_via_dir(struct merge_options *opt, |
e2d563df | 1384 | struct rename_conflict_info *ci) |
9c0743fe | 1385 | { |
5455c338 EN |
1386 | /* |
1387 | * Handle file adds that need to be renamed due to directory rename | |
1388 | * detection. This differs from handle_rename_normal, because | |
1389 | * there is no content merge to do; just move the file into the | |
1390 | * desired final location. | |
1391 | */ | |
e2d563df EN |
1392 | const struct rename *ren = ci->ren1; |
1393 | const struct diff_filespec *dest = ren->pair->two; | |
8c8e5bd6 | 1394 | char *file_path = dest->path; |
8e012516 DS |
1395 | int mark_conflicted = (opt->detect_directory_renames == |
1396 | MERGE_DIRECTORY_RENAMES_CONFLICT); | |
8c8e5bd6 | 1397 | assert(ren->dir_rename_original_dest); |
9c0743fe | 1398 | |
5bf7e577 | 1399 | if (!opt->priv->call_depth && would_lose_untracked(opt, dest->path)) { |
8c8e5bd6 EN |
1400 | mark_conflicted = 1; |
1401 | file_path = unique_path(opt, dest->path, ren->branch); | |
259ccb6c | 1402 | output(opt, 1, _("Error: Refusing to lose untracked file at %s; " |
8c8e5bd6 EN |
1403 | "writing to %s instead."), |
1404 | dest->path, file_path); | |
1405 | } | |
79c47598 | 1406 | |
8c8e5bd6 | 1407 | if (mark_conflicted) { |
79c47598 | 1408 | /* |
8c8e5bd6 EN |
1409 | * Write the file in worktree at file_path. In the index, |
1410 | * only record the file at dest->path in the appropriate | |
1411 | * higher stage. | |
79c47598 | 1412 | */ |
8c8e5bd6 | 1413 | if (update_file(opt, 0, dest, file_path)) |
79c47598 | 1414 | return -1; |
8c8e5bd6 EN |
1415 | if (file_path != dest->path) |
1416 | free(file_path); | |
1417 | if (update_stages(opt, dest->path, NULL, | |
1418 | ren->branch == opt->branch1 ? dest : NULL, | |
1419 | ren->branch == opt->branch1 ? NULL : dest)) | |
1420 | return -1; | |
1421 | return 0; /* not clean, but conflicted */ | |
1422 | } else { | |
1423 | /* Update dest->path both in index and in worktree */ | |
1424 | if (update_file(opt, 1, dest, dest->path)) | |
1425 | return -1; | |
1426 | return 1; /* clean */ | |
79c47598 | 1427 | } |
6bdaead1 EN |
1428 | } |
1429 | ||
259ccb6c | 1430 | static int handle_change_delete(struct merge_options *opt, |
d90e759f | 1431 | const char *path, const char *old_path, |
8daec1df EN |
1432 | const struct diff_filespec *o, |
1433 | const struct diff_filespec *changed, | |
d90e759f EN |
1434 | const char *change_branch, |
1435 | const char *delete_branch, | |
1436 | const char *change, const char *change_past) | |
b7033252 | 1437 | { |
b26d87f2 MM |
1438 | char *alt_path = NULL; |
1439 | const char *update_path = path; | |
75456f96 | 1440 | int ret = 0; |
b26d87f2 | 1441 | |
5bf7e577 EN |
1442 | if (dir_in_way(opt->repo->index, path, !opt->priv->call_depth, 0) || |
1443 | (!opt->priv->call_depth && would_lose_untracked(opt, path))) { | |
259ccb6c | 1444 | update_path = alt_path = unique_path(opt, path, change_branch); |
b7033252 EN |
1445 | } |
1446 | ||
5bf7e577 | 1447 | if (opt->priv->call_depth) { |
b7033252 EN |
1448 | /* |
1449 | * We cannot arbitrarily accept either a_sha or b_sha as | |
1450 | * correct; since there is no true "middle point" between | |
1451 | * them, simply reuse the base version for virtual merge base. | |
1452 | */ | |
259ccb6c | 1453 | ret = remove_file_from_index(opt->repo->index, path); |
75456f96 | 1454 | if (!ret) |
8daec1df | 1455 | ret = update_file(opt, 0, o, update_path); |
b7033252 | 1456 | } else { |
5b26c3c9 EN |
1457 | /* |
1458 | * Despite the four nearly duplicate messages and argument | |
1459 | * lists below and the ugliness of the nested if-statements, | |
1460 | * having complete messages makes the job easier for | |
1461 | * translators. | |
1462 | * | |
1463 | * The slight variance among the cases is due to the fact | |
1464 | * that: | |
1465 | * 1) directory/file conflicts (in effect if | |
1466 | * !alt_path) could cause us to need to write the | |
1467 | * file to a different path. | |
1468 | * 2) renames (in effect if !old_path) could mean that | |
1469 | * there are two names for the path that the user | |
1470 | * may know the file by. | |
1471 | */ | |
b26d87f2 MM |
1472 | if (!alt_path) { |
1473 | if (!old_path) { | |
259ccb6c | 1474 | output(opt, 1, _("CONFLICT (%s/delete): %s deleted in %s " |
b26d87f2 MM |
1475 | "and %s in %s. Version %s of %s left in tree."), |
1476 | change, path, delete_branch, change_past, | |
1477 | change_branch, change_branch, path); | |
1478 | } else { | |
259ccb6c | 1479 | output(opt, 1, _("CONFLICT (%s/delete): %s deleted in %s " |
b26d87f2 MM |
1480 | "and %s to %s in %s. Version %s of %s left in tree."), |
1481 | change, old_path, delete_branch, change_past, path, | |
1482 | change_branch, change_branch, path); | |
1483 | } | |
55653a68 | 1484 | } else { |
b26d87f2 | 1485 | if (!old_path) { |
259ccb6c | 1486 | output(opt, 1, _("CONFLICT (%s/delete): %s deleted in %s " |
b26d87f2 MM |
1487 | "and %s in %s. Version %s of %s left in tree at %s."), |
1488 | change, path, delete_branch, change_past, | |
1489 | change_branch, change_branch, path, alt_path); | |
1490 | } else { | |
259ccb6c | 1491 | output(opt, 1, _("CONFLICT (%s/delete): %s deleted in %s " |
b26d87f2 MM |
1492 | "and %s to %s in %s. Version %s of %s left in tree at %s."), |
1493 | change, old_path, delete_branch, change_past, path, | |
1494 | change_branch, change_branch, path, alt_path); | |
1495 | } | |
55653a68 | 1496 | } |
35a74abf | 1497 | /* |
b26d87f2 | 1498 | * No need to call update_file() on path when change_branch == |
259ccb6c | 1499 | * opt->branch1 && !alt_path, since that would needlessly touch |
b26d87f2 MM |
1500 | * path. We could call update_file_flags() with update_cache=0 |
1501 | * and update_wd=0, but that's a no-op. | |
35a74abf | 1502 | */ |
259ccb6c | 1503 | if (change_branch != opt->branch1 || alt_path) |
8daec1df | 1504 | ret = update_file(opt, 0, changed, update_path); |
b7033252 | 1505 | } |
b26d87f2 | 1506 | free(alt_path); |
75456f96 JS |
1507 | |
1508 | return ret; | |
b7033252 EN |
1509 | } |
1510 | ||
259ccb6c | 1511 | static int handle_rename_delete(struct merge_options *opt, |
e2d563df | 1512 | struct rename_conflict_info *ci) |
9047ebbc | 1513 | { |
e2d563df EN |
1514 | const struct rename *ren = ci->ren1; |
1515 | const struct diff_filespec *orig = ren->pair->one; | |
1516 | const struct diff_filespec *dest = ren->pair->two; | |
1517 | const char *rename_branch = ren->branch; | |
1518 | const char *delete_branch = (opt->branch1 == ren->branch ? | |
1519 | opt->branch2 : opt->branch1); | |
6ef2cb00 | 1520 | |
259ccb6c | 1521 | if (handle_change_delete(opt, |
5bf7e577 EN |
1522 | opt->priv->call_depth ? orig->path : dest->path, |
1523 | opt->priv->call_depth ? NULL : orig->path, | |
8daec1df | 1524 | orig, dest, |
b26d87f2 | 1525 | rename_branch, delete_branch, |
75456f96 JS |
1526 | _("rename"), _("renamed"))) |
1527 | return -1; | |
e03acb8b | 1528 | |
5bf7e577 | 1529 | if (opt->priv->call_depth) |
259ccb6c | 1530 | return remove_file_from_index(opt->repo->index, dest->path); |
75456f96 | 1531 | else |
259ccb6c EN |
1532 | return update_stages(opt, dest->path, NULL, |
1533 | rename_branch == opt->branch1 ? dest : NULL, | |
1534 | rename_branch == opt->branch1 ? NULL : dest); | |
6ef2cb00 EN |
1535 | } |
1536 | ||
259ccb6c | 1537 | static int handle_file_collision(struct merge_options *opt, |
37b65ce3 EN |
1538 | const char *collide_path, |
1539 | const char *prev_path1, | |
1540 | const char *prev_path2, | |
1541 | const char *branch1, const char *branch2, | |
8daec1df EN |
1542 | struct diff_filespec *a, |
1543 | struct diff_filespec *b) | |
3672c971 | 1544 | { |
37b65ce3 | 1545 | struct merge_file_info mfi; |
8daec1df | 1546 | struct diff_filespec null; |
37b65ce3 EN |
1547 | char *alt_path = NULL; |
1548 | const char *update_path = collide_path; | |
3672c971 | 1549 | |
7f867165 EN |
1550 | /* |
1551 | * It's easiest to get the correct things into stage 2 and 3, and | |
1552 | * to make sure that the content merge puts HEAD before the other | |
259ccb6c | 1553 | * branch if we just ensure that branch1 == opt->branch1. So, simply |
7f867165 EN |
1554 | * flip arguments around if we don't have that. |
1555 | */ | |
259ccb6c EN |
1556 | if (branch1 != opt->branch1) { |
1557 | return handle_file_collision(opt, collide_path, | |
7f867165 EN |
1558 | prev_path2, prev_path1, |
1559 | branch2, branch1, | |
8daec1df | 1560 | b, a); |
9047ebbc | 1561 | } |
3672c971 | 1562 | |
37b65ce3 EN |
1563 | /* |
1564 | * In the recursive case, we just opt to undo renames | |
1565 | */ | |
5bf7e577 | 1566 | if (opt->priv->call_depth && (prev_path1 || prev_path2)) { |
8daec1df | 1567 | /* Put first file (a->oid, a->mode) in its original spot */ |
37b65ce3 | 1568 | if (prev_path1) { |
8daec1df | 1569 | if (update_file(opt, 1, a, prev_path1)) |
37b65ce3 EN |
1570 | return -1; |
1571 | } else { | |
8daec1df | 1572 | if (update_file(opt, 1, a, collide_path)) |
37b65ce3 EN |
1573 | return -1; |
1574 | } | |
3672c971 | 1575 | |
8daec1df | 1576 | /* Put second file (b->oid, b->mode) in its original spot */ |
37b65ce3 | 1577 | if (prev_path2) { |
8daec1df | 1578 | if (update_file(opt, 1, b, prev_path2)) |
37b65ce3 EN |
1579 | return -1; |
1580 | } else { | |
8daec1df | 1581 | if (update_file(opt, 1, b, collide_path)) |
37b65ce3 | 1582 | return -1; |
18797a3b | 1583 | } |
37b65ce3 EN |
1584 | |
1585 | /* Don't leave something at collision path if unrenaming both */ | |
1586 | if (prev_path1 && prev_path2) | |
259ccb6c | 1587 | remove_file(opt, 1, collide_path, 0); |
37b65ce3 EN |
1588 | |
1589 | return 0; | |
1590 | } | |
1591 | ||
1592 | /* Remove rename sources if rename/add or rename/rename(2to1) */ | |
1593 | if (prev_path1) | |
259ccb6c | 1594 | remove_file(opt, 1, prev_path1, |
5bf7e577 | 1595 | opt->priv->call_depth || would_lose_untracked(opt, prev_path1)); |
37b65ce3 | 1596 | if (prev_path2) |
259ccb6c | 1597 | remove_file(opt, 1, prev_path2, |
5bf7e577 | 1598 | opt->priv->call_depth || would_lose_untracked(opt, prev_path2)); |
37b65ce3 EN |
1599 | |
1600 | /* | |
1601 | * Remove the collision path, if it wouldn't cause dirty contents | |
1602 | * or an untracked file to get lost. We'll either overwrite with | |
1603 | * merged contents, or just write out to differently named files. | |
1604 | */ | |
259ccb6c EN |
1605 | if (was_dirty(opt, collide_path)) { |
1606 | output(opt, 1, _("Refusing to lose dirty file at %s"), | |
37b65ce3 | 1607 | collide_path); |
259ccb6c EN |
1608 | update_path = alt_path = unique_path(opt, collide_path, "merged"); |
1609 | } else if (would_lose_untracked(opt, collide_path)) { | |
18797a3b | 1610 | /* |
37b65ce3 EN |
1611 | * Only way we get here is if both renames were from |
1612 | * a directory rename AND user had an untracked file | |
1613 | * at the location where both files end up after the | |
1614 | * two directory renames. See testcase 10d of t6043. | |
18797a3b | 1615 | */ |
259ccb6c | 1616 | output(opt, 1, _("Refusing to lose untracked file at " |
37b65ce3 EN |
1617 | "%s, even though it's in the way."), |
1618 | collide_path); | |
259ccb6c | 1619 | update_path = alt_path = unique_path(opt, collide_path, "merged"); |
3672c971 | 1620 | } else { |
37b65ce3 EN |
1621 | /* |
1622 | * FIXME: It's possible that the two files are identical | |
1623 | * and that the current working copy happens to match, in | |
1624 | * which case we are unnecessarily touching the working | |
1625 | * tree file. It's not a likely enough scenario that I | |
1626 | * want to code up the checks for it and a better fix is | |
1627 | * available if we restructure how unpack_trees() and | |
1628 | * merge-recursive interoperate anyway, so punting for | |
1629 | * now... | |
1630 | */ | |
259ccb6c | 1631 | remove_file(opt, 0, collide_path, 0); |
9047ebbc | 1632 | } |
3672c971 | 1633 | |
37b65ce3 | 1634 | /* Store things in diff_filespecs for functions that need it */ |
8daec1df | 1635 | null.path = (char *)collide_path; |
37b65ce3 EN |
1636 | oidcpy(&null.oid, &null_oid); |
1637 | null.mode = 0; | |
8daec1df EN |
1638 | |
1639 | if (merge_mode_and_contents(opt, &null, a, b, collide_path, | |
5bf7e577 | 1640 | branch1, branch2, opt->priv->call_depth * 2, &mfi)) |
37b65ce3 EN |
1641 | return -1; |
1642 | mfi.clean &= !alt_path; | |
8daec1df | 1643 | if (update_file(opt, mfi.clean, &mfi.blob, update_path)) |
37b65ce3 | 1644 | return -1; |
5bf7e577 | 1645 | if (!mfi.clean && !opt->priv->call_depth && |
8daec1df | 1646 | update_stages(opt, collide_path, NULL, a, b)) |
37b65ce3 EN |
1647 | return -1; |
1648 | free(alt_path); | |
1649 | /* | |
1650 | * FIXME: If both a & b both started with conflicts (only possible | |
1651 | * if they came from a rename/rename(2to1)), but had IDENTICAL | |
1652 | * contents including those conflicts, then in the next line we claim | |
1653 | * it was clean. If someone cares about this case, we should have the | |
1654 | * caller notify us if we started with conflicts. | |
1655 | */ | |
1656 | return mfi.clean; | |
1657 | } | |
7f867165 | 1658 | |
259ccb6c | 1659 | static int handle_rename_add(struct merge_options *opt, |
7f867165 EN |
1660 | struct rename_conflict_info *ci) |
1661 | { | |
1662 | /* a was renamed to c, and a separate c was added. */ | |
e9cd1b5c EN |
1663 | struct diff_filespec *a = ci->ren1->pair->one; |
1664 | struct diff_filespec *c = ci->ren1->pair->two; | |
7f867165 EN |
1665 | char *path = c->path; |
1666 | char *prev_path_desc; | |
1667 | struct merge_file_info mfi; | |
1668 | ||
c336ab85 EN |
1669 | const char *rename_branch = ci->ren1->branch; |
1670 | const char *add_branch = (opt->branch1 == rename_branch ? | |
1671 | opt->branch2 : opt->branch1); | |
1672 | int other_stage = (ci->ren1->branch == opt->branch1 ? 3 : 2); | |
7f867165 | 1673 | |
259ccb6c | 1674 | output(opt, 1, _("CONFLICT (rename/add): " |
7f867165 | 1675 | "Rename %s->%s in %s. Added %s in %s"), |
c336ab85 EN |
1676 | a->path, c->path, rename_branch, |
1677 | c->path, add_branch); | |
7f867165 EN |
1678 | |
1679 | prev_path_desc = xstrfmt("version of %s from %s", path, a->path); | |
481de8a2 | 1680 | ci->ren1->src_entry->stages[other_stage].path = a->path; |
8daec1df EN |
1681 | if (merge_mode_and_contents(opt, a, c, |
1682 | &ci->ren1->src_entry->stages[other_stage], | |
3f9c92ec | 1683 | prev_path_desc, |
259ccb6c | 1684 | opt->branch1, opt->branch2, |
5bf7e577 | 1685 | 1 + opt->priv->call_depth * 2, &mfi)) |
7f867165 EN |
1686 | return -1; |
1687 | free(prev_path_desc); | |
1688 | ||
8daec1df | 1689 | ci->ren1->dst_entry->stages[other_stage].path = mfi.blob.path = c->path; |
259ccb6c | 1690 | return handle_file_collision(opt, |
7f867165 | 1691 | c->path, a->path, NULL, |
c336ab85 | 1692 | rename_branch, add_branch, |
8daec1df EN |
1693 | &mfi.blob, |
1694 | &ci->ren1->dst_entry->stages[other_stage]); | |
7f867165 | 1695 | } |
37b65ce3 | 1696 | |
259ccb6c | 1697 | static char *find_path_for_conflict(struct merge_options *opt, |
80cee6e3 DS |
1698 | const char *path, |
1699 | const char *branch1, | |
1700 | const char *branch2) | |
1701 | { | |
1702 | char *new_path = NULL; | |
5bf7e577 | 1703 | if (dir_in_way(opt->repo->index, path, !opt->priv->call_depth, 0)) { |
259ccb6c EN |
1704 | new_path = unique_path(opt, path, branch1); |
1705 | output(opt, 1, _("%s is a directory in %s adding " | |
80cee6e3 DS |
1706 | "as %s instead"), |
1707 | path, branch2, new_path); | |
259ccb6c EN |
1708 | } else if (would_lose_untracked(opt, path)) { |
1709 | new_path = unique_path(opt, path, branch1); | |
1710 | output(opt, 1, _("Refusing to lose untracked file" | |
80cee6e3 DS |
1711 | " at %s; adding as %s instead"), |
1712 | path, new_path); | |
1713 | } | |
1714 | ||
1715 | return new_path; | |
3672c971 EN |
1716 | } |
1717 | ||
ee798742 | 1718 | /* |
4c616c2b | 1719 | * Toggle the stage number between "ours" and "theirs" (2 and 3). |
ee798742 JK |
1720 | */ |
1721 | static inline int flip_stage(int stage) | |
1722 | { | |
4c616c2b | 1723 | return (2 + 3) - stage; |
ee798742 JK |
1724 | } |
1725 | ||
259ccb6c | 1726 | static int handle_rename_rename_1to2(struct merge_options *opt, |
8ebe7b05 | 1727 | struct rename_conflict_info *ci) |
9047ebbc | 1728 | { |
09c01f85 | 1729 | /* One file was renamed in both branches, but to different names. */ |
48c9cb9d | 1730 | struct merge_file_info mfi; |
48c9cb9d | 1731 | struct diff_filespec *add; |
e9cd1b5c EN |
1732 | struct diff_filespec *o = ci->ren1->pair->one; |
1733 | struct diff_filespec *a = ci->ren1->pair->two; | |
1734 | struct diff_filespec *b = ci->ren2->pair->two; | |
48c9cb9d | 1735 | char *path_desc; |
4f66dade | 1736 | |
259ccb6c | 1737 | output(opt, 1, _("CONFLICT (rename/rename): " |
4f66dade | 1738 | "Rename \"%s\"->\"%s\" in branch \"%s\" " |
55653a68 | 1739 | "rename \"%s\"->\"%s\" in \"%s\"%s"), |
c336ab85 EN |
1740 | o->path, a->path, ci->ren1->branch, |
1741 | o->path, b->path, ci->ren2->branch, | |
5bf7e577 | 1742 | opt->priv->call_depth ? _(" (left unresolved)") : ""); |
75456f96 | 1743 | |
48c9cb9d | 1744 | path_desc = xstrfmt("%s and %s, both renamed from %s", |
e3de888c EN |
1745 | a->path, b->path, o->path); |
1746 | if (merge_mode_and_contents(opt, o, a, b, path_desc, | |
c336ab85 | 1747 | ci->ren1->branch, ci->ren2->branch, |
5bf7e577 | 1748 | opt->priv->call_depth * 2, &mfi)) |
48c9cb9d EN |
1749 | return -1; |
1750 | free(path_desc); | |
1751 | ||
5bf7e577 | 1752 | if (opt->priv->call_depth) { |
9047ebbc | 1753 | /* |
c52ff85d EN |
1754 | * FIXME: For rename/add-source conflicts (if we could detect |
1755 | * such), this is wrong. We should instead find a unique | |
1756 | * pathname and then either rename the add-source file to that | |
1757 | * unique path, or use that unique path instead of src here. | |
9047ebbc | 1758 | */ |
8daec1df | 1759 | if (update_file(opt, 0, &mfi.blob, o->path)) |
75456f96 | 1760 | return -1; |
07413c5a | 1761 | |
6d63070c EN |
1762 | /* |
1763 | * Above, we put the merged content at the merge-base's | |
1764 | * path. Now we usually need to delete both a->path and | |
1765 | * b->path. However, the rename on each side of the merge | |
1766 | * could also be involved in a rename/add conflict. In | |
1767 | * such cases, we should keep the added file around, | |
1768 | * resolving the conflict at that path in its favor. | |
1769 | */ | |
ee798742 | 1770 | add = &ci->ren1->dst_entry->stages[flip_stage(2)]; |
8daec1df EN |
1771 | if (is_valid(add)) { |
1772 | if (update_file(opt, 0, add, a->path)) | |
75456f96 JS |
1773 | return -1; |
1774 | } | |
6d63070c | 1775 | else |
259ccb6c | 1776 | remove_file_from_index(opt->repo->index, a->path); |
ee798742 | 1777 | add = &ci->ren2->dst_entry->stages[flip_stage(3)]; |
8daec1df EN |
1778 | if (is_valid(add)) { |
1779 | if (update_file(opt, 0, add, b->path)) | |
75456f96 JS |
1780 | return -1; |
1781 | } | |
6d63070c | 1782 | else |
259ccb6c | 1783 | remove_file_from_index(opt->repo->index, b->path); |
48c9cb9d EN |
1784 | } else { |
1785 | /* | |
1786 | * For each destination path, we need to see if there is a | |
1787 | * rename/add collision. If not, we can write the file out | |
1788 | * to the specified location. | |
1789 | */ | |
ee798742 | 1790 | add = &ci->ren1->dst_entry->stages[flip_stage(2)]; |
8daec1df EN |
1791 | if (is_valid(add)) { |
1792 | add->path = mfi.blob.path = a->path; | |
259ccb6c | 1793 | if (handle_file_collision(opt, a->path, |
48c9cb9d | 1794 | NULL, NULL, |
c336ab85 EN |
1795 | ci->ren1->branch, |
1796 | ci->ren2->branch, | |
8daec1df | 1797 | &mfi.blob, add) < 0) |
48c9cb9d EN |
1798 | return -1; |
1799 | } else { | |
259ccb6c | 1800 | char *new_path = find_path_for_conflict(opt, a->path, |
c336ab85 EN |
1801 | ci->ren1->branch, |
1802 | ci->ren2->branch); | |
8daec1df EN |
1803 | if (update_file(opt, 0, &mfi.blob, |
1804 | new_path ? new_path : a->path)) | |
48c9cb9d EN |
1805 | return -1; |
1806 | free(new_path); | |
259ccb6c | 1807 | if (update_stages(opt, a->path, NULL, a, NULL)) |
48c9cb9d EN |
1808 | return -1; |
1809 | } | |
1810 | ||
ee798742 | 1811 | add = &ci->ren2->dst_entry->stages[flip_stage(3)]; |
8daec1df EN |
1812 | if (is_valid(add)) { |
1813 | add->path = mfi.blob.path = b->path; | |
259ccb6c | 1814 | if (handle_file_collision(opt, b->path, |
48c9cb9d | 1815 | NULL, NULL, |
c336ab85 EN |
1816 | ci->ren1->branch, |
1817 | ci->ren2->branch, | |
8daec1df | 1818 | add, &mfi.blob) < 0) |
48c9cb9d EN |
1819 | return -1; |
1820 | } else { | |
259ccb6c | 1821 | char *new_path = find_path_for_conflict(opt, b->path, |
c336ab85 EN |
1822 | ci->ren2->branch, |
1823 | ci->ren1->branch); | |
8daec1df EN |
1824 | if (update_file(opt, 0, &mfi.blob, |
1825 | new_path ? new_path : b->path)) | |
48c9cb9d EN |
1826 | return -1; |
1827 | free(new_path); | |
259ccb6c | 1828 | if (update_stages(opt, b->path, NULL, NULL, b)) |
48c9cb9d EN |
1829 | return -1; |
1830 | } | |
1831 | } | |
75456f96 JS |
1832 | |
1833 | return 0; | |
9047ebbc MV |
1834 | } |
1835 | ||
259ccb6c | 1836 | static int handle_rename_rename_2to1(struct merge_options *opt, |
8ebe7b05 | 1837 | struct rename_conflict_info *ci) |
9047ebbc | 1838 | { |
461f5041 | 1839 | /* Two files, a & b, were renamed to the same thing, c. */ |
e9cd1b5c EN |
1840 | struct diff_filespec *a = ci->ren1->pair->one; |
1841 | struct diff_filespec *b = ci->ren2->pair->one; | |
1842 | struct diff_filespec *c1 = ci->ren1->pair->two; | |
1843 | struct diff_filespec *c2 = ci->ren2->pair->two; | |
461f5041 | 1844 | char *path = c1->path; /* == c2->path */ |
05cf21eb EN |
1845 | char *path_side_1_desc; |
1846 | char *path_side_2_desc; | |
434b8525 EN |
1847 | struct merge_file_info mfi_c1; |
1848 | struct merge_file_info mfi_c2; | |
8daec1df | 1849 | int ostage1, ostage2; |
461f5041 | 1850 | |
259ccb6c | 1851 | output(opt, 1, _("CONFLICT (rename/rename): " |
461f5041 | 1852 | "Rename %s->%s in %s. " |
55653a68 | 1853 | "Rename %s->%s in %s"), |
c336ab85 EN |
1854 | a->path, c1->path, ci->ren1->branch, |
1855 | b->path, c2->path, ci->ren2->branch); | |
461f5041 | 1856 | |
2b168ef3 EN |
1857 | path_side_1_desc = xstrfmt("version of %s from %s", path, a->path); |
1858 | path_side_2_desc = xstrfmt("version of %s from %s", path, b->path); | |
8daec1df | 1859 | ostage1 = ci->ren1->branch == opt->branch1 ? 3 : 2; |
ee798742 | 1860 | ostage2 = flip_stage(ostage1); |
8daec1df EN |
1861 | ci->ren1->src_entry->stages[ostage1].path = a->path; |
1862 | ci->ren2->src_entry->stages[ostage2].path = b->path; | |
1863 | if (merge_mode_and_contents(opt, a, c1, | |
1864 | &ci->ren1->src_entry->stages[ostage1], | |
1865 | path_side_1_desc, | |
259ccb6c | 1866 | opt->branch1, opt->branch2, |
5bf7e577 | 1867 | 1 + opt->priv->call_depth * 2, &mfi_c1) || |
8daec1df EN |
1868 | merge_mode_and_contents(opt, b, |
1869 | &ci->ren2->src_entry->stages[ostage2], | |
1870 | c2, path_side_2_desc, | |
259ccb6c | 1871 | opt->branch1, opt->branch2, |
5bf7e577 | 1872 | 1 + opt->priv->call_depth * 2, &mfi_c2)) |
75456f96 | 1873 | return -1; |
05cf21eb EN |
1874 | free(path_side_1_desc); |
1875 | free(path_side_2_desc); | |
8daec1df EN |
1876 | mfi_c1.blob.path = path; |
1877 | mfi_c2.blob.path = path; | |
434b8525 | 1878 | |
259ccb6c | 1879 | return handle_file_collision(opt, path, a->path, b->path, |
c336ab85 | 1880 | ci->ren1->branch, ci->ren2->branch, |
8daec1df | 1881 | &mfi_c1.blob, &mfi_c2.blob); |
9047ebbc MV |
1882 | } |
1883 | ||
9ba91557 | 1884 | /* |
e5257b2a | 1885 | * Get the diff_filepairs changed between o_tree and tree. |
9ba91557 | 1886 | */ |
259ccb6c | 1887 | static struct diff_queue_struct *get_diffpairs(struct merge_options *opt, |
e5257b2a EN |
1888 | struct tree *o_tree, |
1889 | struct tree *tree) | |
9ba91557 | 1890 | { |
e5257b2a | 1891 | struct diff_queue_struct *ret; |
9ba91557 EN |
1892 | struct diff_options opts; |
1893 | ||
259ccb6c | 1894 | repo_diff_setup(opt->repo, &opts); |
9ba91557 EN |
1895 | opts.flags.recursive = 1; |
1896 | opts.flags.rename_empty = 0; | |
259ccb6c | 1897 | opts.detect_rename = merge_detect_rename(opt); |
85b46030 BP |
1898 | /* |
1899 | * We do not have logic to handle the detection of copies. In | |
1900 | * fact, it may not even make sense to add such logic: would we | |
1901 | * really want a change to a base file to be propagated through | |
1902 | * multiple other files by a merge? | |
1903 | */ | |
1904 | if (opts.detect_rename > DIFF_DETECT_RENAME) | |
1905 | opts.detect_rename = DIFF_DETECT_RENAME; | |
8599ab45 | 1906 | opts.rename_limit = (opt->rename_limit >= 0) ? opt->rename_limit : 1000; |
259ccb6c EN |
1907 | opts.rename_score = opt->rename_score; |
1908 | opts.show_rename_progress = opt->show_rename_progress; | |
9ba91557 EN |
1909 | opts.output_format = DIFF_FORMAT_NO_OUTPUT; |
1910 | diff_setup_done(&opts); | |
1911 | diff_tree_oid(&o_tree->object.oid, &tree->object.oid, "", &opts); | |
1912 | diffcore_std(&opts); | |
5bf7e577 EN |
1913 | if (opts.needed_rename_limit > opt->priv->needed_rename_limit) |
1914 | opt->priv->needed_rename_limit = opts.needed_rename_limit; | |
e5257b2a EN |
1915 | |
1916 | ret = xmalloc(sizeof(*ret)); | |
1917 | *ret = diff_queued_diff; | |
1918 | ||
1919 | opts.output_format = DIFF_FORMAT_NO_OUTPUT; | |
1920 | diff_queued_diff.nr = 0; | |
1921 | diff_queued_diff.queue = NULL; | |
1922 | diff_flush(&opts); | |
1923 | return ret; | |
1924 | } | |
1925 | ||
34e7771b NTND |
1926 | static int tree_has_path(struct repository *r, struct tree *tree, |
1927 | const char *path) | |
96e7ffbd EN |
1928 | { |
1929 | struct object_id hashy; | |
5ec1e728 | 1930 | unsigned short mode_o; |
96e7ffbd | 1931 | |
34e7771b | 1932 | return !get_tree_entry(r, |
50ddb089 | 1933 | &tree->object.oid, path, |
96e7ffbd EN |
1934 | &hashy, &mode_o); |
1935 | } | |
1936 | ||
e95ab70a EN |
1937 | /* |
1938 | * Return a new string that replaces the beginning portion (which matches | |
1939 | * entry->dir), with entry->new_dir. In perl-speak: | |
1940 | * new_path_name = (old_path =~ s/entry->dir/entry->new_dir/); | |
1941 | * NOTE: | |
1942 | * Caller must ensure that old_path starts with entry->dir + '/'. | |
1943 | */ | |
1944 | static char *apply_dir_rename(struct dir_rename_entry *entry, | |
1945 | const char *old_path) | |
1946 | { | |
1947 | struct strbuf new_path = STRBUF_INIT; | |
1948 | int oldlen, newlen; | |
1949 | ||
1950 | if (entry->non_unique_new_dir) | |
1951 | return NULL; | |
1952 | ||
1953 | oldlen = strlen(entry->dir); | |
49b8133a EN |
1954 | if (entry->new_dir.len == 0) |
1955 | /* | |
1956 | * If someone renamed/merged a subdirectory into the root | |
1957 | * directory (e.g. 'some/subdir' -> ''), then we want to | |
1958 | * avoid returning | |
1959 | * '' + '/filename' | |
1960 | * as the rename; we need to make old_path + oldlen advance | |
1961 | * past the '/' character. | |
1962 | */ | |
1963 | oldlen++; | |
e95ab70a EN |
1964 | newlen = entry->new_dir.len + (strlen(old_path) - oldlen) + 1; |
1965 | strbuf_grow(&new_path, newlen); | |
1966 | strbuf_addbuf(&new_path, &entry->new_dir); | |
1967 | strbuf_addstr(&new_path, &old_path[oldlen]); | |
1968 | ||
1969 | return strbuf_detach(&new_path, NULL); | |
1970 | } | |
1971 | ||
7fe40b88 EN |
1972 | static void get_renamed_dir_portion(const char *old_path, const char *new_path, |
1973 | char **old_dir, char **new_dir) | |
1974 | { | |
1975 | char *end_of_old, *end_of_new; | |
7fe40b88 | 1976 | |
d3eebaad | 1977 | /* Default return values: NULL, meaning no rename */ |
7fe40b88 EN |
1978 | *old_dir = NULL; |
1979 | *new_dir = NULL; | |
1980 | ||
1981 | /* | |
1982 | * For | |
1983 | * "a/b/c/d/e/foo.c" -> "a/b/some/thing/else/e/foo.c" | |
1984 | * the "e/foo.c" part is the same, we just want to know that | |
1985 | * "a/b/c/d" was renamed to "a/b/some/thing/else" | |
1986 | * so, for this example, this function returns "a/b/c/d" in | |
1987 | * *old_dir and "a/b/some/thing/else" in *new_dir. | |
d3eebaad EN |
1988 | */ |
1989 | ||
1990 | /* | |
1991 | * If the basename of the file changed, we don't care. We want | |
1992 | * to know which portion of the directory, if any, changed. | |
7fe40b88 EN |
1993 | */ |
1994 | end_of_old = strrchr(old_path, '/'); | |
1995 | end_of_new = strrchr(new_path, '/'); | |
1996 | ||
49b8133a EN |
1997 | /* |
1998 | * If end_of_old is NULL, old_path wasn't in a directory, so there | |
1999 | * could not be a directory rename (our rule elsewhere that a | |
2000 | * directory which still exists is not considered to have been | |
2001 | * renamed means the root directory can never be renamed -- because | |
2002 | * the root directory always exists). | |
2003 | */ | |
2004 | if (end_of_old == NULL) | |
2005 | return; /* Note: *old_dir and *new_dir are still NULL */ | |
2006 | ||
2007 | /* | |
2008 | * If new_path contains no directory (end_of_new is NULL), then we | |
2009 | * have a rename of old_path's directory to the root directory. | |
2010 | */ | |
2011 | if (end_of_new == NULL) { | |
2012 | *old_dir = xstrndup(old_path, end_of_old - old_path); | |
2013 | *new_dir = xstrdup(""); | |
7fe40b88 | 2014 | return; |
49b8133a | 2015 | } |
d3eebaad EN |
2016 | |
2017 | /* Find the first non-matching character traversing backwards */ | |
7fe40b88 EN |
2018 | while (*--end_of_new == *--end_of_old && |
2019 | end_of_old != old_path && | |
2020 | end_of_new != new_path) | |
2021 | ; /* Do nothing; all in the while loop */ | |
d3eebaad | 2022 | |
7fe40b88 | 2023 | /* |
d3eebaad EN |
2024 | * If both got back to the beginning of their strings, then the |
2025 | * directory didn't change at all, only the basename did. | |
7fe40b88 | 2026 | */ |
d3eebaad EN |
2027 | if (end_of_old == old_path && end_of_new == new_path && |
2028 | *end_of_old == *end_of_new) | |
49b8133a | 2029 | return; /* Note: *old_dir and *new_dir are still NULL */ |
7fe40b88 EN |
2030 | |
2031 | /* | |
49b8133a EN |
2032 | * If end_of_new got back to the beginning of its string, and |
2033 | * end_of_old got back to the beginning of some subdirectory, then | |
2034 | * we have a rename/merge of a subdirectory into the root, which | |
2035 | * needs slightly special handling. | |
2036 | * | |
2037 | * Note: There is no need to consider the opposite case, with a | |
2038 | * rename/merge of the root directory into some subdirectory | |
2039 | * because as noted above the root directory always exists so it | |
2040 | * cannot be considered to be renamed. | |
7fe40b88 | 2041 | */ |
49b8133a EN |
2042 | if (end_of_new == new_path && |
2043 | end_of_old != old_path && end_of_old[-1] == '/') { | |
2044 | *old_dir = xstrndup(old_path, --end_of_old - old_path); | |
2045 | *new_dir = xstrdup(""); | |
2046 | return; | |
7fe40b88 | 2047 | } |
7fe40b88 EN |
2048 | |
2049 | /* | |
d3eebaad EN |
2050 | * We've found the first non-matching character in the directory |
2051 | * paths. That means the current characters we were looking at | |
2052 | * were part of the first non-matching subdir name going back from | |
2053 | * the end of the strings. Get the whole name by advancing both | |
2054 | * end_of_old and end_of_new to the NEXT '/' character. That will | |
2055 | * represent the entire directory rename. | |
2056 | * | |
2057 | * The reason for the increment is cases like | |
2058 | * a/b/star/foo/whatever.c -> a/b/tar/foo/random.c | |
2059 | * After dropping the basename and going back to the first | |
2060 | * non-matching character, we're now comparing: | |
2061 | * a/b/s and a/b/ | |
2062 | * and we want to be comparing: | |
2063 | * a/b/star/ and a/b/tar/ | |
2064 | * but without the pre-increment, the one on the right would stay | |
2065 | * a/b/. | |
7fe40b88 | 2066 | */ |
d3eebaad EN |
2067 | end_of_old = strchr(++end_of_old, '/'); |
2068 | end_of_new = strchr(++end_of_new, '/'); | |
7fe40b88 | 2069 | |
d3eebaad EN |
2070 | /* Copy the old and new directories into *old_dir and *new_dir. */ |
2071 | *old_dir = xstrndup(old_path, end_of_old - old_path); | |
2072 | *new_dir = xstrndup(new_path, end_of_new - new_path); | |
7fe40b88 EN |
2073 | } |
2074 | ||
96e7ffbd EN |
2075 | static void remove_hashmap_entries(struct hashmap *dir_renames, |
2076 | struct string_list *items_to_remove) | |
2077 | { | |
2078 | int i; | |
2079 | struct dir_rename_entry *entry; | |
2080 | ||
2081 | for (i = 0; i < items_to_remove->nr; i++) { | |
2082 | entry = items_to_remove->items[i].util; | |
28ee7941 | 2083 | hashmap_remove(dir_renames, &entry->ent, NULL); |
96e7ffbd EN |
2084 | } |
2085 | string_list_clear(items_to_remove, 0); | |
2086 | } | |
2087 | ||
f6f77559 EN |
2088 | /* |
2089 | * See if there is a directory rename for path, and if there are any file | |
2090 | * level conflicts for the renamed location. If there is a rename and | |
2091 | * there are no conflicts, return the new name. Otherwise, return NULL. | |
2092 | */ | |
259ccb6c | 2093 | static char *handle_path_level_conflicts(struct merge_options *opt, |
f6f77559 EN |
2094 | const char *path, |
2095 | struct dir_rename_entry *entry, | |
2096 | struct hashmap *collisions, | |
2097 | struct tree *tree) | |
2098 | { | |
2099 | char *new_path = NULL; | |
2100 | struct collision_entry *collision_ent; | |
2101 | int clean = 1; | |
2102 | struct strbuf collision_paths = STRBUF_INIT; | |
2103 | ||
2104 | /* | |
2105 | * entry has the mapping of old directory name to new directory name | |
2106 | * that we want to apply to path. | |
2107 | */ | |
2108 | new_path = apply_dir_rename(entry, path); | |
2109 | ||
2110 | if (!new_path) { | |
2111 | /* This should only happen when entry->non_unique_new_dir set */ | |
2112 | if (!entry->non_unique_new_dir) | |
2113 | BUG("entry->non_unqiue_dir not set and !new_path"); | |
259ccb6c | 2114 | output(opt, 1, _("CONFLICT (directory rename split): " |
f6f77559 EN |
2115 | "Unclear where to place %s because directory " |
2116 | "%s was renamed to multiple other directories, " | |
2117 | "with no destination getting a majority of the " | |
2118 | "files."), | |
2119 | path, entry->dir); | |
2120 | clean = 0; | |
2121 | return NULL; | |
2122 | } | |
2123 | ||
2124 | /* | |
2125 | * The caller needs to have ensured that it has pre-populated | |
2126 | * collisions with all paths that map to new_path. Do a quick check | |
2127 | * to ensure that's the case. | |
2128 | */ | |
2129 | collision_ent = collision_find_entry(collisions, new_path); | |
2130 | if (collision_ent == NULL) | |
2131 | BUG("collision_ent is NULL"); | |
2132 | ||
2133 | /* | |
2134 | * Check for one-sided add/add/.../add conflicts, i.e. | |
2135 | * where implicit renames from the other side doing | |
2136 | * directory rename(s) can affect this side of history | |
2137 | * to put multiple paths into the same location. Warn | |
2138 | * and bail on directory renames for such paths. | |
2139 | */ | |
2140 | if (collision_ent->reported_already) { | |
2141 | clean = 0; | |
34e7771b | 2142 | } else if (tree_has_path(opt->repo, tree, new_path)) { |
f6f77559 EN |
2143 | collision_ent->reported_already = 1; |
2144 | strbuf_add_separated_string_list(&collision_paths, ", ", | |
2145 | &collision_ent->source_files); | |
259ccb6c | 2146 | output(opt, 1, _("CONFLICT (implicit dir rename): Existing " |
f6f77559 EN |
2147 | "file/dir at %s in the way of implicit " |
2148 | "directory rename(s) putting the following " | |
2149 | "path(s) there: %s."), | |
2150 | new_path, collision_paths.buf); | |
2151 | clean = 0; | |
2152 | } else if (collision_ent->source_files.nr > 1) { | |
2153 | collision_ent->reported_already = 1; | |
2154 | strbuf_add_separated_string_list(&collision_paths, ", ", | |
2155 | &collision_ent->source_files); | |
259ccb6c | 2156 | output(opt, 1, _("CONFLICT (implicit dir rename): Cannot map " |
f6f77559 EN |
2157 | "more than one path to %s; implicit directory " |
2158 | "renames tried to put these paths there: %s"), | |
2159 | new_path, collision_paths.buf); | |
2160 | clean = 0; | |
2161 | } | |
2162 | ||
2163 | /* Free memory we no longer need */ | |
2164 | strbuf_release(&collision_paths); | |
2165 | if (!clean && new_path) { | |
2166 | free(new_path); | |
2167 | return NULL; | |
2168 | } | |
2169 | ||
2170 | return new_path; | |
2171 | } | |
2172 | ||
96e7ffbd EN |
2173 | /* |
2174 | * There are a couple things we want to do at the directory level: | |
2175 | * 1. Check for both sides renaming to the same thing, in order to avoid | |
2176 | * implicit renaming of files that should be left in place. (See | |
2177 | * testcase 6b in t6043 for details.) | |
2178 | * 2. Prune directory renames if there are still files left in the | |
2179 | * the original directory. These represent a partial directory rename, | |
2180 | * i.e. a rename where only some of the files within the directory | |
2181 | * were renamed elsewhere. (Technically, this could be done earlier | |
2182 | * in get_directory_renames(), except that would prevent us from | |
2183 | * doing the previous check and thus failing testcase 6b.) | |
2184 | * 3. Check for rename/rename(1to2) conflicts (at the directory level). | |
2185 | * In the future, we could potentially record this info as well and | |
2186 | * omit reporting rename/rename(1to2) conflicts for each path within | |
2187 | * the affected directories, thus cleaning up the merge output. | |
2188 | * NOTE: We do NOT check for rename/rename(2to1) conflicts at the | |
2189 | * directory level, because merging directories is fine. If it | |
2190 | * causes conflicts for files within those merged directories, then | |
2191 | * that should be detected at the individual path level. | |
2192 | */ | |
259ccb6c | 2193 | static void handle_directory_level_conflicts(struct merge_options *opt, |
96e7ffbd EN |
2194 | struct hashmap *dir_re_head, |
2195 | struct tree *head, | |
2196 | struct hashmap *dir_re_merge, | |
2197 | struct tree *merge) | |
2198 | { | |
2199 | struct hashmap_iter iter; | |
2200 | struct dir_rename_entry *head_ent; | |
2201 | struct dir_rename_entry *merge_ent; | |
2202 | ||
2203 | struct string_list remove_from_head = STRING_LIST_INIT_NODUP; | |
2204 | struct string_list remove_from_merge = STRING_LIST_INIT_NODUP; | |
2205 | ||
87571c3f | 2206 | hashmap_for_each_entry(dir_re_head, &iter, head_ent, |
87571c3f | 2207 | ent /* member name */) { |
96e7ffbd EN |
2208 | merge_ent = dir_rename_find_entry(dir_re_merge, head_ent->dir); |
2209 | if (merge_ent && | |
2210 | !head_ent->non_unique_new_dir && | |
2211 | !merge_ent->non_unique_new_dir && | |
2212 | !strbuf_cmp(&head_ent->new_dir, &merge_ent->new_dir)) { | |
2213 | /* 1. Renamed identically; remove it from both sides */ | |
2214 | string_list_append(&remove_from_head, | |
2215 | head_ent->dir)->util = head_ent; | |
2216 | strbuf_release(&head_ent->new_dir); | |
2217 | string_list_append(&remove_from_merge, | |
2218 | merge_ent->dir)->util = merge_ent; | |
2219 | strbuf_release(&merge_ent->new_dir); | |
34e7771b | 2220 | } else if (tree_has_path(opt->repo, head, head_ent->dir)) { |
96e7ffbd EN |
2221 | /* 2. This wasn't a directory rename after all */ |
2222 | string_list_append(&remove_from_head, | |
2223 | head_ent->dir)->util = head_ent; | |
2224 | strbuf_release(&head_ent->new_dir); | |
2225 | } | |
2226 | } | |
2227 | ||
2228 | remove_hashmap_entries(dir_re_head, &remove_from_head); | |
2229 | remove_hashmap_entries(dir_re_merge, &remove_from_merge); | |
2230 | ||
87571c3f | 2231 | hashmap_for_each_entry(dir_re_merge, &iter, merge_ent, |
87571c3f | 2232 | ent /* member name */) { |
96e7ffbd | 2233 | head_ent = dir_rename_find_entry(dir_re_head, merge_ent->dir); |
34e7771b | 2234 | if (tree_has_path(opt->repo, merge, merge_ent->dir)) { |
96e7ffbd EN |
2235 | /* 2. This wasn't a directory rename after all */ |
2236 | string_list_append(&remove_from_merge, | |
2237 | merge_ent->dir)->util = merge_ent; | |
2238 | } else if (head_ent && | |
2239 | !head_ent->non_unique_new_dir && | |
2240 | !merge_ent->non_unique_new_dir) { | |
2241 | /* 3. rename/rename(1to2) */ | |
2242 | /* | |
2243 | * We can assume it's not rename/rename(1to1) because | |
2244 | * that was case (1), already checked above. So we | |
2245 | * know that head_ent->new_dir and merge_ent->new_dir | |
2246 | * are different strings. | |
2247 | */ | |
259ccb6c | 2248 | output(opt, 1, _("CONFLICT (rename/rename): " |
96e7ffbd EN |
2249 | "Rename directory %s->%s in %s. " |
2250 | "Rename directory %s->%s in %s"), | |
259ccb6c EN |
2251 | head_ent->dir, head_ent->new_dir.buf, opt->branch1, |
2252 | head_ent->dir, merge_ent->new_dir.buf, opt->branch2); | |
96e7ffbd EN |
2253 | string_list_append(&remove_from_head, |
2254 | head_ent->dir)->util = head_ent; | |
2255 | strbuf_release(&head_ent->new_dir); | |
2256 | string_list_append(&remove_from_merge, | |
2257 | merge_ent->dir)->util = merge_ent; | |
2258 | strbuf_release(&merge_ent->new_dir); | |
2259 | } | |
2260 | } | |
2261 | ||
2262 | remove_hashmap_entries(dir_re_head, &remove_from_head); | |
2263 | remove_hashmap_entries(dir_re_merge, &remove_from_merge); | |
2264 | } | |
2265 | ||
b53c5028 | 2266 | static struct hashmap *get_directory_renames(struct diff_queue_struct *pairs) |
7fe40b88 EN |
2267 | { |
2268 | struct hashmap *dir_renames; | |
2269 | struct hashmap_iter iter; | |
2270 | struct dir_rename_entry *entry; | |
2271 | int i; | |
2272 | ||
2273 | /* | |
2274 | * Typically, we think of a directory rename as all files from a | |
2275 | * certain directory being moved to a target directory. However, | |
2276 | * what if someone first moved two files from the original | |
2277 | * directory in one commit, and then renamed the directory | |
2278 | * somewhere else in a later commit? At merge time, we just know | |
2279 | * that files from the original directory went to two different | |
2280 | * places, and that the bulk of them ended up in the same place. | |
2281 | * We want each directory rename to represent where the bulk of the | |
2282 | * files from that directory end up; this function exists to find | |
2283 | * where the bulk of the files went. | |
2284 | * | |
2285 | * The first loop below simply iterates through the list of file | |
2286 | * renames, finding out how often each directory rename pair | |
2287 | * possibility occurs. | |
2288 | */ | |
2289 | dir_renames = xmalloc(sizeof(*dir_renames)); | |
2290 | dir_rename_init(dir_renames); | |
2291 | for (i = 0; i < pairs->nr; ++i) { | |
2292 | struct string_list_item *item; | |
2293 | int *count; | |
2294 | struct diff_filepair *pair = pairs->queue[i]; | |
2295 | char *old_dir, *new_dir; | |
2296 | ||
2297 | /* File not part of directory rename if it wasn't renamed */ | |
2298 | if (pair->status != 'R') | |
2299 | continue; | |
2300 | ||
2301 | get_renamed_dir_portion(pair->one->path, pair->two->path, | |
2302 | &old_dir, &new_dir); | |
2303 | if (!old_dir) | |
2304 | /* Directory didn't change at all; ignore this one. */ | |
2305 | continue; | |
2306 | ||
2307 | entry = dir_rename_find_entry(dir_renames, old_dir); | |
2308 | if (!entry) { | |
2309 | entry = xmalloc(sizeof(*entry)); | |
2310 | dir_rename_entry_init(entry, old_dir); | |
26b455f2 | 2311 | hashmap_put(dir_renames, &entry->ent); |
7fe40b88 EN |
2312 | } else { |
2313 | free(old_dir); | |
2314 | } | |
2315 | item = string_list_lookup(&entry->possible_new_dirs, new_dir); | |
2316 | if (!item) { | |
2317 | item = string_list_insert(&entry->possible_new_dirs, | |
2318 | new_dir); | |
2319 | item->util = xcalloc(1, sizeof(int)); | |
2320 | } else { | |
2321 | free(new_dir); | |
2322 | } | |
2323 | count = item->util; | |
2324 | *count += 1; | |
2325 | } | |
2326 | ||
2327 | /* | |
2328 | * For each directory with files moved out of it, we find out which | |
2329 | * target directory received the most files so we can declare it to | |
2330 | * be the "winning" target location for the directory rename. This | |
2331 | * winner gets recorded in new_dir. If there is no winner | |
2332 | * (multiple target directories received the same number of files), | |
2333 | * we set non_unique_new_dir. Once we've determined the winner (or | |
2334 | * that there is no winner), we no longer need possible_new_dirs. | |
2335 | */ | |
87571c3f | 2336 | hashmap_for_each_entry(dir_renames, &iter, entry, |
87571c3f | 2337 | ent /* member name */) { |
7fe40b88 EN |
2338 | int max = 0; |
2339 | int bad_max = 0; | |
2340 | char *best = NULL; | |
2341 | ||
2342 | for (i = 0; i < entry->possible_new_dirs.nr; i++) { | |
2343 | int *count = entry->possible_new_dirs.items[i].util; | |
2344 | ||
2345 | if (*count == max) | |
2346 | bad_max = max; | |
2347 | else if (*count > max) { | |
2348 | max = *count; | |
2349 | best = entry->possible_new_dirs.items[i].string; | |
2350 | } | |
2351 | } | |
2352 | if (bad_max == max) | |
2353 | entry->non_unique_new_dir = 1; | |
2354 | else { | |
2355 | assert(entry->new_dir.len == 0); | |
2356 | strbuf_addstr(&entry->new_dir, best); | |
2357 | } | |
2358 | /* | |
2359 | * The relevant directory sub-portion of the original full | |
2360 | * filepaths were xstrndup'ed before inserting into | |
2361 | * possible_new_dirs, and instead of manually iterating the | |
2362 | * list and free'ing each, just lie and tell | |
2363 | * possible_new_dirs that it did the strdup'ing so that it | |
2364 | * will free them for us. | |
2365 | */ | |
2366 | entry->possible_new_dirs.strdup_strings = 1; | |
2367 | string_list_clear(&entry->possible_new_dirs, 1); | |
2368 | } | |
2369 | ||
2370 | return dir_renames; | |
2371 | } | |
2372 | ||
e95ab70a EN |
2373 | static struct dir_rename_entry *check_dir_renamed(const char *path, |
2374 | struct hashmap *dir_renames) | |
2375 | { | |
9da2d037 | 2376 | char *temp = xstrdup(path); |
e95ab70a | 2377 | char *end; |
c3b9bc94 | 2378 | struct dir_rename_entry *entry = NULL; |
e95ab70a | 2379 | |
e95ab70a EN |
2380 | while ((end = strrchr(temp, '/'))) { |
2381 | *end = '\0'; | |
2382 | entry = dir_rename_find_entry(dir_renames, temp); | |
2383 | if (entry) | |
9da2d037 | 2384 | break; |
e95ab70a | 2385 | } |
9da2d037 RS |
2386 | free(temp); |
2387 | return entry; | |
e95ab70a EN |
2388 | } |
2389 | ||
2390 | static void compute_collisions(struct hashmap *collisions, | |
2391 | struct hashmap *dir_renames, | |
2392 | struct diff_queue_struct *pairs) | |
2393 | { | |
2394 | int i; | |
2395 | ||
2396 | /* | |
2397 | * Multiple files can be mapped to the same path due to directory | |
2398 | * renames done by the other side of history. Since that other | |
2399 | * side of history could have merged multiple directories into one, | |
2400 | * if our side of history added the same file basename to each of | |
2401 | * those directories, then all N of them would get implicitly | |
2402 | * renamed by the directory rename detection into the same path, | |
2403 | * and we'd get an add/add/.../add conflict, and all those adds | |
2404 | * from *this* side of history. This is not representable in the | |
2405 | * index, and users aren't going to easily be able to make sense of | |
2406 | * it. So we need to provide a good warning about what's | |
2407 | * happening, and fall back to no-directory-rename detection | |
2408 | * behavior for those paths. | |
2409 | * | |
2410 | * See testcases 9e and all of section 5 from t6043 for examples. | |
2411 | */ | |
2412 | collision_init(collisions); | |
2413 | ||
2414 | for (i = 0; i < pairs->nr; ++i) { | |
2415 | struct dir_rename_entry *dir_rename_ent; | |
2416 | struct collision_entry *collision_ent; | |
2417 | char *new_path; | |
2418 | struct diff_filepair *pair = pairs->queue[i]; | |
2419 | ||
6e7e027f | 2420 | if (pair->status != 'A' && pair->status != 'R') |
e95ab70a EN |
2421 | continue; |
2422 | dir_rename_ent = check_dir_renamed(pair->two->path, | |
2423 | dir_renames); | |
2424 | if (!dir_rename_ent) | |
2425 | continue; | |
2426 | ||
2427 | new_path = apply_dir_rename(dir_rename_ent, pair->two->path); | |
2428 | if (!new_path) | |
2429 | /* | |
2430 | * dir_rename_ent->non_unique_new_path is true, which | |
2431 | * means there is no directory rename for us to use, | |
2432 | * which means it won't cause us any additional | |
2433 | * collisions. | |
2434 | */ | |
2435 | continue; | |
2436 | collision_ent = collision_find_entry(collisions, new_path); | |
2437 | if (!collision_ent) { | |
2438 | collision_ent = xcalloc(1, | |
2439 | sizeof(struct collision_entry)); | |
d22245a2 EW |
2440 | hashmap_entry_init(&collision_ent->ent, |
2441 | strhash(new_path)); | |
26b455f2 | 2442 | hashmap_put(collisions, &collision_ent->ent); |
e95ab70a EN |
2443 | collision_ent->target_file = new_path; |
2444 | } else { | |
2445 | free(new_path); | |
2446 | } | |
2447 | string_list_insert(&collision_ent->source_files, | |
2448 | pair->two->path); | |
2449 | } | |
2450 | } | |
2451 | ||
259ccb6c | 2452 | static char *check_for_directory_rename(struct merge_options *opt, |
f6f77559 EN |
2453 | const char *path, |
2454 | struct tree *tree, | |
2455 | struct hashmap *dir_renames, | |
2456 | struct hashmap *dir_rename_exclusions, | |
2457 | struct hashmap *collisions, | |
2458 | int *clean_merge) | |
2459 | { | |
2460 | char *new_path = NULL; | |
2461 | struct dir_rename_entry *entry = check_dir_renamed(path, dir_renames); | |
2462 | struct dir_rename_entry *oentry = NULL; | |
2463 | ||
2464 | if (!entry) | |
2465 | return new_path; | |
2466 | ||
2467 | /* | |
2468 | * This next part is a little weird. We do not want to do an | |
2469 | * implicit rename into a directory we renamed on our side, because | |
2470 | * that will result in a spurious rename/rename(1to2) conflict. An | |
2471 | * example: | |
2472 | * Base commit: dumbdir/afile, otherdir/bfile | |
2473 | * Side 1: smrtdir/afile, otherdir/bfile | |
2474 | * Side 2: dumbdir/afile, dumbdir/bfile | |
2475 | * Here, while working on Side 1, we could notice that otherdir was | |
2476 | * renamed/merged to dumbdir, and change the diff_filepair for | |
2477 | * otherdir/bfile into a rename into dumbdir/bfile. However, Side | |
2478 | * 2 will notice the rename from dumbdir to smrtdir, and do the | |
2479 | * transitive rename to move it from dumbdir/bfile to | |
2480 | * smrtdir/bfile. That gives us bfile in dumbdir vs being in | |
2481 | * smrtdir, a rename/rename(1to2) conflict. We really just want | |
2482 | * the file to end up in smrtdir. And the way to achieve that is | |
2483 | * to not let Side1 do the rename to dumbdir, since we know that is | |
2484 | * the source of one of our directory renames. | |
2485 | * | |
2486 | * That's why oentry and dir_rename_exclusions is here. | |
2487 | * | |
2488 | * As it turns out, this also prevents N-way transient rename | |
2489 | * confusion; See testcases 9c and 9d of t6043. | |
2490 | */ | |
2491 | oentry = dir_rename_find_entry(dir_rename_exclusions, entry->new_dir.buf); | |
2492 | if (oentry) { | |
259ccb6c | 2493 | output(opt, 1, _("WARNING: Avoiding applying %s -> %s rename " |
f6f77559 EN |
2494 | "to %s, because %s itself was renamed."), |
2495 | entry->dir, entry->new_dir.buf, path, entry->new_dir.buf); | |
2496 | } else { | |
259ccb6c | 2497 | new_path = handle_path_level_conflicts(opt, path, entry, |
f6f77559 EN |
2498 | collisions, tree); |
2499 | *clean_merge &= (new_path != NULL); | |
2500 | } | |
2501 | ||
2502 | return new_path; | |
2503 | } | |
2504 | ||
259ccb6c | 2505 | static void apply_directory_rename_modifications(struct merge_options *opt, |
9c0743fe EN |
2506 | struct diff_filepair *pair, |
2507 | char *new_path, | |
2508 | struct rename *re, | |
2509 | struct tree *tree, | |
2510 | struct tree *o_tree, | |
2511 | struct tree *a_tree, | |
2512 | struct tree *b_tree, | |
b53c5028 | 2513 | struct string_list *entries) |
9c0743fe EN |
2514 | { |
2515 | struct string_list_item *item; | |
2516 | int stage = (tree == a_tree ? 2 : 3); | |
18797a3b | 2517 | int update_wd; |
9c0743fe EN |
2518 | |
2519 | /* | |
2520 | * In all cases where we can do directory rename detection, | |
2521 | * unpack_trees() will have read pair->two->path into the | |
2522 | * index and the working copy. We need to remove it so that | |
2523 | * we can instead place it at new_path. It is guaranteed to | |
2524 | * not be untracked (unpack_trees() would have errored out | |
2525 | * saying the file would have been overwritten), but it might | |
2526 | * be dirty, though. | |
2527 | */ | |
259ccb6c | 2528 | update_wd = !was_dirty(opt, pair->two->path); |
18797a3b | 2529 | if (!update_wd) |
259ccb6c | 2530 | output(opt, 1, _("Refusing to lose dirty file at %s"), |
18797a3b | 2531 | pair->two->path); |
259ccb6c | 2532 | remove_file(opt, 1, pair->two->path, !update_wd); |
9c0743fe EN |
2533 | |
2534 | /* Find or create a new re->dst_entry */ | |
2535 | item = string_list_lookup(entries, new_path); | |
2536 | if (item) { | |
2537 | /* | |
2538 | * Since we're renaming on this side of history, and it's | |
2539 | * due to a directory rename on the other side of history | |
2540 | * (which we only allow when the directory in question no | |
2541 | * longer exists on the other side of history), the | |
2542 | * original entry for re->dst_entry is no longer | |
2543 | * necessary... | |
2544 | */ | |
2545 | re->dst_entry->processed = 1; | |
2546 | ||
2547 | /* | |
2548 | * ...because we'll be using this new one. | |
2549 | */ | |
2550 | re->dst_entry = item->util; | |
2551 | } else { | |
2552 | /* | |
2553 | * re->dst_entry is for the before-dir-rename path, and we | |
2554 | * need it to hold information for the after-dir-rename | |
2555 | * path. Before creating a new entry, we need to mark the | |
2556 | * old one as unnecessary (...unless it is shared by | |
2557 | * src_entry, i.e. this didn't use to be a rename, in which | |
2558 | * case we can just allow the normal processing to happen | |
2559 | * for it). | |
2560 | */ | |
2561 | if (pair->status == 'R') | |
2562 | re->dst_entry->processed = 1; | |
2563 | ||
34e7771b | 2564 | re->dst_entry = insert_stage_data(opt->repo, new_path, |
9c0743fe EN |
2565 | o_tree, a_tree, b_tree, |
2566 | entries); | |
2567 | item = string_list_insert(entries, new_path); | |
2568 | item->util = re->dst_entry; | |
2569 | } | |
2570 | ||
2571 | /* | |
2572 | * Update the stage_data with the information about the path we are | |
2573 | * moving into place. That slot will be empty and available for us | |
2574 | * to write to because of the collision checks in | |
2575 | * handle_path_level_conflicts(). In other words, | |
2576 | * re->dst_entry->stages[stage].oid will be the null_oid, so it's | |
2577 | * open for us to write to. | |
2578 | * | |
2579 | * It may be tempting to actually update the index at this point as | |
2580 | * well, using update_stages_for_stage_data(), but as per the big | |
2581 | * "NOTE" in update_stages(), doing so will modify the current | |
2582 | * in-memory index which will break calls to would_lose_untracked() | |
2583 | * that we need to make. Instead, we need to just make sure that | |
8ebe7b05 | 2584 | * the various handle_rename_*() functions update the index |
9c0743fe EN |
2585 | * explicitly rather than relying on unpack_trees() to have done it. |
2586 | */ | |
50ddb089 NTND |
2587 | get_tree_entry(opt->repo, |
2588 | &tree->object.oid, | |
9c0743fe EN |
2589 | pair->two->path, |
2590 | &re->dst_entry->stages[stage].oid, | |
2591 | &re->dst_entry->stages[stage].mode); | |
2592 | ||
6d169fd3 EN |
2593 | /* |
2594 | * Record the original change status (or 'type' of change). If it | |
2595 | * was originally an add ('A'), this lets us differentiate later | |
2596 | * between a RENAME_DELETE conflict and RENAME_VIA_DIR (they | |
2597 | * otherwise look the same). If it was originally a rename ('R'), | |
2598 | * this lets us remember and report accurately about the transitive | |
2599 | * renaming that occurred via the directory rename detection. Also, | |
2600 | * record the original destination name. | |
2601 | */ | |
2602 | re->dir_rename_original_type = pair->status; | |
2603 | re->dir_rename_original_dest = pair->two->path; | |
2604 | ||
9c0743fe EN |
2605 | /* |
2606 | * We don't actually look at pair->status again, but it seems | |
2607 | * pedagogically correct to adjust it. | |
2608 | */ | |
2609 | pair->status = 'R'; | |
2610 | ||
2611 | /* | |
2612 | * Finally, record the new location. | |
2613 | */ | |
2614 | pair->two->path = new_path; | |
2615 | } | |
2616 | ||
e5257b2a EN |
2617 | /* |
2618 | * Get information of all renames which occurred in 'pairs', making use of | |
2619 | * any implicit directory renames inferred from the other side of history. | |
2620 | * We need the three trees in the merge ('o_tree', 'a_tree' and 'b_tree') | |
2621 | * to be able to associate the correct cache entries with the rename | |
2622 | * information; tree is always equal to either a_tree or b_tree. | |
2623 | */ | |
259ccb6c | 2624 | static struct string_list *get_renames(struct merge_options *opt, |
c336ab85 | 2625 | const char *branch, |
e5257b2a | 2626 | struct diff_queue_struct *pairs, |
e95ab70a | 2627 | struct hashmap *dir_renames, |
f6f77559 | 2628 | struct hashmap *dir_rename_exclusions, |
e5257b2a EN |
2629 | struct tree *tree, |
2630 | struct tree *o_tree, | |
2631 | struct tree *a_tree, | |
2632 | struct tree *b_tree, | |
f6f77559 EN |
2633 | struct string_list *entries, |
2634 | int *clean_merge) | |
e5257b2a EN |
2635 | { |
2636 | int i; | |
e95ab70a EN |
2637 | struct hashmap collisions; |
2638 | struct hashmap_iter iter; | |
2639 | struct collision_entry *e; | |
e5257b2a EN |
2640 | struct string_list *renames; |
2641 | ||
e95ab70a | 2642 | compute_collisions(&collisions, dir_renames, pairs); |
e5257b2a EN |
2643 | renames = xcalloc(1, sizeof(struct string_list)); |
2644 | ||
2645 | for (i = 0; i < pairs->nr; ++i) { | |
9ba91557 EN |
2646 | struct string_list_item *item; |
2647 | struct rename *re; | |
e5257b2a | 2648 | struct diff_filepair *pair = pairs->queue[i]; |
f6f77559 | 2649 | char *new_path; /* non-NULL only with directory renames */ |
9ba91557 | 2650 | |
6e7e027f | 2651 | if (pair->status != 'A' && pair->status != 'R') { |
9ba91557 EN |
2652 | diff_free_filepair(pair); |
2653 | continue; | |
2654 | } | |
259ccb6c | 2655 | new_path = check_for_directory_rename(opt, pair->two->path, tree, |
f6f77559 EN |
2656 | dir_renames, |
2657 | dir_rename_exclusions, | |
2658 | &collisions, | |
2659 | clean_merge); | |
2660 | if (pair->status != 'R' && !new_path) { | |
2661 | diff_free_filepair(pair); | |
2662 | continue; | |
2663 | } | |
2664 | ||
9ba91557 EN |
2665 | re = xmalloc(sizeof(*re)); |
2666 | re->processed = 0; | |
2667 | re->pair = pair; | |
c336ab85 | 2668 | re->branch = branch; |
6d169fd3 EN |
2669 | re->dir_rename_original_type = '\0'; |
2670 | re->dir_rename_original_dest = NULL; | |
9ba91557 EN |
2671 | item = string_list_lookup(entries, re->pair->one->path); |
2672 | if (!item) | |
34e7771b NTND |
2673 | re->src_entry = insert_stage_data(opt->repo, |
2674 | re->pair->one->path, | |
9ba91557 EN |
2675 | o_tree, a_tree, b_tree, entries); |
2676 | else | |
2677 | re->src_entry = item->util; | |
2678 | ||
2679 | item = string_list_lookup(entries, re->pair->two->path); | |
2680 | if (!item) | |
34e7771b NTND |
2681 | re->dst_entry = insert_stage_data(opt->repo, |
2682 | re->pair->two->path, | |
9ba91557 EN |
2683 | o_tree, a_tree, b_tree, entries); |
2684 | else | |
2685 | re->dst_entry = item->util; | |
2686 | item = string_list_insert(renames, pair->one->path); | |
2687 | item->util = re; | |
9c0743fe | 2688 | if (new_path) |
259ccb6c | 2689 | apply_directory_rename_modifications(opt, pair, new_path, |
9c0743fe EN |
2690 | re, tree, o_tree, |
2691 | a_tree, b_tree, | |
b53c5028 | 2692 | entries); |
9ba91557 | 2693 | } |
e95ab70a | 2694 | |
87571c3f | 2695 | hashmap_for_each_entry(&collisions, &iter, e, |
87571c3f | 2696 | ent /* member name */) { |
e95ab70a EN |
2697 | free(e->target_file); |
2698 | string_list_clear(&e->source_files, 0); | |
2699 | } | |
c8e424c9 | 2700 | hashmap_free_entries(&collisions, struct collision_entry, ent); |
9ba91557 EN |
2701 | return renames; |
2702 | } | |
2703 | ||
259ccb6c | 2704 | static int process_renames(struct merge_options *opt, |
8a2fce18 MV |
2705 | struct string_list *a_renames, |
2706 | struct string_list *b_renames) | |
9047ebbc MV |
2707 | { |
2708 | int clean_merge = 1, i, j; | |
183113a5 TF |
2709 | struct string_list a_by_dst = STRING_LIST_INIT_NODUP; |
2710 | struct string_list b_by_dst = STRING_LIST_INIT_NODUP; | |
9047ebbc MV |
2711 | const struct rename *sre; |
2712 | ||
2713 | for (i = 0; i < a_renames->nr; i++) { | |
2714 | sre = a_renames->items[i].util; | |
78a395d3 | 2715 | string_list_insert(&a_by_dst, sre->pair->two->path)->util |
0a6b8712 | 2716 | = (void *)sre; |
9047ebbc MV |
2717 | } |
2718 | for (i = 0; i < b_renames->nr; i++) { | |
2719 | sre = b_renames->items[i].util; | |
78a395d3 | 2720 | string_list_insert(&b_by_dst, sre->pair->two->path)->util |
0a6b8712 | 2721 | = (void *)sre; |
9047ebbc MV |
2722 | } |
2723 | ||
2724 | for (i = 0, j = 0; i < a_renames->nr || j < b_renames->nr;) { | |
8e24cbae | 2725 | struct string_list *renames1, *renames2Dst; |
9047ebbc | 2726 | struct rename *ren1 = NULL, *ren2 = NULL; |
9047ebbc | 2727 | const char *ren1_src, *ren1_dst; |
461f5041 | 2728 | struct string_list_item *lookup; |
9047ebbc MV |
2729 | |
2730 | if (i >= a_renames->nr) { | |
9047ebbc MV |
2731 | ren2 = b_renames->items[j++].util; |
2732 | } else if (j >= b_renames->nr) { | |
9047ebbc MV |
2733 | ren1 = a_renames->items[i++].util; |
2734 | } else { | |
8e24cbae BK |
2735 | int compare = strcmp(a_renames->items[i].string, |
2736 | b_renames->items[j].string); | |
9047ebbc MV |
2737 | if (compare <= 0) |
2738 | ren1 = a_renames->items[i++].util; | |
2739 | if (compare >= 0) | |
2740 | ren2 = b_renames->items[j++].util; | |
2741 | } | |
2742 | ||
2743 | /* TODO: refactor, so that 1/2 are not needed */ | |
2744 | if (ren1) { | |
2745 | renames1 = a_renames; | |
9047ebbc | 2746 | renames2Dst = &b_by_dst; |
9047ebbc | 2747 | } else { |
9047ebbc | 2748 | renames1 = b_renames; |
9047ebbc | 2749 | renames2Dst = &a_by_dst; |
35d803bc | 2750 | SWAP(ren2, ren1); |
9047ebbc | 2751 | } |
9047ebbc | 2752 | |
9047ebbc MV |
2753 | if (ren1->processed) |
2754 | continue; | |
2755 | ren1->processed = 1; | |
9047ebbc | 2756 | ren1->dst_entry->processed = 1; |
7769a75e EN |
2757 | /* BUG: We should only mark src_entry as processed if we |
2758 | * are not dealing with a rename + add-source case. | |
2759 | */ | |
9047ebbc | 2760 | ren1->src_entry->processed = 1; |
9047ebbc MV |
2761 | |
2762 | ren1_src = ren1->pair->one->path; | |
2763 | ren1_dst = ren1->pair->two->path; | |
2764 | ||
2765 | if (ren2) { | |
461f5041 | 2766 | /* One file renamed on both sides */ |
9047ebbc MV |
2767 | const char *ren2_src = ren2->pair->one->path; |
2768 | const char *ren2_dst = ren2->pair->two->path; | |
4f66dade | 2769 | enum rename_type rename_type; |
9047ebbc | 2770 | if (strcmp(ren1_src, ren2_src) != 0) |
033abf97 | 2771 | BUG("ren1_src != ren2_src"); |
9047ebbc MV |
2772 | ren2->dst_entry->processed = 1; |
2773 | ren2->processed = 1; | |
2774 | if (strcmp(ren1_dst, ren2_dst) != 0) { | |
4f66dade | 2775 | rename_type = RENAME_ONE_FILE_TO_TWO; |
461f5041 | 2776 | clean_merge = 0; |
9047ebbc | 2777 | } else { |
4f66dade | 2778 | rename_type = RENAME_ONE_FILE_TO_ONE; |
7769a75e EN |
2779 | /* BUG: We should only remove ren1_src in |
2780 | * the base stage (think of rename + | |
2781 | * add-source cases). | |
2782 | */ | |
259ccb6c | 2783 | remove_file(opt, 1, ren1_src, 1); |
b8ddf164 EN |
2784 | update_entry(ren1->dst_entry, |
2785 | ren1->pair->one, | |
2786 | ren1->pair->two, | |
2787 | ren2->pair->two); | |
9047ebbc | 2788 | } |
c336ab85 | 2789 | setup_rename_conflict_info(rename_type, opt, ren1, ren2); |
461f5041 EN |
2790 | } else if ((lookup = string_list_lookup(renames2Dst, ren1_dst))) { |
2791 | /* Two different files renamed to the same thing */ | |
2792 | char *ren2_dst; | |
2793 | ren2 = lookup->util; | |
2794 | ren2_dst = ren2->pair->two->path; | |
2795 | if (strcmp(ren1_dst, ren2_dst) != 0) | |
033abf97 | 2796 | BUG("ren1_dst != ren2_dst"); |
461f5041 EN |
2797 | |
2798 | clean_merge = 0; | |
2799 | ren2->processed = 1; | |
2800 | /* | |
2801 | * BUG: We should only mark src_entry as processed | |
2802 | * if we are not dealing with a rename + add-source | |
2803 | * case. | |
2804 | */ | |
2805 | ren2->src_entry->processed = 1; | |
2806 | ||
2807 | setup_rename_conflict_info(RENAME_TWO_FILES_TO_ONE, | |
c336ab85 | 2808 | opt, ren1, ren2); |
9047ebbc MV |
2809 | } else { |
2810 | /* Renamed in 1, maybe changed in 2 */ | |
9047ebbc MV |
2811 | /* we only use sha1 and mode of these */ |
2812 | struct diff_filespec src_other, dst_other; | |
41d70bd6 | 2813 | int try_merge; |
9047ebbc | 2814 | |
41d70bd6 EN |
2815 | /* |
2816 | * unpack_trees loads entries from common-commit | |
2817 | * into stage 1, from head-commit into stage 2, and | |
2818 | * from merge-commit into stage 3. We keep track | |
2819 | * of which side corresponds to the rename. | |
2820 | */ | |
2821 | int renamed_stage = a_renames == renames1 ? 2 : 3; | |
2822 | int other_stage = a_renames == renames1 ? 3 : 2; | |
9047ebbc | 2823 | |
7769a75e EN |
2824 | /* BUG: We should only remove ren1_src in the base |
2825 | * stage and in other_stage (think of rename + | |
2826 | * add-source case). | |
2827 | */ | |
259ccb6c EN |
2828 | remove_file(opt, 1, ren1_src, |
2829 | renamed_stage == 2 || !was_tracked(opt, ren1_src)); | |
9047ebbc | 2830 | |
fd429e98 | 2831 | oidcpy(&src_other.oid, |
2832 | &ren1->src_entry->stages[other_stage].oid); | |
41d70bd6 | 2833 | src_other.mode = ren1->src_entry->stages[other_stage].mode; |
fd429e98 | 2834 | oidcpy(&dst_other.oid, |
2835 | &ren1->dst_entry->stages[other_stage].oid); | |
41d70bd6 | 2836 | dst_other.mode = ren1->dst_entry->stages[other_stage].mode; |
9047ebbc MV |
2837 | try_merge = 0; |
2838 | ||
763a59e7 | 2839 | if (oideq(&src_other.oid, &null_oid) && |
6d169fd3 | 2840 | ren1->dir_rename_original_type == 'A') { |
5455c338 | 2841 | setup_rename_conflict_info(RENAME_VIA_DIR, |
c336ab85 | 2842 | opt, ren1, NULL); |
763a59e7 | 2843 | } else if (oideq(&src_other.oid, &null_oid)) { |
4f66dade | 2844 | setup_rename_conflict_info(RENAME_DELETE, |
c336ab85 | 2845 | opt, ren1, NULL); |
d5af5105 | 2846 | } else if ((dst_other.mode == ren1->pair->two->mode) && |
763a59e7 | 2847 | oideq(&dst_other.oid, &ren1->pair->two->oid)) { |
35a74abf EN |
2848 | /* |
2849 | * Added file on the other side identical to | |
2850 | * the file being renamed: clean merge. | |
2851 | * Also, there is no need to overwrite the | |
2852 | * file already in the working copy, so call | |
2853 | * update_file_flags() instead of | |
2854 | * update_file(). | |
2855 | */ | |
259ccb6c | 2856 | if (update_file_flags(opt, |
8daec1df | 2857 | ren1->pair->two, |
75456f96 JS |
2858 | ren1_dst, |
2859 | 1, /* update_cache */ | |
2860 | 0 /* update_wd */)) | |
2861 | clean_merge = -1; | |
763a59e7 | 2862 | } else if (!oideq(&dst_other.oid, &null_oid)) { |
7f867165 EN |
2863 | /* |
2864 | * Probably not a clean merge, but it's | |
2865 | * premature to set clean_merge to 0 here, | |
2866 | * because if the rename merges cleanly and | |
2867 | * the merge exactly matches the newly added | |
2868 | * file, then the merge will be clean. | |
2869 | */ | |
2870 | setup_rename_conflict_info(RENAME_ADD, | |
c336ab85 | 2871 | opt, ren1, NULL); |
9047ebbc MV |
2872 | } else |
2873 | try_merge = 1; | |
2874 | ||
75456f96 JS |
2875 | if (clean_merge < 0) |
2876 | goto cleanup_and_return; | |
9047ebbc | 2877 | if (try_merge) { |
e3de888c | 2878 | struct diff_filespec *o, *a, *b; |
9047ebbc MV |
2879 | src_other.path = (char *)ren1_src; |
2880 | ||
e3de888c | 2881 | o = ren1->pair->one; |
9047ebbc MV |
2882 | if (a_renames == renames1) { |
2883 | a = ren1->pair->two; | |
2884 | b = &src_other; | |
2885 | } else { | |
2886 | b = ren1->pair->two; | |
2887 | a = &src_other; | |
2888 | } | |
e3de888c | 2889 | update_entry(ren1->dst_entry, o, a, b); |
4f66dade | 2890 | setup_rename_conflict_info(RENAME_NORMAL, |
c336ab85 | 2891 | opt, ren1, NULL); |
9047ebbc MV |
2892 | } |
2893 | } | |
2894 | } | |
75456f96 | 2895 | cleanup_and_return: |
9047ebbc MV |
2896 | string_list_clear(&a_by_dst, 0); |
2897 | string_list_clear(&b_by_dst, 0); | |
2898 | ||
2899 | return clean_merge; | |
2900 | } | |
2901 | ||
f172589e EN |
2902 | struct rename_info { |
2903 | struct string_list *head_renames; | |
2904 | struct string_list *merge_renames; | |
2905 | }; | |
2906 | ||
7fe40b88 EN |
2907 | static void initial_cleanup_rename(struct diff_queue_struct *pairs, |
2908 | struct hashmap *dir_renames) | |
ffc16c49 | 2909 | { |
7fe40b88 EN |
2910 | struct hashmap_iter iter; |
2911 | struct dir_rename_entry *e; | |
2912 | ||
87571c3f | 2913 | hashmap_for_each_entry(dir_renames, &iter, e, |
87571c3f | 2914 | ent /* member name */) { |
7fe40b88 EN |
2915 | free(e->dir); |
2916 | strbuf_release(&e->new_dir); | |
2917 | /* possible_new_dirs already cleared in get_directory_renames */ | |
2918 | } | |
c8e424c9 | 2919 | hashmap_free_entries(dir_renames, struct dir_rename_entry, ent); |
7fe40b88 EN |
2920 | free(dir_renames); |
2921 | ||
ffc16c49 EN |
2922 | free(pairs->queue); |
2923 | free(pairs); | |
2924 | } | |
2925 | ||
259ccb6c | 2926 | static int detect_and_process_renames(struct merge_options *opt, |
8ebe7b05 EN |
2927 | struct tree *common, |
2928 | struct tree *head, | |
2929 | struct tree *merge, | |
2930 | struct string_list *entries, | |
2931 | struct rename_info *ri) | |
f172589e | 2932 | { |
e5257b2a | 2933 | struct diff_queue_struct *head_pairs, *merge_pairs; |
7fe40b88 | 2934 | struct hashmap *dir_re_head, *dir_re_merge; |
f6f77559 | 2935 | int clean = 1; |
e5257b2a | 2936 | |
3992ff0c EN |
2937 | ri->head_renames = NULL; |
2938 | ri->merge_renames = NULL; | |
2939 | ||
259ccb6c | 2940 | if (!merge_detect_rename(opt)) |
3992ff0c EN |
2941 | return 1; |
2942 | ||
259ccb6c EN |
2943 | head_pairs = get_diffpairs(opt, common, head); |
2944 | merge_pairs = get_diffpairs(opt, common, merge); | |
e5257b2a | 2945 | |
8e012516 DS |
2946 | if ((opt->detect_directory_renames == MERGE_DIRECTORY_RENAMES_TRUE) || |
2947 | (opt->detect_directory_renames == MERGE_DIRECTORY_RENAMES_CONFLICT && | |
5bf7e577 | 2948 | !opt->priv->call_depth)) { |
b53c5028 JK |
2949 | dir_re_head = get_directory_renames(head_pairs); |
2950 | dir_re_merge = get_directory_renames(merge_pairs); | |
7fe40b88 | 2951 | |
259ccb6c | 2952 | handle_directory_level_conflicts(opt, |
5fdddd9b EN |
2953 | dir_re_head, head, |
2954 | dir_re_merge, merge); | |
2955 | } else { | |
2956 | dir_re_head = xmalloc(sizeof(*dir_re_head)); | |
2957 | dir_re_merge = xmalloc(sizeof(*dir_re_merge)); | |
2958 | dir_rename_init(dir_re_head); | |
2959 | dir_rename_init(dir_re_merge); | |
2960 | } | |
96e7ffbd | 2961 | |
c336ab85 | 2962 | ri->head_renames = get_renames(opt, opt->branch1, head_pairs, |
f6f77559 EN |
2963 | dir_re_merge, dir_re_head, head, |
2964 | common, head, merge, entries, | |
2965 | &clean); | |
2966 | if (clean < 0) | |
2967 | goto cleanup; | |
c336ab85 | 2968 | ri->merge_renames = get_renames(opt, opt->branch2, merge_pairs, |
f6f77559 EN |
2969 | dir_re_head, dir_re_merge, merge, |
2970 | common, head, merge, entries, | |
2971 | &clean); | |
2972 | if (clean < 0) | |
2973 | goto cleanup; | |
259ccb6c | 2974 | clean &= process_renames(opt, ri->head_renames, ri->merge_renames); |
f6f77559 EN |
2975 | |
2976 | cleanup: | |
e5257b2a EN |
2977 | /* |
2978 | * Some cleanup is deferred until cleanup_renames() because the | |
2979 | * data structures are still needed and referenced in | |
2980 | * process_entry(). But there are a few things we can free now. | |
2981 | */ | |
7fe40b88 EN |
2982 | initial_cleanup_rename(head_pairs, dir_re_head); |
2983 | initial_cleanup_rename(merge_pairs, dir_re_merge); | |
e5257b2a EN |
2984 | |
2985 | return clean; | |
f172589e EN |
2986 | } |
2987 | ||
ffc16c49 | 2988 | static void final_cleanup_rename(struct string_list *rename) |
f172589e | 2989 | { |
9cfee25a EN |
2990 | const struct rename *re; |
2991 | int i; | |
f172589e | 2992 | |
3992ff0c EN |
2993 | if (rename == NULL) |
2994 | return; | |
2995 | ||
9cfee25a EN |
2996 | for (i = 0; i < rename->nr; i++) { |
2997 | re = rename->items[i].util; | |
2998 | diff_free_filepair(re->pair); | |
2999 | } | |
3000 | string_list_clear(rename, 1); | |
3001 | free(rename); | |
3002 | } | |
3003 | ||
ffc16c49 | 3004 | static void final_cleanup_renames(struct rename_info *re_info) |
9cfee25a | 3005 | { |
ffc16c49 EN |
3006 | final_cleanup_rename(re_info->head_renames); |
3007 | final_cleanup_rename(re_info->merge_renames); | |
f172589e EN |
3008 | } |
3009 | ||
259ccb6c | 3010 | static int read_oid_strbuf(struct merge_options *opt, |
d90e759f EN |
3011 | const struct object_id *oid, |
3012 | struct strbuf *dst) | |
331a1838 EB |
3013 | { |
3014 | void *buf; | |
3015 | enum object_type type; | |
3016 | unsigned long size; | |
b4f5aca4 | 3017 | buf = read_object_file(oid, &type, &size); |
331a1838 | 3018 | if (!buf) |
259ccb6c | 3019 | return err(opt, _("cannot read object %s"), oid_to_hex(oid)); |
331a1838 EB |
3020 | if (type != OBJ_BLOB) { |
3021 | free(buf); | |
259ccb6c | 3022 | return err(opt, _("object %s is not a blob"), oid_to_hex(oid)); |
331a1838 EB |
3023 | } |
3024 | strbuf_attach(dst, buf, size, size + 1); | |
3025 | return 0; | |
3026 | } | |
3027 | ||
bc9204d4 | 3028 | static int blob_unchanged(struct merge_options *opt, |
8daec1df EN |
3029 | const struct diff_filespec *o, |
3030 | const struct diff_filespec *a, | |
3e7589b7 | 3031 | int renormalize, const char *path) |
331a1838 | 3032 | { |
93a02c55 EN |
3033 | struct strbuf obuf = STRBUF_INIT; |
3034 | struct strbuf abuf = STRBUF_INIT; | |
331a1838 | 3035 | int ret = 0; /* assume changed for safety */ |
93a02c55 | 3036 | const struct index_state *idx = opt->repo->index; |
331a1838 | 3037 | |
8daec1df | 3038 | if (a->mode != o->mode) |
72fac66b | 3039 | return 0; |
763a59e7 | 3040 | if (oideq(&o->oid, &a->oid)) |
331a1838 | 3041 | return 1; |
3e7589b7 | 3042 | if (!renormalize) |
331a1838 EB |
3043 | return 0; |
3044 | ||
8daec1df EN |
3045 | if (read_oid_strbuf(opt, &o->oid, &obuf) || |
3046 | read_oid_strbuf(opt, &a->oid, &abuf)) | |
331a1838 EB |
3047 | goto error_return; |
3048 | /* | |
3049 | * Note: binary | is used so that both renormalizations are | |
3050 | * performed. Comparison can be skipped if both files are | |
3051 | * unchanged since their sha1s have already been compared. | |
3052 | */ | |
93a02c55 EN |
3053 | if (renormalize_buffer(idx, path, obuf.buf, obuf.len, &obuf) | |
3054 | renormalize_buffer(idx, path, abuf.buf, abuf.len, &abuf)) | |
3055 | ret = (obuf.len == abuf.len && !memcmp(obuf.buf, abuf.buf, obuf.len)); | |
331a1838 EB |
3056 | |
3057 | error_return: | |
93a02c55 EN |
3058 | strbuf_release(&obuf); |
3059 | strbuf_release(&abuf); | |
331a1838 EB |
3060 | return ret; |
3061 | } | |
3062 | ||
259ccb6c | 3063 | static int handle_modify_delete(struct merge_options *opt, |
d90e759f | 3064 | const char *path, |
8daec1df EN |
3065 | const struct diff_filespec *o, |
3066 | const struct diff_filespec *a, | |
3067 | const struct diff_filespec *b) | |
5e3ce663 | 3068 | { |
b26d87f2 | 3069 | const char *modify_branch, *delete_branch; |
8daec1df | 3070 | const struct diff_filespec *changed; |
b26d87f2 | 3071 | |
8daec1df | 3072 | if (is_valid(a)) { |
259ccb6c EN |
3073 | modify_branch = opt->branch1; |
3074 | delete_branch = opt->branch2; | |
8daec1df | 3075 | changed = a; |
b26d87f2 | 3076 | } else { |
259ccb6c EN |
3077 | modify_branch = opt->branch2; |
3078 | delete_branch = opt->branch1; | |
8daec1df | 3079 | changed = b; |
b26d87f2 MM |
3080 | } |
3081 | ||
259ccb6c | 3082 | return handle_change_delete(opt, |
b26d87f2 | 3083 | path, NULL, |
8daec1df | 3084 | o, changed, |
b26d87f2 | 3085 | modify_branch, delete_branch, |
75456f96 | 3086 | _("modify"), _("modified")); |
5e3ce663 EN |
3087 | } |
3088 | ||
e62d1123 EN |
3089 | static int handle_content_merge(struct merge_file_info *mfi, |
3090 | struct merge_options *opt, | |
d9573556 EN |
3091 | const char *path, |
3092 | int is_dirty, | |
8daec1df EN |
3093 | const struct diff_filespec *o, |
3094 | const struct diff_filespec *a, | |
3095 | const struct diff_filespec *b, | |
043622b2 | 3096 | struct rename_conflict_info *ci) |
0c4918d1 | 3097 | { |
55653a68 | 3098 | const char *reason = _("content"); |
4ab9a157 | 3099 | unsigned df_conflict_remains = 0; |
0c4918d1 | 3100 | |
8daec1df | 3101 | if (!is_valid(o)) |
55653a68 | 3102 | reason = _("add/add"); |
8daec1df EN |
3103 | |
3104 | assert(o->path && a->path && b->path); | |
5bf7e577 | 3105 | if (ci && dir_in_way(opt->repo->index, path, !opt->priv->call_depth, |
8daec1df EN |
3106 | S_ISGITLINK(ci->ren1->pair->two->mode))) |
3107 | df_conflict_remains = 1; | |
3108 | ||
3109 | if (merge_mode_and_contents(opt, o, a, b, path, | |
259ccb6c | 3110 | opt->branch1, opt->branch2, |
5bf7e577 | 3111 | opt->priv->call_depth * 2, mfi)) |
3c8a51e8 | 3112 | return -1; |
4ab9a157 | 3113 | |
1de70dbd EN |
3114 | /* |
3115 | * We can skip updating the working tree file iff: | |
3116 | * a) The merge is clean | |
3117 | * b) The merge matches what was in HEAD (content, mode, pathname) | |
3118 | * c) The target path is usable (i.e. not involved in D/F conflict) | |
3119 | */ | |
e62d1123 | 3120 | if (mfi->clean && was_tracked_and_matches(opt, path, &mfi->blob) && |
1de70dbd | 3121 | !df_conflict_remains) { |
2b75fb60 EN |
3122 | int pos; |
3123 | struct cache_entry *ce; | |
3124 | ||
259ccb6c | 3125 | output(opt, 3, _("Skipped %s (merged same as existing)"), path); |
e62d1123 | 3126 | if (add_cacheinfo(opt, &mfi->blob, path, |
5bf7e577 | 3127 | 0, (!opt->priv->call_depth && !is_dirty), 0)) |
1de70dbd | 3128 | return -1; |
2b75fb60 EN |
3129 | /* |
3130 | * However, add_cacheinfo() will delete the old cache entry | |
3131 | * and add a new one. We need to copy over any skip_worktree | |
3132 | * flag to avoid making the file appear as if it were | |
3133 | * deleted by the user. | |
3134 | */ | |
5bf7e577 EN |
3135 | pos = index_name_pos(&opt->priv->orig_index, path, strlen(path)); |
3136 | ce = opt->priv->orig_index.cache[pos]; | |
2b75fb60 | 3137 | if (ce_skip_worktree(ce)) { |
259ccb6c EN |
3138 | pos = index_name_pos(opt->repo->index, path, strlen(path)); |
3139 | ce = opt->repo->index->cache[pos]; | |
2b75fb60 EN |
3140 | ce->ce_flags |= CE_SKIP_WORKTREE; |
3141 | } | |
e62d1123 | 3142 | return mfi->clean; |
05cf21eb | 3143 | } |
0c4918d1 | 3144 | |
e62d1123 EN |
3145 | if (!mfi->clean) { |
3146 | if (S_ISGITLINK(mfi->blob.mode)) | |
55653a68 | 3147 | reason = _("submodule"); |
259ccb6c | 3148 | output(opt, 1, _("CONFLICT (%s): Merge conflict in %s"), |
0c4918d1 | 3149 | reason, path); |
043622b2 | 3150 | if (ci && !df_conflict_remains) |
8daec1df | 3151 | if (update_stages(opt, path, o, a, b)) |
75456f96 | 3152 | return -1; |
0c4918d1 EN |
3153 | } |
3154 | ||
bd42380e | 3155 | if (df_conflict_remains || is_dirty) { |
3d6b8e88 | 3156 | char *new_path; |
5bf7e577 | 3157 | if (opt->priv->call_depth) { |
259ccb6c | 3158 | remove_file_from_index(opt->repo->index, path); |
51931bf0 | 3159 | } else { |
e62d1123 | 3160 | if (!mfi->clean) { |
8daec1df | 3161 | if (update_stages(opt, path, o, a, b)) |
75456f96 JS |
3162 | return -1; |
3163 | } else { | |
259ccb6c | 3164 | int file_from_stage2 = was_tracked(opt, path); |
51931bf0 | 3165 | |
259ccb6c | 3166 | if (update_stages(opt, path, NULL, |
e62d1123 EN |
3167 | file_from_stage2 ? &mfi->blob : NULL, |
3168 | file_from_stage2 ? NULL : &mfi->blob)) | |
75456f96 | 3169 | return -1; |
51931bf0 EN |
3170 | } |
3171 | ||
3172 | } | |
c336ab85 | 3173 | new_path = unique_path(opt, path, ci->ren1->branch); |
bd42380e | 3174 | if (is_dirty) { |
259ccb6c | 3175 | output(opt, 1, _("Refusing to lose dirty file at %s"), |
bd42380e EN |
3176 | path); |
3177 | } | |
259ccb6c | 3178 | output(opt, 1, _("Adding as %s instead"), new_path); |
e62d1123 | 3179 | if (update_file(opt, 0, &mfi->blob, new_path)) { |
75456f96 JS |
3180 | free(new_path); |
3181 | return -1; | |
3182 | } | |
3d6b8e88 | 3183 | free(new_path); |
e62d1123 EN |
3184 | mfi->clean = 0; |
3185 | } else if (update_file(opt, mfi->clean, &mfi->blob, path)) | |
75456f96 | 3186 | return -1; |
e62d1123 | 3187 | return !is_dirty && mfi->clean; |
0c4918d1 EN |
3188 | } |
3189 | ||
259ccb6c | 3190 | static int handle_rename_normal(struct merge_options *opt, |
8ebe7b05 | 3191 | const char *path, |
8daec1df EN |
3192 | const struct diff_filespec *o, |
3193 | const struct diff_filespec *a, | |
3194 | const struct diff_filespec *b, | |
8ebe7b05 | 3195 | struct rename_conflict_info *ci) |
64b1abe9 | 3196 | { |
8c8e5bd6 | 3197 | struct rename *ren = ci->ren1; |
e62d1123 | 3198 | struct merge_file_info mfi; |
8c8e5bd6 EN |
3199 | int clean; |
3200 | int side = (ren->branch == opt->branch1 ? 2 : 3); | |
3201 | ||
64b1abe9 | 3202 | /* Merge the content and write it out */ |
8c8e5bd6 EN |
3203 | clean = handle_content_merge(&mfi, opt, path, was_dirty(opt, path), |
3204 | o, a, b, ci); | |
3205 | ||
8e012516 DS |
3206 | if (clean && |
3207 | opt->detect_directory_renames == MERGE_DIRECTORY_RENAMES_CONFLICT && | |
8c8e5bd6 EN |
3208 | ren->dir_rename_original_dest) { |
3209 | if (update_stages(opt, path, | |
3210 | NULL, | |
3211 | side == 2 ? &mfi.blob : NULL, | |
3212 | side == 2 ? NULL : &mfi.blob)) | |
3213 | return -1; | |
3214 | clean = 0; /* not clean, but conflicted */ | |
3215 | } | |
3216 | return clean; | |
3217 | } | |
3218 | ||
3219 | static void dir_rename_warning(const char *msg, | |
3220 | int is_add, | |
3221 | int clean, | |
3222 | struct merge_options *opt, | |
3223 | struct rename *ren) | |
3224 | { | |
3225 | const char *other_branch; | |
3226 | other_branch = (ren->branch == opt->branch1 ? | |
3227 | opt->branch2 : opt->branch1); | |
3228 | if (is_add) { | |
3229 | output(opt, clean ? 2 : 1, msg, | |
3230 | ren->pair->one->path, ren->branch, | |
3231 | other_branch, ren->pair->two->path); | |
3232 | return; | |
3233 | } | |
3234 | output(opt, clean ? 2 : 1, msg, | |
3235 | ren->pair->one->path, ren->dir_rename_original_dest, ren->branch, | |
3236 | other_branch, ren->pair->two->path); | |
3237 | } | |
3238 | static int warn_about_dir_renamed_entries(struct merge_options *opt, | |
3239 | struct rename *ren) | |
3240 | { | |
3241 | const char *msg; | |
3242 | int clean = 1, is_add; | |
3243 | ||
3244 | if (!ren) | |
3245 | return clean; | |
3246 | ||
3247 | /* Return early if ren was not affected/created by a directory rename */ | |
3248 | if (!ren->dir_rename_original_dest) | |
3249 | return clean; | |
3250 | ||
3251 | /* Sanity checks */ | |
8e012516 | 3252 | assert(opt->detect_directory_renames > MERGE_DIRECTORY_RENAMES_NONE); |
8c8e5bd6 EN |
3253 | assert(ren->dir_rename_original_type == 'A' || |
3254 | ren->dir_rename_original_type == 'R'); | |
3255 | ||
3256 | /* Check whether to treat directory renames as a conflict */ | |
8e012516 | 3257 | clean = (opt->detect_directory_renames == MERGE_DIRECTORY_RENAMES_TRUE); |
8c8e5bd6 EN |
3258 | |
3259 | is_add = (ren->dir_rename_original_type == 'A'); | |
3260 | if (ren->dir_rename_original_type == 'A' && clean) { | |
3261 | msg = _("Path updated: %s added in %s inside a " | |
3262 | "directory that was renamed in %s; moving it to %s."); | |
3263 | } else if (ren->dir_rename_original_type == 'A' && !clean) { | |
3264 | msg = _("CONFLICT (file location): %s added in %s " | |
3265 | "inside a directory that was renamed in %s, " | |
3266 | "suggesting it should perhaps be moved to %s."); | |
3267 | } else if (ren->dir_rename_original_type == 'R' && clean) { | |
3268 | msg = _("Path updated: %s renamed to %s in %s, inside a " | |
3269 | "directory that was renamed in %s; moving it to %s."); | |
3270 | } else if (ren->dir_rename_original_type == 'R' && !clean) { | |
3271 | msg = _("CONFLICT (file location): %s renamed to %s in %s, " | |
3272 | "inside a directory that was renamed in %s, " | |
3273 | "suggesting it should perhaps be moved to %s."); | |
3274 | } else { | |
3275 | BUG("Impossible dir_rename_original_type/clean combination"); | |
3276 | } | |
3277 | dir_rename_warning(msg, is_add, clean, opt, ren); | |
3278 | ||
3279 | return clean; | |
0c4918d1 EN |
3280 | } |
3281 | ||
9047ebbc | 3282 | /* Per entry merge function */ |
259ccb6c | 3283 | static int process_entry(struct merge_options *opt, |
8a2fce18 | 3284 | const char *path, struct stage_data *entry) |
9047ebbc | 3285 | { |
9047ebbc | 3286 | int clean_merge = 1; |
259ccb6c | 3287 | int normalize = opt->renormalize; |
8daec1df EN |
3288 | |
3289 | struct diff_filespec *o = &entry->stages[1]; | |
3290 | struct diff_filespec *a = &entry->stages[2]; | |
3291 | struct diff_filespec *b = &entry->stages[3]; | |
3292 | int o_valid = is_valid(o); | |
3293 | int a_valid = is_valid(a); | |
3294 | int b_valid = is_valid(b); | |
3295 | o->path = a->path = b->path = (char*)path; | |
9047ebbc | 3296 | |
37348937 | 3297 | entry->processed = 1; |
4f66dade | 3298 | if (entry->rename_conflict_info) { |
043622b2 | 3299 | struct rename_conflict_info *ci = entry->rename_conflict_info; |
8daec1df | 3300 | struct diff_filespec *temp; |
8c8e5bd6 EN |
3301 | int path_clean; |
3302 | ||
3303 | path_clean = warn_about_dir_renamed_entries(opt, ci->ren1); | |
3304 | path_clean &= warn_about_dir_renamed_entries(opt, ci->ren2); | |
8daec1df EN |
3305 | |
3306 | /* | |
3307 | * For cases with a single rename, {o,a,b}->path have all been | |
3308 | * set to the rename target path; we need to set two of these | |
3309 | * back to the rename source. | |
3310 | * For rename/rename conflicts, we'll manually fix paths below. | |
3311 | */ | |
3312 | temp = (opt->branch1 == ci->ren1->branch) ? b : a; | |
3313 | o->path = temp->path = ci->ren1->pair->one->path; | |
3314 | if (ci->ren2) { | |
3315 | assert(opt->branch1 == ci->ren1->branch); | |
3316 | } | |
3317 | ||
043622b2 | 3318 | switch (ci->rename_type) { |
882fd11a | 3319 | case RENAME_NORMAL: |
4f66dade | 3320 | case RENAME_ONE_FILE_TO_ONE: |
8daec1df | 3321 | clean_merge = handle_rename_normal(opt, path, o, a, b, |
043622b2 | 3322 | ci); |
882fd11a | 3323 | break; |
5455c338 | 3324 | case RENAME_VIA_DIR: |
8c8e5bd6 | 3325 | clean_merge = handle_rename_via_dir(opt, ci); |
882fd11a | 3326 | break; |
7f867165 EN |
3327 | case RENAME_ADD: |
3328 | /* | |
3329 | * Probably unclean merge, but if the renamed file | |
3330 | * merges cleanly and the result can then be | |
3331 | * two-way merged cleanly with the added file, I | |
3332 | * guess it's a clean merge? | |
3333 | */ | |
043622b2 | 3334 | clean_merge = handle_rename_add(opt, ci); |
7f867165 | 3335 | break; |
3b130adf EN |
3336 | case RENAME_DELETE: |
3337 | clean_merge = 0; | |
e2d563df | 3338 | if (handle_rename_delete(opt, ci)) |
75456f96 | 3339 | clean_merge = -1; |
3b130adf | 3340 | break; |
07413c5a | 3341 | case RENAME_ONE_FILE_TO_TWO: |
8daec1df EN |
3342 | /* |
3343 | * Manually fix up paths; note: | |
3344 | * ren[12]->pair->one->path are equal. | |
3345 | */ | |
3346 | o->path = ci->ren1->pair->one->path; | |
3347 | a->path = ci->ren1->pair->two->path; | |
3348 | b->path = ci->ren2->pair->two->path; | |
3349 | ||
07413c5a | 3350 | clean_merge = 0; |
043622b2 | 3351 | if (handle_rename_rename_1to2(opt, ci)) |
75456f96 | 3352 | clean_merge = -1; |
07413c5a | 3353 | break; |
461f5041 | 3354 | case RENAME_TWO_FILES_TO_ONE: |
8daec1df EN |
3355 | /* |
3356 | * Manually fix up paths; note, | |
3357 | * ren[12]->pair->two->path are actually equal. | |
3358 | */ | |
3359 | o->path = NULL; | |
3360 | a->path = ci->ren1->pair->two->path; | |
3361 | b->path = ci->ren2->pair->two->path; | |
3362 | ||
bbafc9c4 EN |
3363 | /* |
3364 | * Probably unclean merge, but if the two renamed | |
3365 | * files merge cleanly and the two resulting files | |
3366 | * can then be two-way merged cleanly, I guess it's | |
3367 | * a clean merge? | |
3368 | */ | |
043622b2 | 3369 | clean_merge = handle_rename_rename_2to1(opt, ci); |
07413c5a EN |
3370 | break; |
3371 | default: | |
3372 | entry->processed = 0; | |
3373 | break; | |
3374 | } | |
8c8e5bd6 EN |
3375 | if (path_clean < clean_merge) |
3376 | clean_merge = path_clean; | |
8daec1df | 3377 | } else if (o_valid && (!a_valid || !b_valid)) { |
edd2faf5 | 3378 | /* Case A: Deleted in one */ |
8daec1df EN |
3379 | if ((!a_valid && !b_valid) || |
3380 | (!b_valid && blob_unchanged(opt, o, a, normalize, path)) || | |
3381 | (!a_valid && blob_unchanged(opt, o, b, normalize, path))) { | |
edd2faf5 EN |
3382 | /* Deleted in both or deleted in one and |
3383 | * unchanged in the other */ | |
8daec1df | 3384 | if (a_valid) |
259ccb6c | 3385 | output(opt, 2, _("Removing %s"), path); |
edd2faf5 | 3386 | /* do not touch working file if it did not exist */ |
8daec1df | 3387 | remove_file(opt, 1, path, !a_valid); |
edd2faf5 EN |
3388 | } else { |
3389 | /* Modify/delete; deleted side may have put a directory in the way */ | |
edd2faf5 | 3390 | clean_merge = 0; |
8daec1df | 3391 | if (handle_modify_delete(opt, path, o, a, b)) |
75456f96 | 3392 | clean_merge = -1; |
3d6b8e88 | 3393 | } |
8daec1df EN |
3394 | } else if ((!o_valid && a_valid && !b_valid) || |
3395 | (!o_valid && !a_valid && b_valid)) { | |
edd2faf5 EN |
3396 | /* Case B: Added in one. */ |
3397 | /* [nothing|directory] -> ([nothing|directory], file) */ | |
3398 | ||
9c0bbb50 EN |
3399 | const char *add_branch; |
3400 | const char *other_branch; | |
9c0bbb50 | 3401 | const char *conf; |
8daec1df | 3402 | const struct diff_filespec *contents; |
37348937 | 3403 | |
8daec1df | 3404 | if (a_valid) { |
259ccb6c EN |
3405 | add_branch = opt->branch1; |
3406 | other_branch = opt->branch2; | |
8daec1df | 3407 | contents = a; |
55653a68 | 3408 | conf = _("file/directory"); |
9c0bbb50 | 3409 | } else { |
259ccb6c EN |
3410 | add_branch = opt->branch2; |
3411 | other_branch = opt->branch1; | |
8daec1df | 3412 | contents = b; |
55653a68 | 3413 | conf = _("directory/file"); |
9c0bbb50 | 3414 | } |
259ccb6c | 3415 | if (dir_in_way(opt->repo->index, path, |
5bf7e577 | 3416 | !opt->priv->call_depth && !S_ISGITLINK(a->mode), |
c641ca67 | 3417 | 0)) { |
259ccb6c | 3418 | char *new_path = unique_path(opt, path, add_branch); |
9c0bbb50 | 3419 | clean_merge = 0; |
259ccb6c | 3420 | output(opt, 1, _("CONFLICT (%s): There is a directory with name %s in %s. " |
55653a68 | 3421 | "Adding %s as %s"), |
9c0bbb50 | 3422 | conf, path, other_branch, path, new_path); |
8daec1df | 3423 | if (update_file(opt, 0, contents, new_path)) |
75456f96 | 3424 | clean_merge = -1; |
5bf7e577 | 3425 | else if (opt->priv->call_depth) |
259ccb6c | 3426 | remove_file_from_index(opt->repo->index, path); |
3d6b8e88 | 3427 | free(new_path); |
9c0bbb50 | 3428 | } else { |
259ccb6c | 3429 | output(opt, 2, _("Adding %s"), path); |
35a74abf | 3430 | /* do not overwrite file if already present */ |
8daec1df | 3431 | if (update_file_flags(opt, contents, path, 1, !a_valid)) |
75456f96 | 3432 | clean_merge = -1; |
9c0bbb50 | 3433 | } |
8daec1df EN |
3434 | } else if (a_valid && b_valid) { |
3435 | if (!o_valid) { | |
dcf28150 | 3436 | /* Case C: Added in both (check for same permissions) */ |
259ccb6c | 3437 | output(opt, 1, |
dcf28150 EN |
3438 | _("CONFLICT (add/add): Merge conflict in %s"), |
3439 | path); | |
259ccb6c | 3440 | clean_merge = handle_file_collision(opt, |
dcf28150 | 3441 | path, NULL, NULL, |
259ccb6c EN |
3442 | opt->branch1, |
3443 | opt->branch2, | |
8daec1df | 3444 | a, b); |
dcf28150 EN |
3445 | } else { |
3446 | /* case D: Modified in both, but differently. */ | |
e62d1123 | 3447 | struct merge_file_info mfi; |
dcf28150 | 3448 | int is_dirty = 0; /* unpack_trees would have bailed if dirty */ |
e62d1123 | 3449 | clean_merge = handle_content_merge(&mfi, opt, path, |
dcf28150 | 3450 | is_dirty, |
8daec1df | 3451 | o, a, b, NULL); |
dcf28150 | 3452 | } |
8daec1df | 3453 | } else if (!o_valid && !a_valid && !b_valid) { |
edd2faf5 EN |
3454 | /* |
3455 | * this entry was deleted altogether. a_mode == 0 means | |
3456 | * we had that path and want to actively remove it. | |
3457 | */ | |
8daec1df | 3458 | remove_file(opt, 1, path, !a->mode); |
edd2faf5 | 3459 | } else |
033abf97 | 3460 | BUG("fatal merge failure, shouldn't happen."); |
37348937 EN |
3461 | |
3462 | return clean_merge; | |
3463 | } | |
3464 | ||
98a1d3d8 EN |
3465 | static int merge_trees_internal(struct merge_options *opt, |
3466 | struct tree *head, | |
3467 | struct tree *merge, | |
ff1bfa2c | 3468 | struct tree *merge_base, |
98a1d3d8 | 3469 | struct tree **result) |
9047ebbc | 3470 | { |
259ccb6c | 3471 | struct index_state *istate = opt->repo->index; |
9047ebbc MV |
3472 | int code, clean; |
3473 | ||
259ccb6c | 3474 | if (opt->subtree_shift) { |
ff1bfa2c EN |
3475 | merge = shift_tree_object(opt->repo, head, merge, |
3476 | opt->subtree_shift); | |
3477 | merge_base = shift_tree_object(opt->repo, head, merge_base, | |
3478 | opt->subtree_shift); | |
9047ebbc MV |
3479 | } |
3480 | ||
763a59e7 | 3481 | if (oideq(&merge_base->object.oid, &merge->object.oid)) { |
259ccb6c | 3482 | output(opt, 0, _("Already up to date!")); |
9047ebbc MV |
3483 | *result = head; |
3484 | return 1; | |
3485 | } | |
3486 | ||
ff1bfa2c | 3487 | code = unpack_trees_start(opt, merge_base, head, merge); |
9047ebbc | 3488 | |
fadd069d | 3489 | if (code != 0) { |
5bf7e577 | 3490 | if (show(opt, 4) || opt->priv->call_depth) |
259ccb6c | 3491 | err(opt, _("merging of trees %s and %s failed"), |
f2fd0760 | 3492 | oid_to_hex(&head->object.oid), |
3493 | oid_to_hex(&merge->object.oid)); | |
259ccb6c | 3494 | unpack_trees_finish(opt); |
6003303a | 3495 | return -1; |
fadd069d | 3496 | } |
9047ebbc | 3497 | |
0d6caa2d | 3498 | if (unmerged_index(istate)) { |
f172589e EN |
3499 | struct string_list *entries; |
3500 | struct rename_info re_info; | |
9047ebbc | 3501 | int i; |
fc65b00d KW |
3502 | /* |
3503 | * Only need the hashmap while processing entries, so | |
3504 | * initialize it here and free it when we are done running | |
3505 | * through the entries. Keeping it in the merge_options as | |
3506 | * opposed to decaring a local hashmap is for convenience | |
3507 | * so that we don't have to pass it to around. | |
3508 | */ | |
5bf7e577 | 3509 | hashmap_init(&opt->priv->current_file_dir_set, path_hashmap_cmp, |
4d7101e2 | 3510 | NULL, 512); |
259ccb6c EN |
3511 | get_files_dirs(opt, head); |
3512 | get_files_dirs(opt, merge); | |
9047ebbc | 3513 | |
259ccb6c | 3514 | entries = get_unmerged(opt->repo->index); |
ff1bfa2c | 3515 | clean = detect_and_process_renames(opt, merge_base, head, merge, |
8ebe7b05 | 3516 | entries, &re_info); |
259ccb6c | 3517 | record_df_conflict_files(opt, entries); |
75456f96 | 3518 | if (clean < 0) |
e336bdc5 | 3519 | goto cleanup; |
edd2faf5 | 3520 | for (i = entries->nr-1; 0 <= i; i--) { |
9047ebbc MV |
3521 | const char *path = entries->items[i].string; |
3522 | struct stage_data *e = entries->items[i].util; | |
75456f96 | 3523 | if (!e->processed) { |
259ccb6c | 3524 | int ret = process_entry(opt, path, e); |
75456f96 JS |
3525 | if (!ret) |
3526 | clean = 0; | |
e336bdc5 KW |
3527 | else if (ret < 0) { |
3528 | clean = ret; | |
3529 | goto cleanup; | |
3530 | } | |
75456f96 | 3531 | } |
9047ebbc | 3532 | } |
7edba4c4 JH |
3533 | for (i = 0; i < entries->nr; i++) { |
3534 | struct stage_data *e = entries->items[i].util; | |
3535 | if (!e->processed) | |
033abf97 | 3536 | BUG("unprocessed path??? %s", |
7edba4c4 JH |
3537 | entries->items[i].string); |
3538 | } | |
9047ebbc | 3539 | |
93665365 | 3540 | cleanup: |
ffc16c49 | 3541 | final_cleanup_renames(&re_info); |
f172589e | 3542 | |
9047ebbc | 3543 | string_list_clear(entries, 1); |
f172589e | 3544 | free(entries); |
9047ebbc | 3545 | |
5efabc7e | 3546 | hashmap_free_entries(&opt->priv->current_file_dir_set, |
c8e424c9 | 3547 | struct path_hashmap_entry, e); |
fc65b00d | 3548 | |
3f1c1c36 | 3549 | if (clean < 0) { |
259ccb6c | 3550 | unpack_trees_finish(opt); |
e336bdc5 | 3551 | return clean; |
3f1c1c36 | 3552 | } |
9047ebbc MV |
3553 | } |
3554 | else | |
3555 | clean = 1; | |
3556 | ||
259ccb6c | 3557 | unpack_trees_finish(opt); |
a35edc84 | 3558 | |
5bf7e577 | 3559 | if (opt->priv->call_depth && |
724dd767 | 3560 | !(*result = write_in_core_index_as_tree(opt->repo))) |
fbc87eb5 | 3561 | return -1; |
9047ebbc MV |
3562 | |
3563 | return clean; | |
3564 | } | |
3565 | ||
3566 | static struct commit_list *reverse_commit_list(struct commit_list *list) | |
3567 | { | |
3568 | struct commit_list *next = NULL, *current, *backup; | |
3569 | for (current = list; current; current = backup) { | |
3570 | backup = current->next; | |
3571 | current->next = next; | |
3572 | next = current; | |
3573 | } | |
3574 | return next; | |
3575 | } | |
3576 | ||
3577 | /* | |
3578 | * Merge the commits h1 and h2, return the resulting virtual | |
3579 | * commit object and a flag indicating the cleanness of the merge. | |
3580 | */ | |
98a1d3d8 EN |
3581 | static int merge_recursive_internal(struct merge_options *opt, |
3582 | struct commit *h1, | |
3583 | struct commit *h2, | |
ff1bfa2c | 3584 | struct commit_list *merge_bases, |
98a1d3d8 | 3585 | struct commit **result) |
9047ebbc MV |
3586 | { |
3587 | struct commit_list *iter; | |
ff1bfa2c | 3588 | struct commit *merged_merge_bases; |
bab56877 | 3589 | struct tree *result_tree; |
9047ebbc | 3590 | int clean; |
743474cb EN |
3591 | const char *ancestor_name; |
3592 | struct strbuf merge_base_abbrev = STRBUF_INIT; | |
9047ebbc | 3593 | |
259ccb6c EN |
3594 | if (show(opt, 4)) { |
3595 | output(opt, 4, _("Merging:")); | |
3596 | output_commit_title(opt, h1); | |
3597 | output_commit_title(opt, h2); | |
9047ebbc MV |
3598 | } |
3599 | ||
ff1bfa2c EN |
3600 | if (!merge_bases) { |
3601 | merge_bases = get_merge_bases(h1, h2); | |
3602 | merge_bases = reverse_commit_list(merge_bases); | |
9047ebbc MV |
3603 | } |
3604 | ||
259ccb6c | 3605 | if (show(opt, 5)) { |
ff1bfa2c | 3606 | unsigned cnt = commit_list_count(merge_bases); |
e0453cd8 | 3607 | |
259ccb6c | 3608 | output(opt, 5, Q_("found %u common ancestor:", |
e0453cd8 | 3609 | "found %u common ancestors:", cnt), cnt); |
ff1bfa2c | 3610 | for (iter = merge_bases; iter; iter = iter->next) |
259ccb6c | 3611 | output_commit_title(opt, iter->item); |
9047ebbc MV |
3612 | } |
3613 | ||
ff1bfa2c EN |
3614 | merged_merge_bases = pop_commit(&merge_bases); |
3615 | if (merged_merge_bases == NULL) { | |
03f622c8 JN |
3616 | /* if there is no common ancestor, use an empty tree */ |
3617 | struct tree *tree; | |
9047ebbc | 3618 | |
259ccb6c | 3619 | tree = lookup_tree(opt->repo, opt->repo->hash_algo->empty_tree); |
ff1bfa2c EN |
3620 | merged_merge_bases = make_virtual_commit(opt->repo, tree, |
3621 | "ancestor"); | |
743474cb | 3622 | ancestor_name = "empty tree"; |
b6570477 | 3623 | } else if (opt->ancestor && !opt->priv->call_depth) { |
8e4ec337 | 3624 | ancestor_name = opt->ancestor; |
ff1bfa2c | 3625 | } else if (merge_bases) { |
743474cb EN |
3626 | ancestor_name = "merged common ancestors"; |
3627 | } else { | |
3628 | strbuf_add_unique_abbrev(&merge_base_abbrev, | |
ff1bfa2c | 3629 | &merged_merge_bases->object.oid, |
743474cb EN |
3630 | DEFAULT_ABBREV); |
3631 | ancestor_name = merge_base_abbrev.buf; | |
9047ebbc MV |
3632 | } |
3633 | ||
ff1bfa2c | 3634 | for (iter = merge_bases; iter; iter = iter->next) { |
8a2fce18 | 3635 | const char *saved_b1, *saved_b2; |
5bf7e577 | 3636 | opt->priv->call_depth++; |
9047ebbc MV |
3637 | /* |
3638 | * When the merge fails, the result contains files | |
3639 | * with conflict markers. The cleanness flag is | |
de8946de JS |
3640 | * ignored (unless indicating an error), it was never |
3641 | * actually used, as result of merge_trees has always | |
3642 | * overwritten it: the committed "conflicts" were | |
3643 | * already resolved. | |
9047ebbc | 3644 | */ |
259ccb6c EN |
3645 | discard_index(opt->repo->index); |
3646 | saved_b1 = opt->branch1; | |
3647 | saved_b2 = opt->branch2; | |
3648 | opt->branch1 = "Temporary merge branch 1"; | |
3649 | opt->branch2 = "Temporary merge branch 2"; | |
ff1bfa2c EN |
3650 | if (merge_recursive_internal(opt, merged_merge_bases, iter->item, |
3651 | NULL, &merged_merge_bases) < 0) | |
de8946de | 3652 | return -1; |
259ccb6c EN |
3653 | opt->branch1 = saved_b1; |
3654 | opt->branch2 = saved_b2; | |
5bf7e577 | 3655 | opt->priv->call_depth--; |
9047ebbc | 3656 | |
ff1bfa2c | 3657 | if (!merged_merge_bases) |
259ccb6c | 3658 | return err(opt, _("merge returned no commit")); |
9047ebbc MV |
3659 | } |
3660 | ||
259ccb6c | 3661 | discard_index(opt->repo->index); |
5bf7e577 | 3662 | if (!opt->priv->call_depth) |
259ccb6c | 3663 | repo_read_index(opt->repo); |
9047ebbc | 3664 | |
743474cb | 3665 | opt->ancestor = ancestor_name; |
98a1d3d8 EN |
3666 | clean = merge_trees_internal(opt, |
3667 | repo_get_commit_tree(opt->repo, h1), | |
3668 | repo_get_commit_tree(opt->repo, h2), | |
3669 | repo_get_commit_tree(opt->repo, | |
ff1bfa2c | 3670 | merged_merge_bases), |
bab56877 | 3671 | &result_tree); |
743474cb | 3672 | strbuf_release(&merge_base_abbrev); |
b6570477 | 3673 | opt->ancestor = NULL; /* avoid accidental re-use of opt->ancestor */ |
6999bc70 | 3674 | if (clean < 0) { |
259ccb6c | 3675 | flush_output(opt); |
de8946de | 3676 | return clean; |
6999bc70 | 3677 | } |
9047ebbc | 3678 | |
5bf7e577 | 3679 | if (opt->priv->call_depth) { |
bab56877 EN |
3680 | *result = make_virtual_commit(opt->repo, result_tree, |
3681 | "merged tree"); | |
9047ebbc MV |
3682 | commit_list_insert(h1, &(*result)->parents); |
3683 | commit_list_insert(h2, &(*result)->parents->next); | |
3684 | } | |
9047ebbc MV |
3685 | return clean; |
3686 | } | |
3687 | ||
98a1d3d8 EN |
3688 | static int merge_start(struct merge_options *opt, struct tree *head) |
3689 | { | |
3690 | struct strbuf sb = STRBUF_INIT; | |
3691 | ||
45ef16f7 EN |
3692 | /* Sanity checks on opt */ |
3693 | assert(opt->repo); | |
3694 | ||
3695 | assert(opt->branch1 && opt->branch2); | |
3696 | ||
3697 | assert(opt->detect_renames >= -1 && | |
3698 | opt->detect_renames <= DIFF_DETECT_COPY); | |
3699 | assert(opt->detect_directory_renames >= MERGE_DIRECTORY_RENAMES_NONE && | |
3700 | opt->detect_directory_renames <= MERGE_DIRECTORY_RENAMES_TRUE); | |
3701 | assert(opt->rename_limit >= -1); | |
3702 | assert(opt->rename_score >= 0 && opt->rename_score <= MAX_SCORE); | |
3703 | assert(opt->show_rename_progress >= 0 && opt->show_rename_progress <= 1); | |
3704 | ||
3705 | assert(opt->xdl_opts >= 0); | |
3706 | assert(opt->recursive_variant >= MERGE_VARIANT_NORMAL && | |
3707 | opt->recursive_variant <= MERGE_VARIANT_THEIRS); | |
3708 | ||
3709 | assert(opt->verbosity >= 0 && opt->verbosity <= 5); | |
3710 | assert(opt->buffer_output <= 2); | |
3711 | assert(opt->obuf.len == 0); | |
3712 | ||
3713 | assert(opt->priv == NULL); | |
3714 | ||
3715 | /* Sanity check on repo state; index must match head */ | |
98a1d3d8 EN |
3716 | if (repo_index_has_changes(opt->repo, head, &sb)) { |
3717 | err(opt, _("Your local changes to the following files would be overwritten by merge:\n %s"), | |
3718 | sb.buf); | |
3719 | strbuf_release(&sb); | |
3720 | return -1; | |
3721 | } | |
3722 | ||
5bf7e577 EN |
3723 | opt->priv = xcalloc(1, sizeof(*opt->priv)); |
3724 | string_list_init(&opt->priv->df_conflict_file_set, 1); | |
98a1d3d8 EN |
3725 | return 0; |
3726 | } | |
3727 | ||
3728 | static void merge_finalize(struct merge_options *opt) | |
3729 | { | |
259ccb6c | 3730 | flush_output(opt); |
5bf7e577 | 3731 | if (!opt->priv->call_depth && opt->buffer_output < 2) |
259ccb6c EN |
3732 | strbuf_release(&opt->obuf); |
3733 | if (show(opt, 2)) | |
f31027c9 | 3734 | diff_warn_rename_limit("merge.renamelimit", |
5bf7e577 EN |
3735 | opt->priv->needed_rename_limit, 0); |
3736 | FREE_AND_NULL(opt->priv); | |
98a1d3d8 EN |
3737 | } |
3738 | ||
3739 | int merge_trees(struct merge_options *opt, | |
3740 | struct tree *head, | |
3741 | struct tree *merge, | |
ff1bfa2c | 3742 | struct tree *merge_base) |
98a1d3d8 EN |
3743 | { |
3744 | int clean; | |
b4db8a2b | 3745 | struct tree *ignored; |
98a1d3d8 EN |
3746 | |
3747 | assert(opt->ancestor != NULL); | |
3748 | ||
3749 | if (merge_start(opt, head)) | |
3750 | return -1; | |
ff1bfa2c | 3751 | clean = merge_trees_internal(opt, head, merge, merge_base, &ignored); |
98a1d3d8 EN |
3752 | merge_finalize(opt); |
3753 | ||
3754 | return clean; | |
3755 | } | |
3756 | ||
3757 | int merge_recursive(struct merge_options *opt, | |
3758 | struct commit *h1, | |
3759 | struct commit *h2, | |
ff1bfa2c | 3760 | struct commit_list *merge_bases, |
98a1d3d8 EN |
3761 | struct commit **result) |
3762 | { | |
3763 | int clean; | |
3764 | ||
8e4ec337 EN |
3765 | assert(opt->ancestor == NULL || |
3766 | !strcmp(opt->ancestor, "constructed merge base")); | |
98a1d3d8 EN |
3767 | |
3768 | if (merge_start(opt, repo_get_commit_tree(opt->repo, h1))) | |
3769 | return -1; | |
ff1bfa2c | 3770 | clean = merge_recursive_internal(opt, h1, h2, merge_bases, result); |
98a1d3d8 EN |
3771 | merge_finalize(opt); |
3772 | ||
9047ebbc MV |
3773 | return clean; |
3774 | } | |
3775 | ||
4d7101e2 EN |
3776 | static struct commit *get_ref(struct repository *repo, |
3777 | const struct object_id *oid, | |
d7cf3a96 | 3778 | const char *name) |
73118f89 SB |
3779 | { |
3780 | struct object *object; | |
3781 | ||
d7cf3a96 NTND |
3782 | object = deref_tag(repo, parse_object(repo, oid), |
3783 | name, strlen(name)); | |
73118f89 SB |
3784 | if (!object) |
3785 | return NULL; | |
3786 | if (object->type == OBJ_TREE) | |
d7cf3a96 | 3787 | return make_virtual_commit(repo, (struct tree*)object, name); |
73118f89 SB |
3788 | if (object->type != OBJ_COMMIT) |
3789 | return NULL; | |
3790 | if (parse_commit((struct commit *)object)) | |
3791 | return NULL; | |
3792 | return (struct commit *)object; | |
3793 | } | |
3794 | ||
259ccb6c | 3795 | int merge_recursive_generic(struct merge_options *opt, |
4e8161a8 | 3796 | const struct object_id *head, |
3797 | const struct object_id *merge, | |
ff1bfa2c EN |
3798 | int num_merge_bases, |
3799 | const struct object_id **merge_bases, | |
8a2fce18 | 3800 | struct commit **result) |
73118f89 | 3801 | { |
03b86647 | 3802 | int clean; |
837e34eb | 3803 | struct lock_file lock = LOCK_INIT; |
259ccb6c EN |
3804 | struct commit *head_commit = get_ref(opt->repo, head, opt->branch1); |
3805 | struct commit *next_commit = get_ref(opt->repo, merge, opt->branch2); | |
73118f89 SB |
3806 | struct commit_list *ca = NULL; |
3807 | ||
ff1bfa2c | 3808 | if (merge_bases) { |
73118f89 | 3809 | int i; |
ff1bfa2c | 3810 | for (i = 0; i < num_merge_bases; ++i) { |
73118f89 | 3811 | struct commit *base; |
ff1bfa2c EN |
3812 | if (!(base = get_ref(opt->repo, merge_bases[i], |
3813 | oid_to_hex(merge_bases[i])))) | |
259ccb6c | 3814 | return err(opt, _("Could not parse object '%s'"), |
ff1bfa2c | 3815 | oid_to_hex(merge_bases[i])); |
73118f89 SB |
3816 | commit_list_insert(base, &ca); |
3817 | } | |
8e4ec337 EN |
3818 | if (num_merge_bases == 1) |
3819 | opt->ancestor = "constructed merge base"; | |
73118f89 SB |
3820 | } |
3821 | ||
259ccb6c EN |
3822 | repo_hold_locked_index(opt->repo, &lock, LOCK_DIE_ON_ERROR); |
3823 | clean = merge_recursive(opt, head_commit, next_commit, ca, | |
d90e759f | 3824 | result); |
51d3f43d MÅ |
3825 | if (clean < 0) { |
3826 | rollback_lock_file(&lock); | |
de8946de | 3827 | return clean; |
51d3f43d | 3828 | } |
de8946de | 3829 | |
259ccb6c | 3830 | if (write_locked_index(opt->repo->index, &lock, |
61000814 | 3831 | COMMIT_LOCK | SKIP_IF_UNCHANGED)) |
259ccb6c | 3832 | return err(opt, _("Unable to write index.")); |
73118f89 SB |
3833 | |
3834 | return clean ? 0 : 1; | |
3835 | } | |
3836 | ||
259ccb6c | 3837 | static void merge_recursive_config(struct merge_options *opt) |
9047ebbc | 3838 | { |
85b46030 | 3839 | char *value = NULL; |
259ccb6c | 3840 | git_config_get_int("merge.verbosity", &opt->verbosity); |
8599ab45 EN |
3841 | git_config_get_int("diff.renamelimit", &opt->rename_limit); |
3842 | git_config_get_int("merge.renamelimit", &opt->rename_limit); | |
85b46030 | 3843 | if (!git_config_get_string("diff.renames", &value)) { |
8599ab45 | 3844 | opt->detect_renames = git_config_rename("diff.renames", value); |
85b46030 BP |
3845 | free(value); |
3846 | } | |
3847 | if (!git_config_get_string("merge.renames", &value)) { | |
8599ab45 | 3848 | opt->detect_renames = git_config_rename("merge.renames", value); |
85b46030 BP |
3849 | free(value); |
3850 | } | |
8c8e5bd6 EN |
3851 | if (!git_config_get_string("merge.directoryrenames", &value)) { |
3852 | int boolval = git_parse_maybe_bool(value); | |
3853 | if (0 <= boolval) { | |
8e012516 DS |
3854 | opt->detect_directory_renames = boolval ? |
3855 | MERGE_DIRECTORY_RENAMES_TRUE : | |
3856 | MERGE_DIRECTORY_RENAMES_NONE; | |
8c8e5bd6 | 3857 | } else if (!strcasecmp(value, "conflict")) { |
8e012516 DS |
3858 | opt->detect_directory_renames = |
3859 | MERGE_DIRECTORY_RENAMES_CONFLICT; | |
8c8e5bd6 | 3860 | } /* avoid erroring on values from future versions of git */ |
85b46030 BP |
3861 | free(value); |
3862 | } | |
0e7bcb1b | 3863 | git_config(git_xmerge_config, NULL); |
9047ebbc MV |
3864 | } |
3865 | ||
259ccb6c | 3866 | void init_merge_options(struct merge_options *opt, |
0d6caa2d | 3867 | struct repository *repo) |
9047ebbc | 3868 | { |
80486220 | 3869 | const char *merge_verbosity; |
259ccb6c | 3870 | memset(opt, 0, sizeof(struct merge_options)); |
a779fb82 | 3871 | |
259ccb6c | 3872 | opt->repo = repo; |
a779fb82 EN |
3873 | |
3874 | opt->detect_renames = -1; | |
3875 | opt->detect_directory_renames = MERGE_DIRECTORY_RENAMES_CONFLICT; | |
3876 | opt->rename_limit = -1; | |
3877 | ||
259ccb6c EN |
3878 | opt->verbosity = 2; |
3879 | opt->buffer_output = 1; | |
a779fb82 EN |
3880 | strbuf_init(&opt->obuf, 0); |
3881 | ||
259ccb6c | 3882 | opt->renormalize = 0; |
a779fb82 | 3883 | |
259ccb6c | 3884 | merge_recursive_config(opt); |
80486220 AO |
3885 | merge_verbosity = getenv("GIT_MERGE_VERBOSITY"); |
3886 | if (merge_verbosity) | |
259ccb6c EN |
3887 | opt->verbosity = strtol(merge_verbosity, NULL, 10); |
3888 | if (opt->verbosity >= 5) | |
3889 | opt->buffer_output = 0; | |
9047ebbc | 3890 | } |
635a7bb1 | 3891 | |
259ccb6c | 3892 | int parse_merge_opt(struct merge_options *opt, const char *s) |
635a7bb1 | 3893 | { |
95b567c7 JK |
3894 | const char *arg; |
3895 | ||
635a7bb1 JN |
3896 | if (!s || !*s) |
3897 | return -1; | |
3898 | if (!strcmp(s, "ours")) | |
f3081dae | 3899 | opt->recursive_variant = MERGE_VARIANT_OURS; |
635a7bb1 | 3900 | else if (!strcmp(s, "theirs")) |
f3081dae | 3901 | opt->recursive_variant = MERGE_VARIANT_THEIRS; |
635a7bb1 | 3902 | else if (!strcmp(s, "subtree")) |
259ccb6c | 3903 | opt->subtree_shift = ""; |
95b567c7 | 3904 | else if (skip_prefix(s, "subtree=", &arg)) |
259ccb6c | 3905 | opt->subtree_shift = arg; |
58a1ece4 | 3906 | else if (!strcmp(s, "patience")) |
259ccb6c | 3907 | opt->xdl_opts = DIFF_WITH_ALG(opt, PATIENCE_DIFF); |
8c912eea | 3908 | else if (!strcmp(s, "histogram")) |
259ccb6c | 3909 | opt->xdl_opts = DIFF_WITH_ALG(opt, HISTOGRAM_DIFF); |
95b567c7 JK |
3910 | else if (skip_prefix(s, "diff-algorithm=", &arg)) { |
3911 | long value = parse_algorithm_value(arg); | |
07924d4d MP |
3912 | if (value < 0) |
3913 | return -1; | |
3914 | /* clear out previous settings */ | |
259ccb6c EN |
3915 | DIFF_XDL_CLR(opt, NEED_MINIMAL); |
3916 | opt->xdl_opts &= ~XDF_DIFF_ALGORITHM_MASK; | |
3917 | opt->xdl_opts |= value; | |
07924d4d | 3918 | } |
4e5dd044 | 3919 | else if (!strcmp(s, "ignore-space-change")) |
259ccb6c | 3920 | DIFF_XDL_SET(opt, IGNORE_WHITESPACE_CHANGE); |
4e5dd044 | 3921 | else if (!strcmp(s, "ignore-all-space")) |
259ccb6c | 3922 | DIFF_XDL_SET(opt, IGNORE_WHITESPACE); |
4e5dd044 | 3923 | else if (!strcmp(s, "ignore-space-at-eol")) |
259ccb6c | 3924 | DIFF_XDL_SET(opt, IGNORE_WHITESPACE_AT_EOL); |
e9282f02 | 3925 | else if (!strcmp(s, "ignore-cr-at-eol")) |
259ccb6c | 3926 | DIFF_XDL_SET(opt, IGNORE_CR_AT_EOL); |
635a7bb1 | 3927 | else if (!strcmp(s, "renormalize")) |
259ccb6c | 3928 | opt->renormalize = 1; |
635a7bb1 | 3929 | else if (!strcmp(s, "no-renormalize")) |
259ccb6c | 3930 | opt->renormalize = 0; |
d2b11eca | 3931 | else if (!strcmp(s, "no-renames")) |
8599ab45 | 3932 | opt->detect_renames = 0; |
87892f60 | 3933 | else if (!strcmp(s, "find-renames")) { |
8599ab45 | 3934 | opt->detect_renames = 1; |
259ccb6c | 3935 | opt->rename_score = 0; |
87892f60 | 3936 | } |
1b47ad16 FGA |
3937 | else if (skip_prefix(s, "find-renames=", &arg) || |
3938 | skip_prefix(s, "rename-threshold=", &arg)) { | |
259ccb6c | 3939 | if ((opt->rename_score = parse_rename_score(&arg)) == -1 || *arg != 0) |
10ae7526 | 3940 | return -1; |
8599ab45 | 3941 | opt->detect_renames = 1; |
10ae7526 | 3942 | } |
5a59a230 NTND |
3943 | /* |
3944 | * Please update $__git_merge_strategy_options in | |
3945 | * git-completion.bash when you add new options | |
3946 | */ | |
635a7bb1 JN |
3947 | else |
3948 | return -1; | |
3949 | return 0; | |
3950 | } |