]> git.ipfire.org Git - thirdparty/git.git/blob - dir.c
object-file: remove OBJECT_INFO_IGNORE_LOOSE
[thirdparty/git.git] / dir.c
1 /*
2 * This handles recursive filename detection with exclude
3 * files, index knowledge etc..
4 *
5 * Copyright (C) Linus Torvalds, 2005-2006
6 * Junio Hamano, 2005-2006
7 */
8 #include "cache.h"
9 #include "config.h"
10 #include "dir.h"
11 #include "object-store.h"
12 #include "attr.h"
13 #include "refs.h"
14 #include "wildmatch.h"
15 #include "pathspec.h"
16 #include "utf8.h"
17 #include "varint.h"
18 #include "ewah/ewok.h"
19 #include "fsmonitor.h"
20 #include "submodule-config.h"
21
22 /*
23 * Tells read_directory_recursive how a file or directory should be treated.
24 * Values are ordered by significance, e.g. if a directory contains both
25 * excluded and untracked files, it is listed as untracked because
26 * path_untracked > path_excluded.
27 */
28 enum path_treatment {
29 path_none = 0,
30 path_recurse,
31 path_excluded,
32 path_untracked
33 };
34
35 /*
36 * Support data structure for our opendir/readdir/closedir wrappers
37 */
38 struct cached_dir {
39 DIR *fdir;
40 struct untracked_cache_dir *untracked;
41 int nr_files;
42 int nr_dirs;
43
44 const char *d_name;
45 int d_type;
46 const char *file;
47 struct untracked_cache_dir *ucd;
48 };
49
50 static enum path_treatment read_directory_recursive(struct dir_struct *dir,
51 struct index_state *istate, const char *path, int len,
52 struct untracked_cache_dir *untracked,
53 int check_only, int stop_at_first_file, const struct pathspec *pathspec);
54 static int resolve_dtype(int dtype, struct index_state *istate,
55 const char *path, int len);
56 struct dirent *readdir_skip_dot_and_dotdot(DIR *dirp)
57 {
58 struct dirent *e;
59
60 while ((e = readdir(dirp)) != NULL) {
61 if (!is_dot_or_dotdot(e->d_name))
62 break;
63 }
64 return e;
65 }
66
67 int count_slashes(const char *s)
68 {
69 int cnt = 0;
70 while (*s)
71 if (*s++ == '/')
72 cnt++;
73 return cnt;
74 }
75
76 int fspathcmp(const char *a, const char *b)
77 {
78 return ignore_case ? strcasecmp(a, b) : strcmp(a, b);
79 }
80
81 int fspatheq(const char *a, const char *b)
82 {
83 return !fspathcmp(a, b);
84 }
85
86 int fspathncmp(const char *a, const char *b, size_t count)
87 {
88 return ignore_case ? strncasecmp(a, b, count) : strncmp(a, b, count);
89 }
90
91 unsigned int fspathhash(const char *str)
92 {
93 return ignore_case ? strihash(str) : strhash(str);
94 }
95
96 int git_fnmatch(const struct pathspec_item *item,
97 const char *pattern, const char *string,
98 int prefix)
99 {
100 if (prefix > 0) {
101 if (ps_strncmp(item, pattern, string, prefix))
102 return WM_NOMATCH;
103 pattern += prefix;
104 string += prefix;
105 }
106 if (item->flags & PATHSPEC_ONESTAR) {
107 int pattern_len = strlen(++pattern);
108 int string_len = strlen(string);
109 return string_len < pattern_len ||
110 ps_strcmp(item, pattern,
111 string + string_len - pattern_len);
112 }
113 if (item->magic & PATHSPEC_GLOB)
114 return wildmatch(pattern, string,
115 WM_PATHNAME |
116 (item->magic & PATHSPEC_ICASE ? WM_CASEFOLD : 0));
117 else
118 /* wildmatch has not learned no FNM_PATHNAME mode yet */
119 return wildmatch(pattern, string,
120 item->magic & PATHSPEC_ICASE ? WM_CASEFOLD : 0);
121 }
122
123 static int fnmatch_icase_mem(const char *pattern, int patternlen,
124 const char *string, int stringlen,
125 int flags)
126 {
127 int match_status;
128 struct strbuf pat_buf = STRBUF_INIT;
129 struct strbuf str_buf = STRBUF_INIT;
130 const char *use_pat = pattern;
131 const char *use_str = string;
132
133 if (pattern[patternlen]) {
134 strbuf_add(&pat_buf, pattern, patternlen);
135 use_pat = pat_buf.buf;
136 }
137 if (string[stringlen]) {
138 strbuf_add(&str_buf, string, stringlen);
139 use_str = str_buf.buf;
140 }
141
142 if (ignore_case)
143 flags |= WM_CASEFOLD;
144 match_status = wildmatch(use_pat, use_str, flags);
145
146 strbuf_release(&pat_buf);
147 strbuf_release(&str_buf);
148
149 return match_status;
150 }
151
152 static size_t common_prefix_len(const struct pathspec *pathspec)
153 {
154 int n;
155 size_t max = 0;
156
157 /*
158 * ":(icase)path" is treated as a pathspec full of
159 * wildcard. In other words, only prefix is considered common
160 * prefix. If the pathspec is abc/foo abc/bar, running in
161 * subdir xyz, the common prefix is still xyz, not xyz/abc as
162 * in non-:(icase).
163 */
164 GUARD_PATHSPEC(pathspec,
165 PATHSPEC_FROMTOP |
166 PATHSPEC_MAXDEPTH |
167 PATHSPEC_LITERAL |
168 PATHSPEC_GLOB |
169 PATHSPEC_ICASE |
170 PATHSPEC_EXCLUDE |
171 PATHSPEC_ATTR);
172
173 for (n = 0; n < pathspec->nr; n++) {
174 size_t i = 0, len = 0, item_len;
175 if (pathspec->items[n].magic & PATHSPEC_EXCLUDE)
176 continue;
177 if (pathspec->items[n].magic & PATHSPEC_ICASE)
178 item_len = pathspec->items[n].prefix;
179 else
180 item_len = pathspec->items[n].nowildcard_len;
181 while (i < item_len && (n == 0 || i < max)) {
182 char c = pathspec->items[n].match[i];
183 if (c != pathspec->items[0].match[i])
184 break;
185 if (c == '/')
186 len = i + 1;
187 i++;
188 }
189 if (n == 0 || len < max) {
190 max = len;
191 if (!max)
192 break;
193 }
194 }
195 return max;
196 }
197
198 /*
199 * Returns a copy of the longest leading path common among all
200 * pathspecs.
201 */
202 char *common_prefix(const struct pathspec *pathspec)
203 {
204 unsigned long len = common_prefix_len(pathspec);
205
206 return len ? xmemdupz(pathspec->items[0].match, len) : NULL;
207 }
208
209 int fill_directory(struct dir_struct *dir,
210 struct index_state *istate,
211 const struct pathspec *pathspec)
212 {
213 const char *prefix;
214 size_t prefix_len;
215
216 unsigned exclusive_flags = DIR_SHOW_IGNORED | DIR_SHOW_IGNORED_TOO;
217 if ((dir->flags & exclusive_flags) == exclusive_flags)
218 BUG("DIR_SHOW_IGNORED and DIR_SHOW_IGNORED_TOO are exclusive");
219
220 /*
221 * Calculate common prefix for the pathspec, and
222 * use that to optimize the directory walk
223 */
224 prefix_len = common_prefix_len(pathspec);
225 prefix = prefix_len ? pathspec->items[0].match : "";
226
227 /* Read the directory and prune it */
228 read_directory(dir, istate, prefix, prefix_len, pathspec);
229
230 return prefix_len;
231 }
232
233 int within_depth(const char *name, int namelen,
234 int depth, int max_depth)
235 {
236 const char *cp = name, *cpe = name + namelen;
237
238 while (cp < cpe) {
239 if (*cp++ != '/')
240 continue;
241 depth++;
242 if (depth > max_depth)
243 return 0;
244 }
245 return 1;
246 }
247
248 /*
249 * Read the contents of the blob with the given OID into a buffer.
250 * Append a trailing LF to the end if the last line doesn't have one.
251 *
252 * Returns:
253 * -1 when the OID is invalid or unknown or does not refer to a blob.
254 * 0 when the blob is empty.
255 * 1 along with { data, size } of the (possibly augmented) buffer
256 * when successful.
257 *
258 * Optionally updates the given oid_stat with the given OID (when valid).
259 */
260 static int do_read_blob(const struct object_id *oid, struct oid_stat *oid_stat,
261 size_t *size_out, char **data_out)
262 {
263 enum object_type type;
264 unsigned long sz;
265 char *data;
266
267 *size_out = 0;
268 *data_out = NULL;
269
270 data = read_object_file(oid, &type, &sz);
271 if (!data || type != OBJ_BLOB) {
272 free(data);
273 return -1;
274 }
275
276 if (oid_stat) {
277 memset(&oid_stat->stat, 0, sizeof(oid_stat->stat));
278 oidcpy(&oid_stat->oid, oid);
279 }
280
281 if (sz == 0) {
282 free(data);
283 return 0;
284 }
285
286 if (data[sz - 1] != '\n') {
287 data = xrealloc(data, st_add(sz, 1));
288 data[sz++] = '\n';
289 }
290
291 *size_out = xsize_t(sz);
292 *data_out = data;
293
294 return 1;
295 }
296
297 #define DO_MATCH_EXCLUDE (1<<0)
298 #define DO_MATCH_DIRECTORY (1<<1)
299 #define DO_MATCH_LEADING_PATHSPEC (1<<2)
300
301 /*
302 * Does the given pathspec match the given name? A match is found if
303 *
304 * (1) the pathspec string is leading directory of 'name' ("RECURSIVELY"), or
305 * (2) the pathspec string has a leading part matching 'name' ("LEADING"), or
306 * (3) the pathspec string is a wildcard and matches 'name' ("WILDCARD"), or
307 * (4) the pathspec string is exactly the same as 'name' ("EXACT").
308 *
309 * Return value tells which case it was (1-4), or 0 when there is no match.
310 *
311 * It may be instructive to look at a small table of concrete examples
312 * to understand the differences between 1, 2, and 4:
313 *
314 * Pathspecs
315 * | a/b | a/b/ | a/b/c
316 * ------+-----------+-----------+------------
317 * a/b | EXACT | EXACT[1] | LEADING[2]
318 * Names a/b/ | RECURSIVE | EXACT | LEADING[2]
319 * a/b/c | RECURSIVE | RECURSIVE | EXACT
320 *
321 * [1] Only if DO_MATCH_DIRECTORY is passed; otherwise, this is NOT a match.
322 * [2] Only if DO_MATCH_LEADING_PATHSPEC is passed; otherwise, not a match.
323 */
324 static int match_pathspec_item(struct index_state *istate,
325 const struct pathspec_item *item, int prefix,
326 const char *name, int namelen, unsigned flags)
327 {
328 /* name/namelen has prefix cut off by caller */
329 const char *match = item->match + prefix;
330 int matchlen = item->len - prefix;
331
332 /*
333 * The normal call pattern is:
334 * 1. prefix = common_prefix_len(ps);
335 * 2. prune something, or fill_directory
336 * 3. match_pathspec()
337 *
338 * 'prefix' at #1 may be shorter than the command's prefix and
339 * it's ok for #2 to match extra files. Those extras will be
340 * trimmed at #3.
341 *
342 * Suppose the pathspec is 'foo' and '../bar' running from
343 * subdir 'xyz'. The common prefix at #1 will be empty, thanks
344 * to "../". We may have xyz/foo _and_ XYZ/foo after #2. The
345 * user does not want XYZ/foo, only the "foo" part should be
346 * case-insensitive. We need to filter out XYZ/foo here. In
347 * other words, we do not trust the caller on comparing the
348 * prefix part when :(icase) is involved. We do exact
349 * comparison ourselves.
350 *
351 * Normally the caller (common_prefix_len() in fact) does
352 * _exact_ matching on name[-prefix+1..-1] and we do not need
353 * to check that part. Be defensive and check it anyway, in
354 * case common_prefix_len is changed, or a new caller is
355 * introduced that does not use common_prefix_len.
356 *
357 * If the penalty turns out too high when prefix is really
358 * long, maybe change it to
359 * strncmp(match, name, item->prefix - prefix)
360 */
361 if (item->prefix && (item->magic & PATHSPEC_ICASE) &&
362 strncmp(item->match, name - prefix, item->prefix))
363 return 0;
364
365 if (item->attr_match_nr &&
366 !match_pathspec_attrs(istate, name, namelen, item))
367 return 0;
368
369 /* If the match was just the prefix, we matched */
370 if (!*match)
371 return MATCHED_RECURSIVELY;
372
373 if (matchlen <= namelen && !ps_strncmp(item, match, name, matchlen)) {
374 if (matchlen == namelen)
375 return MATCHED_EXACTLY;
376
377 if (match[matchlen-1] == '/' || name[matchlen] == '/')
378 return MATCHED_RECURSIVELY;
379 } else if ((flags & DO_MATCH_DIRECTORY) &&
380 match[matchlen - 1] == '/' &&
381 namelen == matchlen - 1 &&
382 !ps_strncmp(item, match, name, namelen))
383 return MATCHED_EXACTLY;
384
385 if (item->nowildcard_len < item->len &&
386 !git_fnmatch(item, match, name,
387 item->nowildcard_len - prefix))
388 return MATCHED_FNMATCH;
389
390 /* Perform checks to see if "name" is a leading string of the pathspec */
391 if ( (flags & DO_MATCH_LEADING_PATHSPEC) &&
392 !(flags & DO_MATCH_EXCLUDE)) {
393 /* name is a literal prefix of the pathspec */
394 int offset = name[namelen-1] == '/' ? 1 : 0;
395 if ((namelen < matchlen) &&
396 (match[namelen-offset] == '/') &&
397 !ps_strncmp(item, match, name, namelen))
398 return MATCHED_RECURSIVELY_LEADING_PATHSPEC;
399
400 /* name doesn't match up to the first wild character */
401 if (item->nowildcard_len < item->len &&
402 ps_strncmp(item, match, name,
403 item->nowildcard_len - prefix))
404 return 0;
405
406 /*
407 * name has no wildcard, and it didn't match as a leading
408 * pathspec so return.
409 */
410 if (item->nowildcard_len == item->len)
411 return 0;
412
413 /*
414 * Here is where we would perform a wildmatch to check if
415 * "name" can be matched as a directory (or a prefix) against
416 * the pathspec. Since wildmatch doesn't have this capability
417 * at the present we have to punt and say that it is a match,
418 * potentially returning a false positive
419 * The submodules themselves will be able to perform more
420 * accurate matching to determine if the pathspec matches.
421 */
422 return MATCHED_RECURSIVELY_LEADING_PATHSPEC;
423 }
424
425 return 0;
426 }
427
428 /*
429 * do_match_pathspec() is meant to ONLY be called by
430 * match_pathspec_with_flags(); calling it directly risks pathspecs
431 * like ':!unwanted_path' being ignored.
432 *
433 * Given a name and a list of pathspecs, returns the nature of the
434 * closest (i.e. most specific) match of the name to any of the
435 * pathspecs.
436 *
437 * The caller typically calls this multiple times with the same
438 * pathspec and seen[] array but with different name/namelen
439 * (e.g. entries from the index) and is interested in seeing if and
440 * how each pathspec matches all the names it calls this function
441 * with. A mark is left in the seen[] array for each pathspec element
442 * indicating the closest type of match that element achieved, so if
443 * seen[n] remains zero after multiple invocations, that means the nth
444 * pathspec did not match any names, which could indicate that the
445 * user mistyped the nth pathspec.
446 */
447 static int do_match_pathspec(struct index_state *istate,
448 const struct pathspec *ps,
449 const char *name, int namelen,
450 int prefix, char *seen,
451 unsigned flags)
452 {
453 int i, retval = 0, exclude = flags & DO_MATCH_EXCLUDE;
454
455 GUARD_PATHSPEC(ps,
456 PATHSPEC_FROMTOP |
457 PATHSPEC_MAXDEPTH |
458 PATHSPEC_LITERAL |
459 PATHSPEC_GLOB |
460 PATHSPEC_ICASE |
461 PATHSPEC_EXCLUDE |
462 PATHSPEC_ATTR);
463
464 if (!ps->nr) {
465 if (!ps->recursive ||
466 !(ps->magic & PATHSPEC_MAXDEPTH) ||
467 ps->max_depth == -1)
468 return MATCHED_RECURSIVELY;
469
470 if (within_depth(name, namelen, 0, ps->max_depth))
471 return MATCHED_EXACTLY;
472 else
473 return 0;
474 }
475
476 name += prefix;
477 namelen -= prefix;
478
479 for (i = ps->nr - 1; i >= 0; i--) {
480 int how;
481
482 if ((!exclude && ps->items[i].magic & PATHSPEC_EXCLUDE) ||
483 ( exclude && !(ps->items[i].magic & PATHSPEC_EXCLUDE)))
484 continue;
485
486 if (seen && seen[i] == MATCHED_EXACTLY)
487 continue;
488 /*
489 * Make exclude patterns optional and never report
490 * "pathspec ':(exclude)foo' matches no files"
491 */
492 if (seen && ps->items[i].magic & PATHSPEC_EXCLUDE)
493 seen[i] = MATCHED_FNMATCH;
494 how = match_pathspec_item(istate, ps->items+i, prefix, name,
495 namelen, flags);
496 if (ps->recursive &&
497 (ps->magic & PATHSPEC_MAXDEPTH) &&
498 ps->max_depth != -1 &&
499 how && how != MATCHED_FNMATCH) {
500 int len = ps->items[i].len;
501 if (name[len] == '/')
502 len++;
503 if (within_depth(name+len, namelen-len, 0, ps->max_depth))
504 how = MATCHED_EXACTLY;
505 else
506 how = 0;
507 }
508 if (how) {
509 if (retval < how)
510 retval = how;
511 if (seen && seen[i] < how)
512 seen[i] = how;
513 }
514 }
515 return retval;
516 }
517
518 static int match_pathspec_with_flags(struct index_state *istate,
519 const struct pathspec *ps,
520 const char *name, int namelen,
521 int prefix, char *seen, unsigned flags)
522 {
523 int positive, negative;
524 positive = do_match_pathspec(istate, ps, name, namelen,
525 prefix, seen, flags);
526 if (!(ps->magic & PATHSPEC_EXCLUDE) || !positive)
527 return positive;
528 negative = do_match_pathspec(istate, ps, name, namelen,
529 prefix, seen,
530 flags | DO_MATCH_EXCLUDE);
531 return negative ? 0 : positive;
532 }
533
534 int match_pathspec(struct index_state *istate,
535 const struct pathspec *ps,
536 const char *name, int namelen,
537 int prefix, char *seen, int is_dir)
538 {
539 unsigned flags = is_dir ? DO_MATCH_DIRECTORY : 0;
540 return match_pathspec_with_flags(istate, ps, name, namelen,
541 prefix, seen, flags);
542 }
543
544 /**
545 * Check if a submodule is a superset of the pathspec
546 */
547 int submodule_path_match(struct index_state *istate,
548 const struct pathspec *ps,
549 const char *submodule_name,
550 char *seen)
551 {
552 int matched = match_pathspec_with_flags(istate, ps, submodule_name,
553 strlen(submodule_name),
554 0, seen,
555 DO_MATCH_DIRECTORY |
556 DO_MATCH_LEADING_PATHSPEC);
557 return matched;
558 }
559
560 int report_path_error(const char *ps_matched,
561 const struct pathspec *pathspec)
562 {
563 /*
564 * Make sure all pathspec matched; otherwise it is an error.
565 */
566 int num, errors = 0;
567 for (num = 0; num < pathspec->nr; num++) {
568 int other, found_dup;
569
570 if (ps_matched[num])
571 continue;
572 /*
573 * The caller might have fed identical pathspec
574 * twice. Do not barf on such a mistake.
575 * FIXME: parse_pathspec should have eliminated
576 * duplicate pathspec.
577 */
578 for (found_dup = other = 0;
579 !found_dup && other < pathspec->nr;
580 other++) {
581 if (other == num || !ps_matched[other])
582 continue;
583 if (!strcmp(pathspec->items[other].original,
584 pathspec->items[num].original))
585 /*
586 * Ok, we have a match already.
587 */
588 found_dup = 1;
589 }
590 if (found_dup)
591 continue;
592
593 error(_("pathspec '%s' did not match any file(s) known to git"),
594 pathspec->items[num].original);
595 errors++;
596 }
597 return errors;
598 }
599
600 /*
601 * Return the length of the "simple" part of a path match limiter.
602 */
603 int simple_length(const char *match)
604 {
605 int len = -1;
606
607 for (;;) {
608 unsigned char c = *match++;
609 len++;
610 if (c == '\0' || is_glob_special(c))
611 return len;
612 }
613 }
614
615 int no_wildcard(const char *string)
616 {
617 return string[simple_length(string)] == '\0';
618 }
619
620 void parse_path_pattern(const char **pattern,
621 int *patternlen,
622 unsigned *flags,
623 int *nowildcardlen)
624 {
625 const char *p = *pattern;
626 size_t i, len;
627
628 *flags = 0;
629 if (*p == '!') {
630 *flags |= PATTERN_FLAG_NEGATIVE;
631 p++;
632 }
633 len = strlen(p);
634 if (len && p[len - 1] == '/') {
635 len--;
636 *flags |= PATTERN_FLAG_MUSTBEDIR;
637 }
638 for (i = 0; i < len; i++) {
639 if (p[i] == '/')
640 break;
641 }
642 if (i == len)
643 *flags |= PATTERN_FLAG_NODIR;
644 *nowildcardlen = simple_length(p);
645 /*
646 * we should have excluded the trailing slash from 'p' too,
647 * but that's one more allocation. Instead just make sure
648 * nowildcardlen does not exceed real patternlen
649 */
650 if (*nowildcardlen > len)
651 *nowildcardlen = len;
652 if (*p == '*' && no_wildcard(p + 1))
653 *flags |= PATTERN_FLAG_ENDSWITH;
654 *pattern = p;
655 *patternlen = len;
656 }
657
658 int pl_hashmap_cmp(const void *cmp_data UNUSED,
659 const struct hashmap_entry *a,
660 const struct hashmap_entry *b,
661 const void *key UNUSED)
662 {
663 const struct pattern_entry *ee1 =
664 container_of(a, struct pattern_entry, ent);
665 const struct pattern_entry *ee2 =
666 container_of(b, struct pattern_entry, ent);
667
668 size_t min_len = ee1->patternlen <= ee2->patternlen
669 ? ee1->patternlen
670 : ee2->patternlen;
671
672 return fspathncmp(ee1->pattern, ee2->pattern, min_len);
673 }
674
675 static char *dup_and_filter_pattern(const char *pattern)
676 {
677 char *set, *read;
678 size_t count = 0;
679 char *result = xstrdup(pattern);
680
681 set = result;
682 read = result;
683
684 while (*read) {
685 /* skip escape characters (once) */
686 if (*read == '\\')
687 read++;
688
689 *set = *read;
690
691 set++;
692 read++;
693 count++;
694 }
695 *set = 0;
696
697 if (count > 2 &&
698 *(set - 1) == '*' &&
699 *(set - 2) == '/')
700 *(set - 2) = 0;
701
702 return result;
703 }
704
705 static void add_pattern_to_hashsets(struct pattern_list *pl, struct path_pattern *given)
706 {
707 struct pattern_entry *translated;
708 char *truncated;
709 char *data = NULL;
710 const char *prev, *cur, *next;
711
712 if (!pl->use_cone_patterns)
713 return;
714
715 if (given->flags & PATTERN_FLAG_NEGATIVE &&
716 given->flags & PATTERN_FLAG_MUSTBEDIR &&
717 !strcmp(given->pattern, "/*")) {
718 pl->full_cone = 0;
719 return;
720 }
721
722 if (!given->flags && !strcmp(given->pattern, "/*")) {
723 pl->full_cone = 1;
724 return;
725 }
726
727 if (given->patternlen < 2 ||
728 *given->pattern != '/' ||
729 strstr(given->pattern, "**")) {
730 /* Not a cone pattern. */
731 warning(_("unrecognized pattern: '%s'"), given->pattern);
732 goto clear_hashmaps;
733 }
734
735 prev = given->pattern;
736 cur = given->pattern + 1;
737 next = given->pattern + 2;
738
739 while (*cur) {
740 /* Watch for glob characters '*', '\', '[', '?' */
741 if (!is_glob_special(*cur))
742 goto increment;
743
744 /* But only if *prev != '\\' */
745 if (*prev == '\\')
746 goto increment;
747
748 /* But allow the initial '\' */
749 if (*cur == '\\' &&
750 is_glob_special(*next))
751 goto increment;
752
753 /* But a trailing '/' then '*' is fine */
754 if (*prev == '/' &&
755 *cur == '*' &&
756 *next == 0)
757 goto increment;
758
759 /* Not a cone pattern. */
760 warning(_("unrecognized pattern: '%s'"), given->pattern);
761 goto clear_hashmaps;
762
763 increment:
764 prev++;
765 cur++;
766 next++;
767 }
768
769 if (given->patternlen > 2 &&
770 !strcmp(given->pattern + given->patternlen - 2, "/*")) {
771 if (!(given->flags & PATTERN_FLAG_NEGATIVE)) {
772 /* Not a cone pattern. */
773 warning(_("unrecognized pattern: '%s'"), given->pattern);
774 goto clear_hashmaps;
775 }
776
777 truncated = dup_and_filter_pattern(given->pattern);
778
779 translated = xmalloc(sizeof(struct pattern_entry));
780 translated->pattern = truncated;
781 translated->patternlen = given->patternlen - 2;
782 hashmap_entry_init(&translated->ent,
783 fspathhash(translated->pattern));
784
785 if (!hashmap_get_entry(&pl->recursive_hashmap,
786 translated, ent, NULL)) {
787 /* We did not see the "parent" included */
788 warning(_("unrecognized negative pattern: '%s'"),
789 given->pattern);
790 free(truncated);
791 free(translated);
792 goto clear_hashmaps;
793 }
794
795 hashmap_add(&pl->parent_hashmap, &translated->ent);
796 hashmap_remove(&pl->recursive_hashmap, &translated->ent, &data);
797 free(data);
798 return;
799 }
800
801 if (given->flags & PATTERN_FLAG_NEGATIVE) {
802 warning(_("unrecognized negative pattern: '%s'"),
803 given->pattern);
804 goto clear_hashmaps;
805 }
806
807 translated = xmalloc(sizeof(struct pattern_entry));
808
809 translated->pattern = dup_and_filter_pattern(given->pattern);
810 translated->patternlen = given->patternlen;
811 hashmap_entry_init(&translated->ent,
812 fspathhash(translated->pattern));
813
814 hashmap_add(&pl->recursive_hashmap, &translated->ent);
815
816 if (hashmap_get_entry(&pl->parent_hashmap, translated, ent, NULL)) {
817 /* we already included this at the parent level */
818 warning(_("your sparse-checkout file may have issues: pattern '%s' is repeated"),
819 given->pattern);
820 goto clear_hashmaps;
821 }
822
823 return;
824
825 clear_hashmaps:
826 warning(_("disabling cone pattern matching"));
827 hashmap_clear_and_free(&pl->parent_hashmap, struct pattern_entry, ent);
828 hashmap_clear_and_free(&pl->recursive_hashmap, struct pattern_entry, ent);
829 pl->use_cone_patterns = 0;
830 }
831
832 static int hashmap_contains_path(struct hashmap *map,
833 struct strbuf *pattern)
834 {
835 struct pattern_entry p;
836
837 /* Check straight mapping */
838 p.pattern = pattern->buf;
839 p.patternlen = pattern->len;
840 hashmap_entry_init(&p.ent, fspathhash(p.pattern));
841 return !!hashmap_get_entry(map, &p, ent, NULL);
842 }
843
844 int hashmap_contains_parent(struct hashmap *map,
845 const char *path,
846 struct strbuf *buffer)
847 {
848 char *slash_pos;
849
850 strbuf_setlen(buffer, 0);
851
852 if (path[0] != '/')
853 strbuf_addch(buffer, '/');
854
855 strbuf_addstr(buffer, path);
856
857 slash_pos = strrchr(buffer->buf, '/');
858
859 while (slash_pos > buffer->buf) {
860 strbuf_setlen(buffer, slash_pos - buffer->buf);
861
862 if (hashmap_contains_path(map, buffer))
863 return 1;
864
865 slash_pos = strrchr(buffer->buf, '/');
866 }
867
868 return 0;
869 }
870
871 void add_pattern(const char *string, const char *base,
872 int baselen, struct pattern_list *pl, int srcpos)
873 {
874 struct path_pattern *pattern;
875 int patternlen;
876 unsigned flags;
877 int nowildcardlen;
878
879 parse_path_pattern(&string, &patternlen, &flags, &nowildcardlen);
880 if (flags & PATTERN_FLAG_MUSTBEDIR) {
881 FLEXPTR_ALLOC_MEM(pattern, pattern, string, patternlen);
882 } else {
883 pattern = xmalloc(sizeof(*pattern));
884 pattern->pattern = string;
885 }
886 pattern->patternlen = patternlen;
887 pattern->nowildcardlen = nowildcardlen;
888 pattern->base = base;
889 pattern->baselen = baselen;
890 pattern->flags = flags;
891 pattern->srcpos = srcpos;
892 ALLOC_GROW(pl->patterns, pl->nr + 1, pl->alloc);
893 pl->patterns[pl->nr++] = pattern;
894 pattern->pl = pl;
895
896 add_pattern_to_hashsets(pl, pattern);
897 }
898
899 static int read_skip_worktree_file_from_index(struct index_state *istate,
900 const char *path,
901 size_t *size_out, char **data_out,
902 struct oid_stat *oid_stat)
903 {
904 int pos, len;
905
906 len = strlen(path);
907 pos = index_name_pos(istate, path, len);
908 if (pos < 0)
909 return -1;
910 if (!ce_skip_worktree(istate->cache[pos]))
911 return -1;
912
913 return do_read_blob(&istate->cache[pos]->oid, oid_stat, size_out, data_out);
914 }
915
916 /*
917 * Frees memory within pl which was allocated for exclude patterns and
918 * the file buffer. Does not free pl itself.
919 */
920 void clear_pattern_list(struct pattern_list *pl)
921 {
922 int i;
923
924 for (i = 0; i < pl->nr; i++)
925 free(pl->patterns[i]);
926 free(pl->patterns);
927 free(pl->filebuf);
928 hashmap_clear_and_free(&pl->recursive_hashmap, struct pattern_entry, ent);
929 hashmap_clear_and_free(&pl->parent_hashmap, struct pattern_entry, ent);
930
931 memset(pl, 0, sizeof(*pl));
932 }
933
934 static void trim_trailing_spaces(char *buf)
935 {
936 char *p, *last_space = NULL;
937
938 for (p = buf; *p; p++)
939 switch (*p) {
940 case ' ':
941 if (!last_space)
942 last_space = p;
943 break;
944 case '\\':
945 p++;
946 if (!*p)
947 return;
948 /* fallthrough */
949 default:
950 last_space = NULL;
951 }
952
953 if (last_space)
954 *last_space = '\0';
955 }
956
957 /*
958 * Given a subdirectory name and "dir" of the current directory,
959 * search the subdir in "dir" and return it, or create a new one if it
960 * does not exist in "dir".
961 *
962 * If "name" has the trailing slash, it'll be excluded in the search.
963 */
964 static struct untracked_cache_dir *lookup_untracked(struct untracked_cache *uc,
965 struct untracked_cache_dir *dir,
966 const char *name, int len)
967 {
968 int first, last;
969 struct untracked_cache_dir *d;
970 if (!dir)
971 return NULL;
972 if (len && name[len - 1] == '/')
973 len--;
974 first = 0;
975 last = dir->dirs_nr;
976 while (last > first) {
977 int cmp, next = first + ((last - first) >> 1);
978 d = dir->dirs[next];
979 cmp = strncmp(name, d->name, len);
980 if (!cmp && strlen(d->name) > len)
981 cmp = -1;
982 if (!cmp)
983 return d;
984 if (cmp < 0) {
985 last = next;
986 continue;
987 }
988 first = next+1;
989 }
990
991 uc->dir_created++;
992 FLEX_ALLOC_MEM(d, name, name, len);
993
994 ALLOC_GROW(dir->dirs, dir->dirs_nr + 1, dir->dirs_alloc);
995 MOVE_ARRAY(dir->dirs + first + 1, dir->dirs + first,
996 dir->dirs_nr - first);
997 dir->dirs_nr++;
998 dir->dirs[first] = d;
999 return d;
1000 }
1001
1002 static void do_invalidate_gitignore(struct untracked_cache_dir *dir)
1003 {
1004 int i;
1005 dir->valid = 0;
1006 dir->untracked_nr = 0;
1007 for (i = 0; i < dir->dirs_nr; i++)
1008 do_invalidate_gitignore(dir->dirs[i]);
1009 }
1010
1011 static void invalidate_gitignore(struct untracked_cache *uc,
1012 struct untracked_cache_dir *dir)
1013 {
1014 uc->gitignore_invalidated++;
1015 do_invalidate_gitignore(dir);
1016 }
1017
1018 static void invalidate_directory(struct untracked_cache *uc,
1019 struct untracked_cache_dir *dir)
1020 {
1021 int i;
1022
1023 /*
1024 * Invalidation increment here is just roughly correct. If
1025 * untracked_nr or any of dirs[].recurse is non-zero, we
1026 * should increment dir_invalidated too. But that's more
1027 * expensive to do.
1028 */
1029 if (dir->valid)
1030 uc->dir_invalidated++;
1031
1032 dir->valid = 0;
1033 dir->untracked_nr = 0;
1034 for (i = 0; i < dir->dirs_nr; i++)
1035 dir->dirs[i]->recurse = 0;
1036 }
1037
1038 static int add_patterns_from_buffer(char *buf, size_t size,
1039 const char *base, int baselen,
1040 struct pattern_list *pl);
1041
1042 /* Flags for add_patterns() */
1043 #define PATTERN_NOFOLLOW (1<<0)
1044
1045 /*
1046 * Given a file with name "fname", read it (either from disk, or from
1047 * an index if 'istate' is non-null), parse it and store the
1048 * exclude rules in "pl".
1049 *
1050 * If "oid_stat" is not NULL, compute oid of the exclude file and fill
1051 * stat data from disk (only valid if add_patterns returns zero). If
1052 * oid_stat.valid is non-zero, "oid_stat" must contain good value as input.
1053 */
1054 static int add_patterns(const char *fname, const char *base, int baselen,
1055 struct pattern_list *pl, struct index_state *istate,
1056 unsigned flags, struct oid_stat *oid_stat)
1057 {
1058 struct stat st;
1059 int r;
1060 int fd;
1061 size_t size = 0;
1062 char *buf;
1063
1064 if (flags & PATTERN_NOFOLLOW)
1065 fd = open_nofollow(fname, O_RDONLY);
1066 else
1067 fd = open(fname, O_RDONLY);
1068
1069 if (fd < 0 || fstat(fd, &st) < 0) {
1070 if (fd < 0)
1071 warn_on_fopen_errors(fname);
1072 else
1073 close(fd);
1074 if (!istate)
1075 return -1;
1076 r = read_skip_worktree_file_from_index(istate, fname,
1077 &size, &buf,
1078 oid_stat);
1079 if (r != 1)
1080 return r;
1081 } else {
1082 size = xsize_t(st.st_size);
1083 if (size == 0) {
1084 if (oid_stat) {
1085 fill_stat_data(&oid_stat->stat, &st);
1086 oidcpy(&oid_stat->oid, the_hash_algo->empty_blob);
1087 oid_stat->valid = 1;
1088 }
1089 close(fd);
1090 return 0;
1091 }
1092 buf = xmallocz(size);
1093 if (read_in_full(fd, buf, size) != size) {
1094 free(buf);
1095 close(fd);
1096 return -1;
1097 }
1098 buf[size++] = '\n';
1099 close(fd);
1100 if (oid_stat) {
1101 int pos;
1102 if (oid_stat->valid &&
1103 !match_stat_data_racy(istate, &oid_stat->stat, &st))
1104 ; /* no content change, oid_stat->oid still good */
1105 else if (istate &&
1106 (pos = index_name_pos(istate, fname, strlen(fname))) >= 0 &&
1107 !ce_stage(istate->cache[pos]) &&
1108 ce_uptodate(istate->cache[pos]) &&
1109 !would_convert_to_git(istate, fname))
1110 oidcpy(&oid_stat->oid,
1111 &istate->cache[pos]->oid);
1112 else
1113 hash_object_file(the_hash_algo, buf, size,
1114 OBJ_BLOB, &oid_stat->oid);
1115 fill_stat_data(&oid_stat->stat, &st);
1116 oid_stat->valid = 1;
1117 }
1118 }
1119
1120 add_patterns_from_buffer(buf, size, base, baselen, pl);
1121 return 0;
1122 }
1123
1124 static int add_patterns_from_buffer(char *buf, size_t size,
1125 const char *base, int baselen,
1126 struct pattern_list *pl)
1127 {
1128 int i, lineno = 1;
1129 char *entry;
1130
1131 hashmap_init(&pl->recursive_hashmap, pl_hashmap_cmp, NULL, 0);
1132 hashmap_init(&pl->parent_hashmap, pl_hashmap_cmp, NULL, 0);
1133
1134 pl->filebuf = buf;
1135
1136 if (skip_utf8_bom(&buf, size))
1137 size -= buf - pl->filebuf;
1138
1139 entry = buf;
1140
1141 for (i = 0; i < size; i++) {
1142 if (buf[i] == '\n') {
1143 if (entry != buf + i && entry[0] != '#') {
1144 buf[i - (i && buf[i-1] == '\r')] = 0;
1145 trim_trailing_spaces(entry);
1146 add_pattern(entry, base, baselen, pl, lineno);
1147 }
1148 lineno++;
1149 entry = buf + i + 1;
1150 }
1151 }
1152 return 0;
1153 }
1154
1155 int add_patterns_from_file_to_list(const char *fname, const char *base,
1156 int baselen, struct pattern_list *pl,
1157 struct index_state *istate,
1158 unsigned flags)
1159 {
1160 return add_patterns(fname, base, baselen, pl, istate, flags, NULL);
1161 }
1162
1163 int add_patterns_from_blob_to_list(
1164 struct object_id *oid,
1165 const char *base, int baselen,
1166 struct pattern_list *pl)
1167 {
1168 char *buf;
1169 size_t size;
1170 int r;
1171
1172 r = do_read_blob(oid, NULL, &size, &buf);
1173 if (r != 1)
1174 return r;
1175
1176 add_patterns_from_buffer(buf, size, base, baselen, pl);
1177 return 0;
1178 }
1179
1180 struct pattern_list *add_pattern_list(struct dir_struct *dir,
1181 int group_type, const char *src)
1182 {
1183 struct pattern_list *pl;
1184 struct exclude_list_group *group;
1185
1186 group = &dir->exclude_list_group[group_type];
1187 ALLOC_GROW(group->pl, group->nr + 1, group->alloc);
1188 pl = &group->pl[group->nr++];
1189 memset(pl, 0, sizeof(*pl));
1190 pl->src = src;
1191 return pl;
1192 }
1193
1194 /*
1195 * Used to set up core.excludesfile and .git/info/exclude lists.
1196 */
1197 static void add_patterns_from_file_1(struct dir_struct *dir, const char *fname,
1198 struct oid_stat *oid_stat)
1199 {
1200 struct pattern_list *pl;
1201 /*
1202 * catch setup_standard_excludes() that's called before
1203 * dir->untracked is assigned. That function behaves
1204 * differently when dir->untracked is non-NULL.
1205 */
1206 if (!dir->untracked)
1207 dir->unmanaged_exclude_files++;
1208 pl = add_pattern_list(dir, EXC_FILE, fname);
1209 if (add_patterns(fname, "", 0, pl, NULL, 0, oid_stat) < 0)
1210 die(_("cannot use %s as an exclude file"), fname);
1211 }
1212
1213 void add_patterns_from_file(struct dir_struct *dir, const char *fname)
1214 {
1215 dir->unmanaged_exclude_files++; /* see validate_untracked_cache() */
1216 add_patterns_from_file_1(dir, fname, NULL);
1217 }
1218
1219 int match_basename(const char *basename, int basenamelen,
1220 const char *pattern, int prefix, int patternlen,
1221 unsigned flags)
1222 {
1223 if (prefix == patternlen) {
1224 if (patternlen == basenamelen &&
1225 !fspathncmp(pattern, basename, basenamelen))
1226 return 1;
1227 } else if (flags & PATTERN_FLAG_ENDSWITH) {
1228 /* "*literal" matching against "fooliteral" */
1229 if (patternlen - 1 <= basenamelen &&
1230 !fspathncmp(pattern + 1,
1231 basename + basenamelen - (patternlen - 1),
1232 patternlen - 1))
1233 return 1;
1234 } else {
1235 if (fnmatch_icase_mem(pattern, patternlen,
1236 basename, basenamelen,
1237 0) == 0)
1238 return 1;
1239 }
1240 return 0;
1241 }
1242
1243 int match_pathname(const char *pathname, int pathlen,
1244 const char *base, int baselen,
1245 const char *pattern, int prefix, int patternlen)
1246 {
1247 const char *name;
1248 int namelen;
1249
1250 /*
1251 * match with FNM_PATHNAME; the pattern has base implicitly
1252 * in front of it.
1253 */
1254 if (*pattern == '/') {
1255 pattern++;
1256 patternlen--;
1257 prefix--;
1258 }
1259
1260 /*
1261 * baselen does not count the trailing slash. base[] may or
1262 * may not end with a trailing slash though.
1263 */
1264 if (pathlen < baselen + 1 ||
1265 (baselen && pathname[baselen] != '/') ||
1266 fspathncmp(pathname, base, baselen))
1267 return 0;
1268
1269 namelen = baselen ? pathlen - baselen - 1 : pathlen;
1270 name = pathname + pathlen - namelen;
1271
1272 if (prefix) {
1273 /*
1274 * if the non-wildcard part is longer than the
1275 * remaining pathname, surely it cannot match.
1276 */
1277 if (prefix > namelen)
1278 return 0;
1279
1280 if (fspathncmp(pattern, name, prefix))
1281 return 0;
1282 pattern += prefix;
1283 patternlen -= prefix;
1284 name += prefix;
1285 namelen -= prefix;
1286
1287 /*
1288 * If the whole pattern did not have a wildcard,
1289 * then our prefix match is all we need; we
1290 * do not need to call fnmatch at all.
1291 */
1292 if (!patternlen && !namelen)
1293 return 1;
1294 }
1295
1296 return fnmatch_icase_mem(pattern, patternlen,
1297 name, namelen,
1298 WM_PATHNAME) == 0;
1299 }
1300
1301 /*
1302 * Scan the given exclude list in reverse to see whether pathname
1303 * should be ignored. The first match (i.e. the last on the list), if
1304 * any, determines the fate. Returns the exclude_list element which
1305 * matched, or NULL for undecided.
1306 */
1307 static struct path_pattern *last_matching_pattern_from_list(const char *pathname,
1308 int pathlen,
1309 const char *basename,
1310 int *dtype,
1311 struct pattern_list *pl,
1312 struct index_state *istate)
1313 {
1314 struct path_pattern *res = NULL; /* undecided */
1315 int i;
1316
1317 if (!pl->nr)
1318 return NULL; /* undefined */
1319
1320 for (i = pl->nr - 1; 0 <= i; i--) {
1321 struct path_pattern *pattern = pl->patterns[i];
1322 const char *exclude = pattern->pattern;
1323 int prefix = pattern->nowildcardlen;
1324
1325 if (pattern->flags & PATTERN_FLAG_MUSTBEDIR) {
1326 *dtype = resolve_dtype(*dtype, istate, pathname, pathlen);
1327 if (*dtype != DT_DIR)
1328 continue;
1329 }
1330
1331 if (pattern->flags & PATTERN_FLAG_NODIR) {
1332 if (match_basename(basename,
1333 pathlen - (basename - pathname),
1334 exclude, prefix, pattern->patternlen,
1335 pattern->flags)) {
1336 res = pattern;
1337 break;
1338 }
1339 continue;
1340 }
1341
1342 assert(pattern->baselen == 0 ||
1343 pattern->base[pattern->baselen - 1] == '/');
1344 if (match_pathname(pathname, pathlen,
1345 pattern->base,
1346 pattern->baselen ? pattern->baselen - 1 : 0,
1347 exclude, prefix, pattern->patternlen)) {
1348 res = pattern;
1349 break;
1350 }
1351 }
1352 return res;
1353 }
1354
1355 /*
1356 * Scan the list of patterns to determine if the ordered list
1357 * of patterns matches on 'pathname'.
1358 *
1359 * Return 1 for a match, 0 for not matched and -1 for undecided.
1360 */
1361 enum pattern_match_result path_matches_pattern_list(
1362 const char *pathname, int pathlen,
1363 const char *basename, int *dtype,
1364 struct pattern_list *pl,
1365 struct index_state *istate)
1366 {
1367 struct path_pattern *pattern;
1368 struct strbuf parent_pathname = STRBUF_INIT;
1369 int result = NOT_MATCHED;
1370 size_t slash_pos;
1371
1372 if (!pl->use_cone_patterns) {
1373 pattern = last_matching_pattern_from_list(pathname, pathlen, basename,
1374 dtype, pl, istate);
1375 if (pattern) {
1376 if (pattern->flags & PATTERN_FLAG_NEGATIVE)
1377 return NOT_MATCHED;
1378 else
1379 return MATCHED;
1380 }
1381
1382 return UNDECIDED;
1383 }
1384
1385 if (pl->full_cone)
1386 return MATCHED;
1387
1388 strbuf_addch(&parent_pathname, '/');
1389 strbuf_add(&parent_pathname, pathname, pathlen);
1390
1391 /*
1392 * Directory entries are matched if and only if a file
1393 * contained immediately within them is matched. For the
1394 * case of a directory entry, modify the path to create
1395 * a fake filename within this directory, allowing us to
1396 * use the file-base matching logic in an equivalent way.
1397 */
1398 if (parent_pathname.len > 0 &&
1399 parent_pathname.buf[parent_pathname.len - 1] == '/') {
1400 slash_pos = parent_pathname.len - 1;
1401 strbuf_add(&parent_pathname, "-", 1);
1402 } else {
1403 const char *slash_ptr = strrchr(parent_pathname.buf, '/');
1404 slash_pos = slash_ptr ? slash_ptr - parent_pathname.buf : 0;
1405 }
1406
1407 if (hashmap_contains_path(&pl->recursive_hashmap,
1408 &parent_pathname)) {
1409 result = MATCHED_RECURSIVE;
1410 goto done;
1411 }
1412
1413 if (!slash_pos) {
1414 /* include every file in root */
1415 result = MATCHED;
1416 goto done;
1417 }
1418
1419 strbuf_setlen(&parent_pathname, slash_pos);
1420
1421 if (hashmap_contains_path(&pl->parent_hashmap, &parent_pathname)) {
1422 result = MATCHED;
1423 goto done;
1424 }
1425
1426 if (hashmap_contains_parent(&pl->recursive_hashmap,
1427 pathname,
1428 &parent_pathname))
1429 result = MATCHED_RECURSIVE;
1430
1431 done:
1432 strbuf_release(&parent_pathname);
1433 return result;
1434 }
1435
1436 int init_sparse_checkout_patterns(struct index_state *istate)
1437 {
1438 if (!core_apply_sparse_checkout)
1439 return 1;
1440 if (istate->sparse_checkout_patterns)
1441 return 0;
1442
1443 CALLOC_ARRAY(istate->sparse_checkout_patterns, 1);
1444
1445 if (get_sparse_checkout_patterns(istate->sparse_checkout_patterns) < 0) {
1446 FREE_AND_NULL(istate->sparse_checkout_patterns);
1447 return -1;
1448 }
1449
1450 return 0;
1451 }
1452
1453 static int path_in_sparse_checkout_1(const char *path,
1454 struct index_state *istate,
1455 int require_cone_mode)
1456 {
1457 int dtype = DT_REG;
1458 enum pattern_match_result match = UNDECIDED;
1459 const char *end, *slash;
1460
1461 /*
1462 * We default to accepting a path if the path is empty, there are no
1463 * patterns, or the patterns are of the wrong type.
1464 */
1465 if (!*path ||
1466 init_sparse_checkout_patterns(istate) ||
1467 (require_cone_mode &&
1468 !istate->sparse_checkout_patterns->use_cone_patterns))
1469 return 1;
1470
1471 /*
1472 * If UNDECIDED, use the match from the parent dir (recursively), or
1473 * fall back to NOT_MATCHED at the topmost level. Note that cone mode
1474 * never returns UNDECIDED, so we will execute only one iteration in
1475 * this case.
1476 */
1477 for (end = path + strlen(path);
1478 end > path && match == UNDECIDED;
1479 end = slash) {
1480
1481 for (slash = end - 1; slash > path && *slash != '/'; slash--)
1482 ; /* do nothing */
1483
1484 match = path_matches_pattern_list(path, end - path,
1485 slash > path ? slash + 1 : path, &dtype,
1486 istate->sparse_checkout_patterns, istate);
1487
1488 /* We are going to match the parent dir now */
1489 dtype = DT_DIR;
1490 }
1491 return match > 0;
1492 }
1493
1494 int path_in_sparse_checkout(const char *path,
1495 struct index_state *istate)
1496 {
1497 return path_in_sparse_checkout_1(path, istate, 0);
1498 }
1499
1500 int path_in_cone_mode_sparse_checkout(const char *path,
1501 struct index_state *istate)
1502 {
1503 return path_in_sparse_checkout_1(path, istate, 1);
1504 }
1505
1506 static struct path_pattern *last_matching_pattern_from_lists(
1507 struct dir_struct *dir, struct index_state *istate,
1508 const char *pathname, int pathlen,
1509 const char *basename, int *dtype_p)
1510 {
1511 int i, j;
1512 struct exclude_list_group *group;
1513 struct path_pattern *pattern;
1514 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
1515 group = &dir->exclude_list_group[i];
1516 for (j = group->nr - 1; j >= 0; j--) {
1517 pattern = last_matching_pattern_from_list(
1518 pathname, pathlen, basename, dtype_p,
1519 &group->pl[j], istate);
1520 if (pattern)
1521 return pattern;
1522 }
1523 }
1524 return NULL;
1525 }
1526
1527 /*
1528 * Loads the per-directory exclude list for the substring of base
1529 * which has a char length of baselen.
1530 */
1531 static void prep_exclude(struct dir_struct *dir,
1532 struct index_state *istate,
1533 const char *base, int baselen)
1534 {
1535 struct exclude_list_group *group;
1536 struct pattern_list *pl;
1537 struct exclude_stack *stk = NULL;
1538 struct untracked_cache_dir *untracked;
1539 int current;
1540
1541 group = &dir->exclude_list_group[EXC_DIRS];
1542
1543 /*
1544 * Pop the exclude lists from the EXCL_DIRS exclude_list_group
1545 * which originate from directories not in the prefix of the
1546 * path being checked.
1547 */
1548 while ((stk = dir->exclude_stack) != NULL) {
1549 if (stk->baselen <= baselen &&
1550 !strncmp(dir->basebuf.buf, base, stk->baselen))
1551 break;
1552 pl = &group->pl[dir->exclude_stack->exclude_ix];
1553 dir->exclude_stack = stk->prev;
1554 dir->pattern = NULL;
1555 free((char *)pl->src); /* see strbuf_detach() below */
1556 clear_pattern_list(pl);
1557 free(stk);
1558 group->nr--;
1559 }
1560
1561 /* Skip traversing into sub directories if the parent is excluded */
1562 if (dir->pattern)
1563 return;
1564
1565 /*
1566 * Lazy initialization. All call sites currently just
1567 * memset(dir, 0, sizeof(*dir)) before use. Changing all of
1568 * them seems lots of work for little benefit.
1569 */
1570 if (!dir->basebuf.buf)
1571 strbuf_init(&dir->basebuf, PATH_MAX);
1572
1573 /* Read from the parent directories and push them down. */
1574 current = stk ? stk->baselen : -1;
1575 strbuf_setlen(&dir->basebuf, current < 0 ? 0 : current);
1576 if (dir->untracked)
1577 untracked = stk ? stk->ucd : dir->untracked->root;
1578 else
1579 untracked = NULL;
1580
1581 while (current < baselen) {
1582 const char *cp;
1583 struct oid_stat oid_stat;
1584
1585 CALLOC_ARRAY(stk, 1);
1586 if (current < 0) {
1587 cp = base;
1588 current = 0;
1589 } else {
1590 cp = strchr(base + current + 1, '/');
1591 if (!cp)
1592 die("oops in prep_exclude");
1593 cp++;
1594 untracked =
1595 lookup_untracked(dir->untracked, untracked,
1596 base + current,
1597 cp - base - current);
1598 }
1599 stk->prev = dir->exclude_stack;
1600 stk->baselen = cp - base;
1601 stk->exclude_ix = group->nr;
1602 stk->ucd = untracked;
1603 pl = add_pattern_list(dir, EXC_DIRS, NULL);
1604 strbuf_add(&dir->basebuf, base + current, stk->baselen - current);
1605 assert(stk->baselen == dir->basebuf.len);
1606
1607 /* Abort if the directory is excluded */
1608 if (stk->baselen) {
1609 int dt = DT_DIR;
1610 dir->basebuf.buf[stk->baselen - 1] = 0;
1611 dir->pattern = last_matching_pattern_from_lists(dir,
1612 istate,
1613 dir->basebuf.buf, stk->baselen - 1,
1614 dir->basebuf.buf + current, &dt);
1615 dir->basebuf.buf[stk->baselen - 1] = '/';
1616 if (dir->pattern &&
1617 dir->pattern->flags & PATTERN_FLAG_NEGATIVE)
1618 dir->pattern = NULL;
1619 if (dir->pattern) {
1620 dir->exclude_stack = stk;
1621 return;
1622 }
1623 }
1624
1625 /* Try to read per-directory file */
1626 oidclr(&oid_stat.oid);
1627 oid_stat.valid = 0;
1628 if (dir->exclude_per_dir &&
1629 /*
1630 * If we know that no files have been added in
1631 * this directory (i.e. valid_cached_dir() has
1632 * been executed and set untracked->valid) ..
1633 */
1634 (!untracked || !untracked->valid ||
1635 /*
1636 * .. and .gitignore does not exist before
1637 * (i.e. null exclude_oid). Then we can skip
1638 * loading .gitignore, which would result in
1639 * ENOENT anyway.
1640 */
1641 !is_null_oid(&untracked->exclude_oid))) {
1642 /*
1643 * dir->basebuf gets reused by the traversal, but we
1644 * need fname to remain unchanged to ensure the src
1645 * member of each struct path_pattern correctly
1646 * back-references its source file. Other invocations
1647 * of add_pattern_list provide stable strings, so we
1648 * strbuf_detach() and free() here in the caller.
1649 */
1650 struct strbuf sb = STRBUF_INIT;
1651 strbuf_addbuf(&sb, &dir->basebuf);
1652 strbuf_addstr(&sb, dir->exclude_per_dir);
1653 pl->src = strbuf_detach(&sb, NULL);
1654 add_patterns(pl->src, pl->src, stk->baselen, pl, istate,
1655 PATTERN_NOFOLLOW,
1656 untracked ? &oid_stat : NULL);
1657 }
1658 /*
1659 * NEEDSWORK: when untracked cache is enabled, prep_exclude()
1660 * will first be called in valid_cached_dir() then maybe many
1661 * times more in last_matching_pattern(). When the cache is
1662 * used, last_matching_pattern() will not be called and
1663 * reading .gitignore content will be a waste.
1664 *
1665 * So when it's called by valid_cached_dir() and we can get
1666 * .gitignore SHA-1 from the index (i.e. .gitignore is not
1667 * modified on work tree), we could delay reading the
1668 * .gitignore content until we absolutely need it in
1669 * last_matching_pattern(). Be careful about ignore rule
1670 * order, though, if you do that.
1671 */
1672 if (untracked &&
1673 !oideq(&oid_stat.oid, &untracked->exclude_oid)) {
1674 invalidate_gitignore(dir->untracked, untracked);
1675 oidcpy(&untracked->exclude_oid, &oid_stat.oid);
1676 }
1677 dir->exclude_stack = stk;
1678 current = stk->baselen;
1679 }
1680 strbuf_setlen(&dir->basebuf, baselen);
1681 }
1682
1683 /*
1684 * Loads the exclude lists for the directory containing pathname, then
1685 * scans all exclude lists to determine whether pathname is excluded.
1686 * Returns the exclude_list element which matched, or NULL for
1687 * undecided.
1688 */
1689 struct path_pattern *last_matching_pattern(struct dir_struct *dir,
1690 struct index_state *istate,
1691 const char *pathname,
1692 int *dtype_p)
1693 {
1694 int pathlen = strlen(pathname);
1695 const char *basename = strrchr(pathname, '/');
1696 basename = (basename) ? basename+1 : pathname;
1697
1698 prep_exclude(dir, istate, pathname, basename-pathname);
1699
1700 if (dir->pattern)
1701 return dir->pattern;
1702
1703 return last_matching_pattern_from_lists(dir, istate, pathname, pathlen,
1704 basename, dtype_p);
1705 }
1706
1707 /*
1708 * Loads the exclude lists for the directory containing pathname, then
1709 * scans all exclude lists to determine whether pathname is excluded.
1710 * Returns 1 if true, otherwise 0.
1711 */
1712 int is_excluded(struct dir_struct *dir, struct index_state *istate,
1713 const char *pathname, int *dtype_p)
1714 {
1715 struct path_pattern *pattern =
1716 last_matching_pattern(dir, istate, pathname, dtype_p);
1717 if (pattern)
1718 return pattern->flags & PATTERN_FLAG_NEGATIVE ? 0 : 1;
1719 return 0;
1720 }
1721
1722 static struct dir_entry *dir_entry_new(const char *pathname, int len)
1723 {
1724 struct dir_entry *ent;
1725
1726 FLEX_ALLOC_MEM(ent, name, pathname, len);
1727 ent->len = len;
1728 return ent;
1729 }
1730
1731 static struct dir_entry *dir_add_name(struct dir_struct *dir,
1732 struct index_state *istate,
1733 const char *pathname, int len)
1734 {
1735 if (index_file_exists(istate, pathname, len, ignore_case))
1736 return NULL;
1737
1738 ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc);
1739 return dir->entries[dir->nr++] = dir_entry_new(pathname, len);
1740 }
1741
1742 struct dir_entry *dir_add_ignored(struct dir_struct *dir,
1743 struct index_state *istate,
1744 const char *pathname, int len)
1745 {
1746 if (!index_name_is_other(istate, pathname, len))
1747 return NULL;
1748
1749 ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc);
1750 return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);
1751 }
1752
1753 enum exist_status {
1754 index_nonexistent = 0,
1755 index_directory,
1756 index_gitdir
1757 };
1758
1759 /*
1760 * Do not use the alphabetically sorted index to look up
1761 * the directory name; instead, use the case insensitive
1762 * directory hash.
1763 */
1764 static enum exist_status directory_exists_in_index_icase(struct index_state *istate,
1765 const char *dirname, int len)
1766 {
1767 struct cache_entry *ce;
1768
1769 if (index_dir_exists(istate, dirname, len))
1770 return index_directory;
1771
1772 ce = index_file_exists(istate, dirname, len, ignore_case);
1773 if (ce && S_ISGITLINK(ce->ce_mode))
1774 return index_gitdir;
1775
1776 return index_nonexistent;
1777 }
1778
1779 /*
1780 * The index sorts alphabetically by entry name, which
1781 * means that a gitlink sorts as '\0' at the end, while
1782 * a directory (which is defined not as an entry, but as
1783 * the files it contains) will sort with the '/' at the
1784 * end.
1785 */
1786 static enum exist_status directory_exists_in_index(struct index_state *istate,
1787 const char *dirname, int len)
1788 {
1789 int pos;
1790
1791 if (ignore_case)
1792 return directory_exists_in_index_icase(istate, dirname, len);
1793
1794 pos = index_name_pos(istate, dirname, len);
1795 if (pos < 0)
1796 pos = -pos-1;
1797 while (pos < istate->cache_nr) {
1798 const struct cache_entry *ce = istate->cache[pos++];
1799 unsigned char endchar;
1800
1801 if (strncmp(ce->name, dirname, len))
1802 break;
1803 endchar = ce->name[len];
1804 if (endchar > '/')
1805 break;
1806 if (endchar == '/')
1807 return index_directory;
1808 if (!endchar && S_ISGITLINK(ce->ce_mode))
1809 return index_gitdir;
1810 }
1811 return index_nonexistent;
1812 }
1813
1814 /*
1815 * When we find a directory when traversing the filesystem, we
1816 * have three distinct cases:
1817 *
1818 * - ignore it
1819 * - see it as a directory
1820 * - recurse into it
1821 *
1822 * and which one we choose depends on a combination of existing
1823 * git index contents and the flags passed into the directory
1824 * traversal routine.
1825 *
1826 * Case 1: If we *already* have entries in the index under that
1827 * directory name, we always recurse into the directory to see
1828 * all the files.
1829 *
1830 * Case 2: If we *already* have that directory name as a gitlink,
1831 * we always continue to see it as a gitlink, regardless of whether
1832 * there is an actual git directory there or not (it might not
1833 * be checked out as a subproject!)
1834 *
1835 * Case 3: if we didn't have it in the index previously, we
1836 * have a few sub-cases:
1837 *
1838 * (a) if DIR_SHOW_OTHER_DIRECTORIES flag is set, we show it as
1839 * just a directory, unless DIR_HIDE_EMPTY_DIRECTORIES is
1840 * also true, in which case we need to check if it contains any
1841 * untracked and / or ignored files.
1842 * (b) if it looks like a git directory and we don't have the
1843 * DIR_NO_GITLINKS flag, then we treat it as a gitlink, and
1844 * show it as a directory.
1845 * (c) otherwise, we recurse into it.
1846 */
1847 static enum path_treatment treat_directory(struct dir_struct *dir,
1848 struct index_state *istate,
1849 struct untracked_cache_dir *untracked,
1850 const char *dirname, int len, int baselen, int excluded,
1851 const struct pathspec *pathspec)
1852 {
1853 /*
1854 * WARNING: From this function, you can return path_recurse or you
1855 * can call read_directory_recursive() (or neither), but
1856 * you CAN'T DO BOTH.
1857 */
1858 enum path_treatment state;
1859 int matches_how = 0;
1860 int check_only, stop_early;
1861 int old_ignored_nr, old_untracked_nr;
1862 /* The "len-1" is to strip the final '/' */
1863 enum exist_status status = directory_exists_in_index(istate, dirname, len-1);
1864
1865 if (status == index_directory)
1866 return path_recurse;
1867 if (status == index_gitdir)
1868 return path_none;
1869 if (status != index_nonexistent)
1870 BUG("Unhandled value for directory_exists_in_index: %d\n", status);
1871
1872 /*
1873 * We don't want to descend into paths that don't match the necessary
1874 * patterns. Clearly, if we don't have a pathspec, then we can't check
1875 * for matching patterns. Also, if (excluded) then we know we matched
1876 * the exclusion patterns so as an optimization we can skip checking
1877 * for matching patterns.
1878 */
1879 if (pathspec && !excluded) {
1880 matches_how = match_pathspec_with_flags(istate, pathspec,
1881 dirname, len,
1882 0 /* prefix */,
1883 NULL /* seen */,
1884 DO_MATCH_LEADING_PATHSPEC);
1885 if (!matches_how)
1886 return path_none;
1887 }
1888
1889
1890 if ((dir->flags & DIR_SKIP_NESTED_GIT) ||
1891 !(dir->flags & DIR_NO_GITLINKS)) {
1892 /*
1893 * Determine if `dirname` is a nested repo by confirming that:
1894 * 1) we are in a nonbare repository, and
1895 * 2) `dirname` is not an immediate parent of `the_repository->gitdir`,
1896 * which could occur if the git_dir or worktree location was
1897 * manually configured by the user; see t2205 testcases 1-3 for
1898 * examples where this matters
1899 */
1900 int nested_repo;
1901 struct strbuf sb = STRBUF_INIT;
1902 strbuf_addstr(&sb, dirname);
1903 nested_repo = is_nonbare_repository_dir(&sb);
1904
1905 if (nested_repo) {
1906 char *real_dirname, *real_gitdir;
1907 strbuf_addstr(&sb, ".git");
1908 real_dirname = real_pathdup(sb.buf, 1);
1909 real_gitdir = real_pathdup(the_repository->gitdir, 1);
1910
1911 nested_repo = !!strcmp(real_dirname, real_gitdir);
1912 free(real_gitdir);
1913 free(real_dirname);
1914 }
1915 strbuf_release(&sb);
1916
1917 if (nested_repo) {
1918 if ((dir->flags & DIR_SKIP_NESTED_GIT) ||
1919 (matches_how == MATCHED_RECURSIVELY_LEADING_PATHSPEC))
1920 return path_none;
1921 return excluded ? path_excluded : path_untracked;
1922 }
1923 }
1924
1925 if (!(dir->flags & DIR_SHOW_OTHER_DIRECTORIES)) {
1926 if (excluded &&
1927 (dir->flags & DIR_SHOW_IGNORED_TOO) &&
1928 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING)) {
1929
1930 /*
1931 * This is an excluded directory and we are
1932 * showing ignored paths that match an exclude
1933 * pattern. (e.g. show directory as ignored
1934 * only if it matches an exclude pattern).
1935 * This path will either be 'path_excluded`
1936 * (if we are showing empty directories or if
1937 * the directory is not empty), or will be
1938 * 'path_none' (empty directory, and we are
1939 * not showing empty directories).
1940 */
1941 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
1942 return path_excluded;
1943
1944 if (read_directory_recursive(dir, istate, dirname, len,
1945 untracked, 1, 1, pathspec) == path_excluded)
1946 return path_excluded;
1947
1948 return path_none;
1949 }
1950 return path_recurse;
1951 }
1952
1953 assert(dir->flags & DIR_SHOW_OTHER_DIRECTORIES);
1954
1955 /*
1956 * If we have a pathspec which could match something _below_ this
1957 * directory (e.g. when checking 'subdir/' having a pathspec like
1958 * 'subdir/some/deep/path/file' or 'subdir/widget-*.c'), then we
1959 * need to recurse.
1960 */
1961 if (matches_how == MATCHED_RECURSIVELY_LEADING_PATHSPEC)
1962 return path_recurse;
1963
1964 /* Special cases for where this directory is excluded/ignored */
1965 if (excluded) {
1966 /*
1967 * If DIR_SHOW_OTHER_DIRECTORIES is set and we're not
1968 * hiding empty directories, there is no need to
1969 * recurse into an ignored directory.
1970 */
1971 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
1972 return path_excluded;
1973
1974 /*
1975 * Even if we are hiding empty directories, we can still avoid
1976 * recursing into ignored directories for DIR_SHOW_IGNORED_TOO
1977 * if DIR_SHOW_IGNORED_TOO_MODE_MATCHING is also set.
1978 */
1979 if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
1980 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING))
1981 return path_excluded;
1982 }
1983
1984 /*
1985 * Other than the path_recurse case above, we only need to
1986 * recurse into untracked directories if any of the following
1987 * bits is set:
1988 * - DIR_SHOW_IGNORED (because then we need to determine if
1989 * there are ignored entries below)
1990 * - DIR_SHOW_IGNORED_TOO (same as above)
1991 * - DIR_HIDE_EMPTY_DIRECTORIES (because we have to determine if
1992 * the directory is empty)
1993 */
1994 if (!excluded &&
1995 !(dir->flags & (DIR_SHOW_IGNORED |
1996 DIR_SHOW_IGNORED_TOO |
1997 DIR_HIDE_EMPTY_DIRECTORIES))) {
1998 return path_untracked;
1999 }
2000
2001 /*
2002 * Even if we don't want to know all the paths under an untracked or
2003 * ignored directory, we may still need to go into the directory to
2004 * determine if it is empty (because with DIR_HIDE_EMPTY_DIRECTORIES,
2005 * an empty directory should be path_none instead of path_excluded or
2006 * path_untracked).
2007 */
2008 check_only = ((dir->flags & DIR_HIDE_EMPTY_DIRECTORIES) &&
2009 !(dir->flags & DIR_SHOW_IGNORED_TOO));
2010
2011 /*
2012 * However, there's another optimization possible as a subset of
2013 * check_only, based on the cases we have to consider:
2014 * A) Directory matches no exclude patterns:
2015 * * Directory is empty => path_none
2016 * * Directory has an untracked file under it => path_untracked
2017 * * Directory has only ignored files under it => path_excluded
2018 * B) Directory matches an exclude pattern:
2019 * * Directory is empty => path_none
2020 * * Directory has an untracked file under it => path_excluded
2021 * * Directory has only ignored files under it => path_excluded
2022 * In case A, we can exit as soon as we've found an untracked
2023 * file but otherwise have to walk all files. In case B, though,
2024 * we can stop at the first file we find under the directory.
2025 */
2026 stop_early = check_only && excluded;
2027
2028 /*
2029 * If /every/ file within an untracked directory is ignored, then
2030 * we want to treat the directory as ignored (for e.g. status
2031 * --porcelain), without listing the individual ignored files
2032 * underneath. To do so, we'll save the current ignored_nr, and
2033 * pop all the ones added after it if it turns out the entire
2034 * directory is ignored. Also, when DIR_SHOW_IGNORED_TOO and
2035 * !DIR_KEEP_UNTRACKED_CONTENTS then we don't want to show
2036 * untracked paths so will need to pop all those off the last
2037 * after we traverse.
2038 */
2039 old_ignored_nr = dir->ignored_nr;
2040 old_untracked_nr = dir->nr;
2041
2042 /* Actually recurse into dirname now, we'll fixup the state later. */
2043 untracked = lookup_untracked(dir->untracked, untracked,
2044 dirname + baselen, len - baselen);
2045 state = read_directory_recursive(dir, istate, dirname, len, untracked,
2046 check_only, stop_early, pathspec);
2047
2048 /* There are a variety of reasons we may need to fixup the state... */
2049 if (state == path_excluded) {
2050 /* state == path_excluded implies all paths under
2051 * dirname were ignored...
2052 *
2053 * if running e.g. `git status --porcelain --ignored=matching`,
2054 * then we want to see the subpaths that are ignored.
2055 *
2056 * if running e.g. just `git status --porcelain`, then
2057 * we just want the directory itself to be listed as ignored
2058 * and not the individual paths underneath.
2059 */
2060 int want_ignored_subpaths =
2061 ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
2062 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING));
2063
2064 if (want_ignored_subpaths) {
2065 /*
2066 * with --ignored=matching, we want the subpaths
2067 * INSTEAD of the directory itself.
2068 */
2069 state = path_none;
2070 } else {
2071 int i;
2072 for (i = old_ignored_nr + 1; i<dir->ignored_nr; ++i)
2073 FREE_AND_NULL(dir->ignored[i]);
2074 dir->ignored_nr = old_ignored_nr;
2075 }
2076 }
2077
2078 /*
2079 * We may need to ignore some of the untracked paths we found while
2080 * traversing subdirectories.
2081 */
2082 if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
2083 !(dir->flags & DIR_KEEP_UNTRACKED_CONTENTS)) {
2084 int i;
2085 for (i = old_untracked_nr + 1; i<dir->nr; ++i)
2086 FREE_AND_NULL(dir->entries[i]);
2087 dir->nr = old_untracked_nr;
2088 }
2089
2090 /*
2091 * If there is nothing under the current directory and we are not
2092 * hiding empty directories, then we need to report on the
2093 * untracked or ignored status of the directory itself.
2094 */
2095 if (state == path_none && !(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
2096 state = excluded ? path_excluded : path_untracked;
2097
2098 return state;
2099 }
2100
2101 /*
2102 * This is an inexact early pruning of any recursive directory
2103 * reading - if the path cannot possibly be in the pathspec,
2104 * return true, and we'll skip it early.
2105 */
2106 static int simplify_away(const char *path, int pathlen,
2107 const struct pathspec *pathspec)
2108 {
2109 int i;
2110
2111 if (!pathspec || !pathspec->nr)
2112 return 0;
2113
2114 GUARD_PATHSPEC(pathspec,
2115 PATHSPEC_FROMTOP |
2116 PATHSPEC_MAXDEPTH |
2117 PATHSPEC_LITERAL |
2118 PATHSPEC_GLOB |
2119 PATHSPEC_ICASE |
2120 PATHSPEC_EXCLUDE |
2121 PATHSPEC_ATTR);
2122
2123 for (i = 0; i < pathspec->nr; i++) {
2124 const struct pathspec_item *item = &pathspec->items[i];
2125 int len = item->nowildcard_len;
2126
2127 if (len > pathlen)
2128 len = pathlen;
2129 if (!ps_strncmp(item, item->match, path, len))
2130 return 0;
2131 }
2132
2133 return 1;
2134 }
2135
2136 /*
2137 * This function tells us whether an excluded path matches a
2138 * list of "interesting" pathspecs. That is, whether a path matched
2139 * by any of the pathspecs could possibly be ignored by excluding
2140 * the specified path. This can happen if:
2141 *
2142 * 1. the path is mentioned explicitly in the pathspec
2143 *
2144 * 2. the path is a directory prefix of some element in the
2145 * pathspec
2146 */
2147 static int exclude_matches_pathspec(const char *path, int pathlen,
2148 const struct pathspec *pathspec)
2149 {
2150 int i;
2151
2152 if (!pathspec || !pathspec->nr)
2153 return 0;
2154
2155 GUARD_PATHSPEC(pathspec,
2156 PATHSPEC_FROMTOP |
2157 PATHSPEC_MAXDEPTH |
2158 PATHSPEC_LITERAL |
2159 PATHSPEC_GLOB |
2160 PATHSPEC_ICASE |
2161 PATHSPEC_EXCLUDE);
2162
2163 for (i = 0; i < pathspec->nr; i++) {
2164 const struct pathspec_item *item = &pathspec->items[i];
2165 int len = item->nowildcard_len;
2166
2167 if (len == pathlen &&
2168 !ps_strncmp(item, item->match, path, pathlen))
2169 return 1;
2170 if (len > pathlen &&
2171 item->match[pathlen] == '/' &&
2172 !ps_strncmp(item, item->match, path, pathlen))
2173 return 1;
2174 }
2175 return 0;
2176 }
2177
2178 static int get_index_dtype(struct index_state *istate,
2179 const char *path, int len)
2180 {
2181 int pos;
2182 const struct cache_entry *ce;
2183
2184 ce = index_file_exists(istate, path, len, 0);
2185 if (ce) {
2186 if (!ce_uptodate(ce))
2187 return DT_UNKNOWN;
2188 if (S_ISGITLINK(ce->ce_mode))
2189 return DT_DIR;
2190 /*
2191 * Nobody actually cares about the
2192 * difference between DT_LNK and DT_REG
2193 */
2194 return DT_REG;
2195 }
2196
2197 /* Try to look it up as a directory */
2198 pos = index_name_pos(istate, path, len);
2199 if (pos >= 0)
2200 return DT_UNKNOWN;
2201 pos = -pos-1;
2202 while (pos < istate->cache_nr) {
2203 ce = istate->cache[pos++];
2204 if (strncmp(ce->name, path, len))
2205 break;
2206 if (ce->name[len] > '/')
2207 break;
2208 if (ce->name[len] < '/')
2209 continue;
2210 if (!ce_uptodate(ce))
2211 break; /* continue? */
2212 return DT_DIR;
2213 }
2214 return DT_UNKNOWN;
2215 }
2216
2217 static int resolve_dtype(int dtype, struct index_state *istate,
2218 const char *path, int len)
2219 {
2220 struct stat st;
2221
2222 if (dtype != DT_UNKNOWN)
2223 return dtype;
2224 dtype = get_index_dtype(istate, path, len);
2225 if (dtype != DT_UNKNOWN)
2226 return dtype;
2227 if (lstat(path, &st))
2228 return dtype;
2229 if (S_ISREG(st.st_mode))
2230 return DT_REG;
2231 if (S_ISDIR(st.st_mode))
2232 return DT_DIR;
2233 if (S_ISLNK(st.st_mode))
2234 return DT_LNK;
2235 return dtype;
2236 }
2237
2238 static enum path_treatment treat_path_fast(struct dir_struct *dir,
2239 struct cached_dir *cdir,
2240 struct index_state *istate,
2241 struct strbuf *path,
2242 int baselen,
2243 const struct pathspec *pathspec)
2244 {
2245 /*
2246 * WARNING: From this function, you can return path_recurse or you
2247 * can call read_directory_recursive() (or neither), but
2248 * you CAN'T DO BOTH.
2249 */
2250 strbuf_setlen(path, baselen);
2251 if (!cdir->ucd) {
2252 strbuf_addstr(path, cdir->file);
2253 return path_untracked;
2254 }
2255 strbuf_addstr(path, cdir->ucd->name);
2256 /* treat_one_path() does this before it calls treat_directory() */
2257 strbuf_complete(path, '/');
2258 if (cdir->ucd->check_only)
2259 /*
2260 * check_only is set as a result of treat_directory() getting
2261 * to its bottom. Verify again the same set of directories
2262 * with check_only set.
2263 */
2264 return read_directory_recursive(dir, istate, path->buf, path->len,
2265 cdir->ucd, 1, 0, pathspec);
2266 /*
2267 * We get path_recurse in the first run when
2268 * directory_exists_in_index() returns index_nonexistent. We
2269 * are sure that new changes in the index does not impact the
2270 * outcome. Return now.
2271 */
2272 return path_recurse;
2273 }
2274
2275 static enum path_treatment treat_path(struct dir_struct *dir,
2276 struct untracked_cache_dir *untracked,
2277 struct cached_dir *cdir,
2278 struct index_state *istate,
2279 struct strbuf *path,
2280 int baselen,
2281 const struct pathspec *pathspec)
2282 {
2283 int has_path_in_index, dtype, excluded;
2284
2285 if (!cdir->d_name)
2286 return treat_path_fast(dir, cdir, istate, path,
2287 baselen, pathspec);
2288 if (is_dot_or_dotdot(cdir->d_name) || !fspathcmp(cdir->d_name, ".git"))
2289 return path_none;
2290 strbuf_setlen(path, baselen);
2291 strbuf_addstr(path, cdir->d_name);
2292 if (simplify_away(path->buf, path->len, pathspec))
2293 return path_none;
2294
2295 dtype = resolve_dtype(cdir->d_type, istate, path->buf, path->len);
2296
2297 /* Always exclude indexed files */
2298 has_path_in_index = !!index_file_exists(istate, path->buf, path->len,
2299 ignore_case);
2300 if (dtype != DT_DIR && has_path_in_index)
2301 return path_none;
2302
2303 /*
2304 * When we are looking at a directory P in the working tree,
2305 * there are three cases:
2306 *
2307 * (1) P exists in the index. Everything inside the directory P in
2308 * the working tree needs to go when P is checked out from the
2309 * index.
2310 *
2311 * (2) P does not exist in the index, but there is P/Q in the index.
2312 * We know P will stay a directory when we check out the contents
2313 * of the index, but we do not know yet if there is a directory
2314 * P/Q in the working tree to be killed, so we need to recurse.
2315 *
2316 * (3) P does not exist in the index, and there is no P/Q in the index
2317 * to require P to be a directory, either. Only in this case, we
2318 * know that everything inside P will not be killed without
2319 * recursing.
2320 */
2321 if ((dir->flags & DIR_COLLECT_KILLED_ONLY) &&
2322 (dtype == DT_DIR) &&
2323 !has_path_in_index &&
2324 (directory_exists_in_index(istate, path->buf, path->len) == index_nonexistent))
2325 return path_none;
2326
2327 excluded = is_excluded(dir, istate, path->buf, &dtype);
2328
2329 /*
2330 * Excluded? If we don't explicitly want to show
2331 * ignored files, ignore it
2332 */
2333 if (excluded && !(dir->flags & (DIR_SHOW_IGNORED|DIR_SHOW_IGNORED_TOO)))
2334 return path_excluded;
2335
2336 switch (dtype) {
2337 default:
2338 return path_none;
2339 case DT_DIR:
2340 /*
2341 * WARNING: Do not ignore/amend the return value from
2342 * treat_directory(), and especially do not change it to return
2343 * path_recurse as that can cause exponential slowdown.
2344 * Instead, modify treat_directory() to return the right value.
2345 */
2346 strbuf_addch(path, '/');
2347 return treat_directory(dir, istate, untracked,
2348 path->buf, path->len,
2349 baselen, excluded, pathspec);
2350 case DT_REG:
2351 case DT_LNK:
2352 if (pathspec &&
2353 !match_pathspec(istate, pathspec, path->buf, path->len,
2354 0 /* prefix */, NULL /* seen */,
2355 0 /* is_dir */))
2356 return path_none;
2357 if (excluded)
2358 return path_excluded;
2359 return path_untracked;
2360 }
2361 }
2362
2363 static void add_untracked(struct untracked_cache_dir *dir, const char *name)
2364 {
2365 if (!dir)
2366 return;
2367 ALLOC_GROW(dir->untracked, dir->untracked_nr + 1,
2368 dir->untracked_alloc);
2369 dir->untracked[dir->untracked_nr++] = xstrdup(name);
2370 }
2371
2372 static int valid_cached_dir(struct dir_struct *dir,
2373 struct untracked_cache_dir *untracked,
2374 struct index_state *istate,
2375 struct strbuf *path,
2376 int check_only)
2377 {
2378 struct stat st;
2379
2380 if (!untracked)
2381 return 0;
2382
2383 /*
2384 * With fsmonitor, we can trust the untracked cache's valid field.
2385 */
2386 refresh_fsmonitor(istate);
2387 if (!(dir->untracked->use_fsmonitor && untracked->valid)) {
2388 if (lstat(path->len ? path->buf : ".", &st)) {
2389 memset(&untracked->stat_data, 0, sizeof(untracked->stat_data));
2390 return 0;
2391 }
2392 if (!untracked->valid ||
2393 match_stat_data_racy(istate, &untracked->stat_data, &st)) {
2394 fill_stat_data(&untracked->stat_data, &st);
2395 return 0;
2396 }
2397 }
2398
2399 if (untracked->check_only != !!check_only)
2400 return 0;
2401
2402 /*
2403 * prep_exclude will be called eventually on this directory,
2404 * but it's called much later in last_matching_pattern(). We
2405 * need it now to determine the validity of the cache for this
2406 * path. The next calls will be nearly no-op, the way
2407 * prep_exclude() is designed.
2408 */
2409 if (path->len && path->buf[path->len - 1] != '/') {
2410 strbuf_addch(path, '/');
2411 prep_exclude(dir, istate, path->buf, path->len);
2412 strbuf_setlen(path, path->len - 1);
2413 } else
2414 prep_exclude(dir, istate, path->buf, path->len);
2415
2416 /* hopefully prep_exclude() haven't invalidated this entry... */
2417 return untracked->valid;
2418 }
2419
2420 static int open_cached_dir(struct cached_dir *cdir,
2421 struct dir_struct *dir,
2422 struct untracked_cache_dir *untracked,
2423 struct index_state *istate,
2424 struct strbuf *path,
2425 int check_only)
2426 {
2427 const char *c_path;
2428
2429 memset(cdir, 0, sizeof(*cdir));
2430 cdir->untracked = untracked;
2431 if (valid_cached_dir(dir, untracked, istate, path, check_only))
2432 return 0;
2433 c_path = path->len ? path->buf : ".";
2434 cdir->fdir = opendir(c_path);
2435 if (!cdir->fdir)
2436 warning_errno(_("could not open directory '%s'"), c_path);
2437 if (dir->untracked) {
2438 invalidate_directory(dir->untracked, untracked);
2439 dir->untracked->dir_opened++;
2440 }
2441 if (!cdir->fdir)
2442 return -1;
2443 return 0;
2444 }
2445
2446 static int read_cached_dir(struct cached_dir *cdir)
2447 {
2448 struct dirent *de;
2449
2450 if (cdir->fdir) {
2451 de = readdir_skip_dot_and_dotdot(cdir->fdir);
2452 if (!de) {
2453 cdir->d_name = NULL;
2454 cdir->d_type = DT_UNKNOWN;
2455 return -1;
2456 }
2457 cdir->d_name = de->d_name;
2458 cdir->d_type = DTYPE(de);
2459 return 0;
2460 }
2461 while (cdir->nr_dirs < cdir->untracked->dirs_nr) {
2462 struct untracked_cache_dir *d = cdir->untracked->dirs[cdir->nr_dirs];
2463 if (!d->recurse) {
2464 cdir->nr_dirs++;
2465 continue;
2466 }
2467 cdir->ucd = d;
2468 cdir->nr_dirs++;
2469 return 0;
2470 }
2471 cdir->ucd = NULL;
2472 if (cdir->nr_files < cdir->untracked->untracked_nr) {
2473 struct untracked_cache_dir *d = cdir->untracked;
2474 cdir->file = d->untracked[cdir->nr_files++];
2475 return 0;
2476 }
2477 return -1;
2478 }
2479
2480 static void close_cached_dir(struct cached_dir *cdir)
2481 {
2482 if (cdir->fdir)
2483 closedir(cdir->fdir);
2484 /*
2485 * We have gone through this directory and found no untracked
2486 * entries. Mark it valid.
2487 */
2488 if (cdir->untracked) {
2489 cdir->untracked->valid = 1;
2490 cdir->untracked->recurse = 1;
2491 }
2492 }
2493
2494 static void add_path_to_appropriate_result_list(struct dir_struct *dir,
2495 struct untracked_cache_dir *untracked,
2496 struct cached_dir *cdir,
2497 struct index_state *istate,
2498 struct strbuf *path,
2499 int baselen,
2500 const struct pathspec *pathspec,
2501 enum path_treatment state)
2502 {
2503 /* add the path to the appropriate result list */
2504 switch (state) {
2505 case path_excluded:
2506 if (dir->flags & DIR_SHOW_IGNORED)
2507 dir_add_name(dir, istate, path->buf, path->len);
2508 else if ((dir->flags & DIR_SHOW_IGNORED_TOO) ||
2509 ((dir->flags & DIR_COLLECT_IGNORED) &&
2510 exclude_matches_pathspec(path->buf, path->len,
2511 pathspec)))
2512 dir_add_ignored(dir, istate, path->buf, path->len);
2513 break;
2514
2515 case path_untracked:
2516 if (dir->flags & DIR_SHOW_IGNORED)
2517 break;
2518 dir_add_name(dir, istate, path->buf, path->len);
2519 if (cdir->fdir)
2520 add_untracked(untracked, path->buf + baselen);
2521 break;
2522
2523 default:
2524 break;
2525 }
2526 }
2527
2528 /*
2529 * Read a directory tree. We currently ignore anything but
2530 * directories, regular files and symlinks. That's because git
2531 * doesn't handle them at all yet. Maybe that will change some
2532 * day.
2533 *
2534 * Also, we ignore the name ".git" (even if it is not a directory).
2535 * That likely will not change.
2536 *
2537 * If 'stop_at_first_file' is specified, 'path_excluded' is returned
2538 * to signal that a file was found. This is the least significant value that
2539 * indicates that a file was encountered that does not depend on the order of
2540 * whether an untracked or excluded path was encountered first.
2541 *
2542 * Returns the most significant path_treatment value encountered in the scan.
2543 * If 'stop_at_first_file' is specified, `path_excluded` is the most
2544 * significant path_treatment value that will be returned.
2545 */
2546
2547 static enum path_treatment read_directory_recursive(struct dir_struct *dir,
2548 struct index_state *istate, const char *base, int baselen,
2549 struct untracked_cache_dir *untracked, int check_only,
2550 int stop_at_first_file, const struct pathspec *pathspec)
2551 {
2552 /*
2553 * WARNING: Do NOT recurse unless path_recurse is returned from
2554 * treat_path(). Recursing on any other return value
2555 * can result in exponential slowdown.
2556 */
2557 struct cached_dir cdir;
2558 enum path_treatment state, subdir_state, dir_state = path_none;
2559 struct strbuf path = STRBUF_INIT;
2560
2561 strbuf_add(&path, base, baselen);
2562
2563 if (open_cached_dir(&cdir, dir, untracked, istate, &path, check_only))
2564 goto out;
2565 dir->visited_directories++;
2566
2567 if (untracked)
2568 untracked->check_only = !!check_only;
2569
2570 while (!read_cached_dir(&cdir)) {
2571 /* check how the file or directory should be treated */
2572 state = treat_path(dir, untracked, &cdir, istate, &path,
2573 baselen, pathspec);
2574 dir->visited_paths++;
2575
2576 if (state > dir_state)
2577 dir_state = state;
2578
2579 /* recurse into subdir if instructed by treat_path */
2580 if (state == path_recurse) {
2581 struct untracked_cache_dir *ud;
2582 ud = lookup_untracked(dir->untracked, untracked,
2583 path.buf + baselen,
2584 path.len - baselen);
2585 subdir_state =
2586 read_directory_recursive(dir, istate, path.buf,
2587 path.len, ud,
2588 check_only, stop_at_first_file, pathspec);
2589 if (subdir_state > dir_state)
2590 dir_state = subdir_state;
2591
2592 if (pathspec &&
2593 !match_pathspec(istate, pathspec, path.buf, path.len,
2594 0 /* prefix */, NULL,
2595 0 /* do NOT special case dirs */))
2596 state = path_none;
2597 }
2598
2599 if (check_only) {
2600 if (stop_at_first_file) {
2601 /*
2602 * If stopping at first file, then
2603 * signal that a file was found by
2604 * returning `path_excluded`. This is
2605 * to return a consistent value
2606 * regardless of whether an ignored or
2607 * excluded file happened to be
2608 * encountered 1st.
2609 *
2610 * In current usage, the
2611 * `stop_at_first_file` is passed when
2612 * an ancestor directory has matched
2613 * an exclude pattern, so any found
2614 * files will be excluded.
2615 */
2616 if (dir_state >= path_excluded) {
2617 dir_state = path_excluded;
2618 break;
2619 }
2620 }
2621
2622 /* abort early if maximum state has been reached */
2623 if (dir_state == path_untracked) {
2624 if (cdir.fdir)
2625 add_untracked(untracked, path.buf + baselen);
2626 break;
2627 }
2628 /* skip the add_path_to_appropriate_result_list() */
2629 continue;
2630 }
2631
2632 add_path_to_appropriate_result_list(dir, untracked, &cdir,
2633 istate, &path, baselen,
2634 pathspec, state);
2635 }
2636 close_cached_dir(&cdir);
2637 out:
2638 strbuf_release(&path);
2639
2640 return dir_state;
2641 }
2642
2643 int cmp_dir_entry(const void *p1, const void *p2)
2644 {
2645 const struct dir_entry *e1 = *(const struct dir_entry **)p1;
2646 const struct dir_entry *e2 = *(const struct dir_entry **)p2;
2647
2648 return name_compare(e1->name, e1->len, e2->name, e2->len);
2649 }
2650
2651 /* check if *out lexically strictly contains *in */
2652 int check_dir_entry_contains(const struct dir_entry *out, const struct dir_entry *in)
2653 {
2654 return (out->len < in->len) &&
2655 (out->name[out->len - 1] == '/') &&
2656 !memcmp(out->name, in->name, out->len);
2657 }
2658
2659 static int treat_leading_path(struct dir_struct *dir,
2660 struct index_state *istate,
2661 const char *path, int len,
2662 const struct pathspec *pathspec)
2663 {
2664 struct strbuf sb = STRBUF_INIT;
2665 struct strbuf subdir = STRBUF_INIT;
2666 int prevlen, baselen;
2667 const char *cp;
2668 struct cached_dir cdir;
2669 enum path_treatment state = path_none;
2670
2671 /*
2672 * For each directory component of path, we are going to check whether
2673 * that path is relevant given the pathspec. For example, if path is
2674 * foo/bar/baz/
2675 * then we will ask treat_path() whether we should go into foo, then
2676 * whether we should go into bar, then whether baz is relevant.
2677 * Checking each is important because e.g. if path is
2678 * .git/info/
2679 * then we need to check .git to know we shouldn't traverse it.
2680 * If the return from treat_path() is:
2681 * * path_none, for any path, we return false.
2682 * * path_recurse, for all path components, we return true
2683 * * <anything else> for some intermediate component, we make sure
2684 * to add that path to the relevant list but return false
2685 * signifying that we shouldn't recurse into it.
2686 */
2687
2688 while (len && path[len - 1] == '/')
2689 len--;
2690 if (!len)
2691 return 1;
2692
2693 memset(&cdir, 0, sizeof(cdir));
2694 cdir.d_type = DT_DIR;
2695 baselen = 0;
2696 prevlen = 0;
2697 while (1) {
2698 prevlen = baselen + !!baselen;
2699 cp = path + prevlen;
2700 cp = memchr(cp, '/', path + len - cp);
2701 if (!cp)
2702 baselen = len;
2703 else
2704 baselen = cp - path;
2705 strbuf_reset(&sb);
2706 strbuf_add(&sb, path, baselen);
2707 if (!is_directory(sb.buf))
2708 break;
2709 strbuf_reset(&sb);
2710 strbuf_add(&sb, path, prevlen);
2711 strbuf_reset(&subdir);
2712 strbuf_add(&subdir, path+prevlen, baselen-prevlen);
2713 cdir.d_name = subdir.buf;
2714 state = treat_path(dir, NULL, &cdir, istate, &sb, prevlen, pathspec);
2715
2716 if (state != path_recurse)
2717 break; /* do not recurse into it */
2718 if (len <= baselen)
2719 break; /* finished checking */
2720 }
2721 add_path_to_appropriate_result_list(dir, NULL, &cdir, istate,
2722 &sb, baselen, pathspec,
2723 state);
2724
2725 strbuf_release(&subdir);
2726 strbuf_release(&sb);
2727 return state == path_recurse;
2728 }
2729
2730 static const char *get_ident_string(void)
2731 {
2732 static struct strbuf sb = STRBUF_INIT;
2733 struct utsname uts;
2734
2735 if (sb.len)
2736 return sb.buf;
2737 if (uname(&uts) < 0)
2738 die_errno(_("failed to get kernel name and information"));
2739 strbuf_addf(&sb, "Location %s, system %s", get_git_work_tree(),
2740 uts.sysname);
2741 return sb.buf;
2742 }
2743
2744 static int ident_in_untracked(const struct untracked_cache *uc)
2745 {
2746 /*
2747 * Previous git versions may have saved many NUL separated
2748 * strings in the "ident" field, but it is insane to manage
2749 * many locations, so just take care of the first one.
2750 */
2751
2752 return !strcmp(uc->ident.buf, get_ident_string());
2753 }
2754
2755 static void set_untracked_ident(struct untracked_cache *uc)
2756 {
2757 strbuf_reset(&uc->ident);
2758 strbuf_addstr(&uc->ident, get_ident_string());
2759
2760 /*
2761 * This strbuf used to contain a list of NUL separated
2762 * strings, so save NUL too for backward compatibility.
2763 */
2764 strbuf_addch(&uc->ident, 0);
2765 }
2766
2767 static unsigned new_untracked_cache_flags(struct index_state *istate)
2768 {
2769 struct repository *repo = istate->repo;
2770 char *val;
2771
2772 /*
2773 * This logic is coordinated with the setting of these flags in
2774 * wt-status.c#wt_status_collect_untracked(), and the evaluation
2775 * of the config setting in commit.c#git_status_config()
2776 */
2777 if (!repo_config_get_string(repo, "status.showuntrackedfiles", &val) &&
2778 !strcmp(val, "all"))
2779 return 0;
2780
2781 /*
2782 * The default, if "all" is not set, is "normal" - leading us here.
2783 * If the value is "none" then it really doesn't matter.
2784 */
2785 return DIR_SHOW_OTHER_DIRECTORIES | DIR_HIDE_EMPTY_DIRECTORIES;
2786 }
2787
2788 static void new_untracked_cache(struct index_state *istate, int flags)
2789 {
2790 struct untracked_cache *uc = xcalloc(1, sizeof(*uc));
2791 strbuf_init(&uc->ident, 100);
2792 uc->exclude_per_dir = ".gitignore";
2793 uc->dir_flags = flags >= 0 ? flags : new_untracked_cache_flags(istate);
2794 set_untracked_ident(uc);
2795 istate->untracked = uc;
2796 istate->cache_changed |= UNTRACKED_CHANGED;
2797 }
2798
2799 void add_untracked_cache(struct index_state *istate)
2800 {
2801 if (!istate->untracked) {
2802 new_untracked_cache(istate, -1);
2803 } else {
2804 if (!ident_in_untracked(istate->untracked)) {
2805 free_untracked_cache(istate->untracked);
2806 new_untracked_cache(istate, -1);
2807 }
2808 }
2809 }
2810
2811 void remove_untracked_cache(struct index_state *istate)
2812 {
2813 if (istate->untracked) {
2814 free_untracked_cache(istate->untracked);
2815 istate->untracked = NULL;
2816 istate->cache_changed |= UNTRACKED_CHANGED;
2817 }
2818 }
2819
2820 static struct untracked_cache_dir *validate_untracked_cache(struct dir_struct *dir,
2821 int base_len,
2822 const struct pathspec *pathspec,
2823 struct index_state *istate)
2824 {
2825 struct untracked_cache_dir *root;
2826 static int untracked_cache_disabled = -1;
2827
2828 if (!dir->untracked)
2829 return NULL;
2830 if (untracked_cache_disabled < 0)
2831 untracked_cache_disabled = git_env_bool("GIT_DISABLE_UNTRACKED_CACHE", 0);
2832 if (untracked_cache_disabled)
2833 return NULL;
2834
2835 /*
2836 * We only support $GIT_DIR/info/exclude and core.excludesfile
2837 * as the global ignore rule files. Any other additions
2838 * (e.g. from command line) invalidate the cache. This
2839 * condition also catches running setup_standard_excludes()
2840 * before setting dir->untracked!
2841 */
2842 if (dir->unmanaged_exclude_files)
2843 return NULL;
2844
2845 /*
2846 * Optimize for the main use case only: whole-tree git
2847 * status. More work involved in treat_leading_path() if we
2848 * use cache on just a subset of the worktree. pathspec
2849 * support could make the matter even worse.
2850 */
2851 if (base_len || (pathspec && pathspec->nr))
2852 return NULL;
2853
2854 /* We don't support collecting ignore files */
2855 if (dir->flags & (DIR_SHOW_IGNORED | DIR_SHOW_IGNORED_TOO |
2856 DIR_COLLECT_IGNORED))
2857 return NULL;
2858
2859 /*
2860 * If we use .gitignore in the cache and now you change it to
2861 * .gitexclude, everything will go wrong.
2862 */
2863 if (dir->exclude_per_dir != dir->untracked->exclude_per_dir &&
2864 strcmp(dir->exclude_per_dir, dir->untracked->exclude_per_dir))
2865 return NULL;
2866
2867 /*
2868 * EXC_CMDL is not considered in the cache. If people set it,
2869 * skip the cache.
2870 */
2871 if (dir->exclude_list_group[EXC_CMDL].nr)
2872 return NULL;
2873
2874 if (!ident_in_untracked(dir->untracked)) {
2875 warning(_("untracked cache is disabled on this system or location"));
2876 return NULL;
2877 }
2878
2879 /*
2880 * If the untracked structure we received does not have the same flags
2881 * as requested in this run, we're going to need to either discard the
2882 * existing structure (and potentially later recreate), or bypass the
2883 * untracked cache mechanism for this run.
2884 */
2885 if (dir->flags != dir->untracked->dir_flags) {
2886 /*
2887 * If the untracked structure we received does not have the same flags
2888 * as configured, then we need to reset / create a new "untracked"
2889 * structure to match the new config.
2890 *
2891 * Keeping the saved and used untracked cache consistent with the
2892 * configuration provides an opportunity for frequent users of
2893 * "git status -uall" to leverage the untracked cache by aligning their
2894 * configuration - setting "status.showuntrackedfiles" to "all" or
2895 * "normal" as appropriate.
2896 *
2897 * Previously using -uall (or setting "status.showuntrackedfiles" to
2898 * "all") was incompatible with untracked cache and *consistently*
2899 * caused surprisingly bad performance (with fscache and fsmonitor
2900 * enabled) on Windows.
2901 *
2902 * IMPROVEMENT OPPORTUNITY: If we reworked the untracked cache storage
2903 * to not be as bound up with the desired output in a given run,
2904 * and instead iterated through and stored enough information to
2905 * correctly serve both "modes", then users could get peak performance
2906 * with or without '-uall' regardless of their
2907 * "status.showuntrackedfiles" config.
2908 */
2909 if (dir->untracked->dir_flags != new_untracked_cache_flags(istate)) {
2910 free_untracked_cache(istate->untracked);
2911 new_untracked_cache(istate, dir->flags);
2912 dir->untracked = istate->untracked;
2913 }
2914 else {
2915 /*
2916 * Current untracked cache data is consistent with config, but not
2917 * usable in this request/run; just bypass untracked cache.
2918 */
2919 return NULL;
2920 }
2921 }
2922
2923 if (!dir->untracked->root) {
2924 /* Untracked cache existed but is not initialized; fix that */
2925 FLEX_ALLOC_STR(dir->untracked->root, name, "");
2926 istate->cache_changed |= UNTRACKED_CHANGED;
2927 }
2928
2929 /* Validate $GIT_DIR/info/exclude and core.excludesfile */
2930 root = dir->untracked->root;
2931 if (!oideq(&dir->ss_info_exclude.oid,
2932 &dir->untracked->ss_info_exclude.oid)) {
2933 invalidate_gitignore(dir->untracked, root);
2934 dir->untracked->ss_info_exclude = dir->ss_info_exclude;
2935 }
2936 if (!oideq(&dir->ss_excludes_file.oid,
2937 &dir->untracked->ss_excludes_file.oid)) {
2938 invalidate_gitignore(dir->untracked, root);
2939 dir->untracked->ss_excludes_file = dir->ss_excludes_file;
2940 }
2941
2942 /* Make sure this directory is not dropped out at saving phase */
2943 root->recurse = 1;
2944 return root;
2945 }
2946
2947 static void emit_traversal_statistics(struct dir_struct *dir,
2948 struct repository *repo,
2949 const char *path,
2950 int path_len)
2951 {
2952 if (!trace2_is_enabled())
2953 return;
2954
2955 if (!path_len) {
2956 trace2_data_string("read_directory", repo, "path", "");
2957 } else {
2958 struct strbuf tmp = STRBUF_INIT;
2959 strbuf_add(&tmp, path, path_len);
2960 trace2_data_string("read_directory", repo, "path", tmp.buf);
2961 strbuf_release(&tmp);
2962 }
2963
2964 trace2_data_intmax("read_directory", repo,
2965 "directories-visited", dir->visited_directories);
2966 trace2_data_intmax("read_directory", repo,
2967 "paths-visited", dir->visited_paths);
2968
2969 if (!dir->untracked)
2970 return;
2971 trace2_data_intmax("read_directory", repo,
2972 "node-creation", dir->untracked->dir_created);
2973 trace2_data_intmax("read_directory", repo,
2974 "gitignore-invalidation",
2975 dir->untracked->gitignore_invalidated);
2976 trace2_data_intmax("read_directory", repo,
2977 "directory-invalidation",
2978 dir->untracked->dir_invalidated);
2979 trace2_data_intmax("read_directory", repo,
2980 "opendir", dir->untracked->dir_opened);
2981 }
2982
2983 int read_directory(struct dir_struct *dir, struct index_state *istate,
2984 const char *path, int len, const struct pathspec *pathspec)
2985 {
2986 struct untracked_cache_dir *untracked;
2987
2988 trace2_region_enter("dir", "read_directory", istate->repo);
2989 dir->visited_paths = 0;
2990 dir->visited_directories = 0;
2991
2992 if (has_symlink_leading_path(path, len)) {
2993 trace2_region_leave("dir", "read_directory", istate->repo);
2994 return dir->nr;
2995 }
2996
2997 untracked = validate_untracked_cache(dir, len, pathspec, istate);
2998 if (!untracked)
2999 /*
3000 * make sure untracked cache code path is disabled,
3001 * e.g. prep_exclude()
3002 */
3003 dir->untracked = NULL;
3004 if (!len || treat_leading_path(dir, istate, path, len, pathspec))
3005 read_directory_recursive(dir, istate, path, len, untracked, 0, 0, pathspec);
3006 QSORT(dir->entries, dir->nr, cmp_dir_entry);
3007 QSORT(dir->ignored, dir->ignored_nr, cmp_dir_entry);
3008
3009 emit_traversal_statistics(dir, istate->repo, path, len);
3010
3011 trace2_region_leave("dir", "read_directory", istate->repo);
3012 if (dir->untracked) {
3013 static int force_untracked_cache = -1;
3014
3015 if (force_untracked_cache < 0)
3016 force_untracked_cache =
3017 git_env_bool("GIT_FORCE_UNTRACKED_CACHE", -1);
3018 if (force_untracked_cache < 0)
3019 force_untracked_cache = (istate->repo->settings.core_untracked_cache == UNTRACKED_CACHE_WRITE);
3020 if (force_untracked_cache &&
3021 dir->untracked == istate->untracked &&
3022 (dir->untracked->dir_opened ||
3023 dir->untracked->gitignore_invalidated ||
3024 dir->untracked->dir_invalidated))
3025 istate->cache_changed |= UNTRACKED_CHANGED;
3026 if (dir->untracked != istate->untracked) {
3027 FREE_AND_NULL(dir->untracked);
3028 }
3029 }
3030
3031 return dir->nr;
3032 }
3033
3034 int file_exists(const char *f)
3035 {
3036 struct stat sb;
3037 return lstat(f, &sb) == 0;
3038 }
3039
3040 int repo_file_exists(struct repository *repo, const char *path)
3041 {
3042 if (repo != the_repository)
3043 BUG("do not know how to check file existence in arbitrary repo");
3044
3045 return file_exists(path);
3046 }
3047
3048 static int cmp_icase(char a, char b)
3049 {
3050 if (a == b)
3051 return 0;
3052 if (ignore_case)
3053 return toupper(a) - toupper(b);
3054 return a - b;
3055 }
3056
3057 /*
3058 * Given two normalized paths (a trailing slash is ok), if subdir is
3059 * outside dir, return -1. Otherwise return the offset in subdir that
3060 * can be used as relative path to dir.
3061 */
3062 int dir_inside_of(const char *subdir, const char *dir)
3063 {
3064 int offset = 0;
3065
3066 assert(dir && subdir && *dir && *subdir);
3067
3068 while (*dir && *subdir && !cmp_icase(*dir, *subdir)) {
3069 dir++;
3070 subdir++;
3071 offset++;
3072 }
3073
3074 /* hel[p]/me vs hel[l]/yeah */
3075 if (*dir && *subdir)
3076 return -1;
3077
3078 if (!*subdir)
3079 return !*dir ? offset : -1; /* same dir */
3080
3081 /* foo/[b]ar vs foo/[] */
3082 if (is_dir_sep(dir[-1]))
3083 return is_dir_sep(subdir[-1]) ? offset : -1;
3084
3085 /* foo[/]bar vs foo[] */
3086 return is_dir_sep(*subdir) ? offset + 1 : -1;
3087 }
3088
3089 int is_inside_dir(const char *dir)
3090 {
3091 char *cwd;
3092 int rc;
3093
3094 if (!dir)
3095 return 0;
3096
3097 cwd = xgetcwd();
3098 rc = (dir_inside_of(cwd, dir) >= 0);
3099 free(cwd);
3100 return rc;
3101 }
3102
3103 int is_empty_dir(const char *path)
3104 {
3105 DIR *dir = opendir(path);
3106 struct dirent *e;
3107 int ret = 1;
3108
3109 if (!dir)
3110 return 0;
3111
3112 e = readdir_skip_dot_and_dotdot(dir);
3113 if (e)
3114 ret = 0;
3115
3116 closedir(dir);
3117 return ret;
3118 }
3119
3120 char *git_url_basename(const char *repo, int is_bundle, int is_bare)
3121 {
3122 const char *end = repo + strlen(repo), *start, *ptr;
3123 size_t len;
3124 char *dir;
3125
3126 /*
3127 * Skip scheme.
3128 */
3129 start = strstr(repo, "://");
3130 if (!start)
3131 start = repo;
3132 else
3133 start += 3;
3134
3135 /*
3136 * Skip authentication data. The stripping does happen
3137 * greedily, such that we strip up to the last '@' inside
3138 * the host part.
3139 */
3140 for (ptr = start; ptr < end && !is_dir_sep(*ptr); ptr++) {
3141 if (*ptr == '@')
3142 start = ptr + 1;
3143 }
3144
3145 /*
3146 * Strip trailing spaces, slashes and /.git
3147 */
3148 while (start < end && (is_dir_sep(end[-1]) || isspace(end[-1])))
3149 end--;
3150 if (end - start > 5 && is_dir_sep(end[-5]) &&
3151 !strncmp(end - 4, ".git", 4)) {
3152 end -= 5;
3153 while (start < end && is_dir_sep(end[-1]))
3154 end--;
3155 }
3156
3157 /*
3158 * It should not be possible to overflow `ptrdiff_t` by passing in an
3159 * insanely long URL, but GCC does not know that and will complain
3160 * without this check.
3161 */
3162 if (end - start < 0)
3163 die(_("No directory name could be guessed.\n"
3164 "Please specify a directory on the command line"));
3165
3166 /*
3167 * Strip trailing port number if we've got only a
3168 * hostname (that is, there is no dir separator but a
3169 * colon). This check is required such that we do not
3170 * strip URI's like '/foo/bar:2222.git', which should
3171 * result in a dir '2222' being guessed due to backwards
3172 * compatibility.
3173 */
3174 if (memchr(start, '/', end - start) == NULL
3175 && memchr(start, ':', end - start) != NULL) {
3176 ptr = end;
3177 while (start < ptr && isdigit(ptr[-1]) && ptr[-1] != ':')
3178 ptr--;
3179 if (start < ptr && ptr[-1] == ':')
3180 end = ptr - 1;
3181 }
3182
3183 /*
3184 * Find last component. To remain backwards compatible we
3185 * also regard colons as path separators, such that
3186 * cloning a repository 'foo:bar.git' would result in a
3187 * directory 'bar' being guessed.
3188 */
3189 ptr = end;
3190 while (start < ptr && !is_dir_sep(ptr[-1]) && ptr[-1] != ':')
3191 ptr--;
3192 start = ptr;
3193
3194 /*
3195 * Strip .{bundle,git}.
3196 */
3197 len = end - start;
3198 strip_suffix_mem(start, &len, is_bundle ? ".bundle" : ".git");
3199
3200 if (!len || (len == 1 && *start == '/'))
3201 die(_("No directory name could be guessed.\n"
3202 "Please specify a directory on the command line"));
3203
3204 if (is_bare)
3205 dir = xstrfmt("%.*s.git", (int)len, start);
3206 else
3207 dir = xstrndup(start, len);
3208 /*
3209 * Replace sequences of 'control' characters and whitespace
3210 * with one ascii space, remove leading and trailing spaces.
3211 */
3212 if (*dir) {
3213 char *out = dir;
3214 int prev_space = 1 /* strip leading whitespace */;
3215 for (end = dir; *end; ++end) {
3216 char ch = *end;
3217 if ((unsigned char)ch < '\x20')
3218 ch = '\x20';
3219 if (isspace(ch)) {
3220 if (prev_space)
3221 continue;
3222 prev_space = 1;
3223 } else
3224 prev_space = 0;
3225 *out++ = ch;
3226 }
3227 *out = '\0';
3228 if (out > dir && prev_space)
3229 out[-1] = '\0';
3230 }
3231 return dir;
3232 }
3233
3234 void strip_dir_trailing_slashes(char *dir)
3235 {
3236 char *end = dir + strlen(dir);
3237
3238 while (dir < end - 1 && is_dir_sep(end[-1]))
3239 end--;
3240 *end = '\0';
3241 }
3242
3243 static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up)
3244 {
3245 DIR *dir;
3246 struct dirent *e;
3247 int ret = 0, original_len = path->len, len, kept_down = 0;
3248 int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY);
3249 int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL);
3250 int purge_original_cwd = (flag & REMOVE_DIR_PURGE_ORIGINAL_CWD);
3251 struct object_id submodule_head;
3252
3253 if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) &&
3254 !resolve_gitlink_ref(path->buf, "HEAD", &submodule_head)) {
3255 /* Do not descend and nuke a nested git work tree. */
3256 if (kept_up)
3257 *kept_up = 1;
3258 return 0;
3259 }
3260
3261 flag &= ~REMOVE_DIR_KEEP_TOPLEVEL;
3262 dir = opendir(path->buf);
3263 if (!dir) {
3264 if (errno == ENOENT)
3265 return keep_toplevel ? -1 : 0;
3266 else if (errno == EACCES && !keep_toplevel)
3267 /*
3268 * An empty dir could be removable even if it
3269 * is unreadable:
3270 */
3271 return rmdir(path->buf);
3272 else
3273 return -1;
3274 }
3275 strbuf_complete(path, '/');
3276
3277 len = path->len;
3278 while ((e = readdir_skip_dot_and_dotdot(dir)) != NULL) {
3279 struct stat st;
3280
3281 strbuf_setlen(path, len);
3282 strbuf_addstr(path, e->d_name);
3283 if (lstat(path->buf, &st)) {
3284 if (errno == ENOENT)
3285 /*
3286 * file disappeared, which is what we
3287 * wanted anyway
3288 */
3289 continue;
3290 /* fall through */
3291 } else if (S_ISDIR(st.st_mode)) {
3292 if (!remove_dir_recurse(path, flag, &kept_down))
3293 continue; /* happy */
3294 } else if (!only_empty &&
3295 (!unlink(path->buf) || errno == ENOENT)) {
3296 continue; /* happy, too */
3297 }
3298
3299 /* path too long, stat fails, or non-directory still exists */
3300 ret = -1;
3301 break;
3302 }
3303 closedir(dir);
3304
3305 strbuf_setlen(path, original_len);
3306 if (!ret && !keep_toplevel && !kept_down) {
3307 if (!purge_original_cwd &&
3308 startup_info->original_cwd &&
3309 !strcmp(startup_info->original_cwd, path->buf))
3310 ret = -1; /* Do not remove current working directory */
3311 else
3312 ret = (!rmdir(path->buf) || errno == ENOENT) ? 0 : -1;
3313 } else if (kept_up)
3314 /*
3315 * report the uplevel that it is not an error that we
3316 * did not rmdir() our directory.
3317 */
3318 *kept_up = !ret;
3319 return ret;
3320 }
3321
3322 int remove_dir_recursively(struct strbuf *path, int flag)
3323 {
3324 return remove_dir_recurse(path, flag, NULL);
3325 }
3326
3327 static GIT_PATH_FUNC(git_path_info_exclude, "info/exclude")
3328
3329 void setup_standard_excludes(struct dir_struct *dir)
3330 {
3331 dir->exclude_per_dir = ".gitignore";
3332
3333 /* core.excludesfile defaulting to $XDG_CONFIG_HOME/git/ignore */
3334 if (!excludes_file)
3335 excludes_file = xdg_config_home("ignore");
3336 if (excludes_file && !access_or_warn(excludes_file, R_OK, 0))
3337 add_patterns_from_file_1(dir, excludes_file,
3338 dir->untracked ? &dir->ss_excludes_file : NULL);
3339
3340 /* per repository user preference */
3341 if (startup_info->have_repository) {
3342 const char *path = git_path_info_exclude();
3343 if (!access_or_warn(path, R_OK, 0))
3344 add_patterns_from_file_1(dir, path,
3345 dir->untracked ? &dir->ss_info_exclude : NULL);
3346 }
3347 }
3348
3349 char *get_sparse_checkout_filename(void)
3350 {
3351 return git_pathdup("info/sparse-checkout");
3352 }
3353
3354 int get_sparse_checkout_patterns(struct pattern_list *pl)
3355 {
3356 int res;
3357 char *sparse_filename = get_sparse_checkout_filename();
3358
3359 pl->use_cone_patterns = core_sparse_checkout_cone;
3360 res = add_patterns_from_file_to_list(sparse_filename, "", 0, pl, NULL, 0);
3361
3362 free(sparse_filename);
3363 return res;
3364 }
3365
3366 int remove_path(const char *name)
3367 {
3368 char *slash;
3369
3370 if (unlink(name) && !is_missing_file_error(errno))
3371 return -1;
3372
3373 slash = strrchr(name, '/');
3374 if (slash) {
3375 char *dirs = xstrdup(name);
3376 slash = dirs + (slash - name);
3377 do {
3378 *slash = '\0';
3379 if (startup_info->original_cwd &&
3380 !strcmp(startup_info->original_cwd, dirs))
3381 break;
3382 } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/')));
3383 free(dirs);
3384 }
3385 return 0;
3386 }
3387
3388 /*
3389 * Frees memory within dir which was allocated, and resets fields for further
3390 * use. Does not free dir itself.
3391 */
3392 void dir_clear(struct dir_struct *dir)
3393 {
3394 int i, j;
3395 struct exclude_list_group *group;
3396 struct pattern_list *pl;
3397 struct exclude_stack *stk;
3398 struct dir_struct new = DIR_INIT;
3399
3400 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
3401 group = &dir->exclude_list_group[i];
3402 for (j = 0; j < group->nr; j++) {
3403 pl = &group->pl[j];
3404 if (i == EXC_DIRS)
3405 free((char *)pl->src);
3406 clear_pattern_list(pl);
3407 }
3408 free(group->pl);
3409 }
3410
3411 for (i = 0; i < dir->ignored_nr; i++)
3412 free(dir->ignored[i]);
3413 for (i = 0; i < dir->nr; i++)
3414 free(dir->entries[i]);
3415 free(dir->ignored);
3416 free(dir->entries);
3417
3418 stk = dir->exclude_stack;
3419 while (stk) {
3420 struct exclude_stack *prev = stk->prev;
3421 free(stk);
3422 stk = prev;
3423 }
3424 strbuf_release(&dir->basebuf);
3425
3426 memcpy(dir, &new, sizeof(*dir));
3427 }
3428
3429 struct ondisk_untracked_cache {
3430 struct stat_data info_exclude_stat;
3431 struct stat_data excludes_file_stat;
3432 uint32_t dir_flags;
3433 };
3434
3435 #define ouc_offset(x) offsetof(struct ondisk_untracked_cache, x)
3436
3437 struct write_data {
3438 int index; /* number of written untracked_cache_dir */
3439 struct ewah_bitmap *check_only; /* from untracked_cache_dir */
3440 struct ewah_bitmap *valid; /* from untracked_cache_dir */
3441 struct ewah_bitmap *sha1_valid; /* set if exclude_sha1 is not null */
3442 struct strbuf out;
3443 struct strbuf sb_stat;
3444 struct strbuf sb_sha1;
3445 };
3446
3447 static void stat_data_to_disk(struct stat_data *to, const struct stat_data *from)
3448 {
3449 to->sd_ctime.sec = htonl(from->sd_ctime.sec);
3450 to->sd_ctime.nsec = htonl(from->sd_ctime.nsec);
3451 to->sd_mtime.sec = htonl(from->sd_mtime.sec);
3452 to->sd_mtime.nsec = htonl(from->sd_mtime.nsec);
3453 to->sd_dev = htonl(from->sd_dev);
3454 to->sd_ino = htonl(from->sd_ino);
3455 to->sd_uid = htonl(from->sd_uid);
3456 to->sd_gid = htonl(from->sd_gid);
3457 to->sd_size = htonl(from->sd_size);
3458 }
3459
3460 static void write_one_dir(struct untracked_cache_dir *untracked,
3461 struct write_data *wd)
3462 {
3463 struct stat_data stat_data;
3464 struct strbuf *out = &wd->out;
3465 unsigned char intbuf[16];
3466 unsigned int intlen, value;
3467 int i = wd->index++;
3468
3469 /*
3470 * untracked_nr should be reset whenever valid is clear, but
3471 * for safety..
3472 */
3473 if (!untracked->valid) {
3474 untracked->untracked_nr = 0;
3475 untracked->check_only = 0;
3476 }
3477
3478 if (untracked->check_only)
3479 ewah_set(wd->check_only, i);
3480 if (untracked->valid) {
3481 ewah_set(wd->valid, i);
3482 stat_data_to_disk(&stat_data, &untracked->stat_data);
3483 strbuf_add(&wd->sb_stat, &stat_data, sizeof(stat_data));
3484 }
3485 if (!is_null_oid(&untracked->exclude_oid)) {
3486 ewah_set(wd->sha1_valid, i);
3487 strbuf_add(&wd->sb_sha1, untracked->exclude_oid.hash,
3488 the_hash_algo->rawsz);
3489 }
3490
3491 intlen = encode_varint(untracked->untracked_nr, intbuf);
3492 strbuf_add(out, intbuf, intlen);
3493
3494 /* skip non-recurse directories */
3495 for (i = 0, value = 0; i < untracked->dirs_nr; i++)
3496 if (untracked->dirs[i]->recurse)
3497 value++;
3498 intlen = encode_varint(value, intbuf);
3499 strbuf_add(out, intbuf, intlen);
3500
3501 strbuf_add(out, untracked->name, strlen(untracked->name) + 1);
3502
3503 for (i = 0; i < untracked->untracked_nr; i++)
3504 strbuf_add(out, untracked->untracked[i],
3505 strlen(untracked->untracked[i]) + 1);
3506
3507 for (i = 0; i < untracked->dirs_nr; i++)
3508 if (untracked->dirs[i]->recurse)
3509 write_one_dir(untracked->dirs[i], wd);
3510 }
3511
3512 void write_untracked_extension(struct strbuf *out, struct untracked_cache *untracked)
3513 {
3514 struct ondisk_untracked_cache *ouc;
3515 struct write_data wd;
3516 unsigned char varbuf[16];
3517 int varint_len;
3518 const unsigned hashsz = the_hash_algo->rawsz;
3519
3520 CALLOC_ARRAY(ouc, 1);
3521 stat_data_to_disk(&ouc->info_exclude_stat, &untracked->ss_info_exclude.stat);
3522 stat_data_to_disk(&ouc->excludes_file_stat, &untracked->ss_excludes_file.stat);
3523 ouc->dir_flags = htonl(untracked->dir_flags);
3524
3525 varint_len = encode_varint(untracked->ident.len, varbuf);
3526 strbuf_add(out, varbuf, varint_len);
3527 strbuf_addbuf(out, &untracked->ident);
3528
3529 strbuf_add(out, ouc, sizeof(*ouc));
3530 strbuf_add(out, untracked->ss_info_exclude.oid.hash, hashsz);
3531 strbuf_add(out, untracked->ss_excludes_file.oid.hash, hashsz);
3532 strbuf_add(out, untracked->exclude_per_dir, strlen(untracked->exclude_per_dir) + 1);
3533 FREE_AND_NULL(ouc);
3534
3535 if (!untracked->root) {
3536 varint_len = encode_varint(0, varbuf);
3537 strbuf_add(out, varbuf, varint_len);
3538 return;
3539 }
3540
3541 wd.index = 0;
3542 wd.check_only = ewah_new();
3543 wd.valid = ewah_new();
3544 wd.sha1_valid = ewah_new();
3545 strbuf_init(&wd.out, 1024);
3546 strbuf_init(&wd.sb_stat, 1024);
3547 strbuf_init(&wd.sb_sha1, 1024);
3548 write_one_dir(untracked->root, &wd);
3549
3550 varint_len = encode_varint(wd.index, varbuf);
3551 strbuf_add(out, varbuf, varint_len);
3552 strbuf_addbuf(out, &wd.out);
3553 ewah_serialize_strbuf(wd.valid, out);
3554 ewah_serialize_strbuf(wd.check_only, out);
3555 ewah_serialize_strbuf(wd.sha1_valid, out);
3556 strbuf_addbuf(out, &wd.sb_stat);
3557 strbuf_addbuf(out, &wd.sb_sha1);
3558 strbuf_addch(out, '\0'); /* safe guard for string lists */
3559
3560 ewah_free(wd.valid);
3561 ewah_free(wd.check_only);
3562 ewah_free(wd.sha1_valid);
3563 strbuf_release(&wd.out);
3564 strbuf_release(&wd.sb_stat);
3565 strbuf_release(&wd.sb_sha1);
3566 }
3567
3568 static void free_untracked(struct untracked_cache_dir *ucd)
3569 {
3570 int i;
3571 if (!ucd)
3572 return;
3573 for (i = 0; i < ucd->dirs_nr; i++)
3574 free_untracked(ucd->dirs[i]);
3575 for (i = 0; i < ucd->untracked_nr; i++)
3576 free(ucd->untracked[i]);
3577 free(ucd->untracked);
3578 free(ucd->dirs);
3579 free(ucd);
3580 }
3581
3582 void free_untracked_cache(struct untracked_cache *uc)
3583 {
3584 if (uc)
3585 free_untracked(uc->root);
3586 free(uc);
3587 }
3588
3589 struct read_data {
3590 int index;
3591 struct untracked_cache_dir **ucd;
3592 struct ewah_bitmap *check_only;
3593 struct ewah_bitmap *valid;
3594 struct ewah_bitmap *sha1_valid;
3595 const unsigned char *data;
3596 const unsigned char *end;
3597 };
3598
3599 static void stat_data_from_disk(struct stat_data *to, const unsigned char *data)
3600 {
3601 memcpy(to, data, sizeof(*to));
3602 to->sd_ctime.sec = ntohl(to->sd_ctime.sec);
3603 to->sd_ctime.nsec = ntohl(to->sd_ctime.nsec);
3604 to->sd_mtime.sec = ntohl(to->sd_mtime.sec);
3605 to->sd_mtime.nsec = ntohl(to->sd_mtime.nsec);
3606 to->sd_dev = ntohl(to->sd_dev);
3607 to->sd_ino = ntohl(to->sd_ino);
3608 to->sd_uid = ntohl(to->sd_uid);
3609 to->sd_gid = ntohl(to->sd_gid);
3610 to->sd_size = ntohl(to->sd_size);
3611 }
3612
3613 static int read_one_dir(struct untracked_cache_dir **untracked_,
3614 struct read_data *rd)
3615 {
3616 struct untracked_cache_dir ud, *untracked;
3617 const unsigned char *data = rd->data, *end = rd->end;
3618 const unsigned char *eos;
3619 unsigned int value;
3620 int i;
3621
3622 memset(&ud, 0, sizeof(ud));
3623
3624 value = decode_varint(&data);
3625 if (data > end)
3626 return -1;
3627 ud.recurse = 1;
3628 ud.untracked_alloc = value;
3629 ud.untracked_nr = value;
3630 if (ud.untracked_nr)
3631 ALLOC_ARRAY(ud.untracked, ud.untracked_nr);
3632
3633 ud.dirs_alloc = ud.dirs_nr = decode_varint(&data);
3634 if (data > end)
3635 return -1;
3636 ALLOC_ARRAY(ud.dirs, ud.dirs_nr);
3637
3638 eos = memchr(data, '\0', end - data);
3639 if (!eos || eos == end)
3640 return -1;
3641
3642 *untracked_ = untracked = xmalloc(st_add3(sizeof(*untracked), eos - data, 1));
3643 memcpy(untracked, &ud, sizeof(ud));
3644 memcpy(untracked->name, data, eos - data + 1);
3645 data = eos + 1;
3646
3647 for (i = 0; i < untracked->untracked_nr; i++) {
3648 eos = memchr(data, '\0', end - data);
3649 if (!eos || eos == end)
3650 return -1;
3651 untracked->untracked[i] = xmemdupz(data, eos - data);
3652 data = eos + 1;
3653 }
3654
3655 rd->ucd[rd->index++] = untracked;
3656 rd->data = data;
3657
3658 for (i = 0; i < untracked->dirs_nr; i++) {
3659 if (read_one_dir(untracked->dirs + i, rd) < 0)
3660 return -1;
3661 }
3662 return 0;
3663 }
3664
3665 static void set_check_only(size_t pos, void *cb)
3666 {
3667 struct read_data *rd = cb;
3668 struct untracked_cache_dir *ud = rd->ucd[pos];
3669 ud->check_only = 1;
3670 }
3671
3672 static void read_stat(size_t pos, void *cb)
3673 {
3674 struct read_data *rd = cb;
3675 struct untracked_cache_dir *ud = rd->ucd[pos];
3676 if (rd->data + sizeof(struct stat_data) > rd->end) {
3677 rd->data = rd->end + 1;
3678 return;
3679 }
3680 stat_data_from_disk(&ud->stat_data, rd->data);
3681 rd->data += sizeof(struct stat_data);
3682 ud->valid = 1;
3683 }
3684
3685 static void read_oid(size_t pos, void *cb)
3686 {
3687 struct read_data *rd = cb;
3688 struct untracked_cache_dir *ud = rd->ucd[pos];
3689 if (rd->data + the_hash_algo->rawsz > rd->end) {
3690 rd->data = rd->end + 1;
3691 return;
3692 }
3693 oidread(&ud->exclude_oid, rd->data);
3694 rd->data += the_hash_algo->rawsz;
3695 }
3696
3697 static void load_oid_stat(struct oid_stat *oid_stat, const unsigned char *data,
3698 const unsigned char *sha1)
3699 {
3700 stat_data_from_disk(&oid_stat->stat, data);
3701 oidread(&oid_stat->oid, sha1);
3702 oid_stat->valid = 1;
3703 }
3704
3705 struct untracked_cache *read_untracked_extension(const void *data, unsigned long sz)
3706 {
3707 struct untracked_cache *uc;
3708 struct read_data rd;
3709 const unsigned char *next = data, *end = (const unsigned char *)data + sz;
3710 const char *ident;
3711 int ident_len;
3712 ssize_t len;
3713 const char *exclude_per_dir;
3714 const unsigned hashsz = the_hash_algo->rawsz;
3715 const unsigned offset = sizeof(struct ondisk_untracked_cache);
3716 const unsigned exclude_per_dir_offset = offset + 2 * hashsz;
3717
3718 if (sz <= 1 || end[-1] != '\0')
3719 return NULL;
3720 end--;
3721
3722 ident_len = decode_varint(&next);
3723 if (next + ident_len > end)
3724 return NULL;
3725 ident = (const char *)next;
3726 next += ident_len;
3727
3728 if (next + exclude_per_dir_offset + 1 > end)
3729 return NULL;
3730
3731 CALLOC_ARRAY(uc, 1);
3732 strbuf_init(&uc->ident, ident_len);
3733 strbuf_add(&uc->ident, ident, ident_len);
3734 load_oid_stat(&uc->ss_info_exclude,
3735 next + ouc_offset(info_exclude_stat),
3736 next + offset);
3737 load_oid_stat(&uc->ss_excludes_file,
3738 next + ouc_offset(excludes_file_stat),
3739 next + offset + hashsz);
3740 uc->dir_flags = get_be32(next + ouc_offset(dir_flags));
3741 exclude_per_dir = (const char *)next + exclude_per_dir_offset;
3742 uc->exclude_per_dir = xstrdup(exclude_per_dir);
3743 /* NUL after exclude_per_dir is covered by sizeof(*ouc) */
3744 next += exclude_per_dir_offset + strlen(exclude_per_dir) + 1;
3745 if (next >= end)
3746 goto done2;
3747
3748 len = decode_varint(&next);
3749 if (next > end || len == 0)
3750 goto done2;
3751
3752 rd.valid = ewah_new();
3753 rd.check_only = ewah_new();
3754 rd.sha1_valid = ewah_new();
3755 rd.data = next;
3756 rd.end = end;
3757 rd.index = 0;
3758 ALLOC_ARRAY(rd.ucd, len);
3759
3760 if (read_one_dir(&uc->root, &rd) || rd.index != len)
3761 goto done;
3762
3763 next = rd.data;
3764 len = ewah_read_mmap(rd.valid, next, end - next);
3765 if (len < 0)
3766 goto done;
3767
3768 next += len;
3769 len = ewah_read_mmap(rd.check_only, next, end - next);
3770 if (len < 0)
3771 goto done;
3772
3773 next += len;
3774 len = ewah_read_mmap(rd.sha1_valid, next, end - next);
3775 if (len < 0)
3776 goto done;
3777
3778 ewah_each_bit(rd.check_only, set_check_only, &rd);
3779 rd.data = next + len;
3780 ewah_each_bit(rd.valid, read_stat, &rd);
3781 ewah_each_bit(rd.sha1_valid, read_oid, &rd);
3782 next = rd.data;
3783
3784 done:
3785 free(rd.ucd);
3786 ewah_free(rd.valid);
3787 ewah_free(rd.check_only);
3788 ewah_free(rd.sha1_valid);
3789 done2:
3790 if (next != end) {
3791 free_untracked_cache(uc);
3792 uc = NULL;
3793 }
3794 return uc;
3795 }
3796
3797 static void invalidate_one_directory(struct untracked_cache *uc,
3798 struct untracked_cache_dir *ucd)
3799 {
3800 uc->dir_invalidated++;
3801 ucd->valid = 0;
3802 ucd->untracked_nr = 0;
3803 }
3804
3805 /*
3806 * Normally when an entry is added or removed from a directory,
3807 * invalidating that directory is enough. No need to touch its
3808 * ancestors. When a directory is shown as "foo/bar/" in git-status
3809 * however, deleting or adding an entry may have cascading effect.
3810 *
3811 * Say the "foo/bar/file" has become untracked, we need to tell the
3812 * untracked_cache_dir of "foo" that "bar/" is not an untracked
3813 * directory any more (because "bar" is managed by foo as an untracked
3814 * "file").
3815 *
3816 * Similarly, if "foo/bar/file" moves from untracked to tracked and it
3817 * was the last untracked entry in the entire "foo", we should show
3818 * "foo/" instead. Which means we have to invalidate past "bar" up to
3819 * "foo".
3820 *
3821 * This function traverses all directories from root to leaf. If there
3822 * is a chance of one of the above cases happening, we invalidate back
3823 * to root. Otherwise we just invalidate the leaf. There may be a more
3824 * sophisticated way than checking for SHOW_OTHER_DIRECTORIES to
3825 * detect these cases and avoid unnecessary invalidation, for example,
3826 * checking for the untracked entry named "bar/" in "foo", but for now
3827 * stick to something safe and simple.
3828 */
3829 static int invalidate_one_component(struct untracked_cache *uc,
3830 struct untracked_cache_dir *dir,
3831 const char *path, int len)
3832 {
3833 const char *rest = strchr(path, '/');
3834
3835 if (rest) {
3836 int component_len = rest - path;
3837 struct untracked_cache_dir *d =
3838 lookup_untracked(uc, dir, path, component_len);
3839 int ret =
3840 invalidate_one_component(uc, d, rest + 1,
3841 len - (component_len + 1));
3842 if (ret)
3843 invalidate_one_directory(uc, dir);
3844 return ret;
3845 }
3846
3847 invalidate_one_directory(uc, dir);
3848 return uc->dir_flags & DIR_SHOW_OTHER_DIRECTORIES;
3849 }
3850
3851 void untracked_cache_invalidate_path(struct index_state *istate,
3852 const char *path, int safe_path)
3853 {
3854 if (!istate->untracked || !istate->untracked->root)
3855 return;
3856 if (!safe_path && !verify_path(path, 0))
3857 return;
3858 invalidate_one_component(istate->untracked, istate->untracked->root,
3859 path, strlen(path));
3860 }
3861
3862 void untracked_cache_remove_from_index(struct index_state *istate,
3863 const char *path)
3864 {
3865 untracked_cache_invalidate_path(istate, path, 1);
3866 }
3867
3868 void untracked_cache_add_to_index(struct index_state *istate,
3869 const char *path)
3870 {
3871 untracked_cache_invalidate_path(istate, path, 1);
3872 }
3873
3874 static void connect_wt_gitdir_in_nested(const char *sub_worktree,
3875 const char *sub_gitdir)
3876 {
3877 int i;
3878 struct repository subrepo;
3879 struct strbuf sub_wt = STRBUF_INIT;
3880 struct strbuf sub_gd = STRBUF_INIT;
3881
3882 const struct submodule *sub;
3883
3884 /* If the submodule has no working tree, we can ignore it. */
3885 if (repo_init(&subrepo, sub_gitdir, sub_worktree))
3886 return;
3887
3888 if (repo_read_index(&subrepo) < 0)
3889 die(_("index file corrupt in repo %s"), subrepo.gitdir);
3890
3891 /* TODO: audit for interaction with sparse-index. */
3892 ensure_full_index(subrepo.index);
3893 for (i = 0; i < subrepo.index->cache_nr; i++) {
3894 const struct cache_entry *ce = subrepo.index->cache[i];
3895
3896 if (!S_ISGITLINK(ce->ce_mode))
3897 continue;
3898
3899 while (i + 1 < subrepo.index->cache_nr &&
3900 !strcmp(ce->name, subrepo.index->cache[i + 1]->name))
3901 /*
3902 * Skip entries with the same name in different stages
3903 * to make sure an entry is returned only once.
3904 */
3905 i++;
3906
3907 sub = submodule_from_path(&subrepo, null_oid(), ce->name);
3908 if (!sub || !is_submodule_active(&subrepo, ce->name))
3909 /* .gitmodules broken or inactive sub */
3910 continue;
3911
3912 strbuf_reset(&sub_wt);
3913 strbuf_reset(&sub_gd);
3914 strbuf_addf(&sub_wt, "%s/%s", sub_worktree, sub->path);
3915 submodule_name_to_gitdir(&sub_gd, &subrepo, sub->name);
3916
3917 connect_work_tree_and_git_dir(sub_wt.buf, sub_gd.buf, 1);
3918 }
3919 strbuf_release(&sub_wt);
3920 strbuf_release(&sub_gd);
3921 repo_clear(&subrepo);
3922 }
3923
3924 void connect_work_tree_and_git_dir(const char *work_tree_,
3925 const char *git_dir_,
3926 int recurse_into_nested)
3927 {
3928 struct strbuf gitfile_sb = STRBUF_INIT;
3929 struct strbuf cfg_sb = STRBUF_INIT;
3930 struct strbuf rel_path = STRBUF_INIT;
3931 char *git_dir, *work_tree;
3932
3933 /* Prepare .git file */
3934 strbuf_addf(&gitfile_sb, "%s/.git", work_tree_);
3935 if (safe_create_leading_directories_const(gitfile_sb.buf))
3936 die(_("could not create directories for %s"), gitfile_sb.buf);
3937
3938 /* Prepare config file */
3939 strbuf_addf(&cfg_sb, "%s/config", git_dir_);
3940 if (safe_create_leading_directories_const(cfg_sb.buf))
3941 die(_("could not create directories for %s"), cfg_sb.buf);
3942
3943 git_dir = real_pathdup(git_dir_, 1);
3944 work_tree = real_pathdup(work_tree_, 1);
3945
3946 /* Write .git file */
3947 write_file(gitfile_sb.buf, "gitdir: %s",
3948 relative_path(git_dir, work_tree, &rel_path));
3949 /* Update core.worktree setting */
3950 git_config_set_in_file(cfg_sb.buf, "core.worktree",
3951 relative_path(work_tree, git_dir, &rel_path));
3952
3953 strbuf_release(&gitfile_sb);
3954 strbuf_release(&cfg_sb);
3955 strbuf_release(&rel_path);
3956
3957 if (recurse_into_nested)
3958 connect_wt_gitdir_in_nested(work_tree, git_dir);
3959
3960 free(work_tree);
3961 free(git_dir);
3962 }
3963
3964 /*
3965 * Migrate the git directory of the given path from old_git_dir to new_git_dir.
3966 */
3967 void relocate_gitdir(const char *path, const char *old_git_dir, const char *new_git_dir)
3968 {
3969 if (rename(old_git_dir, new_git_dir) < 0)
3970 die_errno(_("could not migrate git directory from '%s' to '%s'"),
3971 old_git_dir, new_git_dir);
3972
3973 connect_work_tree_and_git_dir(path, new_git_dir, 0);
3974 }
3975
3976 int path_match_flags(const char *const str, const enum path_match_flags flags)
3977 {
3978 const char *p = str;
3979
3980 if (flags & PATH_MATCH_NATIVE &&
3981 flags & PATH_MATCH_XPLATFORM)
3982 BUG("path_match_flags() must get one match kind, not multiple!");
3983 else if (!(flags & PATH_MATCH_KINDS_MASK))
3984 BUG("path_match_flags() must get at least one match kind!");
3985
3986 if (flags & PATH_MATCH_STARTS_WITH_DOT_SLASH &&
3987 flags & PATH_MATCH_STARTS_WITH_DOT_DOT_SLASH)
3988 BUG("path_match_flags() must get one platform kind, not multiple!");
3989 else if (!(flags & PATH_MATCH_PLATFORM_MASK))
3990 BUG("path_match_flags() must get at least one platform kind!");
3991
3992 if (*p++ != '.')
3993 return 0;
3994 if (flags & PATH_MATCH_STARTS_WITH_DOT_DOT_SLASH &&
3995 *p++ != '.')
3996 return 0;
3997
3998 if (flags & PATH_MATCH_NATIVE)
3999 return is_dir_sep(*p);
4000 else if (flags & PATH_MATCH_XPLATFORM)
4001 return is_xplatform_dir_sep(*p);
4002 BUG("unreachable");
4003 }