]>
Commit | Line | Data |
---|---|---|
1 | /* | |
2 | * Recursive Merge algorithm stolen from git-merge-recursive.py by | |
3 | * Fredrik Kuivinen. | |
4 | * The thieves were Alex Riesen and Johannes Schindelin, in June/July 2006 | |
5 | */ | |
6 | #include "advice.h" | |
7 | #include "cache.h" | |
8 | #include "cache-tree.h" | |
9 | #include "commit.h" | |
10 | #include "blob.h" | |
11 | #include "builtin.h" | |
12 | #include "tree-walk.h" | |
13 | #include "diff.h" | |
14 | #include "diffcore.h" | |
15 | #include "tag.h" | |
16 | #include "unpack-trees.h" | |
17 | #include "string-list.h" | |
18 | #include "xdiff-interface.h" | |
19 | #include "ll-merge.h" | |
20 | #include "attr.h" | |
21 | #include "merge-recursive.h" | |
22 | #include "dir.h" | |
23 | #include "submodule.h" | |
24 | ||
25 | static struct tree *shift_tree_object(struct tree *one, struct tree *two, | |
26 | const char *subtree_shift) | |
27 | { | |
28 | unsigned char shifted[20]; | |
29 | ||
30 | if (!*subtree_shift) { | |
31 | shift_tree(one->object.sha1, two->object.sha1, shifted, 0); | |
32 | } else { | |
33 | shift_tree_by(one->object.sha1, two->object.sha1, shifted, | |
34 | subtree_shift); | |
35 | } | |
36 | if (!hashcmp(two->object.sha1, shifted)) | |
37 | return two; | |
38 | return lookup_tree(shifted); | |
39 | } | |
40 | ||
41 | /* | |
42 | * A virtual commit has (const char *)commit->util set to the name. | |
43 | */ | |
44 | ||
45 | static struct commit *make_virtual_commit(struct tree *tree, const char *comment) | |
46 | { | |
47 | struct commit *commit = xcalloc(1, sizeof(struct commit)); | |
48 | commit->tree = tree; | |
49 | commit->util = (void*)comment; | |
50 | /* avoid warnings */ | |
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 | ||
66 | enum rename_type { | |
67 | RENAME_NORMAL = 0, | |
68 | RENAME_DELETE, | |
69 | RENAME_ONE_FILE_TO_TWO | |
70 | }; | |
71 | ||
72 | struct rename_df_conflict_info { | |
73 | enum rename_type rename_type; | |
74 | struct diff_filepair *pair1; | |
75 | struct diff_filepair *pair2; | |
76 | const char *branch1; | |
77 | const char *branch2; | |
78 | struct stage_data *dst_entry1; | |
79 | struct stage_data *dst_entry2; | |
80 | }; | |
81 | ||
82 | /* | |
83 | * Since we want to write the index eventually, we cannot reuse the index | |
84 | * for these (temporary) data. | |
85 | */ | |
86 | struct stage_data | |
87 | { | |
88 | struct | |
89 | { | |
90 | unsigned mode; | |
91 | unsigned char sha[20]; | |
92 | } stages[4]; | |
93 | struct rename_df_conflict_info *rename_df_conflict_info; | |
94 | unsigned processed:1; | |
95 | }; | |
96 | ||
97 | static inline void setup_rename_df_conflict_info(enum rename_type rename_type, | |
98 | struct diff_filepair *pair1, | |
99 | struct diff_filepair *pair2, | |
100 | const char *branch1, | |
101 | const char *branch2, | |
102 | struct stage_data *dst_entry1, | |
103 | struct stage_data *dst_entry2) | |
104 | { | |
105 | struct rename_df_conflict_info *ci = xcalloc(1, sizeof(struct rename_df_conflict_info)); | |
106 | ci->rename_type = rename_type; | |
107 | ci->pair1 = pair1; | |
108 | ci->branch1 = branch1; | |
109 | ci->branch2 = branch2; | |
110 | ||
111 | ci->dst_entry1 = dst_entry1; | |
112 | dst_entry1->rename_df_conflict_info = ci; | |
113 | dst_entry1->processed = 0; | |
114 | ||
115 | assert(!pair2 == !dst_entry2); | |
116 | if (dst_entry2) { | |
117 | ci->dst_entry2 = dst_entry2; | |
118 | ci->pair2 = pair2; | |
119 | dst_entry2->rename_df_conflict_info = ci; | |
120 | dst_entry2->processed = 0; | |
121 | } | |
122 | } | |
123 | ||
124 | static int show(struct merge_options *o, int v) | |
125 | { | |
126 | return (!o->call_depth && o->verbosity >= v) || o->verbosity >= 5; | |
127 | } | |
128 | ||
129 | static void flush_output(struct merge_options *o) | |
130 | { | |
131 | if (o->obuf.len) { | |
132 | fputs(o->obuf.buf, stdout); | |
133 | strbuf_reset(&o->obuf); | |
134 | } | |
135 | } | |
136 | ||
137 | __attribute__((format (printf, 3, 4))) | |
138 | static void output(struct merge_options *o, int v, const char *fmt, ...) | |
139 | { | |
140 | int len; | |
141 | va_list ap; | |
142 | ||
143 | if (!show(o, v)) | |
144 | return; | |
145 | ||
146 | strbuf_grow(&o->obuf, o->call_depth * 2 + 2); | |
147 | memset(o->obuf.buf + o->obuf.len, ' ', o->call_depth * 2); | |
148 | strbuf_setlen(&o->obuf, o->obuf.len + o->call_depth * 2); | |
149 | ||
150 | va_start(ap, fmt); | |
151 | len = vsnprintf(o->obuf.buf + o->obuf.len, strbuf_avail(&o->obuf), fmt, ap); | |
152 | va_end(ap); | |
153 | ||
154 | if (len < 0) | |
155 | len = 0; | |
156 | if (len >= strbuf_avail(&o->obuf)) { | |
157 | strbuf_grow(&o->obuf, len + 2); | |
158 | va_start(ap, fmt); | |
159 | len = vsnprintf(o->obuf.buf + o->obuf.len, strbuf_avail(&o->obuf), fmt, ap); | |
160 | va_end(ap); | |
161 | if (len >= strbuf_avail(&o->obuf)) { | |
162 | die("this should not happen, your snprintf is broken"); | |
163 | } | |
164 | } | |
165 | strbuf_setlen(&o->obuf, o->obuf.len + len); | |
166 | strbuf_add(&o->obuf, "\n", 1); | |
167 | if (!o->buffer_output) | |
168 | flush_output(o); | |
169 | } | |
170 | ||
171 | static void output_commit_title(struct merge_options *o, struct commit *commit) | |
172 | { | |
173 | int i; | |
174 | flush_output(o); | |
175 | for (i = o->call_depth; i--;) | |
176 | fputs(" ", stdout); | |
177 | if (commit->util) | |
178 | printf("virtual %s\n", (char *)commit->util); | |
179 | else { | |
180 | printf("%s ", find_unique_abbrev(commit->object.sha1, DEFAULT_ABBREV)); | |
181 | if (parse_commit(commit) != 0) | |
182 | printf("(bad commit)\n"); | |
183 | else { | |
184 | const char *title; | |
185 | int len = find_commit_subject(commit->buffer, &title); | |
186 | if (len) | |
187 | printf("%.*s\n", len, title); | |
188 | } | |
189 | } | |
190 | } | |
191 | ||
192 | static int add_cacheinfo(unsigned int mode, const unsigned char *sha1, | |
193 | const char *path, int stage, int refresh, int options) | |
194 | { | |
195 | struct cache_entry *ce; | |
196 | ce = make_cache_entry(mode, sha1 ? sha1 : null_sha1, path, stage, refresh); | |
197 | if (!ce) | |
198 | return error("addinfo_cache failed for path '%s'", path); | |
199 | return add_cache_entry(ce, options); | |
200 | } | |
201 | ||
202 | static void init_tree_desc_from_tree(struct tree_desc *desc, struct tree *tree) | |
203 | { | |
204 | parse_tree(tree); | |
205 | init_tree_desc(desc, tree->buffer, tree->size); | |
206 | } | |
207 | ||
208 | static int git_merge_trees(int index_only, | |
209 | struct tree *common, | |
210 | struct tree *head, | |
211 | struct tree *merge) | |
212 | { | |
213 | int rc; | |
214 | struct tree_desc t[3]; | |
215 | struct unpack_trees_options opts; | |
216 | ||
217 | memset(&opts, 0, sizeof(opts)); | |
218 | if (index_only) | |
219 | opts.index_only = 1; | |
220 | else | |
221 | opts.update = 1; | |
222 | opts.merge = 1; | |
223 | opts.head_idx = 2; | |
224 | opts.fn = threeway_merge; | |
225 | opts.src_index = &the_index; | |
226 | opts.dst_index = &the_index; | |
227 | setup_unpack_trees_porcelain(&opts, "merge"); | |
228 | ||
229 | init_tree_desc_from_tree(t+0, common); | |
230 | init_tree_desc_from_tree(t+1, head); | |
231 | init_tree_desc_from_tree(t+2, merge); | |
232 | ||
233 | rc = unpack_trees(3, t, &opts); | |
234 | cache_tree_free(&active_cache_tree); | |
235 | return rc; | |
236 | } | |
237 | ||
238 | struct tree *write_tree_from_memory(struct merge_options *o) | |
239 | { | |
240 | struct tree *result = NULL; | |
241 | ||
242 | if (unmerged_cache()) { | |
243 | int i; | |
244 | fprintf(stderr, "BUG: There are unmerged index entries:\n"); | |
245 | for (i = 0; i < active_nr; i++) { | |
246 | struct cache_entry *ce = active_cache[i]; | |
247 | if (ce_stage(ce)) | |
248 | fprintf(stderr, "BUG: %d %.*s", ce_stage(ce), | |
249 | (int)ce_namelen(ce), ce->name); | |
250 | } | |
251 | die("Bug in merge-recursive.c"); | |
252 | } | |
253 | ||
254 | if (!active_cache_tree) | |
255 | active_cache_tree = cache_tree(); | |
256 | ||
257 | if (!cache_tree_fully_valid(active_cache_tree) && | |
258 | cache_tree_update(active_cache_tree, | |
259 | active_cache, active_nr, 0, 0) < 0) | |
260 | die("error building trees"); | |
261 | ||
262 | result = lookup_tree(active_cache_tree->sha1); | |
263 | ||
264 | return result; | |
265 | } | |
266 | ||
267 | static int save_files_dirs(const unsigned char *sha1, | |
268 | const char *base, int baselen, const char *path, | |
269 | unsigned int mode, int stage, void *context) | |
270 | { | |
271 | int len = strlen(path); | |
272 | char *newpath = xmalloc(baselen + len + 1); | |
273 | struct merge_options *o = context; | |
274 | ||
275 | memcpy(newpath, base, baselen); | |
276 | memcpy(newpath + baselen, path, len); | |
277 | newpath[baselen + len] = '\0'; | |
278 | ||
279 | if (S_ISDIR(mode)) | |
280 | string_list_insert(&o->current_directory_set, newpath); | |
281 | else | |
282 | string_list_insert(&o->current_file_set, newpath); | |
283 | free(newpath); | |
284 | ||
285 | return (S_ISDIR(mode) ? READ_TREE_RECURSIVE : 0); | |
286 | } | |
287 | ||
288 | static int get_files_dirs(struct merge_options *o, struct tree *tree) | |
289 | { | |
290 | int n; | |
291 | if (read_tree_recursive(tree, "", 0, 0, NULL, save_files_dirs, o)) | |
292 | return 0; | |
293 | n = o->current_file_set.nr + o->current_directory_set.nr; | |
294 | return n; | |
295 | } | |
296 | ||
297 | /* | |
298 | * Returns an index_entry instance which doesn't have to correspond to | |
299 | * a real cache entry in Git's index. | |
300 | */ | |
301 | static struct stage_data *insert_stage_data(const char *path, | |
302 | struct tree *o, struct tree *a, struct tree *b, | |
303 | struct string_list *entries) | |
304 | { | |
305 | struct string_list_item *item; | |
306 | struct stage_data *e = xcalloc(1, sizeof(struct stage_data)); | |
307 | get_tree_entry(o->object.sha1, path, | |
308 | e->stages[1].sha, &e->stages[1].mode); | |
309 | get_tree_entry(a->object.sha1, path, | |
310 | e->stages[2].sha, &e->stages[2].mode); | |
311 | get_tree_entry(b->object.sha1, path, | |
312 | e->stages[3].sha, &e->stages[3].mode); | |
313 | item = string_list_insert(entries, path); | |
314 | item->util = e; | |
315 | return e; | |
316 | } | |
317 | ||
318 | /* | |
319 | * Create a dictionary mapping file names to stage_data objects. The | |
320 | * dictionary contains one entry for every path with a non-zero stage entry. | |
321 | */ | |
322 | static struct string_list *get_unmerged(void) | |
323 | { | |
324 | struct string_list *unmerged = xcalloc(1, sizeof(struct string_list)); | |
325 | int i; | |
326 | ||
327 | unmerged->strdup_strings = 1; | |
328 | ||
329 | for (i = 0; i < active_nr; i++) { | |
330 | struct string_list_item *item; | |
331 | struct stage_data *e; | |
332 | struct cache_entry *ce = active_cache[i]; | |
333 | if (!ce_stage(ce)) | |
334 | continue; | |
335 | ||
336 | item = string_list_lookup(unmerged, ce->name); | |
337 | if (!item) { | |
338 | item = string_list_insert(unmerged, ce->name); | |
339 | item->util = xcalloc(1, sizeof(struct stage_data)); | |
340 | } | |
341 | e = item->util; | |
342 | e->stages[ce_stage(ce)].mode = ce->ce_mode; | |
343 | hashcpy(e->stages[ce_stage(ce)].sha, ce->sha1); | |
344 | } | |
345 | ||
346 | return unmerged; | |
347 | } | |
348 | ||
349 | struct rename | |
350 | { | |
351 | struct diff_filepair *pair; | |
352 | struct stage_data *src_entry; | |
353 | struct stage_data *dst_entry; | |
354 | unsigned processed:1; | |
355 | }; | |
356 | ||
357 | /* | |
358 | * Get information of all renames which occurred between 'o_tree' and | |
359 | * 'tree'. We need the three trees in the merge ('o_tree', 'a_tree' and | |
360 | * 'b_tree') to be able to associate the correct cache entries with | |
361 | * the rename information. 'tree' is always equal to either a_tree or b_tree. | |
362 | */ | |
363 | static struct string_list *get_renames(struct merge_options *o, | |
364 | struct tree *tree, | |
365 | struct tree *o_tree, | |
366 | struct tree *a_tree, | |
367 | struct tree *b_tree, | |
368 | struct string_list *entries) | |
369 | { | |
370 | int i; | |
371 | struct string_list *renames; | |
372 | struct diff_options opts; | |
373 | ||
374 | renames = xcalloc(1, sizeof(struct string_list)); | |
375 | diff_setup(&opts); | |
376 | DIFF_OPT_SET(&opts, RECURSIVE); | |
377 | opts.detect_rename = DIFF_DETECT_RENAME; | |
378 | opts.rename_limit = o->merge_rename_limit >= 0 ? o->merge_rename_limit : | |
379 | o->diff_rename_limit >= 0 ? o->diff_rename_limit : | |
380 | 500; | |
381 | opts.warn_on_too_large_rename = 1; | |
382 | opts.output_format = DIFF_FORMAT_NO_OUTPUT; | |
383 | if (diff_setup_done(&opts) < 0) | |
384 | die("diff setup failed"); | |
385 | diff_tree_sha1(o_tree->object.sha1, tree->object.sha1, "", &opts); | |
386 | diffcore_std(&opts); | |
387 | for (i = 0; i < diff_queued_diff.nr; ++i) { | |
388 | struct string_list_item *item; | |
389 | struct rename *re; | |
390 | struct diff_filepair *pair = diff_queued_diff.queue[i]; | |
391 | if (pair->status != 'R') { | |
392 | diff_free_filepair(pair); | |
393 | continue; | |
394 | } | |
395 | re = xmalloc(sizeof(*re)); | |
396 | re->processed = 0; | |
397 | re->pair = pair; | |
398 | item = string_list_lookup(entries, re->pair->one->path); | |
399 | if (!item) | |
400 | re->src_entry = insert_stage_data(re->pair->one->path, | |
401 | o_tree, a_tree, b_tree, entries); | |
402 | else | |
403 | re->src_entry = item->util; | |
404 | ||
405 | item = string_list_lookup(entries, re->pair->two->path); | |
406 | if (!item) | |
407 | re->dst_entry = insert_stage_data(re->pair->two->path, | |
408 | o_tree, a_tree, b_tree, entries); | |
409 | else | |
410 | re->dst_entry = item->util; | |
411 | item = string_list_insert(renames, pair->one->path); | |
412 | item->util = re; | |
413 | } | |
414 | opts.output_format = DIFF_FORMAT_NO_OUTPUT; | |
415 | diff_queued_diff.nr = 0; | |
416 | diff_flush(&opts); | |
417 | return renames; | |
418 | } | |
419 | ||
420 | static int update_stages_options(const char *path, struct diff_filespec *o, | |
421 | struct diff_filespec *a, struct diff_filespec *b, | |
422 | int clear, int options) | |
423 | { | |
424 | if (clear) | |
425 | if (remove_file_from_cache(path)) | |
426 | return -1; | |
427 | if (o) | |
428 | if (add_cacheinfo(o->mode, o->sha1, path, 1, 0, options)) | |
429 | return -1; | |
430 | if (a) | |
431 | if (add_cacheinfo(a->mode, a->sha1, path, 2, 0, options)) | |
432 | return -1; | |
433 | if (b) | |
434 | if (add_cacheinfo(b->mode, b->sha1, path, 3, 0, options)) | |
435 | return -1; | |
436 | return 0; | |
437 | } | |
438 | ||
439 | static int update_stages(const char *path, struct diff_filespec *o, | |
440 | struct diff_filespec *a, struct diff_filespec *b, | |
441 | int clear) | |
442 | { | |
443 | int options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_OK_TO_REPLACE; | |
444 | return update_stages_options(path, o, a, b, clear, options); | |
445 | } | |
446 | ||
447 | static int update_stages_and_entry(const char *path, | |
448 | struct stage_data *entry, | |
449 | struct diff_filespec *o, | |
450 | struct diff_filespec *a, | |
451 | struct diff_filespec *b, | |
452 | int clear) | |
453 | { | |
454 | int options; | |
455 | ||
456 | entry->processed = 0; | |
457 | entry->stages[1].mode = o->mode; | |
458 | entry->stages[2].mode = a->mode; | |
459 | entry->stages[3].mode = b->mode; | |
460 | hashcpy(entry->stages[1].sha, o->sha1); | |
461 | hashcpy(entry->stages[2].sha, a->sha1); | |
462 | hashcpy(entry->stages[3].sha, b->sha1); | |
463 | options = ADD_CACHE_OK_TO_ADD | ADD_CACHE_SKIP_DFCHECK; | |
464 | return update_stages_options(path, o, a, b, clear, options); | |
465 | } | |
466 | ||
467 | static int remove_file(struct merge_options *o, int clean, | |
468 | const char *path, int no_wd) | |
469 | { | |
470 | int update_cache = o->call_depth || clean; | |
471 | int update_working_directory = !o->call_depth && !no_wd; | |
472 | ||
473 | if (update_cache) { | |
474 | if (remove_file_from_cache(path)) | |
475 | return -1; | |
476 | } | |
477 | if (update_working_directory) { | |
478 | if (remove_path(path)) | |
479 | return -1; | |
480 | } | |
481 | return 0; | |
482 | } | |
483 | ||
484 | static char *unique_path(struct merge_options *o, const char *path, const char *branch) | |
485 | { | |
486 | char *newpath = xmalloc(strlen(path) + 1 + strlen(branch) + 8 + 1); | |
487 | int suffix = 0; | |
488 | struct stat st; | |
489 | char *p = newpath + strlen(path); | |
490 | strcpy(newpath, path); | |
491 | *(p++) = '~'; | |
492 | strcpy(p, branch); | |
493 | for (; *p; ++p) | |
494 | if ('/' == *p) | |
495 | *p = '_'; | |
496 | while (string_list_has_string(&o->current_file_set, newpath) || | |
497 | string_list_has_string(&o->current_directory_set, newpath) || | |
498 | lstat(newpath, &st) == 0) | |
499 | sprintf(p, "_%d", suffix++); | |
500 | ||
501 | string_list_insert(&o->current_file_set, newpath); | |
502 | return newpath; | |
503 | } | |
504 | ||
505 | static void flush_buffer(int fd, const char *buf, unsigned long size) | |
506 | { | |
507 | while (size > 0) { | |
508 | long ret = write_in_full(fd, buf, size); | |
509 | if (ret < 0) { | |
510 | /* Ignore epipe */ | |
511 | if (errno == EPIPE) | |
512 | break; | |
513 | die_errno("merge-recursive"); | |
514 | } else if (!ret) { | |
515 | die("merge-recursive: disk full?"); | |
516 | } | |
517 | size -= ret; | |
518 | buf += ret; | |
519 | } | |
520 | } | |
521 | ||
522 | static int would_lose_untracked(const char *path) | |
523 | { | |
524 | int pos = cache_name_pos(path, strlen(path)); | |
525 | ||
526 | if (pos < 0) | |
527 | pos = -1 - pos; | |
528 | while (pos < active_nr && | |
529 | !strcmp(path, active_cache[pos]->name)) { | |
530 | /* | |
531 | * If stage #0, it is definitely tracked. | |
532 | * If it has stage #2 then it was tracked | |
533 | * before this merge started. All other | |
534 | * cases the path was not tracked. | |
535 | */ | |
536 | switch (ce_stage(active_cache[pos])) { | |
537 | case 0: | |
538 | case 2: | |
539 | return 0; | |
540 | } | |
541 | pos++; | |
542 | } | |
543 | return file_exists(path); | |
544 | } | |
545 | ||
546 | static int make_room_for_path(const char *path) | |
547 | { | |
548 | int status; | |
549 | const char *msg = "failed to create path '%s'%s"; | |
550 | ||
551 | status = safe_create_leading_directories_const(path); | |
552 | if (status) { | |
553 | if (status == -3) { | |
554 | /* something else exists */ | |
555 | error(msg, path, ": perhaps a D/F conflict?"); | |
556 | return -1; | |
557 | } | |
558 | die(msg, path, ""); | |
559 | } | |
560 | ||
561 | /* | |
562 | * Do not unlink a file in the work tree if we are not | |
563 | * tracking it. | |
564 | */ | |
565 | if (would_lose_untracked(path)) | |
566 | return error("refusing to lose untracked file at '%s'", | |
567 | path); | |
568 | ||
569 | /* Successful unlink is good.. */ | |
570 | if (!unlink(path)) | |
571 | return 0; | |
572 | /* .. and so is no existing file */ | |
573 | if (errno == ENOENT) | |
574 | return 0; | |
575 | /* .. but not some other error (who really cares what?) */ | |
576 | return error(msg, path, ": perhaps a D/F conflict?"); | |
577 | } | |
578 | ||
579 | static void update_file_flags(struct merge_options *o, | |
580 | const unsigned char *sha, | |
581 | unsigned mode, | |
582 | const char *path, | |
583 | int update_cache, | |
584 | int update_wd) | |
585 | { | |
586 | if (o->call_depth) | |
587 | update_wd = 0; | |
588 | ||
589 | if (update_wd) { | |
590 | enum object_type type; | |
591 | void *buf; | |
592 | unsigned long size; | |
593 | ||
594 | if (S_ISGITLINK(mode)) { | |
595 | /* | |
596 | * We may later decide to recursively descend into | |
597 | * the submodule directory and update its index | |
598 | * and/or work tree, but we do not do that now. | |
599 | */ | |
600 | update_wd = 0; | |
601 | goto update_index; | |
602 | } | |
603 | ||
604 | buf = read_sha1_file(sha, &type, &size); | |
605 | if (!buf) | |
606 | die("cannot read object %s '%s'", sha1_to_hex(sha), path); | |
607 | if (type != OBJ_BLOB) | |
608 | die("blob expected for %s '%s'", sha1_to_hex(sha), path); | |
609 | if (S_ISREG(mode)) { | |
610 | struct strbuf strbuf = STRBUF_INIT; | |
611 | if (convert_to_working_tree(path, buf, size, &strbuf)) { | |
612 | free(buf); | |
613 | size = strbuf.len; | |
614 | buf = strbuf_detach(&strbuf, NULL); | |
615 | } | |
616 | } | |
617 | ||
618 | if (make_room_for_path(path) < 0) { | |
619 | update_wd = 0; | |
620 | free(buf); | |
621 | goto update_index; | |
622 | } | |
623 | if (S_ISREG(mode) || (!has_symlinks && S_ISLNK(mode))) { | |
624 | int fd; | |
625 | if (mode & 0100) | |
626 | mode = 0777; | |
627 | else | |
628 | mode = 0666; | |
629 | fd = open(path, O_WRONLY | O_TRUNC | O_CREAT, mode); | |
630 | if (fd < 0) | |
631 | die_errno("failed to open '%s'", path); | |
632 | flush_buffer(fd, buf, size); | |
633 | close(fd); | |
634 | } else if (S_ISLNK(mode)) { | |
635 | char *lnk = xmemdupz(buf, size); | |
636 | safe_create_leading_directories_const(path); | |
637 | unlink(path); | |
638 | if (symlink(lnk, path)) | |
639 | die_errno("failed to symlink '%s'", path); | |
640 | free(lnk); | |
641 | } else | |
642 | die("do not know what to do with %06o %s '%s'", | |
643 | mode, sha1_to_hex(sha), path); | |
644 | free(buf); | |
645 | } | |
646 | update_index: | |
647 | if (update_cache) | |
648 | add_cacheinfo(mode, sha, path, 0, update_wd, ADD_CACHE_OK_TO_ADD); | |
649 | } | |
650 | ||
651 | static void update_file(struct merge_options *o, | |
652 | int clean, | |
653 | const unsigned char *sha, | |
654 | unsigned mode, | |
655 | const char *path) | |
656 | { | |
657 | update_file_flags(o, sha, mode, path, o->call_depth || clean, !o->call_depth); | |
658 | } | |
659 | ||
660 | /* Low level file merging, update and removal */ | |
661 | ||
662 | struct merge_file_info | |
663 | { | |
664 | unsigned char sha[20]; | |
665 | unsigned mode; | |
666 | unsigned clean:1, | |
667 | merge:1; | |
668 | }; | |
669 | ||
670 | static int merge_3way(struct merge_options *o, | |
671 | mmbuffer_t *result_buf, | |
672 | struct diff_filespec *one, | |
673 | struct diff_filespec *a, | |
674 | struct diff_filespec *b, | |
675 | const char *branch1, | |
676 | const char *branch2) | |
677 | { | |
678 | mmfile_t orig, src1, src2; | |
679 | char *base_name, *name1, *name2; | |
680 | int merge_status; | |
681 | int favor; | |
682 | ||
683 | if (o->call_depth) | |
684 | favor = 0; | |
685 | else { | |
686 | switch (o->recursive_variant) { | |
687 | case MERGE_RECURSIVE_OURS: | |
688 | favor = XDL_MERGE_FAVOR_OURS; | |
689 | break; | |
690 | case MERGE_RECURSIVE_THEIRS: | |
691 | favor = XDL_MERGE_FAVOR_THEIRS; | |
692 | break; | |
693 | default: | |
694 | favor = 0; | |
695 | break; | |
696 | } | |
697 | } | |
698 | ||
699 | if (strcmp(a->path, b->path) || | |
700 | (o->ancestor != NULL && strcmp(a->path, one->path) != 0)) { | |
701 | base_name = o->ancestor == NULL ? NULL : | |
702 | xstrdup(mkpath("%s:%s", o->ancestor, one->path)); | |
703 | name1 = xstrdup(mkpath("%s:%s", branch1, a->path)); | |
704 | name2 = xstrdup(mkpath("%s:%s", branch2, b->path)); | |
705 | } else { | |
706 | base_name = o->ancestor == NULL ? NULL : | |
707 | xstrdup(mkpath("%s", o->ancestor)); | |
708 | name1 = xstrdup(mkpath("%s", branch1)); | |
709 | name2 = xstrdup(mkpath("%s", branch2)); | |
710 | } | |
711 | ||
712 | read_mmblob(&orig, one->sha1); | |
713 | read_mmblob(&src1, a->sha1); | |
714 | read_mmblob(&src2, b->sha1); | |
715 | ||
716 | merge_status = ll_merge(result_buf, a->path, &orig, base_name, | |
717 | &src1, name1, &src2, name2, | |
718 | ((o->call_depth ? LL_OPT_VIRTUAL_ANCESTOR : 0) | | |
719 | (o->renormalize ? LL_OPT_RENORMALIZE : 0) | | |
720 | create_ll_flag(favor))); | |
721 | ||
722 | free(name1); | |
723 | free(name2); | |
724 | free(orig.ptr); | |
725 | free(src1.ptr); | |
726 | free(src2.ptr); | |
727 | return merge_status; | |
728 | } | |
729 | ||
730 | static struct merge_file_info merge_file(struct merge_options *o, | |
731 | struct diff_filespec *one, | |
732 | struct diff_filespec *a, | |
733 | struct diff_filespec *b, | |
734 | const char *branch1, | |
735 | const char *branch2) | |
736 | { | |
737 | struct merge_file_info result; | |
738 | result.merge = 0; | |
739 | result.clean = 1; | |
740 | ||
741 | if ((S_IFMT & a->mode) != (S_IFMT & b->mode)) { | |
742 | result.clean = 0; | |
743 | if (S_ISREG(a->mode)) { | |
744 | result.mode = a->mode; | |
745 | hashcpy(result.sha, a->sha1); | |
746 | } else { | |
747 | result.mode = b->mode; | |
748 | hashcpy(result.sha, b->sha1); | |
749 | } | |
750 | } else { | |
751 | if (!sha_eq(a->sha1, one->sha1) && !sha_eq(b->sha1, one->sha1)) | |
752 | result.merge = 1; | |
753 | ||
754 | /* | |
755 | * Merge modes | |
756 | */ | |
757 | if (a->mode == b->mode || a->mode == one->mode) | |
758 | result.mode = b->mode; | |
759 | else { | |
760 | result.mode = a->mode; | |
761 | if (b->mode != one->mode) { | |
762 | result.clean = 0; | |
763 | result.merge = 1; | |
764 | } | |
765 | } | |
766 | ||
767 | if (sha_eq(a->sha1, b->sha1) || sha_eq(a->sha1, one->sha1)) | |
768 | hashcpy(result.sha, b->sha1); | |
769 | else if (sha_eq(b->sha1, one->sha1)) | |
770 | hashcpy(result.sha, a->sha1); | |
771 | else if (S_ISREG(a->mode)) { | |
772 | mmbuffer_t result_buf; | |
773 | int merge_status; | |
774 | ||
775 | merge_status = merge_3way(o, &result_buf, one, a, b, | |
776 | branch1, branch2); | |
777 | ||
778 | if ((merge_status < 0) || !result_buf.ptr) | |
779 | die("Failed to execute internal merge"); | |
780 | ||
781 | if (write_sha1_file(result_buf.ptr, result_buf.size, | |
782 | blob_type, result.sha)) | |
783 | die("Unable to add %s to database", | |
784 | a->path); | |
785 | ||
786 | free(result_buf.ptr); | |
787 | result.clean = (merge_status == 0); | |
788 | } else if (S_ISGITLINK(a->mode)) { | |
789 | result.clean = merge_submodule(result.sha, one->path, one->sha1, | |
790 | a->sha1, b->sha1); | |
791 | } else if (S_ISLNK(a->mode)) { | |
792 | hashcpy(result.sha, a->sha1); | |
793 | ||
794 | if (!sha_eq(a->sha1, b->sha1)) | |
795 | result.clean = 0; | |
796 | } else { | |
797 | die("unsupported object type in the tree"); | |
798 | } | |
799 | } | |
800 | ||
801 | return result; | |
802 | } | |
803 | ||
804 | static void conflict_rename_delete(struct merge_options *o, | |
805 | struct diff_filepair *pair, | |
806 | const char *rename_branch, | |
807 | const char *other_branch) | |
808 | { | |
809 | char *dest_name = pair->two->path; | |
810 | ||
811 | output(o, 1, "CONFLICT (rename/delete): Rename %s->%s in %s " | |
812 | "and deleted in %s", | |
813 | pair->one->path, pair->two->path, rename_branch, | |
814 | other_branch); | |
815 | if (!o->call_depth) | |
816 | update_stages(dest_name, NULL, | |
817 | rename_branch == o->branch1 ? pair->two : NULL, | |
818 | rename_branch == o->branch1 ? NULL : pair->two, | |
819 | 1); | |
820 | update_file(o, 0, pair->two->sha1, pair->two->mode, dest_name); | |
821 | } | |
822 | ||
823 | static void conflict_rename_rename_1to2(struct merge_options *o, | |
824 | struct rename *ren1, | |
825 | const char *branch1, | |
826 | struct rename *ren2, | |
827 | const char *branch2) | |
828 | { | |
829 | /* One file was renamed in both branches, but to different names. */ | |
830 | char *del[2]; | |
831 | int delp = 0; | |
832 | const char *ren1_dst = ren1->pair->two->path; | |
833 | const char *ren2_dst = ren2->pair->two->path; | |
834 | const char *dst_name1 = ren1_dst; | |
835 | const char *dst_name2 = ren2_dst; | |
836 | if (string_list_has_string(&o->current_directory_set, ren1_dst)) { | |
837 | dst_name1 = del[delp++] = unique_path(o, ren1_dst, branch1); | |
838 | output(o, 1, "%s is a directory in %s adding as %s instead", | |
839 | ren1_dst, branch2, dst_name1); | |
840 | remove_file(o, 0, ren1_dst, 0); | |
841 | } | |
842 | if (string_list_has_string(&o->current_directory_set, ren2_dst)) { | |
843 | dst_name2 = del[delp++] = unique_path(o, ren2_dst, branch2); | |
844 | output(o, 1, "%s is a directory in %s adding as %s instead", | |
845 | ren2_dst, branch1, dst_name2); | |
846 | remove_file(o, 0, ren2_dst, 0); | |
847 | } | |
848 | if (o->call_depth) { | |
849 | remove_file_from_cache(dst_name1); | |
850 | remove_file_from_cache(dst_name2); | |
851 | /* | |
852 | * Uncomment to leave the conflicting names in the resulting tree | |
853 | * | |
854 | * update_file(o, 0, ren1->pair->two->sha1, ren1->pair->two->mode, dst_name1); | |
855 | * update_file(o, 0, ren2->pair->two->sha1, ren2->pair->two->mode, dst_name2); | |
856 | */ | |
857 | } else { | |
858 | update_stages(dst_name1, NULL, ren1->pair->two, NULL, 1); | |
859 | update_stages(dst_name2, NULL, NULL, ren2->pair->two, 1); | |
860 | } | |
861 | while (delp--) | |
862 | free(del[delp]); | |
863 | } | |
864 | ||
865 | static void conflict_rename_rename_2to1(struct merge_options *o, | |
866 | struct rename *ren1, | |
867 | const char *branch1, | |
868 | struct rename *ren2, | |
869 | const char *branch2) | |
870 | { | |
871 | /* Two files were renamed to the same thing. */ | |
872 | char *new_path1 = unique_path(o, ren1->pair->two->path, branch1); | |
873 | char *new_path2 = unique_path(o, ren2->pair->two->path, branch2); | |
874 | output(o, 1, "Renaming %s to %s and %s to %s instead", | |
875 | ren1->pair->one->path, new_path1, | |
876 | ren2->pair->one->path, new_path2); | |
877 | remove_file(o, 0, ren1->pair->two->path, 0); | |
878 | update_file(o, 0, ren1->pair->two->sha1, ren1->pair->two->mode, new_path1); | |
879 | update_file(o, 0, ren2->pair->two->sha1, ren2->pair->two->mode, new_path2); | |
880 | free(new_path2); | |
881 | free(new_path1); | |
882 | } | |
883 | ||
884 | static int process_renames(struct merge_options *o, | |
885 | struct string_list *a_renames, | |
886 | struct string_list *b_renames) | |
887 | { | |
888 | int clean_merge = 1, i, j; | |
889 | struct string_list a_by_dst = STRING_LIST_INIT_NODUP; | |
890 | struct string_list b_by_dst = STRING_LIST_INIT_NODUP; | |
891 | const struct rename *sre; | |
892 | ||
893 | for (i = 0; i < a_renames->nr; i++) { | |
894 | sre = a_renames->items[i].util; | |
895 | string_list_insert(&a_by_dst, sre->pair->two->path)->util | |
896 | = sre->dst_entry; | |
897 | } | |
898 | for (i = 0; i < b_renames->nr; i++) { | |
899 | sre = b_renames->items[i].util; | |
900 | string_list_insert(&b_by_dst, sre->pair->two->path)->util | |
901 | = sre->dst_entry; | |
902 | } | |
903 | ||
904 | for (i = 0, j = 0; i < a_renames->nr || j < b_renames->nr;) { | |
905 | char *src; | |
906 | struct string_list *renames1, *renames2Dst; | |
907 | struct rename *ren1 = NULL, *ren2 = NULL; | |
908 | const char *branch1, *branch2; | |
909 | const char *ren1_src, *ren1_dst; | |
910 | ||
911 | if (i >= a_renames->nr) { | |
912 | ren2 = b_renames->items[j++].util; | |
913 | } else if (j >= b_renames->nr) { | |
914 | ren1 = a_renames->items[i++].util; | |
915 | } else { | |
916 | int compare = strcmp(a_renames->items[i].string, | |
917 | b_renames->items[j].string); | |
918 | if (compare <= 0) | |
919 | ren1 = a_renames->items[i++].util; | |
920 | if (compare >= 0) | |
921 | ren2 = b_renames->items[j++].util; | |
922 | } | |
923 | ||
924 | /* TODO: refactor, so that 1/2 are not needed */ | |
925 | if (ren1) { | |
926 | renames1 = a_renames; | |
927 | renames2Dst = &b_by_dst; | |
928 | branch1 = o->branch1; | |
929 | branch2 = o->branch2; | |
930 | } else { | |
931 | struct rename *tmp; | |
932 | renames1 = b_renames; | |
933 | renames2Dst = &a_by_dst; | |
934 | branch1 = o->branch2; | |
935 | branch2 = o->branch1; | |
936 | tmp = ren2; | |
937 | ren2 = ren1; | |
938 | ren1 = tmp; | |
939 | } | |
940 | src = ren1->pair->one->path; | |
941 | ||
942 | ren1->dst_entry->processed = 1; | |
943 | ren1->src_entry->processed = 1; | |
944 | ||
945 | if (ren1->processed) | |
946 | continue; | |
947 | ren1->processed = 1; | |
948 | ||
949 | ren1_src = ren1->pair->one->path; | |
950 | ren1_dst = ren1->pair->two->path; | |
951 | ||
952 | if (ren2) { | |
953 | const char *ren2_src = ren2->pair->one->path; | |
954 | const char *ren2_dst = ren2->pair->two->path; | |
955 | /* Renamed in 1 and renamed in 2 */ | |
956 | if (strcmp(ren1_src, ren2_src) != 0) | |
957 | die("ren1.src != ren2.src"); | |
958 | ren2->dst_entry->processed = 1; | |
959 | ren2->processed = 1; | |
960 | if (strcmp(ren1_dst, ren2_dst) != 0) { | |
961 | clean_merge = 0; | |
962 | output(o, 1, "CONFLICT (rename/rename): " | |
963 | "Rename \"%s\"->\"%s\" in branch \"%s\" " | |
964 | "rename \"%s\"->\"%s\" in \"%s\"%s", | |
965 | src, ren1_dst, branch1, | |
966 | src, ren2_dst, branch2, | |
967 | o->call_depth ? " (left unresolved)": ""); | |
968 | if (o->call_depth) { | |
969 | remove_file_from_cache(src); | |
970 | update_file(o, 0, ren1->pair->one->sha1, | |
971 | ren1->pair->one->mode, src); | |
972 | } | |
973 | conflict_rename_rename_1to2(o, ren1, branch1, ren2, branch2); | |
974 | } else { | |
975 | struct merge_file_info mfi; | |
976 | remove_file(o, 1, ren1_src, 1); | |
977 | mfi = merge_file(o, | |
978 | ren1->pair->one, | |
979 | ren1->pair->two, | |
980 | ren2->pair->two, | |
981 | branch1, | |
982 | branch2); | |
983 | if (mfi.merge || !mfi.clean) | |
984 | output(o, 1, "Renaming %s->%s", src, ren1_dst); | |
985 | ||
986 | if (mfi.merge) | |
987 | output(o, 2, "Auto-merging %s", ren1_dst); | |
988 | ||
989 | if (!mfi.clean) { | |
990 | output(o, 1, "CONFLICT (content): merge conflict in %s", | |
991 | ren1_dst); | |
992 | clean_merge = 0; | |
993 | ||
994 | if (!o->call_depth) | |
995 | update_stages(ren1_dst, | |
996 | ren1->pair->one, | |
997 | ren1->pair->two, | |
998 | ren2->pair->two, | |
999 | 1 /* clear */); | |
1000 | } | |
1001 | update_file(o, mfi.clean, mfi.sha, mfi.mode, ren1_dst); | |
1002 | } | |
1003 | } else { | |
1004 | /* Renamed in 1, maybe changed in 2 */ | |
1005 | struct string_list_item *item; | |
1006 | /* we only use sha1 and mode of these */ | |
1007 | struct diff_filespec src_other, dst_other; | |
1008 | int try_merge; | |
1009 | ||
1010 | /* | |
1011 | * unpack_trees loads entries from common-commit | |
1012 | * into stage 1, from head-commit into stage 2, and | |
1013 | * from merge-commit into stage 3. We keep track | |
1014 | * of which side corresponds to the rename. | |
1015 | */ | |
1016 | int renamed_stage = a_renames == renames1 ? 2 : 3; | |
1017 | int other_stage = a_renames == renames1 ? 3 : 2; | |
1018 | ||
1019 | remove_file(o, 1, ren1_src, o->call_depth || renamed_stage == 2); | |
1020 | ||
1021 | hashcpy(src_other.sha1, ren1->src_entry->stages[other_stage].sha); | |
1022 | src_other.mode = ren1->src_entry->stages[other_stage].mode; | |
1023 | hashcpy(dst_other.sha1, ren1->dst_entry->stages[other_stage].sha); | |
1024 | dst_other.mode = ren1->dst_entry->stages[other_stage].mode; | |
1025 | try_merge = 0; | |
1026 | ||
1027 | if (sha_eq(src_other.sha1, null_sha1)) { | |
1028 | clean_merge = 0; | |
1029 | conflict_rename_delete(o, ren1->pair, branch1, branch2); | |
1030 | } else if ((dst_other.mode == ren1->pair->two->mode) && | |
1031 | sha_eq(dst_other.sha1, ren1->pair->two->sha1)) { | |
1032 | /* Added file on the other side | |
1033 | identical to the file being | |
1034 | renamed: clean merge */ | |
1035 | update_file(o, 1, ren1->pair->two->sha1, ren1->pair->two->mode, ren1_dst); | |
1036 | } else if (!sha_eq(dst_other.sha1, null_sha1)) { | |
1037 | const char *new_path; | |
1038 | clean_merge = 0; | |
1039 | try_merge = 1; | |
1040 | output(o, 1, "CONFLICT (rename/add): Rename %s->%s in %s. " | |
1041 | "%s added in %s", | |
1042 | ren1_src, ren1_dst, branch1, | |
1043 | ren1_dst, branch2); | |
1044 | if (o->call_depth) { | |
1045 | struct merge_file_info mfi; | |
1046 | struct diff_filespec one, a, b; | |
1047 | ||
1048 | one.path = a.path = b.path = | |
1049 | (char *)ren1_dst; | |
1050 | hashcpy(one.sha1, null_sha1); | |
1051 | one.mode = 0; | |
1052 | hashcpy(a.sha1, ren1->pair->two->sha1); | |
1053 | a.mode = ren1->pair->two->mode; | |
1054 | hashcpy(b.sha1, dst_other.sha1); | |
1055 | b.mode = dst_other.mode; | |
1056 | mfi = merge_file(o, &one, &a, &b, | |
1057 | branch1, | |
1058 | branch2); | |
1059 | output(o, 1, "Adding merged %s", ren1_dst); | |
1060 | update_file(o, 0, | |
1061 | mfi.sha, | |
1062 | mfi.mode, | |
1063 | ren1_dst); | |
1064 | } else { | |
1065 | new_path = unique_path(o, ren1_dst, branch2); | |
1066 | output(o, 1, "Adding as %s instead", new_path); | |
1067 | update_file(o, 0, dst_other.sha1, dst_other.mode, new_path); | |
1068 | } | |
1069 | } else if ((item = string_list_lookup(renames2Dst, ren1_dst))) { | |
1070 | ren2 = item->util; | |
1071 | clean_merge = 0; | |
1072 | ren2->processed = 1; | |
1073 | output(o, 1, "CONFLICT (rename/rename): " | |
1074 | "Rename %s->%s in %s. " | |
1075 | "Rename %s->%s in %s", | |
1076 | ren1_src, ren1_dst, branch1, | |
1077 | ren2->pair->one->path, ren2->pair->two->path, branch2); | |
1078 | conflict_rename_rename_2to1(o, ren1, branch1, ren2, branch2); | |
1079 | } else | |
1080 | try_merge = 1; | |
1081 | ||
1082 | if (try_merge) { | |
1083 | struct diff_filespec *one, *a, *b; | |
1084 | struct merge_file_info mfi; | |
1085 | src_other.path = (char *)ren1_src; | |
1086 | ||
1087 | one = ren1->pair->one; | |
1088 | if (a_renames == renames1) { | |
1089 | a = ren1->pair->two; | |
1090 | b = &src_other; | |
1091 | } else { | |
1092 | b = ren1->pair->two; | |
1093 | a = &src_other; | |
1094 | } | |
1095 | mfi = merge_file(o, one, a, b, | |
1096 | o->branch1, o->branch2); | |
1097 | ||
1098 | if (mfi.clean && | |
1099 | sha_eq(mfi.sha, ren1->pair->two->sha1) && | |
1100 | mfi.mode == ren1->pair->two->mode) { | |
1101 | /* | |
1102 | * This message is part of | |
1103 | * t6022 test. If you change | |
1104 | * it update the test too. | |
1105 | */ | |
1106 | output(o, 3, "Skipped %s (merged same as existing)", ren1_dst); | |
1107 | ||
1108 | /* There may be higher stage entries left | |
1109 | * in the index (e.g. due to a D/F | |
1110 | * conflict) that need to be resolved. | |
1111 | */ | |
1112 | if (!ren1->dst_entry->stages[2].mode != | |
1113 | !ren1->dst_entry->stages[3].mode) | |
1114 | ren1->dst_entry->processed = 0; | |
1115 | } else { | |
1116 | if (mfi.merge || !mfi.clean) | |
1117 | output(o, 1, "Renaming %s => %s", ren1_src, ren1_dst); | |
1118 | if (mfi.merge) | |
1119 | output(o, 2, "Auto-merging %s", ren1_dst); | |
1120 | if (!mfi.clean) { | |
1121 | output(o, 1, "CONFLICT (rename/modify): Merge conflict in %s", | |
1122 | ren1_dst); | |
1123 | clean_merge = 0; | |
1124 | ||
1125 | if (!o->call_depth) | |
1126 | update_stages(ren1_dst, | |
1127 | one, a, b, 1); | |
1128 | } | |
1129 | update_file(o, mfi.clean, mfi.sha, mfi.mode, ren1_dst); | |
1130 | } | |
1131 | } | |
1132 | } | |
1133 | } | |
1134 | string_list_clear(&a_by_dst, 0); | |
1135 | string_list_clear(&b_by_dst, 0); | |
1136 | ||
1137 | return clean_merge; | |
1138 | } | |
1139 | ||
1140 | static unsigned char *stage_sha(const unsigned char *sha, unsigned mode) | |
1141 | { | |
1142 | return (is_null_sha1(sha) || mode == 0) ? NULL: (unsigned char *)sha; | |
1143 | } | |
1144 | ||
1145 | static int read_sha1_strbuf(const unsigned char *sha1, struct strbuf *dst) | |
1146 | { | |
1147 | void *buf; | |
1148 | enum object_type type; | |
1149 | unsigned long size; | |
1150 | buf = read_sha1_file(sha1, &type, &size); | |
1151 | if (!buf) | |
1152 | return error("cannot read object %s", sha1_to_hex(sha1)); | |
1153 | if (type != OBJ_BLOB) { | |
1154 | free(buf); | |
1155 | return error("object %s is not a blob", sha1_to_hex(sha1)); | |
1156 | } | |
1157 | strbuf_attach(dst, buf, size, size + 1); | |
1158 | return 0; | |
1159 | } | |
1160 | ||
1161 | static int blob_unchanged(const unsigned char *o_sha, | |
1162 | const unsigned char *a_sha, | |
1163 | int renormalize, const char *path) | |
1164 | { | |
1165 | struct strbuf o = STRBUF_INIT; | |
1166 | struct strbuf a = STRBUF_INIT; | |
1167 | int ret = 0; /* assume changed for safety */ | |
1168 | ||
1169 | if (sha_eq(o_sha, a_sha)) | |
1170 | return 1; | |
1171 | if (!renormalize) | |
1172 | return 0; | |
1173 | ||
1174 | assert(o_sha && a_sha); | |
1175 | if (read_sha1_strbuf(o_sha, &o) || read_sha1_strbuf(a_sha, &a)) | |
1176 | goto error_return; | |
1177 | /* | |
1178 | * Note: binary | is used so that both renormalizations are | |
1179 | * performed. Comparison can be skipped if both files are | |
1180 | * unchanged since their sha1s have already been compared. | |
1181 | */ | |
1182 | if (renormalize_buffer(path, o.buf, o.len, &o) | | |
1183 | renormalize_buffer(path, a.buf, o.len, &a)) | |
1184 | ret = (o.len == a.len && !memcmp(o.buf, a.buf, o.len)); | |
1185 | ||
1186 | error_return: | |
1187 | strbuf_release(&o); | |
1188 | strbuf_release(&a); | |
1189 | return ret; | |
1190 | } | |
1191 | ||
1192 | static void handle_delete_modify(struct merge_options *o, | |
1193 | const char *path, | |
1194 | unsigned char *a_sha, int a_mode, | |
1195 | unsigned char *b_sha, int b_mode) | |
1196 | { | |
1197 | if (!a_sha) { | |
1198 | output(o, 1, "CONFLICT (delete/modify): %s deleted in %s " | |
1199 | "and modified in %s. Version %s of %s left in tree.", | |
1200 | path, o->branch1, | |
1201 | o->branch2, o->branch2, path); | |
1202 | update_file(o, 0, b_sha, b_mode, path); | |
1203 | } else { | |
1204 | output(o, 1, "CONFLICT (delete/modify): %s deleted in %s " | |
1205 | "and modified in %s. Version %s of %s left in tree.", | |
1206 | path, o->branch2, | |
1207 | o->branch1, o->branch1, path); | |
1208 | update_file(o, 0, a_sha, a_mode, path); | |
1209 | } | |
1210 | } | |
1211 | ||
1212 | ||
1213 | static int merge_content(struct merge_options *o, | |
1214 | const char *path, | |
1215 | unsigned char *o_sha, int o_mode, | |
1216 | unsigned char *a_sha, int a_mode, | |
1217 | unsigned char *b_sha, int b_mode) | |
1218 | { | |
1219 | const char *reason = "content"; | |
1220 | struct merge_file_info mfi; | |
1221 | struct diff_filespec one, a, b; | |
1222 | ||
1223 | if (!o_sha) { | |
1224 | reason = "add/add"; | |
1225 | o_sha = (unsigned char *)null_sha1; | |
1226 | } | |
1227 | one.path = a.path = b.path = (char *)path; | |
1228 | hashcpy(one.sha1, o_sha); | |
1229 | one.mode = o_mode; | |
1230 | hashcpy(a.sha1, a_sha); | |
1231 | a.mode = a_mode; | |
1232 | hashcpy(b.sha1, b_sha); | |
1233 | b.mode = b_mode; | |
1234 | ||
1235 | mfi = merge_file(o, &one, &a, &b, o->branch1, o->branch2); | |
1236 | if (mfi.clean && sha_eq(mfi.sha, a_sha) && mfi.mode == a.mode) | |
1237 | output(o, 3, "Skipped %s (merged same as existing)", path); | |
1238 | else | |
1239 | output(o, 2, "Auto-merging %s", path); | |
1240 | ||
1241 | if (!mfi.clean) { | |
1242 | if (S_ISGITLINK(mfi.mode)) | |
1243 | reason = "submodule"; | |
1244 | output(o, 1, "CONFLICT (%s): Merge conflict in %s", | |
1245 | reason, path); | |
1246 | } | |
1247 | ||
1248 | update_file(o, mfi.clean, mfi.sha, mfi.mode, path); | |
1249 | return mfi.clean; | |
1250 | ||
1251 | } | |
1252 | ||
1253 | /* Per entry merge function */ | |
1254 | static int process_entry(struct merge_options *o, | |
1255 | const char *path, struct stage_data *entry) | |
1256 | { | |
1257 | /* | |
1258 | printf("processing entry, clean cache: %s\n", index_only ? "yes": "no"); | |
1259 | print_index_entry("\tpath: ", entry); | |
1260 | */ | |
1261 | int clean_merge = 1; | |
1262 | int normalize = o->renormalize; | |
1263 | unsigned o_mode = entry->stages[1].mode; | |
1264 | unsigned a_mode = entry->stages[2].mode; | |
1265 | unsigned b_mode = entry->stages[3].mode; | |
1266 | unsigned char *o_sha = stage_sha(entry->stages[1].sha, o_mode); | |
1267 | unsigned char *a_sha = stage_sha(entry->stages[2].sha, a_mode); | |
1268 | unsigned char *b_sha = stage_sha(entry->stages[3].sha, b_mode); | |
1269 | ||
1270 | entry->processed = 1; | |
1271 | if (o_sha && (!a_sha || !b_sha)) { | |
1272 | /* Case A: Deleted in one */ | |
1273 | if ((!a_sha && !b_sha) || | |
1274 | (!b_sha && blob_unchanged(o_sha, a_sha, normalize, path)) || | |
1275 | (!a_sha && blob_unchanged(o_sha, b_sha, normalize, path))) { | |
1276 | /* Deleted in both or deleted in one and | |
1277 | * unchanged in the other */ | |
1278 | if (a_sha) | |
1279 | output(o, 2, "Removing %s", path); | |
1280 | /* do not touch working file if it did not exist */ | |
1281 | remove_file(o, 1, path, !a_sha); | |
1282 | } else { | |
1283 | /* Deleted in one and changed in the other */ | |
1284 | clean_merge = 0; | |
1285 | handle_delete_modify(o, path, | |
1286 | a_sha, a_mode, b_sha, b_mode); | |
1287 | } | |
1288 | ||
1289 | } else if ((!o_sha && a_sha && !b_sha) || | |
1290 | (!o_sha && !a_sha && b_sha)) { | |
1291 | /* Case B: Added in one. */ | |
1292 | unsigned mode; | |
1293 | const unsigned char *sha; | |
1294 | ||
1295 | if (a_sha) { | |
1296 | mode = a_mode; | |
1297 | sha = a_sha; | |
1298 | } else { | |
1299 | mode = b_mode; | |
1300 | sha = b_sha; | |
1301 | } | |
1302 | if (string_list_has_string(&o->current_directory_set, path)) { | |
1303 | /* Handle D->F conflicts after all subfiles */ | |
1304 | entry->processed = 0; | |
1305 | /* But get any file out of the way now, so conflicted | |
1306 | * entries below the directory of the same name can | |
1307 | * be put in the working directory. | |
1308 | */ | |
1309 | if (a_sha) | |
1310 | output(o, 2, "Removing %s", path); | |
1311 | /* do not touch working file if it did not exist */ | |
1312 | remove_file(o, 0, path, !a_sha); | |
1313 | return 1; /* Assume clean till processed */ | |
1314 | } else { | |
1315 | output(o, 2, "Adding %s", path); | |
1316 | update_file(o, 1, sha, mode, path); | |
1317 | } | |
1318 | } else if (a_sha && b_sha) { | |
1319 | /* Case C: Added in both (check for same permissions) and */ | |
1320 | /* case D: Modified in both, but differently. */ | |
1321 | clean_merge = merge_content(o, path, | |
1322 | o_sha, o_mode, a_sha, a_mode, b_sha, b_mode); | |
1323 | } else if (!o_sha && !a_sha && !b_sha) { | |
1324 | /* | |
1325 | * this entry was deleted altogether. a_mode == 0 means | |
1326 | * we had that path and want to actively remove it. | |
1327 | */ | |
1328 | remove_file(o, 1, path, !a_mode); | |
1329 | } else | |
1330 | die("Fatal merge failure, shouldn't happen."); | |
1331 | ||
1332 | return clean_merge; | |
1333 | } | |
1334 | ||
1335 | /* | |
1336 | * Per entry merge function for D/F conflicts, to be called only after | |
1337 | * all files below dir have been processed. We do this because in the | |
1338 | * cases we can cleanly resolve D/F conflicts, process_entry() can clean | |
1339 | * out all the files below the directory for us. | |
1340 | */ | |
1341 | static int process_df_entry(struct merge_options *o, | |
1342 | const char *path, struct stage_data *entry) | |
1343 | { | |
1344 | int clean_merge = 1; | |
1345 | unsigned o_mode = entry->stages[1].mode; | |
1346 | unsigned a_mode = entry->stages[2].mode; | |
1347 | unsigned b_mode = entry->stages[3].mode; | |
1348 | unsigned char *o_sha = stage_sha(entry->stages[1].sha, o_mode); | |
1349 | unsigned char *a_sha = stage_sha(entry->stages[2].sha, a_mode); | |
1350 | unsigned char *b_sha = stage_sha(entry->stages[3].sha, b_mode); | |
1351 | const char *add_branch; | |
1352 | const char *other_branch; | |
1353 | unsigned mode; | |
1354 | const unsigned char *sha; | |
1355 | const char *conf; | |
1356 | struct stat st; | |
1357 | ||
1358 | if (!((!o_sha && a_sha && !b_sha) || (!o_sha && !a_sha && b_sha))) | |
1359 | return 1; /* we don't handle non D-F cases */ | |
1360 | ||
1361 | entry->processed = 1; | |
1362 | ||
1363 | if (a_sha) { | |
1364 | add_branch = o->branch1; | |
1365 | other_branch = o->branch2; | |
1366 | mode = a_mode; | |
1367 | sha = a_sha; | |
1368 | conf = "file/directory"; | |
1369 | } else { | |
1370 | add_branch = o->branch2; | |
1371 | other_branch = o->branch1; | |
1372 | mode = b_mode; | |
1373 | sha = b_sha; | |
1374 | conf = "directory/file"; | |
1375 | } | |
1376 | if (lstat(path, &st) == 0 && S_ISDIR(st.st_mode)) { | |
1377 | const char *new_path = unique_path(o, path, add_branch); | |
1378 | clean_merge = 0; | |
1379 | output(o, 1, "CONFLICT (%s): There is a directory with name %s in %s. " | |
1380 | "Adding %s as %s", | |
1381 | conf, path, other_branch, path, new_path); | |
1382 | remove_file(o, 0, path, 0); | |
1383 | update_file(o, 0, sha, mode, new_path); | |
1384 | } else { | |
1385 | output(o, 2, "Adding %s", path); | |
1386 | update_file(o, 1, sha, mode, path); | |
1387 | } | |
1388 | ||
1389 | return clean_merge; | |
1390 | } | |
1391 | ||
1392 | int merge_trees(struct merge_options *o, | |
1393 | struct tree *head, | |
1394 | struct tree *merge, | |
1395 | struct tree *common, | |
1396 | struct tree **result) | |
1397 | { | |
1398 | int code, clean; | |
1399 | ||
1400 | if (o->subtree_shift) { | |
1401 | merge = shift_tree_object(head, merge, o->subtree_shift); | |
1402 | common = shift_tree_object(head, common, o->subtree_shift); | |
1403 | } | |
1404 | ||
1405 | if (sha_eq(common->object.sha1, merge->object.sha1)) { | |
1406 | output(o, 0, "Already up-to-date!"); | |
1407 | *result = head; | |
1408 | return 1; | |
1409 | } | |
1410 | ||
1411 | code = git_merge_trees(o->call_depth, common, head, merge); | |
1412 | ||
1413 | if (code != 0) { | |
1414 | if (show(o, 4) || o->call_depth) | |
1415 | die("merging of trees %s and %s failed", | |
1416 | sha1_to_hex(head->object.sha1), | |
1417 | sha1_to_hex(merge->object.sha1)); | |
1418 | else | |
1419 | exit(128); | |
1420 | } | |
1421 | ||
1422 | if (unmerged_cache()) { | |
1423 | struct string_list *entries, *re_head, *re_merge; | |
1424 | int i; | |
1425 | string_list_clear(&o->current_file_set, 1); | |
1426 | string_list_clear(&o->current_directory_set, 1); | |
1427 | get_files_dirs(o, head); | |
1428 | get_files_dirs(o, merge); | |
1429 | ||
1430 | entries = get_unmerged(); | |
1431 | re_head = get_renames(o, head, common, head, merge, entries); | |
1432 | re_merge = get_renames(o, merge, common, head, merge, entries); | |
1433 | clean = process_renames(o, re_head, re_merge); | |
1434 | for (i = 0; i < entries->nr; i++) { | |
1435 | const char *path = entries->items[i].string; | |
1436 | struct stage_data *e = entries->items[i].util; | |
1437 | if (!e->processed | |
1438 | && !process_entry(o, path, e)) | |
1439 | clean = 0; | |
1440 | } | |
1441 | for (i = 0; i < entries->nr; i++) { | |
1442 | const char *path = entries->items[i].string; | |
1443 | struct stage_data *e = entries->items[i].util; | |
1444 | if (!e->processed | |
1445 | && !process_df_entry(o, path, e)) | |
1446 | clean = 0; | |
1447 | } | |
1448 | for (i = 0; i < entries->nr; i++) { | |
1449 | struct stage_data *e = entries->items[i].util; | |
1450 | if (!e->processed) | |
1451 | die("Unprocessed path??? %s", | |
1452 | entries->items[i].string); | |
1453 | } | |
1454 | ||
1455 | string_list_clear(re_merge, 0); | |
1456 | string_list_clear(re_head, 0); | |
1457 | string_list_clear(entries, 1); | |
1458 | ||
1459 | } | |
1460 | else | |
1461 | clean = 1; | |
1462 | ||
1463 | if (o->call_depth) | |
1464 | *result = write_tree_from_memory(o); | |
1465 | ||
1466 | return clean; | |
1467 | } | |
1468 | ||
1469 | static struct commit_list *reverse_commit_list(struct commit_list *list) | |
1470 | { | |
1471 | struct commit_list *next = NULL, *current, *backup; | |
1472 | for (current = list; current; current = backup) { | |
1473 | backup = current->next; | |
1474 | current->next = next; | |
1475 | next = current; | |
1476 | } | |
1477 | return next; | |
1478 | } | |
1479 | ||
1480 | /* | |
1481 | * Merge the commits h1 and h2, return the resulting virtual | |
1482 | * commit object and a flag indicating the cleanness of the merge. | |
1483 | */ | |
1484 | int merge_recursive(struct merge_options *o, | |
1485 | struct commit *h1, | |
1486 | struct commit *h2, | |
1487 | struct commit_list *ca, | |
1488 | struct commit **result) | |
1489 | { | |
1490 | struct commit_list *iter; | |
1491 | struct commit *merged_common_ancestors; | |
1492 | struct tree *mrtree = mrtree; | |
1493 | int clean; | |
1494 | ||
1495 | if (show(o, 4)) { | |
1496 | output(o, 4, "Merging:"); | |
1497 | output_commit_title(o, h1); | |
1498 | output_commit_title(o, h2); | |
1499 | } | |
1500 | ||
1501 | if (!ca) { | |
1502 | ca = get_merge_bases(h1, h2, 1); | |
1503 | ca = reverse_commit_list(ca); | |
1504 | } | |
1505 | ||
1506 | if (show(o, 5)) { | |
1507 | output(o, 5, "found %u common ancestor(s):", commit_list_count(ca)); | |
1508 | for (iter = ca; iter; iter = iter->next) | |
1509 | output_commit_title(o, iter->item); | |
1510 | } | |
1511 | ||
1512 | merged_common_ancestors = pop_commit(&ca); | |
1513 | if (merged_common_ancestors == NULL) { | |
1514 | /* if there is no common ancestor, make an empty tree */ | |
1515 | struct tree *tree = xcalloc(1, sizeof(struct tree)); | |
1516 | ||
1517 | tree->object.parsed = 1; | |
1518 | tree->object.type = OBJ_TREE; | |
1519 | pretend_sha1_file(NULL, 0, OBJ_TREE, tree->object.sha1); | |
1520 | merged_common_ancestors = make_virtual_commit(tree, "ancestor"); | |
1521 | } | |
1522 | ||
1523 | for (iter = ca; iter; iter = iter->next) { | |
1524 | const char *saved_b1, *saved_b2; | |
1525 | o->call_depth++; | |
1526 | /* | |
1527 | * When the merge fails, the result contains files | |
1528 | * with conflict markers. The cleanness flag is | |
1529 | * ignored, it was never actually used, as result of | |
1530 | * merge_trees has always overwritten it: the committed | |
1531 | * "conflicts" were already resolved. | |
1532 | */ | |
1533 | discard_cache(); | |
1534 | saved_b1 = o->branch1; | |
1535 | saved_b2 = o->branch2; | |
1536 | o->branch1 = "Temporary merge branch 1"; | |
1537 | o->branch2 = "Temporary merge branch 2"; | |
1538 | merge_recursive(o, merged_common_ancestors, iter->item, | |
1539 | NULL, &merged_common_ancestors); | |
1540 | o->branch1 = saved_b1; | |
1541 | o->branch2 = saved_b2; | |
1542 | o->call_depth--; | |
1543 | ||
1544 | if (!merged_common_ancestors) | |
1545 | die("merge returned no commit"); | |
1546 | } | |
1547 | ||
1548 | discard_cache(); | |
1549 | if (!o->call_depth) | |
1550 | read_cache(); | |
1551 | ||
1552 | o->ancestor = "merged common ancestors"; | |
1553 | clean = merge_trees(o, h1->tree, h2->tree, merged_common_ancestors->tree, | |
1554 | &mrtree); | |
1555 | ||
1556 | if (o->call_depth) { | |
1557 | *result = make_virtual_commit(mrtree, "merged tree"); | |
1558 | commit_list_insert(h1, &(*result)->parents); | |
1559 | commit_list_insert(h2, &(*result)->parents->next); | |
1560 | } | |
1561 | flush_output(o); | |
1562 | return clean; | |
1563 | } | |
1564 | ||
1565 | static struct commit *get_ref(const unsigned char *sha1, const char *name) | |
1566 | { | |
1567 | struct object *object; | |
1568 | ||
1569 | object = deref_tag(parse_object(sha1), name, strlen(name)); | |
1570 | if (!object) | |
1571 | return NULL; | |
1572 | if (object->type == OBJ_TREE) | |
1573 | return make_virtual_commit((struct tree*)object, name); | |
1574 | if (object->type != OBJ_COMMIT) | |
1575 | return NULL; | |
1576 | if (parse_commit((struct commit *)object)) | |
1577 | return NULL; | |
1578 | return (struct commit *)object; | |
1579 | } | |
1580 | ||
1581 | int merge_recursive_generic(struct merge_options *o, | |
1582 | const unsigned char *head, | |
1583 | const unsigned char *merge, | |
1584 | int num_base_list, | |
1585 | const unsigned char **base_list, | |
1586 | struct commit **result) | |
1587 | { | |
1588 | int clean, index_fd; | |
1589 | struct lock_file *lock = xcalloc(1, sizeof(struct lock_file)); | |
1590 | struct commit *head_commit = get_ref(head, o->branch1); | |
1591 | struct commit *next_commit = get_ref(merge, o->branch2); | |
1592 | struct commit_list *ca = NULL; | |
1593 | ||
1594 | if (base_list) { | |
1595 | int i; | |
1596 | for (i = 0; i < num_base_list; ++i) { | |
1597 | struct commit *base; | |
1598 | if (!(base = get_ref(base_list[i], sha1_to_hex(base_list[i])))) | |
1599 | return error("Could not parse object '%s'", | |
1600 | sha1_to_hex(base_list[i])); | |
1601 | commit_list_insert(base, &ca); | |
1602 | } | |
1603 | } | |
1604 | ||
1605 | index_fd = hold_locked_index(lock, 1); | |
1606 | clean = merge_recursive(o, head_commit, next_commit, ca, | |
1607 | result); | |
1608 | if (active_cache_changed && | |
1609 | (write_cache(index_fd, active_cache, active_nr) || | |
1610 | commit_locked_index(lock))) | |
1611 | return error("Unable to write index."); | |
1612 | ||
1613 | return clean ? 0 : 1; | |
1614 | } | |
1615 | ||
1616 | static int merge_recursive_config(const char *var, const char *value, void *cb) | |
1617 | { | |
1618 | struct merge_options *o = cb; | |
1619 | if (!strcasecmp(var, "merge.verbosity")) { | |
1620 | o->verbosity = git_config_int(var, value); | |
1621 | return 0; | |
1622 | } | |
1623 | if (!strcasecmp(var, "diff.renamelimit")) { | |
1624 | o->diff_rename_limit = git_config_int(var, value); | |
1625 | return 0; | |
1626 | } | |
1627 | if (!strcasecmp(var, "merge.renamelimit")) { | |
1628 | o->merge_rename_limit = git_config_int(var, value); | |
1629 | return 0; | |
1630 | } | |
1631 | return git_xmerge_config(var, value, cb); | |
1632 | } | |
1633 | ||
1634 | void init_merge_options(struct merge_options *o) | |
1635 | { | |
1636 | memset(o, 0, sizeof(struct merge_options)); | |
1637 | o->verbosity = 2; | |
1638 | o->buffer_output = 1; | |
1639 | o->diff_rename_limit = -1; | |
1640 | o->merge_rename_limit = -1; | |
1641 | o->renormalize = 0; | |
1642 | git_config(merge_recursive_config, o); | |
1643 | if (getenv("GIT_MERGE_VERBOSITY")) | |
1644 | o->verbosity = | |
1645 | strtol(getenv("GIT_MERGE_VERBOSITY"), NULL, 10); | |
1646 | if (o->verbosity >= 5) | |
1647 | o->buffer_output = 0; | |
1648 | strbuf_init(&o->obuf, 0); | |
1649 | memset(&o->current_file_set, 0, sizeof(struct string_list)); | |
1650 | o->current_file_set.strdup_strings = 1; | |
1651 | memset(&o->current_directory_set, 0, sizeof(struct string_list)); | |
1652 | o->current_directory_set.strdup_strings = 1; | |
1653 | } |