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