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