Merge branch 'dl/diff-merge-base'
[alt-git.git] / dir.c
blob0efa67fbecc0e32e5d9ed67ae6e549610789a30f
1 /*
2 * This handles recursive filename detection with exclude
3 * files, index knowledge etc..
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"
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.
28 enum path_treatment {
29 path_none = 0,
30 path_recurse,
31 path_excluded,
32 path_untracked
36 * Support data structure for our opendir/readdir/closedir wrappers
38 struct cached_dir {
39 DIR *fdir;
40 struct untracked_cache_dir *untracked;
41 int nr_files;
42 int nr_dirs;
44 const char *d_name;
45 int d_type;
46 const char *file;
47 struct untracked_cache_dir *ucd;
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)
58 struct dirent *e;
60 while ((e = readdir(dirp)) != NULL) {
61 if (!is_dot_or_dotdot(e->d_name))
62 break;
64 return e;
67 int count_slashes(const char *s)
69 int cnt = 0;
70 while (*s)
71 if (*s++ == '/')
72 cnt++;
73 return cnt;
76 int fspathcmp(const char *a, const char *b)
78 return ignore_case ? strcasecmp(a, b) : strcmp(a, b);
81 int fspatheq(const char *a, const char *b)
83 return !fspathcmp(a, b);
86 int fspathncmp(const char *a, const char *b, size_t count)
88 return ignore_case ? strncasecmp(a, b, count) : strncmp(a, b, count);
91 unsigned int fspathhash(const char *str)
93 return ignore_case ? strihash(str) : strhash(str);
96 int git_fnmatch(const struct pathspec_item *item,
97 const char *pattern, const char *string,
98 int prefix)
100 if (prefix > 0) {
101 if (ps_strncmp(item, pattern, string, prefix))
102 return WM_NOMATCH;
103 pattern += prefix;
104 string += prefix;
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);
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);
123 static int fnmatch_icase_mem(const char *pattern, int patternlen,
124 const char *string, int stringlen,
125 int flags)
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;
133 if (pattern[patternlen]) {
134 strbuf_add(&pat_buf, pattern, patternlen);
135 use_pat = pat_buf.buf;
137 if (string[stringlen]) {
138 strbuf_add(&str_buf, string, stringlen);
139 use_str = str_buf.buf;
142 if (ignore_case)
143 flags |= WM_CASEFOLD;
144 match_status = wildmatch(use_pat, use_str, flags);
146 strbuf_release(&pat_buf);
147 strbuf_release(&str_buf);
149 return match_status;
152 static size_t common_prefix_len(const struct pathspec *pathspec)
154 int n;
155 size_t max = 0;
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).
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);
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++;
189 if (n == 0 || len < max) {
190 max = len;
191 if (!max)
192 break;
195 return max;
199 * Returns a copy of the longest leading path common among all
200 * pathspecs.
202 char *common_prefix(const struct pathspec *pathspec)
204 unsigned long len = common_prefix_len(pathspec);
206 return len ? xmemdupz(pathspec->items[0].match, len) : NULL;
209 int fill_directory(struct dir_struct *dir,
210 struct index_state *istate,
211 const struct pathspec *pathspec)
213 const char *prefix;
214 size_t prefix_len;
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");
221 * Calculate common prefix for the pathspec, and
222 * use that to optimize the directory walk
224 prefix_len = common_prefix_len(pathspec);
225 prefix = prefix_len ? pathspec->items[0].match : "";
227 /* Read the directory and prune it */
228 read_directory(dir, istate, prefix, prefix_len, pathspec);
230 return prefix_len;
233 int within_depth(const char *name, int namelen,
234 int depth, int max_depth)
236 const char *cp = name, *cpe = name + namelen;
238 while (cp < cpe) {
239 if (*cp++ != '/')
240 continue;
241 depth++;
242 if (depth > max_depth)
243 return 0;
245 return 1;
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.
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.
258 * Optionally updates the given oid_stat with the given OID (when valid).
260 static int do_read_blob(const struct object_id *oid, struct oid_stat *oid_stat,
261 size_t *size_out, char **data_out)
263 enum object_type type;
264 unsigned long sz;
265 char *data;
267 *size_out = 0;
268 *data_out = NULL;
270 data = read_object_file(oid, &type, &sz);
271 if (!data || type != OBJ_BLOB) {
272 free(data);
273 return -1;
276 if (oid_stat) {
277 memset(&oid_stat->stat, 0, sizeof(oid_stat->stat));
278 oidcpy(&oid_stat->oid, oid);
281 if (sz == 0) {
282 free(data);
283 return 0;
286 if (data[sz - 1] != '\n') {
287 data = xrealloc(data, st_add(sz, 1));
288 data[sz++] = '\n';
291 *size_out = xsize_t(sz);
292 *data_out = data;
294 return 1;
297 #define DO_MATCH_EXCLUDE (1<<0)
298 #define DO_MATCH_DIRECTORY (1<<1)
299 #define DO_MATCH_LEADING_PATHSPEC (1<<2)
302 * Does the given pathspec match the given name? A match is found if
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").
309 * Return value tells which case it was (1-4), or 0 when there is no match.
311 * It may be instructive to look at a small table of concrete examples
312 * to understand the differences between 1, 2, and 4:
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
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.
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)
328 /* name/namelen has prefix cut off by caller */
329 const char *match = item->match + prefix;
330 int matchlen = item->len - prefix;
333 * The normal call pattern is:
334 * 1. prefix = common_prefix_len(ps);
335 * 2. prune something, or fill_directory
336 * 3. match_pathspec()
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.
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.
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.
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)
361 if (item->prefix && (item->magic & PATHSPEC_ICASE) &&
362 strncmp(item->match, name - prefix, item->prefix))
363 return 0;
365 if (item->attr_match_nr &&
366 !match_pathspec_attrs(istate, name, namelen, item))
367 return 0;
369 /* If the match was just the prefix, we matched */
370 if (!*match)
371 return MATCHED_RECURSIVELY;
373 if (matchlen <= namelen && !ps_strncmp(item, match, name, matchlen)) {
374 if (matchlen == namelen)
375 return MATCHED_EXACTLY;
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;
385 if (item->nowildcard_len < item->len &&
386 !git_fnmatch(item, match, name,
387 item->nowildcard_len - prefix))
388 return MATCHED_FNMATCH;
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;
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;
407 * name has no wildcard, and it didn't match as a leading
408 * pathspec so return.
410 if (item->nowildcard_len == item->len)
411 return 0;
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.
422 return MATCHED_RECURSIVELY_LEADING_PATHSPEC;
425 return 0;
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.
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.
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.
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)
453 int i, retval = 0, exclude = flags & DO_MATCH_EXCLUDE;
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);
464 if (!ps->nr) {
465 if (!ps->recursive ||
466 !(ps->magic & PATHSPEC_MAXDEPTH) ||
467 ps->max_depth == -1)
468 return MATCHED_RECURSIVELY;
470 if (within_depth(name, namelen, 0, ps->max_depth))
471 return MATCHED_EXACTLY;
472 else
473 return 0;
476 name += prefix;
477 namelen -= prefix;
479 for (i = ps->nr - 1; i >= 0; i--) {
480 int how;
482 if ((!exclude && ps->items[i].magic & PATHSPEC_EXCLUDE) ||
483 ( exclude && !(ps->items[i].magic & PATHSPEC_EXCLUDE)))
484 continue;
486 if (seen && seen[i] == MATCHED_EXACTLY)
487 continue;
489 * Make exclude patterns optional and never report
490 * "pathspec ':(exclude)foo' matches no files"
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;
508 if (how) {
509 if (retval < how)
510 retval = how;
511 if (seen && seen[i] < how)
512 seen[i] = how;
515 return retval;
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)
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;
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)
539 unsigned flags = is_dir ? DO_MATCH_DIRECTORY : 0;
540 return match_pathspec_with_flags(istate, ps, name, namelen,
541 prefix, seen, flags);
545 * Check if a submodule is a superset of the pathspec
547 int submodule_path_match(struct index_state *istate,
548 const struct pathspec *ps,
549 const char *submodule_name,
550 char *seen)
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;
560 int report_path_error(const char *ps_matched,
561 const struct pathspec *pathspec)
564 * Make sure all pathspec matched; otherwise it is an error.
566 int num, errors = 0;
567 for (num = 0; num < pathspec->nr; num++) {
568 int other, found_dup;
570 if (ps_matched[num])
571 continue;
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.
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))
586 * Ok, we have a match already.
588 found_dup = 1;
590 if (found_dup)
591 continue;
593 error(_("pathspec '%s' did not match any file(s) known to git"),
594 pathspec->items[num].original);
595 errors++;
597 return errors;
601 * Return the length of the "simple" part of a path match limiter.
603 int simple_length(const char *match)
605 int len = -1;
607 for (;;) {
608 unsigned char c = *match++;
609 len++;
610 if (c == '\0' || is_glob_special(c))
611 return len;
615 int no_wildcard(const char *string)
617 return string[simple_length(string)] == '\0';
620 void parse_path_pattern(const char **pattern,
621 int *patternlen,
622 unsigned *flags,
623 int *nowildcardlen)
625 const char *p = *pattern;
626 size_t i, len;
628 *flags = 0;
629 if (*p == '!') {
630 *flags |= PATTERN_FLAG_NEGATIVE;
631 p++;
633 len = strlen(p);
634 if (len && p[len - 1] == '/') {
635 len--;
636 *flags |= PATTERN_FLAG_MUSTBEDIR;
638 for (i = 0; i < len; i++) {
639 if (p[i] == '/')
640 break;
642 if (i == len)
643 *flags |= PATTERN_FLAG_NODIR;
644 *nowildcardlen = simple_length(p);
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
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;
658 int pl_hashmap_cmp(const void *unused_cmp_data,
659 const struct hashmap_entry *a,
660 const struct hashmap_entry *b,
661 const void *key)
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);
668 size_t min_len = ee1->patternlen <= ee2->patternlen
669 ? ee1->patternlen
670 : ee2->patternlen;
672 if (ignore_case)
673 return strncasecmp(ee1->pattern, ee2->pattern, min_len);
674 return strncmp(ee1->pattern, ee2->pattern, min_len);
677 static char *dup_and_filter_pattern(const char *pattern)
679 char *set, *read;
680 size_t count = 0;
681 char *result = xstrdup(pattern);
683 set = result;
684 read = result;
686 while (*read) {
687 /* skip escape characters (once) */
688 if (*read == '\\')
689 read++;
691 *set = *read;
693 set++;
694 read++;
695 count++;
697 *set = 0;
699 if (count > 2 &&
700 *(set - 1) == '*' &&
701 *(set - 2) == '/')
702 *(set - 2) = 0;
704 return result;
707 static void add_pattern_to_hashsets(struct pattern_list *pl, struct path_pattern *given)
709 struct pattern_entry *translated;
710 char *truncated;
711 char *data = NULL;
712 const char *prev, *cur, *next;
714 if (!pl->use_cone_patterns)
715 return;
717 if (given->flags & PATTERN_FLAG_NEGATIVE &&
718 given->flags & PATTERN_FLAG_MUSTBEDIR &&
719 !strcmp(given->pattern, "/*")) {
720 pl->full_cone = 0;
721 return;
724 if (!given->flags && !strcmp(given->pattern, "/*")) {
725 pl->full_cone = 1;
726 return;
729 if (given->patternlen < 2 ||
730 *given->pattern == '*' ||
731 strstr(given->pattern, "**")) {
732 /* Not a cone pattern. */
733 warning(_("unrecognized pattern: '%s'"), given->pattern);
734 goto clear_hashmaps;
737 prev = given->pattern;
738 cur = given->pattern + 1;
739 next = given->pattern + 2;
741 while (*cur) {
742 /* Watch for glob characters '*', '\', '[', '?' */
743 if (!is_glob_special(*cur))
744 goto increment;
746 /* But only if *prev != '\\' */
747 if (*prev == '\\')
748 goto increment;
750 /* But allow the initial '\' */
751 if (*cur == '\\' &&
752 is_glob_special(*next))
753 goto increment;
755 /* But a trailing '/' then '*' is fine */
756 if (*prev == '/' &&
757 *cur == '*' &&
758 *next == 0)
759 goto increment;
761 /* Not a cone pattern. */
762 warning(_("unrecognized pattern: '%s'"), given->pattern);
763 goto clear_hashmaps;
765 increment:
766 prev++;
767 cur++;
768 next++;
771 if (given->patternlen > 2 &&
772 !strcmp(given->pattern + given->patternlen - 2, "/*")) {
773 if (!(given->flags & PATTERN_FLAG_NEGATIVE)) {
774 /* Not a cone pattern. */
775 warning(_("unrecognized pattern: '%s'"), given->pattern);
776 goto clear_hashmaps;
779 truncated = dup_and_filter_pattern(given->pattern);
781 translated = xmalloc(sizeof(struct pattern_entry));
782 translated->pattern = truncated;
783 translated->patternlen = given->patternlen - 2;
784 hashmap_entry_init(&translated->ent,
785 ignore_case ?
786 strihash(translated->pattern) :
787 strhash(translated->pattern));
789 if (!hashmap_get_entry(&pl->recursive_hashmap,
790 translated, ent, NULL)) {
791 /* We did not see the "parent" included */
792 warning(_("unrecognized negative pattern: '%s'"),
793 given->pattern);
794 free(truncated);
795 free(translated);
796 goto clear_hashmaps;
799 hashmap_add(&pl->parent_hashmap, &translated->ent);
800 hashmap_remove(&pl->recursive_hashmap, &translated->ent, &data);
801 free(data);
802 return;
805 if (given->flags & PATTERN_FLAG_NEGATIVE) {
806 warning(_("unrecognized negative pattern: '%s'"),
807 given->pattern);
808 goto clear_hashmaps;
811 translated = xmalloc(sizeof(struct pattern_entry));
813 translated->pattern = dup_and_filter_pattern(given->pattern);
814 translated->patternlen = given->patternlen;
815 hashmap_entry_init(&translated->ent,
816 ignore_case ?
817 strihash(translated->pattern) :
818 strhash(translated->pattern));
820 hashmap_add(&pl->recursive_hashmap, &translated->ent);
822 if (hashmap_get_entry(&pl->parent_hashmap, translated, ent, NULL)) {
823 /* we already included this at the parent level */
824 warning(_("your sparse-checkout file may have issues: pattern '%s' is repeated"),
825 given->pattern);
826 hashmap_remove(&pl->parent_hashmap, &translated->ent, &data);
827 free(data);
828 free(translated);
831 return;
833 clear_hashmaps:
834 warning(_("disabling cone pattern matching"));
835 hashmap_clear_and_free(&pl->parent_hashmap, struct pattern_entry, ent);
836 hashmap_clear_and_free(&pl->recursive_hashmap, struct pattern_entry, ent);
837 pl->use_cone_patterns = 0;
840 static int hashmap_contains_path(struct hashmap *map,
841 struct strbuf *pattern)
843 struct pattern_entry p;
845 /* Check straight mapping */
846 p.pattern = pattern->buf;
847 p.patternlen = pattern->len;
848 hashmap_entry_init(&p.ent,
849 ignore_case ?
850 strihash(p.pattern) :
851 strhash(p.pattern));
852 return !!hashmap_get_entry(map, &p, ent, NULL);
855 int hashmap_contains_parent(struct hashmap *map,
856 const char *path,
857 struct strbuf *buffer)
859 char *slash_pos;
861 strbuf_setlen(buffer, 0);
863 if (path[0] != '/')
864 strbuf_addch(buffer, '/');
866 strbuf_addstr(buffer, path);
868 slash_pos = strrchr(buffer->buf, '/');
870 while (slash_pos > buffer->buf) {
871 strbuf_setlen(buffer, slash_pos - buffer->buf);
873 if (hashmap_contains_path(map, buffer))
874 return 1;
876 slash_pos = strrchr(buffer->buf, '/');
879 return 0;
882 void add_pattern(const char *string, const char *base,
883 int baselen, struct pattern_list *pl, int srcpos)
885 struct path_pattern *pattern;
886 int patternlen;
887 unsigned flags;
888 int nowildcardlen;
890 parse_path_pattern(&string, &patternlen, &flags, &nowildcardlen);
891 if (flags & PATTERN_FLAG_MUSTBEDIR) {
892 FLEXPTR_ALLOC_MEM(pattern, pattern, string, patternlen);
893 } else {
894 pattern = xmalloc(sizeof(*pattern));
895 pattern->pattern = string;
897 pattern->patternlen = patternlen;
898 pattern->nowildcardlen = nowildcardlen;
899 pattern->base = base;
900 pattern->baselen = baselen;
901 pattern->flags = flags;
902 pattern->srcpos = srcpos;
903 ALLOC_GROW(pl->patterns, pl->nr + 1, pl->alloc);
904 pl->patterns[pl->nr++] = pattern;
905 pattern->pl = pl;
907 add_pattern_to_hashsets(pl, pattern);
910 static int read_skip_worktree_file_from_index(struct index_state *istate,
911 const char *path,
912 size_t *size_out, char **data_out,
913 struct oid_stat *oid_stat)
915 int pos, len;
917 len = strlen(path);
918 pos = index_name_pos(istate, path, len);
919 if (pos < 0)
920 return -1;
921 if (!ce_skip_worktree(istate->cache[pos]))
922 return -1;
924 return do_read_blob(&istate->cache[pos]->oid, oid_stat, size_out, data_out);
928 * Frees memory within pl which was allocated for exclude patterns and
929 * the file buffer. Does not free pl itself.
931 void clear_pattern_list(struct pattern_list *pl)
933 int i;
935 for (i = 0; i < pl->nr; i++)
936 free(pl->patterns[i]);
937 free(pl->patterns);
938 free(pl->filebuf);
939 hashmap_clear_and_free(&pl->recursive_hashmap, struct pattern_entry, ent);
940 hashmap_clear_and_free(&pl->parent_hashmap, struct pattern_entry, ent);
942 memset(pl, 0, sizeof(*pl));
945 static void trim_trailing_spaces(char *buf)
947 char *p, *last_space = NULL;
949 for (p = buf; *p; p++)
950 switch (*p) {
951 case ' ':
952 if (!last_space)
953 last_space = p;
954 break;
955 case '\\':
956 p++;
957 if (!*p)
958 return;
959 /* fallthrough */
960 default:
961 last_space = NULL;
964 if (last_space)
965 *last_space = '\0';
969 * Given a subdirectory name and "dir" of the current directory,
970 * search the subdir in "dir" and return it, or create a new one if it
971 * does not exist in "dir".
973 * If "name" has the trailing slash, it'll be excluded in the search.
975 static struct untracked_cache_dir *lookup_untracked(struct untracked_cache *uc,
976 struct untracked_cache_dir *dir,
977 const char *name, int len)
979 int first, last;
980 struct untracked_cache_dir *d;
981 if (!dir)
982 return NULL;
983 if (len && name[len - 1] == '/')
984 len--;
985 first = 0;
986 last = dir->dirs_nr;
987 while (last > first) {
988 int cmp, next = first + ((last - first) >> 1);
989 d = dir->dirs[next];
990 cmp = strncmp(name, d->name, len);
991 if (!cmp && strlen(d->name) > len)
992 cmp = -1;
993 if (!cmp)
994 return d;
995 if (cmp < 0) {
996 last = next;
997 continue;
999 first = next+1;
1002 uc->dir_created++;
1003 FLEX_ALLOC_MEM(d, name, name, len);
1005 ALLOC_GROW(dir->dirs, dir->dirs_nr + 1, dir->dirs_alloc);
1006 MOVE_ARRAY(dir->dirs + first + 1, dir->dirs + first,
1007 dir->dirs_nr - first);
1008 dir->dirs_nr++;
1009 dir->dirs[first] = d;
1010 return d;
1013 static void do_invalidate_gitignore(struct untracked_cache_dir *dir)
1015 int i;
1016 dir->valid = 0;
1017 dir->untracked_nr = 0;
1018 for (i = 0; i < dir->dirs_nr; i++)
1019 do_invalidate_gitignore(dir->dirs[i]);
1022 static void invalidate_gitignore(struct untracked_cache *uc,
1023 struct untracked_cache_dir *dir)
1025 uc->gitignore_invalidated++;
1026 do_invalidate_gitignore(dir);
1029 static void invalidate_directory(struct untracked_cache *uc,
1030 struct untracked_cache_dir *dir)
1032 int i;
1035 * Invalidation increment here is just roughly correct. If
1036 * untracked_nr or any of dirs[].recurse is non-zero, we
1037 * should increment dir_invalidated too. But that's more
1038 * expensive to do.
1040 if (dir->valid)
1041 uc->dir_invalidated++;
1043 dir->valid = 0;
1044 dir->untracked_nr = 0;
1045 for (i = 0; i < dir->dirs_nr; i++)
1046 dir->dirs[i]->recurse = 0;
1049 static int add_patterns_from_buffer(char *buf, size_t size,
1050 const char *base, int baselen,
1051 struct pattern_list *pl);
1053 /* Flags for add_patterns() */
1054 #define PATTERN_NOFOLLOW (1<<0)
1057 * Given a file with name "fname", read it (either from disk, or from
1058 * an index if 'istate' is non-null), parse it and store the
1059 * exclude rules in "pl".
1061 * If "oid_stat" is not NULL, compute oid of the exclude file and fill
1062 * stat data from disk (only valid if add_patterns returns zero). If
1063 * oid_stat.valid is non-zero, "oid_stat" must contain good value as input.
1065 static int add_patterns(const char *fname, const char *base, int baselen,
1066 struct pattern_list *pl, struct index_state *istate,
1067 unsigned flags, struct oid_stat *oid_stat)
1069 struct stat st;
1070 int r;
1071 int fd;
1072 size_t size = 0;
1073 char *buf;
1075 if (flags & PATTERN_NOFOLLOW)
1076 fd = open_nofollow(fname, O_RDONLY);
1077 else
1078 fd = open(fname, O_RDONLY);
1080 if (fd < 0 || fstat(fd, &st) < 0) {
1081 if (fd < 0)
1082 warn_on_fopen_errors(fname);
1083 else
1084 close(fd);
1085 if (!istate)
1086 return -1;
1087 r = read_skip_worktree_file_from_index(istate, fname,
1088 &size, &buf,
1089 oid_stat);
1090 if (r != 1)
1091 return r;
1092 } else {
1093 size = xsize_t(st.st_size);
1094 if (size == 0) {
1095 if (oid_stat) {
1096 fill_stat_data(&oid_stat->stat, &st);
1097 oidcpy(&oid_stat->oid, the_hash_algo->empty_blob);
1098 oid_stat->valid = 1;
1100 close(fd);
1101 return 0;
1103 buf = xmallocz(size);
1104 if (read_in_full(fd, buf, size) != size) {
1105 free(buf);
1106 close(fd);
1107 return -1;
1109 buf[size++] = '\n';
1110 close(fd);
1111 if (oid_stat) {
1112 int pos;
1113 if (oid_stat->valid &&
1114 !match_stat_data_racy(istate, &oid_stat->stat, &st))
1115 ; /* no content change, oid_stat->oid still good */
1116 else if (istate &&
1117 (pos = index_name_pos(istate, fname, strlen(fname))) >= 0 &&
1118 !ce_stage(istate->cache[pos]) &&
1119 ce_uptodate(istate->cache[pos]) &&
1120 !would_convert_to_git(istate, fname))
1121 oidcpy(&oid_stat->oid,
1122 &istate->cache[pos]->oid);
1123 else
1124 hash_object_file(the_hash_algo, buf, size,
1125 "blob", &oid_stat->oid);
1126 fill_stat_data(&oid_stat->stat, &st);
1127 oid_stat->valid = 1;
1131 add_patterns_from_buffer(buf, size, base, baselen, pl);
1132 return 0;
1135 static int add_patterns_from_buffer(char *buf, size_t size,
1136 const char *base, int baselen,
1137 struct pattern_list *pl)
1139 int i, lineno = 1;
1140 char *entry;
1142 hashmap_init(&pl->recursive_hashmap, pl_hashmap_cmp, NULL, 0);
1143 hashmap_init(&pl->parent_hashmap, pl_hashmap_cmp, NULL, 0);
1145 pl->filebuf = buf;
1147 if (skip_utf8_bom(&buf, size))
1148 size -= buf - pl->filebuf;
1150 entry = buf;
1152 for (i = 0; i < size; i++) {
1153 if (buf[i] == '\n') {
1154 if (entry != buf + i && entry[0] != '#') {
1155 buf[i - (i && buf[i-1] == '\r')] = 0;
1156 trim_trailing_spaces(entry);
1157 add_pattern(entry, base, baselen, pl, lineno);
1159 lineno++;
1160 entry = buf + i + 1;
1163 return 0;
1166 int add_patterns_from_file_to_list(const char *fname, const char *base,
1167 int baselen, struct pattern_list *pl,
1168 struct index_state *istate,
1169 unsigned flags)
1171 return add_patterns(fname, base, baselen, pl, istate, flags, NULL);
1174 int add_patterns_from_blob_to_list(
1175 struct object_id *oid,
1176 const char *base, int baselen,
1177 struct pattern_list *pl)
1179 char *buf;
1180 size_t size;
1181 int r;
1183 r = do_read_blob(oid, NULL, &size, &buf);
1184 if (r != 1)
1185 return r;
1187 add_patterns_from_buffer(buf, size, base, baselen, pl);
1188 return 0;
1191 struct pattern_list *add_pattern_list(struct dir_struct *dir,
1192 int group_type, const char *src)
1194 struct pattern_list *pl;
1195 struct exclude_list_group *group;
1197 group = &dir->exclude_list_group[group_type];
1198 ALLOC_GROW(group->pl, group->nr + 1, group->alloc);
1199 pl = &group->pl[group->nr++];
1200 memset(pl, 0, sizeof(*pl));
1201 pl->src = src;
1202 return pl;
1206 * Used to set up core.excludesfile and .git/info/exclude lists.
1208 static void add_patterns_from_file_1(struct dir_struct *dir, const char *fname,
1209 struct oid_stat *oid_stat)
1211 struct pattern_list *pl;
1213 * catch setup_standard_excludes() that's called before
1214 * dir->untracked is assigned. That function behaves
1215 * differently when dir->untracked is non-NULL.
1217 if (!dir->untracked)
1218 dir->unmanaged_exclude_files++;
1219 pl = add_pattern_list(dir, EXC_FILE, fname);
1220 if (add_patterns(fname, "", 0, pl, NULL, 0, oid_stat) < 0)
1221 die(_("cannot use %s as an exclude file"), fname);
1224 void add_patterns_from_file(struct dir_struct *dir, const char *fname)
1226 dir->unmanaged_exclude_files++; /* see validate_untracked_cache() */
1227 add_patterns_from_file_1(dir, fname, NULL);
1230 int match_basename(const char *basename, int basenamelen,
1231 const char *pattern, int prefix, int patternlen,
1232 unsigned flags)
1234 if (prefix == patternlen) {
1235 if (patternlen == basenamelen &&
1236 !fspathncmp(pattern, basename, basenamelen))
1237 return 1;
1238 } else if (flags & PATTERN_FLAG_ENDSWITH) {
1239 /* "*literal" matching against "fooliteral" */
1240 if (patternlen - 1 <= basenamelen &&
1241 !fspathncmp(pattern + 1,
1242 basename + basenamelen - (patternlen - 1),
1243 patternlen - 1))
1244 return 1;
1245 } else {
1246 if (fnmatch_icase_mem(pattern, patternlen,
1247 basename, basenamelen,
1248 0) == 0)
1249 return 1;
1251 return 0;
1254 int match_pathname(const char *pathname, int pathlen,
1255 const char *base, int baselen,
1256 const char *pattern, int prefix, int patternlen,
1257 unsigned flags)
1259 const char *name;
1260 int namelen;
1263 * match with FNM_PATHNAME; the pattern has base implicitly
1264 * in front of it.
1266 if (*pattern == '/') {
1267 pattern++;
1268 patternlen--;
1269 prefix--;
1273 * baselen does not count the trailing slash. base[] may or
1274 * may not end with a trailing slash though.
1276 if (pathlen < baselen + 1 ||
1277 (baselen && pathname[baselen] != '/') ||
1278 fspathncmp(pathname, base, baselen))
1279 return 0;
1281 namelen = baselen ? pathlen - baselen - 1 : pathlen;
1282 name = pathname + pathlen - namelen;
1284 if (prefix) {
1286 * if the non-wildcard part is longer than the
1287 * remaining pathname, surely it cannot match.
1289 if (prefix > namelen)
1290 return 0;
1292 if (fspathncmp(pattern, name, prefix))
1293 return 0;
1294 pattern += prefix;
1295 patternlen -= prefix;
1296 name += prefix;
1297 namelen -= prefix;
1300 * If the whole pattern did not have a wildcard,
1301 * then our prefix match is all we need; we
1302 * do not need to call fnmatch at all.
1304 if (!patternlen && !namelen)
1305 return 1;
1308 return fnmatch_icase_mem(pattern, patternlen,
1309 name, namelen,
1310 WM_PATHNAME) == 0;
1314 * Scan the given exclude list in reverse to see whether pathname
1315 * should be ignored. The first match (i.e. the last on the list), if
1316 * any, determines the fate. Returns the exclude_list element which
1317 * matched, or NULL for undecided.
1319 static struct path_pattern *last_matching_pattern_from_list(const char *pathname,
1320 int pathlen,
1321 const char *basename,
1322 int *dtype,
1323 struct pattern_list *pl,
1324 struct index_state *istate)
1326 struct path_pattern *res = NULL; /* undecided */
1327 int i;
1329 if (!pl->nr)
1330 return NULL; /* undefined */
1332 for (i = pl->nr - 1; 0 <= i; i--) {
1333 struct path_pattern *pattern = pl->patterns[i];
1334 const char *exclude = pattern->pattern;
1335 int prefix = pattern->nowildcardlen;
1337 if (pattern->flags & PATTERN_FLAG_MUSTBEDIR) {
1338 *dtype = resolve_dtype(*dtype, istate, pathname, pathlen);
1339 if (*dtype != DT_DIR)
1340 continue;
1343 if (pattern->flags & PATTERN_FLAG_NODIR) {
1344 if (match_basename(basename,
1345 pathlen - (basename - pathname),
1346 exclude, prefix, pattern->patternlen,
1347 pattern->flags)) {
1348 res = pattern;
1349 break;
1351 continue;
1354 assert(pattern->baselen == 0 ||
1355 pattern->base[pattern->baselen - 1] == '/');
1356 if (match_pathname(pathname, pathlen,
1357 pattern->base,
1358 pattern->baselen ? pattern->baselen - 1 : 0,
1359 exclude, prefix, pattern->patternlen,
1360 pattern->flags)) {
1361 res = pattern;
1362 break;
1365 return res;
1369 * Scan the list of patterns to determine if the ordered list
1370 * of patterns matches on 'pathname'.
1372 * Return 1 for a match, 0 for not matched and -1 for undecided.
1374 enum pattern_match_result path_matches_pattern_list(
1375 const char *pathname, int pathlen,
1376 const char *basename, int *dtype,
1377 struct pattern_list *pl,
1378 struct index_state *istate)
1380 struct path_pattern *pattern;
1381 struct strbuf parent_pathname = STRBUF_INIT;
1382 int result = NOT_MATCHED;
1383 const char *slash_pos;
1385 if (!pl->use_cone_patterns) {
1386 pattern = last_matching_pattern_from_list(pathname, pathlen, basename,
1387 dtype, pl, istate);
1388 if (pattern) {
1389 if (pattern->flags & PATTERN_FLAG_NEGATIVE)
1390 return NOT_MATCHED;
1391 else
1392 return MATCHED;
1395 return UNDECIDED;
1398 if (pl->full_cone)
1399 return MATCHED;
1401 strbuf_addch(&parent_pathname, '/');
1402 strbuf_add(&parent_pathname, pathname, pathlen);
1404 if (hashmap_contains_path(&pl->recursive_hashmap,
1405 &parent_pathname)) {
1406 result = MATCHED_RECURSIVE;
1407 goto done;
1410 slash_pos = strrchr(parent_pathname.buf, '/');
1412 if (slash_pos == parent_pathname.buf) {
1413 /* include every file in root */
1414 result = MATCHED;
1415 goto done;
1418 strbuf_setlen(&parent_pathname, slash_pos - parent_pathname.buf);
1420 if (hashmap_contains_path(&pl->parent_hashmap, &parent_pathname)) {
1421 result = MATCHED;
1422 goto done;
1425 if (hashmap_contains_parent(&pl->recursive_hashmap,
1426 pathname,
1427 &parent_pathname))
1428 result = MATCHED_RECURSIVE;
1430 done:
1431 strbuf_release(&parent_pathname);
1432 return result;
1435 static struct path_pattern *last_matching_pattern_from_lists(
1436 struct dir_struct *dir, struct index_state *istate,
1437 const char *pathname, int pathlen,
1438 const char *basename, int *dtype_p)
1440 int i, j;
1441 struct exclude_list_group *group;
1442 struct path_pattern *pattern;
1443 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
1444 group = &dir->exclude_list_group[i];
1445 for (j = group->nr - 1; j >= 0; j--) {
1446 pattern = last_matching_pattern_from_list(
1447 pathname, pathlen, basename, dtype_p,
1448 &group->pl[j], istate);
1449 if (pattern)
1450 return pattern;
1453 return NULL;
1457 * Loads the per-directory exclude list for the substring of base
1458 * which has a char length of baselen.
1460 static void prep_exclude(struct dir_struct *dir,
1461 struct index_state *istate,
1462 const char *base, int baselen)
1464 struct exclude_list_group *group;
1465 struct pattern_list *pl;
1466 struct exclude_stack *stk = NULL;
1467 struct untracked_cache_dir *untracked;
1468 int current;
1470 group = &dir->exclude_list_group[EXC_DIRS];
1473 * Pop the exclude lists from the EXCL_DIRS exclude_list_group
1474 * which originate from directories not in the prefix of the
1475 * path being checked.
1477 while ((stk = dir->exclude_stack) != NULL) {
1478 if (stk->baselen <= baselen &&
1479 !strncmp(dir->basebuf.buf, base, stk->baselen))
1480 break;
1481 pl = &group->pl[dir->exclude_stack->exclude_ix];
1482 dir->exclude_stack = stk->prev;
1483 dir->pattern = NULL;
1484 free((char *)pl->src); /* see strbuf_detach() below */
1485 clear_pattern_list(pl);
1486 free(stk);
1487 group->nr--;
1490 /* Skip traversing into sub directories if the parent is excluded */
1491 if (dir->pattern)
1492 return;
1495 * Lazy initialization. All call sites currently just
1496 * memset(dir, 0, sizeof(*dir)) before use. Changing all of
1497 * them seems lots of work for little benefit.
1499 if (!dir->basebuf.buf)
1500 strbuf_init(&dir->basebuf, PATH_MAX);
1502 /* Read from the parent directories and push them down. */
1503 current = stk ? stk->baselen : -1;
1504 strbuf_setlen(&dir->basebuf, current < 0 ? 0 : current);
1505 if (dir->untracked)
1506 untracked = stk ? stk->ucd : dir->untracked->root;
1507 else
1508 untracked = NULL;
1510 while (current < baselen) {
1511 const char *cp;
1512 struct oid_stat oid_stat;
1514 CALLOC_ARRAY(stk, 1);
1515 if (current < 0) {
1516 cp = base;
1517 current = 0;
1518 } else {
1519 cp = strchr(base + current + 1, '/');
1520 if (!cp)
1521 die("oops in prep_exclude");
1522 cp++;
1523 untracked =
1524 lookup_untracked(dir->untracked, untracked,
1525 base + current,
1526 cp - base - current);
1528 stk->prev = dir->exclude_stack;
1529 stk->baselen = cp - base;
1530 stk->exclude_ix = group->nr;
1531 stk->ucd = untracked;
1532 pl = add_pattern_list(dir, EXC_DIRS, NULL);
1533 strbuf_add(&dir->basebuf, base + current, stk->baselen - current);
1534 assert(stk->baselen == dir->basebuf.len);
1536 /* Abort if the directory is excluded */
1537 if (stk->baselen) {
1538 int dt = DT_DIR;
1539 dir->basebuf.buf[stk->baselen - 1] = 0;
1540 dir->pattern = last_matching_pattern_from_lists(dir,
1541 istate,
1542 dir->basebuf.buf, stk->baselen - 1,
1543 dir->basebuf.buf + current, &dt);
1544 dir->basebuf.buf[stk->baselen - 1] = '/';
1545 if (dir->pattern &&
1546 dir->pattern->flags & PATTERN_FLAG_NEGATIVE)
1547 dir->pattern = NULL;
1548 if (dir->pattern) {
1549 dir->exclude_stack = stk;
1550 return;
1554 /* Try to read per-directory file */
1555 oidclr(&oid_stat.oid);
1556 oid_stat.valid = 0;
1557 if (dir->exclude_per_dir &&
1559 * If we know that no files have been added in
1560 * this directory (i.e. valid_cached_dir() has
1561 * been executed and set untracked->valid) ..
1563 (!untracked || !untracked->valid ||
1565 * .. and .gitignore does not exist before
1566 * (i.e. null exclude_oid). Then we can skip
1567 * loading .gitignore, which would result in
1568 * ENOENT anyway.
1570 !is_null_oid(&untracked->exclude_oid))) {
1572 * dir->basebuf gets reused by the traversal, but we
1573 * need fname to remain unchanged to ensure the src
1574 * member of each struct path_pattern correctly
1575 * back-references its source file. Other invocations
1576 * of add_pattern_list provide stable strings, so we
1577 * strbuf_detach() and free() here in the caller.
1579 struct strbuf sb = STRBUF_INIT;
1580 strbuf_addbuf(&sb, &dir->basebuf);
1581 strbuf_addstr(&sb, dir->exclude_per_dir);
1582 pl->src = strbuf_detach(&sb, NULL);
1583 add_patterns(pl->src, pl->src, stk->baselen, pl, istate,
1584 PATTERN_NOFOLLOW,
1585 untracked ? &oid_stat : NULL);
1588 * NEEDSWORK: when untracked cache is enabled, prep_exclude()
1589 * will first be called in valid_cached_dir() then maybe many
1590 * times more in last_matching_pattern(). When the cache is
1591 * used, last_matching_pattern() will not be called and
1592 * reading .gitignore content will be a waste.
1594 * So when it's called by valid_cached_dir() and we can get
1595 * .gitignore SHA-1 from the index (i.e. .gitignore is not
1596 * modified on work tree), we could delay reading the
1597 * .gitignore content until we absolutely need it in
1598 * last_matching_pattern(). Be careful about ignore rule
1599 * order, though, if you do that.
1601 if (untracked &&
1602 !oideq(&oid_stat.oid, &untracked->exclude_oid)) {
1603 invalidate_gitignore(dir->untracked, untracked);
1604 oidcpy(&untracked->exclude_oid, &oid_stat.oid);
1606 dir->exclude_stack = stk;
1607 current = stk->baselen;
1609 strbuf_setlen(&dir->basebuf, baselen);
1613 * Loads the exclude lists for the directory containing pathname, then
1614 * scans all exclude lists to determine whether pathname is excluded.
1615 * Returns the exclude_list element which matched, or NULL for
1616 * undecided.
1618 struct path_pattern *last_matching_pattern(struct dir_struct *dir,
1619 struct index_state *istate,
1620 const char *pathname,
1621 int *dtype_p)
1623 int pathlen = strlen(pathname);
1624 const char *basename = strrchr(pathname, '/');
1625 basename = (basename) ? basename+1 : pathname;
1627 prep_exclude(dir, istate, pathname, basename-pathname);
1629 if (dir->pattern)
1630 return dir->pattern;
1632 return last_matching_pattern_from_lists(dir, istate, pathname, pathlen,
1633 basename, dtype_p);
1637 * Loads the exclude lists for the directory containing pathname, then
1638 * scans all exclude lists to determine whether pathname is excluded.
1639 * Returns 1 if true, otherwise 0.
1641 int is_excluded(struct dir_struct *dir, struct index_state *istate,
1642 const char *pathname, int *dtype_p)
1644 struct path_pattern *pattern =
1645 last_matching_pattern(dir, istate, pathname, dtype_p);
1646 if (pattern)
1647 return pattern->flags & PATTERN_FLAG_NEGATIVE ? 0 : 1;
1648 return 0;
1651 static struct dir_entry *dir_entry_new(const char *pathname, int len)
1653 struct dir_entry *ent;
1655 FLEX_ALLOC_MEM(ent, name, pathname, len);
1656 ent->len = len;
1657 return ent;
1660 static struct dir_entry *dir_add_name(struct dir_struct *dir,
1661 struct index_state *istate,
1662 const char *pathname, int len)
1664 if (index_file_exists(istate, pathname, len, ignore_case))
1665 return NULL;
1667 ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc);
1668 return dir->entries[dir->nr++] = dir_entry_new(pathname, len);
1671 struct dir_entry *dir_add_ignored(struct dir_struct *dir,
1672 struct index_state *istate,
1673 const char *pathname, int len)
1675 if (!index_name_is_other(istate, pathname, len))
1676 return NULL;
1678 ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc);
1679 return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);
1682 enum exist_status {
1683 index_nonexistent = 0,
1684 index_directory,
1685 index_gitdir
1689 * Do not use the alphabetically sorted index to look up
1690 * the directory name; instead, use the case insensitive
1691 * directory hash.
1693 static enum exist_status directory_exists_in_index_icase(struct index_state *istate,
1694 const char *dirname, int len)
1696 struct cache_entry *ce;
1698 if (index_dir_exists(istate, dirname, len))
1699 return index_directory;
1701 ce = index_file_exists(istate, dirname, len, ignore_case);
1702 if (ce && S_ISGITLINK(ce->ce_mode))
1703 return index_gitdir;
1705 return index_nonexistent;
1709 * The index sorts alphabetically by entry name, which
1710 * means that a gitlink sorts as '\0' at the end, while
1711 * a directory (which is defined not as an entry, but as
1712 * the files it contains) will sort with the '/' at the
1713 * end.
1715 static enum exist_status directory_exists_in_index(struct index_state *istate,
1716 const char *dirname, int len)
1718 int pos;
1720 if (ignore_case)
1721 return directory_exists_in_index_icase(istate, dirname, len);
1723 pos = index_name_pos(istate, dirname, len);
1724 if (pos < 0)
1725 pos = -pos-1;
1726 while (pos < istate->cache_nr) {
1727 const struct cache_entry *ce = istate->cache[pos++];
1728 unsigned char endchar;
1730 if (strncmp(ce->name, dirname, len))
1731 break;
1732 endchar = ce->name[len];
1733 if (endchar > '/')
1734 break;
1735 if (endchar == '/')
1736 return index_directory;
1737 if (!endchar && S_ISGITLINK(ce->ce_mode))
1738 return index_gitdir;
1740 return index_nonexistent;
1744 * When we find a directory when traversing the filesystem, we
1745 * have three distinct cases:
1747 * - ignore it
1748 * - see it as a directory
1749 * - recurse into it
1751 * and which one we choose depends on a combination of existing
1752 * git index contents and the flags passed into the directory
1753 * traversal routine.
1755 * Case 1: If we *already* have entries in the index under that
1756 * directory name, we always recurse into the directory to see
1757 * all the files.
1759 * Case 2: If we *already* have that directory name as a gitlink,
1760 * we always continue to see it as a gitlink, regardless of whether
1761 * there is an actual git directory there or not (it might not
1762 * be checked out as a subproject!)
1764 * Case 3: if we didn't have it in the index previously, we
1765 * have a few sub-cases:
1767 * (a) if DIR_SHOW_OTHER_DIRECTORIES flag is set, we show it as
1768 * just a directory, unless DIR_HIDE_EMPTY_DIRECTORIES is
1769 * also true, in which case we need to check if it contains any
1770 * untracked and / or ignored files.
1771 * (b) if it looks like a git directory and we don't have the
1772 * DIR_NO_GITLINKS flag, then we treat it as a gitlink, and
1773 * show it as a directory.
1774 * (c) otherwise, we recurse into it.
1776 static enum path_treatment treat_directory(struct dir_struct *dir,
1777 struct index_state *istate,
1778 struct untracked_cache_dir *untracked,
1779 const char *dirname, int len, int baselen, int excluded,
1780 const struct pathspec *pathspec)
1783 * WARNING: From this function, you can return path_recurse or you
1784 * can call read_directory_recursive() (or neither), but
1785 * you CAN'T DO BOTH.
1787 enum path_treatment state;
1788 int matches_how = 0;
1789 int nested_repo = 0, check_only, stop_early;
1790 int old_ignored_nr, old_untracked_nr;
1791 /* The "len-1" is to strip the final '/' */
1792 enum exist_status status = directory_exists_in_index(istate, dirname, len-1);
1794 if (status == index_directory)
1795 return path_recurse;
1796 if (status == index_gitdir)
1797 return path_none;
1798 if (status != index_nonexistent)
1799 BUG("Unhandled value for directory_exists_in_index: %d\n", status);
1802 * We don't want to descend into paths that don't match the necessary
1803 * patterns. Clearly, if we don't have a pathspec, then we can't check
1804 * for matching patterns. Also, if (excluded) then we know we matched
1805 * the exclusion patterns so as an optimization we can skip checking
1806 * for matching patterns.
1808 if (pathspec && !excluded) {
1809 matches_how = match_pathspec_with_flags(istate, pathspec,
1810 dirname, len,
1811 0 /* prefix */,
1812 NULL /* seen */,
1813 DO_MATCH_LEADING_PATHSPEC);
1814 if (!matches_how)
1815 return path_none;
1819 if ((dir->flags & DIR_SKIP_NESTED_GIT) ||
1820 !(dir->flags & DIR_NO_GITLINKS)) {
1821 struct strbuf sb = STRBUF_INIT;
1822 strbuf_addstr(&sb, dirname);
1823 nested_repo = is_nonbare_repository_dir(&sb);
1824 strbuf_release(&sb);
1826 if (nested_repo) {
1827 if ((dir->flags & DIR_SKIP_NESTED_GIT) ||
1828 (matches_how == MATCHED_RECURSIVELY_LEADING_PATHSPEC))
1829 return path_none;
1830 return excluded ? path_excluded : path_untracked;
1833 if (!(dir->flags & DIR_SHOW_OTHER_DIRECTORIES)) {
1834 if (excluded &&
1835 (dir->flags & DIR_SHOW_IGNORED_TOO) &&
1836 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING)) {
1839 * This is an excluded directory and we are
1840 * showing ignored paths that match an exclude
1841 * pattern. (e.g. show directory as ignored
1842 * only if it matches an exclude pattern).
1843 * This path will either be 'path_excluded`
1844 * (if we are showing empty directories or if
1845 * the directory is not empty), or will be
1846 * 'path_none' (empty directory, and we are
1847 * not showing empty directories).
1849 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
1850 return path_excluded;
1852 if (read_directory_recursive(dir, istate, dirname, len,
1853 untracked, 1, 1, pathspec) == path_excluded)
1854 return path_excluded;
1856 return path_none;
1858 return path_recurse;
1861 assert(dir->flags & DIR_SHOW_OTHER_DIRECTORIES);
1864 * If we have a pathspec which could match something _below_ this
1865 * directory (e.g. when checking 'subdir/' having a pathspec like
1866 * 'subdir/some/deep/path/file' or 'subdir/widget-*.c'), then we
1867 * need to recurse.
1869 if (matches_how == MATCHED_RECURSIVELY_LEADING_PATHSPEC)
1870 return path_recurse;
1872 /* Special cases for where this directory is excluded/ignored */
1873 if (excluded) {
1875 * If DIR_SHOW_OTHER_DIRECTORIES is set and we're not
1876 * hiding empty directories, there is no need to
1877 * recurse into an ignored directory.
1879 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
1880 return path_excluded;
1883 * Even if we are hiding empty directories, we can still avoid
1884 * recursing into ignored directories for DIR_SHOW_IGNORED_TOO
1885 * if DIR_SHOW_IGNORED_TOO_MODE_MATCHING is also set.
1887 if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
1888 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING))
1889 return path_excluded;
1893 * Other than the path_recurse case above, we only need to
1894 * recurse into untracked directories if any of the following
1895 * bits is set:
1896 * - DIR_SHOW_IGNORED (because then we need to determine if
1897 * there are ignored entries below)
1898 * - DIR_SHOW_IGNORED_TOO (same as above)
1899 * - DIR_HIDE_EMPTY_DIRECTORIES (because we have to determine if
1900 * the directory is empty)
1902 if (!excluded &&
1903 !(dir->flags & (DIR_SHOW_IGNORED |
1904 DIR_SHOW_IGNORED_TOO |
1905 DIR_HIDE_EMPTY_DIRECTORIES))) {
1906 return path_untracked;
1910 * Even if we don't want to know all the paths under an untracked or
1911 * ignored directory, we may still need to go into the directory to
1912 * determine if it is empty (because with DIR_HIDE_EMPTY_DIRECTORIES,
1913 * an empty directory should be path_none instead of path_excluded or
1914 * path_untracked).
1916 check_only = ((dir->flags & DIR_HIDE_EMPTY_DIRECTORIES) &&
1917 !(dir->flags & DIR_SHOW_IGNORED_TOO));
1920 * However, there's another optimization possible as a subset of
1921 * check_only, based on the cases we have to consider:
1922 * A) Directory matches no exclude patterns:
1923 * * Directory is empty => path_none
1924 * * Directory has an untracked file under it => path_untracked
1925 * * Directory has only ignored files under it => path_excluded
1926 * B) Directory matches an exclude pattern:
1927 * * Directory is empty => path_none
1928 * * Directory has an untracked file under it => path_excluded
1929 * * Directory has only ignored files under it => path_excluded
1930 * In case A, we can exit as soon as we've found an untracked
1931 * file but otherwise have to walk all files. In case B, though,
1932 * we can stop at the first file we find under the directory.
1934 stop_early = check_only && excluded;
1937 * If /every/ file within an untracked directory is ignored, then
1938 * we want to treat the directory as ignored (for e.g. status
1939 * --porcelain), without listing the individual ignored files
1940 * underneath. To do so, we'll save the current ignored_nr, and
1941 * pop all the ones added after it if it turns out the entire
1942 * directory is ignored. Also, when DIR_SHOW_IGNORED_TOO and
1943 * !DIR_KEEP_UNTRACKED_CONTENTS then we don't want to show
1944 * untracked paths so will need to pop all those off the last
1945 * after we traverse.
1947 old_ignored_nr = dir->ignored_nr;
1948 old_untracked_nr = dir->nr;
1950 /* Actually recurse into dirname now, we'll fixup the state later. */
1951 untracked = lookup_untracked(dir->untracked, untracked,
1952 dirname + baselen, len - baselen);
1953 state = read_directory_recursive(dir, istate, dirname, len, untracked,
1954 check_only, stop_early, pathspec);
1956 /* There are a variety of reasons we may need to fixup the state... */
1957 if (state == path_excluded) {
1958 /* state == path_excluded implies all paths under
1959 * dirname were ignored...
1961 * if running e.g. `git status --porcelain --ignored=matching`,
1962 * then we want to see the subpaths that are ignored.
1964 * if running e.g. just `git status --porcelain`, then
1965 * we just want the directory itself to be listed as ignored
1966 * and not the individual paths underneath.
1968 int want_ignored_subpaths =
1969 ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
1970 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING));
1972 if (want_ignored_subpaths) {
1974 * with --ignored=matching, we want the subpaths
1975 * INSTEAD of the directory itself.
1977 state = path_none;
1978 } else {
1979 int i;
1980 for (i = old_ignored_nr + 1; i<dir->ignored_nr; ++i)
1981 FREE_AND_NULL(dir->ignored[i]);
1982 dir->ignored_nr = old_ignored_nr;
1987 * We may need to ignore some of the untracked paths we found while
1988 * traversing subdirectories.
1990 if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
1991 !(dir->flags & DIR_KEEP_UNTRACKED_CONTENTS)) {
1992 int i;
1993 for (i = old_untracked_nr + 1; i<dir->nr; ++i)
1994 FREE_AND_NULL(dir->entries[i]);
1995 dir->nr = old_untracked_nr;
1999 * If there is nothing under the current directory and we are not
2000 * hiding empty directories, then we need to report on the
2001 * untracked or ignored status of the directory itself.
2003 if (state == path_none && !(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
2004 state = excluded ? path_excluded : path_untracked;
2006 return state;
2010 * This is an inexact early pruning of any recursive directory
2011 * reading - if the path cannot possibly be in the pathspec,
2012 * return true, and we'll skip it early.
2014 static int simplify_away(const char *path, int pathlen,
2015 const struct pathspec *pathspec)
2017 int i;
2019 if (!pathspec || !pathspec->nr)
2020 return 0;
2022 GUARD_PATHSPEC(pathspec,
2023 PATHSPEC_FROMTOP |
2024 PATHSPEC_MAXDEPTH |
2025 PATHSPEC_LITERAL |
2026 PATHSPEC_GLOB |
2027 PATHSPEC_ICASE |
2028 PATHSPEC_EXCLUDE |
2029 PATHSPEC_ATTR);
2031 for (i = 0; i < pathspec->nr; i++) {
2032 const struct pathspec_item *item = &pathspec->items[i];
2033 int len = item->nowildcard_len;
2035 if (len > pathlen)
2036 len = pathlen;
2037 if (!ps_strncmp(item, item->match, path, len))
2038 return 0;
2041 return 1;
2045 * This function tells us whether an excluded path matches a
2046 * list of "interesting" pathspecs. That is, whether a path matched
2047 * by any of the pathspecs could possibly be ignored by excluding
2048 * the specified path. This can happen if:
2050 * 1. the path is mentioned explicitly in the pathspec
2052 * 2. the path is a directory prefix of some element in the
2053 * pathspec
2055 static int exclude_matches_pathspec(const char *path, int pathlen,
2056 const struct pathspec *pathspec)
2058 int i;
2060 if (!pathspec || !pathspec->nr)
2061 return 0;
2063 GUARD_PATHSPEC(pathspec,
2064 PATHSPEC_FROMTOP |
2065 PATHSPEC_MAXDEPTH |
2066 PATHSPEC_LITERAL |
2067 PATHSPEC_GLOB |
2068 PATHSPEC_ICASE |
2069 PATHSPEC_EXCLUDE);
2071 for (i = 0; i < pathspec->nr; i++) {
2072 const struct pathspec_item *item = &pathspec->items[i];
2073 int len = item->nowildcard_len;
2075 if (len == pathlen &&
2076 !ps_strncmp(item, item->match, path, pathlen))
2077 return 1;
2078 if (len > pathlen &&
2079 item->match[pathlen] == '/' &&
2080 !ps_strncmp(item, item->match, path, pathlen))
2081 return 1;
2083 return 0;
2086 static int get_index_dtype(struct index_state *istate,
2087 const char *path, int len)
2089 int pos;
2090 const struct cache_entry *ce;
2092 ce = index_file_exists(istate, path, len, 0);
2093 if (ce) {
2094 if (!ce_uptodate(ce))
2095 return DT_UNKNOWN;
2096 if (S_ISGITLINK(ce->ce_mode))
2097 return DT_DIR;
2099 * Nobody actually cares about the
2100 * difference between DT_LNK and DT_REG
2102 return DT_REG;
2105 /* Try to look it up as a directory */
2106 pos = index_name_pos(istate, path, len);
2107 if (pos >= 0)
2108 return DT_UNKNOWN;
2109 pos = -pos-1;
2110 while (pos < istate->cache_nr) {
2111 ce = istate->cache[pos++];
2112 if (strncmp(ce->name, path, len))
2113 break;
2114 if (ce->name[len] > '/')
2115 break;
2116 if (ce->name[len] < '/')
2117 continue;
2118 if (!ce_uptodate(ce))
2119 break; /* continue? */
2120 return DT_DIR;
2122 return DT_UNKNOWN;
2125 static int resolve_dtype(int dtype, struct index_state *istate,
2126 const char *path, int len)
2128 struct stat st;
2130 if (dtype != DT_UNKNOWN)
2131 return dtype;
2132 dtype = get_index_dtype(istate, path, len);
2133 if (dtype != DT_UNKNOWN)
2134 return dtype;
2135 if (lstat(path, &st))
2136 return dtype;
2137 if (S_ISREG(st.st_mode))
2138 return DT_REG;
2139 if (S_ISDIR(st.st_mode))
2140 return DT_DIR;
2141 if (S_ISLNK(st.st_mode))
2142 return DT_LNK;
2143 return dtype;
2146 static enum path_treatment treat_path_fast(struct dir_struct *dir,
2147 struct cached_dir *cdir,
2148 struct index_state *istate,
2149 struct strbuf *path,
2150 int baselen,
2151 const struct pathspec *pathspec)
2154 * WARNING: From this function, you can return path_recurse or you
2155 * can call read_directory_recursive() (or neither), but
2156 * you CAN'T DO BOTH.
2158 strbuf_setlen(path, baselen);
2159 if (!cdir->ucd) {
2160 strbuf_addstr(path, cdir->file);
2161 return path_untracked;
2163 strbuf_addstr(path, cdir->ucd->name);
2164 /* treat_one_path() does this before it calls treat_directory() */
2165 strbuf_complete(path, '/');
2166 if (cdir->ucd->check_only)
2168 * check_only is set as a result of treat_directory() getting
2169 * to its bottom. Verify again the same set of directories
2170 * with check_only set.
2172 return read_directory_recursive(dir, istate, path->buf, path->len,
2173 cdir->ucd, 1, 0, pathspec);
2175 * We get path_recurse in the first run when
2176 * directory_exists_in_index() returns index_nonexistent. We
2177 * are sure that new changes in the index does not impact the
2178 * outcome. Return now.
2180 return path_recurse;
2183 static enum path_treatment treat_path(struct dir_struct *dir,
2184 struct untracked_cache_dir *untracked,
2185 struct cached_dir *cdir,
2186 struct index_state *istate,
2187 struct strbuf *path,
2188 int baselen,
2189 const struct pathspec *pathspec)
2191 int has_path_in_index, dtype, excluded;
2193 if (!cdir->d_name)
2194 return treat_path_fast(dir, cdir, istate, path,
2195 baselen, pathspec);
2196 if (is_dot_or_dotdot(cdir->d_name) || !fspathcmp(cdir->d_name, ".git"))
2197 return path_none;
2198 strbuf_setlen(path, baselen);
2199 strbuf_addstr(path, cdir->d_name);
2200 if (simplify_away(path->buf, path->len, pathspec))
2201 return path_none;
2203 dtype = resolve_dtype(cdir->d_type, istate, path->buf, path->len);
2205 /* Always exclude indexed files */
2206 has_path_in_index = !!index_file_exists(istate, path->buf, path->len,
2207 ignore_case);
2208 if (dtype != DT_DIR && has_path_in_index)
2209 return path_none;
2212 * When we are looking at a directory P in the working tree,
2213 * there are three cases:
2215 * (1) P exists in the index. Everything inside the directory P in
2216 * the working tree needs to go when P is checked out from the
2217 * index.
2219 * (2) P does not exist in the index, but there is P/Q in the index.
2220 * We know P will stay a directory when we check out the contents
2221 * of the index, but we do not know yet if there is a directory
2222 * P/Q in the working tree to be killed, so we need to recurse.
2224 * (3) P does not exist in the index, and there is no P/Q in the index
2225 * to require P to be a directory, either. Only in this case, we
2226 * know that everything inside P will not be killed without
2227 * recursing.
2229 if ((dir->flags & DIR_COLLECT_KILLED_ONLY) &&
2230 (dtype == DT_DIR) &&
2231 !has_path_in_index &&
2232 (directory_exists_in_index(istate, path->buf, path->len) == index_nonexistent))
2233 return path_none;
2235 excluded = is_excluded(dir, istate, path->buf, &dtype);
2238 * Excluded? If we don't explicitly want to show
2239 * ignored files, ignore it
2241 if (excluded && !(dir->flags & (DIR_SHOW_IGNORED|DIR_SHOW_IGNORED_TOO)))
2242 return path_excluded;
2244 switch (dtype) {
2245 default:
2246 return path_none;
2247 case DT_DIR:
2249 * WARNING: Do not ignore/amend the return value from
2250 * treat_directory(), and especially do not change it to return
2251 * path_recurse as that can cause exponential slowdown.
2252 * Instead, modify treat_directory() to return the right value.
2254 strbuf_addch(path, '/');
2255 return treat_directory(dir, istate, untracked,
2256 path->buf, path->len,
2257 baselen, excluded, pathspec);
2258 case DT_REG:
2259 case DT_LNK:
2260 if (pathspec &&
2261 !match_pathspec(istate, pathspec, path->buf, path->len,
2262 0 /* prefix */, NULL /* seen */,
2263 0 /* is_dir */))
2264 return path_none;
2265 if (excluded)
2266 return path_excluded;
2267 return path_untracked;
2271 static void add_untracked(struct untracked_cache_dir *dir, const char *name)
2273 if (!dir)
2274 return;
2275 ALLOC_GROW(dir->untracked, dir->untracked_nr + 1,
2276 dir->untracked_alloc);
2277 dir->untracked[dir->untracked_nr++] = xstrdup(name);
2280 static int valid_cached_dir(struct dir_struct *dir,
2281 struct untracked_cache_dir *untracked,
2282 struct index_state *istate,
2283 struct strbuf *path,
2284 int check_only)
2286 struct stat st;
2288 if (!untracked)
2289 return 0;
2292 * With fsmonitor, we can trust the untracked cache's valid field.
2294 refresh_fsmonitor(istate);
2295 if (!(dir->untracked->use_fsmonitor && untracked->valid)) {
2296 if (lstat(path->len ? path->buf : ".", &st)) {
2297 memset(&untracked->stat_data, 0, sizeof(untracked->stat_data));
2298 return 0;
2300 if (!untracked->valid ||
2301 match_stat_data_racy(istate, &untracked->stat_data, &st)) {
2302 fill_stat_data(&untracked->stat_data, &st);
2303 return 0;
2307 if (untracked->check_only != !!check_only)
2308 return 0;
2311 * prep_exclude will be called eventually on this directory,
2312 * but it's called much later in last_matching_pattern(). We
2313 * need it now to determine the validity of the cache for this
2314 * path. The next calls will be nearly no-op, the way
2315 * prep_exclude() is designed.
2317 if (path->len && path->buf[path->len - 1] != '/') {
2318 strbuf_addch(path, '/');
2319 prep_exclude(dir, istate, path->buf, path->len);
2320 strbuf_setlen(path, path->len - 1);
2321 } else
2322 prep_exclude(dir, istate, path->buf, path->len);
2324 /* hopefully prep_exclude() haven't invalidated this entry... */
2325 return untracked->valid;
2328 static int open_cached_dir(struct cached_dir *cdir,
2329 struct dir_struct *dir,
2330 struct untracked_cache_dir *untracked,
2331 struct index_state *istate,
2332 struct strbuf *path,
2333 int check_only)
2335 const char *c_path;
2337 memset(cdir, 0, sizeof(*cdir));
2338 cdir->untracked = untracked;
2339 if (valid_cached_dir(dir, untracked, istate, path, check_only))
2340 return 0;
2341 c_path = path->len ? path->buf : ".";
2342 cdir->fdir = opendir(c_path);
2343 if (!cdir->fdir)
2344 warning_errno(_("could not open directory '%s'"), c_path);
2345 if (dir->untracked) {
2346 invalidate_directory(dir->untracked, untracked);
2347 dir->untracked->dir_opened++;
2349 if (!cdir->fdir)
2350 return -1;
2351 return 0;
2354 static int read_cached_dir(struct cached_dir *cdir)
2356 struct dirent *de;
2358 if (cdir->fdir) {
2359 de = readdir_skip_dot_and_dotdot(cdir->fdir);
2360 if (!de) {
2361 cdir->d_name = NULL;
2362 cdir->d_type = DT_UNKNOWN;
2363 return -1;
2365 cdir->d_name = de->d_name;
2366 cdir->d_type = DTYPE(de);
2367 return 0;
2369 while (cdir->nr_dirs < cdir->untracked->dirs_nr) {
2370 struct untracked_cache_dir *d = cdir->untracked->dirs[cdir->nr_dirs];
2371 if (!d->recurse) {
2372 cdir->nr_dirs++;
2373 continue;
2375 cdir->ucd = d;
2376 cdir->nr_dirs++;
2377 return 0;
2379 cdir->ucd = NULL;
2380 if (cdir->nr_files < cdir->untracked->untracked_nr) {
2381 struct untracked_cache_dir *d = cdir->untracked;
2382 cdir->file = d->untracked[cdir->nr_files++];
2383 return 0;
2385 return -1;
2388 static void close_cached_dir(struct cached_dir *cdir)
2390 if (cdir->fdir)
2391 closedir(cdir->fdir);
2393 * We have gone through this directory and found no untracked
2394 * entries. Mark it valid.
2396 if (cdir->untracked) {
2397 cdir->untracked->valid = 1;
2398 cdir->untracked->recurse = 1;
2402 static void add_path_to_appropriate_result_list(struct dir_struct *dir,
2403 struct untracked_cache_dir *untracked,
2404 struct cached_dir *cdir,
2405 struct index_state *istate,
2406 struct strbuf *path,
2407 int baselen,
2408 const struct pathspec *pathspec,
2409 enum path_treatment state)
2411 /* add the path to the appropriate result list */
2412 switch (state) {
2413 case path_excluded:
2414 if (dir->flags & DIR_SHOW_IGNORED)
2415 dir_add_name(dir, istate, path->buf, path->len);
2416 else if ((dir->flags & DIR_SHOW_IGNORED_TOO) ||
2417 ((dir->flags & DIR_COLLECT_IGNORED) &&
2418 exclude_matches_pathspec(path->buf, path->len,
2419 pathspec)))
2420 dir_add_ignored(dir, istate, path->buf, path->len);
2421 break;
2423 case path_untracked:
2424 if (dir->flags & DIR_SHOW_IGNORED)
2425 break;
2426 dir_add_name(dir, istate, path->buf, path->len);
2427 if (cdir->fdir)
2428 add_untracked(untracked, path->buf + baselen);
2429 break;
2431 default:
2432 break;
2437 * Read a directory tree. We currently ignore anything but
2438 * directories, regular files and symlinks. That's because git
2439 * doesn't handle them at all yet. Maybe that will change some
2440 * day.
2442 * Also, we ignore the name ".git" (even if it is not a directory).
2443 * That likely will not change.
2445 * If 'stop_at_first_file' is specified, 'path_excluded' is returned
2446 * to signal that a file was found. This is the least significant value that
2447 * indicates that a file was encountered that does not depend on the order of
2448 * whether an untracked or excluded path was encountered first.
2450 * Returns the most significant path_treatment value encountered in the scan.
2451 * If 'stop_at_first_file' is specified, `path_excluded` is the most
2452 * significant path_treatment value that will be returned.
2455 static enum path_treatment read_directory_recursive(struct dir_struct *dir,
2456 struct index_state *istate, const char *base, int baselen,
2457 struct untracked_cache_dir *untracked, int check_only,
2458 int stop_at_first_file, const struct pathspec *pathspec)
2461 * WARNING: Do NOT recurse unless path_recurse is returned from
2462 * treat_path(). Recursing on any other return value
2463 * can result in exponential slowdown.
2465 struct cached_dir cdir;
2466 enum path_treatment state, subdir_state, dir_state = path_none;
2467 struct strbuf path = STRBUF_INIT;
2469 strbuf_add(&path, base, baselen);
2471 if (open_cached_dir(&cdir, dir, untracked, istate, &path, check_only))
2472 goto out;
2473 dir->visited_directories++;
2475 if (untracked)
2476 untracked->check_only = !!check_only;
2478 while (!read_cached_dir(&cdir)) {
2479 /* check how the file or directory should be treated */
2480 state = treat_path(dir, untracked, &cdir, istate, &path,
2481 baselen, pathspec);
2482 dir->visited_paths++;
2484 if (state > dir_state)
2485 dir_state = state;
2487 /* recurse into subdir if instructed by treat_path */
2488 if (state == path_recurse) {
2489 struct untracked_cache_dir *ud;
2490 ud = lookup_untracked(dir->untracked, untracked,
2491 path.buf + baselen,
2492 path.len - baselen);
2493 subdir_state =
2494 read_directory_recursive(dir, istate, path.buf,
2495 path.len, ud,
2496 check_only, stop_at_first_file, pathspec);
2497 if (subdir_state > dir_state)
2498 dir_state = subdir_state;
2500 if (pathspec &&
2501 !match_pathspec(istate, pathspec, path.buf, path.len,
2502 0 /* prefix */, NULL,
2503 0 /* do NOT special case dirs */))
2504 state = path_none;
2507 if (check_only) {
2508 if (stop_at_first_file) {
2510 * If stopping at first file, then
2511 * signal that a file was found by
2512 * returning `path_excluded`. This is
2513 * to return a consistent value
2514 * regardless of whether an ignored or
2515 * excluded file happened to be
2516 * encountered 1st.
2518 * In current usage, the
2519 * `stop_at_first_file` is passed when
2520 * an ancestor directory has matched
2521 * an exclude pattern, so any found
2522 * files will be excluded.
2524 if (dir_state >= path_excluded) {
2525 dir_state = path_excluded;
2526 break;
2530 /* abort early if maximum state has been reached */
2531 if (dir_state == path_untracked) {
2532 if (cdir.fdir)
2533 add_untracked(untracked, path.buf + baselen);
2534 break;
2536 /* skip the add_path_to_appropriate_result_list() */
2537 continue;
2540 add_path_to_appropriate_result_list(dir, untracked, &cdir,
2541 istate, &path, baselen,
2542 pathspec, state);
2544 close_cached_dir(&cdir);
2545 out:
2546 strbuf_release(&path);
2548 return dir_state;
2551 int cmp_dir_entry(const void *p1, const void *p2)
2553 const struct dir_entry *e1 = *(const struct dir_entry **)p1;
2554 const struct dir_entry *e2 = *(const struct dir_entry **)p2;
2556 return name_compare(e1->name, e1->len, e2->name, e2->len);
2559 /* check if *out lexically strictly contains *in */
2560 int check_dir_entry_contains(const struct dir_entry *out, const struct dir_entry *in)
2562 return (out->len < in->len) &&
2563 (out->name[out->len - 1] == '/') &&
2564 !memcmp(out->name, in->name, out->len);
2567 static int treat_leading_path(struct dir_struct *dir,
2568 struct index_state *istate,
2569 const char *path, int len,
2570 const struct pathspec *pathspec)
2572 struct strbuf sb = STRBUF_INIT;
2573 struct strbuf subdir = STRBUF_INIT;
2574 int prevlen, baselen;
2575 const char *cp;
2576 struct cached_dir cdir;
2577 enum path_treatment state = path_none;
2580 * For each directory component of path, we are going to check whether
2581 * that path is relevant given the pathspec. For example, if path is
2582 * foo/bar/baz/
2583 * then we will ask treat_path() whether we should go into foo, then
2584 * whether we should go into bar, then whether baz is relevant.
2585 * Checking each is important because e.g. if path is
2586 * .git/info/
2587 * then we need to check .git to know we shouldn't traverse it.
2588 * If the return from treat_path() is:
2589 * * path_none, for any path, we return false.
2590 * * path_recurse, for all path components, we return true
2591 * * <anything else> for some intermediate component, we make sure
2592 * to add that path to the relevant list but return false
2593 * signifying that we shouldn't recurse into it.
2596 while (len && path[len - 1] == '/')
2597 len--;
2598 if (!len)
2599 return 1;
2601 memset(&cdir, 0, sizeof(cdir));
2602 cdir.d_type = DT_DIR;
2603 baselen = 0;
2604 prevlen = 0;
2605 while (1) {
2606 prevlen = baselen + !!baselen;
2607 cp = path + prevlen;
2608 cp = memchr(cp, '/', path + len - cp);
2609 if (!cp)
2610 baselen = len;
2611 else
2612 baselen = cp - path;
2613 strbuf_reset(&sb);
2614 strbuf_add(&sb, path, baselen);
2615 if (!is_directory(sb.buf))
2616 break;
2617 strbuf_reset(&sb);
2618 strbuf_add(&sb, path, prevlen);
2619 strbuf_reset(&subdir);
2620 strbuf_add(&subdir, path+prevlen, baselen-prevlen);
2621 cdir.d_name = subdir.buf;
2622 state = treat_path(dir, NULL, &cdir, istate, &sb, prevlen, pathspec);
2624 if (state != path_recurse)
2625 break; /* do not recurse into it */
2626 if (len <= baselen)
2627 break; /* finished checking */
2629 add_path_to_appropriate_result_list(dir, NULL, &cdir, istate,
2630 &sb, baselen, pathspec,
2631 state);
2633 strbuf_release(&subdir);
2634 strbuf_release(&sb);
2635 return state == path_recurse;
2638 static const char *get_ident_string(void)
2640 static struct strbuf sb = STRBUF_INIT;
2641 struct utsname uts;
2643 if (sb.len)
2644 return sb.buf;
2645 if (uname(&uts) < 0)
2646 die_errno(_("failed to get kernel name and information"));
2647 strbuf_addf(&sb, "Location %s, system %s", get_git_work_tree(),
2648 uts.sysname);
2649 return sb.buf;
2652 static int ident_in_untracked(const struct untracked_cache *uc)
2655 * Previous git versions may have saved many NUL separated
2656 * strings in the "ident" field, but it is insane to manage
2657 * many locations, so just take care of the first one.
2660 return !strcmp(uc->ident.buf, get_ident_string());
2663 static void set_untracked_ident(struct untracked_cache *uc)
2665 strbuf_reset(&uc->ident);
2666 strbuf_addstr(&uc->ident, get_ident_string());
2669 * This strbuf used to contain a list of NUL separated
2670 * strings, so save NUL too for backward compatibility.
2672 strbuf_addch(&uc->ident, 0);
2675 static void new_untracked_cache(struct index_state *istate)
2677 struct untracked_cache *uc = xcalloc(1, sizeof(*uc));
2678 strbuf_init(&uc->ident, 100);
2679 uc->exclude_per_dir = ".gitignore";
2680 /* should be the same flags used by git-status */
2681 uc->dir_flags = DIR_SHOW_OTHER_DIRECTORIES | DIR_HIDE_EMPTY_DIRECTORIES;
2682 set_untracked_ident(uc);
2683 istate->untracked = uc;
2684 istate->cache_changed |= UNTRACKED_CHANGED;
2687 void add_untracked_cache(struct index_state *istate)
2689 if (!istate->untracked) {
2690 new_untracked_cache(istate);
2691 } else {
2692 if (!ident_in_untracked(istate->untracked)) {
2693 free_untracked_cache(istate->untracked);
2694 new_untracked_cache(istate);
2699 void remove_untracked_cache(struct index_state *istate)
2701 if (istate->untracked) {
2702 free_untracked_cache(istate->untracked);
2703 istate->untracked = NULL;
2704 istate->cache_changed |= UNTRACKED_CHANGED;
2708 static struct untracked_cache_dir *validate_untracked_cache(struct dir_struct *dir,
2709 int base_len,
2710 const struct pathspec *pathspec)
2712 struct untracked_cache_dir *root;
2713 static int untracked_cache_disabled = -1;
2715 if (!dir->untracked)
2716 return NULL;
2717 if (untracked_cache_disabled < 0)
2718 untracked_cache_disabled = git_env_bool("GIT_DISABLE_UNTRACKED_CACHE", 0);
2719 if (untracked_cache_disabled)
2720 return NULL;
2723 * We only support $GIT_DIR/info/exclude and core.excludesfile
2724 * as the global ignore rule files. Any other additions
2725 * (e.g. from command line) invalidate the cache. This
2726 * condition also catches running setup_standard_excludes()
2727 * before setting dir->untracked!
2729 if (dir->unmanaged_exclude_files)
2730 return NULL;
2733 * Optimize for the main use case only: whole-tree git
2734 * status. More work involved in treat_leading_path() if we
2735 * use cache on just a subset of the worktree. pathspec
2736 * support could make the matter even worse.
2738 if (base_len || (pathspec && pathspec->nr))
2739 return NULL;
2741 /* Different set of flags may produce different results */
2742 if (dir->flags != dir->untracked->dir_flags ||
2744 * See treat_directory(), case index_nonexistent. Without
2745 * this flag, we may need to also cache .git file content
2746 * for the resolve_gitlink_ref() call, which we don't.
2748 !(dir->flags & DIR_SHOW_OTHER_DIRECTORIES) ||
2749 /* We don't support collecting ignore files */
2750 (dir->flags & (DIR_SHOW_IGNORED | DIR_SHOW_IGNORED_TOO |
2751 DIR_COLLECT_IGNORED)))
2752 return NULL;
2755 * If we use .gitignore in the cache and now you change it to
2756 * .gitexclude, everything will go wrong.
2758 if (dir->exclude_per_dir != dir->untracked->exclude_per_dir &&
2759 strcmp(dir->exclude_per_dir, dir->untracked->exclude_per_dir))
2760 return NULL;
2763 * EXC_CMDL is not considered in the cache. If people set it,
2764 * skip the cache.
2766 if (dir->exclude_list_group[EXC_CMDL].nr)
2767 return NULL;
2769 if (!ident_in_untracked(dir->untracked)) {
2770 warning(_("untracked cache is disabled on this system or location"));
2771 return NULL;
2774 if (!dir->untracked->root)
2775 FLEX_ALLOC_STR(dir->untracked->root, name, "");
2777 /* Validate $GIT_DIR/info/exclude and core.excludesfile */
2778 root = dir->untracked->root;
2779 if (!oideq(&dir->ss_info_exclude.oid,
2780 &dir->untracked->ss_info_exclude.oid)) {
2781 invalidate_gitignore(dir->untracked, root);
2782 dir->untracked->ss_info_exclude = dir->ss_info_exclude;
2784 if (!oideq(&dir->ss_excludes_file.oid,
2785 &dir->untracked->ss_excludes_file.oid)) {
2786 invalidate_gitignore(dir->untracked, root);
2787 dir->untracked->ss_excludes_file = dir->ss_excludes_file;
2790 /* Make sure this directory is not dropped out at saving phase */
2791 root->recurse = 1;
2792 return root;
2795 static void emit_traversal_statistics(struct dir_struct *dir,
2796 struct repository *repo,
2797 const char *path,
2798 int path_len)
2800 if (!trace2_is_enabled())
2801 return;
2803 if (!path_len) {
2804 trace2_data_string("read_directory", repo, "path", "");
2805 } else {
2806 struct strbuf tmp = STRBUF_INIT;
2807 strbuf_add(&tmp, path, path_len);
2808 trace2_data_string("read_directory", repo, "path", tmp.buf);
2809 strbuf_release(&tmp);
2812 trace2_data_intmax("read_directory", repo,
2813 "directories-visited", dir->visited_directories);
2814 trace2_data_intmax("read_directory", repo,
2815 "paths-visited", dir->visited_paths);
2817 if (!dir->untracked)
2818 return;
2819 trace2_data_intmax("read_directory", repo,
2820 "node-creation", dir->untracked->dir_created);
2821 trace2_data_intmax("read_directory", repo,
2822 "gitignore-invalidation",
2823 dir->untracked->gitignore_invalidated);
2824 trace2_data_intmax("read_directory", repo,
2825 "directory-invalidation",
2826 dir->untracked->dir_invalidated);
2827 trace2_data_intmax("read_directory", repo,
2828 "opendir", dir->untracked->dir_opened);
2831 int read_directory(struct dir_struct *dir, struct index_state *istate,
2832 const char *path, int len, const struct pathspec *pathspec)
2834 struct untracked_cache_dir *untracked;
2836 trace2_region_enter("dir", "read_directory", istate->repo);
2837 dir->visited_paths = 0;
2838 dir->visited_directories = 0;
2840 if (has_symlink_leading_path(path, len)) {
2841 trace2_region_leave("dir", "read_directory", istate->repo);
2842 return dir->nr;
2845 untracked = validate_untracked_cache(dir, len, pathspec);
2846 if (!untracked)
2848 * make sure untracked cache code path is disabled,
2849 * e.g. prep_exclude()
2851 dir->untracked = NULL;
2852 if (!len || treat_leading_path(dir, istate, path, len, pathspec))
2853 read_directory_recursive(dir, istate, path, len, untracked, 0, 0, pathspec);
2854 QSORT(dir->entries, dir->nr, cmp_dir_entry);
2855 QSORT(dir->ignored, dir->ignored_nr, cmp_dir_entry);
2857 emit_traversal_statistics(dir, istate->repo, path, len);
2859 trace2_region_leave("dir", "read_directory", istate->repo);
2860 if (dir->untracked) {
2861 static int force_untracked_cache = -1;
2863 if (force_untracked_cache < 0)
2864 force_untracked_cache =
2865 git_env_bool("GIT_FORCE_UNTRACKED_CACHE", 0);
2866 if (force_untracked_cache &&
2867 dir->untracked == istate->untracked &&
2868 (dir->untracked->dir_opened ||
2869 dir->untracked->gitignore_invalidated ||
2870 dir->untracked->dir_invalidated))
2871 istate->cache_changed |= UNTRACKED_CHANGED;
2872 if (dir->untracked != istate->untracked) {
2873 FREE_AND_NULL(dir->untracked);
2877 return dir->nr;
2880 int file_exists(const char *f)
2882 struct stat sb;
2883 return lstat(f, &sb) == 0;
2886 int repo_file_exists(struct repository *repo, const char *path)
2888 if (repo != the_repository)
2889 BUG("do not know how to check file existence in arbitrary repo");
2891 return file_exists(path);
2894 static int cmp_icase(char a, char b)
2896 if (a == b)
2897 return 0;
2898 if (ignore_case)
2899 return toupper(a) - toupper(b);
2900 return a - b;
2904 * Given two normalized paths (a trailing slash is ok), if subdir is
2905 * outside dir, return -1. Otherwise return the offset in subdir that
2906 * can be used as relative path to dir.
2908 int dir_inside_of(const char *subdir, const char *dir)
2910 int offset = 0;
2912 assert(dir && subdir && *dir && *subdir);
2914 while (*dir && *subdir && !cmp_icase(*dir, *subdir)) {
2915 dir++;
2916 subdir++;
2917 offset++;
2920 /* hel[p]/me vs hel[l]/yeah */
2921 if (*dir && *subdir)
2922 return -1;
2924 if (!*subdir)
2925 return !*dir ? offset : -1; /* same dir */
2927 /* foo/[b]ar vs foo/[] */
2928 if (is_dir_sep(dir[-1]))
2929 return is_dir_sep(subdir[-1]) ? offset : -1;
2931 /* foo[/]bar vs foo[] */
2932 return is_dir_sep(*subdir) ? offset + 1 : -1;
2935 int is_inside_dir(const char *dir)
2937 char *cwd;
2938 int rc;
2940 if (!dir)
2941 return 0;
2943 cwd = xgetcwd();
2944 rc = (dir_inside_of(cwd, dir) >= 0);
2945 free(cwd);
2946 return rc;
2949 int is_empty_dir(const char *path)
2951 DIR *dir = opendir(path);
2952 struct dirent *e;
2953 int ret = 1;
2955 if (!dir)
2956 return 0;
2958 e = readdir_skip_dot_and_dotdot(dir);
2959 if (e)
2960 ret = 0;
2962 closedir(dir);
2963 return ret;
2966 static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up)
2968 DIR *dir;
2969 struct dirent *e;
2970 int ret = 0, original_len = path->len, len, kept_down = 0;
2971 int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY);
2972 int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL);
2973 struct object_id submodule_head;
2975 if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) &&
2976 !resolve_gitlink_ref(path->buf, "HEAD", &submodule_head)) {
2977 /* Do not descend and nuke a nested git work tree. */
2978 if (kept_up)
2979 *kept_up = 1;
2980 return 0;
2983 flag &= ~REMOVE_DIR_KEEP_TOPLEVEL;
2984 dir = opendir(path->buf);
2985 if (!dir) {
2986 if (errno == ENOENT)
2987 return keep_toplevel ? -1 : 0;
2988 else if (errno == EACCES && !keep_toplevel)
2990 * An empty dir could be removable even if it
2991 * is unreadable:
2993 return rmdir(path->buf);
2994 else
2995 return -1;
2997 strbuf_complete(path, '/');
2999 len = path->len;
3000 while ((e = readdir_skip_dot_and_dotdot(dir)) != NULL) {
3001 struct stat st;
3003 strbuf_setlen(path, len);
3004 strbuf_addstr(path, e->d_name);
3005 if (lstat(path->buf, &st)) {
3006 if (errno == ENOENT)
3008 * file disappeared, which is what we
3009 * wanted anyway
3011 continue;
3012 /* fall through */
3013 } else if (S_ISDIR(st.st_mode)) {
3014 if (!remove_dir_recurse(path, flag, &kept_down))
3015 continue; /* happy */
3016 } else if (!only_empty &&
3017 (!unlink(path->buf) || errno == ENOENT)) {
3018 continue; /* happy, too */
3021 /* path too long, stat fails, or non-directory still exists */
3022 ret = -1;
3023 break;
3025 closedir(dir);
3027 strbuf_setlen(path, original_len);
3028 if (!ret && !keep_toplevel && !kept_down)
3029 ret = (!rmdir(path->buf) || errno == ENOENT) ? 0 : -1;
3030 else if (kept_up)
3032 * report the uplevel that it is not an error that we
3033 * did not rmdir() our directory.
3035 *kept_up = !ret;
3036 return ret;
3039 int remove_dir_recursively(struct strbuf *path, int flag)
3041 return remove_dir_recurse(path, flag, NULL);
3044 static GIT_PATH_FUNC(git_path_info_exclude, "info/exclude")
3046 void setup_standard_excludes(struct dir_struct *dir)
3048 dir->exclude_per_dir = ".gitignore";
3050 /* core.excludesfile defaulting to $XDG_CONFIG_HOME/git/ignore */
3051 if (!excludes_file)
3052 excludes_file = xdg_config_home("ignore");
3053 if (excludes_file && !access_or_warn(excludes_file, R_OK, 0))
3054 add_patterns_from_file_1(dir, excludes_file,
3055 dir->untracked ? &dir->ss_excludes_file : NULL);
3057 /* per repository user preference */
3058 if (startup_info->have_repository) {
3059 const char *path = git_path_info_exclude();
3060 if (!access_or_warn(path, R_OK, 0))
3061 add_patterns_from_file_1(dir, path,
3062 dir->untracked ? &dir->ss_info_exclude : NULL);
3066 char *get_sparse_checkout_filename(void)
3068 return git_pathdup("info/sparse-checkout");
3071 int get_sparse_checkout_patterns(struct pattern_list *pl)
3073 int res;
3074 char *sparse_filename = get_sparse_checkout_filename();
3076 pl->use_cone_patterns = core_sparse_checkout_cone;
3077 res = add_patterns_from_file_to_list(sparse_filename, "", 0, pl, NULL, 0);
3079 free(sparse_filename);
3080 return res;
3083 int remove_path(const char *name)
3085 char *slash;
3087 if (unlink(name) && !is_missing_file_error(errno))
3088 return -1;
3090 slash = strrchr(name, '/');
3091 if (slash) {
3092 char *dirs = xstrdup(name);
3093 slash = dirs + (slash - name);
3094 do {
3095 *slash = '\0';
3096 } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/')));
3097 free(dirs);
3099 return 0;
3103 * Frees memory within dir which was allocated, and resets fields for further
3104 * use. Does not free dir itself.
3106 void dir_clear(struct dir_struct *dir)
3108 int i, j;
3109 struct exclude_list_group *group;
3110 struct pattern_list *pl;
3111 struct exclude_stack *stk;
3112 struct dir_struct new = DIR_INIT;
3114 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
3115 group = &dir->exclude_list_group[i];
3116 for (j = 0; j < group->nr; j++) {
3117 pl = &group->pl[j];
3118 if (i == EXC_DIRS)
3119 free((char *)pl->src);
3120 clear_pattern_list(pl);
3122 free(group->pl);
3125 for (i = 0; i < dir->ignored_nr; i++)
3126 free(dir->ignored[i]);
3127 for (i = 0; i < dir->nr; i++)
3128 free(dir->entries[i]);
3129 free(dir->ignored);
3130 free(dir->entries);
3132 stk = dir->exclude_stack;
3133 while (stk) {
3134 struct exclude_stack *prev = stk->prev;
3135 free(stk);
3136 stk = prev;
3138 strbuf_release(&dir->basebuf);
3140 memcpy(dir, &new, sizeof(*dir));
3143 struct ondisk_untracked_cache {
3144 struct stat_data info_exclude_stat;
3145 struct stat_data excludes_file_stat;
3146 uint32_t dir_flags;
3149 #define ouc_offset(x) offsetof(struct ondisk_untracked_cache, x)
3151 struct write_data {
3152 int index; /* number of written untracked_cache_dir */
3153 struct ewah_bitmap *check_only; /* from untracked_cache_dir */
3154 struct ewah_bitmap *valid; /* from untracked_cache_dir */
3155 struct ewah_bitmap *sha1_valid; /* set if exclude_sha1 is not null */
3156 struct strbuf out;
3157 struct strbuf sb_stat;
3158 struct strbuf sb_sha1;
3161 static void stat_data_to_disk(struct stat_data *to, const struct stat_data *from)
3163 to->sd_ctime.sec = htonl(from->sd_ctime.sec);
3164 to->sd_ctime.nsec = htonl(from->sd_ctime.nsec);
3165 to->sd_mtime.sec = htonl(from->sd_mtime.sec);
3166 to->sd_mtime.nsec = htonl(from->sd_mtime.nsec);
3167 to->sd_dev = htonl(from->sd_dev);
3168 to->sd_ino = htonl(from->sd_ino);
3169 to->sd_uid = htonl(from->sd_uid);
3170 to->sd_gid = htonl(from->sd_gid);
3171 to->sd_size = htonl(from->sd_size);
3174 static void write_one_dir(struct untracked_cache_dir *untracked,
3175 struct write_data *wd)
3177 struct stat_data stat_data;
3178 struct strbuf *out = &wd->out;
3179 unsigned char intbuf[16];
3180 unsigned int intlen, value;
3181 int i = wd->index++;
3184 * untracked_nr should be reset whenever valid is clear, but
3185 * for safety..
3187 if (!untracked->valid) {
3188 untracked->untracked_nr = 0;
3189 untracked->check_only = 0;
3192 if (untracked->check_only)
3193 ewah_set(wd->check_only, i);
3194 if (untracked->valid) {
3195 ewah_set(wd->valid, i);
3196 stat_data_to_disk(&stat_data, &untracked->stat_data);
3197 strbuf_add(&wd->sb_stat, &stat_data, sizeof(stat_data));
3199 if (!is_null_oid(&untracked->exclude_oid)) {
3200 ewah_set(wd->sha1_valid, i);
3201 strbuf_add(&wd->sb_sha1, untracked->exclude_oid.hash,
3202 the_hash_algo->rawsz);
3205 intlen = encode_varint(untracked->untracked_nr, intbuf);
3206 strbuf_add(out, intbuf, intlen);
3208 /* skip non-recurse directories */
3209 for (i = 0, value = 0; i < untracked->dirs_nr; i++)
3210 if (untracked->dirs[i]->recurse)
3211 value++;
3212 intlen = encode_varint(value, intbuf);
3213 strbuf_add(out, intbuf, intlen);
3215 strbuf_add(out, untracked->name, strlen(untracked->name) + 1);
3217 for (i = 0; i < untracked->untracked_nr; i++)
3218 strbuf_add(out, untracked->untracked[i],
3219 strlen(untracked->untracked[i]) + 1);
3221 for (i = 0; i < untracked->dirs_nr; i++)
3222 if (untracked->dirs[i]->recurse)
3223 write_one_dir(untracked->dirs[i], wd);
3226 void write_untracked_extension(struct strbuf *out, struct untracked_cache *untracked)
3228 struct ondisk_untracked_cache *ouc;
3229 struct write_data wd;
3230 unsigned char varbuf[16];
3231 int varint_len;
3232 const unsigned hashsz = the_hash_algo->rawsz;
3234 CALLOC_ARRAY(ouc, 1);
3235 stat_data_to_disk(&ouc->info_exclude_stat, &untracked->ss_info_exclude.stat);
3236 stat_data_to_disk(&ouc->excludes_file_stat, &untracked->ss_excludes_file.stat);
3237 ouc->dir_flags = htonl(untracked->dir_flags);
3239 varint_len = encode_varint(untracked->ident.len, varbuf);
3240 strbuf_add(out, varbuf, varint_len);
3241 strbuf_addbuf(out, &untracked->ident);
3243 strbuf_add(out, ouc, sizeof(*ouc));
3244 strbuf_add(out, untracked->ss_info_exclude.oid.hash, hashsz);
3245 strbuf_add(out, untracked->ss_excludes_file.oid.hash, hashsz);
3246 strbuf_add(out, untracked->exclude_per_dir, strlen(untracked->exclude_per_dir) + 1);
3247 FREE_AND_NULL(ouc);
3249 if (!untracked->root) {
3250 varint_len = encode_varint(0, varbuf);
3251 strbuf_add(out, varbuf, varint_len);
3252 return;
3255 wd.index = 0;
3256 wd.check_only = ewah_new();
3257 wd.valid = ewah_new();
3258 wd.sha1_valid = ewah_new();
3259 strbuf_init(&wd.out, 1024);
3260 strbuf_init(&wd.sb_stat, 1024);
3261 strbuf_init(&wd.sb_sha1, 1024);
3262 write_one_dir(untracked->root, &wd);
3264 varint_len = encode_varint(wd.index, varbuf);
3265 strbuf_add(out, varbuf, varint_len);
3266 strbuf_addbuf(out, &wd.out);
3267 ewah_serialize_strbuf(wd.valid, out);
3268 ewah_serialize_strbuf(wd.check_only, out);
3269 ewah_serialize_strbuf(wd.sha1_valid, out);
3270 strbuf_addbuf(out, &wd.sb_stat);
3271 strbuf_addbuf(out, &wd.sb_sha1);
3272 strbuf_addch(out, '\0'); /* safe guard for string lists */
3274 ewah_free(wd.valid);
3275 ewah_free(wd.check_only);
3276 ewah_free(wd.sha1_valid);
3277 strbuf_release(&wd.out);
3278 strbuf_release(&wd.sb_stat);
3279 strbuf_release(&wd.sb_sha1);
3282 static void free_untracked(struct untracked_cache_dir *ucd)
3284 int i;
3285 if (!ucd)
3286 return;
3287 for (i = 0; i < ucd->dirs_nr; i++)
3288 free_untracked(ucd->dirs[i]);
3289 for (i = 0; i < ucd->untracked_nr; i++)
3290 free(ucd->untracked[i]);
3291 free(ucd->untracked);
3292 free(ucd->dirs);
3293 free(ucd);
3296 void free_untracked_cache(struct untracked_cache *uc)
3298 if (uc)
3299 free_untracked(uc->root);
3300 free(uc);
3303 struct read_data {
3304 int index;
3305 struct untracked_cache_dir **ucd;
3306 struct ewah_bitmap *check_only;
3307 struct ewah_bitmap *valid;
3308 struct ewah_bitmap *sha1_valid;
3309 const unsigned char *data;
3310 const unsigned char *end;
3313 static void stat_data_from_disk(struct stat_data *to, const unsigned char *data)
3315 memcpy(to, data, sizeof(*to));
3316 to->sd_ctime.sec = ntohl(to->sd_ctime.sec);
3317 to->sd_ctime.nsec = ntohl(to->sd_ctime.nsec);
3318 to->sd_mtime.sec = ntohl(to->sd_mtime.sec);
3319 to->sd_mtime.nsec = ntohl(to->sd_mtime.nsec);
3320 to->sd_dev = ntohl(to->sd_dev);
3321 to->sd_ino = ntohl(to->sd_ino);
3322 to->sd_uid = ntohl(to->sd_uid);
3323 to->sd_gid = ntohl(to->sd_gid);
3324 to->sd_size = ntohl(to->sd_size);
3327 static int read_one_dir(struct untracked_cache_dir **untracked_,
3328 struct read_data *rd)
3330 struct untracked_cache_dir ud, *untracked;
3331 const unsigned char *data = rd->data, *end = rd->end;
3332 const unsigned char *eos;
3333 unsigned int value;
3334 int i;
3336 memset(&ud, 0, sizeof(ud));
3338 value = decode_varint(&data);
3339 if (data > end)
3340 return -1;
3341 ud.recurse = 1;
3342 ud.untracked_alloc = value;
3343 ud.untracked_nr = value;
3344 if (ud.untracked_nr)
3345 ALLOC_ARRAY(ud.untracked, ud.untracked_nr);
3347 ud.dirs_alloc = ud.dirs_nr = decode_varint(&data);
3348 if (data > end)
3349 return -1;
3350 ALLOC_ARRAY(ud.dirs, ud.dirs_nr);
3352 eos = memchr(data, '\0', end - data);
3353 if (!eos || eos == end)
3354 return -1;
3356 *untracked_ = untracked = xmalloc(st_add3(sizeof(*untracked), eos - data, 1));
3357 memcpy(untracked, &ud, sizeof(ud));
3358 memcpy(untracked->name, data, eos - data + 1);
3359 data = eos + 1;
3361 for (i = 0; i < untracked->untracked_nr; i++) {
3362 eos = memchr(data, '\0', end - data);
3363 if (!eos || eos == end)
3364 return -1;
3365 untracked->untracked[i] = xmemdupz(data, eos - data);
3366 data = eos + 1;
3369 rd->ucd[rd->index++] = untracked;
3370 rd->data = data;
3372 for (i = 0; i < untracked->dirs_nr; i++) {
3373 if (read_one_dir(untracked->dirs + i, rd) < 0)
3374 return -1;
3376 return 0;
3379 static void set_check_only(size_t pos, void *cb)
3381 struct read_data *rd = cb;
3382 struct untracked_cache_dir *ud = rd->ucd[pos];
3383 ud->check_only = 1;
3386 static void read_stat(size_t pos, void *cb)
3388 struct read_data *rd = cb;
3389 struct untracked_cache_dir *ud = rd->ucd[pos];
3390 if (rd->data + sizeof(struct stat_data) > rd->end) {
3391 rd->data = rd->end + 1;
3392 return;
3394 stat_data_from_disk(&ud->stat_data, rd->data);
3395 rd->data += sizeof(struct stat_data);
3396 ud->valid = 1;
3399 static void read_oid(size_t pos, void *cb)
3401 struct read_data *rd = cb;
3402 struct untracked_cache_dir *ud = rd->ucd[pos];
3403 if (rd->data + the_hash_algo->rawsz > rd->end) {
3404 rd->data = rd->end + 1;
3405 return;
3407 oidread(&ud->exclude_oid, rd->data);
3408 rd->data += the_hash_algo->rawsz;
3411 static void load_oid_stat(struct oid_stat *oid_stat, const unsigned char *data,
3412 const unsigned char *sha1)
3414 stat_data_from_disk(&oid_stat->stat, data);
3415 oidread(&oid_stat->oid, sha1);
3416 oid_stat->valid = 1;
3419 struct untracked_cache *read_untracked_extension(const void *data, unsigned long sz)
3421 struct untracked_cache *uc;
3422 struct read_data rd;
3423 const unsigned char *next = data, *end = (const unsigned char *)data + sz;
3424 const char *ident;
3425 int ident_len;
3426 ssize_t len;
3427 const char *exclude_per_dir;
3428 const unsigned hashsz = the_hash_algo->rawsz;
3429 const unsigned offset = sizeof(struct ondisk_untracked_cache);
3430 const unsigned exclude_per_dir_offset = offset + 2 * hashsz;
3432 if (sz <= 1 || end[-1] != '\0')
3433 return NULL;
3434 end--;
3436 ident_len = decode_varint(&next);
3437 if (next + ident_len > end)
3438 return NULL;
3439 ident = (const char *)next;
3440 next += ident_len;
3442 if (next + exclude_per_dir_offset + 1 > end)
3443 return NULL;
3445 CALLOC_ARRAY(uc, 1);
3446 strbuf_init(&uc->ident, ident_len);
3447 strbuf_add(&uc->ident, ident, ident_len);
3448 load_oid_stat(&uc->ss_info_exclude,
3449 next + ouc_offset(info_exclude_stat),
3450 next + offset);
3451 load_oid_stat(&uc->ss_excludes_file,
3452 next + ouc_offset(excludes_file_stat),
3453 next + offset + hashsz);
3454 uc->dir_flags = get_be32(next + ouc_offset(dir_flags));
3455 exclude_per_dir = (const char *)next + exclude_per_dir_offset;
3456 uc->exclude_per_dir = xstrdup(exclude_per_dir);
3457 /* NUL after exclude_per_dir is covered by sizeof(*ouc) */
3458 next += exclude_per_dir_offset + strlen(exclude_per_dir) + 1;
3459 if (next >= end)
3460 goto done2;
3462 len = decode_varint(&next);
3463 if (next > end || len == 0)
3464 goto done2;
3466 rd.valid = ewah_new();
3467 rd.check_only = ewah_new();
3468 rd.sha1_valid = ewah_new();
3469 rd.data = next;
3470 rd.end = end;
3471 rd.index = 0;
3472 ALLOC_ARRAY(rd.ucd, len);
3474 if (read_one_dir(&uc->root, &rd) || rd.index != len)
3475 goto done;
3477 next = rd.data;
3478 len = ewah_read_mmap(rd.valid, next, end - next);
3479 if (len < 0)
3480 goto done;
3482 next += len;
3483 len = ewah_read_mmap(rd.check_only, next, end - next);
3484 if (len < 0)
3485 goto done;
3487 next += len;
3488 len = ewah_read_mmap(rd.sha1_valid, next, end - next);
3489 if (len < 0)
3490 goto done;
3492 ewah_each_bit(rd.check_only, set_check_only, &rd);
3493 rd.data = next + len;
3494 ewah_each_bit(rd.valid, read_stat, &rd);
3495 ewah_each_bit(rd.sha1_valid, read_oid, &rd);
3496 next = rd.data;
3498 done:
3499 free(rd.ucd);
3500 ewah_free(rd.valid);
3501 ewah_free(rd.check_only);
3502 ewah_free(rd.sha1_valid);
3503 done2:
3504 if (next != end) {
3505 free_untracked_cache(uc);
3506 uc = NULL;
3508 return uc;
3511 static void invalidate_one_directory(struct untracked_cache *uc,
3512 struct untracked_cache_dir *ucd)
3514 uc->dir_invalidated++;
3515 ucd->valid = 0;
3516 ucd->untracked_nr = 0;
3520 * Normally when an entry is added or removed from a directory,
3521 * invalidating that directory is enough. No need to touch its
3522 * ancestors. When a directory is shown as "foo/bar/" in git-status
3523 * however, deleting or adding an entry may have cascading effect.
3525 * Say the "foo/bar/file" has become untracked, we need to tell the
3526 * untracked_cache_dir of "foo" that "bar/" is not an untracked
3527 * directory any more (because "bar" is managed by foo as an untracked
3528 * "file").
3530 * Similarly, if "foo/bar/file" moves from untracked to tracked and it
3531 * was the last untracked entry in the entire "foo", we should show
3532 * "foo/" instead. Which means we have to invalidate past "bar" up to
3533 * "foo".
3535 * This function traverses all directories from root to leaf. If there
3536 * is a chance of one of the above cases happening, we invalidate back
3537 * to root. Otherwise we just invalidate the leaf. There may be a more
3538 * sophisticated way than checking for SHOW_OTHER_DIRECTORIES to
3539 * detect these cases and avoid unnecessary invalidation, for example,
3540 * checking for the untracked entry named "bar/" in "foo", but for now
3541 * stick to something safe and simple.
3543 static int invalidate_one_component(struct untracked_cache *uc,
3544 struct untracked_cache_dir *dir,
3545 const char *path, int len)
3547 const char *rest = strchr(path, '/');
3549 if (rest) {
3550 int component_len = rest - path;
3551 struct untracked_cache_dir *d =
3552 lookup_untracked(uc, dir, path, component_len);
3553 int ret =
3554 invalidate_one_component(uc, d, rest + 1,
3555 len - (component_len + 1));
3556 if (ret)
3557 invalidate_one_directory(uc, dir);
3558 return ret;
3561 invalidate_one_directory(uc, dir);
3562 return uc->dir_flags & DIR_SHOW_OTHER_DIRECTORIES;
3565 void untracked_cache_invalidate_path(struct index_state *istate,
3566 const char *path, int safe_path)
3568 if (!istate->untracked || !istate->untracked->root)
3569 return;
3570 if (!safe_path && !verify_path(path, 0))
3571 return;
3572 invalidate_one_component(istate->untracked, istate->untracked->root,
3573 path, strlen(path));
3576 void untracked_cache_remove_from_index(struct index_state *istate,
3577 const char *path)
3579 untracked_cache_invalidate_path(istate, path, 1);
3582 void untracked_cache_add_to_index(struct index_state *istate,
3583 const char *path)
3585 untracked_cache_invalidate_path(istate, path, 1);
3588 static void connect_wt_gitdir_in_nested(const char *sub_worktree,
3589 const char *sub_gitdir)
3591 int i;
3592 struct repository subrepo;
3593 struct strbuf sub_wt = STRBUF_INIT;
3594 struct strbuf sub_gd = STRBUF_INIT;
3596 const struct submodule *sub;
3598 /* If the submodule has no working tree, we can ignore it. */
3599 if (repo_init(&subrepo, sub_gitdir, sub_worktree))
3600 return;
3602 if (repo_read_index(&subrepo) < 0)
3603 die(_("index file corrupt in repo %s"), subrepo.gitdir);
3605 /* TODO: audit for interaction with sparse-index. */
3606 ensure_full_index(subrepo.index);
3607 for (i = 0; i < subrepo.index->cache_nr; i++) {
3608 const struct cache_entry *ce = subrepo.index->cache[i];
3610 if (!S_ISGITLINK(ce->ce_mode))
3611 continue;
3613 while (i + 1 < subrepo.index->cache_nr &&
3614 !strcmp(ce->name, subrepo.index->cache[i + 1]->name))
3616 * Skip entries with the same name in different stages
3617 * to make sure an entry is returned only once.
3619 i++;
3621 sub = submodule_from_path(&subrepo, null_oid(), ce->name);
3622 if (!sub || !is_submodule_active(&subrepo, ce->name))
3623 /* .gitmodules broken or inactive sub */
3624 continue;
3626 strbuf_reset(&sub_wt);
3627 strbuf_reset(&sub_gd);
3628 strbuf_addf(&sub_wt, "%s/%s", sub_worktree, sub->path);
3629 strbuf_addf(&sub_gd, "%s/modules/%s", sub_gitdir, sub->name);
3631 connect_work_tree_and_git_dir(sub_wt.buf, sub_gd.buf, 1);
3633 strbuf_release(&sub_wt);
3634 strbuf_release(&sub_gd);
3635 repo_clear(&subrepo);
3638 void connect_work_tree_and_git_dir(const char *work_tree_,
3639 const char *git_dir_,
3640 int recurse_into_nested)
3642 struct strbuf gitfile_sb = STRBUF_INIT;
3643 struct strbuf cfg_sb = STRBUF_INIT;
3644 struct strbuf rel_path = STRBUF_INIT;
3645 char *git_dir, *work_tree;
3647 /* Prepare .git file */
3648 strbuf_addf(&gitfile_sb, "%s/.git", work_tree_);
3649 if (safe_create_leading_directories_const(gitfile_sb.buf))
3650 die(_("could not create directories for %s"), gitfile_sb.buf);
3652 /* Prepare config file */
3653 strbuf_addf(&cfg_sb, "%s/config", git_dir_);
3654 if (safe_create_leading_directories_const(cfg_sb.buf))
3655 die(_("could not create directories for %s"), cfg_sb.buf);
3657 git_dir = real_pathdup(git_dir_, 1);
3658 work_tree = real_pathdup(work_tree_, 1);
3660 /* Write .git file */
3661 write_file(gitfile_sb.buf, "gitdir: %s",
3662 relative_path(git_dir, work_tree, &rel_path));
3663 /* Update core.worktree setting */
3664 git_config_set_in_file(cfg_sb.buf, "core.worktree",
3665 relative_path(work_tree, git_dir, &rel_path));
3667 strbuf_release(&gitfile_sb);
3668 strbuf_release(&cfg_sb);
3669 strbuf_release(&rel_path);
3671 if (recurse_into_nested)
3672 connect_wt_gitdir_in_nested(work_tree, git_dir);
3674 free(work_tree);
3675 free(git_dir);
3679 * Migrate the git directory of the given path from old_git_dir to new_git_dir.
3681 void relocate_gitdir(const char *path, const char *old_git_dir, const char *new_git_dir)
3683 if (rename(old_git_dir, new_git_dir) < 0)
3684 die_errno(_("could not migrate git directory from '%s' to '%s'"),
3685 old_git_dir, new_git_dir);
3687 connect_work_tree_and_git_dir(path, new_git_dir, 0);