tests: skip dav http-push tests under NO_EXPAT=NoThanks
[git/mingw/j6t.git] / unpack-trees.c
blob02f69aeea3dc2e60336fa4ac018ec14ae10f911e
1 #define NO_THE_INDEX_COMPATIBILITY_MACROS
2 #include "cache.h"
3 #include "dir.h"
4 #include "tree.h"
5 #include "tree-walk.h"
6 #include "cache-tree.h"
7 #include "unpack-trees.h"
8 #include "progress.h"
9 #include "refs.h"
10 #include "attr.h"
13 * Error messages expected by scripts out of plumbing commands such as
14 * read-tree. Non-scripted Porcelain is not required to use these messages
15 * and in fact are encouraged to reword them to better suit their particular
16 * situation better. See how "git checkout" and "git merge" replaces
17 * them using setup_unpack_trees_porcelain(), for example.
19 static const char *unpack_plumbing_errors[NB_UNPACK_TREES_ERROR_TYPES] = {
20 /* ERROR_WOULD_OVERWRITE */
21 "Entry '%s' would be overwritten by merge. Cannot merge.",
23 /* ERROR_NOT_UPTODATE_FILE */
24 "Entry '%s' not uptodate. Cannot merge.",
26 /* ERROR_NOT_UPTODATE_DIR */
27 "Updating '%s' would lose untracked files in it",
29 /* ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN */
30 "Untracked working tree file '%s' would be overwritten by merge.",
32 /* ERROR_WOULD_LOSE_UNTRACKED_REMOVED */
33 "Untracked working tree file '%s' would be removed by merge.",
35 /* ERROR_BIND_OVERLAP */
36 "Entry '%s' overlaps with '%s'. Cannot bind.",
38 /* ERROR_SPARSE_NOT_UPTODATE_FILE */
39 "Entry '%s' not uptodate. Cannot update sparse checkout.",
41 /* ERROR_WOULD_LOSE_ORPHANED_OVERWRITTEN */
42 "Working tree file '%s' would be overwritten by sparse checkout update.",
44 /* ERROR_WOULD_LOSE_ORPHANED_REMOVED */
45 "Working tree file '%s' would be removed by sparse checkout update.",
48 #define ERRORMSG(o,type) \
49 ( ((o) && (o)->msgs[(type)]) \
50 ? ((o)->msgs[(type)]) \
51 : (unpack_plumbing_errors[(type)]) )
53 void setup_unpack_trees_porcelain(struct unpack_trees_options *opts,
54 const char *cmd)
56 int i;
57 const char **msgs = opts->msgs;
58 const char *msg;
59 char *tmp;
60 const char *cmd2 = strcmp(cmd, "checkout") ? cmd : "switch branches";
61 if (advice_commit_before_merge)
62 msg = "Your local changes to the following files would be overwritten by %s:\n%%s"
63 "Please, commit your changes or stash them before you can %s.";
64 else
65 msg = "Your local changes to the following files would be overwritten by %s:\n%%s";
66 tmp = xmalloc(strlen(msg) + strlen(cmd) + strlen(cmd2) - 2);
67 sprintf(tmp, msg, cmd, cmd2);
68 msgs[ERROR_WOULD_OVERWRITE] = tmp;
69 msgs[ERROR_NOT_UPTODATE_FILE] = tmp;
71 msgs[ERROR_NOT_UPTODATE_DIR] =
72 "Updating the following directories would lose untracked files in it:\n%s";
74 if (advice_commit_before_merge)
75 msg = "The following untracked working tree files would be %s by %s:\n%%s"
76 "Please move or remove them before you can %s.";
77 else
78 msg = "The following untracked working tree files would be %s by %s:\n%%s";
79 tmp = xmalloc(strlen(msg) + strlen(cmd) + strlen("removed") + strlen(cmd2) - 4);
80 sprintf(tmp, msg, "removed", cmd, cmd2);
81 msgs[ERROR_WOULD_LOSE_UNTRACKED_REMOVED] = tmp;
82 tmp = xmalloc(strlen(msg) + strlen(cmd) + strlen("overwritten") + strlen(cmd2) - 4);
83 sprintf(tmp, msg, "overwritten", cmd, cmd2);
84 msgs[ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN] = tmp;
87 * Special case: ERROR_BIND_OVERLAP refers to a pair of paths, we
88 * cannot easily display it as a list.
90 msgs[ERROR_BIND_OVERLAP] = "Entry '%s' overlaps with '%s'. Cannot bind.";
92 msgs[ERROR_SPARSE_NOT_UPTODATE_FILE] =
93 "Cannot update sparse checkout: the following entries are not up-to-date:\n%s";
94 msgs[ERROR_WOULD_LOSE_ORPHANED_OVERWRITTEN] =
95 "The following Working tree files would be overwritten by sparse checkout update:\n%s";
96 msgs[ERROR_WOULD_LOSE_ORPHANED_REMOVED] =
97 "The following Working tree files would be removed by sparse checkout update:\n%s";
99 opts->show_all_errors = 1;
100 /* rejected paths may not have a static buffer */
101 for (i = 0; i < ARRAY_SIZE(opts->unpack_rejects); i++)
102 opts->unpack_rejects[i].strdup_strings = 1;
105 static int do_add_entry(struct unpack_trees_options *o, struct cache_entry *ce,
106 unsigned int set, unsigned int clear)
108 clear |= CE_HASHED;
110 if (set & CE_REMOVE)
111 set |= CE_WT_REMOVE;
113 ce->ce_flags = (ce->ce_flags & ~clear) | set;
114 return add_index_entry(&o->result, ce,
115 ADD_CACHE_OK_TO_ADD | ADD_CACHE_OK_TO_REPLACE);
118 static struct cache_entry *dup_entry(const struct cache_entry *ce)
120 unsigned int size = ce_size(ce);
121 struct cache_entry *new = xmalloc(size);
123 memcpy(new, ce, size);
124 return new;
127 static void add_entry(struct unpack_trees_options *o,
128 const struct cache_entry *ce,
129 unsigned int set, unsigned int clear)
131 do_add_entry(o, dup_entry(ce), set, clear);
135 * add error messages on path <path>
136 * corresponding to the type <e> with the message <msg>
137 * indicating if it should be display in porcelain or not
139 static int add_rejected_path(struct unpack_trees_options *o,
140 enum unpack_trees_error_types e,
141 const char *path)
143 if (!o->show_all_errors)
144 return error(ERRORMSG(o, e), path);
147 * Otherwise, insert in a list for future display by
148 * display_error_msgs()
150 string_list_append(&o->unpack_rejects[e], path);
151 return -1;
155 * display all the error messages stored in a nice way
157 static void display_error_msgs(struct unpack_trees_options *o)
159 int e, i;
160 int something_displayed = 0;
161 for (e = 0; e < NB_UNPACK_TREES_ERROR_TYPES; e++) {
162 struct string_list *rejects = &o->unpack_rejects[e];
163 if (rejects->nr > 0) {
164 struct strbuf path = STRBUF_INIT;
165 something_displayed = 1;
166 for (i = 0; i < rejects->nr; i++)
167 strbuf_addf(&path, "\t%s\n", rejects->items[i].string);
168 error(ERRORMSG(o, e), path.buf);
169 strbuf_release(&path);
171 string_list_clear(rejects, 0);
173 if (something_displayed)
174 fprintf(stderr, "Aborting\n");
178 * Unlink the last component and schedule the leading directories for
179 * removal, such that empty directories get removed.
181 static void unlink_entry(const struct cache_entry *ce)
183 if (!check_leading_path(ce->name, ce_namelen(ce)))
184 return;
185 if (remove_or_warn(ce->ce_mode, ce->name))
186 return;
187 schedule_dir_for_removal(ce->name, ce_namelen(ce));
190 static struct checkout state;
191 static int check_updates(struct unpack_trees_options *o)
193 unsigned cnt = 0, total = 0;
194 struct progress *progress = NULL;
195 struct index_state *index = &o->result;
196 int i;
197 int errs = 0;
199 if (o->update && o->verbose_update) {
200 for (total = cnt = 0; cnt < index->cache_nr; cnt++) {
201 const struct cache_entry *ce = index->cache[cnt];
202 if (ce->ce_flags & (CE_UPDATE | CE_WT_REMOVE))
203 total++;
206 progress = start_progress_delay(_("Checking out files"),
207 total, 50, 1);
208 cnt = 0;
211 if (o->update)
212 git_attr_set_direction(GIT_ATTR_CHECKOUT, &o->result);
213 for (i = 0; i < index->cache_nr; i++) {
214 const struct cache_entry *ce = index->cache[i];
216 if (ce->ce_flags & CE_WT_REMOVE) {
217 display_progress(progress, ++cnt);
218 if (o->update && !o->dry_run)
219 unlink_entry(ce);
220 continue;
223 remove_marked_cache_entries(&o->result);
224 remove_scheduled_dirs();
226 for (i = 0; i < index->cache_nr; i++) {
227 struct cache_entry *ce = index->cache[i];
229 if (ce->ce_flags & CE_UPDATE) {
230 display_progress(progress, ++cnt);
231 ce->ce_flags &= ~CE_UPDATE;
232 if (o->update && !o->dry_run) {
233 errs |= checkout_entry(ce, &state, NULL);
237 stop_progress(&progress);
238 if (o->update)
239 git_attr_set_direction(GIT_ATTR_CHECKIN, NULL);
240 return errs != 0;
243 static int verify_uptodate_sparse(const struct cache_entry *ce,
244 struct unpack_trees_options *o);
245 static int verify_absent_sparse(const struct cache_entry *ce,
246 enum unpack_trees_error_types,
247 struct unpack_trees_options *o);
249 static int apply_sparse_checkout(struct cache_entry *ce, struct unpack_trees_options *o)
251 int was_skip_worktree = ce_skip_worktree(ce);
253 if (ce->ce_flags & CE_NEW_SKIP_WORKTREE)
254 ce->ce_flags |= CE_SKIP_WORKTREE;
255 else
256 ce->ce_flags &= ~CE_SKIP_WORKTREE;
259 * if (!was_skip_worktree && !ce_skip_worktree()) {
260 * This is perfectly normal. Move on;
265 * Merge strategies may set CE_UPDATE|CE_REMOVE outside checkout
266 * area as a result of ce_skip_worktree() shortcuts in
267 * verify_absent() and verify_uptodate().
268 * Make sure they don't modify worktree if they are already
269 * outside checkout area
271 if (was_skip_worktree && ce_skip_worktree(ce)) {
272 ce->ce_flags &= ~CE_UPDATE;
275 * By default, when CE_REMOVE is on, CE_WT_REMOVE is also
276 * on to get that file removed from both index and worktree.
277 * If that file is already outside worktree area, don't
278 * bother remove it.
280 if (ce->ce_flags & CE_REMOVE)
281 ce->ce_flags &= ~CE_WT_REMOVE;
284 if (!was_skip_worktree && ce_skip_worktree(ce)) {
286 * If CE_UPDATE is set, verify_uptodate() must be called already
287 * also stat info may have lost after merged_entry() so calling
288 * verify_uptodate() again may fail
290 if (!(ce->ce_flags & CE_UPDATE) && verify_uptodate_sparse(ce, o))
291 return -1;
292 ce->ce_flags |= CE_WT_REMOVE;
294 if (was_skip_worktree && !ce_skip_worktree(ce)) {
295 if (verify_absent_sparse(ce, ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN, o))
296 return -1;
297 ce->ce_flags |= CE_UPDATE;
299 return 0;
302 static inline int call_unpack_fn(const struct cache_entry * const *src,
303 struct unpack_trees_options *o)
305 int ret = o->fn(src, o);
306 if (ret > 0)
307 ret = 0;
308 return ret;
311 static void mark_ce_used(struct cache_entry *ce, struct unpack_trees_options *o)
313 ce->ce_flags |= CE_UNPACKED;
315 if (o->cache_bottom < o->src_index->cache_nr &&
316 o->src_index->cache[o->cache_bottom] == ce) {
317 int bottom = o->cache_bottom;
318 while (bottom < o->src_index->cache_nr &&
319 o->src_index->cache[bottom]->ce_flags & CE_UNPACKED)
320 bottom++;
321 o->cache_bottom = bottom;
325 static void mark_all_ce_unused(struct index_state *index)
327 int i;
328 for (i = 0; i < index->cache_nr; i++)
329 index->cache[i]->ce_flags &= ~(CE_UNPACKED | CE_ADDED | CE_NEW_SKIP_WORKTREE);
332 static int locate_in_src_index(const struct cache_entry *ce,
333 struct unpack_trees_options *o)
335 struct index_state *index = o->src_index;
336 int len = ce_namelen(ce);
337 int pos = index_name_pos(index, ce->name, len);
338 if (pos < 0)
339 pos = -1 - pos;
340 return pos;
344 * We call unpack_index_entry() with an unmerged cache entry
345 * only in diff-index, and it wants a single callback. Skip
346 * the other unmerged entry with the same name.
348 static void mark_ce_used_same_name(struct cache_entry *ce,
349 struct unpack_trees_options *o)
351 struct index_state *index = o->src_index;
352 int len = ce_namelen(ce);
353 int pos;
355 for (pos = locate_in_src_index(ce, o); pos < index->cache_nr; pos++) {
356 struct cache_entry *next = index->cache[pos];
357 if (len != ce_namelen(next) ||
358 memcmp(ce->name, next->name, len))
359 break;
360 mark_ce_used(next, o);
364 static struct cache_entry *next_cache_entry(struct unpack_trees_options *o)
366 const struct index_state *index = o->src_index;
367 int pos = o->cache_bottom;
369 while (pos < index->cache_nr) {
370 struct cache_entry *ce = index->cache[pos];
371 if (!(ce->ce_flags & CE_UNPACKED))
372 return ce;
373 pos++;
375 return NULL;
378 static void add_same_unmerged(const struct cache_entry *ce,
379 struct unpack_trees_options *o)
381 struct index_state *index = o->src_index;
382 int len = ce_namelen(ce);
383 int pos = index_name_pos(index, ce->name, len);
385 if (0 <= pos)
386 die("programming error in a caller of mark_ce_used_same_name");
387 for (pos = -pos - 1; pos < index->cache_nr; pos++) {
388 struct cache_entry *next = index->cache[pos];
389 if (len != ce_namelen(next) ||
390 memcmp(ce->name, next->name, len))
391 break;
392 add_entry(o, next, 0, 0);
393 mark_ce_used(next, o);
397 static int unpack_index_entry(struct cache_entry *ce,
398 struct unpack_trees_options *o)
400 const struct cache_entry *src[MAX_UNPACK_TREES + 1] = { NULL, };
401 int ret;
403 src[0] = ce;
405 mark_ce_used(ce, o);
406 if (ce_stage(ce)) {
407 if (o->skip_unmerged) {
408 add_entry(o, ce, 0, 0);
409 return 0;
412 ret = call_unpack_fn(src, o);
413 if (ce_stage(ce))
414 mark_ce_used_same_name(ce, o);
415 return ret;
418 static int find_cache_pos(struct traverse_info *, const struct name_entry *);
420 static void restore_cache_bottom(struct traverse_info *info, int bottom)
422 struct unpack_trees_options *o = info->data;
424 if (o->diff_index_cached)
425 return;
426 o->cache_bottom = bottom;
429 static int switch_cache_bottom(struct traverse_info *info)
431 struct unpack_trees_options *o = info->data;
432 int ret, pos;
434 if (o->diff_index_cached)
435 return 0;
436 ret = o->cache_bottom;
437 pos = find_cache_pos(info->prev, &info->name);
439 if (pos < -1)
440 o->cache_bottom = -2 - pos;
441 else if (pos < 0)
442 o->cache_bottom = o->src_index->cache_nr;
443 return ret;
446 static int traverse_trees_recursive(int n, unsigned long dirmask,
447 unsigned long df_conflicts,
448 struct name_entry *names,
449 struct traverse_info *info)
451 int i, ret, bottom;
452 struct tree_desc t[MAX_UNPACK_TREES];
453 void *buf[MAX_UNPACK_TREES];
454 struct traverse_info newinfo;
455 struct name_entry *p;
457 p = names;
458 while (!p->mode)
459 p++;
461 newinfo = *info;
462 newinfo.prev = info;
463 newinfo.pathspec = info->pathspec;
464 newinfo.name = *p;
465 newinfo.pathlen += tree_entry_len(p) + 1;
466 newinfo.df_conflicts |= df_conflicts;
468 for (i = 0; i < n; i++, dirmask >>= 1) {
469 const unsigned char *sha1 = NULL;
470 if (dirmask & 1)
471 sha1 = names[i].sha1;
472 buf[i] = fill_tree_descriptor(t+i, sha1);
475 bottom = switch_cache_bottom(&newinfo);
476 ret = traverse_trees(n, t, &newinfo);
477 restore_cache_bottom(&newinfo, bottom);
479 for (i = 0; i < n; i++)
480 free(buf[i]);
482 return ret;
486 * Compare the traverse-path to the cache entry without actually
487 * having to generate the textual representation of the traverse
488 * path.
490 * NOTE! This *only* compares up to the size of the traverse path
491 * itself - the caller needs to do the final check for the cache
492 * entry having more data at the end!
494 static int do_compare_entry(const struct cache_entry *ce, const struct traverse_info *info, const struct name_entry *n)
496 int len, pathlen, ce_len;
497 const char *ce_name;
499 if (info->prev) {
500 int cmp = do_compare_entry(ce, info->prev, &info->name);
501 if (cmp)
502 return cmp;
504 pathlen = info->pathlen;
505 ce_len = ce_namelen(ce);
507 /* If ce_len < pathlen then we must have previously hit "name == directory" entry */
508 if (ce_len < pathlen)
509 return -1;
511 ce_len -= pathlen;
512 ce_name = ce->name + pathlen;
514 len = tree_entry_len(n);
515 return df_name_compare(ce_name, ce_len, S_IFREG, n->path, len, n->mode);
518 static int compare_entry(const struct cache_entry *ce, const struct traverse_info *info, const struct name_entry *n)
520 int cmp = do_compare_entry(ce, info, n);
521 if (cmp)
522 return cmp;
525 * Even if the beginning compared identically, the ce should
526 * compare as bigger than a directory leading up to it!
528 return ce_namelen(ce) > traverse_path_len(info, n);
531 static int ce_in_traverse_path(const struct cache_entry *ce,
532 const struct traverse_info *info)
534 if (!info->prev)
535 return 1;
536 if (do_compare_entry(ce, info->prev, &info->name))
537 return 0;
539 * If ce (blob) is the same name as the path (which is a tree
540 * we will be descending into), it won't be inside it.
542 return (info->pathlen < ce_namelen(ce));
545 static struct cache_entry *create_ce_entry(const struct traverse_info *info, const struct name_entry *n, int stage)
547 int len = traverse_path_len(info, n);
548 struct cache_entry *ce = xcalloc(1, cache_entry_size(len));
550 ce->ce_mode = create_ce_mode(n->mode);
551 ce->ce_flags = create_ce_flags(stage);
552 ce->ce_namelen = len;
553 hashcpy(ce->sha1, n->sha1);
554 make_traverse_path(ce->name, info, n);
556 return ce;
559 static int unpack_nondirectories(int n, unsigned long mask,
560 unsigned long dirmask,
561 struct cache_entry **src,
562 const struct name_entry *names,
563 const struct traverse_info *info)
565 int i;
566 struct unpack_trees_options *o = info->data;
567 unsigned long conflicts = info->df_conflicts | dirmask;
569 /* Do we have *only* directories? Nothing to do */
570 if (mask == dirmask && !src[0])
571 return 0;
574 * Ok, we've filled in up to any potential index entry in src[0],
575 * now do the rest.
577 for (i = 0; i < n; i++) {
578 int stage;
579 unsigned int bit = 1ul << i;
580 if (conflicts & bit) {
581 src[i + o->merge] = o->df_conflict_entry;
582 continue;
584 if (!(mask & bit))
585 continue;
586 if (!o->merge)
587 stage = 0;
588 else if (i + 1 < o->head_idx)
589 stage = 1;
590 else if (i + 1 > o->head_idx)
591 stage = 3;
592 else
593 stage = 2;
594 src[i + o->merge] = create_ce_entry(info, names + i, stage);
597 if (o->merge) {
598 int rc = call_unpack_fn((const struct cache_entry * const *)src,
600 for (i = 0; i < n; i++) {
601 struct cache_entry *ce = src[i + o->merge];
602 if (ce != o->df_conflict_entry)
603 free(ce);
605 return rc;
608 for (i = 0; i < n; i++)
609 if (src[i] && src[i] != o->df_conflict_entry)
610 if (do_add_entry(o, src[i], 0, 0))
611 return -1;
613 return 0;
616 static int unpack_failed(struct unpack_trees_options *o, const char *message)
618 discard_index(&o->result);
619 if (!o->gently && !o->exiting_early) {
620 if (message)
621 return error("%s", message);
622 return -1;
624 return -1;
627 /* NEEDSWORK: give this a better name and share with tree-walk.c */
628 static int name_compare(const char *a, int a_len,
629 const char *b, int b_len)
631 int len = (a_len < b_len) ? a_len : b_len;
632 int cmp = memcmp(a, b, len);
633 if (cmp)
634 return cmp;
635 return (a_len - b_len);
639 * The tree traversal is looking at name p. If we have a matching entry,
640 * return it. If name p is a directory in the index, do not return
641 * anything, as we will want to match it when the traversal descends into
642 * the directory.
644 static int find_cache_pos(struct traverse_info *info,
645 const struct name_entry *p)
647 int pos;
648 struct unpack_trees_options *o = info->data;
649 struct index_state *index = o->src_index;
650 int pfxlen = info->pathlen;
651 int p_len = tree_entry_len(p);
653 for (pos = o->cache_bottom; pos < index->cache_nr; pos++) {
654 const struct cache_entry *ce = index->cache[pos];
655 const char *ce_name, *ce_slash;
656 int cmp, ce_len;
658 if (ce->ce_flags & CE_UNPACKED) {
660 * cache_bottom entry is already unpacked, so
661 * we can never match it; don't check it
662 * again.
664 if (pos == o->cache_bottom)
665 ++o->cache_bottom;
666 continue;
668 if (!ce_in_traverse_path(ce, info))
669 continue;
670 ce_name = ce->name + pfxlen;
671 ce_slash = strchr(ce_name, '/');
672 if (ce_slash)
673 ce_len = ce_slash - ce_name;
674 else
675 ce_len = ce_namelen(ce) - pfxlen;
676 cmp = name_compare(p->path, p_len, ce_name, ce_len);
678 * Exact match; if we have a directory we need to
679 * delay returning it.
681 if (!cmp)
682 return ce_slash ? -2 - pos : pos;
683 if (0 < cmp)
684 continue; /* keep looking */
686 * ce_name sorts after p->path; could it be that we
687 * have files under p->path directory in the index?
688 * E.g. ce_name == "t-i", and p->path == "t"; we may
689 * have "t/a" in the index.
691 if (p_len < ce_len && !memcmp(ce_name, p->path, p_len) &&
692 ce_name[p_len] < '/')
693 continue; /* keep looking */
694 break;
696 return -1;
699 static struct cache_entry *find_cache_entry(struct traverse_info *info,
700 const struct name_entry *p)
702 int pos = find_cache_pos(info, p);
703 struct unpack_trees_options *o = info->data;
705 if (0 <= pos)
706 return o->src_index->cache[pos];
707 else
708 return NULL;
711 static void debug_path(struct traverse_info *info)
713 if (info->prev) {
714 debug_path(info->prev);
715 if (*info->prev->name.path)
716 putchar('/');
718 printf("%s", info->name.path);
721 static void debug_name_entry(int i, struct name_entry *n)
723 printf("ent#%d %06o %s\n", i,
724 n->path ? n->mode : 0,
725 n->path ? n->path : "(missing)");
728 static void debug_unpack_callback(int n,
729 unsigned long mask,
730 unsigned long dirmask,
731 struct name_entry *names,
732 struct traverse_info *info)
734 int i;
735 printf("* unpack mask %lu, dirmask %lu, cnt %d ",
736 mask, dirmask, n);
737 debug_path(info);
738 putchar('\n');
739 for (i = 0; i < n; i++)
740 debug_name_entry(i, names + i);
743 static int unpack_callback(int n, unsigned long mask, unsigned long dirmask, struct name_entry *names, struct traverse_info *info)
745 struct cache_entry *src[MAX_UNPACK_TREES + 1] = { NULL, };
746 struct unpack_trees_options *o = info->data;
747 const struct name_entry *p = names;
749 /* Find first entry with a real name (we could use "mask" too) */
750 while (!p->mode)
751 p++;
753 if (o->debug_unpack)
754 debug_unpack_callback(n, mask, dirmask, names, info);
756 /* Are we supposed to look at the index too? */
757 if (o->merge) {
758 while (1) {
759 int cmp;
760 struct cache_entry *ce;
762 if (o->diff_index_cached)
763 ce = next_cache_entry(o);
764 else
765 ce = find_cache_entry(info, p);
767 if (!ce)
768 break;
769 cmp = compare_entry(ce, info, p);
770 if (cmp < 0) {
771 if (unpack_index_entry(ce, o) < 0)
772 return unpack_failed(o, NULL);
773 continue;
775 if (!cmp) {
776 if (ce_stage(ce)) {
778 * If we skip unmerged index
779 * entries, we'll skip this
780 * entry *and* the tree
781 * entries associated with it!
783 if (o->skip_unmerged) {
784 add_same_unmerged(ce, o);
785 return mask;
788 src[0] = ce;
790 break;
794 if (unpack_nondirectories(n, mask, dirmask, src, names, info) < 0)
795 return -1;
797 if (o->merge && src[0]) {
798 if (ce_stage(src[0]))
799 mark_ce_used_same_name(src[0], o);
800 else
801 mark_ce_used(src[0], o);
804 /* Now handle any directories.. */
805 if (dirmask) {
806 /* special case: "diff-index --cached" looking at a tree */
807 if (o->diff_index_cached &&
808 n == 1 && dirmask == 1 && S_ISDIR(names->mode)) {
809 int matches;
810 matches = cache_tree_matches_traversal(o->src_index->cache_tree,
811 names, info);
813 * Everything under the name matches; skip the
814 * entire hierarchy. diff_index_cached codepath
815 * special cases D/F conflicts in such a way that
816 * it does not do any look-ahead, so this is safe.
818 if (matches) {
819 o->cache_bottom += matches;
820 return mask;
824 if (traverse_trees_recursive(n, dirmask, mask & ~dirmask,
825 names, info) < 0)
826 return -1;
827 return mask;
830 return mask;
833 static int clear_ce_flags_1(struct cache_entry **cache, int nr,
834 struct strbuf *prefix,
835 int select_mask, int clear_mask,
836 struct exclude_list *el, int defval);
838 /* Whole directory matching */
839 static int clear_ce_flags_dir(struct cache_entry **cache, int nr,
840 struct strbuf *prefix,
841 char *basename,
842 int select_mask, int clear_mask,
843 struct exclude_list *el, int defval)
845 struct cache_entry **cache_end;
846 int dtype = DT_DIR;
847 int ret = is_excluded_from_list(prefix->buf, prefix->len,
848 basename, &dtype, el);
849 int rc;
851 strbuf_addch(prefix, '/');
853 /* If undecided, use matching result of parent dir in defval */
854 if (ret < 0)
855 ret = defval;
857 for (cache_end = cache; cache_end != cache + nr; cache_end++) {
858 struct cache_entry *ce = *cache_end;
859 if (strncmp(ce->name, prefix->buf, prefix->len))
860 break;
864 * TODO: check el, if there are no patterns that may conflict
865 * with ret (iow, we know in advance the incl/excl
866 * decision for the entire directory), clear flag here without
867 * calling clear_ce_flags_1(). That function will call
868 * the expensive is_excluded_from_list() on every entry.
870 rc = clear_ce_flags_1(cache, cache_end - cache,
871 prefix,
872 select_mask, clear_mask,
873 el, ret);
874 strbuf_setlen(prefix, prefix->len - 1);
875 return rc;
879 * Traverse the index, find every entry that matches according to
880 * o->el. Do "ce_flags &= ~clear_mask" on those entries. Return the
881 * number of traversed entries.
883 * If select_mask is non-zero, only entries whose ce_flags has on of
884 * those bits enabled are traversed.
886 * cache : pointer to an index entry
887 * prefix_len : an offset to its path
889 * The current path ("prefix") including the trailing '/' is
890 * cache[0]->name[0..(prefix_len-1)]
891 * Top level path has prefix_len zero.
893 static int clear_ce_flags_1(struct cache_entry **cache, int nr,
894 struct strbuf *prefix,
895 int select_mask, int clear_mask,
896 struct exclude_list *el, int defval)
898 struct cache_entry **cache_end = cache + nr;
901 * Process all entries that have the given prefix and meet
902 * select_mask condition
904 while(cache != cache_end) {
905 struct cache_entry *ce = *cache;
906 const char *name, *slash;
907 int len, dtype, ret;
909 if (select_mask && !(ce->ce_flags & select_mask)) {
910 cache++;
911 continue;
914 if (prefix->len && strncmp(ce->name, prefix->buf, prefix->len))
915 break;
917 name = ce->name + prefix->len;
918 slash = strchr(name, '/');
920 /* If it's a directory, try whole directory match first */
921 if (slash) {
922 int processed;
924 len = slash - name;
925 strbuf_add(prefix, name, len);
927 processed = clear_ce_flags_dir(cache, cache_end - cache,
928 prefix,
929 prefix->buf + prefix->len - len,
930 select_mask, clear_mask,
931 el, defval);
933 /* clear_c_f_dir eats a whole dir already? */
934 if (processed) {
935 cache += processed;
936 strbuf_setlen(prefix, prefix->len - len);
937 continue;
940 strbuf_addch(prefix, '/');
941 cache += clear_ce_flags_1(cache, cache_end - cache,
942 prefix,
943 select_mask, clear_mask, el, defval);
944 strbuf_setlen(prefix, prefix->len - len - 1);
945 continue;
948 /* Non-directory */
949 dtype = ce_to_dtype(ce);
950 ret = is_excluded_from_list(ce->name, ce_namelen(ce),
951 name, &dtype, el);
952 if (ret < 0)
953 ret = defval;
954 if (ret > 0)
955 ce->ce_flags &= ~clear_mask;
956 cache++;
958 return nr - (cache_end - cache);
961 static int clear_ce_flags(struct cache_entry **cache, int nr,
962 int select_mask, int clear_mask,
963 struct exclude_list *el)
965 static struct strbuf prefix = STRBUF_INIT;
967 strbuf_reset(&prefix);
969 return clear_ce_flags_1(cache, nr,
970 &prefix,
971 select_mask, clear_mask,
972 el, 0);
976 * Set/Clear CE_NEW_SKIP_WORKTREE according to $GIT_DIR/info/sparse-checkout
978 static void mark_new_skip_worktree(struct exclude_list *el,
979 struct index_state *the_index,
980 int select_flag, int skip_wt_flag)
982 int i;
985 * 1. Pretend the narrowest worktree: only unmerged entries
986 * are checked out
988 for (i = 0; i < the_index->cache_nr; i++) {
989 struct cache_entry *ce = the_index->cache[i];
991 if (select_flag && !(ce->ce_flags & select_flag))
992 continue;
994 if (!ce_stage(ce))
995 ce->ce_flags |= skip_wt_flag;
996 else
997 ce->ce_flags &= ~skip_wt_flag;
1001 * 2. Widen worktree according to sparse-checkout file.
1002 * Matched entries will have skip_wt_flag cleared (i.e. "in")
1004 clear_ce_flags(the_index->cache, the_index->cache_nr,
1005 select_flag, skip_wt_flag, el);
1008 static int verify_absent(const struct cache_entry *,
1009 enum unpack_trees_error_types,
1010 struct unpack_trees_options *);
1012 * N-way merge "len" trees. Returns 0 on success, -1 on failure to manipulate the
1013 * resulting index, -2 on failure to reflect the changes to the work tree.
1015 * CE_ADDED, CE_UNPACKED and CE_NEW_SKIP_WORKTREE are used internally
1017 int unpack_trees(unsigned len, struct tree_desc *t, struct unpack_trees_options *o)
1019 int i, ret;
1020 static struct cache_entry *dfc;
1021 struct exclude_list el;
1023 if (len > MAX_UNPACK_TREES)
1024 die("unpack_trees takes at most %d trees", MAX_UNPACK_TREES);
1025 memset(&state, 0, sizeof(state));
1026 state.base_dir = "";
1027 state.force = 1;
1028 state.quiet = 1;
1029 state.refresh_cache = 1;
1031 memset(&el, 0, sizeof(el));
1032 if (!core_apply_sparse_checkout || !o->update)
1033 o->skip_sparse_checkout = 1;
1034 if (!o->skip_sparse_checkout) {
1035 if (add_excludes_from_file_to_list(git_path("info/sparse-checkout"), "", 0, &el, 0) < 0)
1036 o->skip_sparse_checkout = 1;
1037 else
1038 o->el = &el;
1041 memset(&o->result, 0, sizeof(o->result));
1042 o->result.initialized = 1;
1043 o->result.timestamp.sec = o->src_index->timestamp.sec;
1044 o->result.timestamp.nsec = o->src_index->timestamp.nsec;
1045 o->result.version = o->src_index->version;
1046 o->merge_size = len;
1047 mark_all_ce_unused(o->src_index);
1050 * Sparse checkout loop #1: set NEW_SKIP_WORKTREE on existing entries
1052 if (!o->skip_sparse_checkout)
1053 mark_new_skip_worktree(o->el, o->src_index, 0, CE_NEW_SKIP_WORKTREE);
1055 if (!dfc)
1056 dfc = xcalloc(1, cache_entry_size(0));
1057 o->df_conflict_entry = dfc;
1059 if (len) {
1060 const char *prefix = o->prefix ? o->prefix : "";
1061 struct traverse_info info;
1063 setup_traverse_info(&info, prefix);
1064 info.fn = unpack_callback;
1065 info.data = o;
1066 info.show_all_errors = o->show_all_errors;
1067 info.pathspec = o->pathspec;
1069 if (o->prefix) {
1071 * Unpack existing index entries that sort before the
1072 * prefix the tree is spliced into. Note that o->merge
1073 * is always true in this case.
1075 while (1) {
1076 struct cache_entry *ce = next_cache_entry(o);
1077 if (!ce)
1078 break;
1079 if (ce_in_traverse_path(ce, &info))
1080 break;
1081 if (unpack_index_entry(ce, o) < 0)
1082 goto return_failed;
1086 if (traverse_trees(len, t, &info) < 0)
1087 goto return_failed;
1090 /* Any left-over entries in the index? */
1091 if (o->merge) {
1092 while (1) {
1093 struct cache_entry *ce = next_cache_entry(o);
1094 if (!ce)
1095 break;
1096 if (unpack_index_entry(ce, o) < 0)
1097 goto return_failed;
1100 mark_all_ce_unused(o->src_index);
1102 if (o->trivial_merges_only && o->nontrivial_merge) {
1103 ret = unpack_failed(o, "Merge requires file-level merging");
1104 goto done;
1107 if (!o->skip_sparse_checkout) {
1108 int empty_worktree = 1;
1111 * Sparse checkout loop #2: set NEW_SKIP_WORKTREE on entries not in loop #1
1112 * If the will have NEW_SKIP_WORKTREE, also set CE_SKIP_WORKTREE
1113 * so apply_sparse_checkout() won't attempt to remove it from worktree
1115 mark_new_skip_worktree(o->el, &o->result, CE_ADDED, CE_SKIP_WORKTREE | CE_NEW_SKIP_WORKTREE);
1117 ret = 0;
1118 for (i = 0; i < o->result.cache_nr; i++) {
1119 struct cache_entry *ce = o->result.cache[i];
1122 * Entries marked with CE_ADDED in merged_entry() do not have
1123 * verify_absent() check (the check is effectively disabled
1124 * because CE_NEW_SKIP_WORKTREE is set unconditionally).
1126 * Do the real check now because we have had
1127 * correct CE_NEW_SKIP_WORKTREE
1129 if (ce->ce_flags & CE_ADDED &&
1130 verify_absent(ce, ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN, o)) {
1131 if (!o->show_all_errors)
1132 goto return_failed;
1133 ret = -1;
1136 if (apply_sparse_checkout(ce, o)) {
1137 if (!o->show_all_errors)
1138 goto return_failed;
1139 ret = -1;
1141 if (!ce_skip_worktree(ce))
1142 empty_worktree = 0;
1145 if (ret < 0)
1146 goto return_failed;
1148 * Sparse checkout is meant to narrow down checkout area
1149 * but it does not make sense to narrow down to empty working
1150 * tree. This is usually a mistake in sparse checkout rules.
1151 * Do not allow users to do that.
1153 if (o->result.cache_nr && empty_worktree) {
1154 ret = unpack_failed(o, "Sparse checkout leaves no entry on working directory");
1155 goto done;
1159 o->src_index = NULL;
1160 ret = check_updates(o) ? (-2) : 0;
1161 if (o->dst_index) {
1162 discard_index(o->dst_index);
1163 *o->dst_index = o->result;
1166 done:
1167 clear_exclude_list(&el);
1168 return ret;
1170 return_failed:
1171 if (o->show_all_errors)
1172 display_error_msgs(o);
1173 mark_all_ce_unused(o->src_index);
1174 ret = unpack_failed(o, NULL);
1175 if (o->exiting_early)
1176 ret = 0;
1177 goto done;
1180 /* Here come the merge functions */
1182 static int reject_merge(const struct cache_entry *ce,
1183 struct unpack_trees_options *o)
1185 return add_rejected_path(o, ERROR_WOULD_OVERWRITE, ce->name);
1188 static int same(const struct cache_entry *a, const struct cache_entry *b)
1190 if (!!a != !!b)
1191 return 0;
1192 if (!a && !b)
1193 return 1;
1194 if ((a->ce_flags | b->ce_flags) & CE_CONFLICTED)
1195 return 0;
1196 return a->ce_mode == b->ce_mode &&
1197 !hashcmp(a->sha1, b->sha1);
1202 * When a CE gets turned into an unmerged entry, we
1203 * want it to be up-to-date
1205 static int verify_uptodate_1(const struct cache_entry *ce,
1206 struct unpack_trees_options *o,
1207 enum unpack_trees_error_types error_type)
1209 struct stat st;
1211 if (o->index_only)
1212 return 0;
1215 * CE_VALID and CE_SKIP_WORKTREE cheat, we better check again
1216 * if this entry is truly up-to-date because this file may be
1217 * overwritten.
1219 if ((ce->ce_flags & CE_VALID) || ce_skip_worktree(ce))
1220 ; /* keep checking */
1221 else if (o->reset || ce_uptodate(ce))
1222 return 0;
1224 if (!lstat(ce->name, &st)) {
1225 int flags = CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE;
1226 unsigned changed = ie_match_stat(o->src_index, ce, &st, flags);
1227 if (!changed)
1228 return 0;
1230 * NEEDSWORK: the current default policy is to allow
1231 * submodule to be out of sync wrt the superproject
1232 * index. This needs to be tightened later for
1233 * submodules that are marked to be automatically
1234 * checked out.
1236 if (S_ISGITLINK(ce->ce_mode))
1237 return 0;
1238 errno = 0;
1240 if (errno == ENOENT)
1241 return 0;
1242 return o->gently ? -1 :
1243 add_rejected_path(o, error_type, ce->name);
1246 static int verify_uptodate(const struct cache_entry *ce,
1247 struct unpack_trees_options *o)
1249 if (!o->skip_sparse_checkout && (ce->ce_flags & CE_NEW_SKIP_WORKTREE))
1250 return 0;
1251 return verify_uptodate_1(ce, o, ERROR_NOT_UPTODATE_FILE);
1254 static int verify_uptodate_sparse(const struct cache_entry *ce,
1255 struct unpack_trees_options *o)
1257 return verify_uptodate_1(ce, o, ERROR_SPARSE_NOT_UPTODATE_FILE);
1260 static void invalidate_ce_path(const struct cache_entry *ce,
1261 struct unpack_trees_options *o)
1263 if (ce)
1264 cache_tree_invalidate_path(o->src_index->cache_tree, ce->name);
1268 * Check that checking out ce->sha1 in subdir ce->name is not
1269 * going to overwrite any working files.
1271 * Currently, git does not checkout subprojects during a superproject
1272 * checkout, so it is not going to overwrite anything.
1274 static int verify_clean_submodule(const struct cache_entry *ce,
1275 enum unpack_trees_error_types error_type,
1276 struct unpack_trees_options *o)
1278 return 0;
1281 static int verify_clean_subdirectory(const struct cache_entry *ce,
1282 enum unpack_trees_error_types error_type,
1283 struct unpack_trees_options *o)
1286 * we are about to extract "ce->name"; we would not want to lose
1287 * anything in the existing directory there.
1289 int namelen;
1290 int i;
1291 struct dir_struct d;
1292 char *pathbuf;
1293 int cnt = 0;
1294 unsigned char sha1[20];
1296 if (S_ISGITLINK(ce->ce_mode) &&
1297 resolve_gitlink_ref(ce->name, "HEAD", sha1) == 0) {
1298 /* If we are not going to update the submodule, then
1299 * we don't care.
1301 if (!hashcmp(sha1, ce->sha1))
1302 return 0;
1303 return verify_clean_submodule(ce, error_type, o);
1307 * First let's make sure we do not have a local modification
1308 * in that directory.
1310 namelen = ce_namelen(ce);
1311 for (i = locate_in_src_index(ce, o);
1312 i < o->src_index->cache_nr;
1313 i++) {
1314 struct cache_entry *ce2 = o->src_index->cache[i];
1315 int len = ce_namelen(ce2);
1316 if (len < namelen ||
1317 strncmp(ce->name, ce2->name, namelen) ||
1318 ce2->name[namelen] != '/')
1319 break;
1321 * ce2->name is an entry in the subdirectory to be
1322 * removed.
1324 if (!ce_stage(ce2)) {
1325 if (verify_uptodate(ce2, o))
1326 return -1;
1327 add_entry(o, ce2, CE_REMOVE, 0);
1328 mark_ce_used(ce2, o);
1330 cnt++;
1334 * Then we need to make sure that we do not lose a locally
1335 * present file that is not ignored.
1337 pathbuf = xmalloc(namelen + 2);
1338 memcpy(pathbuf, ce->name, namelen);
1339 strcpy(pathbuf+namelen, "/");
1341 memset(&d, 0, sizeof(d));
1342 if (o->dir)
1343 d.exclude_per_dir = o->dir->exclude_per_dir;
1344 i = read_directory(&d, pathbuf, namelen+1, NULL);
1345 if (i)
1346 return o->gently ? -1 :
1347 add_rejected_path(o, ERROR_NOT_UPTODATE_DIR, ce->name);
1348 free(pathbuf);
1349 return cnt;
1353 * This gets called when there was no index entry for the tree entry 'dst',
1354 * but we found a file in the working tree that 'lstat()' said was fine,
1355 * and we're on a case-insensitive filesystem.
1357 * See if we can find a case-insensitive match in the index that also
1358 * matches the stat information, and assume it's that other file!
1360 static int icase_exists(struct unpack_trees_options *o, const char *name, int len, struct stat *st)
1362 const struct cache_entry *src;
1364 src = index_file_exists(o->src_index, name, len, 1);
1365 return src && !ie_match_stat(o->src_index, src, st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE);
1368 static int check_ok_to_remove(const char *name, int len, int dtype,
1369 const struct cache_entry *ce, struct stat *st,
1370 enum unpack_trees_error_types error_type,
1371 struct unpack_trees_options *o)
1373 const struct cache_entry *result;
1376 * It may be that the 'lstat()' succeeded even though
1377 * target 'ce' was absent, because there is an old
1378 * entry that is different only in case..
1380 * Ignore that lstat() if it matches.
1382 if (ignore_case && icase_exists(o, name, len, st))
1383 return 0;
1385 if (o->dir &&
1386 is_excluded(o->dir, name, &dtype))
1388 * ce->name is explicitly excluded, so it is Ok to
1389 * overwrite it.
1391 return 0;
1392 if (S_ISDIR(st->st_mode)) {
1394 * We are checking out path "foo" and
1395 * found "foo/." in the working tree.
1396 * This is tricky -- if we have modified
1397 * files that are in "foo/" we would lose
1398 * them.
1400 if (verify_clean_subdirectory(ce, error_type, o) < 0)
1401 return -1;
1402 return 0;
1406 * The previous round may already have decided to
1407 * delete this path, which is in a subdirectory that
1408 * is being replaced with a blob.
1410 result = index_file_exists(&o->result, name, len, 0);
1411 if (result) {
1412 if (result->ce_flags & CE_REMOVE)
1413 return 0;
1416 return o->gently ? -1 :
1417 add_rejected_path(o, error_type, name);
1421 * We do not want to remove or overwrite a working tree file that
1422 * is not tracked, unless it is ignored.
1424 static int verify_absent_1(const struct cache_entry *ce,
1425 enum unpack_trees_error_types error_type,
1426 struct unpack_trees_options *o)
1428 int len;
1429 struct stat st;
1431 if (o->index_only || o->reset || !o->update)
1432 return 0;
1434 len = check_leading_path(ce->name, ce_namelen(ce));
1435 if (!len)
1436 return 0;
1437 else if (len > 0) {
1438 char path[PATH_MAX + 1];
1439 memcpy(path, ce->name, len);
1440 path[len] = 0;
1441 if (lstat(path, &st))
1442 return error("cannot stat '%s': %s", path,
1443 strerror(errno));
1445 return check_ok_to_remove(path, len, DT_UNKNOWN, NULL, &st,
1446 error_type, o);
1447 } else if (lstat(ce->name, &st)) {
1448 if (errno != ENOENT)
1449 return error("cannot stat '%s': %s", ce->name,
1450 strerror(errno));
1451 return 0;
1452 } else {
1453 return check_ok_to_remove(ce->name, ce_namelen(ce),
1454 ce_to_dtype(ce), ce, &st,
1455 error_type, o);
1459 static int verify_absent(const struct cache_entry *ce,
1460 enum unpack_trees_error_types error_type,
1461 struct unpack_trees_options *o)
1463 if (!o->skip_sparse_checkout && (ce->ce_flags & CE_NEW_SKIP_WORKTREE))
1464 return 0;
1465 return verify_absent_1(ce, error_type, o);
1468 static int verify_absent_sparse(const struct cache_entry *ce,
1469 enum unpack_trees_error_types error_type,
1470 struct unpack_trees_options *o)
1472 enum unpack_trees_error_types orphaned_error = error_type;
1473 if (orphaned_error == ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN)
1474 orphaned_error = ERROR_WOULD_LOSE_ORPHANED_OVERWRITTEN;
1476 return verify_absent_1(ce, orphaned_error, o);
1479 static int merged_entry(const struct cache_entry *ce,
1480 const struct cache_entry *old,
1481 struct unpack_trees_options *o)
1483 int update = CE_UPDATE;
1484 struct cache_entry *merge = dup_entry(ce);
1486 if (!old) {
1488 * New index entries. In sparse checkout, the following
1489 * verify_absent() will be delayed until after
1490 * traverse_trees() finishes in unpack_trees(), then:
1492 * - CE_NEW_SKIP_WORKTREE will be computed correctly
1493 * - verify_absent() be called again, this time with
1494 * correct CE_NEW_SKIP_WORKTREE
1496 * verify_absent() call here does nothing in sparse
1497 * checkout (i.e. o->skip_sparse_checkout == 0)
1499 update |= CE_ADDED;
1500 merge->ce_flags |= CE_NEW_SKIP_WORKTREE;
1502 if (verify_absent(merge,
1503 ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN, o)) {
1504 free(merge);
1505 return -1;
1507 invalidate_ce_path(merge, o);
1508 } else if (!(old->ce_flags & CE_CONFLICTED)) {
1510 * See if we can re-use the old CE directly?
1511 * That way we get the uptodate stat info.
1513 * This also removes the UPDATE flag on a match; otherwise
1514 * we will end up overwriting local changes in the work tree.
1516 if (same(old, merge)) {
1517 copy_cache_entry(merge, old);
1518 update = 0;
1519 } else {
1520 if (verify_uptodate(old, o)) {
1521 free(merge);
1522 return -1;
1524 /* Migrate old flags over */
1525 update |= old->ce_flags & (CE_SKIP_WORKTREE | CE_NEW_SKIP_WORKTREE);
1526 invalidate_ce_path(old, o);
1528 } else {
1530 * Previously unmerged entry left as an existence
1531 * marker by read_index_unmerged();
1533 invalidate_ce_path(old, o);
1536 do_add_entry(o, merge, update, CE_STAGEMASK);
1537 return 1;
1540 static int deleted_entry(const struct cache_entry *ce,
1541 const struct cache_entry *old,
1542 struct unpack_trees_options *o)
1544 /* Did it exist in the index? */
1545 if (!old) {
1546 if (verify_absent(ce, ERROR_WOULD_LOSE_UNTRACKED_REMOVED, o))
1547 return -1;
1548 return 0;
1550 if (!(old->ce_flags & CE_CONFLICTED) && verify_uptodate(old, o))
1551 return -1;
1552 add_entry(o, ce, CE_REMOVE, 0);
1553 invalidate_ce_path(ce, o);
1554 return 1;
1557 static int keep_entry(const struct cache_entry *ce,
1558 struct unpack_trees_options *o)
1560 add_entry(o, ce, 0, 0);
1561 return 1;
1564 #if DBRT_DEBUG
1565 static void show_stage_entry(FILE *o,
1566 const char *label, const struct cache_entry *ce)
1568 if (!ce)
1569 fprintf(o, "%s (missing)\n", label);
1570 else
1571 fprintf(o, "%s%06o %s %d\t%s\n",
1572 label,
1573 ce->ce_mode,
1574 sha1_to_hex(ce->sha1),
1575 ce_stage(ce),
1576 ce->name);
1578 #endif
1580 int threeway_merge(const struct cache_entry * const *stages,
1581 struct unpack_trees_options *o)
1583 const struct cache_entry *index;
1584 const struct cache_entry *head;
1585 const struct cache_entry *remote = stages[o->head_idx + 1];
1586 int count;
1587 int head_match = 0;
1588 int remote_match = 0;
1590 int df_conflict_head = 0;
1591 int df_conflict_remote = 0;
1593 int any_anc_missing = 0;
1594 int no_anc_exists = 1;
1595 int i;
1597 for (i = 1; i < o->head_idx; i++) {
1598 if (!stages[i] || stages[i] == o->df_conflict_entry)
1599 any_anc_missing = 1;
1600 else
1601 no_anc_exists = 0;
1604 index = stages[0];
1605 head = stages[o->head_idx];
1607 if (head == o->df_conflict_entry) {
1608 df_conflict_head = 1;
1609 head = NULL;
1612 if (remote == o->df_conflict_entry) {
1613 df_conflict_remote = 1;
1614 remote = NULL;
1618 * First, if there's a #16 situation, note that to prevent #13
1619 * and #14.
1621 if (!same(remote, head)) {
1622 for (i = 1; i < o->head_idx; i++) {
1623 if (same(stages[i], head)) {
1624 head_match = i;
1626 if (same(stages[i], remote)) {
1627 remote_match = i;
1633 * We start with cases where the index is allowed to match
1634 * something other than the head: #14(ALT) and #2ALT, where it
1635 * is permitted to match the result instead.
1637 /* #14, #14ALT, #2ALT */
1638 if (remote && !df_conflict_head && head_match && !remote_match) {
1639 if (index && !same(index, remote) && !same(index, head))
1640 return o->gently ? -1 : reject_merge(index, o);
1641 return merged_entry(remote, index, o);
1644 * If we have an entry in the index cache, then we want to
1645 * make sure that it matches head.
1647 if (index && !same(index, head))
1648 return o->gently ? -1 : reject_merge(index, o);
1650 if (head) {
1651 /* #5ALT, #15 */
1652 if (same(head, remote))
1653 return merged_entry(head, index, o);
1654 /* #13, #3ALT */
1655 if (!df_conflict_remote && remote_match && !head_match)
1656 return merged_entry(head, index, o);
1659 /* #1 */
1660 if (!head && !remote && any_anc_missing)
1661 return 0;
1664 * Under the "aggressive" rule, we resolve mostly trivial
1665 * cases that we historically had git-merge-one-file resolve.
1667 if (o->aggressive) {
1668 int head_deleted = !head;
1669 int remote_deleted = !remote;
1670 const struct cache_entry *ce = NULL;
1672 if (index)
1673 ce = index;
1674 else if (head)
1675 ce = head;
1676 else if (remote)
1677 ce = remote;
1678 else {
1679 for (i = 1; i < o->head_idx; i++) {
1680 if (stages[i] && stages[i] != o->df_conflict_entry) {
1681 ce = stages[i];
1682 break;
1688 * Deleted in both.
1689 * Deleted in one and unchanged in the other.
1691 if ((head_deleted && remote_deleted) ||
1692 (head_deleted && remote && remote_match) ||
1693 (remote_deleted && head && head_match)) {
1694 if (index)
1695 return deleted_entry(index, index, o);
1696 if (ce && !head_deleted) {
1697 if (verify_absent(ce, ERROR_WOULD_LOSE_UNTRACKED_REMOVED, o))
1698 return -1;
1700 return 0;
1703 * Added in both, identically.
1705 if (no_anc_exists && head && remote && same(head, remote))
1706 return merged_entry(head, index, o);
1710 /* Below are "no merge" cases, which require that the index be
1711 * up-to-date to avoid the files getting overwritten with
1712 * conflict resolution files.
1714 if (index) {
1715 if (verify_uptodate(index, o))
1716 return -1;
1719 o->nontrivial_merge = 1;
1721 /* #2, #3, #4, #6, #7, #9, #10, #11. */
1722 count = 0;
1723 if (!head_match || !remote_match) {
1724 for (i = 1; i < o->head_idx; i++) {
1725 if (stages[i] && stages[i] != o->df_conflict_entry) {
1726 keep_entry(stages[i], o);
1727 count++;
1728 break;
1732 #if DBRT_DEBUG
1733 else {
1734 fprintf(stderr, "read-tree: warning #16 detected\n");
1735 show_stage_entry(stderr, "head ", stages[head_match]);
1736 show_stage_entry(stderr, "remote ", stages[remote_match]);
1738 #endif
1739 if (head) { count += keep_entry(head, o); }
1740 if (remote) { count += keep_entry(remote, o); }
1741 return count;
1745 * Two-way merge.
1747 * The rule is to "carry forward" what is in the index without losing
1748 * information across a "fast-forward", favoring a successful merge
1749 * over a merge failure when it makes sense. For details of the
1750 * "carry forward" rule, please see <Documentation/git-read-tree.txt>.
1753 int twoway_merge(const struct cache_entry * const *src,
1754 struct unpack_trees_options *o)
1756 const struct cache_entry *current = src[0];
1757 const struct cache_entry *oldtree = src[1];
1758 const struct cache_entry *newtree = src[2];
1760 if (o->merge_size != 2)
1761 return error("Cannot do a twoway merge of %d trees",
1762 o->merge_size);
1764 if (oldtree == o->df_conflict_entry)
1765 oldtree = NULL;
1766 if (newtree == o->df_conflict_entry)
1767 newtree = NULL;
1769 if (current) {
1770 if (current->ce_flags & CE_CONFLICTED) {
1771 if (same(oldtree, newtree) || o->reset) {
1772 if (!newtree)
1773 return deleted_entry(current, current, o);
1774 else
1775 return merged_entry(newtree, current, o);
1777 return o->gently ? -1 : reject_merge(current, o);
1779 else if ((!oldtree && !newtree) || /* 4 and 5 */
1780 (!oldtree && newtree &&
1781 same(current, newtree)) || /* 6 and 7 */
1782 (oldtree && newtree &&
1783 same(oldtree, newtree)) || /* 14 and 15 */
1784 (oldtree && newtree &&
1785 !same(oldtree, newtree) && /* 18 and 19 */
1786 same(current, newtree))) {
1787 return keep_entry(current, o);
1789 else if (oldtree && !newtree && same(current, oldtree)) {
1790 /* 10 or 11 */
1791 return deleted_entry(oldtree, current, o);
1793 else if (oldtree && newtree &&
1794 same(current, oldtree) && !same(current, newtree)) {
1795 /* 20 or 21 */
1796 return merged_entry(newtree, current, o);
1798 else {
1799 /* all other failures */
1800 if (oldtree)
1801 return o->gently ? -1 : reject_merge(oldtree, o);
1802 if (current)
1803 return o->gently ? -1 : reject_merge(current, o);
1804 if (newtree)
1805 return o->gently ? -1 : reject_merge(newtree, o);
1806 return -1;
1809 else if (newtree) {
1810 if (oldtree && !o->initial_checkout) {
1812 * deletion of the path was staged;
1814 if (same(oldtree, newtree))
1815 return 1;
1816 return reject_merge(oldtree, o);
1818 return merged_entry(newtree, current, o);
1820 return deleted_entry(oldtree, current, o);
1824 * Bind merge.
1826 * Keep the index entries at stage0, collapse stage1 but make sure
1827 * stage0 does not have anything there.
1829 int bind_merge(const struct cache_entry * const *src,
1830 struct unpack_trees_options *o)
1832 const struct cache_entry *old = src[0];
1833 const struct cache_entry *a = src[1];
1835 if (o->merge_size != 1)
1836 return error("Cannot do a bind merge of %d trees",
1837 o->merge_size);
1838 if (a && old)
1839 return o->gently ? -1 :
1840 error(ERRORMSG(o, ERROR_BIND_OVERLAP), a->name, old->name);
1841 if (!a)
1842 return keep_entry(old, o);
1843 else
1844 return merged_entry(a, NULL, o);
1848 * One-way merge.
1850 * The rule is:
1851 * - take the stat information from stage0, take the data from stage1
1853 int oneway_merge(const struct cache_entry * const *src,
1854 struct unpack_trees_options *o)
1856 const struct cache_entry *old = src[0];
1857 const struct cache_entry *a = src[1];
1859 if (o->merge_size != 1)
1860 return error("Cannot do a oneway merge of %d trees",
1861 o->merge_size);
1863 if (!a || a == o->df_conflict_entry)
1864 return deleted_entry(old, old, o);
1866 if (old && same(old, a)) {
1867 int update = 0;
1868 if (o->reset && o->update && !ce_uptodate(old) && !ce_skip_worktree(old)) {
1869 struct stat st;
1870 if (lstat(old->name, &st) ||
1871 ie_match_stat(o->src_index, old, &st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE))
1872 update |= CE_UPDATE;
1874 add_entry(o, old, update, 0);
1875 return 0;
1877 return merged_entry(a, old, o);