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