]>
Commit | Line | Data |
---|---|---|
16da134b | 1 | #include "cache.h" |
dbbcd44f | 2 | #include "strvec.h" |
33028713 | 3 | #include "repository.h" |
b2141fc1 | 4 | #include "config.h" |
f8a9d428 | 5 | #include "dir.h" |
16da134b JS |
6 | #include "tree.h" |
7 | #include "tree-walk.h" | |
076b0adc | 8 | #include "cache-tree.h" |
16da134b | 9 | #include "unpack-trees.h" |
96a02f8f | 10 | #include "progress.h" |
0cf73755 | 11 | #include "refs.h" |
06f33c17 | 12 | #include "attr.h" |
5fc2fc8f | 13 | #include "split-index.h" |
a7bc845a SB |
14 | #include "submodule.h" |
15 | #include "submodule-config.h" | |
883e248b | 16 | #include "fsmonitor.h" |
cbd53a21 | 17 | #include "object-store.h" |
b14ed5ad | 18 | #include "promisor-remote.h" |
d052cc03 | 19 | #include "entry.h" |
04155bda | 20 | #include "parallel-checkout.h" |
16da134b | 21 | |
8ccba008 JH |
22 | /* |
23 | * Error messages expected by scripts out of plumbing commands such as | |
24 | * read-tree. Non-scripted Porcelain is not required to use these messages | |
25 | * and in fact are encouraged to reword them to better suit their particular | |
23cbf11b | 26 | * situation better. See how "git checkout" and "git merge" replaces |
dc1166e6 | 27 | * them using setup_unpack_trees_porcelain(), for example. |
8ccba008 | 28 | */ |
6271d77c | 29 | static const char *unpack_plumbing_errors[NB_UNPACK_TREES_WARNING_TYPES] = { |
08353ebb | 30 | /* ERROR_WOULD_OVERWRITE */ |
8ccba008 JH |
31 | "Entry '%s' would be overwritten by merge. Cannot merge.", |
32 | ||
08353ebb | 33 | /* ERROR_NOT_UPTODATE_FILE */ |
8ccba008 JH |
34 | "Entry '%s' not uptodate. Cannot merge.", |
35 | ||
08353ebb | 36 | /* ERROR_NOT_UPTODATE_DIR */ |
8ccba008 JH |
37 | "Updating '%s' would lose untracked files in it", |
38 | ||
b817e545 EN |
39 | /* ERROR_CWD_IN_THE_WAY */ |
40 | "Refusing to remove '%s' since it is the current working directory.", | |
41 | ||
08402b04 MM |
42 | /* ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN */ |
43 | "Untracked working tree file '%s' would be overwritten by merge.", | |
8ccba008 | 44 | |
08402b04 MM |
45 | /* ERROR_WOULD_LOSE_UNTRACKED_REMOVED */ |
46 | "Untracked working tree file '%s' would be removed by merge.", | |
8ccba008 | 47 | |
08353ebb | 48 | /* ERROR_BIND_OVERLAP */ |
8ccba008 | 49 | "Entry '%s' overlaps with '%s'. Cannot bind.", |
e800ec9d | 50 | |
cd002c15 EN |
51 | /* ERROR_WOULD_LOSE_SUBMODULE */ |
52 | "Submodule '%s' cannot checkout new HEAD.", | |
e800ec9d | 53 | |
6271d77c EN |
54 | /* NB_UNPACK_TREES_ERROR_TYPES; just a meta value */ |
55 | "", | |
08402b04 | 56 | |
1ac83f42 | 57 | /* WARNING_SPARSE_NOT_UPTODATE_FILE */ |
22ab0b37 | 58 | "Path '%s' not uptodate; will not remove from working tree.", |
a7bc845a | 59 | |
ebb568b9 EN |
60 | /* WARNING_SPARSE_UNMERGED_FILE */ |
61 | "Path '%s' unmerged; will not remove from working tree.", | |
62 | ||
1ac83f42 | 63 | /* WARNING_SPARSE_ORPHANED_NOT_OVERWRITTEN */ |
22ab0b37 | 64 | "Path '%s' already present; will not overwrite with sparse update.", |
8ccba008 JH |
65 | }; |
66 | ||
08353ebb MM |
67 | #define ERRORMSG(o,type) \ |
68 | ( ((o) && (o)->msgs[(type)]) \ | |
69 | ? ((o)->msgs[(type)]) \ | |
70 | : (unpack_plumbing_errors[(type)]) ) | |
8ccba008 | 71 | |
3d415425 SB |
72 | static const char *super_prefixed(const char *path) |
73 | { | |
74 | /* | |
75 | * It is necessary and sufficient to have two static buffers | |
76 | * here, as the return value of this function is fed to | |
77 | * error() using the unpack_*_errors[] templates we see above. | |
78 | */ | |
79 | static struct strbuf buf[2] = {STRBUF_INIT, STRBUF_INIT}; | |
80 | static int super_prefix_len = -1; | |
81 | static unsigned idx = ARRAY_SIZE(buf) - 1; | |
82 | ||
83 | if (super_prefix_len < 0) { | |
84 | const char *super_prefix = get_super_prefix(); | |
85 | if (!super_prefix) { | |
86 | super_prefix_len = 0; | |
87 | } else { | |
88 | int i; | |
89 | for (i = 0; i < ARRAY_SIZE(buf); i++) | |
90 | strbuf_addstr(&buf[i], super_prefix); | |
91 | super_prefix_len = buf[0].len; | |
92 | } | |
93 | } | |
94 | ||
95 | if (!super_prefix_len) | |
96 | return path; | |
97 | ||
98 | if (++idx >= ARRAY_SIZE(buf)) | |
99 | idx = 0; | |
100 | ||
101 | strbuf_setlen(&buf[idx], super_prefix_len); | |
102 | strbuf_addstr(&buf[idx], path); | |
103 | ||
104 | return buf[idx].buf; | |
105 | } | |
106 | ||
e294030f MM |
107 | void setup_unpack_trees_porcelain(struct unpack_trees_options *opts, |
108 | const char *cmd) | |
dc1166e6 | 109 | { |
7980872d | 110 | int i; |
e294030f | 111 | const char **msgs = opts->msgs; |
dc1166e6 | 112 | const char *msg; |
fa3f60b7 | 113 | |
c972bf4c | 114 | strvec_init(&opts->msgs_to_free); |
1c41d280 | 115 | |
2e3926b9 | 116 | if (!strcmp(cmd, "checkout")) |
ed9bff08 | 117 | msg = advice_enabled(ADVICE_COMMIT_BEFORE_MERGE) |
2e3926b9 | 118 | ? _("Your local changes to the following files would be overwritten by checkout:\n%%s" |
c2691e2a | 119 | "Please commit your changes or stash them before you switch branches.") |
2e3926b9 VA |
120 | : _("Your local changes to the following files would be overwritten by checkout:\n%%s"); |
121 | else if (!strcmp(cmd, "merge")) | |
ed9bff08 | 122 | msg = advice_enabled(ADVICE_COMMIT_BEFORE_MERGE) |
2e3926b9 | 123 | ? _("Your local changes to the following files would be overwritten by merge:\n%%s" |
c2691e2a | 124 | "Please commit your changes or stash them before you merge.") |
2e3926b9 | 125 | : _("Your local changes to the following files would be overwritten by merge:\n%%s"); |
dc1166e6 | 126 | else |
ed9bff08 | 127 | msg = advice_enabled(ADVICE_COMMIT_BEFORE_MERGE) |
2e3926b9 | 128 | ? _("Your local changes to the following files would be overwritten by %s:\n%%s" |
c2691e2a | 129 | "Please commit your changes or stash them before you %s.") |
2e3926b9 | 130 | : _("Your local changes to the following files would be overwritten by %s:\n%%s"); |
fa3f60b7 | 131 | msgs[ERROR_WOULD_OVERWRITE] = msgs[ERROR_NOT_UPTODATE_FILE] = |
c972bf4c | 132 | strvec_pushf(&opts->msgs_to_free, msg, cmd, cmd); |
dc1166e6 MM |
133 | |
134 | msgs[ERROR_NOT_UPTODATE_DIR] = | |
584f99c8 | 135 | _("Updating the following directories would lose untracked files in them:\n%s"); |
dc1166e6 | 136 | |
b817e545 EN |
137 | msgs[ERROR_CWD_IN_THE_WAY] = |
138 | _("Refusing to remove the current working directory:\n%s"); | |
139 | ||
2e3926b9 | 140 | if (!strcmp(cmd, "checkout")) |
ed9bff08 | 141 | msg = advice_enabled(ADVICE_COMMIT_BEFORE_MERGE) |
2e3926b9 | 142 | ? _("The following untracked working tree files would be removed by checkout:\n%%s" |
c2691e2a | 143 | "Please move or remove them before you switch branches.") |
2e3926b9 VA |
144 | : _("The following untracked working tree files would be removed by checkout:\n%%s"); |
145 | else if (!strcmp(cmd, "merge")) | |
ed9bff08 | 146 | msg = advice_enabled(ADVICE_COMMIT_BEFORE_MERGE) |
2e3926b9 | 147 | ? _("The following untracked working tree files would be removed by merge:\n%%s" |
c2691e2a | 148 | "Please move or remove them before you merge.") |
2e3926b9 | 149 | : _("The following untracked working tree files would be removed by merge:\n%%s"); |
dc1166e6 | 150 | else |
ed9bff08 | 151 | msg = advice_enabled(ADVICE_COMMIT_BEFORE_MERGE) |
2e3926b9 | 152 | ? _("The following untracked working tree files would be removed by %s:\n%%s" |
c2691e2a | 153 | "Please move or remove them before you %s.") |
2e3926b9 | 154 | : _("The following untracked working tree files would be removed by %s:\n%%s"); |
1c41d280 | 155 | msgs[ERROR_WOULD_LOSE_UNTRACKED_REMOVED] = |
c972bf4c | 156 | strvec_pushf(&opts->msgs_to_free, msg, cmd, cmd); |
2e3926b9 VA |
157 | |
158 | if (!strcmp(cmd, "checkout")) | |
ed9bff08 | 159 | msg = advice_enabled(ADVICE_COMMIT_BEFORE_MERGE) |
2e3926b9 | 160 | ? _("The following untracked working tree files would be overwritten by checkout:\n%%s" |
c2691e2a | 161 | "Please move or remove them before you switch branches.") |
2e3926b9 VA |
162 | : _("The following untracked working tree files would be overwritten by checkout:\n%%s"); |
163 | else if (!strcmp(cmd, "merge")) | |
ed9bff08 | 164 | msg = advice_enabled(ADVICE_COMMIT_BEFORE_MERGE) |
2e3926b9 | 165 | ? _("The following untracked working tree files would be overwritten by merge:\n%%s" |
c2691e2a | 166 | "Please move or remove them before you merge.") |
2e3926b9 VA |
167 | : _("The following untracked working tree files would be overwritten by merge:\n%%s"); |
168 | else | |
ed9bff08 | 169 | msg = advice_enabled(ADVICE_COMMIT_BEFORE_MERGE) |
2e3926b9 | 170 | ? _("The following untracked working tree files would be overwritten by %s:\n%%s" |
c2691e2a | 171 | "Please move or remove them before you %s.") |
2e3926b9 | 172 | : _("The following untracked working tree files would be overwritten by %s:\n%%s"); |
1c41d280 | 173 | msgs[ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN] = |
c972bf4c | 174 | strvec_pushf(&opts->msgs_to_free, msg, cmd, cmd); |
dc1166e6 MM |
175 | |
176 | /* | |
177 | * Special case: ERROR_BIND_OVERLAP refers to a pair of paths, we | |
178 | * cannot easily display it as a list. | |
179 | */ | |
ed47fdf7 | 180 | msgs[ERROR_BIND_OVERLAP] = _("Entry '%s' overlaps with '%s'. Cannot bind."); |
dc1166e6 | 181 | |
a7bc845a | 182 | msgs[ERROR_WOULD_LOSE_SUBMODULE] = |
6362ed0b | 183 | _("Cannot update submodule:\n%s"); |
5e65ee35 | 184 | |
1ac83f42 | 185 | msgs[WARNING_SPARSE_NOT_UPTODATE_FILE] = |
22ab0b37 | 186 | _("The following paths are not up to date and were left despite sparse patterns:\n%s"); |
ebb568b9 EN |
187 | msgs[WARNING_SPARSE_UNMERGED_FILE] = |
188 | _("The following paths are unmerged and were left despite sparse patterns:\n%s"); | |
1ac83f42 | 189 | msgs[WARNING_SPARSE_ORPHANED_NOT_OVERWRITTEN] = |
22ab0b37 | 190 | _("The following paths were already present and thus not updated despite sparse patterns:\n%s"); |
5e65ee35 MM |
191 | |
192 | opts->show_all_errors = 1; | |
7980872d CB |
193 | /* rejected paths may not have a static buffer */ |
194 | for (i = 0; i < ARRAY_SIZE(opts->unpack_rejects); i++) | |
195 | opts->unpack_rejects[i].strdup_strings = 1; | |
dc1166e6 MM |
196 | } |
197 | ||
1c41d280 MÅ |
198 | void clear_unpack_trees_porcelain(struct unpack_trees_options *opts) |
199 | { | |
c972bf4c | 200 | strvec_clear(&opts->msgs_to_free); |
1c41d280 MÅ |
201 | memset(opts->msgs, 0, sizeof(opts->msgs)); |
202 | } | |
203 | ||
46169180 | 204 | static int do_add_entry(struct unpack_trees_options *o, struct cache_entry *ce, |
6ff264ee | 205 | unsigned int set, unsigned int clear) |
b48d5a05 | 206 | { |
419a597f | 207 | clear |= CE_HASHED; |
34110cd4 | 208 | |
700e66d6 NTND |
209 | if (set & CE_REMOVE) |
210 | set |= CE_WT_REMOVE; | |
211 | ||
6ff264ee | 212 | ce->ce_flags = (ce->ce_flags & ~clear) | set; |
46169180 JK |
213 | return add_index_entry(&o->result, ce, |
214 | ADD_CACHE_OK_TO_ADD | ADD_CACHE_OK_TO_REPLACE); | |
6ff264ee RS |
215 | } |
216 | ||
a33bd4d3 RS |
217 | static void add_entry(struct unpack_trees_options *o, |
218 | const struct cache_entry *ce, | |
219 | unsigned int set, unsigned int clear) | |
220 | { | |
8e72d675 | 221 | do_add_entry(o, dup_cache_entry(ce, &o->result), set, clear); |
b48d5a05 LT |
222 | } |
223 | ||
e6c111b4 MM |
224 | /* |
225 | * add error messages on path <path> | |
226 | * corresponding to the type <e> with the message <msg> | |
227 | * indicating if it should be display in porcelain or not | |
228 | */ | |
229 | static int add_rejected_path(struct unpack_trees_options *o, | |
230 | enum unpack_trees_error_types e, | |
231 | const char *path) | |
232 | { | |
b165fac8 | 233 | if (o->quiet) |
191e9d2c NTND |
234 | return -1; |
235 | ||
e6c111b4 | 236 | if (!o->show_all_errors) |
3d415425 | 237 | return error(ERRORMSG(o, e), super_prefixed(path)); |
e6c111b4 MM |
238 | |
239 | /* | |
240 | * Otherwise, insert in a list for future display by | |
6271d77c | 241 | * display_(error|warning)_msgs() |
e6c111b4 | 242 | */ |
7980872d | 243 | string_list_append(&o->unpack_rejects[e], path); |
e6c111b4 MM |
244 | return -1; |
245 | } | |
246 | ||
e6c111b4 MM |
247 | /* |
248 | * display all the error messages stored in a nice way | |
249 | */ | |
250 | static void display_error_msgs(struct unpack_trees_options *o) | |
251 | { | |
6271d77c EN |
252 | int e; |
253 | unsigned error_displayed = 0; | |
e6c111b4 | 254 | for (e = 0; e < NB_UNPACK_TREES_ERROR_TYPES; e++) { |
7980872d | 255 | struct string_list *rejects = &o->unpack_rejects[e]; |
6271d77c | 256 | |
7980872d | 257 | if (rejects->nr > 0) { |
6271d77c | 258 | int i; |
e6c111b4 | 259 | struct strbuf path = STRBUF_INIT; |
6271d77c EN |
260 | |
261 | error_displayed = 1; | |
7980872d CB |
262 | for (i = 0; i < rejects->nr; i++) |
263 | strbuf_addf(&path, "\t%s\n", rejects->items[i].string); | |
3d415425 | 264 | error(ERRORMSG(o, e), super_prefixed(path.buf)); |
e6c111b4 | 265 | strbuf_release(&path); |
e6c111b4 | 266 | } |
7980872d | 267 | string_list_clear(rejects, 0); |
e6c111b4 | 268 | } |
6271d77c | 269 | if (error_displayed) |
ed47fdf7 | 270 | fprintf(stderr, _("Aborting\n")); |
e6c111b4 MM |
271 | } |
272 | ||
6271d77c EN |
273 | /* |
274 | * display all the warning messages stored in a nice way | |
275 | */ | |
276 | static void display_warning_msgs(struct unpack_trees_options *o) | |
277 | { | |
278 | int e; | |
279 | unsigned warning_displayed = 0; | |
280 | for (e = NB_UNPACK_TREES_ERROR_TYPES + 1; | |
281 | e < NB_UNPACK_TREES_WARNING_TYPES; e++) { | |
282 | struct string_list *rejects = &o->unpack_rejects[e]; | |
283 | ||
284 | if (rejects->nr > 0) { | |
285 | int i; | |
286 | struct strbuf path = STRBUF_INIT; | |
287 | ||
288 | warning_displayed = 1; | |
289 | for (i = 0; i < rejects->nr; i++) | |
290 | strbuf_addf(&path, "\t%s\n", rejects->items[i].string); | |
291 | warning(ERRORMSG(o, e), super_prefixed(path.buf)); | |
292 | strbuf_release(&path); | |
293 | } | |
294 | string_list_clear(rejects, 0); | |
295 | } | |
296 | if (warning_displayed) | |
297 | fprintf(stderr, _("After fixing the above paths, you may want to run `git sparse-checkout reapply`.\n")); | |
298 | } | |
a7bc845a SB |
299 | static int check_submodule_move_head(const struct cache_entry *ce, |
300 | const char *old_id, | |
301 | const char *new_id, | |
302 | struct unpack_trees_options *o) | |
303 | { | |
cd279e2e | 304 | unsigned flags = SUBMODULE_MOVE_HEAD_DRY_RUN; |
a7bc845a | 305 | const struct submodule *sub = submodule_from_ce(ce); |
7463e2ec | 306 | |
a7bc845a SB |
307 | if (!sub) |
308 | return 0; | |
309 | ||
cd279e2e SB |
310 | if (o->reset) |
311 | flags |= SUBMODULE_MOVE_HEAD_FORCE; | |
312 | ||
7463e2ec | 313 | if (submodule_move_head(ce->name, old_id, new_id, flags)) |
191e9d2c | 314 | return add_rejected_path(o, ERROR_WOULD_LOSE_SUBMODULE, ce->name); |
7463e2ec | 315 | return 0; |
a7bc845a SB |
316 | } |
317 | ||
33028713 | 318 | /* |
15beaaa3 | 319 | * Perform the loading of the repository's gitmodules file. This function is |
33028713 | 320 | * used by 'check_update()' to perform loading of the gitmodules file in two |
15beaaa3 | 321 | * different situations: |
33028713 BW |
322 | * (1) before removing entries from the working tree if the gitmodules file has |
323 | * been marked for removal. This situation is specified by 'state' == NULL. | |
324 | * (2) before checking out entries to the working tree if the gitmodules file | |
325 | * has been marked for update. This situation is specified by 'state' != NULL. | |
326 | */ | |
327 | static void load_gitmodules_file(struct index_state *index, | |
328 | struct checkout *state) | |
a7bc845a | 329 | { |
33028713 BW |
330 | int pos = index_name_pos(index, GITMODULES_FILE, strlen(GITMODULES_FILE)); |
331 | ||
332 | if (pos >= 0) { | |
333 | struct cache_entry *ce = index->cache[pos]; | |
334 | if (!state && ce->ce_flags & CE_WT_REMOVE) { | |
d7992421 | 335 | repo_read_gitmodules(the_repository, 0); |
33028713 | 336 | } else if (state && (ce->ce_flags & CE_UPDATE)) { |
f793b895 | 337 | submodule_free(the_repository); |
0f086e6d | 338 | checkout_entry(ce, state, NULL, NULL); |
d7992421 | 339 | repo_read_gitmodules(the_repository, 0); |
a7bc845a SB |
340 | } |
341 | } | |
342 | } | |
343 | ||
6c34239d EN |
344 | static struct progress *get_progress(struct unpack_trees_options *o, |
345 | struct index_state *index) | |
16da134b | 346 | { |
96a02f8f | 347 | unsigned cnt = 0, total = 0; |
384f1a16 SB |
348 | |
349 | if (!o->update || !o->verbose_update) | |
350 | return NULL; | |
351 | ||
352 | for (; cnt < index->cache_nr; cnt++) { | |
353 | const struct cache_entry *ce = index->cache[cnt]; | |
354 | if (ce->ce_flags & (CE_UPDATE | CE_WT_REMOVE)) | |
355 | total++; | |
356 | } | |
357 | ||
328c6cb8 | 358 | return start_delayed_progress(_("Updating files"), total); |
384f1a16 SB |
359 | } |
360 | ||
b878579a NTND |
361 | static void setup_collided_checkout_detection(struct checkout *state, |
362 | struct index_state *index) | |
363 | { | |
364 | int i; | |
365 | ||
366 | state->clone = 1; | |
367 | for (i = 0; i < index->cache_nr; i++) | |
368 | index->cache[i]->ce_flags &= ~CE_MATCHED; | |
369 | } | |
370 | ||
371 | static void report_collided_checkout(struct index_state *index) | |
372 | { | |
373 | struct string_list list = STRING_LIST_INIT_NODUP; | |
374 | int i; | |
375 | ||
376 | for (i = 0; i < index->cache_nr; i++) { | |
377 | struct cache_entry *ce = index->cache[i]; | |
378 | ||
379 | if (!(ce->ce_flags & CE_MATCHED)) | |
380 | continue; | |
381 | ||
382 | string_list_append(&list, ce->name); | |
383 | ce->ce_flags &= ~CE_MATCHED; | |
384 | } | |
385 | ||
386 | list.cmp = fspathcmp; | |
387 | string_list_sort(&list); | |
388 | ||
389 | if (list.nr) { | |
390 | warning(_("the following paths have collided (e.g. case-sensitive paths\n" | |
391 | "on a case-insensitive filesystem) and only one from the same\n" | |
392 | "colliding group is in the working tree:\n")); | |
393 | ||
394 | for (i = 0; i < list.nr; i++) | |
395 | fprintf(stderr, " '%s'\n", list.items[i].string); | |
396 | } | |
397 | ||
398 | string_list_clear(&list, 0); | |
399 | } | |
400 | ||
b2896d27 JT |
401 | static int must_checkout(const struct cache_entry *ce) |
402 | { | |
403 | return ce->ce_flags & CE_UPDATE; | |
404 | } | |
405 | ||
b0a5a12a EN |
406 | static int check_updates(struct unpack_trees_options *o, |
407 | struct index_state *index) | |
384f1a16 SB |
408 | { |
409 | unsigned cnt = 0; | |
30ac275b | 410 | int errs = 0; |
07f967ad | 411 | struct progress *progress; |
30ac275b | 412 | struct checkout state = CHECKOUT_INIT; |
7531e4b6 | 413 | int i, pc_workers, pc_threshold; |
16da134b | 414 | |
0d1ed596 | 415 | trace_performance_enter(); |
30ac275b SB |
416 | state.force = 1; |
417 | state.quiet = 1; | |
418 | state.refresh_cache = 1; | |
419 | state.istate = index; | |
13e7ed6a | 420 | clone_checkout_metadata(&state.meta, &o->meta, NULL); |
16da134b | 421 | |
26f924d5 EN |
422 | if (!o->update || o->dry_run) { |
423 | remove_marked_cache_entries(index, 0); | |
424 | trace_performance_leave("check_updates"); | |
425 | return 0; | |
426 | } | |
427 | ||
b878579a NTND |
428 | if (o->clone) |
429 | setup_collided_checkout_detection(&state, index); | |
430 | ||
6c34239d | 431 | progress = get_progress(o, index); |
16da134b | 432 | |
22539ec3 MT |
433 | /* Start with clean cache to avoid using any possibly outdated info. */ |
434 | invalidate_lstat_cache(); | |
435 | ||
26f924d5 | 436 | git_attr_set_direction(GIT_ATTR_CHECKOUT); |
33028713 | 437 | |
26f924d5 | 438 | if (should_update_submodules()) |
33028713 BW |
439 | load_gitmodules_file(index, NULL); |
440 | ||
34110cd4 | 441 | for (i = 0; i < index->cache_nr; i++) { |
9c5e6c80 | 442 | const struct cache_entry *ce = index->cache[i]; |
16da134b | 443 | |
e663db2f NTND |
444 | if (ce->ce_flags & CE_WT_REMOVE) { |
445 | display_progress(progress, ++cnt); | |
26f924d5 | 446 | unlink_entry(ce); |
e663db2f | 447 | } |
1fa6ead4 | 448 | } |
26f924d5 | 449 | |
6fdc2057 | 450 | remove_marked_cache_entries(index, 0); |
78478927 | 451 | remove_scheduled_dirs(); |
1fa6ead4 | 452 | |
26f924d5 | 453 | if (should_update_submodules()) |
33028713 | 454 | load_gitmodules_file(index, &state); |
a7bc845a | 455 | |
b2896d27 | 456 | if (has_promisor_remote()) |
c0c578b3 JT |
457 | /* |
458 | * Prefetch the objects that are to be checked out in the loop | |
459 | * below. | |
460 | */ | |
b2896d27 | 461 | prefetch_cache_entries(index, must_checkout); |
04155bda | 462 | |
7531e4b6 MT |
463 | get_parallel_checkout_configs(&pc_workers, &pc_threshold); |
464 | ||
04155bda | 465 | enable_delayed_checkout(&state); |
7531e4b6 MT |
466 | if (pc_workers > 1) |
467 | init_parallel_checkout(); | |
1fa6ead4 LT |
468 | for (i = 0; i < index->cache_nr; i++) { |
469 | struct cache_entry *ce = index->cache[i]; | |
470 | ||
b2896d27 | 471 | if (must_checkout(ce)) { |
1c4d6f46 MT |
472 | size_t last_pc_queue_size = pc_queue_size(); |
473 | ||
7d782416 | 474 | if (ce->ce_flags & CE_WT_REMOVE) |
033abf97 | 475 | BUG("both update and delete flags are set on %s", |
7d782416 | 476 | ce->name); |
7a51ed66 | 477 | ce->ce_flags &= ~CE_UPDATE; |
26f924d5 | 478 | errs |= checkout_entry(ce, &state, NULL, NULL); |
1c4d6f46 MT |
479 | |
480 | if (last_pc_queue_size == pc_queue_size()) | |
481 | display_progress(progress, ++cnt); | |
16da134b JS |
482 | } |
483 | } | |
7531e4b6 | 484 | if (pc_workers > 1) |
1c4d6f46 MT |
485 | errs |= run_parallel_checkout(&state, pc_workers, pc_threshold, |
486 | progress, &cnt); | |
4d4fcc54 | 487 | stop_progress(&progress); |
7a132c62 | 488 | errs |= finish_delayed_checkout(&state, NULL, o->verbose_update); |
26f924d5 | 489 | git_attr_set_direction(GIT_ATTR_CHECKIN); |
b878579a NTND |
490 | |
491 | if (o->clone) | |
492 | report_collided_checkout(index); | |
493 | ||
0d1ed596 | 494 | trace_performance_leave("check_updates"); |
c4758d3c | 495 | return errs != 0; |
16da134b JS |
496 | } |
497 | ||
eb9ae4b5 RS |
498 | static int verify_uptodate_sparse(const struct cache_entry *ce, |
499 | struct unpack_trees_options *o); | |
500 | static int verify_absent_sparse(const struct cache_entry *ce, | |
501 | enum unpack_trees_error_types, | |
502 | struct unpack_trees_options *o); | |
e800ec9d | 503 | |
a5c446f1 NTND |
504 | static int apply_sparse_checkout(struct index_state *istate, |
505 | struct cache_entry *ce, | |
506 | struct unpack_trees_options *o) | |
e800ec9d NTND |
507 | { |
508 | int was_skip_worktree = ce_skip_worktree(ce); | |
509 | ||
2431afbf | 510 | if (ce->ce_flags & CE_NEW_SKIP_WORKTREE) |
e800ec9d NTND |
511 | ce->ce_flags |= CE_SKIP_WORKTREE; |
512 | else | |
513 | ce->ce_flags &= ~CE_SKIP_WORKTREE; | |
078a58e8 NTND |
514 | if (was_skip_worktree != ce_skip_worktree(ce)) { |
515 | ce->ce_flags |= CE_UPDATE_IN_BASE; | |
883e248b | 516 | mark_fsmonitor_invalid(istate, ce); |
a5c446f1 | 517 | istate->cache_changed |= CE_ENTRY_CHANGED; |
078a58e8 | 518 | } |
e800ec9d NTND |
519 | |
520 | /* | |
eec3fc03 NTND |
521 | * if (!was_skip_worktree && !ce_skip_worktree()) { |
522 | * This is perfectly normal. Move on; | |
523 | * } | |
e800ec9d | 524 | */ |
eec3fc03 NTND |
525 | |
526 | /* | |
527 | * Merge strategies may set CE_UPDATE|CE_REMOVE outside checkout | |
528 | * area as a result of ce_skip_worktree() shortcuts in | |
700e66d6 NTND |
529 | * verify_absent() and verify_uptodate(). |
530 | * Make sure they don't modify worktree if they are already | |
531 | * outside checkout area | |
eec3fc03 | 532 | */ |
700e66d6 NTND |
533 | if (was_skip_worktree && ce_skip_worktree(ce)) { |
534 | ce->ce_flags &= ~CE_UPDATE; | |
535 | ||
536 | /* | |
537 | * By default, when CE_REMOVE is on, CE_WT_REMOVE is also | |
538 | * on to get that file removed from both index and worktree. | |
539 | * If that file is already outside worktree area, don't | |
540 | * bother remove it. | |
541 | */ | |
542 | if (ce->ce_flags & CE_REMOVE) | |
543 | ce->ce_flags &= ~CE_WT_REMOVE; | |
544 | } | |
e800ec9d NTND |
545 | |
546 | if (!was_skip_worktree && ce_skip_worktree(ce)) { | |
547 | /* | |
548 | * If CE_UPDATE is set, verify_uptodate() must be called already | |
549 | * also stat info may have lost after merged_entry() so calling | |
550 | * verify_uptodate() again may fail | |
551 | */ | |
3cc7c504 EN |
552 | if (!(ce->ce_flags & CE_UPDATE) && |
553 | verify_uptodate_sparse(ce, o)) { | |
554 | ce->ce_flags &= ~CE_SKIP_WORKTREE; | |
e800ec9d | 555 | return -1; |
3cc7c504 | 556 | } |
e800ec9d | 557 | ce->ce_flags |= CE_WT_REMOVE; |
7d782416 | 558 | ce->ce_flags &= ~CE_UPDATE; |
e800ec9d NTND |
559 | } |
560 | if (was_skip_worktree && !ce_skip_worktree(ce)) { | |
1ac83f42 | 561 | if (verify_absent_sparse(ce, WARNING_SPARSE_ORPHANED_NOT_OVERWRITTEN, o)) |
e800ec9d NTND |
562 | return -1; |
563 | ce->ce_flags |= CE_UPDATE; | |
564 | } | |
565 | return 0; | |
566 | } | |
567 | ||
ebb568b9 EN |
568 | static int warn_conflicted_path(struct index_state *istate, |
569 | int i, | |
570 | struct unpack_trees_options *o) | |
571 | { | |
572 | char *conflicting_path = istate->cache[i]->name; | |
573 | int count = 0; | |
574 | ||
575 | add_rejected_path(o, WARNING_SPARSE_UNMERGED_FILE, conflicting_path); | |
576 | ||
0eeb3be4 DS |
577 | /* Find out how many higher stage entries are at same path */ |
578 | while ((++count) + i < istate->cache_nr && | |
579 | !strcmp(conflicting_path, istate->cache[count + i]->name)) | |
580 | ; /* do nothing */ | |
581 | ||
ebb568b9 EN |
582 | return count; |
583 | } | |
584 | ||
5828e835 RS |
585 | static inline int call_unpack_fn(const struct cache_entry * const *src, |
586 | struct unpack_trees_options *o) | |
01904572 | 587 | { |
34110cd4 LT |
588 | int ret = o->fn(src, o); |
589 | if (ret > 0) | |
01904572 | 590 | ret = 0; |
01904572 LT |
591 | return ret; |
592 | } | |
593 | ||
da165f47 JH |
594 | static void mark_ce_used(struct cache_entry *ce, struct unpack_trees_options *o) |
595 | { | |
596 | ce->ce_flags |= CE_UNPACKED; | |
597 | ||
598 | if (o->cache_bottom < o->src_index->cache_nr && | |
599 | o->src_index->cache[o->cache_bottom] == ce) { | |
600 | int bottom = o->cache_bottom; | |
601 | while (bottom < o->src_index->cache_nr && | |
602 | o->src_index->cache[bottom]->ce_flags & CE_UNPACKED) | |
603 | bottom++; | |
604 | o->cache_bottom = bottom; | |
605 | } | |
606 | } | |
607 | ||
608 | static void mark_all_ce_unused(struct index_state *index) | |
609 | { | |
610 | int i; | |
611 | for (i = 0; i < index->cache_nr; i++) | |
2431afbf | 612 | index->cache[i]->ce_flags &= ~(CE_UNPACKED | CE_ADDED | CE_NEW_SKIP_WORKTREE); |
da165f47 JH |
613 | } |
614 | ||
eb9ae4b5 | 615 | static int locate_in_src_index(const struct cache_entry *ce, |
da165f47 JH |
616 | struct unpack_trees_options *o) |
617 | { | |
618 | struct index_state *index = o->src_index; | |
619 | int len = ce_namelen(ce); | |
620 | int pos = index_name_pos(index, ce->name, len); | |
621 | if (pos < 0) | |
622 | pos = -1 - pos; | |
623 | return pos; | |
624 | } | |
625 | ||
626 | /* | |
627 | * We call unpack_index_entry() with an unmerged cache entry | |
628 | * only in diff-index, and it wants a single callback. Skip | |
629 | * the other unmerged entry with the same name. | |
630 | */ | |
631 | static void mark_ce_used_same_name(struct cache_entry *ce, | |
632 | struct unpack_trees_options *o) | |
633 | { | |
634 | struct index_state *index = o->src_index; | |
635 | int len = ce_namelen(ce); | |
636 | int pos; | |
637 | ||
638 | for (pos = locate_in_src_index(ce, o); pos < index->cache_nr; pos++) { | |
639 | struct cache_entry *next = index->cache[pos]; | |
640 | if (len != ce_namelen(next) || | |
641 | memcmp(ce->name, next->name, len)) | |
642 | break; | |
643 | mark_ce_used(next, o); | |
644 | } | |
645 | } | |
646 | ||
99430aa1 | 647 | static struct cache_entry *next_cache_entry(struct unpack_trees_options *o) |
da165f47 JH |
648 | { |
649 | const struct index_state *index = o->src_index; | |
650 | int pos = o->cache_bottom; | |
651 | ||
652 | while (pos < index->cache_nr) { | |
653 | struct cache_entry *ce = index->cache[pos]; | |
99430aa1 | 654 | if (!(ce->ce_flags & CE_UNPACKED)) |
da165f47 JH |
655 | return ce; |
656 | pos++; | |
657 | } | |
658 | return NULL; | |
659 | } | |
660 | ||
9c5e6c80 | 661 | static void add_same_unmerged(const struct cache_entry *ce, |
da165f47 JH |
662 | struct unpack_trees_options *o) |
663 | { | |
664 | struct index_state *index = o->src_index; | |
665 | int len = ce_namelen(ce); | |
666 | int pos = index_name_pos(index, ce->name, len); | |
667 | ||
668 | if (0 <= pos) | |
669 | die("programming error in a caller of mark_ce_used_same_name"); | |
670 | for (pos = -pos - 1; pos < index->cache_nr; pos++) { | |
671 | struct cache_entry *next = index->cache[pos]; | |
672 | if (len != ce_namelen(next) || | |
673 | memcmp(ce->name, next->name, len)) | |
674 | break; | |
675 | add_entry(o, next, 0, 0); | |
676 | mark_ce_used(next, o); | |
677 | } | |
678 | } | |
679 | ||
680 | static int unpack_index_entry(struct cache_entry *ce, | |
681 | struct unpack_trees_options *o) | |
01904572 | 682 | { |
5828e835 | 683 | const struct cache_entry *src[MAX_UNPACK_TREES + 1] = { NULL, }; |
da165f47 | 684 | int ret; |
34110cd4 | 685 | |
66dbfd55 GV |
686 | src[0] = ce; |
687 | ||
da165f47 | 688 | mark_ce_used(ce, o); |
01904572 LT |
689 | if (ce_stage(ce)) { |
690 | if (o->skip_unmerged) { | |
34110cd4 LT |
691 | add_entry(o, ce, 0, 0); |
692 | return 0; | |
01904572 | 693 | } |
01904572 | 694 | } |
da165f47 JH |
695 | ret = call_unpack_fn(src, o); |
696 | if (ce_stage(ce)) | |
697 | mark_ce_used_same_name(ce, o); | |
698 | return ret; | |
01904572 LT |
699 | } |
700 | ||
90553847 | 701 | static int find_cache_pos(struct traverse_info *, const char *p, size_t len); |
730f7284 JH |
702 | |
703 | static void restore_cache_bottom(struct traverse_info *info, int bottom) | |
704 | { | |
705 | struct unpack_trees_options *o = info->data; | |
706 | ||
707 | if (o->diff_index_cached) | |
708 | return; | |
709 | o->cache_bottom = bottom; | |
710 | } | |
711 | ||
712 | static int switch_cache_bottom(struct traverse_info *info) | |
713 | { | |
714 | struct unpack_trees_options *o = info->data; | |
715 | int ret, pos; | |
716 | ||
717 | if (o->diff_index_cached) | |
718 | return 0; | |
719 | ret = o->cache_bottom; | |
90553847 | 720 | pos = find_cache_pos(info->prev, info->name, info->namelen); |
730f7284 JH |
721 | |
722 | if (pos < -1) | |
723 | o->cache_bottom = -2 - pos; | |
724 | else if (pos < 0) | |
725 | o->cache_bottom = o->src_index->cache_nr; | |
726 | return ret; | |
01904572 LT |
727 | } |
728 | ||
d12a8cf0 JH |
729 | static inline int are_same_oid(struct name_entry *name_j, struct name_entry *name_k) |
730 | { | |
ea82b2a0 | 731 | return !is_null_oid(&name_j->oid) && !is_null_oid(&name_k->oid) && oideq(&name_j->oid, &name_k->oid); |
d12a8cf0 JH |
732 | } |
733 | ||
b4da3738 NTND |
734 | static int all_trees_same_as_cache_tree(int n, unsigned long dirmask, |
735 | struct name_entry *names, | |
736 | struct traverse_info *info) | |
737 | { | |
738 | struct unpack_trees_options *o = info->data; | |
739 | int i; | |
740 | ||
741 | if (!o->merge || dirmask != ((1 << n) - 1)) | |
742 | return 0; | |
743 | ||
744 | for (i = 1; i < n; i++) | |
745 | if (!are_same_oid(names, names + i)) | |
746 | return 0; | |
747 | ||
748 | return cache_tree_matches_traversal(o->src_index->cache_tree, names, info); | |
749 | } | |
750 | ||
751 | static int index_pos_by_traverse_info(struct name_entry *names, | |
752 | struct traverse_info *info) | |
753 | { | |
754 | struct unpack_trees_options *o = info->data; | |
c43ab062 | 755 | struct strbuf name = STRBUF_INIT; |
b4da3738 NTND |
756 | int pos; |
757 | ||
c43ab062 JK |
758 | strbuf_make_traverse_path(&name, info, names->path, names->pathlen); |
759 | strbuf_addch(&name, '/'); | |
760 | pos = index_name_pos(o->src_index, name.buf, name.len); | |
13e13312 DS |
761 | if (pos >= 0) { |
762 | if (!o->src_index->sparse_index || | |
763 | !(o->src_index->cache[pos]->ce_flags & CE_SKIP_WORKTREE)) | |
764 | BUG("This is a directory and should not exist in index"); | |
765 | } else { | |
766 | pos = -pos - 1; | |
767 | } | |
573117df ES |
768 | if (pos >= o->src_index->cache_nr || |
769 | !starts_with(o->src_index->cache[pos]->name, name.buf) || | |
c43ab062 | 770 | (pos > 0 && starts_with(o->src_index->cache[pos-1]->name, name.buf))) |
573117df ES |
771 | BUG("pos %d doesn't point to the first entry of %s in index", |
772 | pos, name.buf); | |
c43ab062 | 773 | strbuf_release(&name); |
b4da3738 NTND |
774 | return pos; |
775 | } | |
776 | ||
777 | /* | |
778 | * Fast path if we detect that all trees are the same as cache-tree at this | |
5f4436a7 NTND |
779 | * path. We'll walk these trees in an iterative loop using cache-tree/index |
780 | * instead of ODB since we already know what these trees contain. | |
b4da3738 NTND |
781 | */ |
782 | static int traverse_by_cache_tree(int pos, int nr_entries, int nr_names, | |
b4da3738 NTND |
783 | struct traverse_info *info) |
784 | { | |
785 | struct cache_entry *src[MAX_UNPACK_TREES + 1] = { NULL, }; | |
786 | struct unpack_trees_options *o = info->data; | |
f1e11c65 NTND |
787 | struct cache_entry *tree_ce = NULL; |
788 | int ce_len = 0; | |
b4da3738 NTND |
789 | int i, d; |
790 | ||
791 | if (!o->merge) | |
792 | BUG("We need cache-tree to do this optimization"); | |
793 | ||
794 | /* | |
bd6a3fd7 | 795 | * Do what unpack_callback() and unpack_single_entry() normally |
b4da3738 NTND |
796 | * do. But we walk all paths in an iterative loop instead. |
797 | * | |
798 | * D/F conflicts and higher stage entries are not a concern | |
799 | * because cache-tree would be invalidated and we would never | |
800 | * get here in the first place. | |
801 | */ | |
802 | for (i = 0; i < nr_entries; i++) { | |
f1e11c65 | 803 | int new_ce_len, len, rc; |
b4da3738 NTND |
804 | |
805 | src[0] = o->src_index->cache[pos + i]; | |
806 | ||
807 | len = ce_namelen(src[0]); | |
f1e11c65 NTND |
808 | new_ce_len = cache_entry_size(len); |
809 | ||
810 | if (new_ce_len > ce_len) { | |
811 | new_ce_len <<= 1; | |
812 | tree_ce = xrealloc(tree_ce, new_ce_len); | |
813 | memset(tree_ce, 0, new_ce_len); | |
814 | ce_len = new_ce_len; | |
815 | ||
816 | tree_ce->ce_flags = create_ce_flags(0); | |
817 | ||
818 | for (d = 1; d <= nr_names; d++) | |
819 | src[d] = tree_ce; | |
820 | } | |
b4da3738 NTND |
821 | |
822 | tree_ce->ce_mode = src[0]->ce_mode; | |
b4da3738 NTND |
823 | tree_ce->ce_namelen = len; |
824 | oidcpy(&tree_ce->oid, &src[0]->oid); | |
825 | memcpy(tree_ce->name, src[0]->name, len + 1); | |
826 | ||
b4da3738 | 827 | rc = call_unpack_fn((const struct cache_entry * const *)src, o); |
f1e11c65 NTND |
828 | if (rc < 0) { |
829 | free(tree_ce); | |
b4da3738 | 830 | return rc; |
f1e11c65 | 831 | } |
b4da3738 NTND |
832 | |
833 | mark_ce_used(src[0], o); | |
834 | } | |
f1e11c65 | 835 | free(tree_ce); |
b4da3738 NTND |
836 | if (o->debug_unpack) |
837 | printf("Unpacked %d entries from %s to %s using cache-tree\n", | |
838 | nr_entries, | |
839 | o->src_index->cache[pos]->name, | |
840 | o->src_index->cache[pos + nr_entries - 1]->name); | |
841 | return 0; | |
842 | } | |
843 | ||
84563a62 JH |
844 | static int traverse_trees_recursive(int n, unsigned long dirmask, |
845 | unsigned long df_conflicts, | |
846 | struct name_entry *names, | |
847 | struct traverse_info *info) | |
16da134b | 848 | { |
67022e02 | 849 | struct unpack_trees_options *o = info->data; |
730f7284 | 850 | int i, ret, bottom; |
d12a8cf0 | 851 | int nr_buf = 0; |
ca885a4f | 852 | struct tree_desc t[MAX_UNPACK_TREES]; |
1ce584b0 | 853 | void *buf[MAX_UNPACK_TREES]; |
01904572 LT |
854 | struct traverse_info newinfo; |
855 | struct name_entry *p; | |
b4da3738 NTND |
856 | int nr_entries; |
857 | ||
858 | nr_entries = all_trees_same_as_cache_tree(n, dirmask, names, info); | |
859 | if (nr_entries > 0) { | |
b4da3738 NTND |
860 | int pos = index_pos_by_traverse_info(names, info); |
861 | ||
862 | if (!o->merge || df_conflicts) | |
863 | BUG("Wrong condition to get here buddy"); | |
864 | ||
865 | /* | |
866 | * All entries up to 'pos' must have been processed | |
867 | * (i.e. marked CE_UNPACKED) at this point. But to be safe, | |
868 | * save and restore cache_bottom anyway to not miss | |
869 | * unprocessed entries before 'pos'. | |
870 | */ | |
871 | bottom = o->cache_bottom; | |
66429698 | 872 | ret = traverse_by_cache_tree(pos, nr_entries, n, info); |
b4da3738 NTND |
873 | o->cache_bottom = bottom; |
874 | return ret; | |
875 | } | |
01904572 LT |
876 | |
877 | p = names; | |
878 | while (!p->mode) | |
879 | p++; | |
880 | ||
881 | newinfo = *info; | |
882 | newinfo.prev = info; | |
40e37256 | 883 | newinfo.pathspec = info->pathspec; |
90553847 JK |
884 | newinfo.name = p->path; |
885 | newinfo.namelen = p->pathlen; | |
886 | newinfo.mode = p->mode; | |
37806080 | 887 | newinfo.pathlen = st_add3(newinfo.pathlen, tree_entry_len(p), 1); |
603d2498 | 888 | newinfo.df_conflicts |= df_conflicts; |
01904572 | 889 | |
d12a8cf0 JH |
890 | /* |
891 | * Fetch the tree from the ODB for each peer directory in the | |
892 | * n commits. | |
893 | * | |
894 | * For 2- and 3-way traversals, we try to avoid hitting the | |
895 | * ODB twice for the same OID. This should yield a nice speed | |
896 | * up in checkouts and merges when the commits are similar. | |
897 | * | |
898 | * We don't bother doing the full O(n^2) search for larger n, | |
899 | * because wider traversals don't happen that often and we | |
900 | * avoid the search setup. | |
901 | * | |
902 | * When 2 peer OIDs are the same, we just copy the tree | |
903 | * descriptor data. This implicitly borrows the buffer | |
904 | * data from the earlier cell. | |
905 | */ | |
01904572 | 906 | for (i = 0; i < n; i++, dirmask >>= 1) { |
d12a8cf0 JH |
907 | if (i > 0 && are_same_oid(&names[i], &names[i - 1])) |
908 | t[i] = t[i - 1]; | |
909 | else if (i > 1 && are_same_oid(&names[i], &names[i - 2])) | |
910 | t[i] = t[i - 2]; | |
911 | else { | |
5c377d3d | 912 | const struct object_id *oid = NULL; |
d12a8cf0 | 913 | if (dirmask & 1) |
ea82b2a0 | 914 | oid = &names[i].oid; |
5e575807 | 915 | buf[nr_buf++] = fill_tree_descriptor(the_repository, t + i, oid); |
d12a8cf0 | 916 | } |
01904572 | 917 | } |
730f7284 JH |
918 | |
919 | bottom = switch_cache_bottom(&newinfo); | |
67022e02 | 920 | ret = traverse_trees(o->src_index, n, t, &newinfo); |
730f7284 | 921 | restore_cache_bottom(&newinfo, bottom); |
1ce584b0 | 922 | |
d12a8cf0 | 923 | for (i = 0; i < nr_buf; i++) |
1ce584b0 JN |
924 | free(buf[i]); |
925 | ||
730f7284 | 926 | return ret; |
01904572 LT |
927 | } |
928 | ||
929 | /* | |
930 | * Compare the traverse-path to the cache entry without actually | |
931 | * having to generate the textual representation of the traverse | |
932 | * path. | |
933 | * | |
934 | * NOTE! This *only* compares up to the size of the traverse path | |
935 | * itself - the caller needs to do the final check for the cache | |
936 | * entry having more data at the end! | |
937 | */ | |
90553847 JK |
938 | static int do_compare_entry_piecewise(const struct cache_entry *ce, |
939 | const struct traverse_info *info, | |
940 | const char *name, size_t namelen, | |
941 | unsigned mode) | |
01904572 | 942 | { |
90553847 | 943 | int pathlen, ce_len; |
01904572 LT |
944 | const char *ce_name; |
945 | ||
946 | if (info->prev) { | |
d9c2bd56 | 947 | int cmp = do_compare_entry_piecewise(ce, info->prev, |
90553847 JK |
948 | info->name, info->namelen, |
949 | info->mode); | |
01904572 LT |
950 | if (cmp) |
951 | return cmp; | |
952 | } | |
953 | pathlen = info->pathlen; | |
954 | ce_len = ce_namelen(ce); | |
955 | ||
956 | /* If ce_len < pathlen then we must have previously hit "name == directory" entry */ | |
957 | if (ce_len < pathlen) | |
958 | return -1; | |
959 | ||
960 | ce_len -= pathlen; | |
961 | ce_name = ce->name + pathlen; | |
962 | ||
90553847 | 963 | return df_name_compare(ce_name, ce_len, S_IFREG, name, namelen, mode); |
01904572 LT |
964 | } |
965 | ||
d9c2bd56 DT |
966 | static int do_compare_entry(const struct cache_entry *ce, |
967 | const struct traverse_info *info, | |
90553847 JK |
968 | const char *name, size_t namelen, |
969 | unsigned mode) | |
d9c2bd56 | 970 | { |
90553847 | 971 | int pathlen, ce_len; |
d9c2bd56 DT |
972 | const char *ce_name; |
973 | int cmp; | |
cd807a5c | 974 | unsigned ce_mode; |
d9c2bd56 DT |
975 | |
976 | /* | |
977 | * If we have not precomputed the traverse path, it is quicker | |
978 | * to avoid doing so. But if we have precomputed it, | |
979 | * it is quicker to use the precomputed version. | |
980 | */ | |
981 | if (!info->traverse_path) | |
90553847 | 982 | return do_compare_entry_piecewise(ce, info, name, namelen, mode); |
d9c2bd56 DT |
983 | |
984 | cmp = strncmp(ce->name, info->traverse_path, info->pathlen); | |
985 | if (cmp) | |
986 | return cmp; | |
987 | ||
988 | pathlen = info->pathlen; | |
989 | ce_len = ce_namelen(ce); | |
990 | ||
991 | if (ce_len < pathlen) | |
992 | return -1; | |
993 | ||
994 | ce_len -= pathlen; | |
995 | ce_name = ce->name + pathlen; | |
996 | ||
cd807a5c DS |
997 | ce_mode = S_ISSPARSEDIR(ce->ce_mode) ? S_IFDIR : S_IFREG; |
998 | return df_name_compare(ce_name, ce_len, ce_mode, name, namelen, mode); | |
d9c2bd56 DT |
999 | } |
1000 | ||
01904572 LT |
1001 | static int compare_entry(const struct cache_entry *ce, const struct traverse_info *info, const struct name_entry *n) |
1002 | { | |
90553847 | 1003 | int cmp = do_compare_entry(ce, info, n->path, n->pathlen, n->mode); |
01904572 LT |
1004 | if (cmp) |
1005 | return cmp; | |
1006 | ||
cd807a5c DS |
1007 | /* |
1008 | * At this point, we know that we have a prefix match. If ce | |
1009 | * is a sparse directory, then allow an exact match. This only | |
1010 | * works when the input name is a directory, since ce->name | |
1011 | * ends in a directory separator. | |
1012 | */ | |
1013 | if (S_ISSPARSEDIR(ce->ce_mode) && | |
1014 | ce->ce_namelen == traverse_path_len(info, tree_entry_len(n)) + 1) | |
1015 | return 0; | |
1016 | ||
01904572 LT |
1017 | /* |
1018 | * Even if the beginning compared identically, the ce should | |
1019 | * compare as bigger than a directory leading up to it! | |
1020 | */ | |
b3b3cbcb | 1021 | return ce_namelen(ce) > traverse_path_len(info, tree_entry_len(n)); |
01904572 LT |
1022 | } |
1023 | ||
da165f47 JH |
1024 | static int ce_in_traverse_path(const struct cache_entry *ce, |
1025 | const struct traverse_info *info) | |
1026 | { | |
1027 | if (!info->prev) | |
1028 | return 1; | |
90553847 JK |
1029 | if (do_compare_entry(ce, info->prev, |
1030 | info->name, info->namelen, info->mode)) | |
da165f47 JH |
1031 | return 0; |
1032 | /* | |
1033 | * If ce (blob) is the same name as the path (which is a tree | |
1034 | * we will be descending into), it won't be inside it. | |
1035 | */ | |
1036 | return (info->pathlen < ce_namelen(ce)); | |
1037 | } | |
1038 | ||
a849735b JM |
1039 | static struct cache_entry *create_ce_entry(const struct traverse_info *info, |
1040 | const struct name_entry *n, | |
1041 | int stage, | |
1042 | struct index_state *istate, | |
523506df DS |
1043 | int is_transient, |
1044 | int is_sparse_directory) | |
01904572 | 1045 | { |
b3b3cbcb | 1046 | size_t len = traverse_path_len(info, tree_entry_len(n)); |
523506df | 1047 | size_t alloc_len = is_sparse_directory ? len + 1 : len; |
a849735b JM |
1048 | struct cache_entry *ce = |
1049 | is_transient ? | |
523506df DS |
1050 | make_empty_transient_cache_entry(alloc_len, NULL) : |
1051 | make_empty_cache_entry(istate, alloc_len); | |
01904572 LT |
1052 | |
1053 | ce->ce_mode = create_ce_mode(n->mode); | |
b60e188c TG |
1054 | ce->ce_flags = create_ce_flags(stage); |
1055 | ce->ce_namelen = len; | |
ea82b2a0 | 1056 | oidcpy(&ce->oid, &n->oid); |
5aa02f98 JK |
1057 | /* len+1 because the cache_entry allocates space for NUL */ |
1058 | make_traverse_path(ce->name, len + 1, info, n->path, n->pathlen); | |
01904572 | 1059 | |
523506df DS |
1060 | if (is_sparse_directory) { |
1061 | ce->name[len] = '/'; | |
1062 | ce->name[len + 1] = '\0'; | |
1063 | ce->ce_namelen++; | |
1064 | ce->ce_flags |= CE_SKIP_WORKTREE; | |
1065 | } | |
1066 | ||
01904572 LT |
1067 | return ce; |
1068 | } | |
1069 | ||
b4da3738 NTND |
1070 | /* |
1071 | * Note that traverse_by_cache_tree() duplicates some logic in this function | |
1072 | * without actually calling it. If you change the logic here you may need to | |
1073 | * check and change there as well. | |
1074 | */ | |
bd6a3fd7 DS |
1075 | static int unpack_single_entry(int n, unsigned long mask, |
1076 | unsigned long dirmask, | |
1077 | struct cache_entry **src, | |
1078 | const struct name_entry *names, | |
1079 | const struct traverse_info *info) | |
01904572 LT |
1080 | { |
1081 | int i; | |
1082 | struct unpack_trees_options *o = info->data; | |
603d2498 | 1083 | unsigned long conflicts = info->df_conflicts | dirmask; |
01904572 | 1084 | |
01904572 LT |
1085 | if (mask == dirmask && !src[0]) |
1086 | return 0; | |
1087 | ||
523506df DS |
1088 | /* |
1089 | * When we have a sparse directory entry for src[0], | |
1090 | * then this isn't necessarily a directory-file conflict. | |
1091 | */ | |
1092 | if (mask == dirmask && src[0] && | |
1093 | S_ISSPARSEDIR(src[0]->ce_mode)) | |
1094 | conflicts = 0; | |
1095 | ||
01904572 LT |
1096 | /* |
1097 | * Ok, we've filled in up to any potential index entry in src[0], | |
1098 | * now do the rest. | |
1099 | */ | |
1100 | for (i = 0; i < n; i++) { | |
1101 | int stage; | |
1102 | unsigned int bit = 1ul << i; | |
1103 | if (conflicts & bit) { | |
1104 | src[i + o->merge] = o->df_conflict_entry; | |
1105 | continue; | |
1106 | } | |
1107 | if (!(mask & bit)) | |
1108 | continue; | |
1109 | if (!o->merge) | |
1110 | stage = 0; | |
1111 | else if (i + 1 < o->head_idx) | |
1112 | stage = 1; | |
1113 | else if (i + 1 > o->head_idx) | |
1114 | stage = 3; | |
1115 | else | |
1116 | stage = 2; | |
a849735b JM |
1117 | |
1118 | /* | |
1119 | * If the merge bit is set, then the cache entries are | |
1120 | * discarded in the following block. In this case, | |
1121 | * construct "transient" cache_entries, as they are | |
1122 | * not stored in the index. otherwise construct the | |
1123 | * cache entry from the index aware logic. | |
1124 | */ | |
523506df DS |
1125 | src[i + o->merge] = create_ce_entry(info, names + i, stage, |
1126 | &o->result, o->merge, | |
1127 | bit & dirmask); | |
01904572 LT |
1128 | } |
1129 | ||
5d80ef5a RS |
1130 | if (o->merge) { |
1131 | int rc = call_unpack_fn((const struct cache_entry * const *)src, | |
1132 | o); | |
1133 | for (i = 0; i < n; i++) { | |
1134 | struct cache_entry *ce = src[i + o->merge]; | |
1135 | if (ce != o->df_conflict_entry) | |
a849735b | 1136 | discard_cache_entry(ce); |
5d80ef5a RS |
1137 | } |
1138 | return rc; | |
1139 | } | |
01904572 | 1140 | |
01904572 | 1141 | for (i = 0; i < n; i++) |
aab3b9a1 | 1142 | if (src[i] && src[i] != o->df_conflict_entry) |
46169180 JK |
1143 | if (do_add_entry(o, src[i], 0, 0)) |
1144 | return -1; | |
1145 | ||
01904572 LT |
1146 | return 0; |
1147 | } | |
1148 | ||
353c5eeb JH |
1149 | static int unpack_failed(struct unpack_trees_options *o, const char *message) |
1150 | { | |
1151 | discard_index(&o->result); | |
b165fac8 | 1152 | if (!o->quiet && !o->exiting_early) { |
353c5eeb JH |
1153 | if (message) |
1154 | return error("%s", message); | |
1155 | return -1; | |
1156 | } | |
1157 | return -1; | |
1158 | } | |
1159 | ||
730f7284 JH |
1160 | /* |
1161 | * The tree traversal is looking at name p. If we have a matching entry, | |
1162 | * return it. If name p is a directory in the index, do not return | |
1163 | * anything, as we will want to match it when the traversal descends into | |
1164 | * the directory. | |
1165 | */ | |
1166 | static int find_cache_pos(struct traverse_info *info, | |
90553847 | 1167 | const char *p, size_t p_len) |
730f7284 JH |
1168 | { |
1169 | int pos; | |
1170 | struct unpack_trees_options *o = info->data; | |
1171 | struct index_state *index = o->src_index; | |
1172 | int pfxlen = info->pathlen; | |
730f7284 JH |
1173 | |
1174 | for (pos = o->cache_bottom; pos < index->cache_nr; pos++) { | |
9c5e6c80 | 1175 | const struct cache_entry *ce = index->cache[pos]; |
730f7284 JH |
1176 | const char *ce_name, *ce_slash; |
1177 | int cmp, ce_len; | |
1178 | ||
e53e6b44 BD |
1179 | if (ce->ce_flags & CE_UNPACKED) { |
1180 | /* | |
1181 | * cache_bottom entry is already unpacked, so | |
1182 | * we can never match it; don't check it | |
1183 | * again. | |
1184 | */ | |
1185 | if (pos == o->cache_bottom) | |
1186 | ++o->cache_bottom; | |
730f7284 | 1187 | continue; |
e53e6b44 | 1188 | } |
a6720955 DT |
1189 | if (!ce_in_traverse_path(ce, info)) { |
1190 | /* | |
1191 | * Check if we can skip future cache checks | |
1192 | * (because we're already past all possible | |
1193 | * entries in the traverse path). | |
1194 | */ | |
1195 | if (info->traverse_path) { | |
1196 | if (strncmp(ce->name, info->traverse_path, | |
1197 | info->pathlen) > 0) | |
1198 | break; | |
1199 | } | |
730f7284 | 1200 | continue; |
a6720955 | 1201 | } |
730f7284 JH |
1202 | ce_name = ce->name + pfxlen; |
1203 | ce_slash = strchr(ce_name, '/'); | |
1204 | if (ce_slash) | |
1205 | ce_len = ce_slash - ce_name; | |
1206 | else | |
1207 | ce_len = ce_namelen(ce) - pfxlen; | |
90553847 | 1208 | cmp = name_compare(p, p_len, ce_name, ce_len); |
730f7284 JH |
1209 | /* |
1210 | * Exact match; if we have a directory we need to | |
1211 | * delay returning it. | |
1212 | */ | |
1213 | if (!cmp) | |
1214 | return ce_slash ? -2 - pos : pos; | |
1215 | if (0 < cmp) | |
1216 | continue; /* keep looking */ | |
1217 | /* | |
1218 | * ce_name sorts after p->path; could it be that we | |
1219 | * have files under p->path directory in the index? | |
1220 | * E.g. ce_name == "t-i", and p->path == "t"; we may | |
1221 | * have "t/a" in the index. | |
1222 | */ | |
90553847 | 1223 | if (p_len < ce_len && !memcmp(ce_name, p, p_len) && |
730f7284 JH |
1224 | ce_name[p_len] < '/') |
1225 | continue; /* keep looking */ | |
1226 | break; | |
1227 | } | |
1228 | return -1; | |
1229 | } | |
1230 | ||
523506df DS |
1231 | /* |
1232 | * Given a sparse directory entry 'ce', compare ce->name to | |
8c5de0d2 DS |
1233 | * info->traverse_path + p->path + '/' if info->traverse_path |
1234 | * is non-empty. | |
1235 | * | |
523506df DS |
1236 | * Compare ce->name to p->path + '/' otherwise. Note that |
1237 | * ce->name must end in a trailing '/' because it is a sparse | |
1238 | * directory entry. | |
1239 | */ | |
1240 | static int sparse_dir_matches_path(const struct cache_entry *ce, | |
1241 | struct traverse_info *info, | |
1242 | const struct name_entry *p) | |
1243 | { | |
1244 | assert(S_ISSPARSEDIR(ce->ce_mode)); | |
1245 | assert(ce->name[ce->ce_namelen - 1] == '/'); | |
1246 | ||
8c5de0d2 DS |
1247 | if (info->pathlen) |
1248 | return ce->ce_namelen == info->pathlen + p->pathlen + 1 && | |
1249 | ce->name[info->pathlen - 1] == '/' && | |
1250 | !strncmp(ce->name, info->traverse_path, info->pathlen) && | |
1251 | !strncmp(ce->name + info->pathlen, p->path, p->pathlen); | |
523506df DS |
1252 | return ce->ce_namelen == p->pathlen + 1 && |
1253 | !strncmp(ce->name, p->path, p->pathlen); | |
1254 | } | |
1255 | ||
730f7284 JH |
1256 | static struct cache_entry *find_cache_entry(struct traverse_info *info, |
1257 | const struct name_entry *p) | |
1258 | { | |
72d84ea3 | 1259 | const char *path; |
90553847 | 1260 | int pos = find_cache_pos(info, p->path, p->pathlen); |
730f7284 JH |
1261 | struct unpack_trees_options *o = info->data; |
1262 | ||
1263 | if (0 <= pos) | |
1264 | return o->src_index->cache[pos]; | |
523506df DS |
1265 | |
1266 | /* | |
1267 | * Check for a sparse-directory entry named "path/". | |
1268 | * Due to the input p->path not having a trailing | |
1269 | * slash, the negative 'pos' value overshoots the | |
1270 | * expected position, hence "-2" instead of "-1". | |
1271 | */ | |
1272 | pos = -pos - 2; | |
1273 | ||
1274 | if (pos < 0 || pos >= o->src_index->cache_nr) | |
730f7284 | 1275 | return NULL; |
523506df DS |
1276 | |
1277 | /* | |
1278 | * Due to lexicographic sorting and sparse directory | |
1279 | * entries ending with a trailing slash, our path as a | |
1280 | * sparse directory (e.g "subdir/") and our path as a | |
1281 | * file (e.g. "subdir") might be separated by other | |
1282 | * paths (e.g. "subdir-"). | |
1283 | */ | |
1284 | while (pos >= 0) { | |
72d84ea3 | 1285 | struct cache_entry *ce = o->src_index->cache[pos]; |
523506df | 1286 | |
72d84ea3 DS |
1287 | if (!skip_prefix(ce->name, info->traverse_path, &path) || |
1288 | strncmp(path, p->path, p->pathlen) || | |
1289 | path[p->pathlen] != '/') | |
523506df DS |
1290 | return NULL; |
1291 | ||
1292 | if (S_ISSPARSEDIR(ce->ce_mode) && | |
1293 | sparse_dir_matches_path(ce, info, p)) | |
1294 | return ce; | |
1295 | ||
1296 | pos--; | |
1297 | } | |
1298 | ||
1299 | return NULL; | |
730f7284 JH |
1300 | } |
1301 | ||
ba655da5 JH |
1302 | static void debug_path(struct traverse_info *info) |
1303 | { | |
1304 | if (info->prev) { | |
1305 | debug_path(info->prev); | |
90553847 | 1306 | if (*info->prev->name) |
ba655da5 JH |
1307 | putchar('/'); |
1308 | } | |
90553847 | 1309 | printf("%s", info->name); |
ba655da5 JH |
1310 | } |
1311 | ||
1312 | static void debug_name_entry(int i, struct name_entry *n) | |
1313 | { | |
1314 | printf("ent#%d %06o %s\n", i, | |
1315 | n->path ? n->mode : 0, | |
1316 | n->path ? n->path : "(missing)"); | |
1317 | } | |
1318 | ||
1319 | static void debug_unpack_callback(int n, | |
1320 | unsigned long mask, | |
1321 | unsigned long dirmask, | |
1322 | struct name_entry *names, | |
1323 | struct traverse_info *info) | |
1324 | { | |
1325 | int i; | |
1326 | printf("* unpack mask %lu, dirmask %lu, cnt %d ", | |
1327 | mask, dirmask, n); | |
1328 | debug_path(info); | |
1329 | putchar('\n'); | |
1330 | for (i = 0; i < n; i++) | |
1331 | debug_name_entry(i, names + i); | |
1332 | } | |
1333 | ||
523506df DS |
1334 | /* |
1335 | * Returns true if and only if the given cache_entry is a | |
1336 | * sparse-directory entry that matches the given name_entry | |
1337 | * from the tree walk at the given traverse_info. | |
1338 | */ | |
1339 | static int is_sparse_directory_entry(struct cache_entry *ce, | |
1340 | struct name_entry *name, | |
1341 | struct traverse_info *info) | |
1342 | { | |
1343 | if (!ce || !name || !S_ISSPARSEDIR(ce->ce_mode)) | |
1344 | return 0; | |
1345 | ||
1346 | return sparse_dir_matches_path(ce, info, name); | |
1347 | } | |
1348 | ||
ab81047a VD |
1349 | static int unpack_sparse_callback(int n, unsigned long mask, unsigned long dirmask, struct name_entry *names, struct traverse_info *info) |
1350 | { | |
1351 | struct cache_entry *src[MAX_UNPACK_TREES + 1] = { NULL, }; | |
1352 | struct unpack_trees_options *o = info->data; | |
1353 | int ret; | |
1354 | ||
1355 | assert(o->merge); | |
1356 | ||
1357 | /* | |
1358 | * Unlike in 'unpack_callback', where src[0] is derived from the index when | |
1359 | * merging, src[0] is a transient cache entry derived from the first tree | |
1360 | * provided. Create the temporary entry as if it came from a non-sparse index. | |
1361 | */ | |
1362 | if (!is_null_oid(&names[0].oid)) { | |
1363 | src[0] = create_ce_entry(info, &names[0], 0, | |
1364 | &o->result, 1, | |
1365 | dirmask & (1ul << 0)); | |
1366 | src[0]->ce_flags |= (CE_SKIP_WORKTREE | CE_NEW_SKIP_WORKTREE); | |
1367 | } | |
1368 | ||
1369 | /* | |
1370 | * 'unpack_single_entry' assumes that src[0] is derived directly from | |
1371 | * the index, rather than from an entry in 'names'. This is *not* true when | |
1372 | * merging a sparse directory, in which case names[0] is the "index" source | |
1373 | * entry. To match the expectations of 'unpack_single_entry', shift past the | |
1374 | * "index" tree (i.e., names[0]) and adjust 'names', 'n', 'mask', and | |
1375 | * 'dirmask' accordingly. | |
1376 | */ | |
1377 | ret = unpack_single_entry(n - 1, mask >> 1, dirmask >> 1, src, names + 1, info); | |
1378 | ||
1379 | if (src[0]) | |
1380 | discard_cache_entry(src[0]); | |
1381 | ||
1382 | return ret >= 0 ? mask : -1; | |
1383 | } | |
1384 | ||
b4da3738 NTND |
1385 | /* |
1386 | * Note that traverse_by_cache_tree() duplicates some logic in this function | |
1387 | * without actually calling it. If you change the logic here you may need to | |
1388 | * check and change there as well. | |
1389 | */ | |
01904572 LT |
1390 | static int unpack_callback(int n, unsigned long mask, unsigned long dirmask, struct name_entry *names, struct traverse_info *info) |
1391 | { | |
c7cddc1a | 1392 | struct cache_entry *src[MAX_UNPACK_TREES + 1] = { NULL, }; |
01904572 | 1393 | struct unpack_trees_options *o = info->data; |
01904572 LT |
1394 | const struct name_entry *p = names; |
1395 | ||
1396 | /* Find first entry with a real name (we could use "mask" too) */ | |
1397 | while (!p->mode) | |
1398 | p++; | |
1399 | ||
ba655da5 JH |
1400 | if (o->debug_unpack) |
1401 | debug_unpack_callback(n, mask, dirmask, names, info); | |
1402 | ||
01904572 LT |
1403 | /* Are we supposed to look at the index too? */ |
1404 | if (o->merge) { | |
da165f47 | 1405 | while (1) { |
da165f47 | 1406 | int cmp; |
730f7284 JH |
1407 | struct cache_entry *ce; |
1408 | ||
1409 | if (o->diff_index_cached) | |
99430aa1 | 1410 | ce = next_cache_entry(o); |
730f7284 JH |
1411 | else |
1412 | ce = find_cache_entry(info, p); | |
1413 | ||
da165f47 JH |
1414 | if (!ce) |
1415 | break; | |
1416 | cmp = compare_entry(ce, info, p); | |
01904572 LT |
1417 | if (cmp < 0) { |
1418 | if (unpack_index_entry(ce, o) < 0) | |
353c5eeb | 1419 | return unpack_failed(o, NULL); |
01904572 LT |
1420 | continue; |
1421 | } | |
1422 | if (!cmp) { | |
1423 | if (ce_stage(ce)) { | |
1424 | /* | |
da165f47 JH |
1425 | * If we skip unmerged index |
1426 | * entries, we'll skip this | |
1427 | * entry *and* the tree | |
1428 | * entries associated with it! | |
01904572 | 1429 | */ |
34110cd4 | 1430 | if (o->skip_unmerged) { |
da165f47 | 1431 | add_same_unmerged(ce, o); |
01904572 | 1432 | return mask; |
34110cd4 | 1433 | } |
01904572 LT |
1434 | } |
1435 | src[0] = ce; | |
01904572 LT |
1436 | } |
1437 | break; | |
1438 | } | |
1439 | } | |
1440 | ||
bd6a3fd7 | 1441 | if (unpack_single_entry(n, mask, dirmask, src, names, info) < 0) |
01904572 LT |
1442 | return -1; |
1443 | ||
97e5954b | 1444 | if (o->merge && src[0]) { |
da165f47 JH |
1445 | if (ce_stage(src[0])) |
1446 | mark_ce_used_same_name(src[0], o); | |
1447 | else | |
1448 | mark_ce_used(src[0], o); | |
1449 | } | |
1450 | ||
01904572 LT |
1451 | /* Now handle any directories.. */ |
1452 | if (dirmask) { | |
b65982b6 JH |
1453 | /* special case: "diff-index --cached" looking at a tree */ |
1454 | if (o->diff_index_cached && | |
1455 | n == 1 && dirmask == 1 && S_ISDIR(names->mode)) { | |
1456 | int matches; | |
1457 | matches = cache_tree_matches_traversal(o->src_index->cache_tree, | |
1458 | names, info); | |
1459 | /* | |
da165f47 JH |
1460 | * Everything under the name matches; skip the |
1461 | * entire hierarchy. diff_index_cached codepath | |
1462 | * special cases D/F conflicts in such a way that | |
1463 | * it does not do any look-ahead, so this is safe. | |
b65982b6 JH |
1464 | */ |
1465 | if (matches) { | |
bfc763df VD |
1466 | /* |
1467 | * Only increment the cache_bottom if the | |
1468 | * directory isn't a sparse directory index | |
1469 | * entry (if it is, it was already incremented) | |
1470 | * in 'mark_ce_used()' | |
1471 | */ | |
1472 | if (!src[0] || !S_ISSPARSEDIR(src[0]->ce_mode)) | |
1473 | o->cache_bottom += matches; | |
b65982b6 JH |
1474 | return mask; |
1475 | } | |
1476 | } | |
1477 | ||
523506df DS |
1478 | if (!is_sparse_directory_entry(src[0], names, info) && |
1479 | traverse_trees_recursive(n, dirmask, mask & ~dirmask, | |
1480 | names, info) < 0) { | |
542c264b | 1481 | return -1; |
523506df DS |
1482 | } |
1483 | ||
01904572 LT |
1484 | return mask; |
1485 | } | |
1486 | ||
1487 | return mask; | |
1488 | } | |
1489 | ||
27c82fb3 NTND |
1490 | static int clear_ce_flags_1(struct index_state *istate, |
1491 | struct cache_entry **cache, int nr, | |
fc2b6214 | 1492 | struct strbuf *prefix, |
28911091 | 1493 | int select_mask, int clear_mask, |
468ce99b | 1494 | struct pattern_list *pl, |
4dcd4def DS |
1495 | enum pattern_match_result default_match, |
1496 | int progress_nr); | |
28911091 | 1497 | |
9037026d | 1498 | /* Whole directory matching */ |
27c82fb3 NTND |
1499 | static int clear_ce_flags_dir(struct index_state *istate, |
1500 | struct cache_entry **cache, int nr, | |
fc2b6214 | 1501 | struct strbuf *prefix, |
9037026d NTND |
1502 | char *basename, |
1503 | int select_mask, int clear_mask, | |
468ce99b | 1504 | struct pattern_list *pl, |
4dcd4def DS |
1505 | enum pattern_match_result default_match, |
1506 | int progress_nr) | |
9037026d | 1507 | { |
28911091 | 1508 | struct cache_entry **cache_end; |
9037026d | 1509 | int dtype = DT_DIR; |
fc2b6214 | 1510 | int rc; |
eb42feca DS |
1511 | enum pattern_match_result ret, orig_ret; |
1512 | orig_ret = path_matches_pattern_list(prefix->buf, prefix->len, | |
1513 | basename, &dtype, pl, istate); | |
9037026d | 1514 | |
fc2b6214 | 1515 | strbuf_addch(prefix, '/'); |
9037026d | 1516 | |
28911091 | 1517 | /* If undecided, use matching result of parent dir in defval */ |
eb42feca | 1518 | if (orig_ret == UNDECIDED) |
468ce99b | 1519 | ret = default_match; |
eb42feca DS |
1520 | else |
1521 | ret = orig_ret; | |
9037026d | 1522 | |
28911091 NTND |
1523 | for (cache_end = cache; cache_end != cache + nr; cache_end++) { |
1524 | struct cache_entry *ce = *cache_end; | |
fc2b6214 | 1525 | if (strncmp(ce->name, prefix->buf, prefix->len)) |
28911091 | 1526 | break; |
9037026d NTND |
1527 | } |
1528 | ||
eb42feca DS |
1529 | if (pl->use_cone_patterns && orig_ret == MATCHED_RECURSIVE) { |
1530 | struct cache_entry **ce = cache; | |
4c6c7971 | 1531 | rc = cache_end - cache; |
eb42feca DS |
1532 | |
1533 | while (ce < cache_end) { | |
1534 | (*ce)->ce_flags &= ~clear_mask; | |
1535 | ce++; | |
1536 | } | |
1537 | } else if (pl->use_cone_patterns && orig_ret == NOT_MATCHED) { | |
4c6c7971 | 1538 | rc = cache_end - cache; |
eb42feca DS |
1539 | } else { |
1540 | rc = clear_ce_flags_1(istate, cache, cache_end - cache, | |
1541 | prefix, | |
1542 | select_mask, clear_mask, | |
4dcd4def DS |
1543 | pl, ret, |
1544 | progress_nr); | |
eb42feca DS |
1545 | } |
1546 | ||
fc2b6214 AP |
1547 | strbuf_setlen(prefix, prefix->len - 1); |
1548 | return rc; | |
9037026d NTND |
1549 | } |
1550 | ||
1551 | /* | |
1552 | * Traverse the index, find every entry that matches according to | |
caa3d554 | 1553 | * o->pl. Do "ce_flags &= ~clear_mask" on those entries. Return the |
9037026d NTND |
1554 | * number of traversed entries. |
1555 | * | |
1556 | * If select_mask is non-zero, only entries whose ce_flags has on of | |
1557 | * those bits enabled are traversed. | |
1558 | * | |
1559 | * cache : pointer to an index entry | |
1560 | * prefix_len : an offset to its path | |
1561 | * | |
1562 | * The current path ("prefix") including the trailing '/' is | |
1563 | * cache[0]->name[0..(prefix_len-1)] | |
1564 | * Top level path has prefix_len zero. | |
1565 | */ | |
27c82fb3 NTND |
1566 | static int clear_ce_flags_1(struct index_state *istate, |
1567 | struct cache_entry **cache, int nr, | |
fc2b6214 | 1568 | struct strbuf *prefix, |
9037026d | 1569 | int select_mask, int clear_mask, |
468ce99b | 1570 | struct pattern_list *pl, |
4dcd4def DS |
1571 | enum pattern_match_result default_match, |
1572 | int progress_nr) | |
9037026d | 1573 | { |
d20bc01a | 1574 | struct cache_entry **cache_end = nr ? cache + nr : cache; |
9037026d NTND |
1575 | |
1576 | /* | |
1577 | * Process all entries that have the given prefix and meet | |
1578 | * select_mask condition | |
1579 | */ | |
1580 | while(cache != cache_end) { | |
1581 | struct cache_entry *ce = *cache; | |
1582 | const char *name, *slash; | |
468ce99b DS |
1583 | int len, dtype; |
1584 | enum pattern_match_result ret; | |
9037026d | 1585 | |
4dcd4def DS |
1586 | display_progress(istate->progress, progress_nr); |
1587 | ||
9037026d NTND |
1588 | if (select_mask && !(ce->ce_flags & select_mask)) { |
1589 | cache++; | |
4dcd4def | 1590 | progress_nr++; |
9037026d NTND |
1591 | continue; |
1592 | } | |
1593 | ||
fc2b6214 | 1594 | if (prefix->len && strncmp(ce->name, prefix->buf, prefix->len)) |
9037026d NTND |
1595 | break; |
1596 | ||
fc2b6214 | 1597 | name = ce->name + prefix->len; |
9037026d NTND |
1598 | slash = strchr(name, '/'); |
1599 | ||
1600 | /* If it's a directory, try whole directory match first */ | |
1601 | if (slash) { | |
1602 | int processed; | |
1603 | ||
1604 | len = slash - name; | |
fc2b6214 | 1605 | strbuf_add(prefix, name, len); |
9037026d | 1606 | |
27c82fb3 | 1607 | processed = clear_ce_flags_dir(istate, cache, cache_end - cache, |
fc2b6214 AP |
1608 | prefix, |
1609 | prefix->buf + prefix->len - len, | |
9037026d | 1610 | select_mask, clear_mask, |
4dcd4def DS |
1611 | pl, default_match, |
1612 | progress_nr); | |
9037026d NTND |
1613 | |
1614 | /* clear_c_f_dir eats a whole dir already? */ | |
1615 | if (processed) { | |
1616 | cache += processed; | |
4dcd4def | 1617 | progress_nr += processed; |
fc2b6214 | 1618 | strbuf_setlen(prefix, prefix->len - len); |
9037026d NTND |
1619 | continue; |
1620 | } | |
1621 | ||
fc2b6214 | 1622 | strbuf_addch(prefix, '/'); |
4dcd4def DS |
1623 | processed = clear_ce_flags_1(istate, cache, cache_end - cache, |
1624 | prefix, | |
1625 | select_mask, clear_mask, pl, | |
1626 | default_match, progress_nr); | |
1627 | ||
1628 | cache += processed; | |
1629 | progress_nr += processed; | |
1630 | ||
fc2b6214 | 1631 | strbuf_setlen(prefix, prefix->len - len - 1); |
9037026d NTND |
1632 | continue; |
1633 | } | |
1634 | ||
1635 | /* Non-directory */ | |
1636 | dtype = ce_to_dtype(ce); | |
468ce99b DS |
1637 | ret = path_matches_pattern_list(ce->name, |
1638 | ce_namelen(ce), | |
1639 | name, &dtype, pl, istate); | |
1640 | if (ret == UNDECIDED) | |
1641 | ret = default_match; | |
f998a3f1 | 1642 | if (ret == MATCHED || ret == MATCHED_RECURSIVE) |
9037026d NTND |
1643 | ce->ce_flags &= ~clear_mask; |
1644 | cache++; | |
4dcd4def | 1645 | progress_nr++; |
9037026d | 1646 | } |
4dcd4def DS |
1647 | |
1648 | display_progress(istate->progress, progress_nr); | |
9037026d NTND |
1649 | return nr - (cache_end - cache); |
1650 | } | |
1651 | ||
27c82fb3 NTND |
1652 | static int clear_ce_flags(struct index_state *istate, |
1653 | int select_mask, int clear_mask, | |
4dcd4def DS |
1654 | struct pattern_list *pl, |
1655 | int show_progress) | |
9037026d | 1656 | { |
fc2b6214 | 1657 | static struct strbuf prefix = STRBUF_INIT; |
e6152e35 JH |
1658 | char label[100]; |
1659 | int rval; | |
fc2b6214 AP |
1660 | |
1661 | strbuf_reset(&prefix); | |
4dcd4def DS |
1662 | if (show_progress) |
1663 | istate->progress = start_delayed_progress( | |
1664 | _("Updating index flags"), | |
1665 | istate->cache_nr); | |
fc2b6214 | 1666 | |
e6152e35 JH |
1667 | xsnprintf(label, sizeof(label), "clear_ce_flags(0x%08lx,0x%08lx)", |
1668 | (unsigned long)select_mask, (unsigned long)clear_mask); | |
1669 | trace2_region_enter("unpack_trees", label, the_repository); | |
1670 | rval = clear_ce_flags_1(istate, | |
27c82fb3 NTND |
1671 | istate->cache, |
1672 | istate->cache_nr, | |
fc2b6214 | 1673 | &prefix, |
9037026d | 1674 | select_mask, clear_mask, |
4dcd4def | 1675 | pl, 0, 0); |
e6152e35 JH |
1676 | trace2_region_leave("unpack_trees", label, the_repository); |
1677 | ||
4dcd4def | 1678 | stop_progress(&istate->progress); |
e6152e35 | 1679 | return rval; |
9037026d NTND |
1680 | } |
1681 | ||
2431afbf NTND |
1682 | /* |
1683 | * Set/Clear CE_NEW_SKIP_WORKTREE according to $GIT_DIR/info/sparse-checkout | |
1684 | */ | |
caa3d554 | 1685 | static void mark_new_skip_worktree(struct pattern_list *pl, |
86016ec3 | 1686 | struct index_state *istate, |
4dcd4def DS |
1687 | int select_flag, int skip_wt_flag, |
1688 | int show_progress) | |
2431afbf NTND |
1689 | { |
1690 | int i; | |
1691 | ||
9037026d NTND |
1692 | /* |
1693 | * 1. Pretend the narrowest worktree: only unmerged entries | |
1694 | * are checked out | |
1695 | */ | |
86016ec3 NTND |
1696 | for (i = 0; i < istate->cache_nr; i++) { |
1697 | struct cache_entry *ce = istate->cache[i]; | |
2431afbf NTND |
1698 | |
1699 | if (select_flag && !(ce->ce_flags & select_flag)) | |
1700 | continue; | |
1701 | ||
b33fdfc3 | 1702 | if (!ce_stage(ce) && !(ce->ce_flags & CE_CONFLICTED)) |
2431afbf NTND |
1703 | ce->ce_flags |= skip_wt_flag; |
1704 | else | |
1705 | ce->ce_flags &= ~skip_wt_flag; | |
1706 | } | |
9037026d NTND |
1707 | |
1708 | /* | |
1709 | * 2. Widen worktree according to sparse-checkout file. | |
1710 | * Matched entries will have skip_wt_flag cleared (i.e. "in") | |
1711 | */ | |
4dcd4def | 1712 | clear_ce_flags(istate, select_flag, skip_wt_flag, pl, show_progress); |
2431afbf NTND |
1713 | } |
1714 | ||
30e89c12 EN |
1715 | static void populate_from_existing_patterns(struct unpack_trees_options *o, |
1716 | struct pattern_list *pl) | |
1717 | { | |
dd23022a | 1718 | if (get_sparse_checkout_patterns(pl) < 0) |
30e89c12 EN |
1719 | o->skip_sparse_checkout = 1; |
1720 | else | |
1721 | o->pl = pl; | |
30e89c12 EN |
1722 | } |
1723 | ||
74970392 VD |
1724 | static void update_sparsity_for_prefix(const char *prefix, |
1725 | struct index_state *istate) | |
1726 | { | |
1727 | int prefix_len = strlen(prefix); | |
1728 | struct strbuf ce_prefix = STRBUF_INIT; | |
1729 | ||
1730 | if (!istate->sparse_index) | |
1731 | return; | |
1732 | ||
1733 | while (prefix_len > 0 && prefix[prefix_len - 1] == '/') | |
1734 | prefix_len--; | |
1735 | ||
1736 | if (prefix_len <= 0) | |
1737 | BUG("Invalid prefix passed to update_sparsity_for_prefix"); | |
1738 | ||
1739 | strbuf_grow(&ce_prefix, prefix_len + 1); | |
1740 | strbuf_add(&ce_prefix, prefix, prefix_len); | |
1741 | strbuf_addch(&ce_prefix, '/'); | |
1742 | ||
1743 | /* | |
1744 | * If the prefix points to a sparse directory or a path inside a sparse | |
1745 | * directory, the index should be expanded. This is accomplished in one | |
1746 | * of two ways: | |
1747 | * - if the prefix is inside a sparse directory, it will be expanded by | |
1748 | * the 'ensure_full_index(...)' call in 'index_name_pos(...)'. | |
1749 | * - if the prefix matches an existing sparse directory entry, | |
1750 | * 'index_name_pos(...)' will return its index position, triggering | |
1751 | * the 'ensure_full_index(...)' below. | |
1752 | */ | |
1753 | if (!path_in_cone_mode_sparse_checkout(ce_prefix.buf, istate) && | |
1754 | index_name_pos(istate, ce_prefix.buf, ce_prefix.len) >= 0) | |
1755 | ensure_full_index(istate); | |
1756 | ||
1757 | strbuf_release(&ce_prefix); | |
1758 | } | |
30e89c12 | 1759 | |
eb9ae4b5 RS |
1760 | static int verify_absent(const struct cache_entry *, |
1761 | enum unpack_trees_error_types, | |
1762 | struct unpack_trees_options *); | |
2e2b887d JH |
1763 | /* |
1764 | * N-way merge "len" trees. Returns 0 on success, -1 on failure to manipulate the | |
1765 | * resulting index, -2 on failure to reflect the changes to the work tree. | |
2431afbf NTND |
1766 | * |
1767 | * CE_ADDED, CE_UNPACKED and CE_NEW_SKIP_WORKTREE are used internally | |
2e2b887d | 1768 | */ |
01904572 LT |
1769 | int unpack_trees(unsigned len, struct tree_desc *t, struct unpack_trees_options *o) |
1770 | { | |
6863df35 | 1771 | struct repository *repo = the_repository; |
99430aa1 | 1772 | int i, ret; |
0fb1eaa8 | 1773 | static struct cache_entry *dfc; |
caa3d554 | 1774 | struct pattern_list pl; |
fa0bde45 | 1775 | int free_pattern_list = 0; |
c42e0b64 | 1776 | struct dir_struct dir = DIR_INIT; |
16da134b | 1777 | |
480d3d6b EN |
1778 | if (o->reset == UNPACK_RESET_INVALID) |
1779 | BUG("o->reset had a value of 1; should be UNPACK_TREES_*_UNTRACKED"); | |
16da134b | 1780 | |
ca885a4f JH |
1781 | if (len > MAX_UNPACK_TREES) |
1782 | die("unpack_trees takes at most %d trees", MAX_UNPACK_TREES); | |
c42e0b64 EN |
1783 | if (o->dir) |
1784 | BUG("o->dir is for internal use only"); | |
16da134b | 1785 | |
0d1ed596 | 1786 | trace_performance_enter(); |
c338898a DS |
1787 | trace2_region_enter("unpack_trees", "unpack_trees", the_repository); |
1788 | ||
6863df35 DS |
1789 | prepare_repo_settings(repo); |
1790 | if (repo->settings.command_requires_full_index) { | |
1791 | ensure_full_index(o->src_index); | |
1792 | ensure_full_index(o->dst_index); | |
1793 | } | |
1794 | ||
480d3d6b EN |
1795 | if (o->reset == UNPACK_RESET_OVERWRITE_UNTRACKED && |
1796 | o->preserve_ignored) | |
1797 | BUG("UNPACK_RESET_OVERWRITE_UNTRACKED incompatible with preserved ignored files"); | |
1798 | ||
04988c8d | 1799 | if (!o->preserve_ignored) { |
c42e0b64 | 1800 | o->dir = &dir; |
04988c8d EN |
1801 | o->dir->flags |= DIR_SHOW_IGNORED; |
1802 | setup_standard_excludes(o->dir); | |
1803 | } | |
1804 | ||
74970392 VD |
1805 | if (o->prefix) |
1806 | update_sparsity_for_prefix(o->prefix, o->src_index); | |
1807 | ||
08aefc9e NTND |
1808 | if (!core_apply_sparse_checkout || !o->update) |
1809 | o->skip_sparse_checkout = 1; | |
e091228e | 1810 | if (!o->skip_sparse_checkout && !o->pl) { |
30e89c12 | 1811 | memset(&pl, 0, sizeof(pl)); |
fa0bde45 | 1812 | free_pattern_list = 1; |
30e89c12 | 1813 | populate_from_existing_patterns(o, &pl); |
08aefc9e NTND |
1814 | } |
1815 | ||
34110cd4 | 1816 | memset(&o->result, 0, sizeof(o->result)); |
913e0e99 | 1817 | o->result.initialized = 1; |
da165f47 JH |
1818 | o->result.timestamp.sec = o->src_index->timestamp.sec; |
1819 | o->result.timestamp.nsec = o->src_index->timestamp.nsec; | |
9170c7ab | 1820 | o->result.version = o->src_index->version; |
7db11830 EN |
1821 | if (!o->src_index->split_index) { |
1822 | o->result.split_index = NULL; | |
1823 | } else if (o->src_index == o->dst_index) { | |
1824 | /* | |
1825 | * o->dst_index (and thus o->src_index) will be discarded | |
1826 | * and overwritten with o->result at the end of this function, | |
1827 | * so just use src_index's split_index to avoid having to | |
1828 | * create a new one. | |
1829 | */ | |
1830 | o->result.split_index = o->src_index->split_index; | |
5fc2fc8f | 1831 | o->result.split_index->refcount++; |
7db11830 EN |
1832 | } else { |
1833 | o->result.split_index = init_split_index(&o->result); | |
1834 | } | |
75691ea3 | 1835 | oidcpy(&o->result.oid, &o->src_index->oid); |
16da134b | 1836 | o->merge_size = len; |
da165f47 | 1837 | mark_all_ce_unused(o->src_index); |
0fb1eaa8 | 1838 | |
3dfd3059 JS |
1839 | o->result.fsmonitor_last_update = |
1840 | xstrdup_or_null(o->src_index->fsmonitor_last_update); | |
679f2f9f | 1841 | |
2431afbf NTND |
1842 | /* |
1843 | * Sparse checkout loop #1: set NEW_SKIP_WORKTREE on existing entries | |
1844 | */ | |
1845 | if (!o->skip_sparse_checkout) | |
4dcd4def DS |
1846 | mark_new_skip_worktree(o->pl, o->src_index, 0, |
1847 | CE_NEW_SKIP_WORKTREE, o->verbose_update); | |
2431afbf | 1848 | |
0fb1eaa8 | 1849 | if (!dfc) |
13494ed1 | 1850 | dfc = xcalloc(1, cache_entry_size(0)); |
0fb1eaa8 | 1851 | o->df_conflict_entry = dfc; |
16da134b JS |
1852 | |
1853 | if (len) { | |
01904572 LT |
1854 | const char *prefix = o->prefix ? o->prefix : ""; |
1855 | struct traverse_info info; | |
1856 | ||
1857 | setup_traverse_info(&info, prefix); | |
1858 | info.fn = unpack_callback; | |
1859 | info.data = o; | |
e6c111b4 | 1860 | info.show_all_errors = o->show_all_errors; |
40e37256 | 1861 | info.pathspec = o->pathspec; |
01904572 | 1862 | |
da165f47 JH |
1863 | if (o->prefix) { |
1864 | /* | |
1865 | * Unpack existing index entries that sort before the | |
1866 | * prefix the tree is spliced into. Note that o->merge | |
1867 | * is always true in this case. | |
1868 | */ | |
1869 | while (1) { | |
99430aa1 | 1870 | struct cache_entry *ce = next_cache_entry(o); |
da165f47 JH |
1871 | if (!ce) |
1872 | break; | |
1873 | if (ce_in_traverse_path(ce, &info)) | |
1874 | break; | |
1875 | if (unpack_index_entry(ce, o) < 0) | |
1876 | goto return_failed; | |
1877 | } | |
08aefc9e | 1878 | } |
da165f47 | 1879 | |
0d1ed596 | 1880 | trace_performance_enter(); |
c338898a | 1881 | trace2_region_enter("unpack_trees", "traverse_trees", the_repository); |
67022e02 | 1882 | ret = traverse_trees(o->src_index, len, t, &info); |
c338898a | 1883 | trace2_region_leave("unpack_trees", "traverse_trees", the_repository); |
0d1ed596 NTND |
1884 | trace_performance_leave("traverse_trees"); |
1885 | if (ret < 0) | |
da165f47 | 1886 | goto return_failed; |
16da134b JS |
1887 | } |
1888 | ||
01904572 LT |
1889 | /* Any left-over entries in the index? */ |
1890 | if (o->merge) { | |
da165f47 | 1891 | while (1) { |
99430aa1 | 1892 | struct cache_entry *ce = next_cache_entry(o); |
da165f47 JH |
1893 | if (!ce) |
1894 | break; | |
01904572 | 1895 | if (unpack_index_entry(ce, o) < 0) |
da165f47 | 1896 | goto return_failed; |
17e46426 | 1897 | } |
17e46426 | 1898 | } |
da165f47 | 1899 | mark_all_ce_unused(o->src_index); |
16da134b | 1900 | |
08aefc9e NTND |
1901 | if (o->trivial_merges_only && o->nontrivial_merge) { |
1902 | ret = unpack_failed(o, "Merge requires file-level merging"); | |
1903 | goto done; | |
1904 | } | |
01904572 | 1905 | |
e800ec9d | 1906 | if (!o->skip_sparse_checkout) { |
2431afbf NTND |
1907 | /* |
1908 | * Sparse checkout loop #2: set NEW_SKIP_WORKTREE on entries not in loop #1 | |
031ba55b | 1909 | * If they will have NEW_SKIP_WORKTREE, also set CE_SKIP_WORKTREE |
2431afbf NTND |
1910 | * so apply_sparse_checkout() won't attempt to remove it from worktree |
1911 | */ | |
4dcd4def DS |
1912 | mark_new_skip_worktree(o->pl, &o->result, |
1913 | CE_ADDED, CE_SKIP_WORKTREE | CE_NEW_SKIP_WORKTREE, | |
1914 | o->verbose_update); | |
2431afbf | 1915 | |
17d26a4d | 1916 | ret = 0; |
2431afbf | 1917 | for (i = 0; i < o->result.cache_nr; i++) { |
e800ec9d NTND |
1918 | struct cache_entry *ce = o->result.cache[i]; |
1919 | ||
2431afbf NTND |
1920 | /* |
1921 | * Entries marked with CE_ADDED in merged_entry() do not have | |
1922 | * verify_absent() check (the check is effectively disabled | |
1923 | * because CE_NEW_SKIP_WORKTREE is set unconditionally). | |
1924 | * | |
1925 | * Do the real check now because we have had | |
1926 | * correct CE_NEW_SKIP_WORKTREE | |
1927 | */ | |
1928 | if (ce->ce_flags & CE_ADDED && | |
681c637b EN |
1929 | verify_absent(ce, WARNING_SPARSE_ORPHANED_NOT_OVERWRITTEN, o)) |
1930 | ret = 1; | |
1931 | ||
1932 | if (apply_sparse_checkout(&o->result, ce, o)) | |
1933 | ret = 1; | |
9e1afb16 | 1934 | } |
681c637b EN |
1935 | if (ret == 1) { |
1936 | /* | |
1937 | * Inability to sparsify or de-sparsify individual | |
1938 | * paths is not an error, but just a warning. | |
1939 | */ | |
1940 | if (o->show_all_errors) | |
1941 | display_warning_msgs(o); | |
1942 | ret = 0; | |
1943 | } | |
e800ec9d | 1944 | } |
01904572 | 1945 | |
b0a5a12a | 1946 | ret = check_updates(o, &o->result) ? (-2) : 0; |
e28f7641 | 1947 | if (o->dst_index) { |
836ef2b6 | 1948 | move_index_extensions(&o->result, o->src_index); |
52fca218 | 1949 | if (!ret) { |
4592e608 | 1950 | if (git_env_bool("GIT_TEST_CHECK_CACHE_TREE", 0)) |
c207e9e1 | 1951 | cache_tree_verify(the_repository, &o->result); |
52fca218 BD |
1952 | if (!cache_tree_fully_valid(o->result.cache_tree)) |
1953 | cache_tree_update(&o->result, | |
1954 | WRITE_TREE_SILENT | | |
1955 | WRITE_TREE_REPAIR); | |
1956 | } | |
1956ecd0 BP |
1957 | |
1958 | o->result.updated_workdir = 1; | |
e28f7641 | 1959 | discard_index(o->dst_index); |
34110cd4 | 1960 | *o->dst_index = o->result; |
a16cc8b2 JH |
1961 | } else { |
1962 | discard_index(&o->result); | |
e28f7641 | 1963 | } |
7db11830 | 1964 | o->src_index = NULL; |
08aefc9e NTND |
1965 | |
1966 | done: | |
fa0bde45 | 1967 | if (free_pattern_list) |
e091228e | 1968 | clear_pattern_list(&pl); |
04988c8d EN |
1969 | if (o->dir) { |
1970 | dir_clear(o->dir); | |
c42e0b64 | 1971 | o->dir = NULL; |
04988c8d | 1972 | } |
c338898a | 1973 | trace2_region_leave("unpack_trees", "unpack_trees", the_repository); |
fa0bde45 | 1974 | trace_performance_leave("unpack_trees"); |
2e2b887d | 1975 | return ret; |
da165f47 JH |
1976 | |
1977 | return_failed: | |
e6c111b4 MM |
1978 | if (o->show_all_errors) |
1979 | display_error_msgs(o); | |
da165f47 | 1980 | mark_all_ce_unused(o->src_index); |
026680f8 | 1981 | ret = unpack_failed(o, NULL); |
b4194828 JH |
1982 | if (o->exiting_early) |
1983 | ret = 0; | |
026680f8 | 1984 | goto done; |
16da134b | 1985 | } |
076b0adc | 1986 | |
7af7a258 EN |
1987 | /* |
1988 | * Update SKIP_WORKTREE bits according to sparsity patterns, and update | |
1989 | * working directory to match. | |
1990 | * | |
1991 | * CE_NEW_SKIP_WORKTREE is used internally. | |
1992 | */ | |
1993 | enum update_sparsity_result update_sparsity(struct unpack_trees_options *o) | |
1994 | { | |
1995 | enum update_sparsity_result ret = UPDATE_SPARSITY_SUCCESS; | |
1996 | struct pattern_list pl; | |
ace224ac | 1997 | int i; |
7af7a258 EN |
1998 | unsigned old_show_all_errors; |
1999 | int free_pattern_list = 0; | |
2000 | ||
2001 | old_show_all_errors = o->show_all_errors; | |
2002 | o->show_all_errors = 1; | |
2003 | ||
2004 | /* Sanity checks */ | |
2005 | if (!o->update || o->index_only || o->skip_sparse_checkout) | |
2006 | BUG("update_sparsity() is for reflecting sparsity patterns in working directory"); | |
2007 | if (o->src_index != o->dst_index || o->fn) | |
2008 | BUG("update_sparsity() called wrong"); | |
2009 | ||
2010 | trace_performance_enter(); | |
2011 | ||
2012 | /* If we weren't given patterns, use the recorded ones */ | |
2013 | if (!o->pl) { | |
2014 | memset(&pl, 0, sizeof(pl)); | |
2015 | free_pattern_list = 1; | |
2016 | populate_from_existing_patterns(o, &pl); | |
2017 | if (o->skip_sparse_checkout) | |
2018 | goto skip_sparse_checkout; | |
2019 | } | |
2020 | ||
2021 | /* Set NEW_SKIP_WORKTREE on existing entries. */ | |
2022 | mark_all_ce_unused(o->src_index); | |
2023 | mark_new_skip_worktree(o->pl, o->src_index, 0, | |
2024 | CE_NEW_SKIP_WORKTREE, o->verbose_update); | |
2025 | ||
2026 | /* Then loop over entries and update/remove as needed */ | |
2027 | ret = UPDATE_SPARSITY_SUCCESS; | |
7af7a258 EN |
2028 | for (i = 0; i < o->src_index->cache_nr; i++) { |
2029 | struct cache_entry *ce = o->src_index->cache[i]; | |
2030 | ||
ebb568b9 EN |
2031 | |
2032 | if (ce_stage(ce)) { | |
2033 | /* -1 because for loop will increment by 1 */ | |
2034 | i += warn_conflicted_path(o->src_index, i, o) - 1; | |
2035 | ret = UPDATE_SPARSITY_WARNINGS; | |
2036 | continue; | |
2037 | } | |
2038 | ||
7af7a258 EN |
2039 | if (apply_sparse_checkout(o->src_index, ce, o)) |
2040 | ret = UPDATE_SPARSITY_WARNINGS; | |
7af7a258 EN |
2041 | } |
2042 | ||
2043 | skip_sparse_checkout: | |
2044 | if (check_updates(o, o->src_index)) | |
2045 | ret = UPDATE_SPARSITY_WORKTREE_UPDATE_FAILURES; | |
2046 | ||
6271d77c | 2047 | display_warning_msgs(o); |
7af7a258 EN |
2048 | o->show_all_errors = old_show_all_errors; |
2049 | if (free_pattern_list) | |
2050 | clear_pattern_list(&pl); | |
2051 | trace_performance_leave("update_sparsity"); | |
2052 | return ret; | |
2053 | } | |
2054 | ||
076b0adc JS |
2055 | /* Here come the merge functions */ |
2056 | ||
eb9ae4b5 RS |
2057 | static int reject_merge(const struct cache_entry *ce, |
2058 | struct unpack_trees_options *o) | |
076b0adc | 2059 | { |
191e9d2c | 2060 | return add_rejected_path(o, ERROR_WOULD_OVERWRITE, ce->name); |
076b0adc JS |
2061 | } |
2062 | ||
eb9ae4b5 | 2063 | static int same(const struct cache_entry *a, const struct cache_entry *b) |
076b0adc JS |
2064 | { |
2065 | if (!!a != !!b) | |
2066 | return 0; | |
2067 | if (!a && !b) | |
2068 | return 1; | |
e11d7b59 JH |
2069 | if ((a->ce_flags | b->ce_flags) & CE_CONFLICTED) |
2070 | return 0; | |
076b0adc | 2071 | return a->ce_mode == b->ce_mode && |
4a7e27e9 | 2072 | oideq(&a->oid, &b->oid); |
076b0adc JS |
2073 | } |
2074 | ||
2075 | ||
2076 | /* | |
2077 | * When a CE gets turned into an unmerged entry, we | |
2078 | * want it to be up-to-date | |
2079 | */ | |
eb9ae4b5 RS |
2080 | static int verify_uptodate_1(const struct cache_entry *ce, |
2081 | struct unpack_trees_options *o, | |
2082 | enum unpack_trees_error_types error_type) | |
076b0adc JS |
2083 | { |
2084 | struct stat st; | |
2085 | ||
d5b66299 NTND |
2086 | if (o->index_only) |
2087 | return 0; | |
2088 | ||
2089 | /* | |
2090 | * CE_VALID and CE_SKIP_WORKTREE cheat, we better check again | |
2091 | * if this entry is truly up-to-date because this file may be | |
2092 | * overwritten. | |
2093 | */ | |
2094 | if ((ce->ce_flags & CE_VALID) || ce_skip_worktree(ce)) | |
2095 | ; /* keep checking */ | |
2096 | else if (o->reset || ce_uptodate(ce)) | |
203a2fe1 | 2097 | return 0; |
076b0adc JS |
2098 | |
2099 | if (!lstat(ce->name, &st)) { | |
d5b66299 NTND |
2100 | int flags = CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE; |
2101 | unsigned changed = ie_match_stat(o->src_index, ce, &st, flags); | |
a7bc845a SB |
2102 | |
2103 | if (submodule_from_ce(ce)) { | |
2104 | int r = check_submodule_move_head(ce, | |
2105 | "HEAD", oid_to_hex(&ce->oid), o); | |
2106 | if (r) | |
191e9d2c | 2107 | return add_rejected_path(o, error_type, ce->name); |
a7bc845a SB |
2108 | return 0; |
2109 | } | |
2110 | ||
076b0adc | 2111 | if (!changed) |
203a2fe1 | 2112 | return 0; |
936492d3 | 2113 | /* |
a7bc845a SB |
2114 | * Historic default policy was to allow submodule to be out |
2115 | * of sync wrt the superproject index. If the submodule was | |
2116 | * not considered interesting above, we don't care here. | |
936492d3 | 2117 | */ |
7a51ed66 | 2118 | if (S_ISGITLINK(ce->ce_mode)) |
203a2fe1 | 2119 | return 0; |
a7bc845a | 2120 | |
076b0adc JS |
2121 | errno = 0; |
2122 | } | |
076b0adc | 2123 | if (errno == ENOENT) |
203a2fe1 | 2124 | return 0; |
191e9d2c | 2125 | return add_rejected_path(o, error_type, ce->name); |
35a5aa79 NTND |
2126 | } |
2127 | ||
64b1abe9 EN |
2128 | int verify_uptodate(const struct cache_entry *ce, |
2129 | struct unpack_trees_options *o) | |
35a5aa79 | 2130 | { |
26b5d6b0 EN |
2131 | if (!o->skip_sparse_checkout && |
2132 | (ce->ce_flags & CE_SKIP_WORKTREE) && | |
2133 | (ce->ce_flags & CE_NEW_SKIP_WORKTREE)) | |
f1f523ea | 2134 | return 0; |
08402b04 | 2135 | return verify_uptodate_1(ce, o, ERROR_NOT_UPTODATE_FILE); |
076b0adc JS |
2136 | } |
2137 | ||
eb9ae4b5 | 2138 | static int verify_uptodate_sparse(const struct cache_entry *ce, |
e800ec9d NTND |
2139 | struct unpack_trees_options *o) |
2140 | { | |
1ac83f42 | 2141 | return verify_uptodate_1(ce, o, WARNING_SPARSE_NOT_UPTODATE_FILE); |
076b0adc JS |
2142 | } |
2143 | ||
383480ba NTND |
2144 | /* |
2145 | * TODO: We should actually invalidate o->result, not src_index [1]. | |
2146 | * But since cache tree and untracked cache both are not copied to | |
2147 | * o->result until unpacking is complete, we invalidate them on | |
2148 | * src_index instead with the assumption that they will be copied to | |
2149 | * dst_index at the end. | |
2150 | * | |
2151 | * [1] src_index->cache_tree is also used in unpack_callback() so if | |
2152 | * we invalidate o->result, we need to update it to use | |
2153 | * o->result.cache_tree as well. | |
2154 | */ | |
eb9ae4b5 RS |
2155 | static void invalidate_ce_path(const struct cache_entry *ce, |
2156 | struct unpack_trees_options *o) | |
076b0adc | 2157 | { |
e931371a NTND |
2158 | if (!ce) |
2159 | return; | |
2160 | cache_tree_invalidate_path(o->src_index, ce->name); | |
0cacebf0 | 2161 | untracked_cache_invalidate_path(o->src_index, ce->name, 1); |
076b0adc JS |
2162 | } |
2163 | ||
0cf73755 SV |
2164 | /* |
2165 | * Check that checking out ce->sha1 in subdir ce->name is not | |
2166 | * going to overwrite any working files. | |
0cf73755 | 2167 | */ |
d6b12300 SB |
2168 | static int verify_clean_submodule(const char *old_sha1, |
2169 | const struct cache_entry *ce, | |
eb9ae4b5 | 2170 | struct unpack_trees_options *o) |
0cf73755 | 2171 | { |
a7bc845a SB |
2172 | if (!submodule_from_ce(ce)) |
2173 | return 0; | |
2174 | ||
2175 | return check_submodule_move_head(ce, old_sha1, | |
2176 | oid_to_hex(&ce->oid), o); | |
0cf73755 SV |
2177 | } |
2178 | ||
eb9ae4b5 | 2179 | static int verify_clean_subdirectory(const struct cache_entry *ce, |
eb9ae4b5 | 2180 | struct unpack_trees_options *o) |
c8193534 JH |
2181 | { |
2182 | /* | |
0cf73755 | 2183 | * we are about to extract "ce->name"; we would not want to lose |
c8193534 JH |
2184 | * anything in the existing directory there. |
2185 | */ | |
2186 | int namelen; | |
7b9e3ce0 | 2187 | int i; |
c8193534 JH |
2188 | struct dir_struct d; |
2189 | char *pathbuf; | |
2190 | int cnt = 0; | |
0cf73755 | 2191 | |
d6b12300 | 2192 | if (S_ISGITLINK(ce->ce_mode)) { |
1053fe82 | 2193 | struct object_id oid; |
a98e6101 | 2194 | int sub_head = resolve_gitlink_ref(ce->name, "HEAD", &oid); |
d6b12300 SB |
2195 | /* |
2196 | * If we are not going to update the submodule, then | |
0cf73755 SV |
2197 | * we don't care. |
2198 | */ | |
4a7e27e9 | 2199 | if (!sub_head && oideq(&oid, &ce->oid)) |
0cf73755 | 2200 | return 0; |
1053fe82 | 2201 | return verify_clean_submodule(sub_head ? NULL : oid_to_hex(&oid), |
df351c6e | 2202 | ce, o); |
0cf73755 | 2203 | } |
c8193534 JH |
2204 | |
2205 | /* | |
2206 | * First let's make sure we do not have a local modification | |
2207 | * in that directory. | |
2208 | */ | |
68c4f6a5 | 2209 | namelen = ce_namelen(ce); |
da165f47 JH |
2210 | for (i = locate_in_src_index(ce, o); |
2211 | i < o->src_index->cache_nr; | |
2212 | i++) { | |
837e5fe9 CB |
2213 | struct cache_entry *ce2 = o->src_index->cache[i]; |
2214 | int len = ce_namelen(ce2); | |
c8193534 | 2215 | if (len < namelen || |
837e5fe9 CB |
2216 | strncmp(ce->name, ce2->name, namelen) || |
2217 | ce2->name[namelen] != '/') | |
c8193534 JH |
2218 | break; |
2219 | /* | |
da165f47 JH |
2220 | * ce2->name is an entry in the subdirectory to be |
2221 | * removed. | |
c8193534 | 2222 | */ |
837e5fe9 CB |
2223 | if (!ce_stage(ce2)) { |
2224 | if (verify_uptodate(ce2, o)) | |
203a2fe1 | 2225 | return -1; |
837e5fe9 | 2226 | add_entry(o, ce2, CE_REMOVE, 0); |
5697ca9a | 2227 | invalidate_ce_path(ce, o); |
da165f47 | 2228 | mark_ce_used(ce2, o); |
c8193534 JH |
2229 | } |
2230 | cnt++; | |
2231 | } | |
2232 | ||
b817e545 | 2233 | /* Do not lose a locally present file that is not ignored. */ |
75faa45a | 2234 | pathbuf = xstrfmt("%.*s/", namelen, ce->name); |
c8193534 JH |
2235 | |
2236 | memset(&d, 0, sizeof(d)); | |
2237 | if (o->dir) | |
2238 | d.exclude_per_dir = o->dir->exclude_per_dir; | |
c7f3259d | 2239 | i = read_directory(&d, o->src_index, pathbuf, namelen+1, NULL); |
e5a917fc ÆAB |
2240 | dir_clear(&d); |
2241 | free(pathbuf); | |
c8193534 | 2242 | if (i) |
191e9d2c | 2243 | return add_rejected_path(o, ERROR_NOT_UPTODATE_DIR, ce->name); |
b817e545 EN |
2244 | |
2245 | /* Do not lose startup_info->original_cwd */ | |
2246 | if (startup_info->original_cwd && | |
2247 | !strcmp(startup_info->original_cwd, ce->name)) | |
2248 | return add_rejected_path(o, ERROR_CWD_IN_THE_WAY, ce->name); | |
2249 | ||
c8193534 JH |
2250 | return cnt; |
2251 | } | |
2252 | ||
32260ad5 LT |
2253 | /* |
2254 | * This gets called when there was no index entry for the tree entry 'dst', | |
2255 | * but we found a file in the working tree that 'lstat()' said was fine, | |
2256 | * and we're on a case-insensitive filesystem. | |
2257 | * | |
2258 | * See if we can find a case-insensitive match in the index that also | |
2259 | * matches the stat information, and assume it's that other file! | |
2260 | */ | |
a9307f5a | 2261 | static int icase_exists(struct unpack_trees_options *o, const char *name, int len, struct stat *st) |
32260ad5 | 2262 | { |
9c5e6c80 | 2263 | const struct cache_entry *src; |
32260ad5 | 2264 | |
ebbd7439 | 2265 | src = index_file_exists(o->src_index, name, len, 1); |
56cac48c | 2266 | return src && !ie_match_stat(o->src_index, src, st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE); |
32260ad5 LT |
2267 | } |
2268 | ||
1fdd51aa EN |
2269 | enum absent_checking_type { |
2270 | COMPLETELY_ABSENT, | |
2271 | ABSENT_ANY_DIRECTORY | |
2272 | }; | |
2273 | ||
a9307f5a | 2274 | static int check_ok_to_remove(const char *name, int len, int dtype, |
eb9ae4b5 | 2275 | const struct cache_entry *ce, struct stat *st, |
a9307f5a | 2276 | enum unpack_trees_error_types error_type, |
1fdd51aa | 2277 | enum absent_checking_type absent_type, |
a9307f5a CB |
2278 | struct unpack_trees_options *o) |
2279 | { | |
9c5e6c80 | 2280 | const struct cache_entry *result; |
a9307f5a CB |
2281 | |
2282 | /* | |
2283 | * It may be that the 'lstat()' succeeded even though | |
2284 | * target 'ce' was absent, because there is an old | |
2285 | * entry that is different only in case.. | |
2286 | * | |
2287 | * Ignore that lstat() if it matches. | |
2288 | */ | |
2289 | if (ignore_case && icase_exists(o, name, len, st)) | |
2290 | return 0; | |
2291 | ||
589570db | 2292 | if (o->dir && |
c7f3259d | 2293 | is_excluded(o->dir, o->src_index, name, &dtype)) |
a9307f5a CB |
2294 | /* |
2295 | * ce->name is explicitly excluded, so it is Ok to | |
2296 | * overwrite it. | |
2297 | */ | |
2298 | return 0; | |
2299 | if (S_ISDIR(st->st_mode)) { | |
2300 | /* | |
2301 | * We are checking out path "foo" and | |
2302 | * found "foo/." in the working tree. | |
2303 | * This is tricky -- if we have modified | |
2304 | * files that are in "foo/" we would lose | |
2305 | * them. | |
2306 | */ | |
df351c6e | 2307 | if (verify_clean_subdirectory(ce, o) < 0) |
a9307f5a CB |
2308 | return -1; |
2309 | return 0; | |
2310 | } | |
2311 | ||
1fdd51aa EN |
2312 | /* If we only care about directories, then we can remove */ |
2313 | if (absent_type == ABSENT_ANY_DIRECTORY) | |
2314 | return 0; | |
2315 | ||
a9307f5a CB |
2316 | /* |
2317 | * The previous round may already have decided to | |
2318 | * delete this path, which is in a subdirectory that | |
2319 | * is being replaced with a blob. | |
2320 | */ | |
ebbd7439 | 2321 | result = index_file_exists(&o->result, name, len, 0); |
a9307f5a CB |
2322 | if (result) { |
2323 | if (result->ce_flags & CE_REMOVE) | |
2324 | return 0; | |
2325 | } | |
2326 | ||
191e9d2c | 2327 | return add_rejected_path(o, error_type, name); |
a9307f5a CB |
2328 | } |
2329 | ||
076b0adc JS |
2330 | /* |
2331 | * We do not want to remove or overwrite a working tree file that | |
f8a9d428 | 2332 | * is not tracked, unless it is ignored. |
076b0adc | 2333 | */ |
eb9ae4b5 RS |
2334 | static int verify_absent_1(const struct cache_entry *ce, |
2335 | enum unpack_trees_error_types error_type, | |
1fdd51aa | 2336 | enum absent_checking_type absent_type, |
eb9ae4b5 | 2337 | struct unpack_trees_options *o) |
076b0adc | 2338 | { |
f66caaf9 | 2339 | int len; |
076b0adc JS |
2340 | struct stat st; |
2341 | ||
0b0ee338 | 2342 | if (o->index_only || !o->update) |
203a2fe1 | 2343 | return 0; |
c8193534 | 2344 | |
0b0ee338 EN |
2345 | if (o->reset == UNPACK_RESET_OVERWRITE_UNTRACKED) { |
2346 | /* Avoid nuking startup_info->original_cwd... */ | |
2347 | if (startup_info->original_cwd && | |
2348 | !strcmp(startup_info->original_cwd, ce->name)) | |
2349 | return add_rejected_path(o, ERROR_CWD_IN_THE_WAY, | |
2350 | ce->name); | |
2351 | /* ...but nuke anything else. */ | |
203a2fe1 | 2352 | return 0; |
0b0ee338 | 2353 | } |
c8193534 | 2354 | |
fab78a0c | 2355 | len = check_leading_path(ce->name, ce_namelen(ce), 0); |
f66caaf9 | 2356 | if (!len) |
203a2fe1 | 2357 | return 0; |
f66caaf9 | 2358 | else if (len > 0) { |
f514ef97 JK |
2359 | char *path; |
2360 | int ret; | |
2361 | ||
2362 | path = xmemdupz(ce->name, len); | |
a93e5301 | 2363 | if (lstat(path, &st)) |
43c728e2 | 2364 | ret = error_errno("cannot stat '%s'", path); |
a7bc845a SB |
2365 | else { |
2366 | if (submodule_from_ce(ce)) | |
2367 | ret = check_submodule_move_head(ce, | |
2368 | oid_to_hex(&ce->oid), | |
2369 | NULL, o); | |
2370 | else | |
2371 | ret = check_ok_to_remove(path, len, DT_UNKNOWN, NULL, | |
1fdd51aa EN |
2372 | &st, error_type, |
2373 | absent_type, o); | |
a7bc845a | 2374 | } |
f514ef97 JK |
2375 | free(path); |
2376 | return ret; | |
92fda79e JN |
2377 | } else if (lstat(ce->name, &st)) { |
2378 | if (errno != ENOENT) | |
43c728e2 | 2379 | return error_errno("cannot stat '%s'", ce->name); |
92fda79e JN |
2380 | return 0; |
2381 | } else { | |
a7bc845a SB |
2382 | if (submodule_from_ce(ce)) |
2383 | return check_submodule_move_head(ce, oid_to_hex(&ce->oid), | |
2384 | NULL, o); | |
2385 | ||
a9307f5a | 2386 | return check_ok_to_remove(ce->name, ce_namelen(ce), |
92fda79e | 2387 | ce_to_dtype(ce), ce, &st, |
1fdd51aa | 2388 | error_type, absent_type, o); |
92fda79e | 2389 | } |
076b0adc | 2390 | } |
a9307f5a | 2391 | |
eb9ae4b5 | 2392 | static int verify_absent(const struct cache_entry *ce, |
08402b04 | 2393 | enum unpack_trees_error_types error_type, |
35a5aa79 NTND |
2394 | struct unpack_trees_options *o) |
2395 | { | |
2431afbf | 2396 | if (!o->skip_sparse_checkout && (ce->ce_flags & CE_NEW_SKIP_WORKTREE)) |
f1f523ea | 2397 | return 0; |
1fdd51aa EN |
2398 | return verify_absent_1(ce, error_type, COMPLETELY_ABSENT, o); |
2399 | } | |
2400 | ||
2401 | static int verify_absent_if_directory(const struct cache_entry *ce, | |
2402 | enum unpack_trees_error_types error_type, | |
2403 | struct unpack_trees_options *o) | |
2404 | { | |
2405 | if (!o->skip_sparse_checkout && (ce->ce_flags & CE_NEW_SKIP_WORKTREE)) | |
2406 | return 0; | |
2407 | return verify_absent_1(ce, error_type, ABSENT_ANY_DIRECTORY, o); | |
35a5aa79 | 2408 | } |
076b0adc | 2409 | |
eb9ae4b5 RS |
2410 | static int verify_absent_sparse(const struct cache_entry *ce, |
2411 | enum unpack_trees_error_types error_type, | |
2412 | struct unpack_trees_options *o) | |
e800ec9d | 2413 | { |
1fdd51aa | 2414 | return verify_absent_1(ce, error_type, COMPLETELY_ABSENT, o); |
e800ec9d | 2415 | } |
076b0adc | 2416 | |
f2fa3542 | 2417 | static int merged_entry(const struct cache_entry *ce, |
eb9ae4b5 | 2418 | const struct cache_entry *old, |
f2fa3542 | 2419 | struct unpack_trees_options *o) |
076b0adc | 2420 | { |
7f8ab8dc | 2421 | int update = CE_UPDATE; |
8e72d675 | 2422 | struct cache_entry *merge = dup_cache_entry(ce, &o->result); |
7f8ab8dc | 2423 | |
e11d7b59 | 2424 | if (!old) { |
2431afbf NTND |
2425 | /* |
2426 | * New index entries. In sparse checkout, the following | |
2427 | * verify_absent() will be delayed until after | |
2428 | * traverse_trees() finishes in unpack_trees(), then: | |
2429 | * | |
2430 | * - CE_NEW_SKIP_WORKTREE will be computed correctly | |
2431 | * - verify_absent() be called again, this time with | |
2432 | * correct CE_NEW_SKIP_WORKTREE | |
2433 | * | |
2434 | * verify_absent() call here does nothing in sparse | |
2435 | * checkout (i.e. o->skip_sparse_checkout == 0) | |
2436 | */ | |
2437 | update |= CE_ADDED; | |
2438 | merge->ce_flags |= CE_NEW_SKIP_WORKTREE; | |
2439 | ||
f2fa3542 RS |
2440 | if (verify_absent(merge, |
2441 | ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN, o)) { | |
a849735b | 2442 | discard_cache_entry(merge); |
e11d7b59 | 2443 | return -1; |
f2fa3542 | 2444 | } |
e11d7b59 | 2445 | invalidate_ce_path(merge, o); |
a7bc845a | 2446 | |
e84704f1 | 2447 | if (submodule_from_ce(ce) && file_exists(ce->name)) { |
a7bc845a SB |
2448 | int ret = check_submodule_move_head(ce, NULL, |
2449 | oid_to_hex(&ce->oid), | |
2450 | o); | |
2451 | if (ret) | |
2452 | return ret; | |
2453 | } | |
2454 | ||
e11d7b59 | 2455 | } else if (!(old->ce_flags & CE_CONFLICTED)) { |
076b0adc JS |
2456 | /* |
2457 | * See if we can re-use the old CE directly? | |
2458 | * That way we get the uptodate stat info. | |
2459 | * | |
7f8ab8dc LT |
2460 | * This also removes the UPDATE flag on a match; otherwise |
2461 | * we will end up overwriting local changes in the work tree. | |
076b0adc JS |
2462 | */ |
2463 | if (same(old, merge)) { | |
eb7a2f1d | 2464 | copy_cache_entry(merge, old); |
7f8ab8dc | 2465 | update = 0; |
076b0adc | 2466 | } else { |
f2fa3542 | 2467 | if (verify_uptodate(old, o)) { |
a849735b | 2468 | discard_cache_entry(merge); |
203a2fe1 | 2469 | return -1; |
f2fa3542 | 2470 | } |
2431afbf NTND |
2471 | /* Migrate old flags over */ |
2472 | update |= old->ce_flags & (CE_SKIP_WORKTREE | CE_NEW_SKIP_WORKTREE); | |
bc052d7f | 2473 | invalidate_ce_path(old, o); |
076b0adc | 2474 | } |
a7bc845a | 2475 | |
e84704f1 | 2476 | if (submodule_from_ce(ce) && file_exists(ce->name)) { |
a7bc845a SB |
2477 | int ret = check_submodule_move_head(ce, oid_to_hex(&old->oid), |
2478 | oid_to_hex(&ce->oid), | |
2479 | o); | |
2480 | if (ret) | |
2481 | return ret; | |
2482 | } | |
e11d7b59 JH |
2483 | } else { |
2484 | /* | |
2485 | * Previously unmerged entry left as an existence | |
2486 | * marker by read_index_unmerged(); | |
2487 | */ | |
1fdd51aa EN |
2488 | if (verify_absent_if_directory(merge, |
2489 | ERROR_WOULD_LOSE_UNTRACKED_OVERWRITTEN, o)) { | |
2490 | discard_cache_entry(merge); | |
2491 | return -1; | |
2492 | } | |
2493 | ||
e11d7b59 | 2494 | invalidate_ce_path(old, o); |
076b0adc JS |
2495 | } |
2496 | ||
cc756edd JS |
2497 | if (do_add_entry(o, merge, update, CE_STAGEMASK) < 0) |
2498 | return -1; | |
076b0adc JS |
2499 | return 1; |
2500 | } | |
2501 | ||
ab81047a VD |
2502 | static int merged_sparse_dir(const struct cache_entry * const *src, int n, |
2503 | struct unpack_trees_options *o) | |
2504 | { | |
2505 | struct tree_desc t[MAX_UNPACK_TREES + 1]; | |
2506 | void * tree_bufs[MAX_UNPACK_TREES + 1]; | |
2507 | struct traverse_info info; | |
2508 | int i, ret; | |
2509 | ||
2510 | /* | |
2511 | * Create the tree traversal information for traversing into *only* the | |
2512 | * sparse directory. | |
2513 | */ | |
2514 | setup_traverse_info(&info, src[0]->name); | |
2515 | info.fn = unpack_sparse_callback; | |
2516 | info.data = o; | |
2517 | info.show_all_errors = o->show_all_errors; | |
2518 | info.pathspec = o->pathspec; | |
2519 | ||
2520 | /* Get the tree descriptors of the sparse directory in each of the merging trees */ | |
2521 | for (i = 0; i < n; i++) | |
2522 | tree_bufs[i] = fill_tree_descriptor(o->src_index->repo, &t[i], | |
2523 | src[i] && !is_null_oid(&src[i]->oid) ? &src[i]->oid : NULL); | |
2524 | ||
2525 | ret = traverse_trees(o->src_index, n, t, &info); | |
2526 | ||
2527 | for (i = 0; i < n; i++) | |
2528 | free(tree_bufs[i]); | |
2529 | ||
2530 | return ret; | |
2531 | } | |
2532 | ||
eb9ae4b5 RS |
2533 | static int deleted_entry(const struct cache_entry *ce, |
2534 | const struct cache_entry *old, | |
2535 | struct unpack_trees_options *o) | |
076b0adc | 2536 | { |
34110cd4 LT |
2537 | /* Did it exist in the index? */ |
2538 | if (!old) { | |
08402b04 | 2539 | if (verify_absent(ce, ERROR_WOULD_LOSE_UNTRACKED_REMOVED, o)) |
203a2fe1 | 2540 | return -1; |
34110cd4 | 2541 | return 0; |
56d06fe4 EN |
2542 | } else if (verify_absent_if_directory(ce, ERROR_WOULD_LOSE_UNTRACKED_REMOVED, o)) { |
2543 | return -1; | |
34110cd4 | 2544 | } |
56d06fe4 | 2545 | |
e11d7b59 | 2546 | if (!(old->ce_flags & CE_CONFLICTED) && verify_uptodate(old, o)) |
34110cd4 LT |
2547 | return -1; |
2548 | add_entry(o, ce, CE_REMOVE, 0); | |
bc052d7f | 2549 | invalidate_ce_path(ce, o); |
076b0adc JS |
2550 | return 1; |
2551 | } | |
2552 | ||
eb9ae4b5 RS |
2553 | static int keep_entry(const struct cache_entry *ce, |
2554 | struct unpack_trees_options *o) | |
076b0adc | 2555 | { |
34110cd4 | 2556 | add_entry(o, ce, 0, 0); |
5697ca9a NTND |
2557 | if (ce_stage(ce)) |
2558 | invalidate_ce_path(ce, o); | |
076b0adc JS |
2559 | return 1; |
2560 | } | |
2561 | ||
2562 | #if DBRT_DEBUG | |
2563 | static void show_stage_entry(FILE *o, | |
2564 | const char *label, const struct cache_entry *ce) | |
2565 | { | |
2566 | if (!ce) | |
2567 | fprintf(o, "%s (missing)\n", label); | |
2568 | else | |
2569 | fprintf(o, "%s%06o %s %d\t%s\n", | |
2570 | label, | |
7a51ed66 | 2571 | ce->ce_mode, |
99d1a986 | 2572 | oid_to_hex(&ce->oid), |
076b0adc JS |
2573 | ce_stage(ce), |
2574 | ce->name); | |
2575 | } | |
2576 | #endif | |
2577 | ||
5828e835 RS |
2578 | int threeway_merge(const struct cache_entry * const *stages, |
2579 | struct unpack_trees_options *o) | |
076b0adc | 2580 | { |
eb9ae4b5 RS |
2581 | const struct cache_entry *index; |
2582 | const struct cache_entry *head; | |
2583 | const struct cache_entry *remote = stages[o->head_idx + 1]; | |
076b0adc JS |
2584 | int count; |
2585 | int head_match = 0; | |
2586 | int remote_match = 0; | |
076b0adc JS |
2587 | |
2588 | int df_conflict_head = 0; | |
2589 | int df_conflict_remote = 0; | |
2590 | ||
2591 | int any_anc_missing = 0; | |
2592 | int no_anc_exists = 1; | |
2593 | int i; | |
2594 | ||
2595 | for (i = 1; i < o->head_idx; i++) { | |
4c4caafc | 2596 | if (!stages[i] || stages[i] == o->df_conflict_entry) |
076b0adc | 2597 | any_anc_missing = 1; |
4c4caafc | 2598 | else |
076b0adc | 2599 | no_anc_exists = 0; |
076b0adc JS |
2600 | } |
2601 | ||
2602 | index = stages[0]; | |
2603 | head = stages[o->head_idx]; | |
2604 | ||
2605 | if (head == o->df_conflict_entry) { | |
2606 | df_conflict_head = 1; | |
2607 | head = NULL; | |
2608 | } | |
2609 | ||
2610 | if (remote == o->df_conflict_entry) { | |
2611 | df_conflict_remote = 1; | |
2612 | remote = NULL; | |
2613 | } | |
2614 | ||
cee2d6ae JH |
2615 | /* |
2616 | * First, if there's a #16 situation, note that to prevent #13 | |
076b0adc JS |
2617 | * and #14. |
2618 | */ | |
2619 | if (!same(remote, head)) { | |
2620 | for (i = 1; i < o->head_idx; i++) { | |
2621 | if (same(stages[i], head)) { | |
2622 | head_match = i; | |
2623 | } | |
2624 | if (same(stages[i], remote)) { | |
2625 | remote_match = i; | |
2626 | } | |
2627 | } | |
2628 | } | |
2629 | ||
cee2d6ae JH |
2630 | /* |
2631 | * We start with cases where the index is allowed to match | |
076b0adc JS |
2632 | * something other than the head: #14(ALT) and #2ALT, where it |
2633 | * is permitted to match the result instead. | |
2634 | */ | |
2635 | /* #14, #14ALT, #2ALT */ | |
2636 | if (remote && !df_conflict_head && head_match && !remote_match) { | |
f27c170f VD |
2637 | if (index && !same(index, remote) && !same(index, head)) { |
2638 | if (S_ISSPARSEDIR(index->ce_mode)) | |
2639 | return merged_sparse_dir(stages, 4, o); | |
2640 | else | |
2641 | return reject_merge(index, o); | |
2642 | } | |
076b0adc JS |
2643 | return merged_entry(remote, index, o); |
2644 | } | |
2645 | /* | |
2646 | * If we have an entry in the index cache, then we want to | |
2647 | * make sure that it matches head. | |
2648 | */ | |
f27c170f VD |
2649 | if (index && !same(index, head)) { |
2650 | if (S_ISSPARSEDIR(index->ce_mode)) | |
2651 | return merged_sparse_dir(stages, 4, o); | |
2652 | else | |
2653 | return reject_merge(index, o); | |
2654 | } | |
076b0adc JS |
2655 | |
2656 | if (head) { | |
2657 | /* #5ALT, #15 */ | |
2658 | if (same(head, remote)) | |
2659 | return merged_entry(head, index, o); | |
2660 | /* #13, #3ALT */ | |
2661 | if (!df_conflict_remote && remote_match && !head_match) | |
2662 | return merged_entry(head, index, o); | |
2663 | } | |
2664 | ||
2665 | /* #1 */ | |
34110cd4 | 2666 | if (!head && !remote && any_anc_missing) |
076b0adc JS |
2667 | return 0; |
2668 | ||
cee2d6ae JH |
2669 | /* |
2670 | * Under the "aggressive" rule, we resolve mostly trivial | |
076b0adc JS |
2671 | * cases that we historically had git-merge-one-file resolve. |
2672 | */ | |
2673 | if (o->aggressive) { | |
cee2d6ae JH |
2674 | int head_deleted = !head; |
2675 | int remote_deleted = !remote; | |
eb9ae4b5 | 2676 | const struct cache_entry *ce = NULL; |
4c4caafc JH |
2677 | |
2678 | if (index) | |
0cf73755 | 2679 | ce = index; |
4c4caafc | 2680 | else if (head) |
0cf73755 | 2681 | ce = head; |
4c4caafc | 2682 | else if (remote) |
0cf73755 | 2683 | ce = remote; |
4c4caafc JH |
2684 | else { |
2685 | for (i = 1; i < o->head_idx; i++) { | |
2686 | if (stages[i] && stages[i] != o->df_conflict_entry) { | |
0cf73755 | 2687 | ce = stages[i]; |
4c4caafc JH |
2688 | break; |
2689 | } | |
2690 | } | |
2691 | } | |
2692 | ||
076b0adc JS |
2693 | /* |
2694 | * Deleted in both. | |
2695 | * Deleted in one and unchanged in the other. | |
2696 | */ | |
2697 | if ((head_deleted && remote_deleted) || | |
2698 | (head_deleted && remote && remote_match) || | |
2699 | (remote_deleted && head && head_match)) { | |
2700 | if (index) | |
2701 | return deleted_entry(index, index, o); | |
34110cd4 | 2702 | if (ce && !head_deleted) { |
08402b04 | 2703 | if (verify_absent(ce, ERROR_WOULD_LOSE_UNTRACKED_REMOVED, o)) |
203a2fe1 DB |
2704 | return -1; |
2705 | } | |
076b0adc JS |
2706 | return 0; |
2707 | } | |
2708 | /* | |
2709 | * Added in both, identically. | |
2710 | */ | |
2711 | if (no_anc_exists && head && remote && same(head, remote)) | |
2712 | return merged_entry(head, index, o); | |
2713 | ||
2714 | } | |
2715 | ||
f27c170f | 2716 | /* Handle "no merge" cases (see t/t1000-read-tree-m-3way.sh) */ |
076b0adc | 2717 | if (index) { |
f27c170f VD |
2718 | /* |
2719 | * If we've reached the "no merge" cases and we're merging | |
2720 | * a sparse directory, we may have an "edit/edit" conflict that | |
2721 | * can be resolved by individually merging directory contents. | |
2722 | */ | |
2723 | if (S_ISSPARSEDIR(index->ce_mode)) | |
2724 | return merged_sparse_dir(stages, 4, o); | |
2725 | ||
2726 | /* | |
2727 | * If we're not merging a sparse directory, ensure the index is | |
2728 | * up-to-date to avoid files getting overwritten with conflict | |
2729 | * resolution files | |
2730 | */ | |
203a2fe1 DB |
2731 | if (verify_uptodate(index, o)) |
2732 | return -1; | |
076b0adc | 2733 | } |
076b0adc JS |
2734 | |
2735 | o->nontrivial_merge = 1; | |
2736 | ||
ea4b52a8 | 2737 | /* #2, #3, #4, #6, #7, #9, #10, #11. */ |
076b0adc JS |
2738 | count = 0; |
2739 | if (!head_match || !remote_match) { | |
2740 | for (i = 1; i < o->head_idx; i++) { | |
4c4caafc | 2741 | if (stages[i] && stages[i] != o->df_conflict_entry) { |
7f7932ab | 2742 | keep_entry(stages[i], o); |
076b0adc JS |
2743 | count++; |
2744 | break; | |
2745 | } | |
2746 | } | |
2747 | } | |
2748 | #if DBRT_DEBUG | |
2749 | else { | |
2750 | fprintf(stderr, "read-tree: warning #16 detected\n"); | |
2751 | show_stage_entry(stderr, "head ", stages[head_match]); | |
2752 | show_stage_entry(stderr, "remote ", stages[remote_match]); | |
2753 | } | |
2754 | #endif | |
7f7932ab JH |
2755 | if (head) { count += keep_entry(head, o); } |
2756 | if (remote) { count += keep_entry(remote, o); } | |
076b0adc JS |
2757 | return count; |
2758 | } | |
2759 | ||
2760 | /* | |
2761 | * Two-way merge. | |
2762 | * | |
2763 | * The rule is to "carry forward" what is in the index without losing | |
a75d7b54 | 2764 | * information across a "fast-forward", favoring a successful merge |
076b0adc JS |
2765 | * over a merge failure when it makes sense. For details of the |
2766 | * "carry forward" rule, please see <Documentation/git-read-tree.txt>. | |
2767 | * | |
2768 | */ | |
5828e835 RS |
2769 | int twoway_merge(const struct cache_entry * const *src, |
2770 | struct unpack_trees_options *o) | |
076b0adc | 2771 | { |
eb9ae4b5 RS |
2772 | const struct cache_entry *current = src[0]; |
2773 | const struct cache_entry *oldtree = src[1]; | |
2774 | const struct cache_entry *newtree = src[2]; | |
076b0adc JS |
2775 | |
2776 | if (o->merge_size != 2) | |
2777 | return error("Cannot do a twoway merge of %d trees", | |
2778 | o->merge_size); | |
2779 | ||
b8ba1535 JH |
2780 | if (oldtree == o->df_conflict_entry) |
2781 | oldtree = NULL; | |
2782 | if (newtree == o->df_conflict_entry) | |
2783 | newtree = NULL; | |
2784 | ||
076b0adc | 2785 | if (current) { |
b018ff60 JK |
2786 | if (current->ce_flags & CE_CONFLICTED) { |
2787 | if (same(oldtree, newtree) || o->reset) { | |
2788 | if (!newtree) | |
2789 | return deleted_entry(current, current, o); | |
2790 | else | |
2791 | return merged_entry(newtree, current, o); | |
2792 | } | |
6a143aa2 | 2793 | return reject_merge(current, o); |
6c1db1b3 | 2794 | } else if ((!oldtree && !newtree) || /* 4 and 5 */ |
b018ff60 JK |
2795 | (!oldtree && newtree && |
2796 | same(current, newtree)) || /* 6 and 7 */ | |
2797 | (oldtree && newtree && | |
2798 | same(oldtree, newtree)) || /* 14 and 15 */ | |
2799 | (oldtree && newtree && | |
2800 | !same(oldtree, newtree) && /* 18 and 19 */ | |
2801 | same(current, newtree))) { | |
7f7932ab | 2802 | return keep_entry(current, o); |
6c1db1b3 | 2803 | } else if (oldtree && !newtree && same(current, oldtree)) { |
076b0adc JS |
2804 | /* 10 or 11 */ |
2805 | return deleted_entry(oldtree, current, o); | |
6c1db1b3 | 2806 | } else if (oldtree && newtree && |
076b0adc JS |
2807 | same(current, oldtree) && !same(current, newtree)) { |
2808 | /* 20 or 21 */ | |
2809 | return merged_entry(newtree, current, o); | |
e05cdb17 DS |
2810 | } else if (current && !oldtree && newtree && |
2811 | S_ISSPARSEDIR(current->ce_mode) != S_ISSPARSEDIR(newtree->ce_mode) && | |
2812 | ce_stage(current) == 0) { | |
2813 | /* | |
2814 | * This case is a directory/file conflict across the sparse-index | |
2815 | * boundary. When we are changing from one path to another via | |
2816 | * 'git checkout', then we want to replace one entry with another | |
2817 | * via merged_entry(). If there are staged changes, then we should | |
2818 | * reject the merge instead. | |
2819 | */ | |
2820 | return merged_entry(newtree, current, o); | |
ab81047a VD |
2821 | } else if (S_ISSPARSEDIR(current->ce_mode)) { |
2822 | /* | |
2823 | * The sparse directories differ, but we don't know whether that's | |
2824 | * because of two different files in the directory being modified | |
2825 | * (can be trivially merged) or if there is a real file conflict. | |
2826 | * Merge the sparse directory by OID to compare file-by-file. | |
2827 | */ | |
2828 | return merged_sparse_dir(src, 3, o); | |
6c1db1b3 | 2829 | } else |
6a143aa2 | 2830 | return reject_merge(current, o); |
076b0adc | 2831 | } |
55218834 JH |
2832 | else if (newtree) { |
2833 | if (oldtree && !o->initial_checkout) { | |
2834 | /* | |
2835 | * deletion of the path was staged; | |
2836 | */ | |
2837 | if (same(oldtree, newtree)) | |
2838 | return 1; | |
2839 | return reject_merge(oldtree, o); | |
2840 | } | |
076b0adc | 2841 | return merged_entry(newtree, current, o); |
55218834 | 2842 | } |
d699676d | 2843 | return deleted_entry(oldtree, current, o); |
076b0adc JS |
2844 | } |
2845 | ||
2846 | /* | |
2847 | * Bind merge. | |
2848 | * | |
2849 | * Keep the index entries at stage0, collapse stage1 but make sure | |
2850 | * stage0 does not have anything there. | |
2851 | */ | |
5828e835 RS |
2852 | int bind_merge(const struct cache_entry * const *src, |
2853 | struct unpack_trees_options *o) | |
076b0adc | 2854 | { |
eb9ae4b5 RS |
2855 | const struct cache_entry *old = src[0]; |
2856 | const struct cache_entry *a = src[1]; | |
076b0adc JS |
2857 | |
2858 | if (o->merge_size != 1) | |
82247e9b | 2859 | return error("Cannot do a bind merge of %d trees", |
076b0adc JS |
2860 | o->merge_size); |
2861 | if (a && old) | |
b165fac8 | 2862 | return o->quiet ? -1 : |
3d415425 SB |
2863 | error(ERRORMSG(o, ERROR_BIND_OVERLAP), |
2864 | super_prefixed(a->name), | |
2865 | super_prefixed(old->name)); | |
076b0adc | 2866 | if (!a) |
7f7932ab | 2867 | return keep_entry(old, o); |
076b0adc JS |
2868 | else |
2869 | return merged_entry(a, NULL, o); | |
2870 | } | |
2871 | ||
2872 | /* | |
2873 | * One-way merge. | |
2874 | * | |
2875 | * The rule is: | |
2876 | * - take the stat information from stage0, take the data from stage1 | |
2877 | */ | |
5828e835 RS |
2878 | int oneway_merge(const struct cache_entry * const *src, |
2879 | struct unpack_trees_options *o) | |
076b0adc | 2880 | { |
eb9ae4b5 RS |
2881 | const struct cache_entry *old = src[0]; |
2882 | const struct cache_entry *a = src[1]; | |
076b0adc JS |
2883 | |
2884 | if (o->merge_size != 1) | |
2885 | return error("Cannot do a oneway merge of %d trees", | |
2886 | o->merge_size); | |
2887 | ||
78d3b06e | 2888 | if (!a || a == o->df_conflict_entry) |
076b0adc | 2889 | return deleted_entry(old, old, o); |
34110cd4 | 2890 | |
076b0adc | 2891 | if (old && same(old, a)) { |
34110cd4 | 2892 | int update = 0; |
679f2f9f US |
2893 | if (o->reset && o->update && !ce_uptodate(old) && !ce_skip_worktree(old) && |
2894 | !(old->ce_flags & CE_FSMONITOR_VALID)) { | |
076b0adc JS |
2895 | struct stat st; |
2896 | if (lstat(old->name, &st) || | |
56cac48c | 2897 | ie_match_stat(o->src_index, old, &st, CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE)) |
34110cd4 | 2898 | update |= CE_UPDATE; |
076b0adc | 2899 | } |
ad17312e SB |
2900 | if (o->update && S_ISGITLINK(old->ce_mode) && |
2901 | should_update_submodules() && !verify_uptodate(old, o)) | |
2902 | update |= CE_UPDATE; | |
ab5af825 | 2903 | add_entry(o, old, update, CE_STAGEMASK); |
34110cd4 | 2904 | return 0; |
076b0adc JS |
2905 | } |
2906 | return merged_entry(a, old, o); | |
2907 | } | |
d3c7bf73 DL |
2908 | |
2909 | /* | |
2910 | * Merge worktree and untracked entries in a stash entry. | |
2911 | * | |
2912 | * Ignore all index entries. Collapse remaining trees but make sure that they | |
2913 | * don't have any conflicting files. | |
2914 | */ | |
2915 | int stash_worktree_untracked_merge(const struct cache_entry * const *src, | |
2916 | struct unpack_trees_options *o) | |
2917 | { | |
2918 | const struct cache_entry *worktree = src[1]; | |
2919 | const struct cache_entry *untracked = src[2]; | |
2920 | ||
2921 | if (o->merge_size != 2) | |
2922 | BUG("invalid merge_size: %d", o->merge_size); | |
2923 | ||
2924 | if (worktree && untracked) | |
2925 | return error(_("worktree and untracked commit have duplicate entries: %s"), | |
2926 | super_prefixed(worktree->name)); | |
2927 | ||
2928 | return merged_entry(worktree ? worktree : untracked, NULL, o); | |
2929 | } |