]>
Commit | Line | Data |
---|---|---|
1b0c7174 JH |
1 | #include "cache.h" |
2 | #include "tree-walk.h" | |
e6c111b4 | 3 | #include "unpack-trees.h" |
bc96cc87 | 4 | #include "dir.h" |
cbd53a21 | 5 | #include "object-store.h" |
8e440259 | 6 | #include "tree.h" |
64acde94 | 7 | #include "pathspec.h" |
1b0c7174 | 8 | |
4651ece8 LT |
9 | static const char *get_mode(const char *str, unsigned int *modep) |
10 | { | |
11 | unsigned char c; | |
12 | unsigned int mode = 0; | |
13 | ||
64cc1c09 MK |
14 | if (*str == ' ') |
15 | return NULL; | |
16 | ||
4651ece8 LT |
17 | while ((c = *str++) != ' ') { |
18 | if (c < '0' || c > '7') | |
19 | return NULL; | |
20 | mode = (mode << 3) + (c - '0'); | |
21 | } | |
22 | *modep = mode; | |
23 | return str; | |
24 | } | |
25 | ||
8354fa3d | 26 | static int decode_tree_entry(struct tree_desc *desc, const char *buf, unsigned long size, struct strbuf *err) |
4651ece8 LT |
27 | { |
28 | const char *path; | |
29 | unsigned int mode, len; | |
83e4b757 | 30 | const unsigned hashsz = the_hash_algo->rawsz; |
4651ece8 | 31 | |
83e4b757 | 32 | if (size < hashsz + 3 || buf[size - (hashsz + 1)]) { |
8354fa3d DT |
33 | strbuf_addstr(err, _("too-short tree object")); |
34 | return -1; | |
35 | } | |
64cc1c09 | 36 | |
4651ece8 | 37 | path = get_mode(buf, &mode); |
8354fa3d DT |
38 | if (!path) { |
39 | strbuf_addstr(err, _("malformed mode in tree entry")); | |
40 | return -1; | |
41 | } | |
42 | if (!*path) { | |
43 | strbuf_addstr(err, _("empty filename in tree entry")); | |
44 | return -1; | |
45 | } | |
4651ece8 LT |
46 | len = strlen(path) + 1; |
47 | ||
48 | /* Initialize the descriptor entry */ | |
49 | desc->entry.path = path; | |
7146e66f | 50 | desc->entry.mode = canon_mode(mode); |
ea82b2a0 | 51 | desc->entry.pathlen = len - 1; |
52 | hashcpy(desc->entry.oid.hash, (const unsigned char *)path + len); | |
8354fa3d DT |
53 | |
54 | return 0; | |
4651ece8 LT |
55 | } |
56 | ||
8354fa3d | 57 | static int init_tree_desc_internal(struct tree_desc *desc, const void *buffer, unsigned long size, struct strbuf *err) |
6fda5e51 LT |
58 | { |
59 | desc->buffer = buffer; | |
60 | desc->size = size; | |
4651ece8 | 61 | if (size) |
8354fa3d DT |
62 | return decode_tree_entry(desc, buffer, size, err); |
63 | return 0; | |
64 | } | |
65 | ||
66 | void init_tree_desc(struct tree_desc *desc, const void *buffer, unsigned long size) | |
67 | { | |
68 | struct strbuf err = STRBUF_INIT; | |
69 | if (init_tree_desc_internal(desc, buffer, size, &err)) | |
70 | die("%s", err.buf); | |
71 | strbuf_release(&err); | |
72 | } | |
73 | ||
74 | int init_tree_desc_gently(struct tree_desc *desc, const void *buffer, unsigned long size) | |
75 | { | |
76 | struct strbuf err = STRBUF_INIT; | |
77 | int result = init_tree_desc_internal(desc, buffer, size, &err); | |
78 | if (result) | |
79 | error("%s", err.buf); | |
80 | strbuf_release(&err); | |
81 | return result; | |
6fda5e51 LT |
82 | } |
83 | ||
5e575807 NTND |
84 | void *fill_tree_descriptor(struct repository *r, |
85 | struct tree_desc *desc, | |
86 | const struct object_id *oid) | |
1b0c7174 JH |
87 | { |
88 | unsigned long size = 0; | |
89 | void *buf = NULL; | |
90 | ||
5c377d3d | 91 | if (oid) { |
5e575807 | 92 | buf = read_object_with_reference(r, oid, tree_type, &size, NULL); |
1b0c7174 | 93 | if (!buf) |
5c377d3d | 94 | die("unable to read tree %s", oid_to_hex(oid)); |
1b0c7174 | 95 | } |
6fda5e51 | 96 | init_tree_desc(desc, buf, size); |
1b0c7174 JH |
97 | return buf; |
98 | } | |
99 | ||
1b0c7174 JH |
100 | static void entry_clear(struct name_entry *a) |
101 | { | |
102 | memset(a, 0, sizeof(*a)); | |
103 | } | |
104 | ||
105 | static void entry_extract(struct tree_desc *t, struct name_entry *a) | |
106 | { | |
4651ece8 | 107 | *a = t->entry; |
1b0c7174 JH |
108 | } |
109 | ||
8354fa3d | 110 | static int update_tree_entry_internal(struct tree_desc *desc, struct strbuf *err) |
1b0c7174 | 111 | { |
6fda5e51 | 112 | const void *buf = desc->buffer; |
ea82b2a0 | 113 | const unsigned char *end = (const unsigned char *)desc->entry.path + desc->entry.pathlen + 1 + the_hash_algo->rawsz; |
1b0c7174 | 114 | unsigned long size = desc->size; |
4651ece8 | 115 | unsigned long len = end - (const unsigned char *)buf; |
1b0c7174 JH |
116 | |
117 | if (size < len) | |
2edffef2 | 118 | die(_("too-short tree file")); |
4651ece8 LT |
119 | buf = end; |
120 | size -= len; | |
121 | desc->buffer = buf; | |
122 | desc->size = size; | |
123 | if (size) | |
8354fa3d DT |
124 | return decode_tree_entry(desc, buf, size, err); |
125 | return 0; | |
126 | } | |
127 | ||
128 | void update_tree_entry(struct tree_desc *desc) | |
129 | { | |
130 | struct strbuf err = STRBUF_INIT; | |
131 | if (update_tree_entry_internal(desc, &err)) | |
132 | die("%s", err.buf); | |
133 | strbuf_release(&err); | |
134 | } | |
135 | ||
136 | int update_tree_entry_gently(struct tree_desc *desc) | |
137 | { | |
138 | struct strbuf err = STRBUF_INIT; | |
139 | if (update_tree_entry_internal(desc, &err)) { | |
140 | error("%s", err.buf); | |
141 | strbuf_release(&err); | |
142 | /* Stop processing this tree after error */ | |
143 | desc->size = 0; | |
144 | return -1; | |
145 | } | |
146 | strbuf_release(&err); | |
147 | return 0; | |
1b0c7174 JH |
148 | } |
149 | ||
4c068a98 LT |
150 | int tree_entry(struct tree_desc *desc, struct name_entry *entry) |
151 | { | |
4651ece8 | 152 | if (!desc->size) |
4c068a98 LT |
153 | return 0; |
154 | ||
4651ece8 LT |
155 | *entry = desc->entry; |
156 | update_tree_entry(desc); | |
4c068a98 LT |
157 | return 1; |
158 | } | |
159 | ||
8354fa3d DT |
160 | int tree_entry_gently(struct tree_desc *desc, struct name_entry *entry) |
161 | { | |
162 | if (!desc->size) | |
163 | return 0; | |
164 | ||
165 | *entry = desc->entry; | |
166 | if (update_tree_entry_gently(desc)) | |
167 | return 0; | |
168 | return 1; | |
169 | } | |
170 | ||
40d934df LT |
171 | void setup_traverse_info(struct traverse_info *info, const char *base) |
172 | { | |
173 | int pathlen = strlen(base); | |
bcbe5a51 | 174 | static struct traverse_info dummy; |
40d934df LT |
175 | |
176 | memset(info, 0, sizeof(*info)); | |
177 | if (pathlen && base[pathlen-1] == '/') | |
178 | pathlen--; | |
179 | info->pathlen = pathlen ? pathlen + 1 : 0; | |
180 | info->name.path = base; | |
ea82b2a0 | 181 | info->name.pathlen = pathlen; |
182 | if (pathlen) { | |
183 | hashcpy(info->name.oid.hash, (const unsigned char *)base + pathlen + 1); | |
bcbe5a51 | 184 | info->prev = &dummy; |
ea82b2a0 | 185 | } |
40d934df LT |
186 | } |
187 | ||
188 | char *make_traverse_path(char *path, const struct traverse_info *info, const struct name_entry *n) | |
189 | { | |
0de16337 | 190 | int len = tree_entry_len(n); |
40d934df LT |
191 | int pathlen = info->pathlen; |
192 | ||
193 | path[pathlen + len] = 0; | |
194 | for (;;) { | |
195 | memcpy(path + pathlen, n->path, len); | |
196 | if (!pathlen) | |
197 | break; | |
198 | path[--pathlen] = '/'; | |
199 | n = &info->name; | |
0de16337 | 200 | len = tree_entry_len(n); |
40d934df LT |
201 | info = info->prev; |
202 | pathlen -= len; | |
203 | } | |
204 | return path; | |
205 | } | |
206 | ||
1ee26571 JH |
207 | struct tree_desc_skip { |
208 | struct tree_desc_skip *prev; | |
209 | const void *ptr; | |
210 | }; | |
211 | ||
212 | struct tree_desc_x { | |
213 | struct tree_desc d; | |
214 | struct tree_desc_skip *skip; | |
215 | }; | |
216 | ||
1ee26571 JH |
217 | static int check_entry_match(const char *a, int a_len, const char *b, int b_len) |
218 | { | |
219 | /* | |
220 | * The caller wants to pick *a* from a tree or nothing. | |
221 | * We are looking at *b* in a tree. | |
222 | * | |
223 | * (0) If a and b are the same name, we are trivially happy. | |
224 | * | |
225 | * There are three possibilities where *a* could be hiding | |
226 | * behind *b*. | |
227 | * | |
228 | * (1) *a* == "t", *b* == "ab" i.e. *b* sorts earlier than *a* no | |
229 | * matter what. | |
230 | * (2) *a* == "t", *b* == "t-2" and "t" is a subtree in the tree; | |
231 | * (3) *a* == "t-2", *b* == "t" and "t-2" is a blob in the tree. | |
232 | * | |
233 | * Otherwise we know *a* won't appear in the tree without | |
234 | * scanning further. | |
235 | */ | |
236 | ||
237 | int cmp = name_compare(a, a_len, b, b_len); | |
238 | ||
239 | /* Most common case first -- reading sync'd trees */ | |
240 | if (!cmp) | |
241 | return cmp; | |
242 | ||
243 | if (0 < cmp) { | |
244 | /* a comes after b; it does not matter if it is case (3) | |
245 | if (b_len < a_len && !memcmp(a, b, b_len) && a[b_len] < '/') | |
246 | return 1; | |
247 | */ | |
248 | return 1; /* keep looking */ | |
249 | } | |
250 | ||
251 | /* b comes after a; are we looking at case (2)? */ | |
252 | if (a_len < b_len && !memcmp(a, b, a_len) && b[a_len] < '/') | |
253 | return 1; /* keep looking */ | |
254 | ||
255 | return -1; /* a cannot appear in the tree */ | |
256 | } | |
257 | ||
258 | /* | |
259 | * From the extended tree_desc, extract the first name entry, while | |
260 | * paying attention to the candidate "first" name. Most importantly, | |
261 | * when looking for an entry, if there are entries that sorts earlier | |
262 | * in the tree object representation than that name, skip them and | |
263 | * process the named entry first. We will remember that we haven't | |
264 | * processed the first entry yet, and in the later call skip the | |
265 | * entry we processed early when update_extended_entry() is called. | |
266 | * | |
267 | * E.g. if the underlying tree object has these entries: | |
268 | * | |
269 | * blob "t-1" | |
270 | * blob "t-2" | |
271 | * tree "t" | |
272 | * blob "t=1" | |
273 | * | |
274 | * and the "first" asks for "t", remember that we still need to | |
275 | * process "t-1" and "t-2" but extract "t". After processing the | |
276 | * entry "t" from this call, the caller will let us know by calling | |
277 | * update_extended_entry() that we can remember "t" has been processed | |
278 | * already. | |
279 | */ | |
280 | ||
281 | static void extended_entry_extract(struct tree_desc_x *t, | |
282 | struct name_entry *a, | |
283 | const char *first, | |
284 | int first_len) | |
285 | { | |
286 | const char *path; | |
287 | int len; | |
288 | struct tree_desc probe; | |
289 | struct tree_desc_skip *skip; | |
290 | ||
291 | /* | |
292 | * Extract the first entry from the tree_desc, but skip the | |
293 | * ones that we already returned in earlier rounds. | |
294 | */ | |
295 | while (1) { | |
296 | if (!t->d.size) { | |
297 | entry_clear(a); | |
298 | break; /* not found */ | |
299 | } | |
300 | entry_extract(&t->d, a); | |
301 | for (skip = t->skip; skip; skip = skip->prev) | |
302 | if (a->path == skip->ptr) | |
303 | break; /* found */ | |
304 | if (!skip) | |
305 | break; | |
306 | /* We have processed this entry already. */ | |
307 | update_tree_entry(&t->d); | |
308 | } | |
309 | ||
310 | if (!first || !a->path) | |
311 | return; | |
312 | ||
313 | /* | |
314 | * The caller wants "first" from this tree, or nothing. | |
315 | */ | |
316 | path = a->path; | |
0de16337 | 317 | len = tree_entry_len(a); |
1ee26571 JH |
318 | switch (check_entry_match(first, first_len, path, len)) { |
319 | case -1: | |
320 | entry_clear(a); | |
321 | case 0: | |
322 | return; | |
323 | default: | |
324 | break; | |
325 | } | |
326 | ||
327 | /* | |
328 | * We need to look-ahead -- we suspect that a subtree whose | |
329 | * name is "first" may be hiding behind the current entry "path". | |
330 | */ | |
331 | probe = t->d; | |
332 | while (probe.size) { | |
333 | entry_extract(&probe, a); | |
334 | path = a->path; | |
0de16337 | 335 | len = tree_entry_len(a); |
1ee26571 JH |
336 | switch (check_entry_match(first, first_len, path, len)) { |
337 | case -1: | |
338 | entry_clear(a); | |
339 | case 0: | |
340 | return; | |
341 | default: | |
342 | update_tree_entry(&probe); | |
343 | break; | |
344 | } | |
345 | /* keep looking */ | |
346 | } | |
347 | entry_clear(a); | |
348 | } | |
349 | ||
350 | static void update_extended_entry(struct tree_desc_x *t, struct name_entry *a) | |
351 | { | |
352 | if (t->d.entry.path == a->path) { | |
353 | update_tree_entry(&t->d); | |
354 | } else { | |
355 | /* we have returned this entry early */ | |
356 | struct tree_desc_skip *skip = xmalloc(sizeof(*skip)); | |
357 | skip->ptr = a->path; | |
358 | skip->prev = t->skip; | |
359 | t->skip = skip; | |
360 | } | |
361 | } | |
362 | ||
363 | static void free_extended_entry(struct tree_desc_x *t) | |
364 | { | |
365 | struct tree_desc_skip *p, *s; | |
366 | ||
367 | for (s = t->skip; s; s = p) { | |
368 | p = s->prev; | |
369 | free(s); | |
370 | } | |
371 | } | |
372 | ||
67022e02 NTND |
373 | static inline int prune_traversal(struct index_state *istate, |
374 | struct name_entry *e, | |
2842c0f9 JH |
375 | struct traverse_info *info, |
376 | struct strbuf *base, | |
377 | int still_interesting) | |
378 | { | |
379 | if (!info->pathspec || still_interesting == 2) | |
380 | return 2; | |
381 | if (still_interesting < 0) | |
382 | return still_interesting; | |
67022e02 NTND |
383 | return tree_entry_interesting(istate, e, base, |
384 | 0, info->pathspec); | |
2842c0f9 JH |
385 | } |
386 | ||
67022e02 NTND |
387 | int traverse_trees(struct index_state *istate, |
388 | int n, struct tree_desc *t, | |
389 | struct traverse_info *info) | |
1b0c7174 | 390 | { |
e6c111b4 | 391 | int error = 0; |
1b0c7174 | 392 | struct name_entry *entry = xmalloc(n*sizeof(*entry)); |
1ee26571 JH |
393 | int i; |
394 | struct tree_desc_x *tx = xcalloc(n, sizeof(*tx)); | |
2842c0f9 JH |
395 | struct strbuf base = STRBUF_INIT; |
396 | int interesting = 1; | |
d9c2bd56 | 397 | char *traverse_path; |
1ee26571 JH |
398 | |
399 | for (i = 0; i < n; i++) | |
400 | tx[i].d = t[i]; | |
1b0c7174 | 401 | |
2842c0f9 JH |
402 | if (info->prev) { |
403 | strbuf_grow(&base, info->pathlen); | |
404 | make_traverse_path(base.buf, info->prev, &info->name); | |
405 | base.buf[info->pathlen-1] = '/'; | |
406 | strbuf_setlen(&base, info->pathlen); | |
d9c2bd56 DT |
407 | traverse_path = xstrndup(base.buf, info->pathlen); |
408 | } else { | |
409 | traverse_path = xstrndup(info->name.path, info->pathlen); | |
2842c0f9 | 410 | } |
d9c2bd56 | 411 | info->traverse_path = traverse_path; |
1b0c7174 | 412 | for (;;) { |
a04f8196 | 413 | int trees_used; |
1ee26571 JH |
414 | unsigned long mask, dirmask; |
415 | const char *first = NULL; | |
416 | int first_len = 0; | |
27c0f768 | 417 | struct name_entry *e = NULL; |
1ee26571 JH |
418 | int len; |
419 | ||
420 | for (i = 0; i < n; i++) { | |
421 | e = entry + i; | |
422 | extended_entry_extract(tx + i, e, NULL, 0); | |
423 | } | |
1b0c7174 | 424 | |
1ee26571 JH |
425 | /* |
426 | * A tree may have "t-2" at the current location even | |
427 | * though it may have "t" that is a subtree behind it, | |
428 | * and another tree may return "t". We want to grab | |
429 | * all "t" from all trees to match in such a case. | |
430 | */ | |
1b0c7174 | 431 | for (i = 0; i < n; i++) { |
1ee26571 JH |
432 | e = entry + i; |
433 | if (!e->path) | |
1b0c7174 | 434 | continue; |
0de16337 | 435 | len = tree_entry_len(e); |
1ee26571 JH |
436 | if (!first) { |
437 | first = e->path; | |
438 | first_len = len; | |
439 | continue; | |
440 | } | |
441 | if (name_compare(e->path, len, first, first_len) < 0) { | |
442 | first = e->path; | |
443 | first_len = len; | |
444 | } | |
445 | } | |
446 | ||
447 | if (first) { | |
448 | for (i = 0; i < n; i++) { | |
449 | e = entry + i; | |
450 | extended_entry_extract(tx + i, e, first, first_len); | |
451 | /* Cull the ones that are not the earliest */ | |
452 | if (!e->path) | |
1b0c7174 | 453 | continue; |
0de16337 | 454 | len = tree_entry_len(e); |
1ee26571 JH |
455 | if (name_compare(e->path, len, first, first_len)) |
456 | entry_clear(e); | |
1b0c7174 | 457 | } |
1ee26571 JH |
458 | } |
459 | ||
460 | /* Now we have in entry[i] the earliest name from the trees */ | |
461 | mask = 0; | |
462 | dirmask = 0; | |
463 | for (i = 0; i < n; i++) { | |
464 | if (!entry[i].path) | |
465 | continue; | |
1b0c7174 | 466 | mask |= 1ul << i; |
91e4f036 LT |
467 | if (S_ISDIR(entry[i].mode)) |
468 | dirmask |= 1ul << i; | |
2842c0f9 | 469 | e = &entry[i]; |
1b0c7174 JH |
470 | } |
471 | if (!mask) | |
472 | break; | |
67022e02 | 473 | interesting = prune_traversal(istate, e, info, &base, interesting); |
2842c0f9 JH |
474 | if (interesting < 0) |
475 | break; | |
476 | if (interesting) { | |
a04f8196 SB |
477 | trees_used = info->fn(n, mask, dirmask, entry, info); |
478 | if (trees_used < 0) { | |
479 | error = trees_used; | |
2842c0f9 JH |
480 | if (!info->show_all_errors) |
481 | break; | |
482 | } | |
a04f8196 | 483 | mask &= trees_used; |
e6c111b4 | 484 | } |
1ee26571 | 485 | for (i = 0; i < n; i++) |
5803c6f8 | 486 | if (mask & (1ul << i)) |
1ee26571 | 487 | update_extended_entry(tx + i, entry + i); |
1b0c7174 JH |
488 | } |
489 | free(entry); | |
1ee26571 JH |
490 | for (i = 0; i < n; i++) |
491 | free_extended_entry(tx + i); | |
492 | free(tx); | |
d9c2bd56 DT |
493 | free(traverse_path); |
494 | info->traverse_path = NULL; | |
2842c0f9 | 495 | strbuf_release(&base); |
e6c111b4 | 496 | return error; |
1b0c7174 JH |
497 | } |
498 | ||
275721c2 DT |
499 | struct dir_state { |
500 | void *tree; | |
501 | unsigned long size; | |
3b683bcf | 502 | struct object_id oid; |
275721c2 DT |
503 | }; |
504 | ||
5ec1e728 | 505 | static int find_tree_entry(struct tree_desc *t, const char *name, struct object_id *result, unsigned short *mode) |
4dcff634 JH |
506 | { |
507 | int namelen = strlen(name); | |
508 | while (t->size) { | |
509 | const char *entry; | |
0a3faa45 | 510 | struct object_id oid; |
4dcff634 JH |
511 | int entrylen, cmp; |
512 | ||
0a3faa45 | 513 | oidcpy(&oid, tree_entry_extract(t, &entry, mode)); |
0de16337 | 514 | entrylen = tree_entry_len(&t->entry); |
4dcff634 | 515 | update_tree_entry(t); |
4dcff634 JH |
516 | if (entrylen > namelen) |
517 | continue; | |
518 | cmp = memcmp(name, entry, entrylen); | |
519 | if (cmp > 0) | |
520 | continue; | |
521 | if (cmp < 0) | |
522 | break; | |
523 | if (entrylen == namelen) { | |
0a3faa45 | 524 | oidcpy(result, &oid); |
4dcff634 JH |
525 | return 0; |
526 | } | |
527 | if (name[entrylen] != '/') | |
528 | continue; | |
529 | if (!S_ISDIR(*mode)) | |
530 | break; | |
531 | if (++entrylen == namelen) { | |
0a3faa45 | 532 | oidcpy(result, &oid); |
4dcff634 JH |
533 | return 0; |
534 | } | |
0a3faa45 | 535 | return get_tree_entry(&oid, name + entrylen, result, mode); |
4dcff634 JH |
536 | } |
537 | return -1; | |
538 | } | |
539 | ||
5ec1e728 | 540 | int get_tree_entry(const struct object_id *tree_oid, const char *name, struct object_id *oid, unsigned short *mode) |
4dcff634 JH |
541 | { |
542 | int retval; | |
543 | void *tree; | |
6fda5e51 | 544 | unsigned long size; |
916bc35b | 545 | struct object_id root; |
4dcff634 | 546 | |
d3b4705a | 547 | tree = read_object_with_reference(the_repository, tree_oid, tree_type, &size, &root); |
4dcff634 JH |
548 | if (!tree) |
549 | return -1; | |
d93b7d1c JK |
550 | |
551 | if (name[0] == '\0') { | |
916bc35b | 552 | oidcpy(oid, &root); |
ef006503 | 553 | free(tree); |
d93b7d1c JK |
554 | return 0; |
555 | } | |
556 | ||
5fb8c05f JH |
557 | if (!size) { |
558 | retval = -1; | |
559 | } else { | |
560 | struct tree_desc t; | |
561 | init_tree_desc(&t, tree, size); | |
916bc35b | 562 | retval = find_tree_entry(&t, name, oid, mode); |
5fb8c05f | 563 | } |
4dcff634 JH |
564 | free(tree); |
565 | return retval; | |
566 | } | |
2c389fc8 | 567 | |
275721c2 DT |
568 | /* |
569 | * This is Linux's built-in max for the number of symlinks to follow. | |
570 | * That limit, of course, does not affect git, but it's a reasonable | |
571 | * choice. | |
572 | */ | |
573 | #define GET_TREE_ENTRY_FOLLOW_SYMLINKS_MAX_LINKS 40 | |
574 | ||
575 | /** | |
576 | * Find a tree entry by following symlinks in tree_sha (which is | |
577 | * assumed to be the root of the repository). In the event that a | |
578 | * symlink points outside the repository (e.g. a link to /foo or a | |
579 | * root-level link to ../foo), the portion of the link which is | |
580 | * outside the repository will be returned in result_path, and *mode | |
581 | * will be set to 0. It is assumed that result_path is uninitialized. | |
582 | * If there are no symlinks, or the end result of the symlink chain | |
583 | * points to an object inside the repository, result will be filled in | |
584 | * with the sha1 of the found object, and *mode will hold the mode of | |
585 | * the object. | |
586 | * | |
d1dd94b3 | 587 | * See the code for enum get_oid_result for a description of |
275721c2 DT |
588 | * the return values. |
589 | */ | |
5ec1e728 | 590 | enum get_oid_result get_tree_entry_follow_symlinks(struct object_id *tree_oid, const char *name, struct object_id *result, struct strbuf *result_path, unsigned short *mode) |
275721c2 DT |
591 | { |
592 | int retval = MISSING_OBJECT; | |
593 | struct dir_state *parents = NULL; | |
594 | size_t parents_alloc = 0; | |
071bcaab | 595 | size_t i, parents_nr = 0; |
0d4a8b5b | 596 | struct object_id current_tree_oid; |
275721c2 DT |
597 | struct strbuf namebuf = STRBUF_INIT; |
598 | struct tree_desc t; | |
599 | int follows_remaining = GET_TREE_ENTRY_FOLLOW_SYMLINKS_MAX_LINKS; | |
275721c2 DT |
600 | |
601 | init_tree_desc(&t, NULL, 0UL); | |
275721c2 | 602 | strbuf_addstr(&namebuf, name); |
3b683bcf | 603 | oidcpy(¤t_tree_oid, tree_oid); |
275721c2 DT |
604 | |
605 | while (1) { | |
606 | int find_result; | |
607 | char *first_slash; | |
608 | char *remainder = NULL; | |
609 | ||
610 | if (!t.buffer) { | |
611 | void *tree; | |
0d4a8b5b | 612 | struct object_id root; |
275721c2 | 613 | unsigned long size; |
d3b4705a NTND |
614 | tree = read_object_with_reference(the_repository, |
615 | ¤t_tree_oid, | |
275721c2 | 616 | tree_type, &size, |
02f0547e | 617 | &root); |
275721c2 DT |
618 | if (!tree) |
619 | goto done; | |
620 | ||
621 | ALLOC_GROW(parents, parents_nr + 1, parents_alloc); | |
622 | parents[parents_nr].tree = tree; | |
623 | parents[parents_nr].size = size; | |
3b683bcf | 624 | oidcpy(&parents[parents_nr].oid, &root); |
275721c2 DT |
625 | parents_nr++; |
626 | ||
627 | if (namebuf.buf[0] == '\0') { | |
3b683bcf | 628 | oidcpy(result, &root); |
275721c2 DT |
629 | retval = FOUND; |
630 | goto done; | |
631 | } | |
632 | ||
633 | if (!size) | |
634 | goto done; | |
635 | ||
636 | /* descend */ | |
637 | init_tree_desc(&t, tree, size); | |
638 | } | |
639 | ||
640 | /* Handle symlinks to e.g. a//b by removing leading slashes */ | |
641 | while (namebuf.buf[0] == '/') { | |
642 | strbuf_remove(&namebuf, 0, 1); | |
643 | } | |
644 | ||
645 | /* Split namebuf into a first component and a remainder */ | |
646 | if ((first_slash = strchr(namebuf.buf, '/'))) { | |
647 | *first_slash = 0; | |
648 | remainder = first_slash + 1; | |
649 | } | |
650 | ||
651 | if (!strcmp(namebuf.buf, "..")) { | |
652 | struct dir_state *parent; | |
653 | /* | |
654 | * We could end up with .. in the namebuf if it | |
655 | * appears in a symlink. | |
656 | */ | |
657 | ||
658 | if (parents_nr == 1) { | |
659 | if (remainder) | |
660 | *first_slash = '/'; | |
661 | strbuf_add(result_path, namebuf.buf, | |
662 | namebuf.len); | |
663 | *mode = 0; | |
664 | retval = FOUND; | |
665 | goto done; | |
666 | } | |
667 | parent = &parents[parents_nr - 1]; | |
668 | free(parent->tree); | |
669 | parents_nr--; | |
670 | parent = &parents[parents_nr - 1]; | |
671 | init_tree_desc(&t, parent->tree, parent->size); | |
672 | strbuf_remove(&namebuf, 0, remainder ? 3 : 2); | |
673 | continue; | |
674 | } | |
675 | ||
676 | /* We could end up here via a symlink to dir/.. */ | |
677 | if (namebuf.buf[0] == '\0') { | |
3b683bcf | 678 | oidcpy(result, &parents[parents_nr - 1].oid); |
275721c2 DT |
679 | retval = FOUND; |
680 | goto done; | |
681 | } | |
682 | ||
683 | /* Look up the first (or only) path component in the tree. */ | |
684 | find_result = find_tree_entry(&t, namebuf.buf, | |
916bc35b | 685 | ¤t_tree_oid, mode); |
275721c2 DT |
686 | if (find_result) { |
687 | goto done; | |
688 | } | |
689 | ||
690 | if (S_ISDIR(*mode)) { | |
691 | if (!remainder) { | |
3b683bcf | 692 | oidcpy(result, ¤t_tree_oid); |
275721c2 DT |
693 | retval = FOUND; |
694 | goto done; | |
695 | } | |
696 | /* Descend the tree */ | |
697 | t.buffer = NULL; | |
698 | strbuf_remove(&namebuf, 0, | |
699 | 1 + first_slash - namebuf.buf); | |
700 | } else if (S_ISREG(*mode)) { | |
701 | if (!remainder) { | |
3b683bcf | 702 | oidcpy(result, ¤t_tree_oid); |
275721c2 DT |
703 | retval = FOUND; |
704 | } else { | |
705 | retval = NOT_DIR; | |
706 | } | |
707 | goto done; | |
708 | } else if (S_ISLNK(*mode)) { | |
709 | /* Follow a symlink */ | |
710 | unsigned long link_len; | |
711 | size_t len; | |
712 | char *contents, *contents_start; | |
713 | struct dir_state *parent; | |
714 | enum object_type type; | |
715 | ||
716 | if (follows_remaining-- == 0) { | |
717 | /* Too many symlinks followed */ | |
718 | retval = SYMLINK_LOOP; | |
719 | goto done; | |
720 | } | |
721 | ||
722 | /* | |
723 | * At this point, we have followed at a least | |
724 | * one symlink, so on error we need to report this. | |
725 | */ | |
726 | retval = DANGLING_SYMLINK; | |
727 | ||
b4f5aca4 | 728 | contents = read_object_file(¤t_tree_oid, &type, |
729 | &link_len); | |
275721c2 DT |
730 | |
731 | if (!contents) | |
732 | goto done; | |
733 | ||
734 | if (contents[0] == '/') { | |
735 | strbuf_addstr(result_path, contents); | |
736 | free(contents); | |
737 | *mode = 0; | |
738 | retval = FOUND; | |
739 | goto done; | |
740 | } | |
741 | ||
742 | if (remainder) | |
743 | len = first_slash - namebuf.buf; | |
744 | else | |
745 | len = namebuf.len; | |
746 | ||
747 | contents_start = contents; | |
748 | ||
749 | parent = &parents[parents_nr - 1]; | |
750 | init_tree_desc(&t, parent->tree, parent->size); | |
751 | strbuf_splice(&namebuf, 0, len, | |
752 | contents_start, link_len); | |
753 | if (remainder) | |
754 | namebuf.buf[link_len] = '/'; | |
755 | free(contents); | |
756 | } | |
757 | } | |
758 | done: | |
759 | for (i = 0; i < parents_nr; i++) | |
760 | free(parents[i].tree); | |
761 | free(parents); | |
762 | ||
763 | strbuf_release(&namebuf); | |
764 | return retval; | |
765 | } | |
766 | ||
93d93537 NTND |
767 | static int match_entry(const struct pathspec_item *item, |
768 | const struct name_entry *entry, int pathlen, | |
58c4d666 | 769 | const char *match, int matchlen, |
c3a47ca9 | 770 | enum interesting *never_interesting) |
58c4d666 NTND |
771 | { |
772 | int m = -1; /* signals that we haven't called strncmp() */ | |
773 | ||
93d93537 NTND |
774 | if (item->magic & PATHSPEC_ICASE) |
775 | /* | |
776 | * "Never interesting" trick requires exact | |
777 | * matching. We could do something clever with inexact | |
778 | * matching, but it's trickier (and not to forget that | |
779 | * strcasecmp is locale-dependent, at least in | |
780 | * glibc). Just disable it for now. It can't be worse | |
781 | * than the wildcard's codepath of '[Tt][Hi][Is][Ss]' | |
782 | * pattern. | |
783 | */ | |
784 | *never_interesting = entry_not_interesting; | |
785 | else if (*never_interesting != entry_not_interesting) { | |
58c4d666 NTND |
786 | /* |
787 | * We have not seen any match that sorts later | |
788 | * than the current path. | |
789 | */ | |
790 | ||
791 | /* | |
792 | * Does match sort strictly earlier than path | |
793 | * with their common parts? | |
794 | */ | |
795 | m = strncmp(match, entry->path, | |
796 | (matchlen < pathlen) ? matchlen : pathlen); | |
797 | if (m < 0) | |
798 | return 0; | |
799 | ||
800 | /* | |
801 | * If we come here even once, that means there is at | |
802 | * least one pathspec that would sort equal to or | |
803 | * later than the path we are currently looking at. | |
804 | * In other words, if we have never reached this point | |
805 | * after iterating all pathspecs, it means all | |
806 | * pathspecs are either outside of base, or inside the | |
807 | * base but sorts strictly earlier than the current | |
808 | * one. In either case, they will never match the | |
809 | * subsequent entries. In such a case, we initialized | |
810 | * the variable to -1 and that is what will be | |
811 | * returned, allowing the caller to terminate early. | |
812 | */ | |
c3a47ca9 | 813 | *never_interesting = entry_not_interesting; |
58c4d666 NTND |
814 | } |
815 | ||
816 | if (pathlen > matchlen) | |
817 | return 0; | |
818 | ||
819 | if (matchlen > pathlen) { | |
820 | if (match[pathlen] != '/') | |
821 | return 0; | |
74b4f7f2 | 822 | if (!S_ISDIR(entry->mode) && !S_ISGITLINK(entry->mode)) |
58c4d666 NTND |
823 | return 0; |
824 | } | |
825 | ||
826 | if (m == -1) | |
827 | /* | |
828 | * we cheated and did not do strncmp(), so we do | |
829 | * that here. | |
830 | */ | |
93d93537 | 831 | m = ps_strncmp(item, match, entry->path, pathlen); |
58c4d666 NTND |
832 | |
833 | /* | |
834 | * If common part matched earlier then it is a hit, | |
835 | * because we rejected the case where path is not a | |
836 | * leading directory and is shorter than match. | |
837 | */ | |
838 | if (!m) | |
93d93537 NTND |
839 | /* |
840 | * match_entry does not check if the prefix part is | |
841 | * matched case-sensitively. If the entry is a | |
842 | * directory and part of prefix, it'll be rematched | |
843 | * eventually by basecmp with special treatment for | |
844 | * the prefix. | |
845 | */ | |
58c4d666 NTND |
846 | return 1; |
847 | ||
848 | return 0; | |
849 | } | |
850 | ||
93d93537 NTND |
851 | /* :(icase)-aware string compare */ |
852 | static int basecmp(const struct pathspec_item *item, | |
853 | const char *base, const char *match, int len) | |
854 | { | |
855 | if (item->magic & PATHSPEC_ICASE) { | |
856 | int ret, n = len > item->prefix ? item->prefix : len; | |
857 | ret = strncmp(base, match, n); | |
858 | if (ret) | |
859 | return ret; | |
860 | base += n; | |
861 | match += n; | |
862 | len -= n; | |
863 | } | |
864 | return ps_strncmp(item, base, match, len); | |
865 | } | |
866 | ||
867 | static int match_dir_prefix(const struct pathspec_item *item, | |
868 | const char *base, | |
58c4d666 NTND |
869 | const char *match, int matchlen) |
870 | { | |
93d93537 | 871 | if (basecmp(item, base, match, matchlen)) |
58c4d666 NTND |
872 | return 0; |
873 | ||
874 | /* | |
875 | * If the base is a subdirectory of a path which | |
876 | * was specified, all of them are interesting. | |
877 | */ | |
878 | if (!matchlen || | |
879 | base[matchlen] == '/' || | |
880 | match[matchlen - 1] == '/') | |
881 | return 1; | |
882 | ||
883 | /* Just a random prefix match */ | |
884 | return 0; | |
885 | } | |
886 | ||
c904cd89 NTND |
887 | /* |
888 | * Perform matching on the leading non-wildcard part of | |
889 | * pathspec. item->nowildcard_len must be greater than zero. Return | |
890 | * non-zero if base is matched. | |
891 | */ | |
892 | static int match_wildcard_base(const struct pathspec_item *item, | |
893 | const char *base, int baselen, | |
894 | int *matched) | |
895 | { | |
896 | const char *match = item->match; | |
897 | /* the wildcard part is not considered in this function */ | |
898 | int matchlen = item->nowildcard_len; | |
899 | ||
900 | if (baselen) { | |
901 | int dirlen; | |
902 | /* | |
903 | * Return early if base is longer than the | |
904 | * non-wildcard part but it does not match. | |
905 | */ | |
906 | if (baselen >= matchlen) { | |
907 | *matched = matchlen; | |
93d93537 | 908 | return !basecmp(item, base, match, matchlen); |
c904cd89 NTND |
909 | } |
910 | ||
911 | dirlen = matchlen; | |
912 | while (dirlen && match[dirlen - 1] != '/') | |
913 | dirlen--; | |
914 | ||
915 | /* | |
916 | * Return early if base is shorter than the | |
917 | * non-wildcard part but it does not match. Note that | |
918 | * base ends with '/' so we are sure it really matches | |
919 | * directory | |
920 | */ | |
93d93537 | 921 | if (basecmp(item, base, match, baselen)) |
c904cd89 NTND |
922 | return 0; |
923 | *matched = baselen; | |
924 | } else | |
925 | *matched = 0; | |
926 | /* | |
927 | * we could have checked entry against the non-wildcard part | |
928 | * that is not in base and does similar never_interesting | |
929 | * optimization as in match_entry. For now just be happy with | |
930 | * base comparison. | |
931 | */ | |
932 | return entry_interesting; | |
933 | } | |
934 | ||
2c389fc8 NTND |
935 | /* |
936 | * Is a tree entry interesting given the pathspec we have? | |
937 | * | |
1376e507 NTND |
938 | * Pre-condition: either baselen == base_offset (i.e. empty path) |
939 | * or base[baselen-1] == '/' (i.e. with trailing slash). | |
2c389fc8 | 940 | */ |
67022e02 NTND |
941 | static enum interesting do_match(struct index_state *istate, |
942 | const struct name_entry *entry, | |
ef79b1f8 NTND |
943 | struct strbuf *base, int base_offset, |
944 | const struct pathspec *ps, | |
945 | int exclude) | |
2c389fc8 NTND |
946 | { |
947 | int i; | |
1376e507 | 948 | int pathlen, baselen = base->len - base_offset; |
c3a47ca9 | 949 | enum interesting never_interesting = ps->has_wildcard ? |
d688cf07 | 950 | entry_not_interesting : all_entries_not_interesting; |
2c389fc8 | 951 | |
5c6933d2 NTND |
952 | GUARD_PATHSPEC(ps, |
953 | PATHSPEC_FROMTOP | | |
954 | PATHSPEC_MAXDEPTH | | |
bd30c2e4 | 955 | PATHSPEC_LITERAL | |
93d93537 | 956 | PATHSPEC_GLOB | |
ef79b1f8 | 957 | PATHSPEC_ICASE | |
5a0b97b3 NTND |
958 | PATHSPEC_EXCLUDE | |
959 | PATHSPEC_ATTR); | |
8f4f8f45 | 960 | |
bc96cc87 | 961 | if (!ps->nr) { |
6330a171 NTND |
962 | if (!ps->recursive || |
963 | !(ps->magic & PATHSPEC_MAXDEPTH) || | |
964 | ps->max_depth == -1) | |
d688cf07 NTND |
965 | return all_entries_interesting; |
966 | return within_depth(base->buf + base_offset, baselen, | |
967 | !!S_ISDIR(entry->mode), | |
968 | ps->max_depth) ? | |
969 | entry_interesting : entry_not_interesting; | |
bc96cc87 | 970 | } |
2c389fc8 | 971 | |
0de16337 | 972 | pathlen = tree_entry_len(entry); |
2c389fc8 | 973 | |
1376e507 | 974 | for (i = ps->nr - 1; i >= 0; i--) { |
2c389fc8 NTND |
975 | const struct pathspec_item *item = ps->items+i; |
976 | const char *match = item->match; | |
1376e507 | 977 | const char *base_str = base->buf + base_offset; |
c904cd89 | 978 | int matchlen = item->len, matched = 0; |
2c389fc8 | 979 | |
ef79b1f8 NTND |
980 | if ((!exclude && item->magic & PATHSPEC_EXCLUDE) || |
981 | ( exclude && !(item->magic & PATHSPEC_EXCLUDE))) | |
982 | continue; | |
983 | ||
2c389fc8 NTND |
984 | if (baselen >= matchlen) { |
985 | /* If it doesn't match, move along... */ | |
93d93537 | 986 | if (!match_dir_prefix(item, base_str, match, matchlen)) |
d38f2809 | 987 | goto match_wildcards; |
bc96cc87 | 988 | |
6330a171 NTND |
989 | if (!ps->recursive || |
990 | !(ps->magic & PATHSPEC_MAXDEPTH) || | |
5a0b97b3 NTND |
991 | ps->max_depth == -1) { |
992 | if (!item->attr_match_nr) | |
993 | return all_entries_interesting; | |
994 | else | |
995 | goto interesting; | |
996 | } | |
997 | ||
998 | if (within_depth(base_str + matchlen + 1, | |
999 | baselen - matchlen - 1, | |
1000 | !!S_ISDIR(entry->mode), | |
1001 | ps->max_depth)) | |
1002 | goto interesting; | |
1003 | else | |
1004 | return entry_not_interesting; | |
2c389fc8 NTND |
1005 | } |
1006 | ||
1b740923 | 1007 | /* Either there must be no base, or the base must match. */ |
93d93537 NTND |
1008 | if (baselen == 0 || !basecmp(item, base_str, match, baselen)) { |
1009 | if (match_entry(item, entry, pathlen, | |
58c4d666 NTND |
1010 | match + baselen, matchlen - baselen, |
1011 | &never_interesting)) | |
5a0b97b3 | 1012 | goto interesting; |
f1a2ddbb | 1013 | |
170260ae | 1014 | if (item->nowildcard_len < item->len) { |
bd30c2e4 | 1015 | if (!git_fnmatch(item, match + baselen, entry->path, |
8c6abbcd | 1016 | item->nowildcard_len - baselen)) |
5a0b97b3 | 1017 | goto interesting; |
f1a2ddbb NTND |
1018 | |
1019 | /* | |
1020 | * Match all directories. We'll try to | |
1021 | * match files later on. | |
1022 | */ | |
1023 | if (ps->recursive && S_ISDIR(entry->mode)) | |
d688cf07 | 1024 | return entry_interesting; |
74ed4371 BW |
1025 | |
1026 | /* | |
1027 | * When matching against submodules with | |
1028 | * wildcard characters, ensure that the entry | |
1029 | * at least matches up to the first wild | |
1030 | * character. More accurate matching can then | |
1031 | * be performed in the submodule itself. | |
1032 | */ | |
eef3df5a BW |
1033 | if (ps->recurse_submodules && |
1034 | S_ISGITLINK(entry->mode) && | |
74ed4371 BW |
1035 | !ps_strncmp(item, match + baselen, |
1036 | entry->path, | |
1037 | item->nowildcard_len - baselen)) | |
5a0b97b3 | 1038 | goto interesting; |
f1a2ddbb NTND |
1039 | } |
1040 | ||
1041 | continue; | |
2c389fc8 | 1042 | } |
d38f2809 NTND |
1043 | |
1044 | match_wildcards: | |
170260ae | 1045 | if (item->nowildcard_len == item->len) |
d38f2809 NTND |
1046 | continue; |
1047 | ||
c904cd89 NTND |
1048 | if (item->nowildcard_len && |
1049 | !match_wildcard_base(item, base_str, baselen, &matched)) | |
e4ddb057 | 1050 | continue; |
c904cd89 | 1051 | |
d38f2809 NTND |
1052 | /* |
1053 | * Concatenate base and entry->path into one and do | |
1054 | * fnmatch() on it. | |
c904cd89 NTND |
1055 | * |
1056 | * While we could avoid concatenation in certain cases | |
1057 | * [1], which saves a memcpy and potentially a | |
1058 | * realloc, it turns out not worth it. Measurement on | |
1059 | * linux-2.6 does not show any clear improvements, | |
1060 | * partly because of the nowildcard_len optimization | |
1061 | * in git_fnmatch(). Avoid micro-optimizations here. | |
1062 | * | |
1063 | * [1] if match_wildcard_base() says the base | |
1064 | * directory is already matched, we only need to match | |
1065 | * the rest, which is shorter so _in theory_ faster. | |
d38f2809 NTND |
1066 | */ |
1067 | ||
1068 | strbuf_add(base, entry->path, pathlen); | |
1069 | ||
bd30c2e4 | 1070 | if (!git_fnmatch(item, match, base->buf + base_offset, |
8c6abbcd | 1071 | item->nowildcard_len)) { |
1376e507 | 1072 | strbuf_setlen(base, base_offset + baselen); |
5a0b97b3 | 1073 | goto interesting; |
d38f2809 | 1074 | } |
74ed4371 BW |
1075 | |
1076 | /* | |
1077 | * When matching against submodules with | |
1078 | * wildcard characters, ensure that the entry | |
1079 | * at least matches up to the first wild | |
1080 | * character. More accurate matching can then | |
1081 | * be performed in the submodule itself. | |
1082 | */ | |
eef3df5a | 1083 | if (ps->recurse_submodules && S_ISGITLINK(entry->mode) && |
74ed4371 BW |
1084 | !ps_strncmp(item, match, base->buf + base_offset, |
1085 | item->nowildcard_len)) { | |
1086 | strbuf_setlen(base, base_offset + baselen); | |
5a0b97b3 | 1087 | goto interesting; |
74ed4371 BW |
1088 | } |
1089 | ||
1376e507 | 1090 | strbuf_setlen(base, base_offset + baselen); |
d38f2809 NTND |
1091 | |
1092 | /* | |
1093 | * Match all directories. We'll try to match files | |
1094 | * later on. | |
8c69c1f9 NTND |
1095 | * max_depth is ignored but we may consider support it |
1096 | * in future, see | |
5840eb9d | 1097 | * https://public-inbox.org/git/7vmxo5l2g4.fsf@alter.siamese.dyndns.org/ |
d38f2809 NTND |
1098 | */ |
1099 | if (ps->recursive && S_ISDIR(entry->mode)) | |
d688cf07 | 1100 | return entry_interesting; |
5a0b97b3 NTND |
1101 | continue; |
1102 | interesting: | |
1103 | if (item->attr_match_nr) { | |
1104 | int ret; | |
1105 | ||
1106 | /* | |
1107 | * Must not return all_entries_not_interesting | |
1108 | * prematurely. We do not know if all entries do not | |
1109 | * match some attributes with current attr API. | |
1110 | */ | |
1111 | never_interesting = entry_not_interesting; | |
1112 | ||
1113 | /* | |
1114 | * Consider all directories interesting (because some | |
1115 | * of those files inside may match some attributes | |
1116 | * even though the parent dir does not) | |
1117 | * | |
1118 | * FIXME: attributes _can_ match directories and we | |
1119 | * can probably return all_entries_interesting or | |
1120 | * all_entries_not_interesting here if matched. | |
1121 | */ | |
1122 | if (S_ISDIR(entry->mode)) | |
1123 | return entry_interesting; | |
1124 | ||
1125 | strbuf_add(base, entry->path, pathlen); | |
1126 | ret = match_pathspec_attrs(istate, base->buf + base_offset, | |
1127 | base->len - base_offset, item); | |
1128 | strbuf_setlen(base, base_offset + baselen); | |
1129 | if (!ret) | |
1130 | continue; | |
1131 | } | |
1132 | return entry_interesting; | |
2c389fc8 NTND |
1133 | } |
1134 | return never_interesting; /* No matches */ | |
1135 | } | |
ef79b1f8 NTND |
1136 | |
1137 | /* | |
1138 | * Is a tree entry interesting given the pathspec we have? | |
1139 | * | |
1140 | * Pre-condition: either baselen == base_offset (i.e. empty path) | |
1141 | * or base[baselen-1] == '/' (i.e. with trailing slash). | |
1142 | */ | |
67022e02 NTND |
1143 | enum interesting tree_entry_interesting(struct index_state *istate, |
1144 | const struct name_entry *entry, | |
ef79b1f8 NTND |
1145 | struct strbuf *base, int base_offset, |
1146 | const struct pathspec *ps) | |
1147 | { | |
1148 | enum interesting positive, negative; | |
67022e02 | 1149 | positive = do_match(istate, entry, base, base_offset, ps, 0); |
ef79b1f8 NTND |
1150 | |
1151 | /* | |
1152 | * case | entry | positive | negative | result | |
1153 | * -----+-------+----------+----------+------- | |
1154 | * 1 | file | -1 | -1..2 | -1 | |
1155 | * 2 | file | 0 | -1..2 | 0 | |
1156 | * 3 | file | 1 | -1 | 1 | |
1157 | * 4 | file | 1 | 0 | 1 | |
1158 | * 5 | file | 1 | 1 | 0 | |
1159 | * 6 | file | 1 | 2 | 0 | |
1160 | * 7 | file | 2 | -1 | 2 | |
b7845ceb | 1161 | * 8 | file | 2 | 0 | 1 |
ef79b1f8 NTND |
1162 | * 9 | file | 2 | 1 | 0 |
1163 | * 10 | file | 2 | 2 | -1 | |
1164 | * -----+-------+----------+----------+------- | |
1165 | * 11 | dir | -1 | -1..2 | -1 | |
1166 | * 12 | dir | 0 | -1..2 | 0 | |
1167 | * 13 | dir | 1 | -1 | 1 | |
1168 | * 14 | dir | 1 | 0 | 1 | |
1169 | * 15 | dir | 1 | 1 | 1 (*) | |
1170 | * 16 | dir | 1 | 2 | 0 | |
1171 | * 17 | dir | 2 | -1 | 2 | |
b7845ceb | 1172 | * 18 | dir | 2 | 0 | 1 |
ef79b1f8 NTND |
1173 | * 19 | dir | 2 | 1 | 1 (*) |
1174 | * 20 | dir | 2 | 2 | -1 | |
1175 | * | |
1176 | * (*) An exclude pattern interested in a directory does not | |
1177 | * necessarily mean it will exclude all of the directory. In | |
1178 | * wildcard case, it can't decide until looking at individual | |
1179 | * files inside. So don't write such directories off yet. | |
1180 | */ | |
1181 | ||
1182 | if (!(ps->magic & PATHSPEC_EXCLUDE) || | |
1183 | positive <= entry_not_interesting) /* #1, #2, #11, #12 */ | |
1184 | return positive; | |
1185 | ||
67022e02 | 1186 | negative = do_match(istate, entry, base, base_offset, ps, 1); |
ef79b1f8 | 1187 | |
b7845ceb NTND |
1188 | /* #8, #18 */ |
1189 | if (positive == all_entries_interesting && | |
1190 | negative == entry_not_interesting) | |
1191 | return entry_interesting; | |
1192 | ||
1193 | /* #3, #4, #7, #13, #14, #17 */ | |
ef79b1f8 NTND |
1194 | if (negative <= entry_not_interesting) |
1195 | return positive; | |
1196 | ||
1197 | /* #15, #19 */ | |
1198 | if (S_ISDIR(entry->mode) && | |
1199 | positive >= entry_interesting && | |
1200 | negative == entry_interesting) | |
1201 | return entry_interesting; | |
1202 | ||
1203 | if ((positive == entry_interesting && | |
1204 | negative >= entry_interesting) || /* #5, #6, #16 */ | |
1205 | (positive == all_entries_interesting && | |
1206 | negative == entry_interesting)) /* #9 */ | |
1207 | return entry_not_interesting; | |
1208 | ||
1209 | return all_entries_not_interesting; /* #10, #20 */ | |
1210 | } |