]>
Commit | Line | Data |
---|---|---|
17e5574b EN |
1 | /* |
2 | * "Ostensibly Recursive's Twin" merge strategy, or "ort" for short. Meant | |
3 | * as a drop-in replacement for the "recursive" merge strategy, allowing one | |
4 | * to replace | |
5 | * | |
6 | * git merge [-s recursive] | |
7 | * | |
8 | * with | |
9 | * | |
10 | * git merge -s ort | |
11 | * | |
12 | * Note: git's parser allows the space between '-s' and its argument to be | |
13 | * missing. (Should I have backronymed "ham", "alsa", "kip", "nap, "alvo", | |
14 | * "cale", "peedy", or "ins" instead of "ort"?) | |
15 | */ | |
16 | ||
17 | #include "cache.h" | |
18 | #include "merge-ort.h" | |
19 | ||
4296d8f1 | 20 | #include "alloc.h" |
67845745 | 21 | #include "blob.h" |
ef2b3693 | 22 | #include "cache-tree.h" |
4296d8f1 | 23 | #include "commit.h" |
67845745 | 24 | #include "commit-reach.h" |
e4171b1b EN |
25 | #include "diff.h" |
26 | #include "diffcore.h" | |
6681ce5c | 27 | #include "dir.h" |
f591c472 | 28 | #include "ll-merge.h" |
ee4012dc | 29 | #include "object-store.h" |
4204cd59 | 30 | #include "revision.h" |
5b59c3db | 31 | #include "strmap.h" |
c73cda76 | 32 | #include "submodule.h" |
231e2dd4 | 33 | #include "tree.h" |
6681ce5c | 34 | #include "unpack-trees.h" |
c8017176 | 35 | #include "xdiff-interface.h" |
5b59c3db | 36 | |
d2bc1994 EN |
37 | /* |
38 | * We have many arrays of size 3. Whenever we have such an array, the | |
39 | * indices refer to one of the sides of the three-way merge. This is so | |
40 | * pervasive that the constants 0, 1, and 2 are used in many places in the | |
41 | * code (especially in arithmetic operations to find the other side's index | |
42 | * or to compute a relevant mask), but sometimes these enum names are used | |
43 | * to aid code clarity. | |
44 | * | |
45 | * See also 'filemask' and 'dirmask' in struct conflict_info; the "ith side" | |
46 | * referred to there is one of these three sides. | |
47 | */ | |
48 | enum merge_side { | |
49 | MERGE_BASE = 0, | |
50 | MERGE_SIDE1 = 1, | |
51 | MERGE_SIDE2 = 2 | |
52 | }; | |
53 | ||
864075ec | 54 | struct rename_info { |
c09376d5 EN |
55 | /* |
56 | * All variables that are arrays of size 3 correspond to data tracked | |
57 | * for the sides in enum merge_side. Index 0 is almost always unused | |
58 | * because we often only need to track information for MERGE_SIDE1 and | |
59 | * MERGE_SIDE2 (MERGE_BASE can't have rename information since renames | |
60 | * are determined relative to what changed since the MERGE_BASE). | |
61 | */ | |
62 | ||
864075ec EN |
63 | /* |
64 | * pairs: pairing of filenames from diffcore_rename() | |
864075ec EN |
65 | */ |
66 | struct diff_queue_struct pairs[3]; | |
67 | ||
c09376d5 EN |
68 | /* |
69 | * dirs_removed: directories removed on a given side of history. | |
70 | */ | |
71 | struct strset dirs_removed[3]; | |
72 | ||
73 | /* | |
74 | * dir_rename_count: tracking where parts of a directory were renamed to | |
75 | * | |
76 | * When files in a directory are renamed, they may not all go to the | |
77 | * same location. Each strmap here tracks: | |
78 | * old_dir => {new_dir => int} | |
79 | * That is, dir_rename_count[side] is a strmap to a strintmap. | |
80 | */ | |
81 | struct strmap dir_rename_count[3]; | |
82 | ||
83 | /* | |
84 | * dir_renames: computed directory renames | |
85 | * | |
86 | * This is a map of old_dir => new_dir and is derived in part from | |
87 | * dir_rename_count. | |
88 | */ | |
89 | struct strmap dir_renames[3]; | |
90 | ||
864075ec EN |
91 | /* |
92 | * needed_limit: value needed for inexact rename detection to run | |
93 | * | |
94 | * If the current rename limit wasn't high enough for inexact | |
95 | * rename detection to run, this records the limit needed. Otherwise, | |
96 | * this value remains 0. | |
97 | */ | |
98 | int needed_limit; | |
99 | }; | |
100 | ||
5b59c3db EN |
101 | struct merge_options_internal { |
102 | /* | |
103 | * paths: primary data structure in all of merge ort. | |
104 | * | |
105 | * The keys of paths: | |
106 | * * are full relative paths from the toplevel of the repository | |
107 | * (e.g. "drivers/firmware/raspberrypi.c"). | |
108 | * * store all relevant paths in the repo, both directories and | |
109 | * files (e.g. drivers, drivers/firmware would also be included) | |
110 | * * these keys serve to intern all the path strings, which allows | |
111 | * us to do pointer comparison on directory names instead of | |
112 | * strcmp; we just have to be careful to use the interned strings. | |
43c1dccb EN |
113 | * (Technically paths_to_free may track some strings that were |
114 | * removed from froms paths.) | |
5b59c3db EN |
115 | * |
116 | * The values of paths: | |
117 | * * either a pointer to a merged_info, or a conflict_info struct | |
118 | * * merged_info contains all relevant information for a | |
119 | * non-conflicted entry. | |
120 | * * conflict_info contains a merged_info, plus any additional | |
121 | * information about a conflict such as the higher orders stages | |
122 | * involved and the names of the paths those came from (handy | |
123 | * once renames get involved). | |
124 | * * a path may start "conflicted" (i.e. point to a conflict_info) | |
125 | * and then a later step (e.g. three-way content merge) determines | |
126 | * it can be cleanly merged, at which point it'll be marked clean | |
127 | * and the algorithm will ignore any data outside the contained | |
128 | * merged_info for that entry | |
129 | * * If an entry remains conflicted, the merged_info portion of a | |
130 | * conflict_info will later be filled with whatever version of | |
131 | * the file should be placed in the working directory (e.g. an | |
132 | * as-merged-as-possible variation that contains conflict markers). | |
133 | */ | |
134 | struct strmap paths; | |
135 | ||
136 | /* | |
137 | * conflicted: a subset of keys->values from "paths" | |
138 | * | |
139 | * conflicted is basically an optimization between process_entries() | |
140 | * and record_conflicted_index_entries(); the latter could loop over | |
141 | * ALL the entries in paths AGAIN and look for the ones that are | |
142 | * still conflicted, but since process_entries() has to loop over | |
143 | * all of them, it saves the ones it couldn't resolve in this strmap | |
144 | * so that record_conflicted_index_entries() can iterate just the | |
145 | * relevant entries. | |
146 | */ | |
147 | struct strmap conflicted; | |
148 | ||
43c1dccb EN |
149 | /* |
150 | * paths_to_free: additional list of strings to free | |
151 | * | |
152 | * If keys are removed from "paths", they are added to paths_to_free | |
153 | * to ensure they are later freed. We avoid free'ing immediately since | |
154 | * other places (e.g. conflict_info.pathnames[]) may still be | |
155 | * referencing these paths. | |
156 | */ | |
157 | struct string_list paths_to_free; | |
158 | ||
c5a6f655 EN |
159 | /* |
160 | * output: special messages and conflict notices for various paths | |
161 | * | |
162 | * This is a map of pathnames (a subset of the keys in "paths" above) | |
163 | * to strbufs. It gathers various warning/conflict/notice messages | |
164 | * for later processing. | |
165 | */ | |
166 | struct strmap output; | |
167 | ||
864075ec EN |
168 | /* |
169 | * renames: various data relating to rename detection | |
170 | */ | |
171 | struct rename_info renames; | |
172 | ||
5b59c3db | 173 | /* |
05b85c6e | 174 | * current_dir_name, toplevel_dir: temporary vars |
5b59c3db | 175 | * |
05b85c6e EN |
176 | * These are used in collect_merge_info_callback(), and will set the |
177 | * various merged_info.directory_name for the various paths we get; | |
178 | * see documentation for that variable and the requirements placed on | |
179 | * that field. | |
5b59c3db EN |
180 | */ |
181 | const char *current_dir_name; | |
05b85c6e | 182 | const char *toplevel_dir; |
5b59c3db EN |
183 | |
184 | /* call_depth: recursion level counter for merging merge bases */ | |
185 | int call_depth; | |
186 | }; | |
187 | ||
188 | struct version_info { | |
189 | struct object_id oid; | |
190 | unsigned short mode; | |
191 | }; | |
192 | ||
193 | struct merged_info { | |
194 | /* if is_null, ignore result. otherwise result has oid & mode */ | |
195 | struct version_info result; | |
196 | unsigned is_null:1; | |
197 | ||
198 | /* | |
199 | * clean: whether the path in question is cleanly merged. | |
200 | * | |
201 | * see conflict_info.merged for more details. | |
202 | */ | |
203 | unsigned clean:1; | |
204 | ||
205 | /* | |
206 | * basename_offset: offset of basename of path. | |
207 | * | |
208 | * perf optimization to avoid recomputing offset of final '/' | |
209 | * character in pathname (0 if no '/' in pathname). | |
210 | */ | |
211 | size_t basename_offset; | |
212 | ||
213 | /* | |
214 | * directory_name: containing directory name. | |
215 | * | |
216 | * Note that we assume directory_name is constructed such that | |
217 | * strcmp(dir1_name, dir2_name) == 0 iff dir1_name == dir2_name, | |
218 | * i.e. string equality is equivalent to pointer equality. For this | |
219 | * to hold, we have to be careful setting directory_name. | |
220 | */ | |
221 | const char *directory_name; | |
222 | }; | |
223 | ||
224 | struct conflict_info { | |
225 | /* | |
226 | * merged: the version of the path that will be written to working tree | |
227 | * | |
228 | * WARNING: It is critical to check merged.clean and ensure it is 0 | |
229 | * before reading any conflict_info fields outside of merged. | |
230 | * Allocated merge_info structs will always have clean set to 1. | |
231 | * Allocated conflict_info structs will have merged.clean set to 0 | |
232 | * initially. The merged.clean field is how we know if it is safe | |
233 | * to access other parts of conflict_info besides merged; if a | |
234 | * conflict_info's merged.clean is changed to 1, the rest of the | |
235 | * algorithm is not allowed to look at anything outside of the | |
236 | * merged member anymore. | |
237 | */ | |
238 | struct merged_info merged; | |
239 | ||
240 | /* oids & modes from each of the three trees for this path */ | |
241 | struct version_info stages[3]; | |
242 | ||
243 | /* pathnames for each stage; may differ due to rename detection */ | |
244 | const char *pathnames[3]; | |
245 | ||
246 | /* Whether this path is/was involved in a directory/file conflict */ | |
247 | unsigned df_conflict:1; | |
248 | ||
1c7873cd EN |
249 | /* |
250 | * Whether this path is/was involved in a non-content conflict other | |
251 | * than a directory/file conflict (e.g. rename/rename, rename/delete, | |
252 | * file location based on possible directory rename). | |
253 | */ | |
254 | unsigned path_conflict:1; | |
255 | ||
5b59c3db EN |
256 | /* |
257 | * For filemask and dirmask, the ith bit corresponds to whether the | |
258 | * ith entry is a file (filemask) or a directory (dirmask). Thus, | |
259 | * filemask & dirmask is always zero, and filemask | dirmask is at | |
260 | * most 7 but can be less when a path does not appear as either a | |
261 | * file or a directory on at least one side of history. | |
262 | * | |
263 | * Note that these masks are related to enum merge_side, as the ith | |
264 | * entry corresponds to side i. | |
265 | * | |
266 | * These values come from a traverse_trees() call; more info may be | |
267 | * found looking at tree-walk.h's struct traverse_info, | |
268 | * particularly the documentation above the "fn" member (note that | |
269 | * filemask = mask & ~dirmask from that documentation). | |
270 | */ | |
271 | unsigned filemask:3; | |
272 | unsigned dirmask:3; | |
273 | ||
274 | /* | |
275 | * Optimization to track which stages match, to avoid the need to | |
276 | * recompute it in multiple steps. Either 0 or at least 2 bits are | |
277 | * set; if at least 2 bits are set, their corresponding stages match. | |
278 | */ | |
279 | unsigned match_mask:3; | |
280 | }; | |
281 | ||
04af1879 EN |
282 | /*** Function Grouping: various utility functions ***/ |
283 | ||
98bf9841 EN |
284 | /* |
285 | * For the next three macros, see warning for conflict_info.merged. | |
286 | * | |
287 | * In each of the below, mi is a struct merged_info*, and ci was defined | |
288 | * as a struct conflict_info* (but we need to verify ci isn't actually | |
289 | * pointed at a struct merged_info*). | |
290 | * | |
291 | * INITIALIZE_CI: Assign ci to mi but only if it's safe; set to NULL otherwise. | |
292 | * VERIFY_CI: Ensure that something we assigned to a conflict_info* is one. | |
293 | * ASSIGN_AND_VERIFY_CI: Similar to VERIFY_CI but do assignment first. | |
294 | */ | |
295 | #define INITIALIZE_CI(ci, mi) do { \ | |
296 | (ci) = (!(mi) || (mi)->clean) ? NULL : (struct conflict_info *)(mi); \ | |
297 | } while (0) | |
298 | #define VERIFY_CI(ci) assert(ci && !ci->merged.clean); | |
299 | #define ASSIGN_AND_VERIFY_CI(ci, mi) do { \ | |
300 | (ci) = (struct conflict_info *)(mi); \ | |
301 | assert((ci) && !(mi)->clean); \ | |
302 | } while (0) | |
303 | ||
89422d29 EN |
304 | static void free_strmap_strings(struct strmap *map) |
305 | { | |
306 | struct hashmap_iter iter; | |
307 | struct strmap_entry *entry; | |
308 | ||
309 | strmap_for_each_entry(map, &iter, entry) { | |
310 | free((char*)entry->key); | |
311 | } | |
312 | } | |
313 | ||
43e9c4ee EN |
314 | static void clear_or_reinit_internal_opts(struct merge_options_internal *opti, |
315 | int reinitialize) | |
101bc5bc | 316 | { |
f5d9fbc2 EN |
317 | struct rename_info *renames = &opti->renames; |
318 | int i; | |
43e9c4ee EN |
319 | void (*strmap_func)(struct strmap *, int) = |
320 | reinitialize ? strmap_partial_clear : strmap_clear; | |
f5d9fbc2 EN |
321 | void (*strset_func)(struct strset *) = |
322 | reinitialize ? strset_partial_clear : strset_clear; | |
101bc5bc EN |
323 | |
324 | /* | |
325 | * We marked opti->paths with strdup_strings = 0, so that we | |
326 | * wouldn't have to make another copy of the fullpath created by | |
327 | * make_traverse_path from setup_path_info(). But, now that we've | |
328 | * used it and have no other references to these strings, it is time | |
329 | * to deallocate them. | |
330 | */ | |
331 | free_strmap_strings(&opti->paths); | |
43e9c4ee | 332 | strmap_func(&opti->paths, 1); |
101bc5bc EN |
333 | |
334 | /* | |
335 | * All keys and values in opti->conflicted are a subset of those in | |
336 | * opti->paths. We don't want to deallocate anything twice, so we | |
337 | * don't free the keys and we pass 0 for free_values. | |
338 | */ | |
43e9c4ee | 339 | strmap_func(&opti->conflicted, 0); |
43c1dccb EN |
340 | |
341 | /* | |
342 | * opti->paths_to_free is similar to opti->paths; we created it with | |
343 | * strdup_strings = 0 to avoid making _another_ copy of the fullpath | |
344 | * but now that we've used it and have no other references to these | |
345 | * strings, it is time to deallocate them. We do so by temporarily | |
346 | * setting strdup_strings to 1. | |
347 | */ | |
348 | opti->paths_to_free.strdup_strings = 1; | |
349 | string_list_clear(&opti->paths_to_free, 0); | |
350 | opti->paths_to_free.strdup_strings = 0; | |
c5a6f655 | 351 | |
f5d9fbc2 EN |
352 | /* Free memory used by various renames maps */ |
353 | for (i = MERGE_SIDE1; i <= MERGE_SIDE2; ++i) { | |
354 | struct hashmap_iter iter; | |
355 | struct strmap_entry *entry; | |
356 | ||
357 | strset_func(&renames->dirs_removed[i]); | |
358 | ||
359 | strmap_for_each_entry(&renames->dir_rename_count[i], | |
360 | &iter, entry) { | |
361 | struct strintmap *counts = entry->value; | |
362 | strintmap_clear(counts); | |
363 | } | |
364 | strmap_func(&renames->dir_rename_count[i], 1); | |
365 | ||
366 | strmap_func(&renames->dir_renames[i], 0); | |
367 | } | |
368 | ||
c5a6f655 EN |
369 | if (!reinitialize) { |
370 | struct hashmap_iter iter; | |
371 | struct strmap_entry *e; | |
372 | ||
373 | /* Release and free each strbuf found in output */ | |
374 | strmap_for_each_entry(&opti->output, &iter, e) { | |
375 | struct strbuf *sb = e->value; | |
376 | strbuf_release(sb); | |
377 | /* | |
378 | * While strictly speaking we don't need to free(sb) | |
379 | * here because we could pass free_values=1 when | |
380 | * calling strmap_clear() on opti->output, that would | |
381 | * require strmap_clear to do another | |
382 | * strmap_for_each_entry() loop, so we just free it | |
383 | * while we're iterating anyway. | |
384 | */ | |
385 | free(sb); | |
386 | } | |
387 | strmap_clear(&opti->output, 0); | |
388 | } | |
101bc5bc EN |
389 | } |
390 | ||
0c0d705b EN |
391 | static int err(struct merge_options *opt, const char *err, ...) |
392 | { | |
393 | va_list params; | |
394 | struct strbuf sb = STRBUF_INIT; | |
395 | ||
396 | strbuf_addstr(&sb, "error: "); | |
397 | va_start(params, err); | |
398 | strbuf_vaddf(&sb, err, params); | |
399 | va_end(params); | |
400 | ||
401 | error("%s", sb.buf); | |
402 | strbuf_release(&sb); | |
403 | ||
404 | return -1; | |
405 | } | |
406 | ||
c73cda76 EN |
407 | static void format_commit(struct strbuf *sb, |
408 | int indent, | |
409 | struct commit *commit) | |
410 | { | |
70f19c7f EN |
411 | struct merge_remote_desc *desc; |
412 | struct pretty_print_context ctx = {0}; | |
413 | ctx.abbrev = DEFAULT_ABBREV; | |
414 | ||
415 | strbuf_addchars(sb, ' ', indent); | |
416 | desc = merge_remote_util(commit); | |
417 | if (desc) { | |
418 | strbuf_addf(sb, "virtual %s\n", desc->name); | |
419 | return; | |
420 | } | |
421 | ||
422 | format_commit_message(commit, "%h %s", sb, &ctx); | |
423 | strbuf_addch(sb, '\n'); | |
c73cda76 EN |
424 | } |
425 | ||
c5a6f655 EN |
426 | __attribute__((format (printf, 4, 5))) |
427 | static void path_msg(struct merge_options *opt, | |
428 | const char *path, | |
429 | int omittable_hint, /* skippable under --remerge-diff */ | |
430 | const char *fmt, ...) | |
431 | { | |
432 | va_list ap; | |
433 | struct strbuf *sb = strmap_get(&opt->priv->output, path); | |
434 | if (!sb) { | |
435 | sb = xmalloc(sizeof(*sb)); | |
436 | strbuf_init(sb, 0); | |
437 | strmap_put(&opt->priv->output, path, sb); | |
438 | } | |
439 | ||
440 | va_start(ap, fmt); | |
441 | strbuf_vaddf(sb, fmt, ap); | |
442 | va_end(ap); | |
443 | ||
444 | strbuf_addch(sb, '\n'); | |
445 | } | |
446 | ||
5a1a1e8e EN |
447 | /* add a string to a strbuf, but converting "/" to "_" */ |
448 | static void add_flattened_path(struct strbuf *out, const char *s) | |
449 | { | |
450 | size_t i = out->len; | |
451 | strbuf_addstr(out, s); | |
452 | for (; i < out->len; i++) | |
453 | if (out->buf[i] == '/') | |
454 | out->buf[i] = '_'; | |
455 | } | |
456 | ||
23366d2a EN |
457 | static char *unique_path(struct strmap *existing_paths, |
458 | const char *path, | |
459 | const char *branch) | |
460 | { | |
5a1a1e8e EN |
461 | struct strbuf newpath = STRBUF_INIT; |
462 | int suffix = 0; | |
463 | size_t base_len; | |
464 | ||
465 | strbuf_addf(&newpath, "%s~", path); | |
466 | add_flattened_path(&newpath, branch); | |
467 | ||
468 | base_len = newpath.len; | |
469 | while (strmap_contains(existing_paths, newpath.buf)) { | |
470 | strbuf_setlen(&newpath, base_len); | |
471 | strbuf_addf(&newpath, "_%d", suffix++); | |
472 | } | |
473 | ||
474 | return strbuf_detach(&newpath, NULL); | |
23366d2a EN |
475 | } |
476 | ||
04af1879 EN |
477 | /*** Function Grouping: functions related to collect_merge_info() ***/ |
478 | ||
98bf9841 EN |
479 | static void setup_path_info(struct merge_options *opt, |
480 | struct string_list_item *result, | |
481 | const char *current_dir_name, | |
482 | int current_dir_name_len, | |
483 | char *fullpath, /* we'll take over ownership */ | |
484 | struct name_entry *names, | |
485 | struct name_entry *merged_version, | |
486 | unsigned is_null, /* boolean */ | |
487 | unsigned df_conflict, /* boolean */ | |
488 | unsigned filemask, | |
489 | unsigned dirmask, | |
490 | int resolved /* boolean */) | |
491 | { | |
492 | /* result->util is void*, so mi is a convenience typed variable */ | |
493 | struct merged_info *mi; | |
494 | ||
495 | assert(!is_null || resolved); | |
496 | assert(!df_conflict || !resolved); /* df_conflict implies !resolved */ | |
497 | assert(resolved == (merged_version != NULL)); | |
498 | ||
499 | mi = xcalloc(1, resolved ? sizeof(struct merged_info) : | |
500 | sizeof(struct conflict_info)); | |
501 | mi->directory_name = current_dir_name; | |
502 | mi->basename_offset = current_dir_name_len; | |
503 | mi->clean = !!resolved; | |
504 | if (resolved) { | |
505 | mi->result.mode = merged_version->mode; | |
506 | oidcpy(&mi->result.oid, &merged_version->oid); | |
507 | mi->is_null = !!is_null; | |
508 | } else { | |
509 | int i; | |
510 | struct conflict_info *ci; | |
511 | ||
512 | ASSIGN_AND_VERIFY_CI(ci, mi); | |
513 | for (i = MERGE_BASE; i <= MERGE_SIDE2; i++) { | |
514 | ci->pathnames[i] = fullpath; | |
515 | ci->stages[i].mode = names[i].mode; | |
516 | oidcpy(&ci->stages[i].oid, &names[i].oid); | |
517 | } | |
518 | ci->filemask = filemask; | |
519 | ci->dirmask = dirmask; | |
520 | ci->df_conflict = !!df_conflict; | |
521 | if (dirmask) | |
522 | /* | |
523 | * Assume is_null for now, but if we have entries | |
524 | * under the directory then when it is complete in | |
525 | * write_completed_directory() it'll update this. | |
526 | * Also, for D/F conflicts, we have to handle the | |
527 | * directory first, then clear this bit and process | |
528 | * the file to see how it is handled -- that occurs | |
529 | * near the top of process_entry(). | |
530 | */ | |
531 | mi->is_null = 1; | |
532 | } | |
533 | strmap_put(&opt->priv->paths, fullpath, mi); | |
534 | result->string = fullpath; | |
535 | result->util = mi; | |
536 | } | |
537 | ||
eb3e3e1d EN |
538 | static void collect_rename_info(struct merge_options *opt, |
539 | struct name_entry *names, | |
540 | const char *dirname, | |
541 | const char *fullname, | |
542 | unsigned filemask, | |
543 | unsigned dirmask, | |
544 | unsigned match_mask) | |
545 | { | |
546 | struct rename_info *renames = &opt->priv->renames; | |
547 | ||
548 | /* Update dirs_removed, as needed */ | |
549 | if (dirmask == 1 || dirmask == 3 || dirmask == 5) { | |
550 | /* absent_mask = 0x07 - dirmask; sides = absent_mask/2 */ | |
551 | unsigned sides = (0x07 - dirmask)/2; | |
552 | if (sides & 1) | |
553 | strset_add(&renames->dirs_removed[1], fullname); | |
554 | if (sides & 2) | |
555 | strset_add(&renames->dirs_removed[2], fullname); | |
556 | } | |
557 | } | |
558 | ||
d2bc1994 EN |
559 | static int collect_merge_info_callback(int n, |
560 | unsigned long mask, | |
561 | unsigned long dirmask, | |
562 | struct name_entry *names, | |
563 | struct traverse_info *info) | |
564 | { | |
565 | /* | |
566 | * n is 3. Always. | |
567 | * common ancestor (mbase) has mask 1, and stored in index 0 of names | |
568 | * head of side 1 (side1) has mask 2, and stored in index 1 of names | |
569 | * head of side 2 (side2) has mask 4, and stored in index 2 of names | |
570 | */ | |
571 | struct merge_options *opt = info->data; | |
572 | struct merge_options_internal *opti = opt->priv; | |
98bf9841 EN |
573 | struct string_list_item pi; /* Path Info */ |
574 | struct conflict_info *ci; /* typed alias to pi.util (which is void*) */ | |
d2bc1994 EN |
575 | struct name_entry *p; |
576 | size_t len; | |
577 | char *fullpath; | |
98bf9841 | 578 | const char *dirname = opti->current_dir_name; |
d2bc1994 | 579 | unsigned filemask = mask & ~dirmask; |
34e557af | 580 | unsigned match_mask = 0; /* will be updated below */ |
d2bc1994 EN |
581 | unsigned mbase_null = !(mask & 1); |
582 | unsigned side1_null = !(mask & 2); | |
583 | unsigned side2_null = !(mask & 4); | |
885f0063 EN |
584 | unsigned side1_matches_mbase = (!side1_null && !mbase_null && |
585 | names[0].mode == names[1].mode && | |
586 | oideq(&names[0].oid, &names[1].oid)); | |
587 | unsigned side2_matches_mbase = (!side2_null && !mbase_null && | |
588 | names[0].mode == names[2].mode && | |
589 | oideq(&names[0].oid, &names[2].oid)); | |
590 | unsigned sides_match = (!side1_null && !side2_null && | |
591 | names[1].mode == names[2].mode && | |
592 | oideq(&names[1].oid, &names[2].oid)); | |
d2bc1994 | 593 | |
34e557af EN |
594 | /* |
595 | * Note: When a path is a file on one side of history and a directory | |
596 | * in another, we have a directory/file conflict. In such cases, if | |
597 | * the conflict doesn't resolve from renames and deletions, then we | |
598 | * always leave directories where they are and move files out of the | |
599 | * way. Thus, while struct conflict_info has a df_conflict field to | |
600 | * track such conflicts, we ignore that field for any directories at | |
601 | * a path and only pay attention to it for files at the given path. | |
602 | * The fact that we leave directories were they are also means that | |
603 | * we do not need to worry about getting additional df_conflict | |
604 | * information propagated from parent directories down to children | |
605 | * (unlike, say traverse_trees_recursive() in unpack-trees.c, which | |
606 | * sets a newinfo.df_conflicts field specifically to propagate it). | |
607 | */ | |
608 | unsigned df_conflict = (filemask != 0) && (dirmask != 0); | |
609 | ||
d2bc1994 EN |
610 | /* n = 3 is a fundamental assumption. */ |
611 | if (n != 3) | |
612 | BUG("Called collect_merge_info_callback wrong"); | |
613 | ||
614 | /* | |
615 | * A bunch of sanity checks verifying that traverse_trees() calls | |
616 | * us the way I expect. Could just remove these at some point, | |
617 | * though maybe they are helpful to future code readers. | |
618 | */ | |
619 | assert(mbase_null == is_null_oid(&names[0].oid)); | |
620 | assert(side1_null == is_null_oid(&names[1].oid)); | |
621 | assert(side2_null == is_null_oid(&names[2].oid)); | |
622 | assert(!mbase_null || !side1_null || !side2_null); | |
623 | assert(mask > 0 && mask < 8); | |
624 | ||
34e557af EN |
625 | /* Determine match_mask */ |
626 | if (side1_matches_mbase) | |
627 | match_mask = (side2_matches_mbase ? 7 : 3); | |
628 | else if (side2_matches_mbase) | |
629 | match_mask = 5; | |
630 | else if (sides_match) | |
631 | match_mask = 6; | |
632 | ||
d2bc1994 EN |
633 | /* |
634 | * Get the name of the relevant filepath, which we'll pass to | |
635 | * setup_path_info() for tracking. | |
636 | */ | |
637 | p = names; | |
638 | while (!p->mode) | |
639 | p++; | |
640 | len = traverse_path_len(info, p->pathlen); | |
641 | ||
642 | /* +1 in both of the following lines to include the NUL byte */ | |
643 | fullpath = xmalloc(len + 1); | |
644 | make_traverse_path(fullpath, len + 1, info, p->path, p->pathlen); | |
645 | ||
291f29ca EN |
646 | /* |
647 | * If mbase, side1, and side2 all match, we can resolve early. Even | |
648 | * if these are trees, there will be no renames or anything | |
649 | * underneath. | |
650 | */ | |
651 | if (side1_matches_mbase && side2_matches_mbase) { | |
652 | /* mbase, side1, & side2 all match; use mbase as resolution */ | |
653 | setup_path_info(opt, &pi, dirname, info->pathlen, fullpath, | |
654 | names, names+0, mbase_null, 0, | |
655 | filemask, dirmask, 1); | |
656 | return mask; | |
657 | } | |
658 | ||
eb3e3e1d EN |
659 | /* |
660 | * Gather additional information used in rename detection. | |
661 | */ | |
662 | collect_rename_info(opt, names, dirname, fullpath, | |
663 | filemask, dirmask, match_mask); | |
664 | ||
d2bc1994 | 665 | /* |
98bf9841 EN |
666 | * Record information about the path so we can resolve later in |
667 | * process_entries. | |
d2bc1994 | 668 | */ |
98bf9841 EN |
669 | setup_path_info(opt, &pi, dirname, info->pathlen, fullpath, |
670 | names, NULL, 0, df_conflict, filemask, dirmask, 0); | |
671 | ||
672 | ci = pi.util; | |
673 | VERIFY_CI(ci); | |
34e557af | 674 | ci->match_mask = match_mask; |
d2bc1994 EN |
675 | |
676 | /* If dirmask, recurse into subdirectories */ | |
677 | if (dirmask) { | |
678 | struct traverse_info newinfo; | |
679 | struct tree_desc t[3]; | |
680 | void *buf[3] = {NULL, NULL, NULL}; | |
681 | const char *original_dir_name; | |
682 | int i, ret; | |
683 | ||
684 | ci->match_mask &= filemask; | |
685 | newinfo = *info; | |
686 | newinfo.prev = info; | |
687 | newinfo.name = p->path; | |
688 | newinfo.namelen = p->pathlen; | |
689 | newinfo.pathlen = st_add3(newinfo.pathlen, p->pathlen, 1); | |
34e557af EN |
690 | /* |
691 | * If this directory we are about to recurse into cared about | |
692 | * its parent directory (the current directory) having a D/F | |
693 | * conflict, then we'd propagate the masks in this way: | |
694 | * newinfo.df_conflicts |= (mask & ~dirmask); | |
695 | * But we don't worry about propagating D/F conflicts. (See | |
696 | * comment near setting of local df_conflict variable near | |
697 | * the beginning of this function). | |
698 | */ | |
d2bc1994 EN |
699 | |
700 | for (i = MERGE_BASE; i <= MERGE_SIDE2; i++) { | |
885f0063 EN |
701 | if (i == 1 && side1_matches_mbase) |
702 | t[1] = t[0]; | |
703 | else if (i == 2 && side2_matches_mbase) | |
704 | t[2] = t[0]; | |
705 | else if (i == 2 && sides_match) | |
706 | t[2] = t[1]; | |
707 | else { | |
708 | const struct object_id *oid = NULL; | |
709 | if (dirmask & 1) | |
710 | oid = &names[i].oid; | |
711 | buf[i] = fill_tree_descriptor(opt->repo, | |
712 | t + i, oid); | |
713 | } | |
d2bc1994 EN |
714 | dirmask >>= 1; |
715 | } | |
716 | ||
717 | original_dir_name = opti->current_dir_name; | |
98bf9841 | 718 | opti->current_dir_name = pi.string; |
d2bc1994 EN |
719 | ret = traverse_trees(NULL, 3, t, &newinfo); |
720 | opti->current_dir_name = original_dir_name; | |
721 | ||
722 | for (i = MERGE_BASE; i <= MERGE_SIDE2; i++) | |
723 | free(buf[i]); | |
724 | ||
725 | if (ret < 0) | |
726 | return -1; | |
727 | } | |
728 | ||
729 | return mask; | |
730 | } | |
731 | ||
231e2dd4 EN |
732 | static int collect_merge_info(struct merge_options *opt, |
733 | struct tree *merge_base, | |
734 | struct tree *side1, | |
735 | struct tree *side2) | |
736 | { | |
d2bc1994 EN |
737 | int ret; |
738 | struct tree_desc t[3]; | |
739 | struct traverse_info info; | |
d2bc1994 | 740 | |
05b85c6e EN |
741 | opt->priv->toplevel_dir = ""; |
742 | opt->priv->current_dir_name = opt->priv->toplevel_dir; | |
743 | setup_traverse_info(&info, opt->priv->toplevel_dir); | |
d2bc1994 EN |
744 | info.fn = collect_merge_info_callback; |
745 | info.data = opt; | |
746 | info.show_all_errors = 1; | |
747 | ||
748 | parse_tree(merge_base); | |
749 | parse_tree(side1); | |
750 | parse_tree(side2); | |
751 | init_tree_desc(t + 0, merge_base->buffer, merge_base->size); | |
752 | init_tree_desc(t + 1, side1->buffer, side1->size); | |
753 | init_tree_desc(t + 2, side2->buffer, side2->size); | |
754 | ||
755 | ret = traverse_trees(NULL, 3, t, &info); | |
756 | ||
757 | return ret; | |
231e2dd4 EN |
758 | } |
759 | ||
04af1879 EN |
760 | /*** Function Grouping: functions related to threeway content merges ***/ |
761 | ||
c73cda76 EN |
762 | static int find_first_merges(struct repository *repo, |
763 | const char *path, | |
764 | struct commit *a, | |
765 | struct commit *b, | |
766 | struct object_array *result) | |
767 | { | |
4204cd59 EN |
768 | int i, j; |
769 | struct object_array merges = OBJECT_ARRAY_INIT; | |
770 | struct commit *commit; | |
771 | int contains_another; | |
772 | ||
773 | char merged_revision[GIT_MAX_HEXSZ + 2]; | |
774 | const char *rev_args[] = { "rev-list", "--merges", "--ancestry-path", | |
775 | "--all", merged_revision, NULL }; | |
776 | struct rev_info revs; | |
777 | struct setup_revision_opt rev_opts; | |
778 | ||
779 | memset(result, 0, sizeof(struct object_array)); | |
780 | memset(&rev_opts, 0, sizeof(rev_opts)); | |
781 | ||
782 | /* get all revisions that merge commit a */ | |
783 | xsnprintf(merged_revision, sizeof(merged_revision), "^%s", | |
784 | oid_to_hex(&a->object.oid)); | |
785 | repo_init_revisions(repo, &revs, NULL); | |
786 | rev_opts.submodule = path; | |
787 | /* FIXME: can't handle linked worktrees in submodules yet */ | |
788 | revs.single_worktree = path != NULL; | |
789 | setup_revisions(ARRAY_SIZE(rev_args)-1, rev_args, &revs, &rev_opts); | |
790 | ||
791 | /* save all revisions from the above list that contain b */ | |
792 | if (prepare_revision_walk(&revs)) | |
793 | die("revision walk setup failed"); | |
794 | while ((commit = get_revision(&revs)) != NULL) { | |
795 | struct object *o = &(commit->object); | |
796 | if (in_merge_bases(b, commit)) | |
797 | add_object_array(o, NULL, &merges); | |
798 | } | |
799 | reset_revision_walk(); | |
800 | ||
801 | /* Now we've got all merges that contain a and b. Prune all | |
802 | * merges that contain another found merge and save them in | |
803 | * result. | |
804 | */ | |
805 | for (i = 0; i < merges.nr; i++) { | |
806 | struct commit *m1 = (struct commit *) merges.objects[i].item; | |
807 | ||
808 | contains_another = 0; | |
809 | for (j = 0; j < merges.nr; j++) { | |
810 | struct commit *m2 = (struct commit *) merges.objects[j].item; | |
811 | if (i != j && in_merge_bases(m2, m1)) { | |
812 | contains_another = 1; | |
813 | break; | |
814 | } | |
815 | } | |
816 | ||
817 | if (!contains_another) | |
818 | add_object_array(merges.objects[i].item, NULL, result); | |
819 | } | |
820 | ||
821 | object_array_clear(&merges); | |
822 | return result->nr; | |
c73cda76 EN |
823 | } |
824 | ||
62fdec17 EN |
825 | static int merge_submodule(struct merge_options *opt, |
826 | const char *path, | |
827 | const struct object_id *o, | |
828 | const struct object_id *a, | |
829 | const struct object_id *b, | |
830 | struct object_id *result) | |
831 | { | |
c73cda76 EN |
832 | struct commit *commit_o, *commit_a, *commit_b; |
833 | int parent_count; | |
834 | struct object_array merges; | |
835 | struct strbuf sb = STRBUF_INIT; | |
836 | ||
837 | int i; | |
838 | int search = !opt->priv->call_depth; | |
839 | ||
840 | /* store fallback answer in result in case we fail */ | |
841 | oidcpy(result, opt->priv->call_depth ? o : a); | |
842 | ||
843 | /* we can not handle deletion conflicts */ | |
844 | if (is_null_oid(o)) | |
845 | return 0; | |
846 | if (is_null_oid(a)) | |
847 | return 0; | |
848 | if (is_null_oid(b)) | |
849 | return 0; | |
850 | ||
851 | if (add_submodule_odb(path)) { | |
852 | path_msg(opt, path, 0, | |
853 | _("Failed to merge submodule %s (not checked out)"), | |
854 | path); | |
855 | return 0; | |
856 | } | |
857 | ||
858 | if (!(commit_o = lookup_commit_reference(opt->repo, o)) || | |
859 | !(commit_a = lookup_commit_reference(opt->repo, a)) || | |
860 | !(commit_b = lookup_commit_reference(opt->repo, b))) { | |
861 | path_msg(opt, path, 0, | |
862 | _("Failed to merge submodule %s (commits not present)"), | |
863 | path); | |
864 | return 0; | |
865 | } | |
866 | ||
867 | /* check whether both changes are forward */ | |
868 | if (!in_merge_bases(commit_o, commit_a) || | |
869 | !in_merge_bases(commit_o, commit_b)) { | |
870 | path_msg(opt, path, 0, | |
871 | _("Failed to merge submodule %s " | |
872 | "(commits don't follow merge-base)"), | |
873 | path); | |
874 | return 0; | |
875 | } | |
876 | ||
877 | /* Case #1: a is contained in b or vice versa */ | |
878 | if (in_merge_bases(commit_a, commit_b)) { | |
879 | oidcpy(result, b); | |
880 | path_msg(opt, path, 1, | |
881 | _("Note: Fast-forwarding submodule %s to %s"), | |
882 | path, oid_to_hex(b)); | |
883 | return 1; | |
884 | } | |
885 | if (in_merge_bases(commit_b, commit_a)) { | |
886 | oidcpy(result, a); | |
887 | path_msg(opt, path, 1, | |
888 | _("Note: Fast-forwarding submodule %s to %s"), | |
889 | path, oid_to_hex(a)); | |
890 | return 1; | |
891 | } | |
892 | ||
893 | /* | |
894 | * Case #2: There are one or more merges that contain a and b in | |
895 | * the submodule. If there is only one, then present it as a | |
896 | * suggestion to the user, but leave it marked unmerged so the | |
897 | * user needs to confirm the resolution. | |
898 | */ | |
899 | ||
900 | /* Skip the search if makes no sense to the calling context. */ | |
901 | if (!search) | |
902 | return 0; | |
903 | ||
904 | /* find commit which merges them */ | |
905 | parent_count = find_first_merges(opt->repo, path, commit_a, commit_b, | |
906 | &merges); | |
907 | switch (parent_count) { | |
908 | case 0: | |
909 | path_msg(opt, path, 0, _("Failed to merge submodule %s"), path); | |
910 | break; | |
911 | ||
912 | case 1: | |
913 | format_commit(&sb, 4, | |
914 | (struct commit *)merges.objects[0].item); | |
915 | path_msg(opt, path, 0, | |
916 | _("Failed to merge submodule %s, but a possible merge " | |
917 | "resolution exists:\n%s\n"), | |
918 | path, sb.buf); | |
919 | path_msg(opt, path, 1, | |
920 | _("If this is correct simply add it to the index " | |
921 | "for example\n" | |
922 | "by using:\n\n" | |
923 | " git update-index --cacheinfo 160000 %s \"%s\"\n\n" | |
924 | "which will accept this suggestion.\n"), | |
925 | oid_to_hex(&merges.objects[0].item->oid), path); | |
926 | strbuf_release(&sb); | |
927 | break; | |
928 | default: | |
929 | for (i = 0; i < merges.nr; i++) | |
930 | format_commit(&sb, 4, | |
931 | (struct commit *)merges.objects[i].item); | |
932 | path_msg(opt, path, 0, | |
933 | _("Failed to merge submodule %s, but multiple " | |
934 | "possible merges exist:\n%s"), path, sb.buf); | |
935 | strbuf_release(&sb); | |
936 | } | |
937 | ||
938 | object_array_clear(&merges); | |
939 | return 0; | |
62fdec17 EN |
940 | } |
941 | ||
942 | static int merge_3way(struct merge_options *opt, | |
943 | const char *path, | |
944 | const struct object_id *o, | |
945 | const struct object_id *a, | |
946 | const struct object_id *b, | |
947 | const char *pathnames[3], | |
948 | const int extra_marker_size, | |
949 | mmbuffer_t *result_buf) | |
950 | { | |
f591c472 EN |
951 | mmfile_t orig, src1, src2; |
952 | struct ll_merge_options ll_opts = {0}; | |
953 | char *base, *name1, *name2; | |
954 | int merge_status; | |
955 | ||
956 | ll_opts.renormalize = opt->renormalize; | |
957 | ll_opts.extra_marker_size = extra_marker_size; | |
958 | ll_opts.xdl_opts = opt->xdl_opts; | |
959 | ||
960 | if (opt->priv->call_depth) { | |
961 | ll_opts.virtual_ancestor = 1; | |
962 | ll_opts.variant = 0; | |
963 | } else { | |
964 | switch (opt->recursive_variant) { | |
965 | case MERGE_VARIANT_OURS: | |
966 | ll_opts.variant = XDL_MERGE_FAVOR_OURS; | |
967 | break; | |
968 | case MERGE_VARIANT_THEIRS: | |
969 | ll_opts.variant = XDL_MERGE_FAVOR_THEIRS; | |
970 | break; | |
971 | default: | |
972 | ll_opts.variant = 0; | |
973 | break; | |
974 | } | |
975 | } | |
976 | ||
977 | assert(pathnames[0] && pathnames[1] && pathnames[2] && opt->ancestor); | |
978 | if (pathnames[0] == pathnames[1] && pathnames[1] == pathnames[2]) { | |
979 | base = mkpathdup("%s", opt->ancestor); | |
980 | name1 = mkpathdup("%s", opt->branch1); | |
981 | name2 = mkpathdup("%s", opt->branch2); | |
982 | } else { | |
983 | base = mkpathdup("%s:%s", opt->ancestor, pathnames[0]); | |
984 | name1 = mkpathdup("%s:%s", opt->branch1, pathnames[1]); | |
985 | name2 = mkpathdup("%s:%s", opt->branch2, pathnames[2]); | |
986 | } | |
987 | ||
988 | read_mmblob(&orig, o); | |
989 | read_mmblob(&src1, a); | |
990 | read_mmblob(&src2, b); | |
991 | ||
992 | merge_status = ll_merge(result_buf, path, &orig, base, | |
993 | &src1, name1, &src2, name2, | |
994 | opt->repo->index, &ll_opts); | |
995 | ||
996 | free(base); | |
997 | free(name1); | |
998 | free(name2); | |
999 | free(orig.ptr); | |
1000 | free(src1.ptr); | |
1001 | free(src2.ptr); | |
1002 | return merge_status; | |
62fdec17 EN |
1003 | } |
1004 | ||
e2e9dc03 EN |
1005 | static int handle_content_merge(struct merge_options *opt, |
1006 | const char *path, | |
1007 | const struct version_info *o, | |
1008 | const struct version_info *a, | |
1009 | const struct version_info *b, | |
1010 | const char *pathnames[3], | |
1011 | const int extra_marker_size, | |
1012 | struct version_info *result) | |
1013 | { | |
991bbdca | 1014 | /* |
62fdec17 EN |
1015 | * path is the target location where we want to put the file, and |
1016 | * is used to determine any normalization rules in ll_merge. | |
1017 | * | |
1018 | * The normal case is that path and all entries in pathnames are | |
1019 | * identical, though renames can affect which path we got one of | |
1020 | * the three blobs to merge on various sides of history. | |
1021 | * | |
1022 | * extra_marker_size is the amount to extend conflict markers in | |
1023 | * ll_merge; this is neeed if we have content merges of content | |
1024 | * merges, which happens for example with rename/rename(2to1) and | |
1025 | * rename/add conflicts. | |
1026 | */ | |
1027 | unsigned clean = 1; | |
1028 | ||
1029 | /* | |
1030 | * handle_content_merge() needs both files to be of the same type, i.e. | |
1031 | * both files OR both submodules OR both symlinks. Conflicting types | |
1032 | * needs to be handled elsewhere. | |
991bbdca | 1033 | */ |
62fdec17 EN |
1034 | assert((S_IFMT & a->mode) == (S_IFMT & b->mode)); |
1035 | ||
1036 | /* Merge modes */ | |
1037 | if (a->mode == b->mode || a->mode == o->mode) | |
1038 | result->mode = b->mode; | |
1039 | else { | |
1040 | /* must be the 100644/100755 case */ | |
1041 | assert(S_ISREG(a->mode)); | |
1042 | result->mode = a->mode; | |
1043 | clean = (b->mode == o->mode); | |
1044 | /* | |
1045 | * FIXME: If opt->priv->call_depth && !clean, then we really | |
1046 | * should not make result->mode match either a->mode or | |
1047 | * b->mode; that causes t6036 "check conflicting mode for | |
1048 | * regular file" to fail. It would be best to use some other | |
1049 | * mode, but we'll confuse all kinds of stuff if we use one | |
1050 | * where S_ISREG(result->mode) isn't true, and if we use | |
1051 | * something like 0100666, then tree-walk.c's calls to | |
1052 | * canon_mode() will just normalize that to 100644 for us and | |
1053 | * thus not solve anything. | |
1054 | * | |
1055 | * Figure out if there's some kind of way we can work around | |
1056 | * this... | |
1057 | */ | |
1058 | } | |
1059 | ||
1060 | /* | |
1061 | * Trivial oid merge. | |
1062 | * | |
1063 | * Note: While one might assume that the next four lines would | |
1064 | * be unnecessary due to the fact that match_mask is often | |
1065 | * setup and already handled, renames don't always take care | |
1066 | * of that. | |
1067 | */ | |
1068 | if (oideq(&a->oid, &b->oid) || oideq(&a->oid, &o->oid)) | |
1069 | oidcpy(&result->oid, &b->oid); | |
1070 | else if (oideq(&b->oid, &o->oid)) | |
1071 | oidcpy(&result->oid, &a->oid); | |
1072 | ||
1073 | /* Remaining rules depend on file vs. submodule vs. symlink. */ | |
1074 | else if (S_ISREG(a->mode)) { | |
1075 | mmbuffer_t result_buf; | |
1076 | int ret = 0, merge_status; | |
1077 | int two_way; | |
1078 | ||
1079 | /* | |
1080 | * If 'o' is different type, treat it as null so we do a | |
1081 | * two-way merge. | |
1082 | */ | |
1083 | two_way = ((S_IFMT & o->mode) != (S_IFMT & a->mode)); | |
1084 | ||
1085 | merge_status = merge_3way(opt, path, | |
1086 | two_way ? &null_oid : &o->oid, | |
1087 | &a->oid, &b->oid, | |
1088 | pathnames, extra_marker_size, | |
1089 | &result_buf); | |
1090 | ||
1091 | if ((merge_status < 0) || !result_buf.ptr) | |
1092 | ret = err(opt, _("Failed to execute internal merge")); | |
1093 | ||
1094 | if (!ret && | |
1095 | write_object_file(result_buf.ptr, result_buf.size, | |
1096 | blob_type, &result->oid)) | |
1097 | ret = err(opt, _("Unable to add %s to database"), | |
1098 | path); | |
1099 | ||
1100 | free(result_buf.ptr); | |
1101 | if (ret) | |
1102 | return -1; | |
1103 | clean &= (merge_status == 0); | |
1104 | path_msg(opt, path, 1, _("Auto-merging %s"), path); | |
1105 | } else if (S_ISGITLINK(a->mode)) { | |
1106 | int two_way = ((S_IFMT & o->mode) != (S_IFMT & a->mode)); | |
1107 | clean = merge_submodule(opt, pathnames[0], | |
1108 | two_way ? &null_oid : &o->oid, | |
1109 | &a->oid, &b->oid, &result->oid); | |
1110 | if (opt->priv->call_depth && two_way && !clean) { | |
1111 | result->mode = o->mode; | |
1112 | oidcpy(&result->oid, &o->oid); | |
1113 | } | |
1114 | } else if (S_ISLNK(a->mode)) { | |
1115 | if (opt->priv->call_depth) { | |
1116 | clean = 0; | |
1117 | result->mode = o->mode; | |
1118 | oidcpy(&result->oid, &o->oid); | |
1119 | } else { | |
1120 | switch (opt->recursive_variant) { | |
1121 | case MERGE_VARIANT_NORMAL: | |
1122 | clean = 0; | |
1123 | oidcpy(&result->oid, &a->oid); | |
1124 | break; | |
1125 | case MERGE_VARIANT_OURS: | |
1126 | oidcpy(&result->oid, &a->oid); | |
1127 | break; | |
1128 | case MERGE_VARIANT_THEIRS: | |
1129 | oidcpy(&result->oid, &b->oid); | |
1130 | break; | |
1131 | } | |
1132 | } | |
1133 | } else | |
1134 | BUG("unsupported object type in the tree: %06o for %s", | |
1135 | a->mode, path); | |
1136 | ||
991bbdca | 1137 | return clean; |
e2e9dc03 EN |
1138 | } |
1139 | ||
04af1879 EN |
1140 | /*** Function Grouping: functions related to detect_and_process_renames(), *** |
1141 | *** which are split into directory and regular rename detection sections. ***/ | |
1142 | ||
1143 | /*** Function Grouping: functions related to directory rename detection ***/ | |
1144 | ||
fa5e06d6 EN |
1145 | struct collision_info { |
1146 | struct string_list source_files; | |
1147 | unsigned reported_already:1; | |
1148 | }; | |
1149 | ||
d9d015df EN |
1150 | /* |
1151 | * Return a new string that replaces the beginning portion (which matches | |
1152 | * rename_info->key), with rename_info->util.new_dir. In perl-speak: | |
1153 | * new_path_name = (old_path =~ s/rename_info->key/rename_info->value/); | |
1154 | * NOTE: | |
1155 | * Caller must ensure that old_path starts with rename_info->key + '/'. | |
1156 | */ | |
1157 | static char *apply_dir_rename(struct strmap_entry *rename_info, | |
1158 | const char *old_path) | |
1159 | { | |
fbcfc0cc EN |
1160 | struct strbuf new_path = STRBUF_INIT; |
1161 | const char *old_dir = rename_info->key; | |
1162 | const char *new_dir = rename_info->value; | |
1163 | int oldlen, newlen, new_dir_len; | |
1164 | ||
1165 | oldlen = strlen(old_dir); | |
1166 | if (*new_dir == '\0') | |
1167 | /* | |
1168 | * If someone renamed/merged a subdirectory into the root | |
1169 | * directory (e.g. 'some/subdir' -> ''), then we want to | |
1170 | * avoid returning | |
1171 | * '' + '/filename' | |
1172 | * as the rename; we need to make old_path + oldlen advance | |
1173 | * past the '/' character. | |
1174 | */ | |
1175 | oldlen++; | |
1176 | new_dir_len = strlen(new_dir); | |
1177 | newlen = new_dir_len + (strlen(old_path) - oldlen) + 1; | |
1178 | strbuf_grow(&new_path, newlen); | |
1179 | strbuf_add(&new_path, new_dir, new_dir_len); | |
1180 | strbuf_addstr(&new_path, &old_path[oldlen]); | |
1181 | ||
1182 | return strbuf_detach(&new_path, NULL); | |
d9d015df EN |
1183 | } |
1184 | ||
bea43365 EN |
1185 | static int path_in_way(struct strmap *paths, const char *path, unsigned side_mask) |
1186 | { | |
1187 | struct merged_info *mi = strmap_get(paths, path); | |
1188 | struct conflict_info *ci; | |
1189 | if (!mi) | |
1190 | return 0; | |
1191 | INITIALIZE_CI(ci, mi); | |
1192 | return mi->clean || (side_mask & (ci->filemask | ci->dirmask)); | |
1193 | } | |
1194 | ||
47325e85 EN |
1195 | /* |
1196 | * See if there is a directory rename for path, and if there are any file | |
1197 | * level conflicts on the given side for the renamed location. If there is | |
1198 | * a rename and there are no conflicts, return the new name. Otherwise, | |
1199 | * return NULL. | |
1200 | */ | |
1201 | static char *handle_path_level_conflicts(struct merge_options *opt, | |
1202 | const char *path, | |
1203 | unsigned side_index, | |
1204 | struct strmap_entry *rename_info, | |
1205 | struct strmap *collisions) | |
1206 | { | |
bea43365 EN |
1207 | char *new_path = NULL; |
1208 | struct collision_info *c_info; | |
1209 | int clean = 1; | |
1210 | struct strbuf collision_paths = STRBUF_INIT; | |
1211 | ||
1212 | /* | |
1213 | * entry has the mapping of old directory name to new directory name | |
1214 | * that we want to apply to path. | |
1215 | */ | |
1216 | new_path = apply_dir_rename(rename_info, path); | |
1217 | if (!new_path) | |
1218 | BUG("Failed to apply directory rename!"); | |
1219 | ||
1220 | /* | |
1221 | * The caller needs to have ensured that it has pre-populated | |
1222 | * collisions with all paths that map to new_path. Do a quick check | |
1223 | * to ensure that's the case. | |
1224 | */ | |
1225 | c_info = strmap_get(collisions, new_path); | |
1226 | if (c_info == NULL) | |
1227 | BUG("c_info is NULL"); | |
1228 | ||
1229 | /* | |
1230 | * Check for one-sided add/add/.../add conflicts, i.e. | |
1231 | * where implicit renames from the other side doing | |
1232 | * directory rename(s) can affect this side of history | |
1233 | * to put multiple paths into the same location. Warn | |
1234 | * and bail on directory renames for such paths. | |
1235 | */ | |
1236 | if (c_info->reported_already) { | |
1237 | clean = 0; | |
1238 | } else if (path_in_way(&opt->priv->paths, new_path, 1 << side_index)) { | |
1239 | c_info->reported_already = 1; | |
1240 | strbuf_add_separated_string_list(&collision_paths, ", ", | |
1241 | &c_info->source_files); | |
1242 | path_msg(opt, new_path, 0, | |
1243 | _("CONFLICT (implicit dir rename): Existing file/dir " | |
1244 | "at %s in the way of implicit directory rename(s) " | |
1245 | "putting the following path(s) there: %s."), | |
1246 | new_path, collision_paths.buf); | |
1247 | clean = 0; | |
1248 | } else if (c_info->source_files.nr > 1) { | |
1249 | c_info->reported_already = 1; | |
1250 | strbuf_add_separated_string_list(&collision_paths, ", ", | |
1251 | &c_info->source_files); | |
1252 | path_msg(opt, new_path, 0, | |
1253 | _("CONFLICT (implicit dir rename): Cannot map more " | |
1254 | "than one path to %s; implicit directory renames " | |
1255 | "tried to put these paths there: %s"), | |
1256 | new_path, collision_paths.buf); | |
1257 | clean = 0; | |
1258 | } | |
1259 | ||
1260 | /* Free memory we no longer need */ | |
1261 | strbuf_release(&collision_paths); | |
1262 | if (!clean && new_path) { | |
1263 | free(new_path); | |
1264 | return NULL; | |
1265 | } | |
1266 | ||
1267 | return new_path; | |
47325e85 EN |
1268 | } |
1269 | ||
203c872c EN |
1270 | static void dirname_munge(char *filename) |
1271 | { | |
1272 | char *slash = strrchr(filename, '/'); | |
1273 | if (!slash) | |
1274 | slash = filename; | |
1275 | *slash = '\0'; | |
1276 | } | |
1277 | ||
2f620a4f EN |
1278 | static void increment_count(struct strmap *dir_rename_count, |
1279 | char *old_dir, | |
1280 | char *new_dir) | |
1281 | { | |
1282 | struct strintmap *counts; | |
1283 | struct strmap_entry *e; | |
1284 | ||
1285 | /* Get the {new_dirs -> counts} mapping using old_dir */ | |
1286 | e = strmap_get_entry(dir_rename_count, old_dir); | |
1287 | if (e) { | |
1288 | counts = e->value; | |
1289 | } else { | |
1290 | counts = xmalloc(sizeof(*counts)); | |
1291 | strintmap_init_with_options(counts, 0, NULL, 1); | |
1292 | strmap_put(dir_rename_count, old_dir, counts); | |
1293 | } | |
1294 | ||
1295 | /* Increment the count for new_dir */ | |
1296 | strintmap_incr(counts, new_dir, 1); | |
1297 | } | |
1298 | ||
203c872c EN |
1299 | static void update_dir_rename_counts(struct strmap *dir_rename_count, |
1300 | struct strset *dirs_removed, | |
1301 | const char *oldname, | |
1302 | const char *newname) | |
1303 | { | |
1304 | char *old_dir = xstrdup(oldname); | |
1305 | char *new_dir = xstrdup(newname); | |
1306 | char new_dir_first_char = new_dir[0]; | |
1307 | int first_time_in_loop = 1; | |
1308 | ||
1309 | while (1) { | |
1310 | dirname_munge(old_dir); | |
1311 | dirname_munge(new_dir); | |
1312 | ||
1313 | /* | |
1314 | * When renaming | |
1315 | * "a/b/c/d/e/foo.c" -> "a/b/some/thing/else/e/foo.c" | |
1316 | * then this suggests that both | |
1317 | * a/b/c/d/e/ => a/b/some/thing/else/e/ | |
1318 | * a/b/c/d/ => a/b/some/thing/else/ | |
1319 | * so we want to increment counters for both. We do NOT, | |
1320 | * however, also want to suggest that there was the following | |
1321 | * rename: | |
1322 | * a/b/c/ => a/b/some/thing/ | |
1323 | * so we need to quit at that point. | |
1324 | * | |
1325 | * Note the when first_time_in_loop, we only strip off the | |
1326 | * basename, and we don't care if that's different. | |
1327 | */ | |
1328 | if (!first_time_in_loop) { | |
1329 | char *old_sub_dir = strchr(old_dir, '\0')+1; | |
1330 | char *new_sub_dir = strchr(new_dir, '\0')+1; | |
1331 | if (!*new_dir) { | |
1332 | /* | |
1333 | * Special case when renaming to root directory, | |
1334 | * i.e. when new_dir == "". In this case, we had | |
1335 | * something like | |
1336 | * a/b/subdir => subdir | |
1337 | * and so dirname_munge() sets things up so that | |
1338 | * old_dir = "a/b\0subdir\0" | |
1339 | * new_dir = "\0ubdir\0" | |
1340 | * We didn't have a '/' to overwrite a '\0' onto | |
1341 | * in new_dir, so we have to compare differently. | |
1342 | */ | |
1343 | if (new_dir_first_char != old_sub_dir[0] || | |
1344 | strcmp(old_sub_dir+1, new_sub_dir)) | |
1345 | break; | |
1346 | } else { | |
1347 | if (strcmp(old_sub_dir, new_sub_dir)) | |
1348 | break; | |
1349 | } | |
1350 | } | |
1351 | ||
1352 | if (strset_contains(dirs_removed, old_dir)) | |
1353 | increment_count(dir_rename_count, old_dir, new_dir); | |
1354 | else | |
1355 | break; | |
1356 | ||
1357 | /* If we hit toplevel directory ("") for old or new dir, quit */ | |
1358 | if (!*old_dir || !*new_dir) | |
1359 | break; | |
1360 | ||
1361 | first_time_in_loop = 0; | |
1362 | } | |
1363 | ||
1364 | /* Free resources we don't need anymore */ | |
1365 | free(old_dir); | |
1366 | free(new_dir); | |
1367 | } | |
1368 | ||
04264d40 EN |
1369 | static void compute_rename_counts(struct diff_queue_struct *pairs, |
1370 | struct strmap *dir_rename_count, | |
1371 | struct strset *dirs_removed) | |
1372 | { | |
2f620a4f EN |
1373 | int i; |
1374 | ||
1375 | for (i = 0; i < pairs->nr; ++i) { | |
2f620a4f EN |
1376 | struct diff_filepair *pair = pairs->queue[i]; |
1377 | ||
1378 | /* File not part of directory rename if it wasn't renamed */ | |
1379 | if (pair->status != 'R') | |
1380 | continue; | |
1381 | ||
2f620a4f EN |
1382 | /* |
1383 | * Make dir_rename_count contain a map of a map: | |
1384 | * old_directory -> {new_directory -> count} | |
1385 | * In other words, for every pair look at the directories for | |
1386 | * the old filename and the new filename and count how many | |
1387 | * times that pairing occurs. | |
1388 | */ | |
203c872c EN |
1389 | update_dir_rename_counts(dir_rename_count, dirs_removed, |
1390 | pair->one->path, | |
1391 | pair->two->path); | |
2f620a4f | 1392 | } |
04264d40 EN |
1393 | } |
1394 | ||
112e1112 EN |
1395 | static void get_provisional_directory_renames(struct merge_options *opt, |
1396 | unsigned side, | |
1397 | int *clean) | |
1398 | { | |
04264d40 EN |
1399 | struct hashmap_iter iter; |
1400 | struct strmap_entry *entry; | |
1401 | struct rename_info *renames = &opt->priv->renames; | |
1402 | ||
1403 | compute_rename_counts(&renames->pairs[side], | |
1404 | &renames->dir_rename_count[side], | |
1405 | &renames->dirs_removed[side]); | |
1406 | /* | |
1407 | * Collapse | |
1408 | * dir_rename_count: old_directory -> {new_directory -> count} | |
1409 | * down to | |
1410 | * dir_renames: old_directory -> best_new_directory | |
1411 | * where best_new_directory is the one with the unique highest count. | |
1412 | */ | |
1413 | strmap_for_each_entry(&renames->dir_rename_count[side], &iter, entry) { | |
1414 | const char *source_dir = entry->key; | |
1415 | struct strintmap *counts = entry->value; | |
1416 | struct hashmap_iter count_iter; | |
1417 | struct strmap_entry *count_entry; | |
1418 | int max = 0; | |
1419 | int bad_max = 0; | |
1420 | const char *best = NULL; | |
1421 | ||
1422 | strintmap_for_each_entry(counts, &count_iter, count_entry) { | |
1423 | const char *target_dir = count_entry->key; | |
1424 | intptr_t count = (intptr_t)count_entry->value; | |
1425 | ||
1426 | if (count == max) | |
1427 | bad_max = max; | |
1428 | else if (count > max) { | |
1429 | max = count; | |
1430 | best = target_dir; | |
1431 | } | |
1432 | } | |
1433 | ||
1434 | if (bad_max == max) { | |
1435 | path_msg(opt, source_dir, 0, | |
1436 | _("CONFLICT (directory rename split): " | |
1437 | "Unclear where to rename %s to; it was " | |
1438 | "renamed to multiple other directories, with " | |
1439 | "no destination getting a majority of the " | |
1440 | "files."), | |
1441 | source_dir); | |
1442 | *clean = 0; | |
1443 | } else { | |
1444 | strmap_put(&renames->dir_renames[side], | |
1445 | source_dir, (void*)best); | |
1446 | } | |
1447 | } | |
112e1112 EN |
1448 | } |
1449 | ||
1450 | static void handle_directory_level_conflicts(struct merge_options *opt) | |
1451 | { | |
98d0d081 EN |
1452 | struct hashmap_iter iter; |
1453 | struct strmap_entry *entry; | |
1454 | struct string_list duplicated = STRING_LIST_INIT_NODUP; | |
1455 | struct rename_info *renames = &opt->priv->renames; | |
1456 | struct strmap *side1_dir_renames = &renames->dir_renames[MERGE_SIDE1]; | |
1457 | struct strmap *side2_dir_renames = &renames->dir_renames[MERGE_SIDE2]; | |
1458 | int i; | |
1459 | ||
1460 | strmap_for_each_entry(side1_dir_renames, &iter, entry) { | |
1461 | if (strmap_contains(side2_dir_renames, entry->key)) | |
1462 | string_list_append(&duplicated, entry->key); | |
1463 | } | |
1464 | ||
1465 | for (i = 0; i < duplicated.nr; i++) { | |
1466 | strmap_remove(side1_dir_renames, duplicated.items[i].string, 0); | |
1467 | strmap_remove(side2_dir_renames, duplicated.items[i].string, 0); | |
1468 | } | |
1469 | string_list_clear(&duplicated, 0); | |
112e1112 EN |
1470 | } |
1471 | ||
d9d015df EN |
1472 | static struct strmap_entry *check_dir_renamed(const char *path, |
1473 | struct strmap *dir_renames) | |
1474 | { | |
fbcfc0cc EN |
1475 | char *temp = xstrdup(path); |
1476 | char *end; | |
1477 | struct strmap_entry *e = NULL; | |
1478 | ||
1479 | while ((end = strrchr(temp, '/'))) { | |
1480 | *end = '\0'; | |
1481 | e = strmap_get_entry(dir_renames, temp); | |
1482 | if (e) | |
1483 | break; | |
1484 | } | |
1485 | free(temp); | |
1486 | return e; | |
d9d015df EN |
1487 | } |
1488 | ||
fa5e06d6 EN |
1489 | static void compute_collisions(struct strmap *collisions, |
1490 | struct strmap *dir_renames, | |
1491 | struct diff_queue_struct *pairs) | |
1492 | { | |
d9d015df EN |
1493 | int i; |
1494 | ||
1495 | strmap_init_with_options(collisions, NULL, 0); | |
1496 | if (strmap_empty(dir_renames)) | |
1497 | return; | |
1498 | ||
1499 | /* | |
1500 | * Multiple files can be mapped to the same path due to directory | |
1501 | * renames done by the other side of history. Since that other | |
1502 | * side of history could have merged multiple directories into one, | |
1503 | * if our side of history added the same file basename to each of | |
1504 | * those directories, then all N of them would get implicitly | |
1505 | * renamed by the directory rename detection into the same path, | |
1506 | * and we'd get an add/add/.../add conflict, and all those adds | |
1507 | * from *this* side of history. This is not representable in the | |
1508 | * index, and users aren't going to easily be able to make sense of | |
1509 | * it. So we need to provide a good warning about what's | |
1510 | * happening, and fall back to no-directory-rename detection | |
1511 | * behavior for those paths. | |
1512 | * | |
1513 | * See testcases 9e and all of section 5 from t6043 for examples. | |
1514 | */ | |
1515 | for (i = 0; i < pairs->nr; ++i) { | |
1516 | struct strmap_entry *rename_info; | |
1517 | struct collision_info *collision_info; | |
1518 | char *new_path; | |
1519 | struct diff_filepair *pair = pairs->queue[i]; | |
1520 | ||
1521 | if (pair->status != 'A' && pair->status != 'R') | |
1522 | continue; | |
1523 | rename_info = check_dir_renamed(pair->two->path, dir_renames); | |
1524 | if (!rename_info) | |
1525 | continue; | |
1526 | ||
1527 | new_path = apply_dir_rename(rename_info, pair->two->path); | |
1528 | assert(new_path); | |
1529 | collision_info = strmap_get(collisions, new_path); | |
1530 | if (collision_info) { | |
1531 | free(new_path); | |
1532 | } else { | |
1533 | collision_info = xcalloc(1, | |
1534 | sizeof(struct collision_info)); | |
1535 | string_list_init(&collision_info->source_files, 0); | |
1536 | strmap_put(collisions, new_path, collision_info); | |
1537 | } | |
1538 | string_list_insert(&collision_info->source_files, | |
1539 | pair->two->path); | |
1540 | } | |
fa5e06d6 EN |
1541 | } |
1542 | ||
1543 | static char *check_for_directory_rename(struct merge_options *opt, | |
1544 | const char *path, | |
1545 | unsigned side_index, | |
1546 | struct strmap *dir_renames, | |
1547 | struct strmap *dir_rename_exclusions, | |
1548 | struct strmap *collisions, | |
1549 | int *clean_merge) | |
1550 | { | |
47325e85 EN |
1551 | char *new_path = NULL; |
1552 | struct strmap_entry *rename_info; | |
1553 | struct strmap_entry *otherinfo = NULL; | |
1554 | const char *new_dir; | |
1555 | ||
1556 | if (strmap_empty(dir_renames)) | |
1557 | return new_path; | |
1558 | rename_info = check_dir_renamed(path, dir_renames); | |
1559 | if (!rename_info) | |
1560 | return new_path; | |
1561 | /* old_dir = rename_info->key; */ | |
1562 | new_dir = rename_info->value; | |
1563 | ||
1564 | /* | |
1565 | * This next part is a little weird. We do not want to do an | |
1566 | * implicit rename into a directory we renamed on our side, because | |
1567 | * that will result in a spurious rename/rename(1to2) conflict. An | |
1568 | * example: | |
1569 | * Base commit: dumbdir/afile, otherdir/bfile | |
1570 | * Side 1: smrtdir/afile, otherdir/bfile | |
1571 | * Side 2: dumbdir/afile, dumbdir/bfile | |
1572 | * Here, while working on Side 1, we could notice that otherdir was | |
1573 | * renamed/merged to dumbdir, and change the diff_filepair for | |
1574 | * otherdir/bfile into a rename into dumbdir/bfile. However, Side | |
1575 | * 2 will notice the rename from dumbdir to smrtdir, and do the | |
1576 | * transitive rename to move it from dumbdir/bfile to | |
1577 | * smrtdir/bfile. That gives us bfile in dumbdir vs being in | |
1578 | * smrtdir, a rename/rename(1to2) conflict. We really just want | |
1579 | * the file to end up in smrtdir. And the way to achieve that is | |
1580 | * to not let Side1 do the rename to dumbdir, since we know that is | |
1581 | * the source of one of our directory renames. | |
1582 | * | |
1583 | * That's why otherinfo and dir_rename_exclusions is here. | |
1584 | * | |
1585 | * As it turns out, this also prevents N-way transient rename | |
1586 | * confusion; See testcases 9c and 9d of t6043. | |
1587 | */ | |
1588 | otherinfo = strmap_get_entry(dir_rename_exclusions, new_dir); | |
1589 | if (otherinfo) { | |
1590 | path_msg(opt, rename_info->key, 1, | |
1591 | _("WARNING: Avoiding applying %s -> %s rename " | |
1592 | "to %s, because %s itself was renamed."), | |
1593 | rename_info->key, new_dir, path, new_dir); | |
1594 | return NULL; | |
1595 | } | |
1596 | ||
1597 | new_path = handle_path_level_conflicts(opt, path, side_index, | |
1598 | rename_info, collisions); | |
1599 | *clean_merge &= (new_path != NULL); | |
1600 | ||
1601 | return new_path; | |
fa5e06d6 EN |
1602 | } |
1603 | ||
1604 | static void apply_directory_rename_modifications(struct merge_options *opt, | |
1605 | struct diff_filepair *pair, | |
1606 | char *new_path) | |
1607 | { | |
089d82bc EN |
1608 | /* |
1609 | * The basic idea is to get the conflict_info from opt->priv->paths | |
1610 | * at old path, and insert it into new_path; basically just this: | |
1611 | * ci = strmap_get(&opt->priv->paths, old_path); | |
1612 | * strmap_remove(&opt->priv->paths, old_path, 0); | |
1613 | * strmap_put(&opt->priv->paths, new_path, ci); | |
1614 | * However, there are some factors complicating this: | |
1615 | * - opt->priv->paths may already have an entry at new_path | |
1616 | * - Each ci tracks its containing directory, so we need to | |
1617 | * update that | |
1618 | * - If another ci has the same containing directory, then | |
1619 | * the two char*'s MUST point to the same location. See the | |
1620 | * comment in struct merged_info. strcmp equality is not | |
1621 | * enough; we need pointer equality. | |
1622 | * - opt->priv->paths must hold the parent directories of any | |
1623 | * entries that are added. So, if this directory rename | |
1624 | * causes entirely new directories, we must recursively add | |
1625 | * parent directories. | |
1626 | * - For each parent directory added to opt->priv->paths, we | |
1627 | * also need to get its parent directory stored in its | |
1628 | * conflict_info->merged.directory_name with all the same | |
1629 | * requirements about pointer equality. | |
1630 | */ | |
1631 | struct string_list dirs_to_insert = STRING_LIST_INIT_NODUP; | |
1632 | struct conflict_info *ci, *new_ci; | |
1633 | struct strmap_entry *entry; | |
1634 | const char *branch_with_new_path, *branch_with_dir_rename; | |
1635 | const char *old_path = pair->two->path; | |
1636 | const char *parent_name; | |
1637 | const char *cur_path; | |
1638 | int i, len; | |
1639 | ||
1640 | entry = strmap_get_entry(&opt->priv->paths, old_path); | |
1641 | old_path = entry->key; | |
1642 | ci = entry->value; | |
1643 | VERIFY_CI(ci); | |
1644 | ||
1645 | /* Find parent directories missing from opt->priv->paths */ | |
1646 | cur_path = new_path; | |
1647 | while (1) { | |
1648 | /* Find the parent directory of cur_path */ | |
1649 | char *last_slash = strrchr(cur_path, '/'); | |
1650 | if (last_slash) { | |
1651 | parent_name = xstrndup(cur_path, last_slash - cur_path); | |
1652 | } else { | |
1653 | parent_name = opt->priv->toplevel_dir; | |
1654 | break; | |
1655 | } | |
1656 | ||
1657 | /* Look it up in opt->priv->paths */ | |
1658 | entry = strmap_get_entry(&opt->priv->paths, parent_name); | |
1659 | if (entry) { | |
1660 | free((char*)parent_name); | |
1661 | parent_name = entry->key; /* reuse known pointer */ | |
1662 | break; | |
1663 | } | |
1664 | ||
1665 | /* Record this is one of the directories we need to insert */ | |
1666 | string_list_append(&dirs_to_insert, parent_name); | |
1667 | cur_path = parent_name; | |
1668 | } | |
1669 | ||
1670 | /* Traverse dirs_to_insert and insert them into opt->priv->paths */ | |
1671 | for (i = dirs_to_insert.nr-1; i >= 0; --i) { | |
1672 | struct conflict_info *dir_ci; | |
1673 | char *cur_dir = dirs_to_insert.items[i].string; | |
1674 | ||
1675 | dir_ci = xcalloc(1, sizeof(*dir_ci)); | |
1676 | ||
1677 | dir_ci->merged.directory_name = parent_name; | |
1678 | len = strlen(parent_name); | |
1679 | /* len+1 because of trailing '/' character */ | |
1680 | dir_ci->merged.basename_offset = (len > 0 ? len+1 : len); | |
1681 | dir_ci->dirmask = ci->filemask; | |
1682 | strmap_put(&opt->priv->paths, cur_dir, dir_ci); | |
1683 | ||
1684 | parent_name = cur_dir; | |
1685 | } | |
1686 | ||
1687 | /* | |
1688 | * We are removing old_path from opt->priv->paths. old_path also will | |
1689 | * eventually need to be freed, but it may still be used by e.g. | |
1690 | * ci->pathnames. So, store it in another string-list for now. | |
1691 | */ | |
1692 | string_list_append(&opt->priv->paths_to_free, old_path); | |
1693 | ||
1694 | assert(ci->filemask == 2 || ci->filemask == 4); | |
1695 | assert(ci->dirmask == 0); | |
1696 | strmap_remove(&opt->priv->paths, old_path, 0); | |
1697 | ||
1698 | branch_with_new_path = (ci->filemask == 2) ? opt->branch1 : opt->branch2; | |
1699 | branch_with_dir_rename = (ci->filemask == 2) ? opt->branch2 : opt->branch1; | |
1700 | ||
1701 | /* Now, finally update ci and stick it into opt->priv->paths */ | |
1702 | ci->merged.directory_name = parent_name; | |
1703 | len = strlen(parent_name); | |
1704 | ci->merged.basename_offset = (len > 0 ? len+1 : len); | |
1705 | new_ci = strmap_get(&opt->priv->paths, new_path); | |
1706 | if (!new_ci) { | |
1707 | /* Place ci back into opt->priv->paths, but at new_path */ | |
1708 | strmap_put(&opt->priv->paths, new_path, ci); | |
1709 | } else { | |
1710 | int index; | |
1711 | ||
1712 | /* A few sanity checks */ | |
1713 | VERIFY_CI(new_ci); | |
1714 | assert(ci->filemask == 2 || ci->filemask == 4); | |
1715 | assert((new_ci->filemask & ci->filemask) == 0); | |
1716 | assert(!new_ci->merged.clean); | |
1717 | ||
1718 | /* Copy stuff from ci into new_ci */ | |
1719 | new_ci->filemask |= ci->filemask; | |
1720 | if (new_ci->dirmask) | |
1721 | new_ci->df_conflict = 1; | |
1722 | index = (ci->filemask >> 1); | |
1723 | new_ci->pathnames[index] = ci->pathnames[index]; | |
1724 | new_ci->stages[index].mode = ci->stages[index].mode; | |
1725 | oidcpy(&new_ci->stages[index].oid, &ci->stages[index].oid); | |
1726 | ||
1727 | free(ci); | |
1728 | ci = new_ci; | |
1729 | } | |
1730 | ||
1731 | if (opt->detect_directory_renames == MERGE_DIRECTORY_RENAMES_TRUE) { | |
1732 | /* Notify user of updated path */ | |
1733 | if (pair->status == 'A') | |
1734 | path_msg(opt, new_path, 1, | |
1735 | _("Path updated: %s added in %s inside a " | |
1736 | "directory that was renamed in %s; moving " | |
1737 | "it to %s."), | |
1738 | old_path, branch_with_new_path, | |
1739 | branch_with_dir_rename, new_path); | |
1740 | else | |
1741 | path_msg(opt, new_path, 1, | |
1742 | _("Path updated: %s renamed to %s in %s, " | |
1743 | "inside a directory that was renamed in %s; " | |
1744 | "moving it to %s."), | |
1745 | pair->one->path, old_path, branch_with_new_path, | |
1746 | branch_with_dir_rename, new_path); | |
1747 | } else { | |
1748 | /* | |
1749 | * opt->detect_directory_renames has the value | |
1750 | * MERGE_DIRECTORY_RENAMES_CONFLICT, so mark these as conflicts. | |
1751 | */ | |
1752 | ci->path_conflict = 1; | |
1753 | if (pair->status == 'A') | |
1754 | path_msg(opt, new_path, 0, | |
1755 | _("CONFLICT (file location): %s added in %s " | |
1756 | "inside a directory that was renamed in %s, " | |
1757 | "suggesting it should perhaps be moved to " | |
1758 | "%s."), | |
1759 | old_path, branch_with_new_path, | |
1760 | branch_with_dir_rename, new_path); | |
1761 | else | |
1762 | path_msg(opt, new_path, 0, | |
1763 | _("CONFLICT (file location): %s renamed to %s " | |
1764 | "in %s, inside a directory that was renamed " | |
1765 | "in %s, suggesting it should perhaps be " | |
1766 | "moved to %s."), | |
1767 | pair->one->path, old_path, branch_with_new_path, | |
1768 | branch_with_dir_rename, new_path); | |
1769 | } | |
1770 | ||
1771 | /* | |
1772 | * Finally, record the new location. | |
1773 | */ | |
1774 | pair->two->path = new_path; | |
fa5e06d6 EN |
1775 | } |
1776 | ||
04af1879 EN |
1777 | /*** Function Grouping: functions related to regular rename detection ***/ |
1778 | ||
e1a124e8 EN |
1779 | static int process_renames(struct merge_options *opt, |
1780 | struct diff_queue_struct *renames) | |
1781 | { | |
c2d267df EN |
1782 | int clean_merge = 1, i; |
1783 | ||
1784 | for (i = 0; i < renames->nr; ++i) { | |
1785 | const char *oldpath = NULL, *newpath; | |
1786 | struct diff_filepair *pair = renames->queue[i]; | |
1787 | struct conflict_info *oldinfo = NULL, *newinfo = NULL; | |
1788 | struct strmap_entry *old_ent, *new_ent; | |
1789 | unsigned int old_sidemask; | |
1790 | int target_index, other_source_index; | |
1791 | int source_deleted, collision, type_changed; | |
2e91ddd2 | 1792 | const char *rename_branch = NULL, *delete_branch = NULL; |
c2d267df EN |
1793 | |
1794 | old_ent = strmap_get_entry(&opt->priv->paths, pair->one->path); | |
c2d267df | 1795 | new_ent = strmap_get_entry(&opt->priv->paths, pair->two->path); |
1b6b902d EN |
1796 | if (old_ent) { |
1797 | oldpath = old_ent->key; | |
1798 | oldinfo = old_ent->value; | |
1799 | } | |
1800 | newpath = pair->two->path; | |
1801 | if (new_ent) { | |
1802 | newpath = new_ent->key; | |
1803 | newinfo = new_ent->value; | |
1804 | } | |
1805 | ||
1806 | /* | |
1807 | * If pair->one->path isn't in opt->priv->paths, that means | |
1808 | * that either directory rename detection removed that | |
1809 | * path, or a parent directory of oldpath was resolved and | |
1810 | * we don't even need the rename; in either case, we can | |
1811 | * skip it. If oldinfo->merged.clean, then the other side | |
1812 | * of history had no changes to oldpath and we don't need | |
1813 | * the rename and can skip it. | |
1814 | */ | |
1815 | if (!oldinfo || oldinfo->merged.clean) | |
1816 | continue; | |
c2d267df EN |
1817 | |
1818 | /* | |
1819 | * diff_filepairs have copies of pathnames, thus we have to | |
1820 | * use standard 'strcmp()' (negated) instead of '=='. | |
1821 | */ | |
1822 | if (i + 1 < renames->nr && | |
1823 | !strcmp(oldpath, renames->queue[i+1]->one->path)) { | |
1824 | /* Handle rename/rename(1to2) or rename/rename(1to1) */ | |
1825 | const char *pathnames[3]; | |
af1e56c4 EN |
1826 | struct version_info merged; |
1827 | struct conflict_info *base, *side1, *side2; | |
53e88a03 | 1828 | unsigned was_binary_blob = 0; |
c2d267df EN |
1829 | |
1830 | pathnames[0] = oldpath; | |
1831 | pathnames[1] = newpath; | |
1832 | pathnames[2] = renames->queue[i+1]->two->path; | |
1833 | ||
af1e56c4 EN |
1834 | base = strmap_get(&opt->priv->paths, pathnames[0]); |
1835 | side1 = strmap_get(&opt->priv->paths, pathnames[1]); | |
1836 | side2 = strmap_get(&opt->priv->paths, pathnames[2]); | |
1837 | ||
1838 | VERIFY_CI(base); | |
1839 | VERIFY_CI(side1); | |
1840 | VERIFY_CI(side2); | |
1841 | ||
c2d267df | 1842 | if (!strcmp(pathnames[1], pathnames[2])) { |
af1e56c4 EN |
1843 | /* Both sides renamed the same way */ |
1844 | assert(side1 == side2); | |
1845 | memcpy(&side1->stages[0], &base->stages[0], | |
1846 | sizeof(merged)); | |
1847 | side1->filemask |= (1 << MERGE_BASE); | |
1848 | /* Mark base as resolved by removal */ | |
1849 | base->merged.is_null = 1; | |
1850 | base->merged.clean = 1; | |
c2d267df EN |
1851 | |
1852 | /* We handled both renames, i.e. i+1 handled */ | |
1853 | i++; | |
1854 | /* Move to next rename */ | |
1855 | continue; | |
1856 | } | |
1857 | ||
1858 | /* This is a rename/rename(1to2) */ | |
53e88a03 EN |
1859 | clean_merge = handle_content_merge(opt, |
1860 | pair->one->path, | |
1861 | &base->stages[0], | |
1862 | &side1->stages[1], | |
1863 | &side2->stages[2], | |
1864 | pathnames, | |
1865 | 1 + 2 * opt->priv->call_depth, | |
1866 | &merged); | |
1867 | if (!clean_merge && | |
1868 | merged.mode == side1->stages[1].mode && | |
1869 | oideq(&merged.oid, &side1->stages[1].oid)) | |
1870 | was_binary_blob = 1; | |
1871 | memcpy(&side1->stages[1], &merged, sizeof(merged)); | |
1872 | if (was_binary_blob) { | |
1873 | /* | |
1874 | * Getting here means we were attempting to | |
1875 | * merge a binary blob. | |
1876 | * | |
1877 | * Since we can't merge binaries, | |
1878 | * handle_content_merge() just takes one | |
1879 | * side. But we don't want to copy the | |
1880 | * contents of one side to both paths. We | |
1881 | * used the contents of side1 above for | |
1882 | * side1->stages, let's use the contents of | |
1883 | * side2 for side2->stages below. | |
1884 | */ | |
1885 | oidcpy(&merged.oid, &side2->stages[2].oid); | |
1886 | merged.mode = side2->stages[2].mode; | |
1887 | } | |
1888 | memcpy(&side2->stages[2], &merged, sizeof(merged)); | |
1889 | ||
1890 | side1->path_conflict = 1; | |
1891 | side2->path_conflict = 1; | |
1892 | /* | |
1893 | * TODO: For renames we normally remove the path at the | |
1894 | * old name. It would thus seem consistent to do the | |
1895 | * same for rename/rename(1to2) cases, but we haven't | |
1896 | * done so traditionally and a number of the regression | |
1897 | * tests now encode an expectation that the file is | |
1898 | * left there at stage 1. If we ever decide to change | |
1899 | * this, add the following two lines here: | |
1900 | * base->merged.is_null = 1; | |
1901 | * base->merged.clean = 1; | |
1902 | * and remove the setting of base->path_conflict to 1. | |
1903 | */ | |
1904 | base->path_conflict = 1; | |
1905 | path_msg(opt, oldpath, 0, | |
1906 | _("CONFLICT (rename/rename): %s renamed to " | |
1907 | "%s in %s and to %s in %s."), | |
1908 | pathnames[0], | |
1909 | pathnames[1], opt->branch1, | |
1910 | pathnames[2], opt->branch2); | |
c2d267df EN |
1911 | |
1912 | i++; /* We handled both renames, i.e. i+1 handled */ | |
1913 | continue; | |
1914 | } | |
1915 | ||
1916 | VERIFY_CI(oldinfo); | |
1917 | VERIFY_CI(newinfo); | |
1918 | target_index = pair->score; /* from collect_renames() */ | |
1919 | assert(target_index == 1 || target_index == 2); | |
1920 | other_source_index = 3 - target_index; | |
1921 | old_sidemask = (1 << other_source_index); /* 2 or 4 */ | |
1922 | source_deleted = (oldinfo->filemask == 1); | |
1923 | collision = ((newinfo->filemask & old_sidemask) != 0); | |
1924 | type_changed = !source_deleted && | |
1925 | (S_ISREG(oldinfo->stages[other_source_index].mode) != | |
1926 | S_ISREG(newinfo->stages[target_index].mode)); | |
1927 | if (type_changed && collision) { | |
6fcccbd7 EN |
1928 | /* |
1929 | * special handling so later blocks can handle this... | |
1930 | * | |
1931 | * if type_changed && collision are both true, then this | |
1932 | * was really a double rename, but one side wasn't | |
1933 | * detected due to lack of break detection. I.e. | |
1934 | * something like | |
1935 | * orig: has normal file 'foo' | |
1936 | * side1: renames 'foo' to 'bar', adds 'foo' symlink | |
1937 | * side2: renames 'foo' to 'bar' | |
1938 | * In this case, the foo->bar rename on side1 won't be | |
1939 | * detected because the new symlink named 'foo' is | |
1940 | * there and we don't do break detection. But we detect | |
1941 | * this here because we don't want to merge the content | |
1942 | * of the foo symlink with the foo->bar file, so we | |
1943 | * have some logic to handle this special case. The | |
1944 | * easiest way to do that is make 'bar' on side1 not | |
1945 | * be considered a colliding file but the other part | |
1946 | * of a normal rename. If the file is very different, | |
1947 | * well we're going to get content merge conflicts | |
1948 | * anyway so it doesn't hurt. And if the colliding | |
1949 | * file also has a different type, that'll be handled | |
1950 | * by the content merge logic in process_entry() too. | |
1951 | * | |
1952 | * See also t6430, 'rename vs. rename/symlink' | |
1953 | */ | |
1954 | collision = 0; | |
c2d267df | 1955 | } |
2e91ddd2 EN |
1956 | if (source_deleted) { |
1957 | if (target_index == 1) { | |
1958 | rename_branch = opt->branch1; | |
1959 | delete_branch = opt->branch2; | |
1960 | } else { | |
1961 | rename_branch = opt->branch2; | |
1962 | delete_branch = opt->branch1; | |
1963 | } | |
1964 | } | |
c2d267df EN |
1965 | |
1966 | assert(source_deleted || oldinfo->filemask & old_sidemask); | |
1967 | ||
1968 | /* Need to check for special types of rename conflicts... */ | |
1969 | if (collision && !source_deleted) { | |
1970 | /* collision: rename/add or rename/rename(2to1) */ | |
35e47e35 EN |
1971 | const char *pathnames[3]; |
1972 | struct version_info merged; | |
1973 | ||
1974 | struct conflict_info *base, *side1, *side2; | |
1975 | unsigned clean; | |
1976 | ||
1977 | pathnames[0] = oldpath; | |
1978 | pathnames[other_source_index] = oldpath; | |
1979 | pathnames[target_index] = newpath; | |
1980 | ||
1981 | base = strmap_get(&opt->priv->paths, pathnames[0]); | |
1982 | side1 = strmap_get(&opt->priv->paths, pathnames[1]); | |
1983 | side2 = strmap_get(&opt->priv->paths, pathnames[2]); | |
1984 | ||
1985 | VERIFY_CI(base); | |
1986 | VERIFY_CI(side1); | |
1987 | VERIFY_CI(side2); | |
1988 | ||
1989 | clean = handle_content_merge(opt, pair->one->path, | |
1990 | &base->stages[0], | |
1991 | &side1->stages[1], | |
1992 | &side2->stages[2], | |
1993 | pathnames, | |
1994 | 1 + 2 * opt->priv->call_depth, | |
1995 | &merged); | |
1996 | ||
1997 | memcpy(&newinfo->stages[target_index], &merged, | |
1998 | sizeof(merged)); | |
1999 | if (!clean) { | |
2000 | path_msg(opt, newpath, 0, | |
2001 | _("CONFLICT (rename involved in " | |
2002 | "collision): rename of %s -> %s has " | |
2003 | "content conflicts AND collides " | |
2004 | "with another path; this may result " | |
2005 | "in nested conflict markers."), | |
2006 | oldpath, newpath); | |
2007 | } | |
c2d267df | 2008 | } else if (collision && source_deleted) { |
35e47e35 EN |
2009 | /* |
2010 | * rename/add/delete or rename/rename(2to1)/delete: | |
2011 | * since oldpath was deleted on the side that didn't | |
2012 | * do the rename, there's not much of a content merge | |
2013 | * we can do for the rename. oldinfo->merged.is_null | |
2014 | * was already set, so we just leave things as-is so | |
2015 | * they look like an add/add conflict. | |
2016 | */ | |
2017 | ||
2018 | newinfo->path_conflict = 1; | |
2019 | path_msg(opt, newpath, 0, | |
2020 | _("CONFLICT (rename/delete): %s renamed " | |
2021 | "to %s in %s, but deleted in %s."), | |
2022 | oldpath, newpath, rename_branch, delete_branch); | |
c2d267df | 2023 | } else { |
2e91ddd2 EN |
2024 | /* |
2025 | * a few different cases...start by copying the | |
2026 | * existing stage(s) from oldinfo over the newinfo | |
2027 | * and update the pathname(s). | |
2028 | */ | |
2029 | memcpy(&newinfo->stages[0], &oldinfo->stages[0], | |
2030 | sizeof(newinfo->stages[0])); | |
2031 | newinfo->filemask |= (1 << MERGE_BASE); | |
2032 | newinfo->pathnames[0] = oldpath; | |
c2d267df EN |
2033 | if (type_changed) { |
2034 | /* rename vs. typechange */ | |
6fcccbd7 EN |
2035 | /* Mark the original as resolved by removal */ |
2036 | memcpy(&oldinfo->stages[0].oid, &null_oid, | |
2037 | sizeof(oldinfo->stages[0].oid)); | |
2038 | oldinfo->stages[0].mode = 0; | |
2039 | oldinfo->filemask &= 0x06; | |
c2d267df EN |
2040 | } else if (source_deleted) { |
2041 | /* rename/delete */ | |
2e91ddd2 EN |
2042 | newinfo->path_conflict = 1; |
2043 | path_msg(opt, newpath, 0, | |
2044 | _("CONFLICT (rename/delete): %s renamed" | |
2045 | " to %s in %s, but deleted in %s."), | |
2046 | oldpath, newpath, | |
2047 | rename_branch, delete_branch); | |
c2d267df EN |
2048 | } else { |
2049 | /* normal rename */ | |
f1665e69 EN |
2050 | memcpy(&newinfo->stages[other_source_index], |
2051 | &oldinfo->stages[other_source_index], | |
2052 | sizeof(newinfo->stages[0])); | |
2053 | newinfo->filemask |= (1 << other_source_index); | |
2054 | newinfo->pathnames[other_source_index] = oldpath; | |
c2d267df EN |
2055 | } |
2056 | } | |
2057 | ||
2058 | if (!type_changed) { | |
2059 | /* Mark the original as resolved by removal */ | |
2060 | oldinfo->merged.is_null = 1; | |
2061 | oldinfo->merged.clean = 1; | |
2062 | } | |
2063 | ||
2064 | } | |
2065 | ||
2066 | return clean_merge; | |
e1a124e8 EN |
2067 | } |
2068 | ||
2069 | static int compare_pairs(const void *a_, const void *b_) | |
2070 | { | |
965a7bc2 EN |
2071 | const struct diff_filepair *a = *((const struct diff_filepair **)a_); |
2072 | const struct diff_filepair *b = *((const struct diff_filepair **)b_); | |
2073 | ||
2074 | return strcmp(a->one->path, b->one->path); | |
e1a124e8 EN |
2075 | } |
2076 | ||
2077 | /* Call diffcore_rename() to compute which files have changed on given side */ | |
2078 | static void detect_regular_renames(struct merge_options *opt, | |
2079 | struct tree *merge_base, | |
2080 | struct tree *side, | |
2081 | unsigned side_index) | |
2082 | { | |
f39d05ca EN |
2083 | struct diff_options diff_opts; |
2084 | struct rename_info *renames = &opt->priv->renames; | |
2085 | ||
2086 | repo_diff_setup(opt->repo, &diff_opts); | |
2087 | diff_opts.flags.recursive = 1; | |
2088 | diff_opts.flags.rename_empty = 0; | |
2089 | diff_opts.detect_rename = DIFF_DETECT_RENAME; | |
2090 | diff_opts.rename_limit = opt->rename_limit; | |
2091 | if (opt->rename_limit <= 0) | |
2092 | diff_opts.rename_limit = 1000; | |
2093 | diff_opts.rename_score = opt->rename_score; | |
2094 | diff_opts.show_rename_progress = opt->show_rename_progress; | |
2095 | diff_opts.output_format = DIFF_FORMAT_NO_OUTPUT; | |
2096 | diff_setup_done(&diff_opts); | |
2097 | diff_tree_oid(&merge_base->object.oid, &side->object.oid, "", | |
2098 | &diff_opts); | |
2099 | diffcore_std(&diff_opts); | |
2100 | ||
2101 | if (diff_opts.needed_rename_limit > renames->needed_limit) | |
2102 | renames->needed_limit = diff_opts.needed_rename_limit; | |
2103 | ||
2104 | renames->pairs[side_index] = diff_queued_diff; | |
2105 | ||
2106 | diff_opts.output_format = DIFF_FORMAT_NO_OUTPUT; | |
2107 | diff_queued_diff.nr = 0; | |
2108 | diff_queued_diff.queue = NULL; | |
2109 | diff_flush(&diff_opts); | |
e1a124e8 EN |
2110 | } |
2111 | ||
2112 | /* | |
2113 | * Get information of all renames which occurred in 'side_pairs', discarding | |
2114 | * non-renames. | |
2115 | */ | |
2116 | static int collect_renames(struct merge_options *opt, | |
2117 | struct diff_queue_struct *result, | |
fa5e06d6 EN |
2118 | unsigned side_index, |
2119 | struct strmap *dir_renames_for_side, | |
2120 | struct strmap *rename_exclusions) | |
e1a124e8 | 2121 | { |
965a7bc2 | 2122 | int i, clean = 1; |
fa5e06d6 | 2123 | struct strmap collisions; |
965a7bc2 | 2124 | struct diff_queue_struct *side_pairs; |
fa5e06d6 EN |
2125 | struct hashmap_iter iter; |
2126 | struct strmap_entry *entry; | |
965a7bc2 EN |
2127 | struct rename_info *renames = &opt->priv->renames; |
2128 | ||
2129 | side_pairs = &renames->pairs[side_index]; | |
fa5e06d6 | 2130 | compute_collisions(&collisions, dir_renames_for_side, side_pairs); |
965a7bc2 EN |
2131 | |
2132 | for (i = 0; i < side_pairs->nr; ++i) { | |
2133 | struct diff_filepair *p = side_pairs->queue[i]; | |
fa5e06d6 | 2134 | char *new_path; /* non-NULL only with directory renames */ |
965a7bc2 | 2135 | |
fa5e06d6 | 2136 | if (p->status != 'A' && p->status != 'R') { |
965a7bc2 EN |
2137 | diff_free_filepair(p); |
2138 | continue; | |
2139 | } | |
965a7bc2 | 2140 | |
fa5e06d6 EN |
2141 | new_path = check_for_directory_rename(opt, p->two->path, |
2142 | side_index, | |
2143 | dir_renames_for_side, | |
2144 | rename_exclusions, | |
2145 | &collisions, | |
2146 | &clean); | |
2147 | ||
2148 | if (p->status != 'R' && !new_path) { | |
965a7bc2 EN |
2149 | diff_free_filepair(p); |
2150 | continue; | |
2151 | } | |
2152 | ||
fa5e06d6 EN |
2153 | if (new_path) |
2154 | apply_directory_rename_modifications(opt, p, new_path); | |
2155 | ||
965a7bc2 EN |
2156 | /* |
2157 | * p->score comes back from diffcore_rename_extended() with | |
2158 | * the similarity of the renamed file. The similarity is | |
2159 | * was used to determine that the two files were related | |
2160 | * and are a rename, which we have already used, but beyond | |
2161 | * that we have no use for the similarity. So p->score is | |
2162 | * now irrelevant. However, process_renames() will need to | |
2163 | * know which side of the merge this rename was associated | |
2164 | * with, so overwrite p->score with that value. | |
2165 | */ | |
2166 | p->score = side_index; | |
2167 | result->queue[result->nr++] = p; | |
2168 | } | |
2169 | ||
fa5e06d6 EN |
2170 | /* Free each value in the collisions map */ |
2171 | strmap_for_each_entry(&collisions, &iter, entry) { | |
2172 | struct collision_info *info = entry->value; | |
2173 | string_list_clear(&info->source_files, 0); | |
2174 | } | |
2175 | /* | |
2176 | * In compute_collisions(), we set collisions.strdup_strings to 0 | |
2177 | * so that we wouldn't have to make another copy of the new_path | |
2178 | * allocated by apply_dir_rename(). But now that we've used them | |
2179 | * and have no other references to these strings, it is time to | |
2180 | * deallocate them. | |
2181 | */ | |
2182 | free_strmap_strings(&collisions); | |
2183 | strmap_clear(&collisions, 1); | |
965a7bc2 | 2184 | return clean; |
e1a124e8 EN |
2185 | } |
2186 | ||
231e2dd4 EN |
2187 | static int detect_and_process_renames(struct merge_options *opt, |
2188 | struct tree *merge_base, | |
2189 | struct tree *side1, | |
2190 | struct tree *side2) | |
2191 | { | |
e1a124e8 EN |
2192 | struct diff_queue_struct combined; |
2193 | struct rename_info *renames = &opt->priv->renames; | |
112e1112 | 2194 | int need_dir_renames, s, clean = 1; |
e1a124e8 EN |
2195 | |
2196 | memset(&combined, 0, sizeof(combined)); | |
2197 | ||
2198 | detect_regular_renames(opt, merge_base, side1, MERGE_SIDE1); | |
2199 | detect_regular_renames(opt, merge_base, side2, MERGE_SIDE2); | |
2200 | ||
112e1112 EN |
2201 | need_dir_renames = |
2202 | !opt->priv->call_depth && | |
2203 | (opt->detect_directory_renames == MERGE_DIRECTORY_RENAMES_TRUE || | |
2204 | opt->detect_directory_renames == MERGE_DIRECTORY_RENAMES_CONFLICT); | |
2205 | ||
2206 | if (need_dir_renames) { | |
2207 | get_provisional_directory_renames(opt, MERGE_SIDE1, &clean); | |
2208 | get_provisional_directory_renames(opt, MERGE_SIDE2, &clean); | |
2209 | handle_directory_level_conflicts(opt); | |
2210 | } | |
2211 | ||
e1a124e8 EN |
2212 | ALLOC_GROW(combined.queue, |
2213 | renames->pairs[1].nr + renames->pairs[2].nr, | |
2214 | combined.alloc); | |
fa5e06d6 EN |
2215 | clean &= collect_renames(opt, &combined, MERGE_SIDE1, |
2216 | &renames->dir_renames[2], | |
2217 | &renames->dir_renames[1]); | |
2218 | clean &= collect_renames(opt, &combined, MERGE_SIDE2, | |
2219 | &renames->dir_renames[1], | |
2220 | &renames->dir_renames[2]); | |
e1a124e8 EN |
2221 | QSORT(combined.queue, combined.nr, compare_pairs); |
2222 | ||
2223 | clean &= process_renames(opt, &combined); | |
2224 | ||
2225 | /* Free memory for renames->pairs[] and combined */ | |
2226 | for (s = MERGE_SIDE1; s <= MERGE_SIDE2; s++) { | |
2227 | free(renames->pairs[s].queue); | |
2228 | DIFF_QUEUE_CLEAR(&renames->pairs[s]); | |
2229 | } | |
2230 | if (combined.nr) { | |
2231 | int i; | |
2232 | for (i = 0; i < combined.nr; i++) | |
2233 | diff_free_filepair(combined.queue[i]); | |
2234 | free(combined.queue); | |
2235 | } | |
231e2dd4 | 2236 | |
231e2dd4 EN |
2237 | return clean; |
2238 | } | |
2239 | ||
04af1879 EN |
2240 | /*** Function Grouping: functions related to process_entries() ***/ |
2241 | ||
8adffaa8 EN |
2242 | static int string_list_df_name_compare(const char *one, const char *two) |
2243 | { | |
2244 | int onelen = strlen(one); | |
2245 | int twolen = strlen(two); | |
2246 | /* | |
2247 | * Here we only care that entries for D/F conflicts are | |
2248 | * adjacent, in particular with the file of the D/F conflict | |
2249 | * appearing before files below the corresponding directory. | |
2250 | * The order of the rest of the list is irrelevant for us. | |
2251 | * | |
2252 | * To achieve this, we sort with df_name_compare and provide | |
2253 | * the mode S_IFDIR so that D/F conflicts will sort correctly. | |
2254 | * We use the mode S_IFDIR for everything else for simplicity, | |
2255 | * since in other cases any changes in their order due to | |
2256 | * sorting cause no problems for us. | |
2257 | */ | |
2258 | int cmp = df_name_compare(one, onelen, S_IFDIR, | |
2259 | two, twolen, S_IFDIR); | |
2260 | /* | |
2261 | * Now that 'foo' and 'foo/bar' compare equal, we have to make sure | |
2262 | * that 'foo' comes before 'foo/bar'. | |
2263 | */ | |
2264 | if (cmp) | |
2265 | return cmp; | |
2266 | return onelen - twolen; | |
2267 | } | |
2268 | ||
a9945bba | 2269 | struct directory_versions { |
bb470f4e EN |
2270 | /* |
2271 | * versions: list of (basename -> version_info) | |
2272 | * | |
2273 | * The basenames are in reverse lexicographic order of full pathnames, | |
2274 | * as processed in process_entries(). This puts all entries within | |
2275 | * a directory together, and covers the directory itself after | |
2276 | * everything within it, allowing us to write subtrees before needing | |
2277 | * to record information for the tree itself. | |
2278 | */ | |
a9945bba | 2279 | struct string_list versions; |
bb470f4e EN |
2280 | |
2281 | /* | |
2282 | * offsets: list of (full relative path directories -> integer offsets) | |
2283 | * | |
2284 | * Since versions contains basenames from files in multiple different | |
2285 | * directories, we need to know which entries in versions correspond | |
2286 | * to which directories. Values of e.g. | |
2287 | * "" 0 | |
2288 | * src 2 | |
2289 | * src/moduleA 5 | |
2290 | * Would mean that entries 0-1 of versions are files in the toplevel | |
2291 | * directory, entries 2-4 are files under src/, and the remaining | |
2292 | * entries starting at index 5 are files under src/moduleA/. | |
2293 | */ | |
2294 | struct string_list offsets; | |
2295 | ||
2296 | /* | |
2297 | * last_directory: directory that previously processed file found in | |
2298 | * | |
2299 | * last_directory starts NULL, but records the directory in which the | |
2300 | * previous file was found within. As soon as | |
2301 | * directory(current_file) != last_directory | |
2302 | * then we need to start updating accounting in versions & offsets. | |
2303 | * Note that last_directory is always the last path in "offsets" (or | |
2304 | * NULL if "offsets" is empty) so this exists just for quick access. | |
2305 | */ | |
2306 | const char *last_directory; | |
2307 | ||
2308 | /* last_directory_len: cached computation of strlen(last_directory) */ | |
2309 | unsigned last_directory_len; | |
a9945bba EN |
2310 | }; |
2311 | ||
ee4012dc EN |
2312 | static int tree_entry_order(const void *a_, const void *b_) |
2313 | { | |
2314 | const struct string_list_item *a = a_; | |
2315 | const struct string_list_item *b = b_; | |
2316 | ||
2317 | const struct merged_info *ami = a->util; | |
2318 | const struct merged_info *bmi = b->util; | |
2319 | return base_name_compare(a->string, strlen(a->string), ami->result.mode, | |
2320 | b->string, strlen(b->string), bmi->result.mode); | |
2321 | } | |
2322 | ||
2323 | static void write_tree(struct object_id *result_oid, | |
2324 | struct string_list *versions, | |
2325 | unsigned int offset, | |
2326 | size_t hash_size) | |
2327 | { | |
2328 | size_t maxlen = 0, extra; | |
2329 | unsigned int nr = versions->nr - offset; | |
2330 | struct strbuf buf = STRBUF_INIT; | |
2331 | struct string_list relevant_entries = STRING_LIST_INIT_NODUP; | |
2332 | int i; | |
2333 | ||
2334 | /* | |
2335 | * We want to sort the last (versions->nr-offset) entries in versions. | |
2336 | * Do so by abusing the string_list API a bit: make another string_list | |
2337 | * that contains just those entries and then sort them. | |
2338 | * | |
2339 | * We won't use relevant_entries again and will let it just pop off the | |
2340 | * stack, so there won't be allocation worries or anything. | |
2341 | */ | |
2342 | relevant_entries.items = versions->items + offset; | |
2343 | relevant_entries.nr = versions->nr - offset; | |
2344 | QSORT(relevant_entries.items, relevant_entries.nr, tree_entry_order); | |
2345 | ||
2346 | /* Pre-allocate some space in buf */ | |
2347 | extra = hash_size + 8; /* 8: 6 for mode, 1 for space, 1 for NUL char */ | |
2348 | for (i = 0; i < nr; i++) { | |
2349 | maxlen += strlen(versions->items[offset+i].string) + extra; | |
2350 | } | |
2351 | strbuf_grow(&buf, maxlen); | |
2352 | ||
2353 | /* Write each entry out to buf */ | |
2354 | for (i = 0; i < nr; i++) { | |
2355 | struct merged_info *mi = versions->items[offset+i].util; | |
2356 | struct version_info *ri = &mi->result; | |
2357 | strbuf_addf(&buf, "%o %s%c", | |
2358 | ri->mode, | |
2359 | versions->items[offset+i].string, '\0'); | |
2360 | strbuf_add(&buf, ri->oid.hash, hash_size); | |
2361 | } | |
2362 | ||
2363 | /* Write this object file out, and record in result_oid */ | |
2364 | write_object_file(buf.buf, buf.len, tree_type, result_oid); | |
2365 | strbuf_release(&buf); | |
2366 | } | |
2367 | ||
a9945bba EN |
2368 | static void record_entry_for_tree(struct directory_versions *dir_metadata, |
2369 | const char *path, | |
2370 | struct merged_info *mi) | |
2371 | { | |
2372 | const char *basename; | |
2373 | ||
2374 | if (mi->is_null) | |
2375 | /* nothing to record */ | |
2376 | return; | |
2377 | ||
2378 | basename = path + mi->basename_offset; | |
2379 | assert(strchr(basename, '/') == NULL); | |
2380 | string_list_append(&dir_metadata->versions, | |
2381 | basename)->util = &mi->result; | |
2382 | } | |
2383 | ||
bb470f4e EN |
2384 | static void write_completed_directory(struct merge_options *opt, |
2385 | const char *new_directory_name, | |
2386 | struct directory_versions *info) | |
2387 | { | |
2388 | const char *prev_dir; | |
2389 | struct merged_info *dir_info = NULL; | |
2390 | unsigned int offset; | |
2391 | ||
2392 | /* | |
2393 | * Some explanation of info->versions and info->offsets... | |
2394 | * | |
2395 | * process_entries() iterates over all relevant files AND | |
2396 | * directories in reverse lexicographic order, and calls this | |
2397 | * function. Thus, an example of the paths that process_entries() | |
2398 | * could operate on (along with the directories for those paths | |
2399 | * being shown) is: | |
2400 | * | |
2401 | * xtract.c "" | |
2402 | * tokens.txt "" | |
2403 | * src/moduleB/umm.c src/moduleB | |
2404 | * src/moduleB/stuff.h src/moduleB | |
2405 | * src/moduleB/baz.c src/moduleB | |
2406 | * src/moduleB src | |
2407 | * src/moduleA/foo.c src/moduleA | |
2408 | * src/moduleA/bar.c src/moduleA | |
2409 | * src/moduleA src | |
2410 | * src "" | |
2411 | * Makefile "" | |
2412 | * | |
2413 | * info->versions: | |
2414 | * | |
2415 | * always contains the unprocessed entries and their | |
2416 | * version_info information. For example, after the first five | |
2417 | * entries above, info->versions would be: | |
2418 | * | |
2419 | * xtract.c <xtract.c's version_info> | |
2420 | * token.txt <token.txt's version_info> | |
2421 | * umm.c <src/moduleB/umm.c's version_info> | |
2422 | * stuff.h <src/moduleB/stuff.h's version_info> | |
2423 | * baz.c <src/moduleB/baz.c's version_info> | |
2424 | * | |
2425 | * Once a subdirectory is completed we remove the entries in | |
2426 | * that subdirectory from info->versions, writing it as a tree | |
2427 | * (write_tree()). Thus, as soon as we get to src/moduleB, | |
2428 | * info->versions would be updated to | |
2429 | * | |
2430 | * xtract.c <xtract.c's version_info> | |
2431 | * token.txt <token.txt's version_info> | |
2432 | * moduleB <src/moduleB's version_info> | |
2433 | * | |
2434 | * info->offsets: | |
2435 | * | |
2436 | * helps us track which entries in info->versions correspond to | |
2437 | * which directories. When we are N directories deep (e.g. 4 | |
2438 | * for src/modA/submod/subdir/), we have up to N+1 unprocessed | |
2439 | * directories (+1 because of toplevel dir). Corresponding to | |
2440 | * the info->versions example above, after processing five entries | |
2441 | * info->offsets will be: | |
2442 | * | |
2443 | * "" 0 | |
2444 | * src/moduleB 2 | |
2445 | * | |
2446 | * which is used to know that xtract.c & token.txt are from the | |
2447 | * toplevel dirctory, while umm.c & stuff.h & baz.c are from the | |
2448 | * src/moduleB directory. Again, following the example above, | |
2449 | * once we need to process src/moduleB, then info->offsets is | |
2450 | * updated to | |
2451 | * | |
2452 | * "" 0 | |
2453 | * src 2 | |
2454 | * | |
2455 | * which says that moduleB (and only moduleB so far) is in the | |
2456 | * src directory. | |
2457 | * | |
2458 | * One unique thing to note about info->offsets here is that | |
2459 | * "src" was not added to info->offsets until there was a path | |
2460 | * (a file OR directory) immediately below src/ that got | |
2461 | * processed. | |
2462 | * | |
2463 | * Since process_entry() just appends new entries to info->versions, | |
2464 | * write_completed_directory() only needs to do work if the next path | |
2465 | * is in a directory that is different than the last directory found | |
2466 | * in info->offsets. | |
2467 | */ | |
2468 | ||
2469 | /* | |
2470 | * If we are working with the same directory as the last entry, there | |
2471 | * is no work to do. (See comments above the directory_name member of | |
2472 | * struct merged_info for why we can use pointer comparison instead of | |
2473 | * strcmp here.) | |
2474 | */ | |
2475 | if (new_directory_name == info->last_directory) | |
2476 | return; | |
2477 | ||
2478 | /* | |
2479 | * If we are just starting (last_directory is NULL), or last_directory | |
2480 | * is a prefix of the current directory, then we can just update | |
2481 | * info->offsets to record the offset where we started this directory | |
2482 | * and update last_directory to have quick access to it. | |
2483 | */ | |
2484 | if (info->last_directory == NULL || | |
2485 | !strncmp(new_directory_name, info->last_directory, | |
2486 | info->last_directory_len)) { | |
2487 | uintptr_t offset = info->versions.nr; | |
2488 | ||
2489 | info->last_directory = new_directory_name; | |
2490 | info->last_directory_len = strlen(info->last_directory); | |
2491 | /* | |
2492 | * Record the offset into info->versions where we will | |
2493 | * start recording basenames of paths found within | |
2494 | * new_directory_name. | |
2495 | */ | |
2496 | string_list_append(&info->offsets, | |
2497 | info->last_directory)->util = (void*)offset; | |
2498 | return; | |
2499 | } | |
2500 | ||
2501 | /* | |
2502 | * The next entry that will be processed will be within | |
2503 | * new_directory_name. Since at this point we know that | |
2504 | * new_directory_name is within a different directory than | |
2505 | * info->last_directory, we have all entries for info->last_directory | |
2506 | * in info->versions and we need to create a tree object for them. | |
2507 | */ | |
2508 | dir_info = strmap_get(&opt->priv->paths, info->last_directory); | |
2509 | assert(dir_info); | |
2510 | offset = (uintptr_t)info->offsets.items[info->offsets.nr-1].util; | |
2511 | if (offset == info->versions.nr) { | |
2512 | /* | |
2513 | * Actually, we don't need to create a tree object in this | |
2514 | * case. Whenever all files within a directory disappear | |
2515 | * during the merge (e.g. unmodified on one side and | |
2516 | * deleted on the other, or files were renamed elsewhere), | |
2517 | * then we get here and the directory itself needs to be | |
2518 | * omitted from its parent tree as well. | |
2519 | */ | |
2520 | dir_info->is_null = 1; | |
2521 | } else { | |
2522 | /* | |
2523 | * Write out the tree to the git object directory, and also | |
2524 | * record the mode and oid in dir_info->result. | |
2525 | */ | |
2526 | dir_info->is_null = 0; | |
2527 | dir_info->result.mode = S_IFDIR; | |
2528 | write_tree(&dir_info->result.oid, &info->versions, offset, | |
2529 | opt->repo->hash_algo->rawsz); | |
2530 | } | |
2531 | ||
2532 | /* | |
2533 | * We've now used several entries from info->versions and one entry | |
2534 | * from info->offsets, so we get rid of those values. | |
2535 | */ | |
2536 | info->offsets.nr--; | |
2537 | info->versions.nr = offset; | |
2538 | ||
2539 | /* | |
2540 | * Now we've taken care of the completed directory, but we need to | |
2541 | * prepare things since future entries will be in | |
2542 | * new_directory_name. (In particular, process_entry() will be | |
2543 | * appending new entries to info->versions.) So, we need to make | |
2544 | * sure new_directory_name is the last entry in info->offsets. | |
2545 | */ | |
2546 | prev_dir = info->offsets.nr == 0 ? NULL : | |
2547 | info->offsets.items[info->offsets.nr-1].string; | |
2548 | if (new_directory_name != prev_dir) { | |
2549 | uintptr_t c = info->versions.nr; | |
2550 | string_list_append(&info->offsets, | |
2551 | new_directory_name)->util = (void*)c; | |
2552 | } | |
2553 | ||
2554 | /* And, of course, we need to update last_directory to match. */ | |
2555 | info->last_directory = new_directory_name; | |
2556 | info->last_directory_len = strlen(info->last_directory); | |
2557 | } | |
2558 | ||
6a02dd90 EN |
2559 | /* Per entry merge function */ |
2560 | static void process_entry(struct merge_options *opt, | |
2561 | const char *path, | |
a9945bba EN |
2562 | struct conflict_info *ci, |
2563 | struct directory_versions *dir_metadata) | |
6a02dd90 | 2564 | { |
23366d2a EN |
2565 | int df_file_index = 0; |
2566 | ||
6a02dd90 EN |
2567 | VERIFY_CI(ci); |
2568 | assert(ci->filemask >= 0 && ci->filemask <= 7); | |
2569 | /* ci->match_mask == 7 was handled in collect_merge_info_callback() */ | |
2570 | assert(ci->match_mask == 0 || ci->match_mask == 3 || | |
2571 | ci->match_mask == 5 || ci->match_mask == 6); | |
2572 | ||
a9945bba EN |
2573 | if (ci->dirmask) { |
2574 | record_entry_for_tree(dir_metadata, path, &ci->merged); | |
2575 | if (ci->filemask == 0) | |
2576 | /* nothing else to handle */ | |
2577 | return; | |
2578 | assert(ci->df_conflict); | |
2579 | } | |
2580 | ||
0ccfa4e5 EN |
2581 | if (ci->df_conflict && ci->merged.result.mode == 0) { |
2582 | int i; | |
2583 | ||
2584 | /* | |
2585 | * directory no longer in the way, but we do have a file we | |
2586 | * need to place here so we need to clean away the "directory | |
2587 | * merges to nothing" result. | |
2588 | */ | |
2589 | ci->df_conflict = 0; | |
2590 | assert(ci->filemask != 0); | |
2591 | ci->merged.clean = 0; | |
2592 | ci->merged.is_null = 0; | |
2593 | /* and we want to zero out any directory-related entries */ | |
2594 | ci->match_mask = (ci->match_mask & ~ci->dirmask); | |
2595 | ci->dirmask = 0; | |
2596 | for (i = MERGE_BASE; i <= MERGE_SIDE2; i++) { | |
2597 | if (ci->filemask & (1 << i)) | |
2598 | continue; | |
2599 | ci->stages[i].mode = 0; | |
2600 | oidcpy(&ci->stages[i].oid, &null_oid); | |
2601 | } | |
2602 | } else if (ci->df_conflict && ci->merged.result.mode != 0) { | |
23366d2a EN |
2603 | /* |
2604 | * This started out as a D/F conflict, and the entries in | |
2605 | * the competing directory were not removed by the merge as | |
2606 | * evidenced by write_completed_directory() writing a value | |
2607 | * to ci->merged.result.mode. | |
2608 | */ | |
2609 | struct conflict_info *new_ci; | |
2610 | const char *branch; | |
2611 | const char *old_path = path; | |
2612 | int i; | |
2613 | ||
2614 | assert(ci->merged.result.mode == S_IFDIR); | |
2615 | ||
2616 | /* | |
2617 | * If filemask is 1, we can just ignore the file as having | |
2618 | * been deleted on both sides. We do not want to overwrite | |
2619 | * ci->merged.result, since it stores the tree for all the | |
2620 | * files under it. | |
2621 | */ | |
2622 | if (ci->filemask == 1) { | |
2623 | ci->filemask = 0; | |
2624 | return; | |
2625 | } | |
2626 | ||
2627 | /* | |
2628 | * This file still exists on at least one side, and we want | |
2629 | * the directory to remain here, so we need to move this | |
2630 | * path to some new location. | |
2631 | */ | |
2632 | new_ci = xcalloc(1, sizeof(*new_ci)); | |
2633 | /* We don't really want new_ci->merged.result copied, but it'll | |
2634 | * be overwritten below so it doesn't matter. We also don't | |
2635 | * want any directory mode/oid values copied, but we'll zero | |
2636 | * those out immediately. We do want the rest of ci copied. | |
2637 | */ | |
2638 | memcpy(new_ci, ci, sizeof(*ci)); | |
2639 | new_ci->match_mask = (new_ci->match_mask & ~new_ci->dirmask); | |
2640 | new_ci->dirmask = 0; | |
2641 | for (i = MERGE_BASE; i <= MERGE_SIDE2; i++) { | |
2642 | if (new_ci->filemask & (1 << i)) | |
2643 | continue; | |
2644 | /* zero out any entries related to directories */ | |
2645 | new_ci->stages[i].mode = 0; | |
2646 | oidcpy(&new_ci->stages[i].oid, &null_oid); | |
2647 | } | |
2648 | ||
2649 | /* | |
2650 | * Find out which side this file came from; note that we | |
2651 | * cannot just use ci->filemask, because renames could cause | |
2652 | * the filemask to go back to 7. So we use dirmask, then | |
2653 | * pick the opposite side's index. | |
2654 | */ | |
2655 | df_file_index = (ci->dirmask & (1 << 1)) ? 2 : 1; | |
2656 | branch = (df_file_index == 1) ? opt->branch1 : opt->branch2; | |
2657 | path = unique_path(&opt->priv->paths, path, branch); | |
2658 | strmap_put(&opt->priv->paths, path, new_ci); | |
2659 | ||
2660 | path_msg(opt, path, 0, | |
2661 | _("CONFLICT (file/directory): directory in the way " | |
2662 | "of %s from %s; moving it to %s instead."), | |
2663 | old_path, branch, path); | |
2664 | ||
2665 | /* | |
2666 | * Zero out the filemask for the old ci. At this point, ci | |
2667 | * was just an entry for a directory, so we don't need to | |
2668 | * do anything more with it. | |
2669 | */ | |
2670 | ci->filemask = 0; | |
2671 | ||
2672 | /* | |
2673 | * Now note that we're working on the new entry (path was | |
2674 | * updated above. | |
2675 | */ | |
2676 | ci = new_ci; | |
6a02dd90 EN |
2677 | } |
2678 | ||
2679 | /* | |
2680 | * NOTE: Below there is a long switch-like if-elseif-elseif... block | |
2681 | * which the code goes through even for the df_conflict cases | |
23366d2a | 2682 | * above. |
6a02dd90 EN |
2683 | */ |
2684 | if (ci->match_mask) { | |
2685 | ci->merged.clean = 1; | |
2686 | if (ci->match_mask == 6) { | |
2687 | /* stages[1] == stages[2] */ | |
2688 | ci->merged.result.mode = ci->stages[1].mode; | |
2689 | oidcpy(&ci->merged.result.oid, &ci->stages[1].oid); | |
2690 | } else { | |
2691 | /* determine the mask of the side that didn't match */ | |
2692 | unsigned int othermask = 7 & ~ci->match_mask; | |
2693 | int side = (othermask == 4) ? 2 : 1; | |
2694 | ||
2695 | ci->merged.result.mode = ci->stages[side].mode; | |
2696 | ci->merged.is_null = !ci->merged.result.mode; | |
2697 | oidcpy(&ci->merged.result.oid, &ci->stages[side].oid); | |
2698 | ||
2699 | assert(othermask == 2 || othermask == 4); | |
2700 | assert(ci->merged.is_null == | |
2701 | (ci->filemask == ci->match_mask)); | |
2702 | } | |
2703 | } else if (ci->filemask >= 6 && | |
2704 | (S_IFMT & ci->stages[1].mode) != | |
2705 | (S_IFMT & ci->stages[2].mode)) { | |
4ef88fc3 EN |
2706 | /* Two different items from (file/submodule/symlink) */ |
2707 | if (opt->priv->call_depth) { | |
2708 | /* Just use the version from the merge base */ | |
2709 | ci->merged.clean = 0; | |
2710 | oidcpy(&ci->merged.result.oid, &ci->stages[0].oid); | |
2711 | ci->merged.result.mode = ci->stages[0].mode; | |
2712 | ci->merged.is_null = (ci->merged.result.mode == 0); | |
2713 | } else { | |
2714 | /* Handle by renaming one or both to separate paths. */ | |
2715 | unsigned o_mode = ci->stages[0].mode; | |
2716 | unsigned a_mode = ci->stages[1].mode; | |
2717 | unsigned b_mode = ci->stages[2].mode; | |
2718 | struct conflict_info *new_ci; | |
2719 | const char *a_path = NULL, *b_path = NULL; | |
2720 | int rename_a = 0, rename_b = 0; | |
2721 | ||
2722 | new_ci = xmalloc(sizeof(*new_ci)); | |
2723 | ||
2724 | if (S_ISREG(a_mode)) | |
2725 | rename_a = 1; | |
2726 | else if (S_ISREG(b_mode)) | |
2727 | rename_b = 1; | |
2728 | else { | |
2729 | rename_a = 1; | |
2730 | rename_b = 1; | |
2731 | } | |
2732 | ||
2733 | path_msg(opt, path, 0, | |
2734 | _("CONFLICT (distinct types): %s had different " | |
2735 | "types on each side; renamed %s of them so " | |
2736 | "each can be recorded somewhere."), | |
2737 | path, | |
2738 | (rename_a && rename_b) ? _("both") : _("one")); | |
2739 | ||
2740 | ci->merged.clean = 0; | |
2741 | memcpy(new_ci, ci, sizeof(*new_ci)); | |
2742 | ||
2743 | /* Put b into new_ci, removing a from stages */ | |
2744 | new_ci->merged.result.mode = ci->stages[2].mode; | |
2745 | oidcpy(&new_ci->merged.result.oid, &ci->stages[2].oid); | |
2746 | new_ci->stages[1].mode = 0; | |
2747 | oidcpy(&new_ci->stages[1].oid, &null_oid); | |
2748 | new_ci->filemask = 5; | |
2749 | if ((S_IFMT & b_mode) != (S_IFMT & o_mode)) { | |
2750 | new_ci->stages[0].mode = 0; | |
2751 | oidcpy(&new_ci->stages[0].oid, &null_oid); | |
2752 | new_ci->filemask = 4; | |
2753 | } | |
2754 | ||
2755 | /* Leave only a in ci, fixing stages. */ | |
2756 | ci->merged.result.mode = ci->stages[1].mode; | |
2757 | oidcpy(&ci->merged.result.oid, &ci->stages[1].oid); | |
2758 | ci->stages[2].mode = 0; | |
2759 | oidcpy(&ci->stages[2].oid, &null_oid); | |
2760 | ci->filemask = 3; | |
2761 | if ((S_IFMT & a_mode) != (S_IFMT & o_mode)) { | |
2762 | ci->stages[0].mode = 0; | |
2763 | oidcpy(&ci->stages[0].oid, &null_oid); | |
2764 | ci->filemask = 2; | |
2765 | } | |
2766 | ||
2767 | /* Insert entries into opt->priv_paths */ | |
2768 | assert(rename_a || rename_b); | |
2769 | if (rename_a) { | |
2770 | a_path = unique_path(&opt->priv->paths, | |
2771 | path, opt->branch1); | |
2772 | strmap_put(&opt->priv->paths, a_path, ci); | |
2773 | } | |
2774 | ||
2775 | if (rename_b) | |
2776 | b_path = unique_path(&opt->priv->paths, | |
2777 | path, opt->branch2); | |
2778 | else | |
2779 | b_path = path; | |
2780 | strmap_put(&opt->priv->paths, b_path, new_ci); | |
2781 | ||
2782 | if (rename_a && rename_b) { | |
2783 | strmap_remove(&opt->priv->paths, path, 0); | |
2784 | /* | |
2785 | * We removed path from opt->priv->paths. path | |
2786 | * will also eventually need to be freed, but | |
2787 | * it may still be used by e.g. ci->pathnames. | |
2788 | * So, store it in another string-list for now. | |
2789 | */ | |
2790 | string_list_append(&opt->priv->paths_to_free, | |
2791 | path); | |
2792 | } | |
2793 | ||
2794 | /* | |
2795 | * Do special handling for b_path since process_entry() | |
2796 | * won't be called on it specially. | |
2797 | */ | |
2798 | strmap_put(&opt->priv->conflicted, b_path, new_ci); | |
2799 | record_entry_for_tree(dir_metadata, b_path, | |
2800 | &new_ci->merged); | |
2801 | ||
2802 | /* | |
2803 | * Remaining code for processing this entry should | |
2804 | * think in terms of processing a_path. | |
2805 | */ | |
2806 | if (a_path) | |
2807 | path = a_path; | |
2808 | } | |
6a02dd90 | 2809 | } else if (ci->filemask >= 6) { |
991bbdca EN |
2810 | /* Need a two-way or three-way content merge */ |
2811 | struct version_info merged_file; | |
2812 | unsigned clean_merge; | |
2813 | struct version_info *o = &ci->stages[0]; | |
2814 | struct version_info *a = &ci->stages[1]; | |
2815 | struct version_info *b = &ci->stages[2]; | |
2816 | ||
2817 | clean_merge = handle_content_merge(opt, path, o, a, b, | |
2818 | ci->pathnames, | |
2819 | opt->priv->call_depth * 2, | |
2820 | &merged_file); | |
2821 | ci->merged.clean = clean_merge && | |
2822 | !ci->df_conflict && !ci->path_conflict; | |
2823 | ci->merged.result.mode = merged_file.mode; | |
2824 | ci->merged.is_null = (merged_file.mode == 0); | |
2825 | oidcpy(&ci->merged.result.oid, &merged_file.oid); | |
2826 | if (clean_merge && ci->df_conflict) { | |
2827 | assert(df_file_index == 1 || df_file_index == 2); | |
2828 | ci->filemask = 1 << df_file_index; | |
2829 | ci->stages[df_file_index].mode = merged_file.mode; | |
2830 | oidcpy(&ci->stages[df_file_index].oid, &merged_file.oid); | |
2831 | } | |
2832 | if (!clean_merge) { | |
2833 | const char *reason = _("content"); | |
2834 | if (ci->filemask == 6) | |
2835 | reason = _("add/add"); | |
2836 | if (S_ISGITLINK(merged_file.mode)) | |
2837 | reason = _("submodule"); | |
2838 | path_msg(opt, path, 0, | |
2839 | _("CONFLICT (%s): Merge conflict in %s"), | |
2840 | reason, path); | |
2841 | } | |
6a02dd90 EN |
2842 | } else if (ci->filemask == 3 || ci->filemask == 5) { |
2843 | /* Modify/delete */ | |
c5a6f655 EN |
2844 | const char *modify_branch, *delete_branch; |
2845 | int side = (ci->filemask == 5) ? 2 : 1; | |
2846 | int index = opt->priv->call_depth ? 0 : side; | |
2847 | ||
2848 | ci->merged.result.mode = ci->stages[index].mode; | |
2849 | oidcpy(&ci->merged.result.oid, &ci->stages[index].oid); | |
2850 | ci->merged.clean = 0; | |
2851 | ||
2852 | modify_branch = (side == 1) ? opt->branch1 : opt->branch2; | |
2853 | delete_branch = (side == 1) ? opt->branch2 : opt->branch1; | |
2854 | ||
2e91ddd2 EN |
2855 | if (ci->path_conflict && |
2856 | oideq(&ci->stages[0].oid, &ci->stages[side].oid)) { | |
2857 | /* | |
2858 | * This came from a rename/delete; no action to take, | |
2859 | * but avoid printing "modify/delete" conflict notice | |
2860 | * since the contents were not modified. | |
2861 | */ | |
2862 | } else { | |
2863 | path_msg(opt, path, 0, | |
2864 | _("CONFLICT (modify/delete): %s deleted in %s " | |
2865 | "and modified in %s. Version %s of %s left " | |
2866 | "in tree."), | |
2867 | path, delete_branch, modify_branch, | |
2868 | modify_branch, path); | |
2869 | } | |
6a02dd90 EN |
2870 | } else if (ci->filemask == 2 || ci->filemask == 4) { |
2871 | /* Added on one side */ | |
2872 | int side = (ci->filemask == 4) ? 2 : 1; | |
2873 | ci->merged.result.mode = ci->stages[side].mode; | |
2874 | oidcpy(&ci->merged.result.oid, &ci->stages[side].oid); | |
53e88a03 | 2875 | ci->merged.clean = !ci->df_conflict && !ci->path_conflict; |
6a02dd90 EN |
2876 | } else if (ci->filemask == 1) { |
2877 | /* Deleted on both sides */ | |
2878 | ci->merged.is_null = 1; | |
2879 | ci->merged.result.mode = 0; | |
2880 | oidcpy(&ci->merged.result.oid, &null_oid); | |
53e88a03 | 2881 | ci->merged.clean = !ci->path_conflict; |
6a02dd90 EN |
2882 | } |
2883 | ||
2884 | /* | |
2885 | * If still conflicted, record it separately. This allows us to later | |
2886 | * iterate over just conflicted entries when updating the index instead | |
2887 | * of iterating over all entries. | |
2888 | */ | |
2889 | if (!ci->merged.clean) | |
2890 | strmap_put(&opt->priv->conflicted, path, ci); | |
a9945bba | 2891 | record_entry_for_tree(dir_metadata, path, &ci->merged); |
6a02dd90 EN |
2892 | } |
2893 | ||
231e2dd4 EN |
2894 | static void process_entries(struct merge_options *opt, |
2895 | struct object_id *result_oid) | |
2896 | { | |
6a02dd90 EN |
2897 | struct hashmap_iter iter; |
2898 | struct strmap_entry *e; | |
8adffaa8 EN |
2899 | struct string_list plist = STRING_LIST_INIT_NODUP; |
2900 | struct string_list_item *entry; | |
bb470f4e EN |
2901 | struct directory_versions dir_metadata = { STRING_LIST_INIT_NODUP, |
2902 | STRING_LIST_INIT_NODUP, | |
2903 | NULL, 0 }; | |
6a02dd90 EN |
2904 | |
2905 | if (strmap_empty(&opt->priv->paths)) { | |
2906 | oidcpy(result_oid, opt->repo->hash_algo->empty_tree); | |
2907 | return; | |
2908 | } | |
2909 | ||
8adffaa8 EN |
2910 | /* Hack to pre-allocate plist to the desired size */ |
2911 | ALLOC_GROW(plist.items, strmap_get_size(&opt->priv->paths), plist.alloc); | |
2912 | ||
2913 | /* Put every entry from paths into plist, then sort */ | |
6a02dd90 | 2914 | strmap_for_each_entry(&opt->priv->paths, &iter, e) { |
8adffaa8 EN |
2915 | string_list_append(&plist, e->key)->util = e->value; |
2916 | } | |
2917 | plist.cmp = string_list_df_name_compare; | |
2918 | string_list_sort(&plist); | |
2919 | ||
2920 | /* | |
2921 | * Iterate over the items in reverse order, so we can handle paths | |
2922 | * below a directory before needing to handle the directory itself. | |
bb470f4e EN |
2923 | * |
2924 | * This allows us to write subtrees before we need to write trees, | |
2925 | * and it also enables sane handling of directory/file conflicts | |
2926 | * (because it allows us to know whether the directory is still in | |
2927 | * the way when it is time to process the file at the same path). | |
8adffaa8 EN |
2928 | */ |
2929 | for (entry = &plist.items[plist.nr-1]; entry >= plist.items; --entry) { | |
2930 | char *path = entry->string; | |
6a02dd90 EN |
2931 | /* |
2932 | * NOTE: mi may actually be a pointer to a conflict_info, but | |
2933 | * we have to check mi->clean first to see if it's safe to | |
2934 | * reassign to such a pointer type. | |
2935 | */ | |
8adffaa8 | 2936 | struct merged_info *mi = entry->util; |
6a02dd90 | 2937 | |
bb470f4e EN |
2938 | write_completed_directory(opt, mi->directory_name, |
2939 | &dir_metadata); | |
a9945bba EN |
2940 | if (mi->clean) |
2941 | record_entry_for_tree(&dir_metadata, path, mi); | |
2942 | else { | |
8adffaa8 | 2943 | struct conflict_info *ci = (struct conflict_info *)mi; |
a9945bba | 2944 | process_entry(opt, path, ci, &dir_metadata); |
8adffaa8 | 2945 | } |
6a02dd90 EN |
2946 | } |
2947 | ||
bb470f4e EN |
2948 | if (dir_metadata.offsets.nr != 1 || |
2949 | (uintptr_t)dir_metadata.offsets.items[0].util != 0) { | |
2950 | printf("dir_metadata.offsets.nr = %d (should be 1)\n", | |
2951 | dir_metadata.offsets.nr); | |
2952 | printf("dir_metadata.offsets.items[0].util = %u (should be 0)\n", | |
2953 | (unsigned)(uintptr_t)dir_metadata.offsets.items[0].util); | |
2954 | fflush(stdout); | |
2955 | BUG("dir_metadata accounting completely off; shouldn't happen"); | |
2956 | } | |
ee4012dc EN |
2957 | write_tree(result_oid, &dir_metadata.versions, 0, |
2958 | opt->repo->hash_algo->rawsz); | |
8adffaa8 | 2959 | string_list_clear(&plist, 0); |
a9945bba | 2960 | string_list_clear(&dir_metadata.versions, 0); |
bb470f4e | 2961 | string_list_clear(&dir_metadata.offsets, 0); |
231e2dd4 EN |
2962 | } |
2963 | ||
04af1879 EN |
2964 | /*** Function Grouping: functions related to merge_switch_to_result() ***/ |
2965 | ||
9fefce68 EN |
2966 | static int checkout(struct merge_options *opt, |
2967 | struct tree *prev, | |
2968 | struct tree *next) | |
2969 | { | |
6681ce5c EN |
2970 | /* Switch the index/working copy from old to new */ |
2971 | int ret; | |
2972 | struct tree_desc trees[2]; | |
2973 | struct unpack_trees_options unpack_opts; | |
2974 | ||
2975 | memset(&unpack_opts, 0, sizeof(unpack_opts)); | |
2976 | unpack_opts.head_idx = -1; | |
2977 | unpack_opts.src_index = opt->repo->index; | |
2978 | unpack_opts.dst_index = opt->repo->index; | |
2979 | ||
2980 | setup_unpack_trees_porcelain(&unpack_opts, "merge"); | |
2981 | ||
2982 | /* | |
2983 | * NOTE: if this were just "git checkout" code, we would probably | |
2984 | * read or refresh the cache and check for a conflicted index, but | |
2985 | * builtin/merge.c or sequencer.c really needs to read the index | |
2986 | * and check for conflicted entries before starting merging for a | |
2987 | * good user experience (no sense waiting for merges/rebases before | |
2988 | * erroring out), so there's no reason to duplicate that work here. | |
2989 | */ | |
2990 | ||
2991 | /* 2-way merge to the new branch */ | |
2992 | unpack_opts.update = 1; | |
2993 | unpack_opts.merge = 1; | |
2994 | unpack_opts.quiet = 0; /* FIXME: sequencer might want quiet? */ | |
2995 | unpack_opts.verbose_update = (opt->verbosity > 2); | |
2996 | unpack_opts.fn = twoway_merge; | |
2997 | if (1/* FIXME: opts->overwrite_ignore*/) { | |
2998 | unpack_opts.dir = xcalloc(1, sizeof(*unpack_opts.dir)); | |
2999 | unpack_opts.dir->flags |= DIR_SHOW_IGNORED; | |
3000 | setup_standard_excludes(unpack_opts.dir); | |
3001 | } | |
3002 | parse_tree(prev); | |
3003 | init_tree_desc(&trees[0], prev->buffer, prev->size); | |
3004 | parse_tree(next); | |
3005 | init_tree_desc(&trees[1], next->buffer, next->size); | |
3006 | ||
3007 | ret = unpack_trees(2, trees, &unpack_opts); | |
3008 | clear_unpack_trees_porcelain(&unpack_opts); | |
3009 | dir_clear(unpack_opts.dir); | |
3010 | FREE_AND_NULL(unpack_opts.dir); | |
3011 | return ret; | |
9fefce68 EN |
3012 | } |
3013 | ||
3014 | static int record_conflicted_index_entries(struct merge_options *opt, | |
3015 | struct index_state *index, | |
3016 | struct strmap *paths, | |
3017 | struct strmap *conflicted) | |
3018 | { | |
ef2b3693 EN |
3019 | struct hashmap_iter iter; |
3020 | struct strmap_entry *e; | |
3021 | int errs = 0; | |
3022 | int original_cache_nr; | |
3023 | ||
9fefce68 EN |
3024 | if (strmap_empty(conflicted)) |
3025 | return 0; | |
3026 | ||
ef2b3693 EN |
3027 | original_cache_nr = index->cache_nr; |
3028 | ||
3029 | /* Put every entry from paths into plist, then sort */ | |
3030 | strmap_for_each_entry(conflicted, &iter, e) { | |
3031 | const char *path = e->key; | |
3032 | struct conflict_info *ci = e->value; | |
3033 | int pos; | |
3034 | struct cache_entry *ce; | |
3035 | int i; | |
3036 | ||
3037 | VERIFY_CI(ci); | |
3038 | ||
3039 | /* | |
3040 | * The index will already have a stage=0 entry for this path, | |
3041 | * because we created an as-merged-as-possible version of the | |
3042 | * file and checkout() moved the working copy and index over | |
3043 | * to that version. | |
3044 | * | |
3045 | * However, previous iterations through this loop will have | |
3046 | * added unstaged entries to the end of the cache which | |
3047 | * ignore the standard alphabetical ordering of cache | |
3048 | * entries and break invariants needed for index_name_pos() | |
3049 | * to work. However, we know the entry we want is before | |
3050 | * those appended cache entries, so do a temporary swap on | |
3051 | * cache_nr to only look through entries of interest. | |
3052 | */ | |
3053 | SWAP(index->cache_nr, original_cache_nr); | |
3054 | pos = index_name_pos(index, path, strlen(path)); | |
3055 | SWAP(index->cache_nr, original_cache_nr); | |
3056 | if (pos < 0) { | |
3057 | if (ci->filemask != 1) | |
3058 | BUG("Conflicted %s but nothing in basic working tree or index; this shouldn't happen", path); | |
3059 | cache_tree_invalidate_path(index, path); | |
3060 | } else { | |
3061 | ce = index->cache[pos]; | |
3062 | ||
3063 | /* | |
3064 | * Clean paths with CE_SKIP_WORKTREE set will not be | |
3065 | * written to the working tree by the unpack_trees() | |
3066 | * call in checkout(). Our conflicted entries would | |
3067 | * have appeared clean to that code since we ignored | |
3068 | * the higher order stages. Thus, we need override | |
3069 | * the CE_SKIP_WORKTREE bit and manually write those | |
3070 | * files to the working disk here. | |
3071 | * | |
3072 | * TODO: Implement this CE_SKIP_WORKTREE fixup. | |
3073 | */ | |
3074 | ||
3075 | /* | |
3076 | * Mark this cache entry for removal and instead add | |
3077 | * new stage>0 entries corresponding to the | |
3078 | * conflicts. If there are many conflicted entries, we | |
3079 | * want to avoid memmove'ing O(NM) entries by | |
3080 | * inserting the new entries one at a time. So, | |
3081 | * instead, we just add the new cache entries to the | |
3082 | * end (ignoring normal index requirements on sort | |
3083 | * order) and sort the index once we're all done. | |
3084 | */ | |
3085 | ce->ce_flags |= CE_REMOVE; | |
3086 | } | |
3087 | ||
3088 | for (i = MERGE_BASE; i <= MERGE_SIDE2; i++) { | |
3089 | struct version_info *vi; | |
3090 | if (!(ci->filemask & (1ul << i))) | |
3091 | continue; | |
3092 | vi = &ci->stages[i]; | |
3093 | ce = make_cache_entry(index, vi->mode, &vi->oid, | |
3094 | path, i+1, 0); | |
3095 | add_index_entry(index, ce, ADD_CACHE_JUST_APPEND); | |
3096 | } | |
3097 | } | |
3098 | ||
3099 | /* | |
3100 | * Remove the unused cache entries (and invalidate the relevant | |
3101 | * cache-trees), then sort the index entries to get the conflicted | |
3102 | * entries we added to the end into their right locations. | |
3103 | */ | |
3104 | remove_marked_cache_entries(index, 1); | |
3105 | QSORT(index->cache, index->cache_nr, cmp_cache_name_compare); | |
3106 | ||
3107 | return errs; | |
9fefce68 EN |
3108 | } |
3109 | ||
17e5574b EN |
3110 | void merge_switch_to_result(struct merge_options *opt, |
3111 | struct tree *head, | |
3112 | struct merge_result *result, | |
3113 | int update_worktree_and_index, | |
3114 | int display_update_msgs) | |
3115 | { | |
9fefce68 EN |
3116 | assert(opt->priv == NULL); |
3117 | if (result->clean >= 0 && update_worktree_and_index) { | |
3118 | struct merge_options_internal *opti = result->priv; | |
3119 | ||
3120 | if (checkout(opt, head, result->tree)) { | |
3121 | /* failure to function */ | |
3122 | result->clean = -1; | |
3123 | return; | |
3124 | } | |
3125 | ||
3126 | if (record_conflicted_index_entries(opt, opt->repo->index, | |
3127 | &opti->paths, | |
3128 | &opti->conflicted)) { | |
3129 | /* failure to function */ | |
3130 | result->clean = -1; | |
3131 | return; | |
3132 | } | |
3133 | } | |
3134 | ||
3135 | if (display_update_msgs) { | |
c5a6f655 EN |
3136 | struct merge_options_internal *opti = result->priv; |
3137 | struct hashmap_iter iter; | |
3138 | struct strmap_entry *e; | |
3139 | struct string_list olist = STRING_LIST_INIT_NODUP; | |
3140 | int i; | |
3141 | ||
3142 | /* Hack to pre-allocate olist to the desired size */ | |
3143 | ALLOC_GROW(olist.items, strmap_get_size(&opti->output), | |
3144 | olist.alloc); | |
3145 | ||
3146 | /* Put every entry from output into olist, then sort */ | |
3147 | strmap_for_each_entry(&opti->output, &iter, e) { | |
3148 | string_list_append(&olist, e->key)->util = e->value; | |
3149 | } | |
3150 | string_list_sort(&olist); | |
3151 | ||
3152 | /* Iterate over the items, printing them */ | |
3153 | for (i = 0; i < olist.nr; ++i) { | |
3154 | struct strbuf *sb = olist.items[i].util; | |
3155 | ||
3156 | printf("%s", sb->buf); | |
3157 | } | |
3158 | string_list_clear(&olist, 0); | |
f39d05ca EN |
3159 | |
3160 | /* Also include needed rename limit adjustment now */ | |
3161 | diff_warn_rename_limit("merge.renamelimit", | |
3162 | opti->renames.needed_limit, 0); | |
9fefce68 EN |
3163 | } |
3164 | ||
17e5574b EN |
3165 | merge_finalize(opt, result); |
3166 | } | |
3167 | ||
3168 | void merge_finalize(struct merge_options *opt, | |
3169 | struct merge_result *result) | |
3170 | { | |
89422d29 EN |
3171 | struct merge_options_internal *opti = result->priv; |
3172 | ||
3173 | assert(opt->priv == NULL); | |
3174 | ||
43e9c4ee | 3175 | clear_or_reinit_internal_opts(opti, 0); |
89422d29 | 3176 | FREE_AND_NULL(opti); |
17e5574b EN |
3177 | } |
3178 | ||
04af1879 EN |
3179 | /*** Function Grouping: helper functions for merge_incore_*() ***/ |
3180 | ||
4296d8f1 EN |
3181 | static inline void set_commit_tree(struct commit *c, struct tree *t) |
3182 | { | |
3183 | c->maybe_tree = t; | |
3184 | } | |
3185 | ||
4296d8f1 EN |
3186 | static struct commit *make_virtual_commit(struct repository *repo, |
3187 | struct tree *tree, | |
3188 | const char *comment) | |
3189 | { | |
3190 | struct commit *commit = alloc_commit_node(repo); | |
3191 | ||
3192 | set_merge_remote_desc(commit, comment, (struct object *)commit); | |
3193 | set_commit_tree(commit, tree); | |
3194 | commit->object.parsed = 1; | |
3195 | return commit; | |
3196 | } | |
3197 | ||
231e2dd4 EN |
3198 | static void merge_start(struct merge_options *opt, struct merge_result *result) |
3199 | { | |
f5d9fbc2 EN |
3200 | struct rename_info *renames; |
3201 | int i; | |
3202 | ||
e4171b1b EN |
3203 | /* Sanity checks on opt */ |
3204 | assert(opt->repo); | |
3205 | ||
3206 | assert(opt->branch1 && opt->branch2); | |
3207 | ||
3208 | assert(opt->detect_directory_renames >= MERGE_DIRECTORY_RENAMES_NONE && | |
3209 | opt->detect_directory_renames <= MERGE_DIRECTORY_RENAMES_TRUE); | |
3210 | assert(opt->rename_limit >= -1); | |
3211 | assert(opt->rename_score >= 0 && opt->rename_score <= MAX_SCORE); | |
3212 | assert(opt->show_rename_progress >= 0 && opt->show_rename_progress <= 1); | |
3213 | ||
3214 | assert(opt->xdl_opts >= 0); | |
3215 | assert(opt->recursive_variant >= MERGE_VARIANT_NORMAL && | |
3216 | opt->recursive_variant <= MERGE_VARIANT_THEIRS); | |
3217 | ||
3218 | /* | |
3219 | * detect_renames, verbosity, buffer_output, and obuf are ignored | |
3220 | * fields that were used by "recursive" rather than "ort" -- but | |
3221 | * sanity check them anyway. | |
3222 | */ | |
3223 | assert(opt->detect_renames >= -1 && | |
3224 | opt->detect_renames <= DIFF_DETECT_COPY); | |
3225 | assert(opt->verbosity >= 0 && opt->verbosity <= 5); | |
3226 | assert(opt->buffer_output <= 2); | |
3227 | assert(opt->obuf.len == 0); | |
3228 | ||
3229 | assert(opt->priv == NULL); | |
3230 | ||
c8017176 EN |
3231 | /* Default to histogram diff. Actually, just hardcode it...for now. */ |
3232 | opt->xdl_opts = DIFF_WITH_ALG(opt, HISTOGRAM_DIFF); | |
3233 | ||
e4171b1b EN |
3234 | /* Initialization of opt->priv, our internal merge data */ |
3235 | opt->priv = xcalloc(1, sizeof(*opt->priv)); | |
3236 | ||
f5d9fbc2 EN |
3237 | /* Initialization of various renames fields */ |
3238 | renames = &opt->priv->renames; | |
3239 | for (i = MERGE_SIDE1; i <= MERGE_SIDE2; i++) { | |
3240 | strset_init_with_options(&renames->dirs_removed[i], | |
3241 | NULL, 0); | |
3242 | strmap_init_with_options(&renames->dir_rename_count[i], | |
3243 | NULL, 1); | |
3244 | strmap_init_with_options(&renames->dir_renames[i], | |
3245 | NULL, 0); | |
3246 | } | |
3247 | ||
e4171b1b EN |
3248 | /* |
3249 | * Although we initialize opt->priv->paths with strdup_strings=0, | |
3250 | * that's just to avoid making yet another copy of an allocated | |
3251 | * string. Putting the entry into paths means we are taking | |
43c1dccb | 3252 | * ownership, so we will later free it. paths_to_free is similar. |
e4171b1b EN |
3253 | * |
3254 | * In contrast, conflicted just has a subset of keys from paths, so | |
3255 | * we don't want to free those (it'd be a duplicate free). | |
3256 | */ | |
3257 | strmap_init_with_options(&opt->priv->paths, NULL, 0); | |
3258 | strmap_init_with_options(&opt->priv->conflicted, NULL, 0); | |
43c1dccb | 3259 | string_list_init(&opt->priv->paths_to_free, 0); |
c5a6f655 EN |
3260 | |
3261 | /* | |
3262 | * keys & strbufs in output will sometimes need to outlive "paths", | |
3263 | * so it will have a copy of relevant keys. It's probably a small | |
3264 | * subset of the overall paths that have special output. | |
3265 | */ | |
3266 | strmap_init(&opt->priv->output); | |
231e2dd4 EN |
3267 | } |
3268 | ||
04af1879 EN |
3269 | /*** Function Grouping: merge_incore_*() and their internal variants ***/ |
3270 | ||
231e2dd4 EN |
3271 | /* |
3272 | * Originally from merge_trees_internal(); heavily adapted, though. | |
3273 | */ | |
3274 | static void merge_ort_nonrecursive_internal(struct merge_options *opt, | |
3275 | struct tree *merge_base, | |
3276 | struct tree *side1, | |
3277 | struct tree *side2, | |
3278 | struct merge_result *result) | |
3279 | { | |
3280 | struct object_id working_tree_oid; | |
3281 | ||
0c0d705b EN |
3282 | if (collect_merge_info(opt, merge_base, side1, side2) != 0) { |
3283 | /* | |
3284 | * TRANSLATORS: The %s arguments are: 1) tree hash of a merge | |
3285 | * base, and 2-3) the trees for the two trees we're merging. | |
3286 | */ | |
3287 | err(opt, _("collecting merge info failed for trees %s, %s, %s"), | |
3288 | oid_to_hex(&merge_base->object.oid), | |
3289 | oid_to_hex(&side1->object.oid), | |
3290 | oid_to_hex(&side2->object.oid)); | |
3291 | result->clean = -1; | |
3292 | return; | |
3293 | } | |
3294 | ||
231e2dd4 EN |
3295 | result->clean = detect_and_process_renames(opt, merge_base, |
3296 | side1, side2); | |
3297 | process_entries(opt, &working_tree_oid); | |
3298 | ||
3299 | /* Set return values */ | |
3300 | result->tree = parse_tree_indirect(&working_tree_oid); | |
3301 | /* existence of conflicted entries implies unclean */ | |
3302 | result->clean &= strmap_empty(&opt->priv->conflicted); | |
3303 | if (!opt->priv->call_depth) { | |
3304 | result->priv = opt->priv; | |
3305 | opt->priv = NULL; | |
3306 | } | |
3307 | } | |
3308 | ||
8119214f EN |
3309 | /* |
3310 | * Originally from merge_recursive_internal(); somewhat adapted, though. | |
3311 | */ | |
3312 | static void merge_ort_internal(struct merge_options *opt, | |
3313 | struct commit_list *merge_bases, | |
3314 | struct commit *h1, | |
3315 | struct commit *h2, | |
3316 | struct merge_result *result) | |
3317 | { | |
3318 | struct commit_list *iter; | |
3319 | struct commit *merged_merge_bases; | |
3320 | const char *ancestor_name; | |
3321 | struct strbuf merge_base_abbrev = STRBUF_INIT; | |
3322 | ||
3323 | if (!merge_bases) { | |
3324 | merge_bases = get_merge_bases(h1, h2); | |
3325 | /* See merge-ort.h:merge_incore_recursive() declaration NOTE */ | |
3326 | merge_bases = reverse_commit_list(merge_bases); | |
3327 | } | |
3328 | ||
3329 | merged_merge_bases = pop_commit(&merge_bases); | |
3330 | if (merged_merge_bases == NULL) { | |
3331 | /* if there is no common ancestor, use an empty tree */ | |
3332 | struct tree *tree; | |
3333 | ||
3334 | tree = lookup_tree(opt->repo, opt->repo->hash_algo->empty_tree); | |
3335 | merged_merge_bases = make_virtual_commit(opt->repo, tree, | |
3336 | "ancestor"); | |
3337 | ancestor_name = "empty tree"; | |
3338 | } else if (merge_bases) { | |
3339 | ancestor_name = "merged common ancestors"; | |
3340 | } else { | |
3341 | strbuf_add_unique_abbrev(&merge_base_abbrev, | |
3342 | &merged_merge_bases->object.oid, | |
3343 | DEFAULT_ABBREV); | |
3344 | ancestor_name = merge_base_abbrev.buf; | |
3345 | } | |
3346 | ||
3347 | for (iter = merge_bases; iter; iter = iter->next) { | |
3348 | const char *saved_b1, *saved_b2; | |
3349 | struct commit *prev = merged_merge_bases; | |
3350 | ||
3351 | opt->priv->call_depth++; | |
3352 | /* | |
3353 | * When the merge fails, the result contains files | |
3354 | * with conflict markers. The cleanness flag is | |
3355 | * ignored (unless indicating an error), it was never | |
3356 | * actually used, as result of merge_trees has always | |
3357 | * overwritten it: the committed "conflicts" were | |
3358 | * already resolved. | |
3359 | */ | |
3360 | saved_b1 = opt->branch1; | |
3361 | saved_b2 = opt->branch2; | |
3362 | opt->branch1 = "Temporary merge branch 1"; | |
3363 | opt->branch2 = "Temporary merge branch 2"; | |
3364 | merge_ort_internal(opt, NULL, prev, iter->item, result); | |
3365 | if (result->clean < 0) | |
3366 | return; | |
3367 | opt->branch1 = saved_b1; | |
3368 | opt->branch2 = saved_b2; | |
3369 | opt->priv->call_depth--; | |
3370 | ||
3371 | merged_merge_bases = make_virtual_commit(opt->repo, | |
3372 | result->tree, | |
3373 | "merged tree"); | |
3374 | commit_list_insert(prev, &merged_merge_bases->parents); | |
3375 | commit_list_insert(iter->item, | |
3376 | &merged_merge_bases->parents->next); | |
3377 | ||
3378 | clear_or_reinit_internal_opts(opt->priv, 1); | |
3379 | } | |
3380 | ||
3381 | opt->ancestor = ancestor_name; | |
3382 | merge_ort_nonrecursive_internal(opt, | |
3383 | repo_get_commit_tree(opt->repo, | |
3384 | merged_merge_bases), | |
3385 | repo_get_commit_tree(opt->repo, h1), | |
3386 | repo_get_commit_tree(opt->repo, h2), | |
3387 | result); | |
3388 | strbuf_release(&merge_base_abbrev); | |
3389 | opt->ancestor = NULL; /* avoid accidental re-use of opt->ancestor */ | |
3390 | } | |
3391 | ||
17e5574b EN |
3392 | void merge_incore_nonrecursive(struct merge_options *opt, |
3393 | struct tree *merge_base, | |
3394 | struct tree *side1, | |
3395 | struct tree *side2, | |
3396 | struct merge_result *result) | |
3397 | { | |
231e2dd4 EN |
3398 | assert(opt->ancestor != NULL); |
3399 | merge_start(opt, result); | |
3400 | merge_ort_nonrecursive_internal(opt, merge_base, side1, side2, result); | |
17e5574b EN |
3401 | } |
3402 | ||
3403 | void merge_incore_recursive(struct merge_options *opt, | |
3404 | struct commit_list *merge_bases, | |
3405 | struct commit *side1, | |
3406 | struct commit *side2, | |
3407 | struct merge_result *result) | |
3408 | { | |
8119214f EN |
3409 | /* We set the ancestor label based on the merge_bases */ |
3410 | assert(opt->ancestor == NULL); | |
3411 | ||
3412 | merge_start(opt, result); | |
3413 | merge_ort_internal(opt, merge_bases, side1, side2, result); | |
17e5574b | 3414 | } |