]>
Commit | Line | Data |
---|---|---|
9047ebbc MV |
1 | /* |
2 | * Recursive Merge algorithm stolen from git-merge-recursive.py by | |
3 | * Fredrik Kuivinen. | |
4 | * The thieves were Alex Riesen and Johannes Schindelin, in June/July 2006 | |
5 | */ | |
6 | #include "cache.h" | |
1c4b6604 | 7 | #include "advice.h" |
697cc8ef | 8 | #include "lockfile.h" |
9047ebbc MV |
9 | #include "cache-tree.h" |
10 | #include "commit.h" | |
11 | #include "blob.h" | |
12 | #include "builtin.h" | |
13 | #include "tree-walk.h" | |
14 | #include "diff.h" | |
15 | #include "diffcore.h" | |
16 | #include "tag.h" | |
17 | #include "unpack-trees.h" | |
18 | #include "string-list.h" | |
19 | #include "xdiff-interface.h" | |
20 | #include "ll-merge.h" | |
9047ebbc MV |
21 | #include "attr.h" |
22 | #include "merge-recursive.h" | |
9800c0df | 23 | #include "dir.h" |
68d03e4a | 24 | #include "submodule.h" |
9047ebbc | 25 | |
85e51b78 JH |
26 | static struct tree *shift_tree_object(struct tree *one, struct tree *two, |
27 | const char *subtree_shift) | |
9047ebbc | 28 | { |
f2fd0760 | 29 | struct object_id shifted; |
9047ebbc | 30 | |
85e51b78 | 31 | if (!*subtree_shift) { |
ed1c9977 | 32 | shift_tree(one->object.oid.hash, two->object.oid.hash, shifted.hash, 0); |
85e51b78 | 33 | } else { |
ed1c9977 | 34 | shift_tree_by(one->object.oid.hash, two->object.oid.hash, shifted.hash, |
85e51b78 JH |
35 | subtree_shift); |
36 | } | |
f2fd0760 | 37 | if (!oidcmp(&two->object.oid, &shifted)) |
9047ebbc | 38 | return two; |
f2fd0760 | 39 | return lookup_tree(shifted.hash); |
9047ebbc MV |
40 | } |
41 | ||
2af202be | 42 | static struct commit *make_virtual_commit(struct tree *tree, const char *comment) |
9047ebbc | 43 | { |
10322a0a | 44 | struct commit *commit = alloc_commit_node(); |
ae8e4c9c JH |
45 | struct merge_remote_desc *desc = xmalloc(sizeof(*desc)); |
46 | ||
47 | desc->name = comment; | |
48 | desc->obj = (struct object *)commit; | |
9047ebbc | 49 | commit->tree = tree; |
ae8e4c9c | 50 | commit->util = desc; |
9047ebbc MV |
51 | commit->object.parsed = 1; |
52 | return commit; | |
53 | } | |
54 | ||
55 | /* | |
56 | * Since we use get_tree_entry(), which does not put the read object into | |
57 | * the object pool, we cannot rely on a == b. | |
58 | */ | |
59 | static int sha_eq(const unsigned char *a, const unsigned char *b) | |
60 | { | |
61 | if (!a && !b) | |
62 | return 2; | |
63 | return a && b && hashcmp(a, b) == 0; | |
64 | } | |
65 | ||
25c39363 EN |
66 | enum rename_type { |
67 | RENAME_NORMAL = 0, | |
68 | RENAME_DELETE, | |
4f66dade | 69 | RENAME_ONE_FILE_TO_ONE, |
461f5041 EN |
70 | RENAME_ONE_FILE_TO_TWO, |
71 | RENAME_TWO_FILES_TO_ONE | |
25c39363 EN |
72 | }; |
73 | ||
4f66dade | 74 | struct rename_conflict_info { |
25c39363 EN |
75 | enum rename_type rename_type; |
76 | struct diff_filepair *pair1; | |
77 | struct diff_filepair *pair2; | |
78 | const char *branch1; | |
79 | const char *branch2; | |
80 | struct stage_data *dst_entry1; | |
81 | struct stage_data *dst_entry2; | |
232c635f EN |
82 | struct diff_filespec ren1_other; |
83 | struct diff_filespec ren2_other; | |
25c39363 EN |
84 | }; |
85 | ||
9047ebbc MV |
86 | /* |
87 | * Since we want to write the index eventually, we cannot reuse the index | |
88 | * for these (temporary) data. | |
89 | */ | |
9cba13ca JN |
90 | struct stage_data { |
91 | struct { | |
9047ebbc MV |
92 | unsigned mode; |
93 | unsigned char sha[20]; | |
94 | } stages[4]; | |
4f66dade | 95 | struct rename_conflict_info *rename_conflict_info; |
9047ebbc MV |
96 | unsigned processed:1; |
97 | }; | |
98 | ||
4f66dade EN |
99 | static inline void setup_rename_conflict_info(enum rename_type rename_type, |
100 | struct diff_filepair *pair1, | |
101 | struct diff_filepair *pair2, | |
102 | const char *branch1, | |
103 | const char *branch2, | |
104 | struct stage_data *dst_entry1, | |
232c635f EN |
105 | struct stage_data *dst_entry2, |
106 | struct merge_options *o, | |
107 | struct stage_data *src_entry1, | |
108 | struct stage_data *src_entry2) | |
25c39363 | 109 | { |
4f66dade | 110 | struct rename_conflict_info *ci = xcalloc(1, sizeof(struct rename_conflict_info)); |
25c39363 EN |
111 | ci->rename_type = rename_type; |
112 | ci->pair1 = pair1; | |
113 | ci->branch1 = branch1; | |
114 | ci->branch2 = branch2; | |
115 | ||
116 | ci->dst_entry1 = dst_entry1; | |
4f66dade | 117 | dst_entry1->rename_conflict_info = ci; |
25c39363 EN |
118 | dst_entry1->processed = 0; |
119 | ||
120 | assert(!pair2 == !dst_entry2); | |
121 | if (dst_entry2) { | |
122 | ci->dst_entry2 = dst_entry2; | |
123 | ci->pair2 = pair2; | |
4f66dade | 124 | dst_entry2->rename_conflict_info = ci; |
25c39363 | 125 | } |
232c635f EN |
126 | |
127 | if (rename_type == RENAME_TWO_FILES_TO_ONE) { | |
128 | /* | |
129 | * For each rename, there could have been | |
130 | * modifications on the side of history where that | |
131 | * file was not renamed. | |
132 | */ | |
133 | int ostage1 = o->branch1 == branch1 ? 3 : 2; | |
134 | int ostage2 = ostage1 ^ 1; | |
135 | ||
136 | ci->ren1_other.path = pair1->one->path; | |
137 | hashcpy(ci->ren1_other.sha1, src_entry1->stages[ostage1].sha); | |
138 | ci->ren1_other.mode = src_entry1->stages[ostage1].mode; | |
139 | ||
140 | ci->ren2_other.path = pair2->one->path; | |
141 | hashcpy(ci->ren2_other.sha1, src_entry2->stages[ostage2].sha); | |
142 | ci->ren2_other.mode = src_entry2->stages[ostage2].mode; | |
25c39363 EN |
143 | } |
144 | } | |
145 | ||
8a2fce18 | 146 | static int show(struct merge_options *o, int v) |
9047ebbc | 147 | { |
5033639c | 148 | return (!o->call_depth && o->verbosity >= v) || o->verbosity >= 5; |
9047ebbc MV |
149 | } |
150 | ||
c7d84924 | 151 | static void flush_output(struct merge_options *o) |
9047ebbc | 152 | { |
c7d84924 MV |
153 | if (o->obuf.len) { |
154 | fputs(o->obuf.buf, stdout); | |
155 | strbuf_reset(&o->obuf); | |
9047ebbc MV |
156 | } |
157 | } | |
158 | ||
28bea9e5 | 159 | __attribute__((format (printf, 3, 4))) |
8a2fce18 | 160 | static void output(struct merge_options *o, int v, const char *fmt, ...) |
9047ebbc | 161 | { |
9047ebbc MV |
162 | va_list ap; |
163 | ||
8a2fce18 | 164 | if (!show(o, v)) |
9047ebbc MV |
165 | return; |
166 | ||
415792ed | 167 | strbuf_addchars(&o->obuf, ' ', o->call_depth * 2); |
9047ebbc MV |
168 | |
169 | va_start(ap, fmt); | |
ebeb6090 | 170 | strbuf_vaddf(&o->obuf, fmt, ap); |
9047ebbc MV |
171 | va_end(ap); |
172 | ||
294b2680 | 173 | strbuf_addch(&o->obuf, '\n'); |
8a2fce18 | 174 | if (!o->buffer_output) |
c7d84924 | 175 | flush_output(o); |
9047ebbc MV |
176 | } |
177 | ||
5033639c | 178 | static void output_commit_title(struct merge_options *o, struct commit *commit) |
9047ebbc MV |
179 | { |
180 | int i; | |
c7d84924 | 181 | flush_output(o); |
5033639c | 182 | for (i = o->call_depth; i--;) |
9047ebbc MV |
183 | fputs(" ", stdout); |
184 | if (commit->util) | |
ae8e4c9c | 185 | printf("virtual %s\n", merge_remote_util(commit)->name); |
9047ebbc | 186 | else { |
ed1c9977 | 187 | printf("%s ", find_unique_abbrev(commit->object.oid.hash, DEFAULT_ABBREV)); |
9047ebbc | 188 | if (parse_commit(commit) != 0) |
55653a68 | 189 | printf(_("(bad commit)\n")); |
9047ebbc | 190 | else { |
49b7120e | 191 | const char *title; |
8597ea3a | 192 | const char *msg = get_commit_buffer(commit, NULL); |
bc6b8fc1 | 193 | int len = find_commit_subject(msg, &title); |
49b7120e CC |
194 | if (len) |
195 | printf("%.*s\n", len, title); | |
bc6b8fc1 | 196 | unuse_commit_buffer(commit, msg); |
9047ebbc MV |
197 | } |
198 | } | |
199 | } | |
200 | ||
201 | static int add_cacheinfo(unsigned int mode, const unsigned char *sha1, | |
202 | const char *path, int stage, int refresh, int options) | |
203 | { | |
204 | struct cache_entry *ce; | |
25762726 | 205 | ce = make_cache_entry(mode, sha1 ? sha1 : null_sha1, path, stage, |
6e2068ae BK |
206 | (refresh ? (CE_MATCH_REFRESH | |
207 | CE_MATCH_IGNORE_MISSING) : 0 )); | |
9047ebbc | 208 | if (!ce) |
55653a68 | 209 | return error(_("addinfo_cache failed for path '%s'"), path); |
9047ebbc MV |
210 | return add_cache_entry(ce, options); |
211 | } | |
212 | ||
9047ebbc MV |
213 | static void init_tree_desc_from_tree(struct tree_desc *desc, struct tree *tree) |
214 | { | |
215 | parse_tree(tree); | |
216 | init_tree_desc(desc, tree->buffer, tree->size); | |
217 | } | |
218 | ||
219 | static int git_merge_trees(int index_only, | |
220 | struct tree *common, | |
221 | struct tree *head, | |
222 | struct tree *merge) | |
223 | { | |
224 | int rc; | |
225 | struct tree_desc t[3]; | |
226 | struct unpack_trees_options opts; | |
227 | ||
228 | memset(&opts, 0, sizeof(opts)); | |
229 | if (index_only) | |
230 | opts.index_only = 1; | |
231 | else | |
232 | opts.update = 1; | |
233 | opts.merge = 1; | |
234 | opts.head_idx = 2; | |
235 | opts.fn = threeway_merge; | |
236 | opts.src_index = &the_index; | |
237 | opts.dst_index = &the_index; | |
e294030f | 238 | setup_unpack_trees_porcelain(&opts, "merge"); |
9047ebbc MV |
239 | |
240 | init_tree_desc_from_tree(t+0, common); | |
241 | init_tree_desc_from_tree(t+1, head); | |
242 | init_tree_desc_from_tree(t+2, merge); | |
243 | ||
244 | rc = unpack_trees(3, t, &opts); | |
245 | cache_tree_free(&active_cache_tree); | |
246 | return rc; | |
247 | } | |
248 | ||
8a2fce18 | 249 | struct tree *write_tree_from_memory(struct merge_options *o) |
9047ebbc MV |
250 | { |
251 | struct tree *result = NULL; | |
252 | ||
253 | if (unmerged_cache()) { | |
254 | int i; | |
19c6a4f8 | 255 | fprintf(stderr, "BUG: There are unmerged index entries:\n"); |
9047ebbc | 256 | for (i = 0; i < active_nr; i++) { |
9c5e6c80 | 257 | const struct cache_entry *ce = active_cache[i]; |
9047ebbc | 258 | if (ce_stage(ce)) |
c43ba42e | 259 | fprintf(stderr, "BUG: %d %.*s\n", ce_stage(ce), |
19c6a4f8 | 260 | (int)ce_namelen(ce), ce->name); |
9047ebbc | 261 | } |
19c6a4f8 | 262 | die("Bug in merge-recursive.c"); |
9047ebbc MV |
263 | } |
264 | ||
265 | if (!active_cache_tree) | |
266 | active_cache_tree = cache_tree(); | |
267 | ||
268 | if (!cache_tree_fully_valid(active_cache_tree) && | |
d0cfc3e8 | 269 | cache_tree_update(&the_index, 0) < 0) |
55653a68 | 270 | die(_("error building trees")); |
9047ebbc MV |
271 | |
272 | result = lookup_tree(active_cache_tree->sha1); | |
273 | ||
274 | return result; | |
275 | } | |
276 | ||
277 | static int save_files_dirs(const unsigned char *sha1, | |
6a0b0b6d | 278 | struct strbuf *base, const char *path, |
9047ebbc MV |
279 | unsigned int mode, int stage, void *context) |
280 | { | |
6a0b0b6d | 281 | int baselen = base->len; |
696ee23c MV |
282 | struct merge_options *o = context; |
283 | ||
6a0b0b6d | 284 | strbuf_addstr(base, path); |
9047ebbc MV |
285 | |
286 | if (S_ISDIR(mode)) | |
6a0b0b6d | 287 | string_list_insert(&o->current_directory_set, base->buf); |
9047ebbc | 288 | else |
6a0b0b6d | 289 | string_list_insert(&o->current_file_set, base->buf); |
9047ebbc | 290 | |
6a0b0b6d | 291 | strbuf_setlen(base, baselen); |
d3bee161 | 292 | return (S_ISDIR(mode) ? READ_TREE_RECURSIVE : 0); |
9047ebbc MV |
293 | } |
294 | ||
696ee23c | 295 | static int get_files_dirs(struct merge_options *o, struct tree *tree) |
9047ebbc MV |
296 | { |
297 | int n; | |
f0096c06 | 298 | struct pathspec match_all; |
9a087274 | 299 | memset(&match_all, 0, sizeof(match_all)); |
f0096c06 | 300 | if (read_tree_recursive(tree, "", 0, 0, &match_all, save_files_dirs, o)) |
9047ebbc | 301 | return 0; |
696ee23c | 302 | n = o->current_file_set.nr + o->current_directory_set.nr; |
9047ebbc MV |
303 | return n; |
304 | } | |
305 | ||
306 | /* | |
307 | * Returns an index_entry instance which doesn't have to correspond to | |
308 | * a real cache entry in Git's index. | |
309 | */ | |
310 | static struct stage_data *insert_stage_data(const char *path, | |
311 | struct tree *o, struct tree *a, struct tree *b, | |
312 | struct string_list *entries) | |
313 | { | |
314 | struct string_list_item *item; | |
315 | struct stage_data *e = xcalloc(1, sizeof(struct stage_data)); | |
ed1c9977 | 316 | get_tree_entry(o->object.oid.hash, path, |
9047ebbc | 317 | e->stages[1].sha, &e->stages[1].mode); |
ed1c9977 | 318 | get_tree_entry(a->object.oid.hash, path, |
9047ebbc | 319 | e->stages[2].sha, &e->stages[2].mode); |
ed1c9977 | 320 | get_tree_entry(b->object.oid.hash, path, |
9047ebbc | 321 | e->stages[3].sha, &e->stages[3].mode); |
78a395d3 | 322 | item = string_list_insert(entries, path); |
9047ebbc MV |
323 | item->util = e; |
324 | return e; | |
325 | } | |
326 | ||
327 | /* | |
328 | * Create a dictionary mapping file names to stage_data objects. The | |
329 | * dictionary contains one entry for every path with a non-zero stage entry. | |
330 | */ | |
331 | static struct string_list *get_unmerged(void) | |
332 | { | |
333 | struct string_list *unmerged = xcalloc(1, sizeof(struct string_list)); | |
334 | int i; | |
335 | ||
336 | unmerged->strdup_strings = 1; | |
337 | ||
338 | for (i = 0; i < active_nr; i++) { | |
339 | struct string_list_item *item; | |
340 | struct stage_data *e; | |
9c5e6c80 | 341 | const struct cache_entry *ce = active_cache[i]; |
9047ebbc MV |
342 | if (!ce_stage(ce)) |
343 | continue; | |
344 | ||
e8c8b713 | 345 | item = string_list_lookup(unmerged, ce->name); |
9047ebbc | 346 | if (!item) { |
78a395d3 | 347 | item = string_list_insert(unmerged, ce->name); |
9047ebbc MV |
348 | item->util = xcalloc(1, sizeof(struct stage_data)); |
349 | } | |
350 | e = item->util; | |
351 | e->stages[ce_stage(ce)].mode = ce->ce_mode; | |
352 | hashcpy(e->stages[ce_stage(ce)].sha, ce->sha1); | |
353 | } | |
354 | ||
355 | return unmerged; | |
356 | } | |
357 | ||
f0fd4d05 | 358 | static int string_list_df_name_compare(const void *a, const void *b) |
ef02b317 | 359 | { |
f0fd4d05 EN |
360 | const struct string_list_item *one = a; |
361 | const struct string_list_item *two = b; | |
362 | int onelen = strlen(one->string); | |
363 | int twolen = strlen(two->string); | |
364 | /* | |
365 | * Here we only care that entries for D/F conflicts are | |
366 | * adjacent, in particular with the file of the D/F conflict | |
367 | * appearing before files below the corresponding directory. | |
368 | * The order of the rest of the list is irrelevant for us. | |
ef02b317 | 369 | * |
f0fd4d05 EN |
370 | * To achieve this, we sort with df_name_compare and provide |
371 | * the mode S_IFDIR so that D/F conflicts will sort correctly. | |
372 | * We use the mode S_IFDIR for everything else for simplicity, | |
373 | * since in other cases any changes in their order due to | |
374 | * sorting cause no problems for us. | |
375 | */ | |
376 | int cmp = df_name_compare(one->string, onelen, S_IFDIR, | |
377 | two->string, twolen, S_IFDIR); | |
378 | /* | |
379 | * Now that 'foo' and 'foo/bar' compare equal, we have to make sure | |
380 | * that 'foo' comes before 'foo/bar'. | |
ef02b317 | 381 | */ |
f0fd4d05 EN |
382 | if (cmp) |
383 | return cmp; | |
384 | return onelen - twolen; | |
385 | } | |
386 | ||
70cc3d36 EN |
387 | static void record_df_conflict_files(struct merge_options *o, |
388 | struct string_list *entries) | |
ef02b317 | 389 | { |
70cc3d36 | 390 | /* If there is a D/F conflict and the file for such a conflict |
f7d650c0 | 391 | * currently exist in the working tree, we want to allow it to be |
edd2faf5 EN |
392 | * removed to make room for the corresponding directory if needed. |
393 | * The files underneath the directories of such D/F conflicts will | |
394 | * be processed before the corresponding file involved in the D/F | |
395 | * conflict. If the D/F directory ends up being removed by the | |
396 | * merge, then we won't have to touch the D/F file. If the D/F | |
397 | * directory needs to be written to the working copy, then the D/F | |
398 | * file will simply be removed (in make_room_for_path()) to make | |
399 | * room for the necessary paths. Note that if both the directory | |
400 | * and the file need to be present, then the D/F file will be | |
401 | * reinstated with a new unique name at the time it is processed. | |
ef02b317 | 402 | */ |
f701aae0 | 403 | struct string_list df_sorted_entries; |
ef02b317 | 404 | const char *last_file = NULL; |
c8516500 | 405 | int last_len = 0; |
ef02b317 EN |
406 | int i; |
407 | ||
0b30e812 EN |
408 | /* |
409 | * If we're merging merge-bases, we don't want to bother with | |
410 | * any working directory changes. | |
411 | */ | |
412 | if (o->call_depth) | |
413 | return; | |
414 | ||
f0fd4d05 | 415 | /* Ensure D/F conflicts are adjacent in the entries list. */ |
f701aae0 | 416 | memset(&df_sorted_entries, 0, sizeof(struct string_list)); |
ef02b317 | 417 | for (i = 0; i < entries->nr; i++) { |
f701aae0 EN |
418 | struct string_list_item *next = &entries->items[i]; |
419 | string_list_append(&df_sorted_entries, next->string)->util = | |
420 | next->util; | |
421 | } | |
422 | qsort(df_sorted_entries.items, entries->nr, sizeof(*entries->items), | |
f0fd4d05 EN |
423 | string_list_df_name_compare); |
424 | ||
70cc3d36 | 425 | string_list_clear(&o->df_conflict_file_set, 1); |
f701aae0 EN |
426 | for (i = 0; i < df_sorted_entries.nr; i++) { |
427 | const char *path = df_sorted_entries.items[i].string; | |
ef02b317 | 428 | int len = strlen(path); |
f701aae0 | 429 | struct stage_data *e = df_sorted_entries.items[i].util; |
ef02b317 EN |
430 | |
431 | /* | |
432 | * Check if last_file & path correspond to a D/F conflict; | |
433 | * i.e. whether path is last_file+'/'+<something>. | |
70cc3d36 EN |
434 | * If so, record that it's okay to remove last_file to make |
435 | * room for path and friends if needed. | |
ef02b317 EN |
436 | */ |
437 | if (last_file && | |
438 | len > last_len && | |
439 | memcmp(path, last_file, last_len) == 0 && | |
440 | path[last_len] == '/') { | |
70cc3d36 | 441 | string_list_insert(&o->df_conflict_file_set, last_file); |
ef02b317 EN |
442 | } |
443 | ||
444 | /* | |
445 | * Determine whether path could exist as a file in the | |
446 | * working directory as a possible D/F conflict. This | |
447 | * will only occur when it exists in stage 2 as a | |
448 | * file. | |
449 | */ | |
450 | if (S_ISREG(e->stages[2].mode) || S_ISLNK(e->stages[2].mode)) { | |
451 | last_file = path; | |
452 | last_len = len; | |
ef02b317 EN |
453 | } else { |
454 | last_file = NULL; | |
455 | } | |
456 | } | |
f701aae0 | 457 | string_list_clear(&df_sorted_entries, 0); |
ef02b317 EN |
458 | } |
459 | ||
9cba13ca | 460 | struct rename { |
9047ebbc MV |
461 | struct diff_filepair *pair; |
462 | struct stage_data *src_entry; | |
463 | struct stage_data *dst_entry; | |
464 | unsigned processed:1; | |
465 | }; | |
466 | ||
467 | /* | |
468 | * Get information of all renames which occurred between 'o_tree' and | |
469 | * 'tree'. We need the three trees in the merge ('o_tree', 'a_tree' and | |
470 | * 'b_tree') to be able to associate the correct cache entries with | |
471 | * the rename information. 'tree' is always equal to either a_tree or b_tree. | |
472 | */ | |
8a2fce18 MV |
473 | static struct string_list *get_renames(struct merge_options *o, |
474 | struct tree *tree, | |
475 | struct tree *o_tree, | |
476 | struct tree *a_tree, | |
477 | struct tree *b_tree, | |
478 | struct string_list *entries) | |
9047ebbc MV |
479 | { |
480 | int i; | |
481 | struct string_list *renames; | |
482 | struct diff_options opts; | |
483 | ||
484 | renames = xcalloc(1, sizeof(struct string_list)); | |
d2b11eca FGA |
485 | if (!o->detect_rename) |
486 | return renames; | |
487 | ||
9047ebbc MV |
488 | diff_setup(&opts); |
489 | DIFF_OPT_SET(&opts, RECURSIVE); | |
4f7cb99a | 490 | DIFF_OPT_CLR(&opts, RENAME_EMPTY); |
9047ebbc | 491 | opts.detect_rename = DIFF_DETECT_RENAME; |
8a2fce18 MV |
492 | opts.rename_limit = o->merge_rename_limit >= 0 ? o->merge_rename_limit : |
493 | o->diff_rename_limit >= 0 ? o->diff_rename_limit : | |
92c57e5c | 494 | 1000; |
10ae7526 | 495 | opts.rename_score = o->rename_score; |
99bfc669 | 496 | opts.show_rename_progress = o->show_rename_progress; |
9047ebbc | 497 | opts.output_format = DIFF_FORMAT_NO_OUTPUT; |
28452655 | 498 | diff_setup_done(&opts); |
ed1c9977 | 499 | diff_tree_sha1(o_tree->object.oid.hash, tree->object.oid.hash, "", &opts); |
9047ebbc | 500 | diffcore_std(&opts); |
bf0ab10f JK |
501 | if (opts.needed_rename_limit > o->needed_rename_limit) |
502 | o->needed_rename_limit = opts.needed_rename_limit; | |
9047ebbc MV |
503 | for (i = 0; i < diff_queued_diff.nr; ++i) { |
504 | struct string_list_item *item; | |
505 | struct rename *re; | |
506 | struct diff_filepair *pair = diff_queued_diff.queue[i]; | |
507 | if (pair->status != 'R') { | |
508 | diff_free_filepair(pair); | |
509 | continue; | |
510 | } | |
511 | re = xmalloc(sizeof(*re)); | |
512 | re->processed = 0; | |
513 | re->pair = pair; | |
e8c8b713 | 514 | item = string_list_lookup(entries, re->pair->one->path); |
9047ebbc MV |
515 | if (!item) |
516 | re->src_entry = insert_stage_data(re->pair->one->path, | |
517 | o_tree, a_tree, b_tree, entries); | |
518 | else | |
519 | re->src_entry = item->util; | |
520 | ||
e8c8b713 | 521 | item = string_list_lookup(entries, re->pair->two->path); |
9047ebbc MV |
522 | if (!item) |
523 | re->dst_entry = insert_stage_data(re->pair->two->path, | |
524 | o_tree, a_tree, b_tree, entries); | |
525 | else | |
526 | re->dst_entry = item->util; | |
78a395d3 | 527 | item = string_list_insert(renames, pair->one->path); |
9047ebbc MV |
528 | item->util = re; |
529 | } | |
530 | opts.output_format = DIFF_FORMAT_NO_OUTPUT; | |
531 | diff_queued_diff.nr = 0; | |
532 | diff_flush(&opts); | |
533 | return renames; | |
534 | } | |
535 | ||
650467cf EN |
536 | static int update_stages(const char *path, const struct diff_filespec *o, |
537 | const struct diff_filespec *a, | |
538 | const struct diff_filespec *b) | |
9047ebbc | 539 | { |
f53d3977 EN |
540 | |
541 | /* | |
542 | * NOTE: It is usually a bad idea to call update_stages on a path | |
543 | * before calling update_file on that same path, since it can | |
544 | * sometimes lead to spurious "refusing to lose untracked file..." | |
545 | * messages from update_file (via make_room_for path via | |
546 | * would_lose_untracked). Instead, reverse the order of the calls | |
547 | * (executing update_file first and then update_stages). | |
548 | */ | |
650467cf EN |
549 | int clear = 1; |
550 | int options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_SKIP_DFCHECK; | |
9047ebbc MV |
551 | if (clear) |
552 | if (remove_file_from_cache(path)) | |
553 | return -1; | |
554 | if (o) | |
555 | if (add_cacheinfo(o->mode, o->sha1, path, 1, 0, options)) | |
556 | return -1; | |
557 | if (a) | |
558 | if (add_cacheinfo(a->mode, a->sha1, path, 2, 0, options)) | |
559 | return -1; | |
560 | if (b) | |
561 | if (add_cacheinfo(b->mode, b->sha1, path, 3, 0, options)) | |
562 | return -1; | |
563 | return 0; | |
564 | } | |
565 | ||
b8ddf164 EN |
566 | static void update_entry(struct stage_data *entry, |
567 | struct diff_filespec *o, | |
568 | struct diff_filespec *a, | |
569 | struct diff_filespec *b) | |
2ff739f9 | 570 | { |
2ff739f9 EN |
571 | entry->processed = 0; |
572 | entry->stages[1].mode = o->mode; | |
573 | entry->stages[2].mode = a->mode; | |
574 | entry->stages[3].mode = b->mode; | |
575 | hashcpy(entry->stages[1].sha, o->sha1); | |
576 | hashcpy(entry->stages[2].sha, a->sha1); | |
577 | hashcpy(entry->stages[3].sha, b->sha1); | |
2ff739f9 EN |
578 | } |
579 | ||
b7fa51da MV |
580 | static int remove_file(struct merge_options *o, int clean, |
581 | const char *path, int no_wd) | |
9047ebbc | 582 | { |
b7fa51da MV |
583 | int update_cache = o->call_depth || clean; |
584 | int update_working_directory = !o->call_depth && !no_wd; | |
9047ebbc MV |
585 | |
586 | if (update_cache) { | |
587 | if (remove_file_from_cache(path)) | |
588 | return -1; | |
589 | } | |
590 | if (update_working_directory) { | |
ae352c7f DT |
591 | if (ignore_case) { |
592 | struct cache_entry *ce; | |
593 | ce = cache_file_exists(path, strlen(path), ignore_case); | |
594 | if (ce && ce_stage(ce) == 0) | |
595 | return 0; | |
596 | } | |
25755e84 | 597 | if (remove_path(path)) |
9047ebbc | 598 | return -1; |
9047ebbc MV |
599 | } |
600 | return 0; | |
601 | } | |
602 | ||
45bc131d JK |
603 | /* add a string to a strbuf, but converting "/" to "_" */ |
604 | static void add_flattened_path(struct strbuf *out, const char *s) | |
605 | { | |
606 | size_t i = out->len; | |
607 | strbuf_addstr(out, s); | |
608 | for (; i < out->len; i++) | |
609 | if (out->buf[i] == '/') | |
610 | out->buf[i] = '_'; | |
611 | } | |
612 | ||
696ee23c | 613 | static char *unique_path(struct merge_options *o, const char *path, const char *branch) |
9047ebbc | 614 | { |
45bc131d | 615 | struct strbuf newpath = STRBUF_INIT; |
9047ebbc | 616 | int suffix = 0; |
45bc131d JK |
617 | size_t base_len; |
618 | ||
619 | strbuf_addf(&newpath, "%s~", path); | |
620 | add_flattened_path(&newpath, branch); | |
621 | ||
622 | base_len = newpath.len; | |
623 | while (string_list_has_string(&o->current_file_set, newpath.buf) || | |
624 | string_list_has_string(&o->current_directory_set, newpath.buf) || | |
dbe44faa | 625 | file_exists(newpath.buf)) { |
45bc131d JK |
626 | strbuf_setlen(&newpath, base_len); |
627 | strbuf_addf(&newpath, "_%d", suffix++); | |
628 | } | |
629 | ||
630 | string_list_insert(&o->current_file_set, newpath.buf); | |
631 | return strbuf_detach(&newpath, NULL); | |
9047ebbc MV |
632 | } |
633 | ||
f2507b4e EN |
634 | static int dir_in_way(const char *path, int check_working_copy) |
635 | { | |
b4600fbe JK |
636 | int pos; |
637 | struct strbuf dirpath = STRBUF_INIT; | |
f2507b4e EN |
638 | struct stat st; |
639 | ||
b4600fbe JK |
640 | strbuf_addstr(&dirpath, path); |
641 | strbuf_addch(&dirpath, '/'); | |
f2507b4e | 642 | |
b4600fbe | 643 | pos = cache_name_pos(dirpath.buf, dirpath.len); |
f2507b4e EN |
644 | |
645 | if (pos < 0) | |
646 | pos = -1 - pos; | |
647 | if (pos < active_nr && | |
b4600fbe JK |
648 | !strncmp(dirpath.buf, active_cache[pos]->name, dirpath.len)) { |
649 | strbuf_release(&dirpath); | |
f2507b4e EN |
650 | return 1; |
651 | } | |
652 | ||
b4600fbe | 653 | strbuf_release(&dirpath); |
f2507b4e EN |
654 | return check_working_copy && !lstat(path, &st) && S_ISDIR(st.st_mode); |
655 | } | |
656 | ||
aacb82de | 657 | static int was_tracked(const char *path) |
60c91181 JH |
658 | { |
659 | int pos = cache_name_pos(path, strlen(path)); | |
660 | ||
661 | if (pos < 0) | |
662 | pos = -1 - pos; | |
663 | while (pos < active_nr && | |
664 | !strcmp(path, active_cache[pos]->name)) { | |
665 | /* | |
666 | * If stage #0, it is definitely tracked. | |
667 | * If it has stage #2 then it was tracked | |
668 | * before this merge started. All other | |
669 | * cases the path was not tracked. | |
670 | */ | |
671 | switch (ce_stage(active_cache[pos])) { | |
672 | case 0: | |
673 | case 2: | |
aacb82de | 674 | return 1; |
60c91181 JH |
675 | } |
676 | pos++; | |
677 | } | |
aacb82de | 678 | return 0; |
60c91181 JH |
679 | } |
680 | ||
aacb82de | 681 | static int would_lose_untracked(const char *path) |
9047ebbc | 682 | { |
aacb82de | 683 | return !was_tracked(path) && file_exists(path); |
60c91181 JH |
684 | } |
685 | ||
ed0148a5 | 686 | static int make_room_for_path(struct merge_options *o, const char *path) |
9047ebbc | 687 | { |
ed0148a5 | 688 | int status, i; |
55653a68 | 689 | const char *msg = _("failed to create path '%s'%s"); |
9047ebbc | 690 | |
ed0148a5 EN |
691 | /* Unlink any D/F conflict files that are in the way */ |
692 | for (i = 0; i < o->df_conflict_file_set.nr; i++) { | |
693 | const char *df_path = o->df_conflict_file_set.items[i].string; | |
694 | size_t pathlen = strlen(path); | |
695 | size_t df_pathlen = strlen(df_path); | |
696 | if (df_pathlen < pathlen && | |
697 | path[df_pathlen] == '/' && | |
698 | strncmp(path, df_path, df_pathlen) == 0) { | |
699 | output(o, 3, | |
55653a68 | 700 | _("Removing %s to make room for subdirectory\n"), |
ed0148a5 EN |
701 | df_path); |
702 | unlink(df_path); | |
703 | unsorted_string_list_delete_item(&o->df_conflict_file_set, | |
704 | i, 0); | |
705 | break; | |
706 | } | |
707 | } | |
708 | ||
709 | /* Make sure leading directories are created */ | |
9047ebbc MV |
710 | status = safe_create_leading_directories_const(path); |
711 | if (status) { | |
0be0521b | 712 | if (status == SCLD_EXISTS) { |
9047ebbc | 713 | /* something else exists */ |
55653a68 | 714 | error(msg, path, _(": perhaps a D/F conflict?")); |
9047ebbc MV |
715 | return -1; |
716 | } | |
717 | die(msg, path, ""); | |
718 | } | |
719 | ||
60c91181 JH |
720 | /* |
721 | * Do not unlink a file in the work tree if we are not | |
722 | * tracking it. | |
723 | */ | |
724 | if (would_lose_untracked(path)) | |
55653a68 | 725 | return error(_("refusing to lose untracked file at '%s'"), |
60c91181 JH |
726 | path); |
727 | ||
9047ebbc MV |
728 | /* Successful unlink is good.. */ |
729 | if (!unlink(path)) | |
730 | return 0; | |
731 | /* .. and so is no existing file */ | |
732 | if (errno == ENOENT) | |
733 | return 0; | |
734 | /* .. but not some other error (who really cares what?) */ | |
55653a68 | 735 | return error(msg, path, _(": perhaps a D/F conflict?")); |
9047ebbc MV |
736 | } |
737 | ||
b7fa51da MV |
738 | static void update_file_flags(struct merge_options *o, |
739 | const unsigned char *sha, | |
9047ebbc MV |
740 | unsigned mode, |
741 | const char *path, | |
742 | int update_cache, | |
743 | int update_wd) | |
744 | { | |
b7fa51da | 745 | if (o->call_depth) |
9047ebbc MV |
746 | update_wd = 0; |
747 | ||
748 | if (update_wd) { | |
749 | enum object_type type; | |
750 | void *buf; | |
751 | unsigned long size; | |
752 | ||
68d03e4a | 753 | if (S_ISGITLINK(mode)) { |
0c44c943 JH |
754 | /* |
755 | * We may later decide to recursively descend into | |
756 | * the submodule directory and update its index | |
757 | * and/or work tree, but we do not do that now. | |
758 | */ | |
68d03e4a | 759 | update_wd = 0; |
0c44c943 | 760 | goto update_index; |
68d03e4a | 761 | } |
9047ebbc MV |
762 | |
763 | buf = read_sha1_file(sha, &type, &size); | |
764 | if (!buf) | |
55653a68 | 765 | die(_("cannot read object %s '%s'"), sha1_to_hex(sha), path); |
9047ebbc | 766 | if (type != OBJ_BLOB) |
55653a68 | 767 | die(_("blob expected for %s '%s'"), sha1_to_hex(sha), path); |
9047ebbc | 768 | if (S_ISREG(mode)) { |
f285a2d7 | 769 | struct strbuf strbuf = STRBUF_INIT; |
9047ebbc MV |
770 | if (convert_to_working_tree(path, buf, size, &strbuf)) { |
771 | free(buf); | |
772 | size = strbuf.len; | |
773 | buf = strbuf_detach(&strbuf, NULL); | |
774 | } | |
775 | } | |
776 | ||
ed0148a5 | 777 | if (make_room_for_path(o, path) < 0) { |
9047ebbc MV |
778 | update_wd = 0; |
779 | free(buf); | |
780 | goto update_index; | |
781 | } | |
782 | if (S_ISREG(mode) || (!has_symlinks && S_ISLNK(mode))) { | |
783 | int fd; | |
784 | if (mode & 0100) | |
785 | mode = 0777; | |
786 | else | |
787 | mode = 0666; | |
788 | fd = open(path, O_WRONLY | O_TRUNC | O_CREAT, mode); | |
789 | if (fd < 0) | |
55653a68 | 790 | die_errno(_("failed to open '%s'"), path); |
f633ea2c | 791 | write_in_full(fd, buf, size); |
9047ebbc MV |
792 | close(fd); |
793 | } else if (S_ISLNK(mode)) { | |
794 | char *lnk = xmemdupz(buf, size); | |
795 | safe_create_leading_directories_const(path); | |
796 | unlink(path); | |
304dcf26 | 797 | if (symlink(lnk, path)) |
55653a68 | 798 | die_errno(_("failed to symlink '%s'"), path); |
9047ebbc MV |
799 | free(lnk); |
800 | } else | |
55653a68 | 801 | die(_("do not know what to do with %06o %s '%s'"), |
9047ebbc MV |
802 | mode, sha1_to_hex(sha), path); |
803 | free(buf); | |
804 | } | |
805 | update_index: | |
806 | if (update_cache) | |
807 | add_cacheinfo(mode, sha, path, 0, update_wd, ADD_CACHE_OK_TO_ADD); | |
808 | } | |
809 | ||
b7fa51da MV |
810 | static void update_file(struct merge_options *o, |
811 | int clean, | |
9047ebbc MV |
812 | const unsigned char *sha, |
813 | unsigned mode, | |
814 | const char *path) | |
815 | { | |
b7fa51da | 816 | update_file_flags(o, sha, mode, path, o->call_depth || clean, !o->call_depth); |
9047ebbc MV |
817 | } |
818 | ||
819 | /* Low level file merging, update and removal */ | |
820 | ||
9cba13ca | 821 | struct merge_file_info { |
9047ebbc MV |
822 | unsigned char sha[20]; |
823 | unsigned mode; | |
824 | unsigned clean:1, | |
825 | merge:1; | |
826 | }; | |
827 | ||
b7fa51da MV |
828 | static int merge_3way(struct merge_options *o, |
829 | mmbuffer_t *result_buf, | |
0c059420 EN |
830 | const struct diff_filespec *one, |
831 | const struct diff_filespec *a, | |
832 | const struct diff_filespec *b, | |
9047ebbc MV |
833 | const char *branch1, |
834 | const char *branch2) | |
835 | { | |
836 | mmfile_t orig, src1, src2; | |
712516bc | 837 | struct ll_merge_options ll_opts = {0}; |
4c5868f4 | 838 | char *base_name, *name1, *name2; |
9047ebbc | 839 | int merge_status; |
8cc5b290 | 840 | |
712516bc | 841 | ll_opts.renormalize = o->renormalize; |
58a1ece4 | 842 | ll_opts.xdl_opts = o->xdl_opts; |
712516bc JN |
843 | |
844 | if (o->call_depth) { | |
845 | ll_opts.virtual_ancestor = 1; | |
846 | ll_opts.variant = 0; | |
847 | } else { | |
8cc5b290 AP |
848 | switch (o->recursive_variant) { |
849 | case MERGE_RECURSIVE_OURS: | |
712516bc | 850 | ll_opts.variant = XDL_MERGE_FAVOR_OURS; |
8cc5b290 AP |
851 | break; |
852 | case MERGE_RECURSIVE_THEIRS: | |
712516bc | 853 | ll_opts.variant = XDL_MERGE_FAVOR_THEIRS; |
8cc5b290 AP |
854 | break; |
855 | default: | |
712516bc | 856 | ll_opts.variant = 0; |
8cc5b290 AP |
857 | break; |
858 | } | |
859 | } | |
9047ebbc | 860 | |
4c5868f4 JN |
861 | if (strcmp(a->path, b->path) || |
862 | (o->ancestor != NULL && strcmp(a->path, one->path) != 0)) { | |
863 | base_name = o->ancestor == NULL ? NULL : | |
4e2d094d RJ |
864 | mkpathdup("%s:%s", o->ancestor, one->path); |
865 | name1 = mkpathdup("%s:%s", branch1, a->path); | |
866 | name2 = mkpathdup("%s:%s", branch2, b->path); | |
606475f3 | 867 | } else { |
4c5868f4 | 868 | base_name = o->ancestor == NULL ? NULL : |
4e2d094d RJ |
869 | mkpathdup("%s", o->ancestor); |
870 | name1 = mkpathdup("%s", branch1); | |
871 | name2 = mkpathdup("%s", branch2); | |
606475f3 | 872 | } |
9047ebbc | 873 | |
06b65939 ML |
874 | read_mmblob(&orig, one->sha1); |
875 | read_mmblob(&src1, a->sha1); | |
876 | read_mmblob(&src2, b->sha1); | |
9047ebbc | 877 | |
4c5868f4 | 878 | merge_status = ll_merge(result_buf, a->path, &orig, base_name, |
712516bc | 879 | &src1, name1, &src2, name2, &ll_opts); |
9047ebbc | 880 | |
4e2d094d | 881 | free(base_name); |
9047ebbc MV |
882 | free(name1); |
883 | free(name2); | |
884 | free(orig.ptr); | |
885 | free(src1.ptr); | |
886 | free(src2.ptr); | |
887 | return merge_status; | |
888 | } | |
889 | ||
6bdaead1 EN |
890 | static struct merge_file_info merge_file_1(struct merge_options *o, |
891 | const struct diff_filespec *one, | |
892 | const struct diff_filespec *a, | |
893 | const struct diff_filespec *b, | |
894 | const char *branch1, | |
895 | const char *branch2) | |
9047ebbc MV |
896 | { |
897 | struct merge_file_info result; | |
898 | result.merge = 0; | |
899 | result.clean = 1; | |
900 | ||
901 | if ((S_IFMT & a->mode) != (S_IFMT & b->mode)) { | |
902 | result.clean = 0; | |
903 | if (S_ISREG(a->mode)) { | |
904 | result.mode = a->mode; | |
905 | hashcpy(result.sha, a->sha1); | |
906 | } else { | |
907 | result.mode = b->mode; | |
908 | hashcpy(result.sha, b->sha1); | |
909 | } | |
910 | } else { | |
b7fa51da | 911 | if (!sha_eq(a->sha1, one->sha1) && !sha_eq(b->sha1, one->sha1)) |
9047ebbc MV |
912 | result.merge = 1; |
913 | ||
914 | /* | |
915 | * Merge modes | |
916 | */ | |
b7fa51da | 917 | if (a->mode == b->mode || a->mode == one->mode) |
9047ebbc MV |
918 | result.mode = b->mode; |
919 | else { | |
920 | result.mode = a->mode; | |
b7fa51da | 921 | if (b->mode != one->mode) { |
9047ebbc MV |
922 | result.clean = 0; |
923 | result.merge = 1; | |
924 | } | |
925 | } | |
926 | ||
b7fa51da | 927 | if (sha_eq(a->sha1, b->sha1) || sha_eq(a->sha1, one->sha1)) |
9047ebbc | 928 | hashcpy(result.sha, b->sha1); |
b7fa51da | 929 | else if (sha_eq(b->sha1, one->sha1)) |
9047ebbc MV |
930 | hashcpy(result.sha, a->sha1); |
931 | else if (S_ISREG(a->mode)) { | |
932 | mmbuffer_t result_buf; | |
933 | int merge_status; | |
934 | ||
b7fa51da | 935 | merge_status = merge_3way(o, &result_buf, one, a, b, |
9047ebbc MV |
936 | branch1, branch2); |
937 | ||
938 | if ((merge_status < 0) || !result_buf.ptr) | |
55653a68 | 939 | die(_("Failed to execute internal merge")); |
9047ebbc MV |
940 | |
941 | if (write_sha1_file(result_buf.ptr, result_buf.size, | |
942 | blob_type, result.sha)) | |
55653a68 | 943 | die(_("Unable to add %s to database"), |
9047ebbc MV |
944 | a->path); |
945 | ||
946 | free(result_buf.ptr); | |
947 | result.clean = (merge_status == 0); | |
948 | } else if (S_ISGITLINK(a->mode)) { | |
80988783 BK |
949 | result.clean = merge_submodule(result.sha, |
950 | one->path, one->sha1, | |
951 | a->sha1, b->sha1, | |
952 | !o->call_depth); | |
9047ebbc MV |
953 | } else if (S_ISLNK(a->mode)) { |
954 | hashcpy(result.sha, a->sha1); | |
955 | ||
956 | if (!sha_eq(a->sha1, b->sha1)) | |
957 | result.clean = 0; | |
958 | } else { | |
55653a68 | 959 | die(_("unsupported object type in the tree")); |
9047ebbc MV |
960 | } |
961 | } | |
962 | ||
963 | return result; | |
964 | } | |
965 | ||
dac47415 EN |
966 | static struct merge_file_info |
967 | merge_file_special_markers(struct merge_options *o, | |
968 | const struct diff_filespec *one, | |
969 | const struct diff_filespec *a, | |
970 | const struct diff_filespec *b, | |
971 | const char *branch1, | |
972 | const char *filename1, | |
973 | const char *branch2, | |
974 | const char *filename2) | |
975 | { | |
976 | char *side1 = NULL; | |
977 | char *side2 = NULL; | |
978 | struct merge_file_info mfi; | |
979 | ||
28310186 JK |
980 | if (filename1) |
981 | side1 = xstrfmt("%s:%s", branch1, filename1); | |
982 | if (filename2) | |
983 | side2 = xstrfmt("%s:%s", branch2, filename2); | |
dac47415 EN |
984 | |
985 | mfi = merge_file_1(o, one, a, b, | |
986 | side1 ? side1 : branch1, side2 ? side2 : branch2); | |
987 | free(side1); | |
988 | free(side2); | |
989 | return mfi; | |
990 | } | |
991 | ||
fa2364ec | 992 | static struct merge_file_info merge_file_one(struct merge_options *o, |
6bdaead1 EN |
993 | const char *path, |
994 | const unsigned char *o_sha, int o_mode, | |
995 | const unsigned char *a_sha, int a_mode, | |
996 | const unsigned char *b_sha, int b_mode, | |
997 | const char *branch1, | |
998 | const char *branch2) | |
999 | { | |
1000 | struct diff_filespec one, a, b; | |
1001 | ||
1002 | one.path = a.path = b.path = (char *)path; | |
1003 | hashcpy(one.sha1, o_sha); | |
1004 | one.mode = o_mode; | |
1005 | hashcpy(a.sha1, a_sha); | |
1006 | a.mode = a_mode; | |
1007 | hashcpy(b.sha1, b_sha); | |
1008 | b.mode = b_mode; | |
1009 | return merge_file_1(o, &one, &a, &b, branch1, branch2); | |
1010 | } | |
1011 | ||
b7033252 EN |
1012 | static void handle_change_delete(struct merge_options *o, |
1013 | const char *path, | |
1014 | const unsigned char *o_sha, int o_mode, | |
1015 | const unsigned char *a_sha, int a_mode, | |
1016 | const unsigned char *b_sha, int b_mode, | |
1017 | const char *change, const char *change_past) | |
1018 | { | |
1019 | char *renamed = NULL; | |
1020 | if (dir_in_way(path, !o->call_depth)) { | |
1021 | renamed = unique_path(o, path, a_sha ? o->branch1 : o->branch2); | |
1022 | } | |
1023 | ||
1024 | if (o->call_depth) { | |
1025 | /* | |
1026 | * We cannot arbitrarily accept either a_sha or b_sha as | |
1027 | * correct; since there is no true "middle point" between | |
1028 | * them, simply reuse the base version for virtual merge base. | |
1029 | */ | |
1030 | remove_file_from_cache(path); | |
1031 | update_file(o, 0, o_sha, o_mode, renamed ? renamed : path); | |
1032 | } else if (!a_sha) { | |
55653a68 JX |
1033 | if (!renamed) { |
1034 | output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s " | |
1035 | "and %s in %s. Version %s of %s left in tree."), | |
1036 | change, path, o->branch1, change_past, | |
1037 | o->branch2, o->branch2, path); | |
1038 | update_file(o, 0, b_sha, b_mode, path); | |
1039 | } else { | |
1040 | output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s " | |
1041 | "and %s in %s. Version %s of %s left in tree at %s."), | |
1042 | change, path, o->branch1, change_past, | |
1043 | o->branch2, o->branch2, path, renamed); | |
1044 | update_file(o, 0, b_sha, b_mode, renamed); | |
1045 | } | |
b7033252 | 1046 | } else { |
55653a68 JX |
1047 | if (!renamed) { |
1048 | output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s " | |
1049 | "and %s in %s. Version %s of %s left in tree."), | |
1050 | change, path, o->branch2, change_past, | |
1051 | o->branch1, o->branch1, path); | |
1052 | } else { | |
1053 | output(o, 1, _("CONFLICT (%s/delete): %s deleted in %s " | |
1054 | "and %s in %s. Version %s of %s left in tree at %s."), | |
1055 | change, path, o->branch2, change_past, | |
1056 | o->branch1, o->branch1, path, renamed); | |
35a74abf | 1057 | update_file(o, 0, a_sha, a_mode, renamed); |
55653a68 | 1058 | } |
35a74abf EN |
1059 | /* |
1060 | * No need to call update_file() on path when !renamed, since | |
1061 | * that would needlessly touch path. We could call | |
1062 | * update_file_flags() with update_cache=0 and update_wd=0, | |
1063 | * but that's a no-op. | |
1064 | */ | |
b7033252 EN |
1065 | } |
1066 | free(renamed); | |
1067 | } | |
1068 | ||
6ef2cb00 EN |
1069 | static void conflict_rename_delete(struct merge_options *o, |
1070 | struct diff_filepair *pair, | |
1071 | const char *rename_branch, | |
1072 | const char *other_branch) | |
9047ebbc | 1073 | { |
e03acb8b EN |
1074 | const struct diff_filespec *orig = pair->one; |
1075 | const struct diff_filespec *dest = pair->two; | |
e03acb8b EN |
1076 | const unsigned char *a_sha = NULL; |
1077 | const unsigned char *b_sha = NULL; | |
1078 | int a_mode = 0; | |
1079 | int b_mode = 0; | |
1080 | ||
1081 | if (rename_branch == o->branch1) { | |
1082 | a_sha = dest->sha1; | |
1083 | a_mode = dest->mode; | |
1084 | } else { | |
1085 | b_sha = dest->sha1; | |
1086 | b_mode = dest->mode; | |
1087 | } | |
6ef2cb00 | 1088 | |
f53d3977 EN |
1089 | handle_change_delete(o, |
1090 | o->call_depth ? orig->path : dest->path, | |
1091 | orig->sha1, orig->mode, | |
1092 | a_sha, a_mode, | |
1093 | b_sha, b_mode, | |
55653a68 | 1094 | _("rename"), _("renamed")); |
f53d3977 | 1095 | |
e03acb8b EN |
1096 | if (o->call_depth) { |
1097 | remove_file_from_cache(dest->path); | |
e03acb8b | 1098 | } else { |
e03acb8b EN |
1099 | update_stages(dest->path, NULL, |
1100 | rename_branch == o->branch1 ? dest : NULL, | |
1101 | rename_branch == o->branch1 ? NULL : dest); | |
a0de2f6b | 1102 | } |
e03acb8b | 1103 | |
6ef2cb00 EN |
1104 | } |
1105 | ||
1ac91b32 EN |
1106 | static struct diff_filespec *filespec_from_entry(struct diff_filespec *target, |
1107 | struct stage_data *entry, | |
1108 | int stage) | |
9047ebbc | 1109 | { |
1ac91b32 EN |
1110 | unsigned char *sha = entry->stages[stage].sha; |
1111 | unsigned mode = entry->stages[stage].mode; | |
1112 | if (mode == 0 || is_null_sha1(sha)) | |
1113 | return NULL; | |
1114 | hashcpy(target->sha1, sha); | |
1115 | target->mode = mode; | |
1116 | return target; | |
1117 | } | |
1118 | ||
3672c971 EN |
1119 | static void handle_file(struct merge_options *o, |
1120 | struct diff_filespec *rename, | |
1121 | int stage, | |
1122 | struct rename_conflict_info *ci) | |
1123 | { | |
1124 | char *dst_name = rename->path; | |
1125 | struct stage_data *dst_entry; | |
1126 | const char *cur_branch, *other_branch; | |
1127 | struct diff_filespec other; | |
1128 | struct diff_filespec *add; | |
1129 | ||
1130 | if (stage == 2) { | |
1131 | dst_entry = ci->dst_entry1; | |
1132 | cur_branch = ci->branch1; | |
1133 | other_branch = ci->branch2; | |
1134 | } else { | |
1135 | dst_entry = ci->dst_entry2; | |
1136 | cur_branch = ci->branch2; | |
1137 | other_branch = ci->branch1; | |
9047ebbc | 1138 | } |
3672c971 EN |
1139 | |
1140 | add = filespec_from_entry(&other, dst_entry, stage ^ 1); | |
3672c971 EN |
1141 | if (add) { |
1142 | char *add_name = unique_path(o, rename->path, other_branch); | |
1143 | update_file(o, 0, add->sha1, add->mode, add_name); | |
1144 | ||
1145 | remove_file(o, 0, rename->path, 0); | |
1146 | dst_name = unique_path(o, rename->path, cur_branch); | |
1147 | } else { | |
1148 | if (dir_in_way(rename->path, !o->call_depth)) { | |
1149 | dst_name = unique_path(o, rename->path, cur_branch); | |
55653a68 | 1150 | output(o, 1, _("%s is a directory in %s adding as %s instead"), |
3672c971 EN |
1151 | rename->path, other_branch, dst_name); |
1152 | } | |
9047ebbc | 1153 | } |
3672c971 | 1154 | update_file(o, 0, rename->sha1, rename->mode, dst_name); |
f53d3977 EN |
1155 | if (stage == 2) |
1156 | update_stages(rename->path, NULL, rename, add); | |
1157 | else | |
1158 | update_stages(rename->path, NULL, add, rename); | |
3672c971 EN |
1159 | |
1160 | if (dst_name != rename->path) | |
1161 | free(dst_name); | |
1162 | } | |
1163 | ||
09c01f85 | 1164 | static void conflict_rename_rename_1to2(struct merge_options *o, |
a99b7f22 | 1165 | struct rename_conflict_info *ci) |
9047ebbc | 1166 | { |
09c01f85 | 1167 | /* One file was renamed in both branches, but to different names. */ |
a99b7f22 EN |
1168 | struct diff_filespec *one = ci->pair1->one; |
1169 | struct diff_filespec *a = ci->pair1->two; | |
1170 | struct diff_filespec *b = ci->pair2->two; | |
4f66dade | 1171 | |
55653a68 | 1172 | output(o, 1, _("CONFLICT (rename/rename): " |
4f66dade | 1173 | "Rename \"%s\"->\"%s\" in branch \"%s\" " |
55653a68 | 1174 | "rename \"%s\"->\"%s\" in \"%s\"%s"), |
a99b7f22 EN |
1175 | one->path, a->path, ci->branch1, |
1176 | one->path, b->path, ci->branch2, | |
55653a68 | 1177 | o->call_depth ? _(" (left unresolved)") : ""); |
b7fa51da | 1178 | if (o->call_depth) { |
c52ff85d | 1179 | struct merge_file_info mfi; |
6d63070c EN |
1180 | struct diff_filespec other; |
1181 | struct diff_filespec *add; | |
fa2364ec | 1182 | mfi = merge_file_one(o, one->path, |
a99b7f22 EN |
1183 | one->sha1, one->mode, |
1184 | a->sha1, a->mode, | |
1185 | b->sha1, b->mode, | |
1186 | ci->branch1, ci->branch2); | |
9047ebbc | 1187 | /* |
c52ff85d EN |
1188 | * FIXME: For rename/add-source conflicts (if we could detect |
1189 | * such), this is wrong. We should instead find a unique | |
1190 | * pathname and then either rename the add-source file to that | |
1191 | * unique path, or use that unique path instead of src here. | |
9047ebbc | 1192 | */ |
a99b7f22 | 1193 | update_file(o, 0, mfi.sha, mfi.mode, one->path); |
07413c5a | 1194 | |
6d63070c EN |
1195 | /* |
1196 | * Above, we put the merged content at the merge-base's | |
1197 | * path. Now we usually need to delete both a->path and | |
1198 | * b->path. However, the rename on each side of the merge | |
1199 | * could also be involved in a rename/add conflict. In | |
1200 | * such cases, we should keep the added file around, | |
1201 | * resolving the conflict at that path in its favor. | |
1202 | */ | |
1203 | add = filespec_from_entry(&other, ci->dst_entry1, 2 ^ 1); | |
1204 | if (add) | |
1205 | update_file(o, 0, add->sha1, add->mode, a->path); | |
1206 | else | |
1207 | remove_file_from_cache(a->path); | |
1208 | add = filespec_from_entry(&other, ci->dst_entry2, 3 ^ 1); | |
1209 | if (add) | |
1210 | update_file(o, 0, add->sha1, add->mode, b->path); | |
1211 | else | |
1212 | remove_file_from_cache(b->path); | |
9047ebbc | 1213 | } else { |
3672c971 EN |
1214 | handle_file(o, a, 2, ci); |
1215 | handle_file(o, b, 3, ci); | |
9047ebbc | 1216 | } |
9047ebbc MV |
1217 | } |
1218 | ||
09c01f85 | 1219 | static void conflict_rename_rename_2to1(struct merge_options *o, |
461f5041 | 1220 | struct rename_conflict_info *ci) |
9047ebbc | 1221 | { |
461f5041 EN |
1222 | /* Two files, a & b, were renamed to the same thing, c. */ |
1223 | struct diff_filespec *a = ci->pair1->one; | |
1224 | struct diff_filespec *b = ci->pair2->one; | |
1225 | struct diff_filespec *c1 = ci->pair1->two; | |
1226 | struct diff_filespec *c2 = ci->pair2->two; | |
1227 | char *path = c1->path; /* == c2->path */ | |
434b8525 EN |
1228 | struct merge_file_info mfi_c1; |
1229 | struct merge_file_info mfi_c2; | |
461f5041 | 1230 | |
55653a68 | 1231 | output(o, 1, _("CONFLICT (rename/rename): " |
461f5041 | 1232 | "Rename %s->%s in %s. " |
55653a68 | 1233 | "Rename %s->%s in %s"), |
461f5041 EN |
1234 | a->path, c1->path, ci->branch1, |
1235 | b->path, c2->path, ci->branch2); | |
1236 | ||
1237 | remove_file(o, 1, a->path, would_lose_untracked(a->path)); | |
1238 | remove_file(o, 1, b->path, would_lose_untracked(b->path)); | |
1239 | ||
434b8525 EN |
1240 | mfi_c1 = merge_file_special_markers(o, a, c1, &ci->ren1_other, |
1241 | o->branch1, c1->path, | |
1242 | o->branch2, ci->ren1_other.path); | |
1243 | mfi_c2 = merge_file_special_markers(o, b, &ci->ren2_other, c2, | |
1244 | o->branch1, ci->ren2_other.path, | |
1245 | o->branch2, c2->path); | |
1246 | ||
0a6b8712 | 1247 | if (o->call_depth) { |
434b8525 EN |
1248 | /* |
1249 | * If mfi_c1.clean && mfi_c2.clean, then it might make | |
1250 | * sense to do a two-way merge of those results. But, I | |
1251 | * think in all cases, it makes sense to have the virtual | |
1252 | * merge base just undo the renames; they can be detected | |
1253 | * again later for the non-recursive merge. | |
1254 | */ | |
1255 | remove_file(o, 0, path, 0); | |
1256 | update_file(o, 0, mfi_c1.sha, mfi_c1.mode, a->path); | |
1257 | update_file(o, 0, mfi_c2.sha, mfi_c2.mode, b->path); | |
0a6b8712 | 1258 | } else { |
461f5041 EN |
1259 | char *new_path1 = unique_path(o, path, ci->branch1); |
1260 | char *new_path2 = unique_path(o, path, ci->branch2); | |
55653a68 | 1261 | output(o, 1, _("Renaming %s to %s and %s to %s instead"), |
461f5041 | 1262 | a->path, new_path1, b->path, new_path2); |
0a6b8712 | 1263 | remove_file(o, 0, path, 0); |
434b8525 EN |
1264 | update_file(o, 0, mfi_c1.sha, mfi_c1.mode, new_path1); |
1265 | update_file(o, 0, mfi_c2.sha, mfi_c2.mode, new_path2); | |
0a6b8712 EN |
1266 | free(new_path2); |
1267 | free(new_path1); | |
1268 | } | |
9047ebbc MV |
1269 | } |
1270 | ||
8a2fce18 MV |
1271 | static int process_renames(struct merge_options *o, |
1272 | struct string_list *a_renames, | |
1273 | struct string_list *b_renames) | |
9047ebbc MV |
1274 | { |
1275 | int clean_merge = 1, i, j; | |
183113a5 TF |
1276 | struct string_list a_by_dst = STRING_LIST_INIT_NODUP; |
1277 | struct string_list b_by_dst = STRING_LIST_INIT_NODUP; | |
9047ebbc MV |
1278 | const struct rename *sre; |
1279 | ||
1280 | for (i = 0; i < a_renames->nr; i++) { | |
1281 | sre = a_renames->items[i].util; | |
78a395d3 | 1282 | string_list_insert(&a_by_dst, sre->pair->two->path)->util |
0a6b8712 | 1283 | = (void *)sre; |
9047ebbc MV |
1284 | } |
1285 | for (i = 0; i < b_renames->nr; i++) { | |
1286 | sre = b_renames->items[i].util; | |
78a395d3 | 1287 | string_list_insert(&b_by_dst, sre->pair->two->path)->util |
0a6b8712 | 1288 | = (void *)sre; |
9047ebbc MV |
1289 | } |
1290 | ||
1291 | for (i = 0, j = 0; i < a_renames->nr || j < b_renames->nr;) { | |
8e24cbae | 1292 | struct string_list *renames1, *renames2Dst; |
9047ebbc MV |
1293 | struct rename *ren1 = NULL, *ren2 = NULL; |
1294 | const char *branch1, *branch2; | |
1295 | const char *ren1_src, *ren1_dst; | |
461f5041 | 1296 | struct string_list_item *lookup; |
9047ebbc MV |
1297 | |
1298 | if (i >= a_renames->nr) { | |
9047ebbc MV |
1299 | ren2 = b_renames->items[j++].util; |
1300 | } else if (j >= b_renames->nr) { | |
9047ebbc MV |
1301 | ren1 = a_renames->items[i++].util; |
1302 | } else { | |
8e24cbae BK |
1303 | int compare = strcmp(a_renames->items[i].string, |
1304 | b_renames->items[j].string); | |
9047ebbc MV |
1305 | if (compare <= 0) |
1306 | ren1 = a_renames->items[i++].util; | |
1307 | if (compare >= 0) | |
1308 | ren2 = b_renames->items[j++].util; | |
1309 | } | |
1310 | ||
1311 | /* TODO: refactor, so that 1/2 are not needed */ | |
1312 | if (ren1) { | |
1313 | renames1 = a_renames; | |
9047ebbc | 1314 | renames2Dst = &b_by_dst; |
8a2fce18 MV |
1315 | branch1 = o->branch1; |
1316 | branch2 = o->branch2; | |
9047ebbc MV |
1317 | } else { |
1318 | struct rename *tmp; | |
1319 | renames1 = b_renames; | |
9047ebbc | 1320 | renames2Dst = &a_by_dst; |
8a2fce18 MV |
1321 | branch1 = o->branch2; |
1322 | branch2 = o->branch1; | |
9047ebbc MV |
1323 | tmp = ren2; |
1324 | ren2 = ren1; | |
1325 | ren1 = tmp; | |
1326 | } | |
9047ebbc | 1327 | |
9047ebbc MV |
1328 | if (ren1->processed) |
1329 | continue; | |
1330 | ren1->processed = 1; | |
9047ebbc | 1331 | ren1->dst_entry->processed = 1; |
7769a75e EN |
1332 | /* BUG: We should only mark src_entry as processed if we |
1333 | * are not dealing with a rename + add-source case. | |
1334 | */ | |
9047ebbc | 1335 | ren1->src_entry->processed = 1; |
9047ebbc MV |
1336 | |
1337 | ren1_src = ren1->pair->one->path; | |
1338 | ren1_dst = ren1->pair->two->path; | |
1339 | ||
1340 | if (ren2) { | |
461f5041 | 1341 | /* One file renamed on both sides */ |
9047ebbc MV |
1342 | const char *ren2_src = ren2->pair->one->path; |
1343 | const char *ren2_dst = ren2->pair->two->path; | |
4f66dade | 1344 | enum rename_type rename_type; |
9047ebbc | 1345 | if (strcmp(ren1_src, ren2_src) != 0) |
461f5041 | 1346 | die("ren1_src != ren2_src"); |
9047ebbc MV |
1347 | ren2->dst_entry->processed = 1; |
1348 | ren2->processed = 1; | |
1349 | if (strcmp(ren1_dst, ren2_dst) != 0) { | |
4f66dade | 1350 | rename_type = RENAME_ONE_FILE_TO_TWO; |
461f5041 | 1351 | clean_merge = 0; |
9047ebbc | 1352 | } else { |
4f66dade | 1353 | rename_type = RENAME_ONE_FILE_TO_ONE; |
7769a75e EN |
1354 | /* BUG: We should only remove ren1_src in |
1355 | * the base stage (think of rename + | |
1356 | * add-source cases). | |
1357 | */ | |
b7fa51da | 1358 | remove_file(o, 1, ren1_src, 1); |
b8ddf164 EN |
1359 | update_entry(ren1->dst_entry, |
1360 | ren1->pair->one, | |
1361 | ren1->pair->two, | |
1362 | ren2->pair->two); | |
9047ebbc | 1363 | } |
4f66dade EN |
1364 | setup_rename_conflict_info(rename_type, |
1365 | ren1->pair, | |
1366 | ren2->pair, | |
1367 | branch1, | |
1368 | branch2, | |
1369 | ren1->dst_entry, | |
232c635f EN |
1370 | ren2->dst_entry, |
1371 | o, | |
1372 | NULL, | |
1373 | NULL); | |
461f5041 EN |
1374 | } else if ((lookup = string_list_lookup(renames2Dst, ren1_dst))) { |
1375 | /* Two different files renamed to the same thing */ | |
1376 | char *ren2_dst; | |
1377 | ren2 = lookup->util; | |
1378 | ren2_dst = ren2->pair->two->path; | |
1379 | if (strcmp(ren1_dst, ren2_dst) != 0) | |
1380 | die("ren1_dst != ren2_dst"); | |
1381 | ||
1382 | clean_merge = 0; | |
1383 | ren2->processed = 1; | |
1384 | /* | |
1385 | * BUG: We should only mark src_entry as processed | |
1386 | * if we are not dealing with a rename + add-source | |
1387 | * case. | |
1388 | */ | |
1389 | ren2->src_entry->processed = 1; | |
1390 | ||
1391 | setup_rename_conflict_info(RENAME_TWO_FILES_TO_ONE, | |
1392 | ren1->pair, | |
1393 | ren2->pair, | |
1394 | branch1, | |
1395 | branch2, | |
1396 | ren1->dst_entry, | |
232c635f EN |
1397 | ren2->dst_entry, |
1398 | o, | |
1399 | ren1->src_entry, | |
1400 | ren2->src_entry); | |
1401 | ||
9047ebbc MV |
1402 | } else { |
1403 | /* Renamed in 1, maybe changed in 2 */ | |
9047ebbc MV |
1404 | /* we only use sha1 and mode of these */ |
1405 | struct diff_filespec src_other, dst_other; | |
41d70bd6 | 1406 | int try_merge; |
9047ebbc | 1407 | |
41d70bd6 EN |
1408 | /* |
1409 | * unpack_trees loads entries from common-commit | |
1410 | * into stage 1, from head-commit into stage 2, and | |
1411 | * from merge-commit into stage 3. We keep track | |
1412 | * of which side corresponds to the rename. | |
1413 | */ | |
1414 | int renamed_stage = a_renames == renames1 ? 2 : 3; | |
1415 | int other_stage = a_renames == renames1 ? 3 : 2; | |
9047ebbc | 1416 | |
7769a75e EN |
1417 | /* BUG: We should only remove ren1_src in the base |
1418 | * stage and in other_stage (think of rename + | |
1419 | * add-source case). | |
1420 | */ | |
531357a4 EN |
1421 | remove_file(o, 1, ren1_src, |
1422 | renamed_stage == 2 || !was_tracked(ren1_src)); | |
9047ebbc | 1423 | |
41d70bd6 EN |
1424 | hashcpy(src_other.sha1, ren1->src_entry->stages[other_stage].sha); |
1425 | src_other.mode = ren1->src_entry->stages[other_stage].mode; | |
1426 | hashcpy(dst_other.sha1, ren1->dst_entry->stages[other_stage].sha); | |
1427 | dst_other.mode = ren1->dst_entry->stages[other_stage].mode; | |
9047ebbc MV |
1428 | try_merge = 0; |
1429 | ||
86273e57 | 1430 | if (sha_eq(src_other.sha1, null_sha1)) { |
4f66dade EN |
1431 | setup_rename_conflict_info(RENAME_DELETE, |
1432 | ren1->pair, | |
1433 | NULL, | |
1434 | branch1, | |
1435 | branch2, | |
1436 | ren1->dst_entry, | |
232c635f EN |
1437 | NULL, |
1438 | o, | |
1439 | NULL, | |
4f66dade | 1440 | NULL); |
d5af5105 SK |
1441 | } else if ((dst_other.mode == ren1->pair->two->mode) && |
1442 | sha_eq(dst_other.sha1, ren1->pair->two->sha1)) { | |
35a74abf EN |
1443 | /* |
1444 | * Added file on the other side identical to | |
1445 | * the file being renamed: clean merge. | |
1446 | * Also, there is no need to overwrite the | |
1447 | * file already in the working copy, so call | |
1448 | * update_file_flags() instead of | |
1449 | * update_file(). | |
1450 | */ | |
1451 | update_file_flags(o, | |
1452 | ren1->pair->two->sha1, | |
1453 | ren1->pair->two->mode, | |
1454 | ren1_dst, | |
1455 | 1, /* update_cache */ | |
1456 | 0 /* update_wd */); | |
9047ebbc | 1457 | } else if (!sha_eq(dst_other.sha1, null_sha1)) { |
9047ebbc MV |
1458 | clean_merge = 0; |
1459 | try_merge = 1; | |
55653a68 JX |
1460 | output(o, 1, _("CONFLICT (rename/add): Rename %s->%s in %s. " |
1461 | "%s added in %s"), | |
9047ebbc MV |
1462 | ren1_src, ren1_dst, branch1, |
1463 | ren1_dst, branch2); | |
c94736a2 JH |
1464 | if (o->call_depth) { |
1465 | struct merge_file_info mfi; | |
fa2364ec | 1466 | mfi = merge_file_one(o, ren1_dst, null_sha1, 0, |
6bdaead1 EN |
1467 | ren1->pair->two->sha1, ren1->pair->two->mode, |
1468 | dst_other.sha1, dst_other.mode, | |
1469 | branch1, branch2); | |
55653a68 | 1470 | output(o, 1, _("Adding merged %s"), ren1_dst); |
6bdaead1 | 1471 | update_file(o, 0, mfi.sha, mfi.mode, ren1_dst); |
2a669c34 | 1472 | try_merge = 0; |
c94736a2 | 1473 | } else { |
3d6b8e88 | 1474 | char *new_path = unique_path(o, ren1_dst, branch2); |
55653a68 | 1475 | output(o, 1, _("Adding as %s instead"), new_path); |
c94736a2 | 1476 | update_file(o, 0, dst_other.sha1, dst_other.mode, new_path); |
3d6b8e88 | 1477 | free(new_path); |
c94736a2 | 1478 | } |
9047ebbc MV |
1479 | } else |
1480 | try_merge = 1; | |
1481 | ||
1482 | if (try_merge) { | |
8a2fce18 | 1483 | struct diff_filespec *one, *a, *b; |
9047ebbc MV |
1484 | src_other.path = (char *)ren1_src; |
1485 | ||
8a2fce18 | 1486 | one = ren1->pair->one; |
9047ebbc MV |
1487 | if (a_renames == renames1) { |
1488 | a = ren1->pair->two; | |
1489 | b = &src_other; | |
1490 | } else { | |
1491 | b = ren1->pair->two; | |
1492 | a = &src_other; | |
1493 | } | |
b8ddf164 | 1494 | update_entry(ren1->dst_entry, one, a, b); |
4f66dade EN |
1495 | setup_rename_conflict_info(RENAME_NORMAL, |
1496 | ren1->pair, | |
1497 | NULL, | |
1498 | branch1, | |
1499 | NULL, | |
1500 | ren1->dst_entry, | |
232c635f EN |
1501 | NULL, |
1502 | o, | |
1503 | NULL, | |
4f66dade | 1504 | NULL); |
9047ebbc MV |
1505 | } |
1506 | } | |
1507 | } | |
1508 | string_list_clear(&a_by_dst, 0); | |
1509 | string_list_clear(&b_by_dst, 0); | |
1510 | ||
1511 | return clean_merge; | |
1512 | } | |
1513 | ||
1514 | static unsigned char *stage_sha(const unsigned char *sha, unsigned mode) | |
1515 | { | |
1516 | return (is_null_sha1(sha) || mode == 0) ? NULL: (unsigned char *)sha; | |
1517 | } | |
1518 | ||
331a1838 EB |
1519 | static int read_sha1_strbuf(const unsigned char *sha1, struct strbuf *dst) |
1520 | { | |
1521 | void *buf; | |
1522 | enum object_type type; | |
1523 | unsigned long size; | |
1524 | buf = read_sha1_file(sha1, &type, &size); | |
1525 | if (!buf) | |
55653a68 | 1526 | return error(_("cannot read object %s"), sha1_to_hex(sha1)); |
331a1838 EB |
1527 | if (type != OBJ_BLOB) { |
1528 | free(buf); | |
55653a68 | 1529 | return error(_("object %s is not a blob"), sha1_to_hex(sha1)); |
331a1838 EB |
1530 | } |
1531 | strbuf_attach(dst, buf, size, size + 1); | |
1532 | return 0; | |
1533 | } | |
1534 | ||
1535 | static int blob_unchanged(const unsigned char *o_sha, | |
72fac66b | 1536 | unsigned o_mode, |
331a1838 | 1537 | const unsigned char *a_sha, |
72fac66b | 1538 | unsigned a_mode, |
3e7589b7 | 1539 | int renormalize, const char *path) |
331a1838 EB |
1540 | { |
1541 | struct strbuf o = STRBUF_INIT; | |
1542 | struct strbuf a = STRBUF_INIT; | |
1543 | int ret = 0; /* assume changed for safety */ | |
1544 | ||
72fac66b JK |
1545 | if (a_mode != o_mode) |
1546 | return 0; | |
331a1838 EB |
1547 | if (sha_eq(o_sha, a_sha)) |
1548 | return 1; | |
3e7589b7 | 1549 | if (!renormalize) |
331a1838 EB |
1550 | return 0; |
1551 | ||
1552 | assert(o_sha && a_sha); | |
1553 | if (read_sha1_strbuf(o_sha, &o) || read_sha1_strbuf(a_sha, &a)) | |
1554 | goto error_return; | |
1555 | /* | |
1556 | * Note: binary | is used so that both renormalizations are | |
1557 | * performed. Comparison can be skipped if both files are | |
1558 | * unchanged since their sha1s have already been compared. | |
1559 | */ | |
1560 | if (renormalize_buffer(path, o.buf, o.len, &o) | | |
422af49c | 1561 | renormalize_buffer(path, a.buf, a.len, &a)) |
331a1838 EB |
1562 | ret = (o.len == a.len && !memcmp(o.buf, a.buf, o.len)); |
1563 | ||
1564 | error_return: | |
1565 | strbuf_release(&o); | |
1566 | strbuf_release(&a); | |
1567 | return ret; | |
1568 | } | |
1569 | ||
b7033252 | 1570 | static void handle_modify_delete(struct merge_options *o, |
5e3ce663 | 1571 | const char *path, |
ec61d149 | 1572 | unsigned char *o_sha, int o_mode, |
5e3ce663 EN |
1573 | unsigned char *a_sha, int a_mode, |
1574 | unsigned char *b_sha, int b_mode) | |
1575 | { | |
b7033252 EN |
1576 | handle_change_delete(o, |
1577 | path, | |
1578 | o_sha, o_mode, | |
1579 | a_sha, a_mode, | |
1580 | b_sha, b_mode, | |
55653a68 | 1581 | _("modify"), _("modified")); |
5e3ce663 EN |
1582 | } |
1583 | ||
0c4918d1 EN |
1584 | static int merge_content(struct merge_options *o, |
1585 | const char *path, | |
1586 | unsigned char *o_sha, int o_mode, | |
1587 | unsigned char *a_sha, int a_mode, | |
61b8bcae | 1588 | unsigned char *b_sha, int b_mode, |
4f66dade | 1589 | struct rename_conflict_info *rename_conflict_info) |
0c4918d1 | 1590 | { |
55653a68 | 1591 | const char *reason = _("content"); |
5b448b85 | 1592 | const char *path1 = NULL, *path2 = NULL; |
0c4918d1 EN |
1593 | struct merge_file_info mfi; |
1594 | struct diff_filespec one, a, b; | |
4ab9a157 | 1595 | unsigned df_conflict_remains = 0; |
0c4918d1 EN |
1596 | |
1597 | if (!o_sha) { | |
55653a68 | 1598 | reason = _("add/add"); |
0c4918d1 EN |
1599 | o_sha = (unsigned char *)null_sha1; |
1600 | } | |
1601 | one.path = a.path = b.path = (char *)path; | |
1602 | hashcpy(one.sha1, o_sha); | |
1603 | one.mode = o_mode; | |
1604 | hashcpy(a.sha1, a_sha); | |
1605 | a.mode = a_mode; | |
1606 | hashcpy(b.sha1, b_sha); | |
1607 | b.mode = b_mode; | |
1608 | ||
3c217c07 | 1609 | if (rename_conflict_info) { |
3c217c07 EN |
1610 | struct diff_filepair *pair1 = rename_conflict_info->pair1; |
1611 | ||
1612 | path1 = (o->branch1 == rename_conflict_info->branch1) ? | |
1613 | pair1->two->path : pair1->one->path; | |
1614 | /* If rename_conflict_info->pair2 != NULL, we are in | |
1615 | * RENAME_ONE_FILE_TO_ONE case. Otherwise, we have a | |
1616 | * normal rename. | |
1617 | */ | |
1618 | path2 = (rename_conflict_info->pair2 || | |
1619 | o->branch2 == rename_conflict_info->branch1) ? | |
1620 | pair1->two->path : pair1->one->path; | |
3c217c07 EN |
1621 | |
1622 | if (dir_in_way(path, !o->call_depth)) | |
1623 | df_conflict_remains = 1; | |
4ab9a157 | 1624 | } |
dac47415 EN |
1625 | mfi = merge_file_special_markers(o, &one, &a, &b, |
1626 | o->branch1, path1, | |
1627 | o->branch2, path2); | |
4ab9a157 EN |
1628 | |
1629 | if (mfi.clean && !df_conflict_remains && | |
5b448b85 EN |
1630 | sha_eq(mfi.sha, a_sha) && mfi.mode == a_mode) { |
1631 | int path_renamed_outside_HEAD; | |
55653a68 | 1632 | output(o, 3, _("Skipped %s (merged same as existing)"), path); |
5b448b85 EN |
1633 | /* |
1634 | * The content merge resulted in the same file contents we | |
1635 | * already had. We can return early if those file contents | |
1636 | * are recorded at the correct path (which may not be true | |
1637 | * if the merge involves a rename). | |
1638 | */ | |
1639 | path_renamed_outside_HEAD = !path2 || !strcmp(path, path2); | |
1640 | if (!path_renamed_outside_HEAD) { | |
1641 | add_cacheinfo(mfi.mode, mfi.sha, path, | |
d45b7f40 | 1642 | 0, (!o->call_depth), 0); |
5b448b85 EN |
1643 | return mfi.clean; |
1644 | } | |
1645 | } else | |
55653a68 | 1646 | output(o, 2, _("Auto-merging %s"), path); |
0c4918d1 EN |
1647 | |
1648 | if (!mfi.clean) { | |
1649 | if (S_ISGITLINK(mfi.mode)) | |
55653a68 JX |
1650 | reason = _("submodule"); |
1651 | output(o, 1, _("CONFLICT (%s): Merge conflict in %s"), | |
0c4918d1 | 1652 | reason, path); |
4f66dade | 1653 | if (rename_conflict_info && !df_conflict_remains) |
b8ddf164 | 1654 | update_stages(path, &one, &a, &b); |
0c4918d1 EN |
1655 | } |
1656 | ||
4ab9a157 | 1657 | if (df_conflict_remains) { |
3d6b8e88 | 1658 | char *new_path; |
51931bf0 EN |
1659 | if (o->call_depth) { |
1660 | remove_file_from_cache(path); | |
1661 | } else { | |
1662 | if (!mfi.clean) | |
1663 | update_stages(path, &one, &a, &b); | |
1664 | else { | |
1665 | int file_from_stage2 = was_tracked(path); | |
1666 | struct diff_filespec merged; | |
1667 | hashcpy(merged.sha1, mfi.sha); | |
1668 | merged.mode = mfi.mode; | |
1669 | ||
1670 | update_stages(path, NULL, | |
1671 | file_from_stage2 ? &merged : NULL, | |
1672 | file_from_stage2 ? NULL : &merged); | |
1673 | } | |
1674 | ||
1675 | } | |
4f66dade | 1676 | new_path = unique_path(o, path, rename_conflict_info->branch1); |
55653a68 | 1677 | output(o, 1, _("Adding as %s instead"), new_path); |
51931bf0 | 1678 | update_file(o, 0, mfi.sha, mfi.mode, new_path); |
3d6b8e88 | 1679 | free(new_path); |
51931bf0 | 1680 | mfi.clean = 0; |
4ab9a157 EN |
1681 | } else { |
1682 | update_file(o, mfi.clean, mfi.sha, mfi.mode, path); | |
1683 | } | |
0c4918d1 EN |
1684 | return mfi.clean; |
1685 | ||
1686 | } | |
1687 | ||
9047ebbc | 1688 | /* Per entry merge function */ |
8a2fce18 MV |
1689 | static int process_entry(struct merge_options *o, |
1690 | const char *path, struct stage_data *entry) | |
9047ebbc | 1691 | { |
9047ebbc | 1692 | int clean_merge = 1; |
1bc0ab7c | 1693 | int normalize = o->renormalize; |
9047ebbc MV |
1694 | unsigned o_mode = entry->stages[1].mode; |
1695 | unsigned a_mode = entry->stages[2].mode; | |
1696 | unsigned b_mode = entry->stages[3].mode; | |
1697 | unsigned char *o_sha = stage_sha(entry->stages[1].sha, o_mode); | |
1698 | unsigned char *a_sha = stage_sha(entry->stages[2].sha, a_mode); | |
1699 | unsigned char *b_sha = stage_sha(entry->stages[3].sha, b_mode); | |
1700 | ||
37348937 | 1701 | entry->processed = 1; |
4f66dade EN |
1702 | if (entry->rename_conflict_info) { |
1703 | struct rename_conflict_info *conflict_info = entry->rename_conflict_info; | |
07413c5a | 1704 | switch (conflict_info->rename_type) { |
882fd11a | 1705 | case RENAME_NORMAL: |
4f66dade | 1706 | case RENAME_ONE_FILE_TO_ONE: |
882fd11a EN |
1707 | clean_merge = merge_content(o, path, |
1708 | o_sha, o_mode, a_sha, a_mode, b_sha, b_mode, | |
4f66dade | 1709 | conflict_info); |
882fd11a | 1710 | break; |
3b130adf EN |
1711 | case RENAME_DELETE: |
1712 | clean_merge = 0; | |
1713 | conflict_rename_delete(o, conflict_info->pair1, | |
1714 | conflict_info->branch1, | |
1715 | conflict_info->branch2); | |
1716 | break; | |
07413c5a | 1717 | case RENAME_ONE_FILE_TO_TWO: |
07413c5a | 1718 | clean_merge = 0; |
a99b7f22 | 1719 | conflict_rename_rename_1to2(o, conflict_info); |
07413c5a | 1720 | break; |
461f5041 EN |
1721 | case RENAME_TWO_FILES_TO_ONE: |
1722 | clean_merge = 0; | |
1723 | conflict_rename_rename_2to1(o, conflict_info); | |
07413c5a EN |
1724 | break; |
1725 | default: | |
1726 | entry->processed = 0; | |
1727 | break; | |
1728 | } | |
71f7ffcc | 1729 | } else if (o_sha && (!a_sha || !b_sha)) { |
edd2faf5 EN |
1730 | /* Case A: Deleted in one */ |
1731 | if ((!a_sha && !b_sha) || | |
72fac66b JK |
1732 | (!b_sha && blob_unchanged(o_sha, o_mode, a_sha, a_mode, normalize, path)) || |
1733 | (!a_sha && blob_unchanged(o_sha, o_mode, b_sha, b_mode, normalize, path))) { | |
edd2faf5 EN |
1734 | /* Deleted in both or deleted in one and |
1735 | * unchanged in the other */ | |
1736 | if (a_sha) | |
55653a68 | 1737 | output(o, 2, _("Removing %s"), path); |
edd2faf5 EN |
1738 | /* do not touch working file if it did not exist */ |
1739 | remove_file(o, 1, path, !a_sha); | |
1740 | } else { | |
1741 | /* Modify/delete; deleted side may have put a directory in the way */ | |
edd2faf5 | 1742 | clean_merge = 0; |
b7033252 | 1743 | handle_modify_delete(o, path, o_sha, o_mode, |
edd2faf5 | 1744 | a_sha, a_mode, b_sha, b_mode); |
3d6b8e88 | 1745 | } |
edd2faf5 EN |
1746 | } else if ((!o_sha && a_sha && !b_sha) || |
1747 | (!o_sha && !a_sha && b_sha)) { | |
1748 | /* Case B: Added in one. */ | |
1749 | /* [nothing|directory] -> ([nothing|directory], file) */ | |
1750 | ||
9c0bbb50 EN |
1751 | const char *add_branch; |
1752 | const char *other_branch; | |
1753 | unsigned mode; | |
1754 | const unsigned char *sha; | |
1755 | const char *conf; | |
37348937 | 1756 | |
9c0bbb50 EN |
1757 | if (a_sha) { |
1758 | add_branch = o->branch1; | |
1759 | other_branch = o->branch2; | |
1760 | mode = a_mode; | |
1761 | sha = a_sha; | |
55653a68 | 1762 | conf = _("file/directory"); |
9c0bbb50 EN |
1763 | } else { |
1764 | add_branch = o->branch2; | |
1765 | other_branch = o->branch1; | |
1766 | mode = b_mode; | |
1767 | sha = b_sha; | |
55653a68 | 1768 | conf = _("directory/file"); |
9c0bbb50 | 1769 | } |
f2507b4e | 1770 | if (dir_in_way(path, !o->call_depth)) { |
3d6b8e88 | 1771 | char *new_path = unique_path(o, path, add_branch); |
9c0bbb50 | 1772 | clean_merge = 0; |
55653a68 JX |
1773 | output(o, 1, _("CONFLICT (%s): There is a directory with name %s in %s. " |
1774 | "Adding %s as %s"), | |
9c0bbb50 | 1775 | conf, path, other_branch, path, new_path); |
51931bf0 EN |
1776 | if (o->call_depth) |
1777 | remove_file_from_cache(path); | |
9c0bbb50 | 1778 | update_file(o, 0, sha, mode, new_path); |
7b1c610f EN |
1779 | if (o->call_depth) |
1780 | remove_file_from_cache(path); | |
3d6b8e88 | 1781 | free(new_path); |
9c0bbb50 | 1782 | } else { |
55653a68 | 1783 | output(o, 2, _("Adding %s"), path); |
35a74abf EN |
1784 | /* do not overwrite file if already present */ |
1785 | update_file_flags(o, sha, mode, path, 1, !a_sha); | |
9c0bbb50 | 1786 | } |
edd2faf5 EN |
1787 | } else if (a_sha && b_sha) { |
1788 | /* Case C: Added in both (check for same permissions) and */ | |
1789 | /* case D: Modified in both, but differently. */ | |
4f66dade | 1790 | clean_merge = merge_content(o, path, |
edd2faf5 EN |
1791 | o_sha, o_mode, a_sha, a_mode, b_sha, b_mode, |
1792 | NULL); | |
1793 | } else if (!o_sha && !a_sha && !b_sha) { | |
1794 | /* | |
1795 | * this entry was deleted altogether. a_mode == 0 means | |
1796 | * we had that path and want to actively remove it. | |
1797 | */ | |
1798 | remove_file(o, 1, path, !a_mode); | |
1799 | } else | |
55653a68 | 1800 | die(_("Fatal merge failure, shouldn't happen.")); |
37348937 EN |
1801 | |
1802 | return clean_merge; | |
1803 | } | |
1804 | ||
8a2fce18 MV |
1805 | int merge_trees(struct merge_options *o, |
1806 | struct tree *head, | |
9047ebbc MV |
1807 | struct tree *merge, |
1808 | struct tree *common, | |
9047ebbc MV |
1809 | struct tree **result) |
1810 | { | |
1811 | int code, clean; | |
1812 | ||
85e51b78 JH |
1813 | if (o->subtree_shift) { |
1814 | merge = shift_tree_object(head, merge, o->subtree_shift); | |
1815 | common = shift_tree_object(head, common, o->subtree_shift); | |
9047ebbc MV |
1816 | } |
1817 | ||
ed1c9977 | 1818 | if (sha_eq(common->object.oid.hash, merge->object.oid.hash)) { |
55653a68 | 1819 | output(o, 0, _("Already up-to-date!")); |
9047ebbc MV |
1820 | *result = head; |
1821 | return 1; | |
1822 | } | |
1823 | ||
b7fa51da | 1824 | code = git_merge_trees(o->call_depth, common, head, merge); |
9047ebbc | 1825 | |
fadd069d JH |
1826 | if (code != 0) { |
1827 | if (show(o, 4) || o->call_depth) | |
55653a68 | 1828 | die(_("merging of trees %s and %s failed"), |
f2fd0760 | 1829 | oid_to_hex(&head->object.oid), |
1830 | oid_to_hex(&merge->object.oid)); | |
fadd069d JH |
1831 | else |
1832 | exit(128); | |
1833 | } | |
9047ebbc MV |
1834 | |
1835 | if (unmerged_cache()) { | |
1836 | struct string_list *entries, *re_head, *re_merge; | |
1837 | int i; | |
696ee23c MV |
1838 | string_list_clear(&o->current_file_set, 1); |
1839 | string_list_clear(&o->current_directory_set, 1); | |
1840 | get_files_dirs(o, head); | |
1841 | get_files_dirs(o, merge); | |
9047ebbc MV |
1842 | |
1843 | entries = get_unmerged(); | |
70cc3d36 | 1844 | record_df_conflict_files(o, entries); |
8a2fce18 MV |
1845 | re_head = get_renames(o, head, common, head, merge, entries); |
1846 | re_merge = get_renames(o, merge, common, head, merge, entries); | |
1847 | clean = process_renames(o, re_head, re_merge); | |
edd2faf5 | 1848 | for (i = entries->nr-1; 0 <= i; i--) { |
9047ebbc MV |
1849 | const char *path = entries->items[i].string; |
1850 | struct stage_data *e = entries->items[i].util; | |
1851 | if (!e->processed | |
8a2fce18 | 1852 | && !process_entry(o, path, e)) |
9047ebbc MV |
1853 | clean = 0; |
1854 | } | |
7edba4c4 JH |
1855 | for (i = 0; i < entries->nr; i++) { |
1856 | struct stage_data *e = entries->items[i].util; | |
1857 | if (!e->processed) | |
55653a68 | 1858 | die(_("Unprocessed path??? %s"), |
7edba4c4 JH |
1859 | entries->items[i].string); |
1860 | } | |
9047ebbc MV |
1861 | |
1862 | string_list_clear(re_merge, 0); | |
1863 | string_list_clear(re_head, 0); | |
1864 | string_list_clear(entries, 1); | |
1865 | ||
473091e2 SB |
1866 | free(re_merge); |
1867 | free(re_head); | |
1868 | free(entries); | |
9047ebbc MV |
1869 | } |
1870 | else | |
1871 | clean = 1; | |
1872 | ||
b7fa51da | 1873 | if (o->call_depth) |
8a2fce18 | 1874 | *result = write_tree_from_memory(o); |
9047ebbc MV |
1875 | |
1876 | return clean; | |
1877 | } | |
1878 | ||
1879 | static struct commit_list *reverse_commit_list(struct commit_list *list) | |
1880 | { | |
1881 | struct commit_list *next = NULL, *current, *backup; | |
1882 | for (current = list; current; current = backup) { | |
1883 | backup = current->next; | |
1884 | current->next = next; | |
1885 | next = current; | |
1886 | } | |
1887 | return next; | |
1888 | } | |
1889 | ||
1890 | /* | |
1891 | * Merge the commits h1 and h2, return the resulting virtual | |
1892 | * commit object and a flag indicating the cleanness of the merge. | |
1893 | */ | |
8a2fce18 MV |
1894 | int merge_recursive(struct merge_options *o, |
1895 | struct commit *h1, | |
9047ebbc | 1896 | struct commit *h2, |
9047ebbc MV |
1897 | struct commit_list *ca, |
1898 | struct commit **result) | |
1899 | { | |
1900 | struct commit_list *iter; | |
1901 | struct commit *merged_common_ancestors; | |
1902 | struct tree *mrtree = mrtree; | |
1903 | int clean; | |
1904 | ||
8a2fce18 | 1905 | if (show(o, 4)) { |
55653a68 | 1906 | output(o, 4, _("Merging:")); |
5033639c MV |
1907 | output_commit_title(o, h1); |
1908 | output_commit_title(o, h2); | |
9047ebbc MV |
1909 | } |
1910 | ||
1911 | if (!ca) { | |
2ce406cc | 1912 | ca = get_merge_bases(h1, h2); |
9047ebbc MV |
1913 | ca = reverse_commit_list(ca); |
1914 | } | |
1915 | ||
8a2fce18 | 1916 | if (show(o, 5)) { |
e0453cd8 RT |
1917 | unsigned cnt = commit_list_count(ca); |
1918 | ||
1919 | output(o, 5, Q_("found %u common ancestor:", | |
1920 | "found %u common ancestors:", cnt), cnt); | |
9047ebbc | 1921 | for (iter = ca; iter; iter = iter->next) |
5033639c | 1922 | output_commit_title(o, iter->item); |
9047ebbc MV |
1923 | } |
1924 | ||
1925 | merged_common_ancestors = pop_commit(&ca); | |
1926 | if (merged_common_ancestors == NULL) { | |
03f622c8 JN |
1927 | /* if there is no common ancestor, use an empty tree */ |
1928 | struct tree *tree; | |
9047ebbc | 1929 | |
cba595bd | 1930 | tree = lookup_tree(EMPTY_TREE_SHA1_BIN); |
9047ebbc MV |
1931 | merged_common_ancestors = make_virtual_commit(tree, "ancestor"); |
1932 | } | |
1933 | ||
1934 | for (iter = ca; iter; iter = iter->next) { | |
8a2fce18 | 1935 | const char *saved_b1, *saved_b2; |
5033639c | 1936 | o->call_depth++; |
9047ebbc MV |
1937 | /* |
1938 | * When the merge fails, the result contains files | |
1939 | * with conflict markers. The cleanness flag is | |
1940 | * ignored, it was never actually used, as result of | |
1941 | * merge_trees has always overwritten it: the committed | |
1942 | * "conflicts" were already resolved. | |
1943 | */ | |
1944 | discard_cache(); | |
8a2fce18 MV |
1945 | saved_b1 = o->branch1; |
1946 | saved_b2 = o->branch2; | |
1947 | o->branch1 = "Temporary merge branch 1"; | |
1948 | o->branch2 = "Temporary merge branch 2"; | |
1949 | merge_recursive(o, merged_common_ancestors, iter->item, | |
1950 | NULL, &merged_common_ancestors); | |
1951 | o->branch1 = saved_b1; | |
1952 | o->branch2 = saved_b2; | |
5033639c | 1953 | o->call_depth--; |
9047ebbc MV |
1954 | |
1955 | if (!merged_common_ancestors) | |
55653a68 | 1956 | die(_("merge returned no commit")); |
9047ebbc MV |
1957 | } |
1958 | ||
1959 | discard_cache(); | |
b7fa51da | 1960 | if (!o->call_depth) |
9047ebbc | 1961 | read_cache(); |
9047ebbc | 1962 | |
7ca56aa0 | 1963 | o->ancestor = "merged common ancestors"; |
8a2fce18 MV |
1964 | clean = merge_trees(o, h1->tree, h2->tree, merged_common_ancestors->tree, |
1965 | &mrtree); | |
9047ebbc | 1966 | |
b7fa51da | 1967 | if (o->call_depth) { |
9047ebbc MV |
1968 | *result = make_virtual_commit(mrtree, "merged tree"); |
1969 | commit_list_insert(h1, &(*result)->parents); | |
1970 | commit_list_insert(h2, &(*result)->parents->next); | |
1971 | } | |
c7d84924 | 1972 | flush_output(o); |
f31027c9 JH |
1973 | if (show(o, 2)) |
1974 | diff_warn_rename_limit("merge.renamelimit", | |
1975 | o->needed_rename_limit, 0); | |
9047ebbc MV |
1976 | return clean; |
1977 | } | |
1978 | ||
73118f89 SB |
1979 | static struct commit *get_ref(const unsigned char *sha1, const char *name) |
1980 | { | |
1981 | struct object *object; | |
1982 | ||
1983 | object = deref_tag(parse_object(sha1), name, strlen(name)); | |
1984 | if (!object) | |
1985 | return NULL; | |
1986 | if (object->type == OBJ_TREE) | |
1987 | return make_virtual_commit((struct tree*)object, name); | |
1988 | if (object->type != OBJ_COMMIT) | |
1989 | return NULL; | |
1990 | if (parse_commit((struct commit *)object)) | |
1991 | return NULL; | |
1992 | return (struct commit *)object; | |
1993 | } | |
1994 | ||
8a2fce18 MV |
1995 | int merge_recursive_generic(struct merge_options *o, |
1996 | const unsigned char *head, | |
1997 | const unsigned char *merge, | |
1998 | int num_base_list, | |
1999 | const unsigned char **base_list, | |
2000 | struct commit **result) | |
73118f89 | 2001 | { |
03b86647 | 2002 | int clean; |
73118f89 | 2003 | struct lock_file *lock = xcalloc(1, sizeof(struct lock_file)); |
8a2fce18 MV |
2004 | struct commit *head_commit = get_ref(head, o->branch1); |
2005 | struct commit *next_commit = get_ref(merge, o->branch2); | |
73118f89 SB |
2006 | struct commit_list *ca = NULL; |
2007 | ||
2008 | if (base_list) { | |
2009 | int i; | |
8a2fce18 | 2010 | for (i = 0; i < num_base_list; ++i) { |
73118f89 | 2011 | struct commit *base; |
8a2fce18 | 2012 | if (!(base = get_ref(base_list[i], sha1_to_hex(base_list[i])))) |
55653a68 | 2013 | return error(_("Could not parse object '%s'"), |
8a2fce18 | 2014 | sha1_to_hex(base_list[i])); |
73118f89 SB |
2015 | commit_list_insert(base, &ca); |
2016 | } | |
2017 | } | |
2018 | ||
03b86647 | 2019 | hold_locked_index(lock, 1); |
8a2fce18 MV |
2020 | clean = merge_recursive(o, head_commit, next_commit, ca, |
2021 | result); | |
73118f89 | 2022 | if (active_cache_changed && |
03b86647 | 2023 | write_locked_index(&the_index, lock, COMMIT_LOCK)) |
55653a68 | 2024 | return error(_("Unable to write index.")); |
73118f89 SB |
2025 | |
2026 | return clean ? 0 : 1; | |
2027 | } | |
2028 | ||
0e7bcb1b | 2029 | static void merge_recursive_config(struct merge_options *o) |
9047ebbc | 2030 | { |
0e7bcb1b TA |
2031 | git_config_get_int("merge.verbosity", &o->verbosity); |
2032 | git_config_get_int("diff.renamelimit", &o->diff_rename_limit); | |
2033 | git_config_get_int("merge.renamelimit", &o->merge_rename_limit); | |
2034 | git_config(git_xmerge_config, NULL); | |
9047ebbc MV |
2035 | } |
2036 | ||
8a2fce18 | 2037 | void init_merge_options(struct merge_options *o) |
9047ebbc | 2038 | { |
8a2fce18 MV |
2039 | memset(o, 0, sizeof(struct merge_options)); |
2040 | o->verbosity = 2; | |
2041 | o->buffer_output = 1; | |
2042 | o->diff_rename_limit = -1; | |
2043 | o->merge_rename_limit = -1; | |
7610fa57 | 2044 | o->renormalize = 0; |
d2b11eca | 2045 | o->detect_rename = 1; |
0e7bcb1b | 2046 | merge_recursive_config(o); |
9047ebbc | 2047 | if (getenv("GIT_MERGE_VERBOSITY")) |
8a2fce18 | 2048 | o->verbosity = |
9047ebbc | 2049 | strtol(getenv("GIT_MERGE_VERBOSITY"), NULL, 10); |
8a2fce18 MV |
2050 | if (o->verbosity >= 5) |
2051 | o->buffer_output = 0; | |
c7d84924 | 2052 | strbuf_init(&o->obuf, 0); |
f93d7c6f TA |
2053 | string_list_init(&o->current_file_set, 1); |
2054 | string_list_init(&o->current_directory_set, 1); | |
2055 | string_list_init(&o->df_conflict_file_set, 1); | |
9047ebbc | 2056 | } |
635a7bb1 JN |
2057 | |
2058 | int parse_merge_opt(struct merge_options *o, const char *s) | |
2059 | { | |
95b567c7 JK |
2060 | const char *arg; |
2061 | ||
635a7bb1 JN |
2062 | if (!s || !*s) |
2063 | return -1; | |
2064 | if (!strcmp(s, "ours")) | |
2065 | o->recursive_variant = MERGE_RECURSIVE_OURS; | |
2066 | else if (!strcmp(s, "theirs")) | |
2067 | o->recursive_variant = MERGE_RECURSIVE_THEIRS; | |
2068 | else if (!strcmp(s, "subtree")) | |
2069 | o->subtree_shift = ""; | |
95b567c7 JK |
2070 | else if (skip_prefix(s, "subtree=", &arg)) |
2071 | o->subtree_shift = arg; | |
58a1ece4 | 2072 | else if (!strcmp(s, "patience")) |
307ab20b | 2073 | o->xdl_opts = DIFF_WITH_ALG(o, PATIENCE_DIFF); |
8c912eea | 2074 | else if (!strcmp(s, "histogram")) |
307ab20b | 2075 | o->xdl_opts = DIFF_WITH_ALG(o, HISTOGRAM_DIFF); |
95b567c7 JK |
2076 | else if (skip_prefix(s, "diff-algorithm=", &arg)) { |
2077 | long value = parse_algorithm_value(arg); | |
07924d4d MP |
2078 | if (value < 0) |
2079 | return -1; | |
2080 | /* clear out previous settings */ | |
2081 | DIFF_XDL_CLR(o, NEED_MINIMAL); | |
2082 | o->xdl_opts &= ~XDF_DIFF_ALGORITHM_MASK; | |
2083 | o->xdl_opts |= value; | |
2084 | } | |
4e5dd044 JF |
2085 | else if (!strcmp(s, "ignore-space-change")) |
2086 | o->xdl_opts |= XDF_IGNORE_WHITESPACE_CHANGE; | |
2087 | else if (!strcmp(s, "ignore-all-space")) | |
2088 | o->xdl_opts |= XDF_IGNORE_WHITESPACE; | |
2089 | else if (!strcmp(s, "ignore-space-at-eol")) | |
2090 | o->xdl_opts |= XDF_IGNORE_WHITESPACE_AT_EOL; | |
635a7bb1 JN |
2091 | else if (!strcmp(s, "renormalize")) |
2092 | o->renormalize = 1; | |
2093 | else if (!strcmp(s, "no-renormalize")) | |
2094 | o->renormalize = 0; | |
d2b11eca FGA |
2095 | else if (!strcmp(s, "no-renames")) |
2096 | o->detect_rename = 0; | |
87892f60 | 2097 | else if (!strcmp(s, "find-renames")) { |
1b47ad16 | 2098 | o->detect_rename = 1; |
87892f60 FGA |
2099 | o->rename_score = 0; |
2100 | } | |
1b47ad16 FGA |
2101 | else if (skip_prefix(s, "find-renames=", &arg) || |
2102 | skip_prefix(s, "rename-threshold=", &arg)) { | |
95b567c7 | 2103 | if ((o->rename_score = parse_rename_score(&arg)) == -1 || *arg != 0) |
10ae7526 | 2104 | return -1; |
d2b11eca | 2105 | o->detect_rename = 1; |
10ae7526 | 2106 | } |
635a7bb1 JN |
2107 | else |
2108 | return -1; | |
2109 | return 0; | |
2110 | } |