1 #define NO_THE_INDEX_COMPATIBILITY_MACROS
6 #include "cache-tree.h"
7 #include "unpack-trees.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 set_porcelain_error_msgs(), for example.
19 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 static void add_entry(struct unpack_trees_options *o, struct cache_entry *ce,
54 unsigned int set, unsigned int clear)
56 unsigned int size = ce_size(ce);
57 struct cache_entry *new = xmalloc(size);
59 clear |= CE_HASHED | CE_UNHASHED;
61 memcpy(new, ce, size);
63 new->ce_flags = (new->ce_flags & ~clear) | set;
64 add_index_entry(&o->result, new, ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE);
68 * add error messages on path <path>
69 * corresponding to the type <e> with the message <msg>
70 * indicating if it should be display in porcelain or not
72 static int add_rejected_path(struct unpack_trees_options *o,
73 enum unpack_trees_error_types e,
76 struct rejected_paths_list *newentry;
77 int porcelain = o && (o)->msgs[e];
79 * simply display the given error message if in plumbing mode
82 o->show_all_errors = 0;
83 if (!o->show_all_errors)
84 return error(ERRORMSG(o, e), path);
87 * Otherwise, insert in a list for future display by
88 * display_error_msgs()
90 newentry = xmalloc(sizeof(struct rejected_paths_list));
91 newentry->path = (char *)path;
92 newentry->next = o->unpack_rejects[e];
93 o->unpack_rejects[e] = newentry;
98 * free all the structures allocated for the error <e>
100 static void free_rejected_paths(struct unpack_trees_options *o,
101 enum unpack_trees_error_types e)
103 while (o->unpack_rejects[e]) {
104 struct rejected_paths_list *del = o->unpack_rejects[e];
105 o->unpack_rejects[e] = o->unpack_rejects[e]->next;
108 free(o->unpack_rejects[e]);
112 * display all the error messages stored in a nice way
114 static void display_error_msgs(struct unpack_trees_options *o)
117 int something_displayed = 0;
118 for (e = 0; e < NB_UNPACK_TREES_ERROR_TYPES; e++) {
119 if (o->unpack_rejects[e]) {
120 struct rejected_paths_list *rp;
121 struct strbuf path = STRBUF_INIT;
122 something_displayed = 1;
123 for (rp = o->unpack_rejects[e]; rp; rp = rp->next)
124 strbuf_addf(&path, "\t%s\n", rp->path);
125 error(ERRORMSG(o, e), path.buf);
126 strbuf_release(&path);
127 free_rejected_paths(o, e);
130 if (something_displayed)
131 printf("Aborting\n");
135 * Unlink the last component and schedule the leading directories for
136 * removal, such that empty directories get removed.
138 static void unlink_entry(struct cache_entry *ce)
140 if (has_symlink_or_noent_leading_path(ce->name, ce_namelen(ce)))
142 if (remove_or_warn(ce->ce_mode, ce->name))
144 schedule_dir_for_removal(ce->name, ce_namelen(ce));
147 static struct checkout state;
148 static int check_updates(struct unpack_trees_options *o)
150 unsigned cnt = 0, total = 0;
151 struct progress *progress = NULL;
152 struct index_state *index = &o->result;
156 if (o->update && o->verbose_update) {
157 for (total = cnt = 0; cnt < index->cache_nr; cnt++) {
158 struct cache_entry *ce = index->cache[cnt];
159 if (ce->ce_flags & (CE_UPDATE | CE_REMOVE | CE_WT_REMOVE))
163 progress = start_progress_delay("Checking out files",
169 git_attr_set_direction(GIT_ATTR_CHECKOUT, &o->result);
170 for (i = 0; i < index->cache_nr; i++) {
171 struct cache_entry *ce = index->cache[i];
173 if (ce->ce_flags & CE_WT_REMOVE) {
174 display_progress(progress, ++cnt);
180 if (ce->ce_flags & CE_REMOVE) {
181 display_progress(progress, ++cnt);
186 remove_marked_cache_entries(&o->result);
187 remove_scheduled_dirs();
189 for (i = 0; i < index->cache_nr; i++) {
190 struct cache_entry *ce = index->cache[i];
192 if (ce->ce_flags & CE_UPDATE) {
193 display_progress(progress, ++cnt);
194 ce->ce_flags &= ~CE_UPDATE;
196 errs |= checkout_entry(ce, &state, NULL);
200 stop_progress(&progress);
202 git_attr_set_direction(GIT_ATTR_CHECKIN, NULL);
206 static int verify_uptodate_sparse(struct cache_entry *ce, struct unpack_trees_options *o);
207 static int verify_absent_sparse(struct cache_entry *ce, enum unpack_trees_error_types, struct unpack_trees_options *o);
209 static int will_have_skip_worktree(const struct cache_entry *ce, struct unpack_trees_options *o)
211 const char *basename;
216 basename = strrchr(ce->name, '/');
217 basename = basename ? basename+1 : ce->name;
218 return excluded_from_list(ce->name, ce_namelen(ce), basename, NULL, o->el) <= 0;
221 static int apply_sparse_checkout(struct cache_entry *ce, struct unpack_trees_options *o)
223 int was_skip_worktree = ce_skip_worktree(ce);
225 if (will_have_skip_worktree(ce, o))
226 ce->ce_flags |= CE_SKIP_WORKTREE;
228 ce->ce_flags &= ~CE_SKIP_WORKTREE;
231 * We only care about files getting into the checkout area
232 * If merge strategies want to remove some, go ahead, this
233 * flag will be removed eventually in unpack_trees() if it's
234 * outside checkout area.
236 if (ce->ce_flags & CE_REMOVE)
239 if (!was_skip_worktree && ce_skip_worktree(ce)) {
241 * If CE_UPDATE is set, verify_uptodate() must be called already
242 * also stat info may have lost after merged_entry() so calling
243 * verify_uptodate() again may fail
245 if (!(ce->ce_flags & CE_UPDATE) && verify_uptodate_sparse(ce, o))
247 ce->ce_flags |= CE_WT_REMOVE;
249 if (was_skip_worktree && !ce_skip_worktree(ce)) {
250 if (verify_absent_sparse(ce, ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN, o))
252 ce->ce_flags |= CE_UPDATE;
257 static inline int call_unpack_fn(struct cache_entry **src, struct unpack_trees_options *o)
259 int ret = o->fn(src, o);
265 static void mark_ce_used(struct cache_entry *ce, struct unpack_trees_options *o)
267 ce->ce_flags |= CE_UNPACKED;
269 if (o->cache_bottom < o->src_index->cache_nr &&
270 o->src_index->cache[o->cache_bottom] == ce) {
271 int bottom = o->cache_bottom;
272 while (bottom < o->src_index->cache_nr &&
273 o->src_index->cache[bottom]->ce_flags & CE_UNPACKED)
275 o->cache_bottom = bottom;
279 static void mark_all_ce_unused(struct index_state *index)
282 for (i = 0; i < index->cache_nr; i++)
283 index->cache[i]->ce_flags &= ~CE_UNPACKED;
286 static int locate_in_src_index(struct cache_entry *ce,
287 struct unpack_trees_options *o)
289 struct index_state *index = o->src_index;
290 int len = ce_namelen(ce);
291 int pos = index_name_pos(index, ce->name, len);
298 * We call unpack_index_entry() with an unmerged cache entry
299 * only in diff-index, and it wants a single callback. Skip
300 * the other unmerged entry with the same name.
302 static void mark_ce_used_same_name(struct cache_entry *ce,
303 struct unpack_trees_options *o)
305 struct index_state *index = o->src_index;
306 int len = ce_namelen(ce);
309 for (pos = locate_in_src_index(ce, o); pos < index->cache_nr; pos++) {
310 struct cache_entry *next = index->cache[pos];
311 if (len != ce_namelen(next) ||
312 memcmp(ce->name, next->name, len))
314 mark_ce_used(next, o);
318 static struct cache_entry *next_cache_entry(struct unpack_trees_options *o)
320 const struct index_state *index = o->src_index;
321 int pos = o->cache_bottom;
323 while (pos < index->cache_nr) {
324 struct cache_entry *ce = index->cache[pos];
325 if (!(ce->ce_flags & CE_UNPACKED))
332 static void add_same_unmerged(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);
340 die("programming error in a caller of mark_ce_used_same_name");
341 for (pos = -pos - 1; pos < index->cache_nr; pos++) {
342 struct cache_entry *next = index->cache[pos];
343 if (len != ce_namelen(next) ||
344 memcmp(ce->name, next->name, len))
346 add_entry(o, next, 0, 0);
347 mark_ce_used(next, o);
351 static int unpack_index_entry(struct cache_entry *ce,
352 struct unpack_trees_options *o)
354 struct cache_entry *src[5] = { NULL };
361 if (o->skip_unmerged) {
362 add_entry(o, ce, 0, 0);
366 ret = call_unpack_fn(src, o);
368 mark_ce_used_same_name(ce, o);
372 static int find_cache_pos(struct traverse_info *, const struct name_entry *);
374 static void restore_cache_bottom(struct traverse_info *info, int bottom)
376 struct unpack_trees_options *o = info->data;
378 if (o->diff_index_cached)
380 o->cache_bottom = bottom;
383 static int switch_cache_bottom(struct traverse_info *info)
385 struct unpack_trees_options *o = info->data;
388 if (o->diff_index_cached)
390 ret = o->cache_bottom;
391 pos = find_cache_pos(info->prev, &info->name);
394 o->cache_bottom = -2 - pos;
396 o->cache_bottom = o->src_index->cache_nr;
400 static int traverse_trees_recursive(int n, unsigned long dirmask, unsigned long df_conflicts, struct name_entry *names, struct traverse_info *info)
403 struct tree_desc t[MAX_UNPACK_TREES];
404 void *buf[MAX_UNPACK_TREES];
405 struct traverse_info newinfo;
406 struct name_entry *p;
415 newinfo.pathlen += tree_entry_len(p->path, p->sha1) + 1;
416 newinfo.conflicts |= df_conflicts;
418 for (i = 0; i < n; i++, dirmask >>= 1) {
419 const unsigned char *sha1 = NULL;
421 sha1 = names[i].sha1;
422 buf[i] = fill_tree_descriptor(t+i, sha1);
425 bottom = switch_cache_bottom(&newinfo);
426 ret = traverse_trees(n, t, &newinfo);
427 restore_cache_bottom(&newinfo, bottom);
429 for (i = 0; i < n; i++)
436 * Compare the traverse-path to the cache entry without actually
437 * having to generate the textual representation of the traverse
440 * NOTE! This *only* compares up to the size of the traverse path
441 * itself - the caller needs to do the final check for the cache
442 * entry having more data at the end!
444 static int do_compare_entry(const struct cache_entry *ce, const struct traverse_info *info, const struct name_entry *n)
446 int len, pathlen, ce_len;
450 int cmp = do_compare_entry(ce, info->prev, &info->name);
454 pathlen = info->pathlen;
455 ce_len = ce_namelen(ce);
457 /* If ce_len < pathlen then we must have previously hit "name == directory" entry */
458 if (ce_len < pathlen)
462 ce_name = ce->name + pathlen;
464 len = tree_entry_len(n->path, n->sha1);
465 return df_name_compare(ce_name, ce_len, S_IFREG, n->path, len, n->mode);
468 static int compare_entry(const struct cache_entry *ce, const struct traverse_info *info, const struct name_entry *n)
470 int cmp = do_compare_entry(ce, info, n);
475 * Even if the beginning compared identically, the ce should
476 * compare as bigger than a directory leading up to it!
478 return ce_namelen(ce) > traverse_path_len(info, n);
481 static int ce_in_traverse_path(const struct cache_entry *ce,
482 const struct traverse_info *info)
486 if (do_compare_entry(ce, info->prev, &info->name))
489 * If ce (blob) is the same name as the path (which is a tree
490 * we will be descending into), it won't be inside it.
492 return (info->pathlen < ce_namelen(ce));
495 static struct cache_entry *create_ce_entry(const struct traverse_info *info, const struct name_entry *n, int stage)
497 int len = traverse_path_len(info, n);
498 struct cache_entry *ce = xcalloc(1, cache_entry_size(len));
500 ce->ce_mode = create_ce_mode(n->mode);
501 ce->ce_flags = create_ce_flags(len, stage);
502 hashcpy(ce->sha1, n->sha1);
503 make_traverse_path(ce->name, info, n);
508 static int unpack_nondirectories(int n, unsigned long mask,
509 unsigned long dirmask,
510 struct cache_entry **src,
511 const struct name_entry *names,
512 const struct traverse_info *info)
515 struct unpack_trees_options *o = info->data;
516 unsigned long conflicts;
518 /* Do we have *only* directories? Nothing to do */
519 if (mask == dirmask && !src[0])
522 conflicts = info->conflicts;
525 conflicts |= dirmask;
528 * Ok, we've filled in up to any potential index entry in src[0],
531 for (i = 0; i < n; i++) {
533 unsigned int bit = 1ul << i;
534 if (conflicts & bit) {
535 src[i + o->merge] = o->df_conflict_entry;
542 else if (i + 1 < o->head_idx)
544 else if (i + 1 > o->head_idx)
548 src[i + o->merge] = create_ce_entry(info, names + i, stage);
552 return call_unpack_fn(src, o);
554 for (i = 0; i < n; i++)
555 if (src[i] && src[i] != o->df_conflict_entry)
556 add_entry(o, src[i], 0, 0);
560 static int unpack_failed(struct unpack_trees_options *o, const char *message)
562 discard_index(&o->result);
565 return error("%s", message);
571 /* NEEDSWORK: give this a better name and share with tree-walk.c */
572 static int name_compare(const char *a, int a_len,
573 const char *b, int b_len)
575 int len = (a_len < b_len) ? a_len : b_len;
576 int cmp = memcmp(a, b, len);
579 return (a_len - b_len);
583 * The tree traversal is looking at name p. If we have a matching entry,
584 * return it. If name p is a directory in the index, do not return
585 * anything, as we will want to match it when the traversal descends into
588 static int find_cache_pos(struct traverse_info *info,
589 const struct name_entry *p)
592 struct unpack_trees_options *o = info->data;
593 struct index_state *index = o->src_index;
594 int pfxlen = info->pathlen;
595 int p_len = tree_entry_len(p->path, p->sha1);
597 for (pos = o->cache_bottom; pos < index->cache_nr; pos++) {
598 struct cache_entry *ce = index->cache[pos];
599 const char *ce_name, *ce_slash;
602 if (ce->ce_flags & CE_UNPACKED) {
604 * cache_bottom entry is already unpacked, so
605 * we can never match it; don't check it
608 if (pos == o->cache_bottom)
612 if (!ce_in_traverse_path(ce, info))
614 ce_name = ce->name + pfxlen;
615 ce_slash = strchr(ce_name, '/');
617 ce_len = ce_slash - ce_name;
619 ce_len = ce_namelen(ce) - pfxlen;
620 cmp = name_compare(p->path, p_len, ce_name, ce_len);
622 * Exact match; if we have a directory we need to
623 * delay returning it.
626 return ce_slash ? -2 - pos : pos;
628 continue; /* keep looking */
630 * ce_name sorts after p->path; could it be that we
631 * have files under p->path directory in the index?
632 * E.g. ce_name == "t-i", and p->path == "t"; we may
633 * have "t/a" in the index.
635 if (p_len < ce_len && !memcmp(ce_name, p->path, p_len) &&
636 ce_name[p_len] < '/')
637 continue; /* keep looking */
643 static struct cache_entry *find_cache_entry(struct traverse_info *info,
644 const struct name_entry *p)
646 int pos = find_cache_pos(info, p);
647 struct unpack_trees_options *o = info->data;
650 return o->src_index->cache[pos];
655 static void debug_path(struct traverse_info *info)
658 debug_path(info->prev);
659 if (*info->prev->name.path)
662 printf("%s", info->name.path);
665 static void debug_name_entry(int i, struct name_entry *n)
667 printf("ent#%d %06o %s\n", i,
668 n->path ? n->mode : 0,
669 n->path ? n->path : "(missing)");
672 static void debug_unpack_callback(int n,
674 unsigned long dirmask,
675 struct name_entry *names,
676 struct traverse_info *info)
679 printf("* unpack mask %lu, dirmask %lu, cnt %d ",
683 for (i = 0; i < n; i++)
684 debug_name_entry(i, names + i);
687 static int unpack_callback(int n, unsigned long mask, unsigned long dirmask, struct name_entry *names, struct traverse_info *info)
689 struct cache_entry *src[MAX_UNPACK_TREES + 1] = { NULL, };
690 struct unpack_trees_options *o = info->data;
691 const struct name_entry *p = names;
693 /* Find first entry with a real name (we could use "mask" too) */
698 debug_unpack_callback(n, mask, dirmask, names, info);
700 /* Are we supposed to look at the index too? */
704 struct cache_entry *ce;
706 if (o->diff_index_cached)
707 ce = next_cache_entry(o);
709 ce = find_cache_entry(info, p);
713 cmp = compare_entry(ce, info, p);
715 if (unpack_index_entry(ce, o) < 0)
716 return unpack_failed(o, NULL);
722 * If we skip unmerged index
723 * entries, we'll skip this
724 * entry *and* the tree
725 * entries associated with it!
727 if (o->skip_unmerged) {
728 add_same_unmerged(ce, o);
738 if (unpack_nondirectories(n, mask, dirmask, src, names, info) < 0)
742 if (ce_stage(src[0]))
743 mark_ce_used_same_name(src[0], o);
745 mark_ce_used(src[0], o);
748 /* Now handle any directories.. */
750 unsigned long conflicts = mask & ~dirmask;
757 /* special case: "diff-index --cached" looking at a tree */
758 if (o->diff_index_cached &&
759 n == 1 && dirmask == 1 && S_ISDIR(names->mode)) {
761 matches = cache_tree_matches_traversal(o->src_index->cache_tree,
764 * Everything under the name matches; skip the
765 * entire hierarchy. diff_index_cached codepath
766 * special cases D/F conflicts in such a way that
767 * it does not do any look-ahead, so this is safe.
770 o->cache_bottom += matches;
775 if (traverse_trees_recursive(n, dirmask, conflicts,
785 * N-way merge "len" trees. Returns 0 on success, -1 on failure to manipulate the
786 * resulting index, -2 on failure to reflect the changes to the work tree.
788 int unpack_trees(unsigned len, struct tree_desc *t, struct unpack_trees_options *o)
791 static struct cache_entry *dfc;
792 struct exclude_list el;
794 if (len > MAX_UNPACK_TREES)
795 die("unpack_trees takes at most %d trees", MAX_UNPACK_TREES);
796 memset(&state, 0, sizeof(state));
800 state.refresh_cache = 1;
802 memset(&el, 0, sizeof(el));
803 if (!core_apply_sparse_checkout || !o->update)
804 o->skip_sparse_checkout = 1;
805 if (!o->skip_sparse_checkout) {
806 if (add_excludes_from_file_to_list(git_path("info/sparse-checkout"), "", 0, NULL, &el, 0) < 0)
807 o->skip_sparse_checkout = 1;
812 memset(&o->result, 0, sizeof(o->result));
813 o->result.initialized = 1;
814 o->result.timestamp.sec = o->src_index->timestamp.sec;
815 o->result.timestamp.nsec = o->src_index->timestamp.nsec;
817 mark_all_ce_unused(o->src_index);
820 dfc = xcalloc(1, cache_entry_size(0));
821 o->df_conflict_entry = dfc;
824 const char *prefix = o->prefix ? o->prefix : "";
825 struct traverse_info info;
827 setup_traverse_info(&info, prefix);
828 info.fn = unpack_callback;
830 info.show_all_errors = o->show_all_errors;
834 * Unpack existing index entries that sort before the
835 * prefix the tree is spliced into. Note that o->merge
836 * is always true in this case.
839 struct cache_entry *ce = next_cache_entry(o);
842 if (ce_in_traverse_path(ce, &info))
844 if (unpack_index_entry(ce, o) < 0)
849 if (traverse_trees(len, t, &info) < 0)
853 /* Any left-over entries in the index? */
856 struct cache_entry *ce = next_cache_entry(o);
859 if (unpack_index_entry(ce, o) < 0)
863 mark_all_ce_unused(o->src_index);
865 if (o->trivial_merges_only && o->nontrivial_merge) {
866 ret = unpack_failed(o, "Merge requires file-level merging");
870 if (!o->skip_sparse_checkout) {
871 int empty_worktree = 1;
872 for (i = 0;i < o->result.cache_nr;i++) {
873 struct cache_entry *ce = o->result.cache[i];
875 if (apply_sparse_checkout(ce, o)) {
880 * Merge strategies may set CE_UPDATE|CE_REMOVE outside checkout
881 * area as a result of ce_skip_worktree() shortcuts in
882 * verify_absent() and verify_uptodate(). Clear them.
884 if (ce_skip_worktree(ce))
885 ce->ce_flags &= ~(CE_UPDATE | CE_REMOVE);
890 if (o->result.cache_nr && empty_worktree) {
891 ret = unpack_failed(o, "Sparse checkout leaves no entry on working directory");
897 ret = check_updates(o) ? (-2) : 0;
899 *o->dst_index = o->result;
902 for (i = 0;i < el.nr;i++)
903 free(el.excludes[i]);
910 if (o->show_all_errors)
911 display_error_msgs(o);
912 mark_all_ce_unused(o->src_index);
913 ret = unpack_failed(o, NULL);
917 /* Here come the merge functions */
919 static int reject_merge(struct cache_entry *ce, struct unpack_trees_options *o)
921 return add_rejected_path(o, ERROR_WOULD_OVERWRITE, ce->name);
924 static int same(struct cache_entry *a, struct cache_entry *b)
930 if ((a->ce_flags | b->ce_flags) & CE_CONFLICTED)
932 return a->ce_mode == b->ce_mode &&
933 !hashcmp(a->sha1, b->sha1);
938 * When a CE gets turned into an unmerged entry, we
939 * want it to be up-to-date
941 static int verify_uptodate_1(struct cache_entry *ce,
942 struct unpack_trees_options *o,
943 enum unpack_trees_error_types error_type)
947 if (o->index_only || (!((ce->ce_flags & CE_VALID) || ce_skip_worktree(ce)) && (o->reset || ce_uptodate(ce))))
950 if (!lstat(ce->name, &st)) {
951 unsigned changed = ie_match_stat(o->src_index, ce, &st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE);
955 * NEEDSWORK: the current default policy is to allow
956 * submodule to be out of sync wrt the supermodule
957 * index. This needs to be tightened later for
958 * submodules that are marked to be automatically
961 if (S_ISGITLINK(ce->ce_mode))
967 return o->gently ? -1 :
968 add_rejected_path(o, error_type, ce->name);
971 static int verify_uptodate(struct cache_entry *ce,
972 struct unpack_trees_options *o)
974 if (!o->skip_sparse_checkout && will_have_skip_worktree(ce, o))
976 return verify_uptodate_1(ce, o, ERROR_NOT_UPTODATE_FILE);
979 static int verify_uptodate_sparse(struct cache_entry *ce,
980 struct unpack_trees_options *o)
982 return verify_uptodate_1(ce, o, ERROR_SPARSE_NOT_UPTODATE_FILE);
985 static void invalidate_ce_path(struct cache_entry *ce, struct unpack_trees_options *o)
988 cache_tree_invalidate_path(o->src_index->cache_tree, ce->name);
992 * Check that checking out ce->sha1 in subdir ce->name is not
993 * going to overwrite any working files.
995 * Currently, git does not checkout subprojects during a superproject
996 * checkout, so it is not going to overwrite anything.
998 static int verify_clean_submodule(struct cache_entry *ce,
999 enum unpack_trees_error_types error_type,
1000 struct unpack_trees_options *o)
1005 static int verify_clean_subdirectory(struct cache_entry *ce,
1006 enum unpack_trees_error_types error_type,
1007 struct unpack_trees_options *o)
1010 * we are about to extract "ce->name"; we would not want to lose
1011 * anything in the existing directory there.
1015 struct dir_struct d;
1018 unsigned char sha1[20];
1020 if (S_ISGITLINK(ce->ce_mode) &&
1021 resolve_gitlink_ref(ce->name, "HEAD", sha1) == 0) {
1022 /* If we are not going to update the submodule, then
1025 if (!hashcmp(sha1, ce->sha1))
1027 return verify_clean_submodule(ce, error_type, o);
1031 * First let's make sure we do not have a local modification
1032 * in that directory.
1034 namelen = strlen(ce->name);
1035 for (i = locate_in_src_index(ce, o);
1036 i < o->src_index->cache_nr;
1038 struct cache_entry *ce2 = o->src_index->cache[i];
1039 int len = ce_namelen(ce2);
1040 if (len < namelen ||
1041 strncmp(ce->name, ce2->name, namelen) ||
1042 ce2->name[namelen] != '/')
1045 * ce2->name is an entry in the subdirectory to be
1048 if (!ce_stage(ce2)) {
1049 if (verify_uptodate(ce2, o))
1051 add_entry(o, ce2, CE_REMOVE, 0);
1052 mark_ce_used(ce2, o);
1058 * Then we need to make sure that we do not lose a locally
1059 * present file that is not ignored.
1061 pathbuf = xmalloc(namelen + 2);
1062 memcpy(pathbuf, ce->name, namelen);
1063 strcpy(pathbuf+namelen, "/");
1065 memset(&d, 0, sizeof(d));
1067 d.exclude_per_dir = o->dir->exclude_per_dir;
1068 i = read_directory(&d, pathbuf, namelen+1, NULL);
1070 return o->gently ? -1 :
1071 add_rejected_path(o, ERROR_NOT_UPTODATE_DIR, ce->name);
1077 * This gets called when there was no index entry for the tree entry 'dst',
1078 * but we found a file in the working tree that 'lstat()' said was fine,
1079 * and we're on a case-insensitive filesystem.
1081 * See if we can find a case-insensitive match in the index that also
1082 * matches the stat information, and assume it's that other file!
1084 static int icase_exists(struct unpack_trees_options *o, struct cache_entry *dst, struct stat *st)
1086 struct cache_entry *src;
1088 src = index_name_exists(o->src_index, dst->name, ce_namelen(dst), 1);
1089 return src && !ie_match_stat(o->src_index, src, st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE);
1093 * We do not want to remove or overwrite a working tree file that
1094 * is not tracked, unless it is ignored.
1096 static int verify_absent_1(struct cache_entry *ce,
1097 enum unpack_trees_error_types error_type,
1098 struct unpack_trees_options *o)
1102 if (o->index_only || o->reset || !o->update)
1105 if (has_symlink_or_noent_leading_path(ce->name, ce_namelen(ce)))
1108 if (!lstat(ce->name, &st)) {
1109 int dtype = ce_to_dtype(ce);
1110 struct cache_entry *result;
1113 * It may be that the 'lstat()' succeeded even though
1114 * target 'ce' was absent, because there is an old
1115 * entry that is different only in case..
1117 * Ignore that lstat() if it matches.
1119 if (ignore_case && icase_exists(o, ce, &st))
1122 if (o->dir && excluded(o->dir, ce->name, &dtype))
1124 * ce->name is explicitly excluded, so it is Ok to
1128 if (S_ISDIR(st.st_mode)) {
1130 * We are checking out path "foo" and
1131 * found "foo/." in the working tree.
1132 * This is tricky -- if we have modified
1133 * files that are in "foo/" we would lose
1136 if (verify_clean_subdirectory(ce, error_type, o) < 0)
1142 * The previous round may already have decided to
1143 * delete this path, which is in a subdirectory that
1144 * is being replaced with a blob.
1146 result = index_name_exists(&o->result, ce->name, ce_namelen(ce), 0);
1148 if (result->ce_flags & CE_REMOVE)
1152 return o->gently ? -1 :
1153 add_rejected_path(o, error_type, ce->name);
1157 static int verify_absent(struct cache_entry *ce,
1158 enum unpack_trees_error_types error_type,
1159 struct unpack_trees_options *o)
1161 if (!o->skip_sparse_checkout && will_have_skip_worktree(ce, o))
1163 return verify_absent_1(ce, error_type, o);
1166 static int verify_absent_sparse(struct cache_entry *ce,
1167 enum unpack_trees_error_types error_type,
1168 struct unpack_trees_options *o)
1170 enum unpack_trees_error_types orphaned_error = error_type;
1171 if (orphaned_error == ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN)
1172 orphaned_error = ERROR_WOULD_LOSE_ORPHANED_OVERWRITTEN;
1174 return verify_absent_1(ce, orphaned_error, o);
1177 static int merged_entry(struct cache_entry *merge, struct cache_entry *old,
1178 struct unpack_trees_options *o)
1180 int update = CE_UPDATE;
1183 if (verify_absent(merge, ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN, o))
1185 invalidate_ce_path(merge, o);
1186 } else if (!(old->ce_flags & CE_CONFLICTED)) {
1188 * See if we can re-use the old CE directly?
1189 * That way we get the uptodate stat info.
1191 * This also removes the UPDATE flag on a match; otherwise
1192 * we will end up overwriting local changes in the work tree.
1194 if (same(old, merge)) {
1195 copy_cache_entry(merge, old);
1198 if (verify_uptodate(old, o))
1200 if (ce_skip_worktree(old))
1201 update |= CE_SKIP_WORKTREE;
1202 invalidate_ce_path(old, o);
1206 * Previously unmerged entry left as an existence
1207 * marker by read_index_unmerged();
1209 invalidate_ce_path(old, o);
1212 add_entry(o, merge, update, CE_STAGEMASK);
1216 static int deleted_entry(struct cache_entry *ce, struct cache_entry *old,
1217 struct unpack_trees_options *o)
1219 /* Did it exist in the index? */
1221 if (verify_absent(ce, ERROR_WOULD_LOSE_UNTRACKED_REMOVED, o))
1225 if (!(old->ce_flags & CE_CONFLICTED) && verify_uptodate(old, o))
1227 add_entry(o, ce, CE_REMOVE, 0);
1228 invalidate_ce_path(ce, o);
1232 static int keep_entry(struct cache_entry *ce, struct unpack_trees_options *o)
1234 add_entry(o, ce, 0, 0);
1239 static void show_stage_entry(FILE *o,
1240 const char *label, const struct cache_entry *ce)
1243 fprintf(o, "%s (missing)\n", label);
1245 fprintf(o, "%s%06o %s %d\t%s\n",
1248 sha1_to_hex(ce->sha1),
1254 int threeway_merge(struct cache_entry **stages, struct unpack_trees_options *o)
1256 struct cache_entry *index;
1257 struct cache_entry *head;
1258 struct cache_entry *remote = stages[o->head_idx + 1];
1261 int remote_match = 0;
1263 int df_conflict_head = 0;
1264 int df_conflict_remote = 0;
1266 int any_anc_missing = 0;
1267 int no_anc_exists = 1;
1270 for (i = 1; i < o->head_idx; i++) {
1271 if (!stages[i] || stages[i] == o->df_conflict_entry)
1272 any_anc_missing = 1;
1278 head = stages[o->head_idx];
1280 if (head == o->df_conflict_entry) {
1281 df_conflict_head = 1;
1285 if (remote == o->df_conflict_entry) {
1286 df_conflict_remote = 1;
1291 * First, if there's a #16 situation, note that to prevent #13
1294 if (!same(remote, head)) {
1295 for (i = 1; i < o->head_idx; i++) {
1296 if (same(stages[i], head)) {
1299 if (same(stages[i], remote)) {
1306 * We start with cases where the index is allowed to match
1307 * something other than the head: #14(ALT) and #2ALT, where it
1308 * is permitted to match the result instead.
1310 /* #14, #14ALT, #2ALT */
1311 if (remote && !df_conflict_head && head_match && !remote_match) {
1312 if (index && !same(index, remote) && !same(index, head))
1313 return o->gently ? -1 : reject_merge(index, o);
1314 return merged_entry(remote, index, o);
1317 * If we have an entry in the index cache, then we want to
1318 * make sure that it matches head.
1320 if (index && !same(index, head))
1321 return o->gently ? -1 : reject_merge(index, o);
1325 if (same(head, remote))
1326 return merged_entry(head, index, o);
1328 if (!df_conflict_remote && remote_match && !head_match)
1329 return merged_entry(head, index, o);
1333 if (!head && !remote && any_anc_missing)
1337 * Under the "aggressive" rule, we resolve mostly trivial
1338 * cases that we historically had git-merge-one-file resolve.
1340 if (o->aggressive) {
1341 int head_deleted = !head;
1342 int remote_deleted = !remote;
1343 struct cache_entry *ce = NULL;
1352 for (i = 1; i < o->head_idx; i++) {
1353 if (stages[i] && stages[i] != o->df_conflict_entry) {
1362 * Deleted in one and unchanged in the other.
1364 if ((head_deleted && remote_deleted) ||
1365 (head_deleted && remote && remote_match) ||
1366 (remote_deleted && head && head_match)) {
1368 return deleted_entry(index, index, o);
1369 if (ce && !head_deleted) {
1370 if (verify_absent(ce, ERROR_WOULD_LOSE_UNTRACKED_REMOVED, o))
1376 * Added in both, identically.
1378 if (no_anc_exists && head && remote && same(head, remote))
1379 return merged_entry(head, index, o);
1383 /* Below are "no merge" cases, which require that the index be
1384 * up-to-date to avoid the files getting overwritten with
1385 * conflict resolution files.
1388 if (verify_uptodate(index, o))
1392 o->nontrivial_merge = 1;
1394 /* #2, #3, #4, #6, #7, #9, #10, #11. */
1396 if (!head_match || !remote_match) {
1397 for (i = 1; i < o->head_idx; i++) {
1398 if (stages[i] && stages[i] != o->df_conflict_entry) {
1399 keep_entry(stages[i], o);
1407 fprintf(stderr, "read-tree: warning #16 detected\n");
1408 show_stage_entry(stderr, "head ", stages[head_match]);
1409 show_stage_entry(stderr, "remote ", stages[remote_match]);
1412 if (head) { count += keep_entry(head, o); }
1413 if (remote) { count += keep_entry(remote, o); }
1420 * The rule is to "carry forward" what is in the index without losing
1421 * information across a "fast-forward", favoring a successful merge
1422 * over a merge failure when it makes sense. For details of the
1423 * "carry forward" rule, please see <Documentation/git-read-tree.txt>.
1426 int twoway_merge(struct cache_entry **src, struct unpack_trees_options *o)
1428 struct cache_entry *current = src[0];
1429 struct cache_entry *oldtree = src[1];
1430 struct cache_entry *newtree = src[2];
1432 if (o->merge_size != 2)
1433 return error("Cannot do a twoway merge of %d trees",
1436 if (oldtree == o->df_conflict_entry)
1438 if (newtree == o->df_conflict_entry)
1442 if ((!oldtree && !newtree) || /* 4 and 5 */
1443 (!oldtree && newtree &&
1444 same(current, newtree)) || /* 6 and 7 */
1445 (oldtree && newtree &&
1446 same(oldtree, newtree)) || /* 14 and 15 */
1447 (oldtree && newtree &&
1448 !same(oldtree, newtree) && /* 18 and 19 */
1449 same(current, newtree))) {
1450 return keep_entry(current, o);
1452 else if (oldtree && !newtree && same(current, oldtree)) {
1454 return deleted_entry(oldtree, current, o);
1456 else if (oldtree && newtree &&
1457 same(current, oldtree) && !same(current, newtree)) {
1459 return merged_entry(newtree, current, o);
1462 /* all other failures */
1464 return o->gently ? -1 : reject_merge(oldtree, o);
1466 return o->gently ? -1 : reject_merge(current, o);
1468 return o->gently ? -1 : reject_merge(newtree, o);
1473 if (oldtree && !o->initial_checkout) {
1475 * deletion of the path was staged;
1477 if (same(oldtree, newtree))
1479 return reject_merge(oldtree, o);
1481 return merged_entry(newtree, current, o);
1483 return deleted_entry(oldtree, current, o);
1489 * Keep the index entries at stage0, collapse stage1 but make sure
1490 * stage0 does not have anything there.
1492 int bind_merge(struct cache_entry **src,
1493 struct unpack_trees_options *o)
1495 struct cache_entry *old = src[0];
1496 struct cache_entry *a = src[1];
1498 if (o->merge_size != 1)
1499 return error("Cannot do a bind merge of %d trees\n",
1502 return o->gently ? -1 :
1503 error(ERRORMSG(o, ERROR_BIND_OVERLAP), a->name, old->name);
1505 return keep_entry(old, o);
1507 return merged_entry(a, NULL, o);
1514 * - take the stat information from stage0, take the data from stage1
1516 int oneway_merge(struct cache_entry **src, struct unpack_trees_options *o)
1518 struct cache_entry *old = src[0];
1519 struct cache_entry *a = src[1];
1521 if (o->merge_size != 1)
1522 return error("Cannot do a oneway merge of %d trees",
1525 if (!a || a == o->df_conflict_entry)
1526 return deleted_entry(old, old, o);
1528 if (old && same(old, a)) {
1530 if (o->reset && !ce_uptodate(old) && !ce_skip_worktree(old)) {
1532 if (lstat(old->name, &st) ||
1533 ie_match_stat(o->src_index, old, &st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE))
1534 update |= CE_UPDATE;
1536 add_entry(o, old, update, 0);
1539 return merged_entry(a, old, o);