The eleventh batch
[git/gitster.git] / dir.c
blob7f35a3e3175355bad4f64bf4e65cf05d9bd6356f
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 */
9 #define USE_THE_REPOSITORY_VARIABLE
11 #include "git-compat-util.h"
12 #include "abspath.h"
13 #include "config.h"
14 #include "convert.h"
15 #include "dir.h"
16 #include "environment.h"
17 #include "gettext.h"
18 #include "name-hash.h"
19 #include "object-file.h"
20 #include "object-store-ll.h"
21 #include "path.h"
22 #include "refs.h"
23 #include "repository.h"
24 #include "wildmatch.h"
25 #include "pathspec.h"
26 #include "utf8.h"
27 #include "varint.h"
28 #include "ewah/ewok.h"
29 #include "fsmonitor-ll.h"
30 #include "read-cache-ll.h"
31 #include "setup.h"
32 #include "sparse-index.h"
33 #include "submodule-config.h"
34 #include "symlinks.h"
35 #include "trace2.h"
36 #include "tree.h"
37 #include "hex.h"
40 * The maximum size of a pattern/exclude file. If the file exceeds this size
41 * we will ignore it.
43 #define PATTERN_MAX_FILE_SIZE (100 * 1024 * 1024)
46 * Tells read_directory_recursive how a file or directory should be treated.
47 * Values are ordered by significance, e.g. if a directory contains both
48 * excluded and untracked files, it is listed as untracked because
49 * path_untracked > path_excluded.
51 enum path_treatment {
52 path_none = 0,
53 path_recurse,
54 path_excluded,
55 path_untracked
59 * Support data structure for our opendir/readdir/closedir wrappers
61 struct cached_dir {
62 DIR *fdir;
63 struct untracked_cache_dir *untracked;
64 int nr_files;
65 int nr_dirs;
67 const char *d_name;
68 int d_type;
69 const char *file;
70 struct untracked_cache_dir *ucd;
73 static enum path_treatment read_directory_recursive(struct dir_struct *dir,
74 struct index_state *istate, const char *path, int len,
75 struct untracked_cache_dir *untracked,
76 int check_only, int stop_at_first_file, const struct pathspec *pathspec);
77 static int resolve_dtype(int dtype, struct index_state *istate,
78 const char *path, int len);
79 struct dirent *readdir_skip_dot_and_dotdot(DIR *dirp)
81 struct dirent *e;
83 while ((e = readdir(dirp)) != NULL) {
84 if (!is_dot_or_dotdot(e->d_name))
85 break;
87 return e;
90 int count_slashes(const char *s)
92 int cnt = 0;
93 while (*s)
94 if (*s++ == '/')
95 cnt++;
96 return cnt;
99 int git_fspathcmp(const char *a, const char *b)
101 return ignore_case ? strcasecmp(a, b) : strcmp(a, b);
104 int fspatheq(const char *a, const char *b)
106 return !fspathcmp(a, b);
109 int git_fspathncmp(const char *a, const char *b, size_t count)
111 return ignore_case ? strncasecmp(a, b, count) : strncmp(a, b, count);
114 int paths_collide(const char *a, const char *b)
116 size_t len_a = strlen(a), len_b = strlen(b);
118 if (len_a == len_b)
119 return fspatheq(a, b);
121 if (len_a < len_b)
122 return is_dir_sep(b[len_a]) && !fspathncmp(a, b, len_a);
123 return is_dir_sep(a[len_b]) && !fspathncmp(a, b, len_b);
126 unsigned int fspathhash(const char *str)
128 return ignore_case ? strihash(str) : strhash(str);
131 int git_fnmatch(const struct pathspec_item *item,
132 const char *pattern, const char *string,
133 int prefix)
135 if (prefix > 0) {
136 if (ps_strncmp(item, pattern, string, prefix))
137 return WM_NOMATCH;
138 pattern += prefix;
139 string += prefix;
141 if (item->flags & PATHSPEC_ONESTAR) {
142 int pattern_len = strlen(++pattern);
143 int string_len = strlen(string);
144 return string_len < pattern_len ||
145 ps_strcmp(item, pattern,
146 string + string_len - pattern_len);
148 if (item->magic & PATHSPEC_GLOB)
149 return wildmatch(pattern, string,
150 WM_PATHNAME |
151 (item->magic & PATHSPEC_ICASE ? WM_CASEFOLD : 0));
152 else
153 /* wildmatch has not learned no FNM_PATHNAME mode yet */
154 return wildmatch(pattern, string,
155 item->magic & PATHSPEC_ICASE ? WM_CASEFOLD : 0);
158 static int fnmatch_icase_mem(const char *pattern, int patternlen,
159 const char *string, int stringlen,
160 int flags)
162 int match_status;
163 struct strbuf pat_buf = STRBUF_INIT;
164 struct strbuf str_buf = STRBUF_INIT;
165 const char *use_pat = pattern;
166 const char *use_str = string;
168 if (pattern[patternlen]) {
169 strbuf_add(&pat_buf, pattern, patternlen);
170 use_pat = pat_buf.buf;
172 if (string[stringlen]) {
173 strbuf_add(&str_buf, string, stringlen);
174 use_str = str_buf.buf;
177 if (ignore_case)
178 flags |= WM_CASEFOLD;
179 match_status = wildmatch(use_pat, use_str, flags);
181 strbuf_release(&pat_buf);
182 strbuf_release(&str_buf);
184 return match_status;
187 static size_t common_prefix_len(const struct pathspec *pathspec)
189 int n;
190 size_t max = 0;
193 * ":(icase)path" is treated as a pathspec full of
194 * wildcard. In other words, only prefix is considered common
195 * prefix. If the pathspec is abc/foo abc/bar, running in
196 * subdir xyz, the common prefix is still xyz, not xyz/abc as
197 * in non-:(icase).
199 GUARD_PATHSPEC(pathspec,
200 PATHSPEC_FROMTOP |
201 PATHSPEC_MAXDEPTH |
202 PATHSPEC_LITERAL |
203 PATHSPEC_GLOB |
204 PATHSPEC_ICASE |
205 PATHSPEC_EXCLUDE |
206 PATHSPEC_ATTR);
208 for (n = 0; n < pathspec->nr; n++) {
209 size_t i = 0, len = 0, item_len;
210 if (pathspec->items[n].magic & PATHSPEC_EXCLUDE)
211 continue;
212 if (pathspec->items[n].magic & PATHSPEC_ICASE)
213 item_len = pathspec->items[n].prefix;
214 else
215 item_len = pathspec->items[n].nowildcard_len;
216 while (i < item_len && (n == 0 || i < max)) {
217 char c = pathspec->items[n].match[i];
218 if (c != pathspec->items[0].match[i])
219 break;
220 if (c == '/')
221 len = i + 1;
222 i++;
224 if (n == 0 || len < max) {
225 max = len;
226 if (!max)
227 break;
230 return max;
234 * Returns a copy of the longest leading path common among all
235 * pathspecs.
237 char *common_prefix(const struct pathspec *pathspec)
239 unsigned long len = common_prefix_len(pathspec);
241 return len ? xmemdupz(pathspec->items[0].match, len) : NULL;
244 int fill_directory(struct dir_struct *dir,
245 struct index_state *istate,
246 const struct pathspec *pathspec)
248 const char *prefix;
249 size_t prefix_len;
251 unsigned exclusive_flags = DIR_SHOW_IGNORED | DIR_SHOW_IGNORED_TOO;
252 if ((dir->flags & exclusive_flags) == exclusive_flags)
253 BUG("DIR_SHOW_IGNORED and DIR_SHOW_IGNORED_TOO are exclusive");
256 * Calculate common prefix for the pathspec, and
257 * use that to optimize the directory walk
259 prefix_len = common_prefix_len(pathspec);
260 prefix = prefix_len ? pathspec->items[0].match : "";
262 /* Read the directory and prune it */
263 read_directory(dir, istate, prefix, prefix_len, pathspec);
265 return prefix_len;
268 int within_depth(const char *name, int namelen,
269 int depth, int max_depth)
271 const char *cp = name, *cpe = name + namelen;
273 while (cp < cpe) {
274 if (*cp++ != '/')
275 continue;
276 depth++;
277 if (depth > max_depth)
278 return 0;
280 return 1;
284 * Read the contents of the blob with the given OID into a buffer.
285 * Append a trailing LF to the end if the last line doesn't have one.
287 * Returns:
288 * -1 when the OID is invalid or unknown or does not refer to a blob.
289 * 0 when the blob is empty.
290 * 1 along with { data, size } of the (possibly augmented) buffer
291 * when successful.
293 * Optionally updates the given oid_stat with the given OID (when valid).
295 static int do_read_blob(const struct object_id *oid, struct oid_stat *oid_stat,
296 size_t *size_out, char **data_out)
298 enum object_type type;
299 unsigned long sz;
300 char *data;
302 *size_out = 0;
303 *data_out = NULL;
305 data = repo_read_object_file(the_repository, oid, &type, &sz);
306 if (!data || type != OBJ_BLOB) {
307 free(data);
308 return -1;
311 if (oid_stat) {
312 memset(&oid_stat->stat, 0, sizeof(oid_stat->stat));
313 oidcpy(&oid_stat->oid, oid);
316 if (sz == 0) {
317 free(data);
318 return 0;
321 if (data[sz - 1] != '\n') {
322 data = xrealloc(data, st_add(sz, 1));
323 data[sz++] = '\n';
326 *size_out = xsize_t(sz);
327 *data_out = data;
329 return 1;
332 #define DO_MATCH_EXCLUDE (1<<0)
333 #define DO_MATCH_DIRECTORY (1<<1)
334 #define DO_MATCH_LEADING_PATHSPEC (1<<2)
337 * Does the given pathspec match the given name? A match is found if
339 * (1) the pathspec string is leading directory of 'name' ("RECURSIVELY"), or
340 * (2) the pathspec string has a leading part matching 'name' ("LEADING"), or
341 * (3) the pathspec string is a wildcard and matches 'name' ("WILDCARD"), or
342 * (4) the pathspec string is exactly the same as 'name' ("EXACT").
344 * Return value tells which case it was (1-4), or 0 when there is no match.
346 * It may be instructive to look at a small table of concrete examples
347 * to understand the differences between 1, 2, and 4:
349 * Pathspecs
350 * | a/b | a/b/ | a/b/c
351 * ------+-----------+-----------+------------
352 * a/b | EXACT | EXACT[1] | LEADING[2]
353 * Names a/b/ | RECURSIVE | EXACT | LEADING[2]
354 * a/b/c | RECURSIVE | RECURSIVE | EXACT
356 * [1] Only if DO_MATCH_DIRECTORY is passed; otherwise, this is NOT a match.
357 * [2] Only if DO_MATCH_LEADING_PATHSPEC is passed; otherwise, not a match.
359 static int match_pathspec_item(struct index_state *istate,
360 const struct pathspec_item *item, int prefix,
361 const char *name, int namelen, unsigned flags)
363 /* name/namelen has prefix cut off by caller */
364 const char *match = item->match + prefix;
365 int matchlen = item->len - prefix;
368 * The normal call pattern is:
369 * 1. prefix = common_prefix_len(ps);
370 * 2. prune something, or fill_directory
371 * 3. match_pathspec()
373 * 'prefix' at #1 may be shorter than the command's prefix and
374 * it's ok for #2 to match extra files. Those extras will be
375 * trimmed at #3.
377 * Suppose the pathspec is 'foo' and '../bar' running from
378 * subdir 'xyz'. The common prefix at #1 will be empty, thanks
379 * to "../". We may have xyz/foo _and_ XYZ/foo after #2. The
380 * user does not want XYZ/foo, only the "foo" part should be
381 * case-insensitive. We need to filter out XYZ/foo here. In
382 * other words, we do not trust the caller on comparing the
383 * prefix part when :(icase) is involved. We do exact
384 * comparison ourselves.
386 * Normally the caller (common_prefix_len() in fact) does
387 * _exact_ matching on name[-prefix+1..-1] and we do not need
388 * to check that part. Be defensive and check it anyway, in
389 * case common_prefix_len is changed, or a new caller is
390 * introduced that does not use common_prefix_len.
392 * If the penalty turns out too high when prefix is really
393 * long, maybe change it to
394 * strncmp(match, name, item->prefix - prefix)
396 if (item->prefix && (item->magic & PATHSPEC_ICASE) &&
397 strncmp(item->match, name - prefix, item->prefix))
398 return 0;
400 if (item->attr_match_nr &&
401 !match_pathspec_attrs(istate, name - prefix, namelen + prefix, item))
402 return 0;
404 /* If the match was just the prefix, we matched */
405 if (!*match)
406 return MATCHED_RECURSIVELY;
408 if (matchlen <= namelen && !ps_strncmp(item, match, name, matchlen)) {
409 if (matchlen == namelen)
410 return MATCHED_EXACTLY;
412 if (match[matchlen-1] == '/' || name[matchlen] == '/')
413 return MATCHED_RECURSIVELY;
414 } else if ((flags & DO_MATCH_DIRECTORY) &&
415 match[matchlen - 1] == '/' &&
416 namelen == matchlen - 1 &&
417 !ps_strncmp(item, match, name, namelen))
418 return MATCHED_EXACTLY;
420 if (item->nowildcard_len < item->len &&
421 !git_fnmatch(item, match, name,
422 item->nowildcard_len - prefix))
423 return MATCHED_FNMATCH;
425 /* Perform checks to see if "name" is a leading string of the pathspec */
426 if ( (flags & DO_MATCH_LEADING_PATHSPEC) &&
427 !(flags & DO_MATCH_EXCLUDE)) {
428 /* name is a literal prefix of the pathspec */
429 int offset = name[namelen-1] == '/' ? 1 : 0;
430 if ((namelen < matchlen) &&
431 (match[namelen-offset] == '/') &&
432 !ps_strncmp(item, match, name, namelen))
433 return MATCHED_RECURSIVELY_LEADING_PATHSPEC;
435 /* name doesn't match up to the first wild character */
436 if (item->nowildcard_len < item->len &&
437 ps_strncmp(item, match, name,
438 item->nowildcard_len - prefix))
439 return 0;
442 * name has no wildcard, and it didn't match as a leading
443 * pathspec so return.
445 if (item->nowildcard_len == item->len)
446 return 0;
449 * Here is where we would perform a wildmatch to check if
450 * "name" can be matched as a directory (or a prefix) against
451 * the pathspec. Since wildmatch doesn't have this capability
452 * at the present we have to punt and say that it is a match,
453 * potentially returning a false positive
454 * The submodules themselves will be able to perform more
455 * accurate matching to determine if the pathspec matches.
457 return MATCHED_RECURSIVELY_LEADING_PATHSPEC;
460 return 0;
464 * do_match_pathspec() is meant to ONLY be called by
465 * match_pathspec_with_flags(); calling it directly risks pathspecs
466 * like ':!unwanted_path' being ignored.
468 * Given a name and a list of pathspecs, returns the nature of the
469 * closest (i.e. most specific) match of the name to any of the
470 * pathspecs.
472 * The caller typically calls this multiple times with the same
473 * pathspec and seen[] array but with different name/namelen
474 * (e.g. entries from the index) and is interested in seeing if and
475 * how each pathspec matches all the names it calls this function
476 * with. A mark is left in the seen[] array for each pathspec element
477 * indicating the closest type of match that element achieved, so if
478 * seen[n] remains zero after multiple invocations, that means the nth
479 * pathspec did not match any names, which could indicate that the
480 * user mistyped the nth pathspec.
482 static int do_match_pathspec(struct index_state *istate,
483 const struct pathspec *ps,
484 const char *name, int namelen,
485 int prefix, char *seen,
486 unsigned flags)
488 int i, retval = 0, exclude = flags & DO_MATCH_EXCLUDE;
490 GUARD_PATHSPEC(ps,
491 PATHSPEC_FROMTOP |
492 PATHSPEC_MAXDEPTH |
493 PATHSPEC_LITERAL |
494 PATHSPEC_GLOB |
495 PATHSPEC_ICASE |
496 PATHSPEC_EXCLUDE |
497 PATHSPEC_ATTR);
499 if (!ps->nr) {
500 if (!ps->recursive ||
501 !(ps->magic & PATHSPEC_MAXDEPTH) ||
502 ps->max_depth == -1)
503 return MATCHED_RECURSIVELY;
505 if (within_depth(name, namelen, 0, ps->max_depth))
506 return MATCHED_EXACTLY;
507 else
508 return 0;
511 name += prefix;
512 namelen -= prefix;
514 for (i = ps->nr - 1; i >= 0; i--) {
515 int how;
517 if ((!exclude && ps->items[i].magic & PATHSPEC_EXCLUDE) ||
518 ( exclude && !(ps->items[i].magic & PATHSPEC_EXCLUDE)))
519 continue;
521 if (seen && seen[i] == MATCHED_EXACTLY)
522 continue;
524 * Make exclude patterns optional and never report
525 * "pathspec ':(exclude)foo' matches no files"
527 if (seen && ps->items[i].magic & PATHSPEC_EXCLUDE)
528 seen[i] = MATCHED_FNMATCH;
529 how = match_pathspec_item(istate, ps->items+i, prefix, name,
530 namelen, flags);
531 if (ps->recursive &&
532 (ps->magic & PATHSPEC_MAXDEPTH) &&
533 ps->max_depth != -1 &&
534 how && how != MATCHED_FNMATCH) {
535 int len = ps->items[i].len;
536 if (name[len] == '/')
537 len++;
538 if (within_depth(name+len, namelen-len, 0, ps->max_depth))
539 how = MATCHED_EXACTLY;
540 else
541 how = 0;
543 if (how) {
544 if (retval < how)
545 retval = how;
546 if (seen && seen[i] < how)
547 seen[i] = how;
550 return retval;
553 static int match_pathspec_with_flags(struct index_state *istate,
554 const struct pathspec *ps,
555 const char *name, int namelen,
556 int prefix, char *seen, unsigned flags)
558 int positive, negative;
559 positive = do_match_pathspec(istate, ps, name, namelen,
560 prefix, seen, flags);
561 if (!(ps->magic & PATHSPEC_EXCLUDE) || !positive)
562 return positive;
563 negative = do_match_pathspec(istate, ps, name, namelen,
564 prefix, seen,
565 flags | DO_MATCH_EXCLUDE);
566 return negative ? 0 : positive;
569 int match_pathspec(struct index_state *istate,
570 const struct pathspec *ps,
571 const char *name, int namelen,
572 int prefix, char *seen, int is_dir)
574 unsigned flags = is_dir ? DO_MATCH_DIRECTORY : 0;
575 return match_pathspec_with_flags(istate, ps, name, namelen,
576 prefix, seen, flags);
580 * Check if a submodule is a superset of the pathspec
582 int submodule_path_match(struct index_state *istate,
583 const struct pathspec *ps,
584 const char *submodule_name,
585 char *seen)
587 int matched = match_pathspec_with_flags(istate, ps, submodule_name,
588 strlen(submodule_name),
589 0, seen,
590 DO_MATCH_DIRECTORY |
591 DO_MATCH_LEADING_PATHSPEC);
592 return matched;
595 int report_path_error(const char *ps_matched,
596 const struct pathspec *pathspec)
599 * Make sure all pathspec matched; otherwise it is an error.
601 int num, errors = 0;
602 for (num = 0; num < pathspec->nr; num++) {
603 int other, found_dup;
605 if (ps_matched[num])
606 continue;
608 * The caller might have fed identical pathspec
609 * twice. Do not barf on such a mistake.
610 * FIXME: parse_pathspec should have eliminated
611 * duplicate pathspec.
613 for (found_dup = other = 0;
614 !found_dup && other < pathspec->nr;
615 other++) {
616 if (other == num || !ps_matched[other])
617 continue;
618 if (!strcmp(pathspec->items[other].original,
619 pathspec->items[num].original))
621 * Ok, we have a match already.
623 found_dup = 1;
625 if (found_dup)
626 continue;
628 error(_("pathspec '%s' did not match any file(s) known to git"),
629 pathspec->items[num].original);
630 errors++;
632 return errors;
636 * Return the length of the "simple" part of a path match limiter.
638 int simple_length(const char *match)
640 int len = -1;
642 for (;;) {
643 unsigned char c = *match++;
644 len++;
645 if (c == '\0' || is_glob_special(c))
646 return len;
650 int no_wildcard(const char *string)
652 return string[simple_length(string)] == '\0';
655 void parse_path_pattern(const char **pattern,
656 int *patternlen,
657 unsigned *flags,
658 int *nowildcardlen)
660 const char *p = *pattern;
661 size_t i, len;
663 *flags = 0;
664 if (*p == '!') {
665 *flags |= PATTERN_FLAG_NEGATIVE;
666 p++;
668 len = strlen(p);
669 if (len && p[len - 1] == '/') {
670 len--;
671 *flags |= PATTERN_FLAG_MUSTBEDIR;
673 for (i = 0; i < len; i++) {
674 if (p[i] == '/')
675 break;
677 if (i == len)
678 *flags |= PATTERN_FLAG_NODIR;
679 *nowildcardlen = simple_length(p);
681 * we should have excluded the trailing slash from 'p' too,
682 * but that's one more allocation. Instead just make sure
683 * nowildcardlen does not exceed real patternlen
685 if (*nowildcardlen > len)
686 *nowildcardlen = len;
687 if (*p == '*' && no_wildcard(p + 1))
688 *flags |= PATTERN_FLAG_ENDSWITH;
689 *pattern = p;
690 *patternlen = len;
693 int pl_hashmap_cmp(const void *cmp_data UNUSED,
694 const struct hashmap_entry *a,
695 const struct hashmap_entry *b,
696 const void *key UNUSED)
698 const struct pattern_entry *ee1 =
699 container_of(a, struct pattern_entry, ent);
700 const struct pattern_entry *ee2 =
701 container_of(b, struct pattern_entry, ent);
703 size_t min_len = ee1->patternlen <= ee2->patternlen
704 ? ee1->patternlen
705 : ee2->patternlen;
707 return fspathncmp(ee1->pattern, ee2->pattern, min_len);
710 static char *dup_and_filter_pattern(const char *pattern)
712 char *set, *read;
713 size_t count = 0;
714 char *result = xstrdup(pattern);
716 set = result;
717 read = result;
719 while (*read) {
720 /* skip escape characters (once) */
721 if (*read == '\\')
722 read++;
724 *set = *read;
726 set++;
727 read++;
728 count++;
730 *set = 0;
732 if (count > 2 &&
733 *(set - 1) == '*' &&
734 *(set - 2) == '/')
735 *(set - 2) = 0;
737 return result;
740 static void clear_pattern_entry_hashmap(struct hashmap *map)
742 struct hashmap_iter iter;
743 struct pattern_entry *entry;
745 hashmap_for_each_entry(map, &iter, entry, ent) {
746 free(entry->pattern);
748 hashmap_clear_and_free(map, struct pattern_entry, ent);
751 static void add_pattern_to_hashsets(struct pattern_list *pl, struct path_pattern *given)
753 struct pattern_entry *translated;
754 char *truncated;
755 char *data = NULL;
756 const char *prev, *cur, *next;
758 if (!pl->use_cone_patterns)
759 return;
761 if (given->flags & PATTERN_FLAG_NEGATIVE &&
762 given->flags & PATTERN_FLAG_MUSTBEDIR &&
763 !strcmp(given->pattern, "/*")) {
764 pl->full_cone = 0;
765 return;
768 if (!given->flags && !strcmp(given->pattern, "/*")) {
769 pl->full_cone = 1;
770 return;
773 if (given->patternlen < 2 ||
774 *given->pattern != '/' ||
775 strstr(given->pattern, "**")) {
776 /* Not a cone pattern. */
777 warning(_("unrecognized pattern: '%s'"), given->pattern);
778 goto clear_hashmaps;
781 if (!(given->flags & PATTERN_FLAG_MUSTBEDIR) &&
782 strcmp(given->pattern, "/*")) {
783 /* Not a cone pattern. */
784 warning(_("unrecognized pattern: '%s'"), given->pattern);
785 goto clear_hashmaps;
788 prev = given->pattern;
789 cur = given->pattern + 1;
790 next = given->pattern + 2;
792 while (*cur) {
793 /* Watch for glob characters '*', '\', '[', '?' */
794 if (!is_glob_special(*cur))
795 goto increment;
797 /* But only if *prev != '\\' */
798 if (*prev == '\\')
799 goto increment;
801 /* But allow the initial '\' */
802 if (*cur == '\\' &&
803 is_glob_special(*next))
804 goto increment;
806 /* But a trailing '/' then '*' is fine */
807 if (*prev == '/' &&
808 *cur == '*' &&
809 *next == 0)
810 goto increment;
812 /* Not a cone pattern. */
813 warning(_("unrecognized pattern: '%s'"), given->pattern);
814 goto clear_hashmaps;
816 increment:
817 prev++;
818 cur++;
819 next++;
822 if (given->patternlen > 2 &&
823 !strcmp(given->pattern + given->patternlen - 2, "/*")) {
824 struct pattern_entry *old;
826 if (!(given->flags & PATTERN_FLAG_NEGATIVE)) {
827 /* Not a cone pattern. */
828 warning(_("unrecognized pattern: '%s'"), given->pattern);
829 goto clear_hashmaps;
832 truncated = dup_and_filter_pattern(given->pattern);
834 translated = xmalloc(sizeof(struct pattern_entry));
835 translated->pattern = truncated;
836 translated->patternlen = given->patternlen - 2;
837 hashmap_entry_init(&translated->ent,
838 fspathhash(translated->pattern));
840 if (!hashmap_get_entry(&pl->recursive_hashmap,
841 translated, ent, NULL)) {
842 /* We did not see the "parent" included */
843 warning(_("unrecognized negative pattern: '%s'"),
844 given->pattern);
845 free(truncated);
846 free(translated);
847 goto clear_hashmaps;
850 hashmap_add(&pl->parent_hashmap, &translated->ent);
851 old = hashmap_remove_entry(&pl->recursive_hashmap, translated, ent, &data);
852 if (old) {
853 free(old->pattern);
854 free(old);
856 free(data);
857 return;
860 if (given->flags & PATTERN_FLAG_NEGATIVE) {
861 warning(_("unrecognized negative pattern: '%s'"),
862 given->pattern);
863 goto clear_hashmaps;
866 translated = xmalloc(sizeof(struct pattern_entry));
868 translated->pattern = dup_and_filter_pattern(given->pattern);
869 translated->patternlen = given->patternlen;
870 hashmap_entry_init(&translated->ent,
871 fspathhash(translated->pattern));
873 hashmap_add(&pl->recursive_hashmap, &translated->ent);
875 if (hashmap_get_entry(&pl->parent_hashmap, translated, ent, NULL)) {
876 /* we already included this at the parent level */
877 warning(_("your sparse-checkout file may have issues: pattern '%s' is repeated"),
878 given->pattern);
879 goto clear_hashmaps;
882 return;
884 clear_hashmaps:
885 warning(_("disabling cone pattern matching"));
886 clear_pattern_entry_hashmap(&pl->recursive_hashmap);
887 clear_pattern_entry_hashmap(&pl->parent_hashmap);
888 pl->use_cone_patterns = 0;
891 static int hashmap_contains_path(struct hashmap *map,
892 struct strbuf *pattern)
894 struct pattern_entry p;
896 /* Check straight mapping */
897 p.pattern = pattern->buf;
898 p.patternlen = pattern->len;
899 hashmap_entry_init(&p.ent, fspathhash(p.pattern));
900 return !!hashmap_get_entry(map, &p, ent, NULL);
903 int hashmap_contains_parent(struct hashmap *map,
904 const char *path,
905 struct strbuf *buffer)
907 char *slash_pos;
909 strbuf_setlen(buffer, 0);
911 if (path[0] != '/')
912 strbuf_addch(buffer, '/');
914 strbuf_addstr(buffer, path);
916 slash_pos = strrchr(buffer->buf, '/');
918 while (slash_pos > buffer->buf) {
919 strbuf_setlen(buffer, slash_pos - buffer->buf);
921 if (hashmap_contains_path(map, buffer))
922 return 1;
924 slash_pos = strrchr(buffer->buf, '/');
927 return 0;
930 void add_pattern(const char *string, const char *base,
931 int baselen, struct pattern_list *pl, int srcpos)
933 struct path_pattern *pattern;
934 int patternlen;
935 unsigned flags;
936 int nowildcardlen;
938 parse_path_pattern(&string, &patternlen, &flags, &nowildcardlen);
939 FLEX_ALLOC_MEM(pattern, pattern, string, patternlen);
940 pattern->patternlen = patternlen;
941 pattern->nowildcardlen = nowildcardlen;
942 pattern->base = base;
943 pattern->baselen = baselen;
944 pattern->flags = flags;
945 pattern->srcpos = srcpos;
946 ALLOC_GROW(pl->patterns, pl->nr + 1, pl->alloc);
947 pl->patterns[pl->nr++] = pattern;
948 pattern->pl = pl;
950 add_pattern_to_hashsets(pl, pattern);
953 static int read_skip_worktree_file_from_index(struct index_state *istate,
954 const char *path,
955 size_t *size_out, char **data_out,
956 struct oid_stat *oid_stat)
958 int pos, len;
960 len = strlen(path);
961 pos = index_name_pos(istate, path, len);
962 if (pos < 0)
963 return -1;
964 if (!ce_skip_worktree(istate->cache[pos]))
965 return -1;
967 return do_read_blob(&istate->cache[pos]->oid, oid_stat, size_out, data_out);
971 * Frees memory within pl which was allocated for exclude patterns and
972 * the file buffer. Does not free pl itself.
974 void clear_pattern_list(struct pattern_list *pl)
976 int i;
978 for (i = 0; i < pl->nr; i++)
979 free(pl->patterns[i]);
980 free(pl->patterns);
981 clear_pattern_entry_hashmap(&pl->recursive_hashmap);
982 clear_pattern_entry_hashmap(&pl->parent_hashmap);
984 memset(pl, 0, sizeof(*pl));
987 static void trim_trailing_spaces(char *buf)
989 char *p, *last_space = NULL;
991 for (p = buf; *p; p++)
992 switch (*p) {
993 case ' ':
994 if (!last_space)
995 last_space = p;
996 break;
997 case '\\':
998 p++;
999 if (!*p)
1000 return;
1001 /* fallthrough */
1002 default:
1003 last_space = NULL;
1006 if (last_space)
1007 *last_space = '\0';
1011 * Given a subdirectory name and "dir" of the current directory,
1012 * search the subdir in "dir" and return it, or create a new one if it
1013 * does not exist in "dir".
1015 * If "name" has the trailing slash, it'll be excluded in the search.
1017 static struct untracked_cache_dir *lookup_untracked(struct untracked_cache *uc,
1018 struct untracked_cache_dir *dir,
1019 const char *name, int len)
1021 int first, last;
1022 struct untracked_cache_dir *d;
1023 if (!dir)
1024 return NULL;
1025 if (len && name[len - 1] == '/')
1026 len--;
1027 first = 0;
1028 last = dir->dirs_nr;
1029 while (last > first) {
1030 int cmp, next = first + ((last - first) >> 1);
1031 d = dir->dirs[next];
1032 cmp = strncmp(name, d->name, len);
1033 if (!cmp && strlen(d->name) > len)
1034 cmp = -1;
1035 if (!cmp)
1036 return d;
1037 if (cmp < 0) {
1038 last = next;
1039 continue;
1041 first = next+1;
1044 uc->dir_created++;
1045 FLEX_ALLOC_MEM(d, name, name, len);
1047 ALLOC_GROW(dir->dirs, dir->dirs_nr + 1, dir->dirs_alloc);
1048 MOVE_ARRAY(dir->dirs + first + 1, dir->dirs + first,
1049 dir->dirs_nr - first);
1050 dir->dirs_nr++;
1051 dir->dirs[first] = d;
1052 return d;
1055 static void do_invalidate_gitignore(struct untracked_cache_dir *dir)
1057 int i;
1058 dir->valid = 0;
1059 for (size_t i = 0; i < dir->untracked_nr; i++)
1060 free(dir->untracked[i]);
1061 dir->untracked_nr = 0;
1062 for (i = 0; i < dir->dirs_nr; i++)
1063 do_invalidate_gitignore(dir->dirs[i]);
1066 static void invalidate_gitignore(struct untracked_cache *uc,
1067 struct untracked_cache_dir *dir)
1069 uc->gitignore_invalidated++;
1070 do_invalidate_gitignore(dir);
1073 static void invalidate_directory(struct untracked_cache *uc,
1074 struct untracked_cache_dir *dir)
1076 int i;
1079 * Invalidation increment here is just roughly correct. If
1080 * untracked_nr or any of dirs[].recurse is non-zero, we
1081 * should increment dir_invalidated too. But that's more
1082 * expensive to do.
1084 if (dir->valid)
1085 uc->dir_invalidated++;
1087 dir->valid = 0;
1088 for (size_t i = 0; i < dir->untracked_nr; i++)
1089 free(dir->untracked[i]);
1090 dir->untracked_nr = 0;
1091 for (i = 0; i < dir->dirs_nr; i++)
1092 dir->dirs[i]->recurse = 0;
1095 static int add_patterns_from_buffer(char *buf, size_t size,
1096 const char *base, int baselen,
1097 struct pattern_list *pl);
1099 /* Flags for add_patterns() */
1100 #define PATTERN_NOFOLLOW (1<<0)
1103 * Given a file with name "fname", read it (either from disk, or from
1104 * an index if 'istate' is non-null), parse it and store the
1105 * exclude rules in "pl".
1107 * If "oid_stat" is not NULL, compute oid of the exclude file and fill
1108 * stat data from disk (only valid if add_patterns returns zero). If
1109 * oid_stat.valid is non-zero, "oid_stat" must contain good value as input.
1111 static int add_patterns(const char *fname, const char *base, int baselen,
1112 struct pattern_list *pl, struct index_state *istate,
1113 unsigned flags, struct oid_stat *oid_stat)
1115 struct stat st;
1116 int r;
1117 int fd;
1118 size_t size = 0;
1119 char *buf;
1121 if (flags & PATTERN_NOFOLLOW)
1122 fd = open_nofollow(fname, O_RDONLY);
1123 else
1124 fd = open(fname, O_RDONLY);
1126 if (fd < 0 || fstat(fd, &st) < 0) {
1127 if (fd < 0)
1128 warn_on_fopen_errors(fname);
1129 else
1130 close(fd);
1131 if (!istate)
1132 return -1;
1133 r = read_skip_worktree_file_from_index(istate, fname,
1134 &size, &buf,
1135 oid_stat);
1136 if (r != 1)
1137 return r;
1138 } else {
1139 size = xsize_t(st.st_size);
1140 if (size == 0) {
1141 if (oid_stat) {
1142 fill_stat_data(&oid_stat->stat, &st);
1143 oidcpy(&oid_stat->oid, the_hash_algo->empty_blob);
1144 oid_stat->valid = 1;
1146 close(fd);
1147 return 0;
1149 buf = xmallocz(size);
1150 if (read_in_full(fd, buf, size) != size) {
1151 free(buf);
1152 close(fd);
1153 return -1;
1155 buf[size++] = '\n';
1156 close(fd);
1157 if (oid_stat) {
1158 int pos;
1159 if (oid_stat->valid &&
1160 !match_stat_data_racy(istate, &oid_stat->stat, &st))
1161 ; /* no content change, oid_stat->oid still good */
1162 else if (istate &&
1163 (pos = index_name_pos(istate, fname, strlen(fname))) >= 0 &&
1164 !ce_stage(istate->cache[pos]) &&
1165 ce_uptodate(istate->cache[pos]) &&
1166 !would_convert_to_git(istate, fname))
1167 oidcpy(&oid_stat->oid,
1168 &istate->cache[pos]->oid);
1169 else
1170 hash_object_file(the_hash_algo, buf, size,
1171 OBJ_BLOB, &oid_stat->oid);
1172 fill_stat_data(&oid_stat->stat, &st);
1173 oid_stat->valid = 1;
1177 if (size > PATTERN_MAX_FILE_SIZE) {
1178 warning("ignoring excessively large pattern file: %s", fname);
1179 free(buf);
1180 return -1;
1183 add_patterns_from_buffer(buf, size, base, baselen, pl);
1184 free(buf);
1185 return 0;
1188 static int add_patterns_from_buffer(char *buf, size_t size,
1189 const char *base, int baselen,
1190 struct pattern_list *pl)
1192 char *orig = buf;
1193 int i, lineno = 1;
1194 char *entry;
1196 hashmap_init(&pl->recursive_hashmap, pl_hashmap_cmp, NULL, 0);
1197 hashmap_init(&pl->parent_hashmap, pl_hashmap_cmp, NULL, 0);
1199 if (skip_utf8_bom(&buf, size))
1200 size -= buf - orig;
1202 entry = buf;
1204 for (i = 0; i < size; i++) {
1205 if (buf[i] == '\n') {
1206 if (entry != buf + i && entry[0] != '#') {
1207 buf[i - (i && buf[i-1] == '\r')] = 0;
1208 trim_trailing_spaces(entry);
1209 add_pattern(entry, base, baselen, pl, lineno);
1211 lineno++;
1212 entry = buf + i + 1;
1215 return 0;
1218 int add_patterns_from_file_to_list(const char *fname, const char *base,
1219 int baselen, struct pattern_list *pl,
1220 struct index_state *istate,
1221 unsigned flags)
1223 return add_patterns(fname, base, baselen, pl, istate, flags, NULL);
1226 int add_patterns_from_blob_to_list(
1227 struct object_id *oid,
1228 const char *base, int baselen,
1229 struct pattern_list *pl)
1231 char *buf;
1232 size_t size;
1233 int r;
1235 r = do_read_blob(oid, NULL, &size, &buf);
1236 if (r != 1)
1237 return r;
1239 if (size > PATTERN_MAX_FILE_SIZE) {
1240 warning("ignoring excessively large pattern blob: %s",
1241 oid_to_hex(oid));
1242 free(buf);
1243 return -1;
1246 add_patterns_from_buffer(buf, size, base, baselen, pl);
1247 free(buf);
1248 return 0;
1251 struct pattern_list *add_pattern_list(struct dir_struct *dir,
1252 int group_type, const char *src)
1254 struct pattern_list *pl;
1255 struct exclude_list_group *group;
1257 group = &dir->internal.exclude_list_group[group_type];
1258 ALLOC_GROW(group->pl, group->nr + 1, group->alloc);
1259 pl = &group->pl[group->nr++];
1260 memset(pl, 0, sizeof(*pl));
1261 pl->src = src;
1262 return pl;
1266 * Used to set up core.excludesfile and .git/info/exclude lists.
1268 static void add_patterns_from_file_1(struct dir_struct *dir, const char *fname,
1269 struct oid_stat *oid_stat)
1271 struct pattern_list *pl;
1273 * catch setup_standard_excludes() that's called before
1274 * dir->untracked is assigned. That function behaves
1275 * differently when dir->untracked is non-NULL.
1277 if (!dir->untracked)
1278 dir->internal.unmanaged_exclude_files++;
1279 pl = add_pattern_list(dir, EXC_FILE, fname);
1280 if (add_patterns(fname, "", 0, pl, NULL, 0, oid_stat) < 0)
1281 die(_("cannot use %s as an exclude file"), fname);
1284 void add_patterns_from_file(struct dir_struct *dir, const char *fname)
1286 dir->internal.unmanaged_exclude_files++; /* see validate_untracked_cache() */
1287 add_patterns_from_file_1(dir, fname, NULL);
1290 int match_basename(const char *basename, int basenamelen,
1291 const char *pattern, int prefix, int patternlen,
1292 unsigned flags)
1294 if (prefix == patternlen) {
1295 if (patternlen == basenamelen &&
1296 !fspathncmp(pattern, basename, basenamelen))
1297 return 1;
1298 } else if (flags & PATTERN_FLAG_ENDSWITH) {
1299 /* "*literal" matching against "fooliteral" */
1300 if (patternlen - 1 <= basenamelen &&
1301 !fspathncmp(pattern + 1,
1302 basename + basenamelen - (patternlen - 1),
1303 patternlen - 1))
1304 return 1;
1305 } else {
1306 if (fnmatch_icase_mem(pattern, patternlen,
1307 basename, basenamelen,
1308 0) == 0)
1309 return 1;
1311 return 0;
1314 int match_pathname(const char *pathname, int pathlen,
1315 const char *base, int baselen,
1316 const char *pattern, int prefix, int patternlen)
1318 const char *name;
1319 int namelen;
1322 * match with FNM_PATHNAME; the pattern has base implicitly
1323 * in front of it.
1325 if (*pattern == '/') {
1326 pattern++;
1327 patternlen--;
1328 prefix--;
1332 * baselen does not count the trailing slash. base[] may or
1333 * may not end with a trailing slash though.
1335 if (pathlen < baselen + 1 ||
1336 (baselen && pathname[baselen] != '/') ||
1337 fspathncmp(pathname, base, baselen))
1338 return 0;
1340 namelen = baselen ? pathlen - baselen - 1 : pathlen;
1341 name = pathname + pathlen - namelen;
1343 if (prefix) {
1345 * if the non-wildcard part is longer than the
1346 * remaining pathname, surely it cannot match.
1348 if (prefix > namelen)
1349 return 0;
1351 if (fspathncmp(pattern, name, prefix))
1352 return 0;
1353 pattern += prefix;
1354 patternlen -= prefix;
1355 name += prefix;
1356 namelen -= prefix;
1359 * If the whole pattern did not have a wildcard,
1360 * then our prefix match is all we need; we
1361 * do not need to call fnmatch at all.
1363 if (!patternlen && !namelen)
1364 return 1;
1367 return fnmatch_icase_mem(pattern, patternlen,
1368 name, namelen,
1369 WM_PATHNAME) == 0;
1373 * Scan the given exclude list in reverse to see whether pathname
1374 * should be ignored. The first match (i.e. the last on the list), if
1375 * any, determines the fate. Returns the exclude_list element which
1376 * matched, or NULL for undecided.
1378 static struct path_pattern *last_matching_pattern_from_list(const char *pathname,
1379 int pathlen,
1380 const char *basename,
1381 int *dtype,
1382 struct pattern_list *pl,
1383 struct index_state *istate)
1385 struct path_pattern *res = NULL; /* undecided */
1386 int i;
1388 if (!pl->nr)
1389 return NULL; /* undefined */
1391 for (i = pl->nr - 1; 0 <= i; i--) {
1392 struct path_pattern *pattern = pl->patterns[i];
1393 const char *exclude = pattern->pattern;
1394 int prefix = pattern->nowildcardlen;
1396 if (pattern->flags & PATTERN_FLAG_MUSTBEDIR) {
1397 *dtype = resolve_dtype(*dtype, istate, pathname, pathlen);
1398 if (*dtype != DT_DIR)
1399 continue;
1402 if (pattern->flags & PATTERN_FLAG_NODIR) {
1403 if (match_basename(basename,
1404 pathlen - (basename - pathname),
1405 exclude, prefix, pattern->patternlen,
1406 pattern->flags)) {
1407 res = pattern;
1408 break;
1410 continue;
1413 assert(pattern->baselen == 0 ||
1414 pattern->base[pattern->baselen - 1] == '/');
1415 if (match_pathname(pathname, pathlen,
1416 pattern->base,
1417 pattern->baselen ? pattern->baselen - 1 : 0,
1418 exclude, prefix, pattern->patternlen)) {
1419 res = pattern;
1420 break;
1423 return res;
1427 * Scan the list of patterns to determine if the ordered list
1428 * of patterns matches on 'pathname'.
1430 * Return 1 for a match, 0 for not matched and -1 for undecided.
1432 enum pattern_match_result path_matches_pattern_list(
1433 const char *pathname, int pathlen,
1434 const char *basename, int *dtype,
1435 struct pattern_list *pl,
1436 struct index_state *istate)
1438 struct path_pattern *pattern;
1439 struct strbuf parent_pathname = STRBUF_INIT;
1440 int result = NOT_MATCHED;
1441 size_t slash_pos;
1443 if (!pl->use_cone_patterns) {
1444 pattern = last_matching_pattern_from_list(pathname, pathlen, basename,
1445 dtype, pl, istate);
1446 if (pattern) {
1447 if (pattern->flags & PATTERN_FLAG_NEGATIVE)
1448 return NOT_MATCHED;
1449 else
1450 return MATCHED;
1453 return UNDECIDED;
1456 if (pl->full_cone)
1457 return MATCHED;
1459 strbuf_addch(&parent_pathname, '/');
1460 strbuf_add(&parent_pathname, pathname, pathlen);
1463 * Directory entries are matched if and only if a file
1464 * contained immediately within them is matched. For the
1465 * case of a directory entry, modify the path to create
1466 * a fake filename within this directory, allowing us to
1467 * use the file-base matching logic in an equivalent way.
1469 if (parent_pathname.len > 0 &&
1470 parent_pathname.buf[parent_pathname.len - 1] == '/') {
1471 slash_pos = parent_pathname.len - 1;
1472 strbuf_add(&parent_pathname, "-", 1);
1473 } else {
1474 const char *slash_ptr = strrchr(parent_pathname.buf, '/');
1475 slash_pos = slash_ptr ? slash_ptr - parent_pathname.buf : 0;
1478 if (hashmap_contains_path(&pl->recursive_hashmap,
1479 &parent_pathname)) {
1480 result = MATCHED_RECURSIVE;
1481 goto done;
1484 if (!slash_pos) {
1485 /* include every file in root */
1486 result = MATCHED;
1487 goto done;
1490 strbuf_setlen(&parent_pathname, slash_pos);
1492 if (hashmap_contains_path(&pl->parent_hashmap, &parent_pathname)) {
1493 result = MATCHED;
1494 goto done;
1497 if (hashmap_contains_parent(&pl->recursive_hashmap,
1498 pathname,
1499 &parent_pathname))
1500 result = MATCHED_RECURSIVE;
1502 done:
1503 strbuf_release(&parent_pathname);
1504 return result;
1507 int init_sparse_checkout_patterns(struct index_state *istate)
1509 if (!core_apply_sparse_checkout)
1510 return 1;
1511 if (istate->sparse_checkout_patterns)
1512 return 0;
1514 CALLOC_ARRAY(istate->sparse_checkout_patterns, 1);
1516 if (get_sparse_checkout_patterns(istate->sparse_checkout_patterns) < 0) {
1517 FREE_AND_NULL(istate->sparse_checkout_patterns);
1518 return -1;
1521 return 0;
1524 static int path_in_sparse_checkout_1(const char *path,
1525 struct index_state *istate,
1526 int require_cone_mode)
1528 int dtype = DT_REG;
1529 enum pattern_match_result match = UNDECIDED;
1530 const char *end, *slash;
1533 * We default to accepting a path if the path is empty, there are no
1534 * patterns, or the patterns are of the wrong type.
1536 if (!*path ||
1537 init_sparse_checkout_patterns(istate) ||
1538 (require_cone_mode &&
1539 !istate->sparse_checkout_patterns->use_cone_patterns))
1540 return 1;
1543 * If UNDECIDED, use the match from the parent dir (recursively), or
1544 * fall back to NOT_MATCHED at the topmost level. Note that cone mode
1545 * never returns UNDECIDED, so we will execute only one iteration in
1546 * this case.
1548 for (end = path + strlen(path);
1549 end > path && match == UNDECIDED;
1550 end = slash) {
1552 for (slash = end - 1; slash > path && *slash != '/'; slash--)
1553 ; /* do nothing */
1555 match = path_matches_pattern_list(path, end - path,
1556 slash > path ? slash + 1 : path, &dtype,
1557 istate->sparse_checkout_patterns, istate);
1559 /* We are going to match the parent dir now */
1560 dtype = DT_DIR;
1562 return match > 0;
1565 int path_in_sparse_checkout(const char *path,
1566 struct index_state *istate)
1568 return path_in_sparse_checkout_1(path, istate, 0);
1571 int path_in_cone_mode_sparse_checkout(const char *path,
1572 struct index_state *istate)
1574 return path_in_sparse_checkout_1(path, istate, 1);
1577 static struct path_pattern *last_matching_pattern_from_lists(
1578 struct dir_struct *dir, struct index_state *istate,
1579 const char *pathname, int pathlen,
1580 const char *basename, int *dtype_p)
1582 int i, j;
1583 struct exclude_list_group *group;
1584 struct path_pattern *pattern;
1585 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
1586 group = &dir->internal.exclude_list_group[i];
1587 for (j = group->nr - 1; j >= 0; j--) {
1588 pattern = last_matching_pattern_from_list(
1589 pathname, pathlen, basename, dtype_p,
1590 &group->pl[j], istate);
1591 if (pattern)
1592 return pattern;
1595 return NULL;
1599 * Loads the per-directory exclude list for the substring of base
1600 * which has a char length of baselen.
1602 static void prep_exclude(struct dir_struct *dir,
1603 struct index_state *istate,
1604 const char *base, int baselen)
1606 struct exclude_list_group *group;
1607 struct pattern_list *pl;
1608 struct exclude_stack *stk = NULL;
1609 struct untracked_cache_dir *untracked;
1610 int current;
1612 group = &dir->internal.exclude_list_group[EXC_DIRS];
1615 * Pop the exclude lists from the EXCL_DIRS exclude_list_group
1616 * which originate from directories not in the prefix of the
1617 * path being checked.
1619 while ((stk = dir->internal.exclude_stack) != NULL) {
1620 if (stk->baselen <= baselen &&
1621 !strncmp(dir->internal.basebuf.buf, base, stk->baselen))
1622 break;
1623 pl = &group->pl[dir->internal.exclude_stack->exclude_ix];
1624 dir->internal.exclude_stack = stk->prev;
1625 dir->internal.pattern = NULL;
1626 free((char *)pl->src); /* see strbuf_detach() below */
1627 clear_pattern_list(pl);
1628 free(stk);
1629 group->nr--;
1632 /* Skip traversing into sub directories if the parent is excluded */
1633 if (dir->internal.pattern)
1634 return;
1637 * Lazy initialization. All call sites currently just
1638 * memset(dir, 0, sizeof(*dir)) before use. Changing all of
1639 * them seems lots of work for little benefit.
1641 if (!dir->internal.basebuf.buf)
1642 strbuf_init(&dir->internal.basebuf, PATH_MAX);
1644 /* Read from the parent directories and push them down. */
1645 current = stk ? stk->baselen : -1;
1646 strbuf_setlen(&dir->internal.basebuf, current < 0 ? 0 : current);
1647 if (dir->untracked)
1648 untracked = stk ? stk->ucd : dir->untracked->root;
1649 else
1650 untracked = NULL;
1652 while (current < baselen) {
1653 const char *cp;
1654 struct oid_stat oid_stat;
1656 CALLOC_ARRAY(stk, 1);
1657 if (current < 0) {
1658 cp = base;
1659 current = 0;
1660 } else {
1661 cp = strchr(base + current + 1, '/');
1662 if (!cp)
1663 die("oops in prep_exclude");
1664 cp++;
1665 untracked =
1666 lookup_untracked(dir->untracked,
1667 untracked,
1668 base + current,
1669 cp - base - current);
1671 stk->prev = dir->internal.exclude_stack;
1672 stk->baselen = cp - base;
1673 stk->exclude_ix = group->nr;
1674 stk->ucd = untracked;
1675 pl = add_pattern_list(dir, EXC_DIRS, NULL);
1676 strbuf_add(&dir->internal.basebuf, base + current, stk->baselen - current);
1677 assert(stk->baselen == dir->internal.basebuf.len);
1679 /* Abort if the directory is excluded */
1680 if (stk->baselen) {
1681 int dt = DT_DIR;
1682 dir->internal.basebuf.buf[stk->baselen - 1] = 0;
1683 dir->internal.pattern = last_matching_pattern_from_lists(dir,
1684 istate,
1685 dir->internal.basebuf.buf, stk->baselen - 1,
1686 dir->internal.basebuf.buf + current, &dt);
1687 dir->internal.basebuf.buf[stk->baselen - 1] = '/';
1688 if (dir->internal.pattern &&
1689 dir->internal.pattern->flags & PATTERN_FLAG_NEGATIVE)
1690 dir->internal.pattern = NULL;
1691 if (dir->internal.pattern) {
1692 dir->internal.exclude_stack = stk;
1693 return;
1697 /* Try to read per-directory file */
1698 oidclr(&oid_stat.oid, the_repository->hash_algo);
1699 oid_stat.valid = 0;
1700 if (dir->exclude_per_dir &&
1702 * If we know that no files have been added in
1703 * this directory (i.e. valid_cached_dir() has
1704 * been executed and set untracked->valid) ..
1706 (!untracked || !untracked->valid ||
1708 * .. and .gitignore does not exist before
1709 * (i.e. null exclude_oid). Then we can skip
1710 * loading .gitignore, which would result in
1711 * ENOENT anyway.
1713 !is_null_oid(&untracked->exclude_oid))) {
1715 * dir->internal.basebuf gets reused by the traversal,
1716 * but we need fname to remain unchanged to ensure the
1717 * src member of each struct path_pattern correctly
1718 * back-references its source file. Other invocations
1719 * of add_pattern_list provide stable strings, so we
1720 * strbuf_detach() and free() here in the caller.
1722 struct strbuf sb = STRBUF_INIT;
1723 strbuf_addbuf(&sb, &dir->internal.basebuf);
1724 strbuf_addstr(&sb, dir->exclude_per_dir);
1725 pl->src = strbuf_detach(&sb, NULL);
1726 add_patterns(pl->src, pl->src, stk->baselen, pl, istate,
1727 PATTERN_NOFOLLOW,
1728 untracked ? &oid_stat : NULL);
1731 * NEEDSWORK: when untracked cache is enabled, prep_exclude()
1732 * will first be called in valid_cached_dir() then maybe many
1733 * times more in last_matching_pattern(). When the cache is
1734 * used, last_matching_pattern() will not be called and
1735 * reading .gitignore content will be a waste.
1737 * So when it's called by valid_cached_dir() and we can get
1738 * .gitignore SHA-1 from the index (i.e. .gitignore is not
1739 * modified on work tree), we could delay reading the
1740 * .gitignore content until we absolutely need it in
1741 * last_matching_pattern(). Be careful about ignore rule
1742 * order, though, if you do that.
1744 if (untracked &&
1745 !oideq(&oid_stat.oid, &untracked->exclude_oid)) {
1746 invalidate_gitignore(dir->untracked, untracked);
1747 oidcpy(&untracked->exclude_oid, &oid_stat.oid);
1749 dir->internal.exclude_stack = stk;
1750 current = stk->baselen;
1752 strbuf_setlen(&dir->internal.basebuf, baselen);
1756 * Loads the exclude lists for the directory containing pathname, then
1757 * scans all exclude lists to determine whether pathname is excluded.
1758 * Returns the exclude_list element which matched, or NULL for
1759 * undecided.
1761 struct path_pattern *last_matching_pattern(struct dir_struct *dir,
1762 struct index_state *istate,
1763 const char *pathname,
1764 int *dtype_p)
1766 int pathlen = strlen(pathname);
1767 const char *basename = strrchr(pathname, '/');
1768 basename = (basename) ? basename+1 : pathname;
1770 prep_exclude(dir, istate, pathname, basename-pathname);
1772 if (dir->internal.pattern)
1773 return dir->internal.pattern;
1775 return last_matching_pattern_from_lists(dir, istate, pathname, pathlen,
1776 basename, dtype_p);
1780 * Loads the exclude lists for the directory containing pathname, then
1781 * scans all exclude lists to determine whether pathname is excluded.
1782 * Returns 1 if true, otherwise 0.
1784 int is_excluded(struct dir_struct *dir, struct index_state *istate,
1785 const char *pathname, int *dtype_p)
1787 struct path_pattern *pattern =
1788 last_matching_pattern(dir, istate, pathname, dtype_p);
1789 if (pattern)
1790 return pattern->flags & PATTERN_FLAG_NEGATIVE ? 0 : 1;
1791 return 0;
1794 static struct dir_entry *dir_entry_new(const char *pathname, int len)
1796 struct dir_entry *ent;
1798 FLEX_ALLOC_MEM(ent, name, pathname, len);
1799 ent->len = len;
1800 return ent;
1803 static struct dir_entry *dir_add_name(struct dir_struct *dir,
1804 struct index_state *istate,
1805 const char *pathname, int len)
1807 if (index_file_exists(istate, pathname, len, ignore_case))
1808 return NULL;
1810 ALLOC_GROW(dir->entries, dir->nr+1, dir->internal.alloc);
1811 return dir->entries[dir->nr++] = dir_entry_new(pathname, len);
1814 struct dir_entry *dir_add_ignored(struct dir_struct *dir,
1815 struct index_state *istate,
1816 const char *pathname, int len)
1818 if (!index_name_is_other(istate, pathname, len))
1819 return NULL;
1821 ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->internal.ignored_alloc);
1822 return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);
1825 enum exist_status {
1826 index_nonexistent = 0,
1827 index_directory,
1828 index_gitdir
1832 * Do not use the alphabetically sorted index to look up
1833 * the directory name; instead, use the case insensitive
1834 * directory hash.
1836 static enum exist_status directory_exists_in_index_icase(struct index_state *istate,
1837 const char *dirname, int len)
1839 struct cache_entry *ce;
1841 if (index_dir_exists(istate, dirname, len))
1842 return index_directory;
1844 ce = index_file_exists(istate, dirname, len, ignore_case);
1845 if (ce && S_ISGITLINK(ce->ce_mode))
1846 return index_gitdir;
1848 return index_nonexistent;
1852 * The index sorts alphabetically by entry name, which
1853 * means that a gitlink sorts as '\0' at the end, while
1854 * a directory (which is defined not as an entry, but as
1855 * the files it contains) will sort with the '/' at the
1856 * end.
1858 static enum exist_status directory_exists_in_index(struct index_state *istate,
1859 const char *dirname, int len)
1861 int pos;
1863 if (ignore_case)
1864 return directory_exists_in_index_icase(istate, dirname, len);
1866 pos = index_name_pos(istate, dirname, len);
1867 if (pos < 0)
1868 pos = -pos-1;
1869 while (pos < istate->cache_nr) {
1870 const struct cache_entry *ce = istate->cache[pos++];
1871 unsigned char endchar;
1873 if (strncmp(ce->name, dirname, len))
1874 break;
1875 endchar = ce->name[len];
1876 if (endchar > '/')
1877 break;
1878 if (endchar == '/')
1879 return index_directory;
1880 if (!endchar && S_ISGITLINK(ce->ce_mode))
1881 return index_gitdir;
1883 return index_nonexistent;
1887 * When we find a directory when traversing the filesystem, we
1888 * have three distinct cases:
1890 * - ignore it
1891 * - see it as a directory
1892 * - recurse into it
1894 * and which one we choose depends on a combination of existing
1895 * git index contents and the flags passed into the directory
1896 * traversal routine.
1898 * Case 1: If we *already* have entries in the index under that
1899 * directory name, we always recurse into the directory to see
1900 * all the files.
1902 * Case 2: If we *already* have that directory name as a gitlink,
1903 * we always continue to see it as a gitlink, regardless of whether
1904 * there is an actual git directory there or not (it might not
1905 * be checked out as a subproject!)
1907 * Case 3: if we didn't have it in the index previously, we
1908 * have a few sub-cases:
1910 * (a) if DIR_SHOW_OTHER_DIRECTORIES flag is set, we show it as
1911 * just a directory, unless DIR_HIDE_EMPTY_DIRECTORIES is
1912 * also true, in which case we need to check if it contains any
1913 * untracked and / or ignored files.
1914 * (b) if it looks like a git directory and we don't have the
1915 * DIR_NO_GITLINKS flag, then we treat it as a gitlink, and
1916 * show it as a directory.
1917 * (c) otherwise, we recurse into it.
1919 static enum path_treatment treat_directory(struct dir_struct *dir,
1920 struct index_state *istate,
1921 struct untracked_cache_dir *untracked,
1922 const char *dirname, int len, int baselen, int excluded,
1923 const struct pathspec *pathspec)
1926 * WARNING: From this function, you can return path_recurse or you
1927 * can call read_directory_recursive() (or neither), but
1928 * you CAN'T DO BOTH.
1930 enum path_treatment state;
1931 int matches_how = 0;
1932 int check_only, stop_early;
1933 int old_ignored_nr, old_untracked_nr;
1934 /* The "len-1" is to strip the final '/' */
1935 enum exist_status status = directory_exists_in_index(istate, dirname, len-1);
1937 if (status == index_directory)
1938 return path_recurse;
1939 if (status == index_gitdir)
1940 return path_none;
1941 if (status != index_nonexistent)
1942 BUG("Unhandled value for directory_exists_in_index: %d\n", status);
1945 * We don't want to descend into paths that don't match the necessary
1946 * patterns. Clearly, if we don't have a pathspec, then we can't check
1947 * for matching patterns. Also, if (excluded) then we know we matched
1948 * the exclusion patterns so as an optimization we can skip checking
1949 * for matching patterns.
1951 if (pathspec && !excluded) {
1952 matches_how = match_pathspec_with_flags(istate, pathspec,
1953 dirname, len,
1954 0 /* prefix */,
1955 NULL /* seen */,
1956 DO_MATCH_LEADING_PATHSPEC);
1957 if (!matches_how)
1958 return path_none;
1962 if ((dir->flags & DIR_SKIP_NESTED_GIT) ||
1963 !(dir->flags & DIR_NO_GITLINKS)) {
1965 * Determine if `dirname` is a nested repo by confirming that:
1966 * 1) we are in a nonbare repository, and
1967 * 2) `dirname` is not an immediate parent of `the_repository->gitdir`,
1968 * which could occur if the git_dir or worktree location was
1969 * manually configured by the user; see t2205 testcases 1-3 for
1970 * examples where this matters
1972 int nested_repo;
1973 struct strbuf sb = STRBUF_INIT;
1974 strbuf_addstr(&sb, dirname);
1975 nested_repo = is_nonbare_repository_dir(&sb);
1977 if (nested_repo) {
1978 char *real_dirname, *real_gitdir;
1979 strbuf_addstr(&sb, ".git");
1980 real_dirname = real_pathdup(sb.buf, 1);
1981 real_gitdir = real_pathdup(the_repository->gitdir, 1);
1983 nested_repo = !!strcmp(real_dirname, real_gitdir);
1984 free(real_gitdir);
1985 free(real_dirname);
1987 strbuf_release(&sb);
1989 if (nested_repo) {
1990 if ((dir->flags & DIR_SKIP_NESTED_GIT) ||
1991 (matches_how == MATCHED_RECURSIVELY_LEADING_PATHSPEC))
1992 return path_none;
1993 return excluded ? path_excluded : path_untracked;
1997 if (!(dir->flags & DIR_SHOW_OTHER_DIRECTORIES)) {
1998 if (excluded &&
1999 (dir->flags & DIR_SHOW_IGNORED_TOO) &&
2000 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING)) {
2003 * This is an excluded directory and we are
2004 * showing ignored paths that match an exclude
2005 * pattern. (e.g. show directory as ignored
2006 * only if it matches an exclude pattern).
2007 * This path will either be 'path_excluded`
2008 * (if we are showing empty directories or if
2009 * the directory is not empty), or will be
2010 * 'path_none' (empty directory, and we are
2011 * not showing empty directories).
2013 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
2014 return path_excluded;
2016 if (read_directory_recursive(dir, istate, dirname, len,
2017 untracked, 1, 1, pathspec) == path_excluded)
2018 return path_excluded;
2020 return path_none;
2022 return path_recurse;
2025 assert(dir->flags & DIR_SHOW_OTHER_DIRECTORIES);
2028 * If we have a pathspec which could match something _below_ this
2029 * directory (e.g. when checking 'subdir/' having a pathspec like
2030 * 'subdir/some/deep/path/file' or 'subdir/widget-*.c'), then we
2031 * need to recurse.
2033 if (matches_how == MATCHED_RECURSIVELY_LEADING_PATHSPEC)
2034 return path_recurse;
2036 /* Special cases for where this directory is excluded/ignored */
2037 if (excluded) {
2039 * If DIR_SHOW_OTHER_DIRECTORIES is set and we're not
2040 * hiding empty directories, there is no need to
2041 * recurse into an ignored directory.
2043 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
2044 return path_excluded;
2047 * Even if we are hiding empty directories, we can still avoid
2048 * recursing into ignored directories for DIR_SHOW_IGNORED_TOO
2049 * if DIR_SHOW_IGNORED_TOO_MODE_MATCHING is also set.
2051 if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
2052 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING))
2053 return path_excluded;
2057 * Other than the path_recurse case above, we only need to
2058 * recurse into untracked directories if any of the following
2059 * bits is set:
2060 * - DIR_SHOW_IGNORED (because then we need to determine if
2061 * there are ignored entries below)
2062 * - DIR_SHOW_IGNORED_TOO (same as above)
2063 * - DIR_HIDE_EMPTY_DIRECTORIES (because we have to determine if
2064 * the directory is empty)
2066 if (!excluded &&
2067 !(dir->flags & (DIR_SHOW_IGNORED |
2068 DIR_SHOW_IGNORED_TOO |
2069 DIR_HIDE_EMPTY_DIRECTORIES))) {
2070 return path_untracked;
2074 * Even if we don't want to know all the paths under an untracked or
2075 * ignored directory, we may still need to go into the directory to
2076 * determine if it is empty (because with DIR_HIDE_EMPTY_DIRECTORIES,
2077 * an empty directory should be path_none instead of path_excluded or
2078 * path_untracked).
2080 check_only = ((dir->flags & DIR_HIDE_EMPTY_DIRECTORIES) &&
2081 !(dir->flags & DIR_SHOW_IGNORED_TOO));
2084 * However, there's another optimization possible as a subset of
2085 * check_only, based on the cases we have to consider:
2086 * A) Directory matches no exclude patterns:
2087 * * Directory is empty => path_none
2088 * * Directory has an untracked file under it => path_untracked
2089 * * Directory has only ignored files under it => path_excluded
2090 * B) Directory matches an exclude pattern:
2091 * * Directory is empty => path_none
2092 * * Directory has an untracked file under it => path_excluded
2093 * * Directory has only ignored files under it => path_excluded
2094 * In case A, we can exit as soon as we've found an untracked
2095 * file but otherwise have to walk all files. In case B, though,
2096 * we can stop at the first file we find under the directory.
2098 stop_early = check_only && excluded;
2101 * If /every/ file within an untracked directory is ignored, then
2102 * we want to treat the directory as ignored (for e.g. status
2103 * --porcelain), without listing the individual ignored files
2104 * underneath. To do so, we'll save the current ignored_nr, and
2105 * pop all the ones added after it if it turns out the entire
2106 * directory is ignored. Also, when DIR_SHOW_IGNORED_TOO and
2107 * !DIR_KEEP_UNTRACKED_CONTENTS then we don't want to show
2108 * untracked paths so will need to pop all those off the last
2109 * after we traverse.
2111 old_ignored_nr = dir->ignored_nr;
2112 old_untracked_nr = dir->nr;
2114 /* Actually recurse into dirname now, we'll fixup the state later. */
2115 untracked = lookup_untracked(dir->untracked, untracked,
2116 dirname + baselen, len - baselen);
2117 state = read_directory_recursive(dir, istate, dirname, len, untracked,
2118 check_only, stop_early, pathspec);
2120 /* There are a variety of reasons we may need to fixup the state... */
2121 if (state == path_excluded) {
2122 /* state == path_excluded implies all paths under
2123 * dirname were ignored...
2125 * if running e.g. `git status --porcelain --ignored=matching`,
2126 * then we want to see the subpaths that are ignored.
2128 * if running e.g. just `git status --porcelain`, then
2129 * we just want the directory itself to be listed as ignored
2130 * and not the individual paths underneath.
2132 int want_ignored_subpaths =
2133 ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
2134 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING));
2136 if (want_ignored_subpaths) {
2138 * with --ignored=matching, we want the subpaths
2139 * INSTEAD of the directory itself.
2141 state = path_none;
2142 } else {
2143 for (int i = old_ignored_nr; i < dir->ignored_nr; i++)
2144 FREE_AND_NULL(dir->ignored[i]);
2145 dir->ignored_nr = old_ignored_nr;
2150 * We may need to ignore some of the untracked paths we found while
2151 * traversing subdirectories.
2153 if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
2154 !(dir->flags & DIR_KEEP_UNTRACKED_CONTENTS)) {
2155 for (int i = old_untracked_nr; i < dir->nr; i++)
2156 FREE_AND_NULL(dir->entries[i]);
2157 dir->nr = old_untracked_nr;
2161 * If there is nothing under the current directory and we are not
2162 * hiding empty directories, then we need to report on the
2163 * untracked or ignored status of the directory itself.
2165 if (state == path_none && !(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
2166 state = excluded ? path_excluded : path_untracked;
2168 return state;
2172 * This is an inexact early pruning of any recursive directory
2173 * reading - if the path cannot possibly be in the pathspec,
2174 * return true, and we'll skip it early.
2176 static int simplify_away(const char *path, int pathlen,
2177 const struct pathspec *pathspec)
2179 int i;
2181 if (!pathspec || !pathspec->nr)
2182 return 0;
2184 GUARD_PATHSPEC(pathspec,
2185 PATHSPEC_FROMTOP |
2186 PATHSPEC_MAXDEPTH |
2187 PATHSPEC_LITERAL |
2188 PATHSPEC_GLOB |
2189 PATHSPEC_ICASE |
2190 PATHSPEC_EXCLUDE |
2191 PATHSPEC_ATTR);
2193 for (i = 0; i < pathspec->nr; i++) {
2194 const struct pathspec_item *item = &pathspec->items[i];
2195 int len = item->nowildcard_len;
2197 if (len > pathlen)
2198 len = pathlen;
2199 if (!ps_strncmp(item, item->match, path, len))
2200 return 0;
2203 return 1;
2207 * This function tells us whether an excluded path matches a
2208 * list of "interesting" pathspecs. That is, whether a path matched
2209 * by any of the pathspecs could possibly be ignored by excluding
2210 * the specified path. This can happen if:
2212 * 1. the path is mentioned explicitly in the pathspec
2214 * 2. the path is a directory prefix of some element in the
2215 * pathspec
2217 static int exclude_matches_pathspec(const char *path, int pathlen,
2218 const struct pathspec *pathspec)
2220 int i;
2222 if (!pathspec || !pathspec->nr)
2223 return 0;
2225 GUARD_PATHSPEC(pathspec,
2226 PATHSPEC_FROMTOP |
2227 PATHSPEC_MAXDEPTH |
2228 PATHSPEC_LITERAL |
2229 PATHSPEC_GLOB |
2230 PATHSPEC_ICASE |
2231 PATHSPEC_EXCLUDE |
2232 PATHSPEC_ATTR);
2234 for (i = 0; i < pathspec->nr; i++) {
2235 const struct pathspec_item *item = &pathspec->items[i];
2236 int len = item->nowildcard_len;
2238 if (len == pathlen &&
2239 !ps_strncmp(item, item->match, path, pathlen))
2240 return 1;
2241 if (len > pathlen &&
2242 item->match[pathlen] == '/' &&
2243 !ps_strncmp(item, item->match, path, pathlen))
2244 return 1;
2246 return 0;
2249 static int get_index_dtype(struct index_state *istate,
2250 const char *path, int len)
2252 int pos;
2253 const struct cache_entry *ce;
2255 ce = index_file_exists(istate, path, len, 0);
2256 if (ce) {
2257 if (!ce_uptodate(ce))
2258 return DT_UNKNOWN;
2259 if (S_ISGITLINK(ce->ce_mode))
2260 return DT_DIR;
2262 * Nobody actually cares about the
2263 * difference between DT_LNK and DT_REG
2265 return DT_REG;
2268 /* Try to look it up as a directory */
2269 pos = index_name_pos(istate, path, len);
2270 if (pos >= 0)
2271 return DT_UNKNOWN;
2272 pos = -pos-1;
2273 while (pos < istate->cache_nr) {
2274 ce = istate->cache[pos++];
2275 if (strncmp(ce->name, path, len))
2276 break;
2277 if (ce->name[len] > '/')
2278 break;
2279 if (ce->name[len] < '/')
2280 continue;
2281 if (!ce_uptodate(ce))
2282 break; /* continue? */
2283 return DT_DIR;
2285 return DT_UNKNOWN;
2288 unsigned char get_dtype(struct dirent *e, struct strbuf *path,
2289 int follow_symlink)
2291 struct stat st;
2292 unsigned char dtype = DTYPE(e);
2293 size_t base_path_len;
2295 if (dtype != DT_UNKNOWN && !(follow_symlink && dtype == DT_LNK))
2296 return dtype;
2299 * d_type unknown or unfollowed symlink, try to fall back on [l]stat
2300 * results. If [l]stat fails, explicitly set DT_UNKNOWN.
2302 base_path_len = path->len;
2303 strbuf_addstr(path, e->d_name);
2304 if ((follow_symlink && stat(path->buf, &st)) ||
2305 (!follow_symlink && lstat(path->buf, &st)))
2306 goto cleanup;
2308 /* determine d_type from st_mode */
2309 if (S_ISREG(st.st_mode))
2310 dtype = DT_REG;
2311 else if (S_ISDIR(st.st_mode))
2312 dtype = DT_DIR;
2313 else if (S_ISLNK(st.st_mode))
2314 dtype = DT_LNK;
2316 cleanup:
2317 strbuf_setlen(path, base_path_len);
2318 return dtype;
2321 static int resolve_dtype(int dtype, struct index_state *istate,
2322 const char *path, int len)
2324 struct stat st;
2326 if (dtype != DT_UNKNOWN)
2327 return dtype;
2328 dtype = get_index_dtype(istate, path, len);
2329 if (dtype != DT_UNKNOWN)
2330 return dtype;
2331 if (lstat(path, &st))
2332 return dtype;
2333 if (S_ISREG(st.st_mode))
2334 return DT_REG;
2335 if (S_ISDIR(st.st_mode))
2336 return DT_DIR;
2337 if (S_ISLNK(st.st_mode))
2338 return DT_LNK;
2339 return dtype;
2342 static enum path_treatment treat_path_fast(struct dir_struct *dir,
2343 struct cached_dir *cdir,
2344 struct index_state *istate,
2345 struct strbuf *path,
2346 int baselen,
2347 const struct pathspec *pathspec)
2350 * WARNING: From this function, you can return path_recurse or you
2351 * can call read_directory_recursive() (or neither), but
2352 * you CAN'T DO BOTH.
2354 strbuf_setlen(path, baselen);
2355 if (!cdir->ucd) {
2356 strbuf_addstr(path, cdir->file);
2357 return path_untracked;
2359 strbuf_addstr(path, cdir->ucd->name);
2360 /* treat_one_path() does this before it calls treat_directory() */
2361 strbuf_complete(path, '/');
2362 if (cdir->ucd->check_only)
2364 * check_only is set as a result of treat_directory() getting
2365 * to its bottom. Verify again the same set of directories
2366 * with check_only set.
2368 return read_directory_recursive(dir, istate, path->buf, path->len,
2369 cdir->ucd, 1, 0, pathspec);
2371 * We get path_recurse in the first run when
2372 * directory_exists_in_index() returns index_nonexistent. We
2373 * are sure that new changes in the index does not impact the
2374 * outcome. Return now.
2376 return path_recurse;
2379 static enum path_treatment treat_path(struct dir_struct *dir,
2380 struct untracked_cache_dir *untracked,
2381 struct cached_dir *cdir,
2382 struct index_state *istate,
2383 struct strbuf *path,
2384 int baselen,
2385 const struct pathspec *pathspec)
2387 int has_path_in_index, dtype, excluded;
2389 if (!cdir->d_name)
2390 return treat_path_fast(dir, cdir, istate, path,
2391 baselen, pathspec);
2392 if (is_dot_or_dotdot(cdir->d_name) || !fspathcmp(cdir->d_name, ".git"))
2393 return path_none;
2394 strbuf_setlen(path, baselen);
2395 strbuf_addstr(path, cdir->d_name);
2396 if (simplify_away(path->buf, path->len, pathspec))
2397 return path_none;
2399 dtype = resolve_dtype(cdir->d_type, istate, path->buf, path->len);
2401 /* Always exclude indexed files */
2402 has_path_in_index = !!index_file_exists(istate, path->buf, path->len,
2403 ignore_case);
2404 if (dtype != DT_DIR && has_path_in_index)
2405 return path_none;
2408 * When we are looking at a directory P in the working tree,
2409 * there are three cases:
2411 * (1) P exists in the index. Everything inside the directory P in
2412 * the working tree needs to go when P is checked out from the
2413 * index.
2415 * (2) P does not exist in the index, but there is P/Q in the index.
2416 * We know P will stay a directory when we check out the contents
2417 * of the index, but we do not know yet if there is a directory
2418 * P/Q in the working tree to be killed, so we need to recurse.
2420 * (3) P does not exist in the index, and there is no P/Q in the index
2421 * to require P to be a directory, either. Only in this case, we
2422 * know that everything inside P will not be killed without
2423 * recursing.
2425 if ((dir->flags & DIR_COLLECT_KILLED_ONLY) &&
2426 (dtype == DT_DIR) &&
2427 !has_path_in_index &&
2428 (directory_exists_in_index(istate, path->buf, path->len) == index_nonexistent))
2429 return path_none;
2431 excluded = is_excluded(dir, istate, path->buf, &dtype);
2434 * Excluded? If we don't explicitly want to show
2435 * ignored files, ignore it
2437 if (excluded && !(dir->flags & (DIR_SHOW_IGNORED|DIR_SHOW_IGNORED_TOO)))
2438 return path_excluded;
2440 switch (dtype) {
2441 default:
2442 return path_none;
2443 case DT_DIR:
2445 * WARNING: Do not ignore/amend the return value from
2446 * treat_directory(), and especially do not change it to return
2447 * path_recurse as that can cause exponential slowdown.
2448 * Instead, modify treat_directory() to return the right value.
2450 strbuf_addch(path, '/');
2451 return treat_directory(dir, istate, untracked,
2452 path->buf, path->len,
2453 baselen, excluded, pathspec);
2454 case DT_REG:
2455 case DT_LNK:
2456 if (pathspec &&
2457 !match_pathspec(istate, pathspec, path->buf, path->len,
2458 0 /* prefix */, NULL /* seen */,
2459 0 /* is_dir */))
2460 return path_none;
2461 if (excluded)
2462 return path_excluded;
2463 return path_untracked;
2467 static void add_untracked(struct untracked_cache_dir *dir, const char *name)
2469 if (!dir)
2470 return;
2471 ALLOC_GROW(dir->untracked, dir->untracked_nr + 1,
2472 dir->untracked_alloc);
2473 dir->untracked[dir->untracked_nr++] = xstrdup(name);
2476 static int valid_cached_dir(struct dir_struct *dir,
2477 struct untracked_cache_dir *untracked,
2478 struct index_state *istate,
2479 struct strbuf *path,
2480 int check_only)
2482 struct stat st;
2484 if (!untracked)
2485 return 0;
2488 * With fsmonitor, we can trust the untracked cache's valid field.
2490 refresh_fsmonitor(istate);
2491 if (!(dir->untracked->use_fsmonitor && untracked->valid)) {
2492 if (lstat(path->len ? path->buf : ".", &st)) {
2493 memset(&untracked->stat_data, 0, sizeof(untracked->stat_data));
2494 return 0;
2496 if (!untracked->valid ||
2497 match_stat_data_racy(istate, &untracked->stat_data, &st)) {
2498 fill_stat_data(&untracked->stat_data, &st);
2499 return 0;
2503 if (untracked->check_only != !!check_only)
2504 return 0;
2507 * prep_exclude will be called eventually on this directory,
2508 * but it's called much later in last_matching_pattern(). We
2509 * need it now to determine the validity of the cache for this
2510 * path. The next calls will be nearly no-op, the way
2511 * prep_exclude() is designed.
2513 if (path->len && path->buf[path->len - 1] != '/') {
2514 strbuf_addch(path, '/');
2515 prep_exclude(dir, istate, path->buf, path->len);
2516 strbuf_setlen(path, path->len - 1);
2517 } else
2518 prep_exclude(dir, istate, path->buf, path->len);
2520 /* hopefully prep_exclude() haven't invalidated this entry... */
2521 return untracked->valid;
2524 static int open_cached_dir(struct cached_dir *cdir,
2525 struct dir_struct *dir,
2526 struct untracked_cache_dir *untracked,
2527 struct index_state *istate,
2528 struct strbuf *path,
2529 int check_only)
2531 const char *c_path;
2533 memset(cdir, 0, sizeof(*cdir));
2534 cdir->untracked = untracked;
2535 if (valid_cached_dir(dir, untracked, istate, path, check_only))
2536 return 0;
2537 c_path = path->len ? path->buf : ".";
2538 cdir->fdir = opendir(c_path);
2539 if (!cdir->fdir)
2540 warning_errno(_("could not open directory '%s'"), c_path);
2541 if (dir->untracked) {
2542 invalidate_directory(dir->untracked, untracked);
2543 dir->untracked->dir_opened++;
2545 if (!cdir->fdir)
2546 return -1;
2547 return 0;
2550 static int read_cached_dir(struct cached_dir *cdir)
2552 struct dirent *de;
2554 if (cdir->fdir) {
2555 de = readdir_skip_dot_and_dotdot(cdir->fdir);
2556 if (!de) {
2557 cdir->d_name = NULL;
2558 cdir->d_type = DT_UNKNOWN;
2559 return -1;
2561 cdir->d_name = de->d_name;
2562 cdir->d_type = DTYPE(de);
2563 return 0;
2565 while (cdir->nr_dirs < cdir->untracked->dirs_nr) {
2566 struct untracked_cache_dir *d = cdir->untracked->dirs[cdir->nr_dirs];
2567 if (!d->recurse) {
2568 cdir->nr_dirs++;
2569 continue;
2571 cdir->ucd = d;
2572 cdir->nr_dirs++;
2573 return 0;
2575 cdir->ucd = NULL;
2576 if (cdir->nr_files < cdir->untracked->untracked_nr) {
2577 struct untracked_cache_dir *d = cdir->untracked;
2578 cdir->file = d->untracked[cdir->nr_files++];
2579 return 0;
2581 return -1;
2584 static void close_cached_dir(struct cached_dir *cdir)
2586 if (cdir->fdir)
2587 closedir(cdir->fdir);
2589 * We have gone through this directory and found no untracked
2590 * entries. Mark it valid.
2592 if (cdir->untracked) {
2593 cdir->untracked->valid = 1;
2594 cdir->untracked->recurse = 1;
2598 static void add_path_to_appropriate_result_list(struct dir_struct *dir,
2599 struct untracked_cache_dir *untracked,
2600 struct cached_dir *cdir,
2601 struct index_state *istate,
2602 struct strbuf *path,
2603 int baselen,
2604 const struct pathspec *pathspec,
2605 enum path_treatment state)
2607 /* add the path to the appropriate result list */
2608 switch (state) {
2609 case path_excluded:
2610 if (dir->flags & DIR_SHOW_IGNORED)
2611 dir_add_name(dir, istate, path->buf, path->len);
2612 else if ((dir->flags & DIR_SHOW_IGNORED_TOO) ||
2613 ((dir->flags & DIR_COLLECT_IGNORED) &&
2614 exclude_matches_pathspec(path->buf, path->len,
2615 pathspec)))
2616 dir_add_ignored(dir, istate, path->buf, path->len);
2617 break;
2619 case path_untracked:
2620 if (dir->flags & DIR_SHOW_IGNORED)
2621 break;
2622 dir_add_name(dir, istate, path->buf, path->len);
2623 if (cdir->fdir)
2624 add_untracked(untracked, path->buf + baselen);
2625 break;
2627 default:
2628 break;
2633 * Read a directory tree. We currently ignore anything but
2634 * directories, regular files and symlinks. That's because git
2635 * doesn't handle them at all yet. Maybe that will change some
2636 * day.
2638 * Also, we ignore the name ".git" (even if it is not a directory).
2639 * That likely will not change.
2641 * If 'stop_at_first_file' is specified, 'path_excluded' is returned
2642 * to signal that a file was found. This is the least significant value that
2643 * indicates that a file was encountered that does not depend on the order of
2644 * whether an untracked or excluded path was encountered first.
2646 * Returns the most significant path_treatment value encountered in the scan.
2647 * If 'stop_at_first_file' is specified, `path_excluded` is the most
2648 * significant path_treatment value that will be returned.
2651 static enum path_treatment read_directory_recursive(struct dir_struct *dir,
2652 struct index_state *istate, const char *base, int baselen,
2653 struct untracked_cache_dir *untracked, int check_only,
2654 int stop_at_first_file, const struct pathspec *pathspec)
2657 * WARNING: Do NOT recurse unless path_recurse is returned from
2658 * treat_path(). Recursing on any other return value
2659 * can result in exponential slowdown.
2661 struct cached_dir cdir;
2662 enum path_treatment state, subdir_state, dir_state = path_none;
2663 struct strbuf path = STRBUF_INIT;
2665 strbuf_add(&path, base, baselen);
2667 if (open_cached_dir(&cdir, dir, untracked, istate, &path, check_only))
2668 goto out;
2669 dir->internal.visited_directories++;
2671 if (untracked)
2672 untracked->check_only = !!check_only;
2674 while (!read_cached_dir(&cdir)) {
2675 /* check how the file or directory should be treated */
2676 state = treat_path(dir, untracked, &cdir, istate, &path,
2677 baselen, pathspec);
2678 dir->internal.visited_paths++;
2680 if (state > dir_state)
2681 dir_state = state;
2683 /* recurse into subdir if instructed by treat_path */
2684 if (state == path_recurse) {
2685 struct untracked_cache_dir *ud;
2686 ud = lookup_untracked(dir->untracked,
2687 untracked,
2688 path.buf + baselen,
2689 path.len - baselen);
2690 subdir_state =
2691 read_directory_recursive(dir, istate, path.buf,
2692 path.len, ud,
2693 check_only, stop_at_first_file, pathspec);
2694 if (subdir_state > dir_state)
2695 dir_state = subdir_state;
2697 if (pathspec &&
2698 !match_pathspec(istate, pathspec, path.buf, path.len,
2699 0 /* prefix */, NULL,
2700 0 /* do NOT special case dirs */))
2701 state = path_none;
2704 if (check_only) {
2705 if (stop_at_first_file) {
2707 * If stopping at first file, then
2708 * signal that a file was found by
2709 * returning `path_excluded`. This is
2710 * to return a consistent value
2711 * regardless of whether an ignored or
2712 * excluded file happened to be
2713 * encountered 1st.
2715 * In current usage, the
2716 * `stop_at_first_file` is passed when
2717 * an ancestor directory has matched
2718 * an exclude pattern, so any found
2719 * files will be excluded.
2721 if (dir_state >= path_excluded) {
2722 dir_state = path_excluded;
2723 break;
2727 /* abort early if maximum state has been reached */
2728 if (dir_state == path_untracked) {
2729 if (cdir.fdir)
2730 add_untracked(untracked, path.buf + baselen);
2731 break;
2733 /* skip the add_path_to_appropriate_result_list() */
2734 continue;
2737 add_path_to_appropriate_result_list(dir, untracked, &cdir,
2738 istate, &path, baselen,
2739 pathspec, state);
2741 close_cached_dir(&cdir);
2742 out:
2743 strbuf_release(&path);
2745 return dir_state;
2748 int cmp_dir_entry(const void *p1, const void *p2)
2750 const struct dir_entry *e1 = *(const struct dir_entry **)p1;
2751 const struct dir_entry *e2 = *(const struct dir_entry **)p2;
2753 return name_compare(e1->name, e1->len, e2->name, e2->len);
2756 /* check if *out lexically strictly contains *in */
2757 int check_dir_entry_contains(const struct dir_entry *out, const struct dir_entry *in)
2759 return (out->len < in->len) &&
2760 (out->name[out->len - 1] == '/') &&
2761 !memcmp(out->name, in->name, out->len);
2764 static int treat_leading_path(struct dir_struct *dir,
2765 struct index_state *istate,
2766 const char *path, int len,
2767 const struct pathspec *pathspec)
2769 struct strbuf sb = STRBUF_INIT;
2770 struct strbuf subdir = STRBUF_INIT;
2771 int prevlen, baselen;
2772 const char *cp;
2773 struct cached_dir cdir;
2774 enum path_treatment state = path_none;
2777 * For each directory component of path, we are going to check whether
2778 * that path is relevant given the pathspec. For example, if path is
2779 * foo/bar/baz/
2780 * then we will ask treat_path() whether we should go into foo, then
2781 * whether we should go into bar, then whether baz is relevant.
2782 * Checking each is important because e.g. if path is
2783 * .git/info/
2784 * then we need to check .git to know we shouldn't traverse it.
2785 * If the return from treat_path() is:
2786 * * path_none, for any path, we return false.
2787 * * path_recurse, for all path components, we return true
2788 * * <anything else> for some intermediate component, we make sure
2789 * to add that path to the relevant list but return false
2790 * signifying that we shouldn't recurse into it.
2793 while (len && path[len - 1] == '/')
2794 len--;
2795 if (!len)
2796 return 1;
2798 memset(&cdir, 0, sizeof(cdir));
2799 cdir.d_type = DT_DIR;
2800 baselen = 0;
2801 prevlen = 0;
2802 while (1) {
2803 prevlen = baselen + !!baselen;
2804 cp = path + prevlen;
2805 cp = memchr(cp, '/', path + len - cp);
2806 if (!cp)
2807 baselen = len;
2808 else
2809 baselen = cp - path;
2810 strbuf_reset(&sb);
2811 strbuf_add(&sb, path, baselen);
2812 if (!is_directory(sb.buf))
2813 break;
2814 strbuf_reset(&sb);
2815 strbuf_add(&sb, path, prevlen);
2816 strbuf_reset(&subdir);
2817 strbuf_add(&subdir, path+prevlen, baselen-prevlen);
2818 cdir.d_name = subdir.buf;
2819 state = treat_path(dir, NULL, &cdir, istate, &sb, prevlen, pathspec);
2821 if (state != path_recurse)
2822 break; /* do not recurse into it */
2823 if (len <= baselen)
2824 break; /* finished checking */
2826 add_path_to_appropriate_result_list(dir, NULL, &cdir, istate,
2827 &sb, baselen, pathspec,
2828 state);
2830 strbuf_release(&subdir);
2831 strbuf_release(&sb);
2832 return state == path_recurse;
2835 static const char *get_ident_string(void)
2837 static struct strbuf sb = STRBUF_INIT;
2838 struct utsname uts;
2840 if (sb.len)
2841 return sb.buf;
2842 if (uname(&uts) < 0)
2843 die_errno(_("failed to get kernel name and information"));
2844 strbuf_addf(&sb, "Location %s, system %s", repo_get_work_tree(the_repository),
2845 uts.sysname);
2846 return sb.buf;
2849 static int ident_in_untracked(const struct untracked_cache *uc)
2852 * Previous git versions may have saved many NUL separated
2853 * strings in the "ident" field, but it is insane to manage
2854 * many locations, so just take care of the first one.
2857 return !strcmp(uc->ident.buf, get_ident_string());
2860 static void set_untracked_ident(struct untracked_cache *uc)
2862 strbuf_reset(&uc->ident);
2863 strbuf_addstr(&uc->ident, get_ident_string());
2866 * This strbuf used to contain a list of NUL separated
2867 * strings, so save NUL too for backward compatibility.
2869 strbuf_addch(&uc->ident, 0);
2872 static unsigned new_untracked_cache_flags(struct index_state *istate)
2874 struct repository *repo = istate->repo;
2875 const char *val;
2878 * This logic is coordinated with the setting of these flags in
2879 * wt-status.c#wt_status_collect_untracked(), and the evaluation
2880 * of the config setting in commit.c#git_status_config()
2882 if (!repo_config_get_string_tmp(repo, "status.showuntrackedfiles", &val) &&
2883 !strcmp(val, "all"))
2884 return 0;
2887 * The default, if "all" is not set, is "normal" - leading us here.
2888 * If the value is "none" then it really doesn't matter.
2890 return DIR_SHOW_OTHER_DIRECTORIES | DIR_HIDE_EMPTY_DIRECTORIES;
2893 static void new_untracked_cache(struct index_state *istate, int flags)
2895 struct untracked_cache *uc = xcalloc(1, sizeof(*uc));
2896 strbuf_init(&uc->ident, 100);
2897 uc->exclude_per_dir = ".gitignore";
2898 uc->dir_flags = flags >= 0 ? flags : new_untracked_cache_flags(istate);
2899 set_untracked_ident(uc);
2900 istate->untracked = uc;
2901 istate->cache_changed |= UNTRACKED_CHANGED;
2904 void add_untracked_cache(struct index_state *istate)
2906 if (!istate->untracked) {
2907 new_untracked_cache(istate, -1);
2908 } else {
2909 if (!ident_in_untracked(istate->untracked)) {
2910 free_untracked_cache(istate->untracked);
2911 new_untracked_cache(istate, -1);
2916 void remove_untracked_cache(struct index_state *istate)
2918 if (istate->untracked) {
2919 free_untracked_cache(istate->untracked);
2920 istate->untracked = NULL;
2921 istate->cache_changed |= UNTRACKED_CHANGED;
2925 static struct untracked_cache_dir *validate_untracked_cache(struct dir_struct *dir,
2926 int base_len,
2927 const struct pathspec *pathspec,
2928 struct index_state *istate)
2930 struct untracked_cache_dir *root;
2931 static int untracked_cache_disabled = -1;
2933 if (!dir->untracked)
2934 return NULL;
2935 if (untracked_cache_disabled < 0)
2936 untracked_cache_disabled = git_env_bool("GIT_DISABLE_UNTRACKED_CACHE", 0);
2937 if (untracked_cache_disabled)
2938 return NULL;
2941 * We only support $GIT_DIR/info/exclude and core.excludesfile
2942 * as the global ignore rule files. Any other additions
2943 * (e.g. from command line) invalidate the cache. This
2944 * condition also catches running setup_standard_excludes()
2945 * before setting dir->untracked!
2947 if (dir->internal.unmanaged_exclude_files)
2948 return NULL;
2951 * Optimize for the main use case only: whole-tree git
2952 * status. More work involved in treat_leading_path() if we
2953 * use cache on just a subset of the worktree. pathspec
2954 * support could make the matter even worse.
2956 if (base_len || (pathspec && pathspec->nr))
2957 return NULL;
2959 /* We don't support collecting ignore files */
2960 if (dir->flags & (DIR_SHOW_IGNORED | DIR_SHOW_IGNORED_TOO |
2961 DIR_COLLECT_IGNORED))
2962 return NULL;
2965 * If we use .gitignore in the cache and now you change it to
2966 * .gitexclude, everything will go wrong.
2968 if (dir->exclude_per_dir != dir->untracked->exclude_per_dir &&
2969 strcmp(dir->exclude_per_dir, dir->untracked->exclude_per_dir))
2970 return NULL;
2973 * EXC_CMDL is not considered in the cache. If people set it,
2974 * skip the cache.
2976 if (dir->internal.exclude_list_group[EXC_CMDL].nr)
2977 return NULL;
2979 if (!ident_in_untracked(dir->untracked)) {
2980 warning(_("untracked cache is disabled on this system or location"));
2981 return NULL;
2985 * If the untracked structure we received does not have the same flags
2986 * as requested in this run, we're going to need to either discard the
2987 * existing structure (and potentially later recreate), or bypass the
2988 * untracked cache mechanism for this run.
2990 if (dir->flags != dir->untracked->dir_flags) {
2992 * If the untracked structure we received does not have the same flags
2993 * as configured, then we need to reset / create a new "untracked"
2994 * structure to match the new config.
2996 * Keeping the saved and used untracked cache consistent with the
2997 * configuration provides an opportunity for frequent users of
2998 * "git status -uall" to leverage the untracked cache by aligning their
2999 * configuration - setting "status.showuntrackedfiles" to "all" or
3000 * "normal" as appropriate.
3002 * Previously using -uall (or setting "status.showuntrackedfiles" to
3003 * "all") was incompatible with untracked cache and *consistently*
3004 * caused surprisingly bad performance (with fscache and fsmonitor
3005 * enabled) on Windows.
3007 * IMPROVEMENT OPPORTUNITY: If we reworked the untracked cache storage
3008 * to not be as bound up with the desired output in a given run,
3009 * and instead iterated through and stored enough information to
3010 * correctly serve both "modes", then users could get peak performance
3011 * with or without '-uall' regardless of their
3012 * "status.showuntrackedfiles" config.
3014 if (dir->untracked->dir_flags != new_untracked_cache_flags(istate)) {
3015 free_untracked_cache(istate->untracked);
3016 new_untracked_cache(istate, dir->flags);
3017 dir->untracked = istate->untracked;
3019 else {
3021 * Current untracked cache data is consistent with config, but not
3022 * usable in this request/run; just bypass untracked cache.
3024 return NULL;
3028 if (!dir->untracked->root) {
3029 /* Untracked cache existed but is not initialized; fix that */
3030 FLEX_ALLOC_STR(dir->untracked->root, name, "");
3031 istate->cache_changed |= UNTRACKED_CHANGED;
3034 /* Validate $GIT_DIR/info/exclude and core.excludesfile */
3035 root = dir->untracked->root;
3036 if (!oideq(&dir->internal.ss_info_exclude.oid,
3037 &dir->untracked->ss_info_exclude.oid)) {
3038 invalidate_gitignore(dir->untracked, root);
3039 dir->untracked->ss_info_exclude = dir->internal.ss_info_exclude;
3041 if (!oideq(&dir->internal.ss_excludes_file.oid,
3042 &dir->untracked->ss_excludes_file.oid)) {
3043 invalidate_gitignore(dir->untracked, root);
3044 dir->untracked->ss_excludes_file = dir->internal.ss_excludes_file;
3047 /* Make sure this directory is not dropped out at saving phase */
3048 root->recurse = 1;
3049 return root;
3052 static void emit_traversal_statistics(struct dir_struct *dir,
3053 struct repository *repo,
3054 const char *path,
3055 int path_len)
3057 if (!trace2_is_enabled())
3058 return;
3060 if (!path_len) {
3061 trace2_data_string("read_directory", repo, "path", "");
3062 } else {
3063 struct strbuf tmp = STRBUF_INIT;
3064 strbuf_add(&tmp, path, path_len);
3065 trace2_data_string("read_directory", repo, "path", tmp.buf);
3066 strbuf_release(&tmp);
3069 trace2_data_intmax("read_directory", repo,
3070 "directories-visited", dir->internal.visited_directories);
3071 trace2_data_intmax("read_directory", repo,
3072 "paths-visited", dir->internal.visited_paths);
3074 if (!dir->untracked)
3075 return;
3076 trace2_data_intmax("read_directory", repo,
3077 "node-creation", dir->untracked->dir_created);
3078 trace2_data_intmax("read_directory", repo,
3079 "gitignore-invalidation",
3080 dir->untracked->gitignore_invalidated);
3081 trace2_data_intmax("read_directory", repo,
3082 "directory-invalidation",
3083 dir->untracked->dir_invalidated);
3084 trace2_data_intmax("read_directory", repo,
3085 "opendir", dir->untracked->dir_opened);
3088 int read_directory(struct dir_struct *dir, struct index_state *istate,
3089 const char *path, int len, const struct pathspec *pathspec)
3091 struct untracked_cache_dir *untracked;
3093 trace2_region_enter("dir", "read_directory", istate->repo);
3094 dir->internal.visited_paths = 0;
3095 dir->internal.visited_directories = 0;
3097 if (has_symlink_leading_path(path, len)) {
3098 trace2_region_leave("dir", "read_directory", istate->repo);
3099 return dir->nr;
3102 untracked = validate_untracked_cache(dir, len, pathspec, istate);
3103 if (!untracked)
3105 * make sure untracked cache code path is disabled,
3106 * e.g. prep_exclude()
3108 dir->untracked = NULL;
3109 if (!len || treat_leading_path(dir, istate, path, len, pathspec))
3110 read_directory_recursive(dir, istate, path, len, untracked, 0, 0, pathspec);
3111 QSORT(dir->entries, dir->nr, cmp_dir_entry);
3112 QSORT(dir->ignored, dir->ignored_nr, cmp_dir_entry);
3114 emit_traversal_statistics(dir, istate->repo, path, len);
3116 trace2_region_leave("dir", "read_directory", istate->repo);
3117 if (dir->untracked) {
3118 static int force_untracked_cache = -1;
3120 if (force_untracked_cache < 0)
3121 force_untracked_cache =
3122 git_env_bool("GIT_FORCE_UNTRACKED_CACHE", -1);
3123 if (force_untracked_cache < 0)
3124 force_untracked_cache = (istate->repo->settings.core_untracked_cache == UNTRACKED_CACHE_WRITE);
3125 if (force_untracked_cache &&
3126 dir->untracked == istate->untracked &&
3127 (dir->untracked->dir_opened ||
3128 dir->untracked->gitignore_invalidated ||
3129 dir->untracked->dir_invalidated))
3130 istate->cache_changed |= UNTRACKED_CHANGED;
3131 if (dir->untracked != istate->untracked) {
3132 FREE_AND_NULL(dir->untracked);
3136 return dir->nr;
3139 int file_exists(const char *f)
3141 struct stat sb;
3142 return lstat(f, &sb) == 0;
3145 int repo_file_exists(struct repository *repo, const char *path)
3147 if (repo != the_repository)
3148 BUG("do not know how to check file existence in arbitrary repo");
3150 return file_exists(path);
3153 static int cmp_icase(char a, char b)
3155 if (a == b)
3156 return 0;
3157 if (ignore_case)
3158 return toupper(a) - toupper(b);
3159 return a - b;
3163 * Given two normalized paths (a trailing slash is ok), if subdir is
3164 * outside dir, return -1. Otherwise return the offset in subdir that
3165 * can be used as relative path to dir.
3167 int dir_inside_of(const char *subdir, const char *dir)
3169 int offset = 0;
3171 assert(dir && subdir && *dir && *subdir);
3173 while (*dir && *subdir && !cmp_icase(*dir, *subdir)) {
3174 dir++;
3175 subdir++;
3176 offset++;
3179 /* hel[p]/me vs hel[l]/yeah */
3180 if (*dir && *subdir)
3181 return -1;
3183 if (!*subdir)
3184 return !*dir ? offset : -1; /* same dir */
3186 /* foo/[b]ar vs foo/[] */
3187 if (is_dir_sep(dir[-1]))
3188 return is_dir_sep(subdir[-1]) ? offset : -1;
3190 /* foo[/]bar vs foo[] */
3191 return is_dir_sep(*subdir) ? offset + 1 : -1;
3194 int is_inside_dir(const char *dir)
3196 char *cwd;
3197 int rc;
3199 if (!dir)
3200 return 0;
3202 cwd = xgetcwd();
3203 rc = (dir_inside_of(cwd, dir) >= 0);
3204 free(cwd);
3205 return rc;
3208 int is_empty_dir(const char *path)
3210 DIR *dir = opendir(path);
3211 struct dirent *e;
3212 int ret = 1;
3214 if (!dir)
3215 return 0;
3217 e = readdir_skip_dot_and_dotdot(dir);
3218 if (e)
3219 ret = 0;
3221 closedir(dir);
3222 return ret;
3225 char *git_url_basename(const char *repo, int is_bundle, int is_bare)
3227 const char *end = repo + strlen(repo), *start, *ptr;
3228 size_t len;
3229 char *dir;
3232 * Skip scheme.
3234 start = strstr(repo, "://");
3235 if (!start)
3236 start = repo;
3237 else
3238 start += 3;
3241 * Skip authentication data. The stripping does happen
3242 * greedily, such that we strip up to the last '@' inside
3243 * the host part.
3245 for (ptr = start; ptr < end && !is_dir_sep(*ptr); ptr++) {
3246 if (*ptr == '@')
3247 start = ptr + 1;
3251 * Strip trailing spaces, slashes and /.git
3253 while (start < end && (is_dir_sep(end[-1]) || isspace(end[-1])))
3254 end--;
3255 if (end - start > 5 && is_dir_sep(end[-5]) &&
3256 !strncmp(end - 4, ".git", 4)) {
3257 end -= 5;
3258 while (start < end && is_dir_sep(end[-1]))
3259 end--;
3263 * It should not be possible to overflow `ptrdiff_t` by passing in an
3264 * insanely long URL, but GCC does not know that and will complain
3265 * without this check.
3267 if (end - start < 0)
3268 die(_("No directory name could be guessed.\n"
3269 "Please specify a directory on the command line"));
3272 * Strip trailing port number if we've got only a
3273 * hostname (that is, there is no dir separator but a
3274 * colon). This check is required such that we do not
3275 * strip URI's like '/foo/bar:2222.git', which should
3276 * result in a dir '2222' being guessed due to backwards
3277 * compatibility.
3279 if (memchr(start, '/', end - start) == NULL
3280 && memchr(start, ':', end - start) != NULL) {
3281 ptr = end;
3282 while (start < ptr && isdigit(ptr[-1]) && ptr[-1] != ':')
3283 ptr--;
3284 if (start < ptr && ptr[-1] == ':')
3285 end = ptr - 1;
3289 * Find last component. To remain backwards compatible we
3290 * also regard colons as path separators, such that
3291 * cloning a repository 'foo:bar.git' would result in a
3292 * directory 'bar' being guessed.
3294 ptr = end;
3295 while (start < ptr && !is_dir_sep(ptr[-1]) && ptr[-1] != ':')
3296 ptr--;
3297 start = ptr;
3300 * Strip .{bundle,git}.
3302 len = end - start;
3303 strip_suffix_mem(start, &len, is_bundle ? ".bundle" : ".git");
3305 if (!len || (len == 1 && *start == '/'))
3306 die(_("No directory name could be guessed.\n"
3307 "Please specify a directory on the command line"));
3309 if (is_bare)
3310 dir = xstrfmt("%.*s.git", (int)len, start);
3311 else
3312 dir = xstrndup(start, len);
3314 * Replace sequences of 'control' characters and whitespace
3315 * with one ascii space, remove leading and trailing spaces.
3317 if (*dir) {
3318 char *out = dir;
3319 int prev_space = 1 /* strip leading whitespace */;
3320 for (end = dir; *end; ++end) {
3321 char ch = *end;
3322 if ((unsigned char)ch < '\x20')
3323 ch = '\x20';
3324 if (isspace(ch)) {
3325 if (prev_space)
3326 continue;
3327 prev_space = 1;
3328 } else
3329 prev_space = 0;
3330 *out++ = ch;
3332 *out = '\0';
3333 if (out > dir && prev_space)
3334 out[-1] = '\0';
3336 return dir;
3339 void strip_dir_trailing_slashes(char *dir)
3341 char *end = dir + strlen(dir);
3343 while (dir < end - 1 && is_dir_sep(end[-1]))
3344 end--;
3345 *end = '\0';
3348 static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up)
3350 DIR *dir;
3351 struct dirent *e;
3352 int ret = 0, original_len = path->len, len, kept_down = 0;
3353 int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY);
3354 int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL);
3355 int purge_original_cwd = (flag & REMOVE_DIR_PURGE_ORIGINAL_CWD);
3356 struct object_id submodule_head;
3358 if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) &&
3359 !repo_resolve_gitlink_ref(the_repository, path->buf,
3360 "HEAD", &submodule_head)) {
3361 /* Do not descend and nuke a nested git work tree. */
3362 if (kept_up)
3363 *kept_up = 1;
3364 return 0;
3367 flag &= ~REMOVE_DIR_KEEP_TOPLEVEL;
3368 dir = opendir(path->buf);
3369 if (!dir) {
3370 if (errno == ENOENT)
3371 return keep_toplevel ? -1 : 0;
3372 else if (errno == EACCES && !keep_toplevel)
3374 * An empty dir could be removable even if it
3375 * is unreadable:
3377 return rmdir(path->buf);
3378 else
3379 return -1;
3381 strbuf_complete(path, '/');
3383 len = path->len;
3384 while ((e = readdir_skip_dot_and_dotdot(dir)) != NULL) {
3385 struct stat st;
3387 strbuf_setlen(path, len);
3388 strbuf_addstr(path, e->d_name);
3389 if (lstat(path->buf, &st)) {
3390 if (errno == ENOENT)
3392 * file disappeared, which is what we
3393 * wanted anyway
3395 continue;
3396 /* fall through */
3397 } else if (S_ISDIR(st.st_mode)) {
3398 if (!remove_dir_recurse(path, flag, &kept_down))
3399 continue; /* happy */
3400 } else if (!only_empty &&
3401 (!unlink(path->buf) || errno == ENOENT)) {
3402 continue; /* happy, too */
3405 /* path too long, stat fails, or non-directory still exists */
3406 ret = -1;
3407 break;
3409 closedir(dir);
3411 strbuf_setlen(path, original_len);
3412 if (!ret && !keep_toplevel && !kept_down) {
3413 if (!purge_original_cwd &&
3414 startup_info->original_cwd &&
3415 !strcmp(startup_info->original_cwd, path->buf))
3416 ret = -1; /* Do not remove current working directory */
3417 else
3418 ret = (!rmdir(path->buf) || errno == ENOENT) ? 0 : -1;
3419 } else if (kept_up)
3421 * report the uplevel that it is not an error that we
3422 * did not rmdir() our directory.
3424 *kept_up = !ret;
3425 return ret;
3428 int remove_dir_recursively(struct strbuf *path, int flag)
3430 return remove_dir_recurse(path, flag, NULL);
3433 static GIT_PATH_FUNC(git_path_info_exclude, "info/exclude")
3435 void setup_standard_excludes(struct dir_struct *dir)
3437 dir->exclude_per_dir = ".gitignore";
3439 /* core.excludesfile defaulting to $XDG_CONFIG_HOME/git/ignore */
3440 if (!excludes_file)
3441 excludes_file = xdg_config_home("ignore");
3442 if (excludes_file && !access_or_warn(excludes_file, R_OK, 0))
3443 add_patterns_from_file_1(dir, excludes_file,
3444 dir->untracked ? &dir->internal.ss_excludes_file : NULL);
3446 /* per repository user preference */
3447 if (startup_info->have_repository) {
3448 const char *path = git_path_info_exclude();
3449 if (!access_or_warn(path, R_OK, 0))
3450 add_patterns_from_file_1(dir, path,
3451 dir->untracked ? &dir->internal.ss_info_exclude : NULL);
3455 char *get_sparse_checkout_filename(void)
3457 return git_pathdup("info/sparse-checkout");
3460 int get_sparse_checkout_patterns(struct pattern_list *pl)
3462 int res;
3463 char *sparse_filename = get_sparse_checkout_filename();
3465 pl->use_cone_patterns = core_sparse_checkout_cone;
3466 res = add_patterns_from_file_to_list(sparse_filename, "", 0, pl, NULL, 0);
3468 free(sparse_filename);
3469 return res;
3472 int remove_path(const char *name)
3474 char *slash;
3476 if (unlink(name) && !is_missing_file_error(errno))
3477 return -1;
3479 slash = strrchr(name, '/');
3480 if (slash) {
3481 char *dirs = xstrdup(name);
3482 slash = dirs + (slash - name);
3483 do {
3484 *slash = '\0';
3485 if (startup_info->original_cwd &&
3486 !strcmp(startup_info->original_cwd, dirs))
3487 break;
3488 } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/')));
3489 free(dirs);
3491 return 0;
3495 * Frees memory within dir which was allocated, and resets fields for further
3496 * use. Does not free dir itself.
3498 void dir_clear(struct dir_struct *dir)
3500 int i, j;
3501 struct exclude_list_group *group;
3502 struct pattern_list *pl;
3503 struct exclude_stack *stk;
3504 struct dir_struct new = DIR_INIT;
3506 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
3507 group = &dir->internal.exclude_list_group[i];
3508 for (j = 0; j < group->nr; j++) {
3509 pl = &group->pl[j];
3510 if (i == EXC_DIRS)
3511 free((char *)pl->src);
3512 clear_pattern_list(pl);
3514 free(group->pl);
3517 for (i = 0; i < dir->ignored_nr; i++)
3518 free(dir->ignored[i]);
3519 for (i = 0; i < dir->nr; i++)
3520 free(dir->entries[i]);
3521 free(dir->ignored);
3522 free(dir->entries);
3524 stk = dir->internal.exclude_stack;
3525 while (stk) {
3526 struct exclude_stack *prev = stk->prev;
3527 free(stk);
3528 stk = prev;
3530 strbuf_release(&dir->internal.basebuf);
3532 memcpy(dir, &new, sizeof(*dir));
3535 struct ondisk_untracked_cache {
3536 struct stat_data info_exclude_stat;
3537 struct stat_data excludes_file_stat;
3538 uint32_t dir_flags;
3541 #define ouc_offset(x) offsetof(struct ondisk_untracked_cache, x)
3543 struct write_data {
3544 int index; /* number of written untracked_cache_dir */
3545 struct ewah_bitmap *check_only; /* from untracked_cache_dir */
3546 struct ewah_bitmap *valid; /* from untracked_cache_dir */
3547 struct ewah_bitmap *sha1_valid; /* set if exclude_sha1 is not null */
3548 struct strbuf out;
3549 struct strbuf sb_stat;
3550 struct strbuf sb_sha1;
3553 static void stat_data_to_disk(struct stat_data *to, const struct stat_data *from)
3555 to->sd_ctime.sec = htonl(from->sd_ctime.sec);
3556 to->sd_ctime.nsec = htonl(from->sd_ctime.nsec);
3557 to->sd_mtime.sec = htonl(from->sd_mtime.sec);
3558 to->sd_mtime.nsec = htonl(from->sd_mtime.nsec);
3559 to->sd_dev = htonl(from->sd_dev);
3560 to->sd_ino = htonl(from->sd_ino);
3561 to->sd_uid = htonl(from->sd_uid);
3562 to->sd_gid = htonl(from->sd_gid);
3563 to->sd_size = htonl(from->sd_size);
3566 static void write_one_dir(struct untracked_cache_dir *untracked,
3567 struct write_data *wd)
3569 struct stat_data stat_data;
3570 struct strbuf *out = &wd->out;
3571 unsigned char intbuf[16];
3572 unsigned int intlen, value;
3573 int i = wd->index++;
3576 * untracked_nr should be reset whenever valid is clear, but
3577 * for safety..
3579 if (!untracked->valid) {
3580 for (size_t i = 0; i < untracked->untracked_nr; i++)
3581 free(untracked->untracked[i]);
3582 untracked->untracked_nr = 0;
3583 untracked->check_only = 0;
3586 if (untracked->check_only)
3587 ewah_set(wd->check_only, i);
3588 if (untracked->valid) {
3589 ewah_set(wd->valid, i);
3590 stat_data_to_disk(&stat_data, &untracked->stat_data);
3591 strbuf_add(&wd->sb_stat, &stat_data, sizeof(stat_data));
3593 if (!is_null_oid(&untracked->exclude_oid)) {
3594 ewah_set(wd->sha1_valid, i);
3595 strbuf_add(&wd->sb_sha1, untracked->exclude_oid.hash,
3596 the_hash_algo->rawsz);
3599 intlen = encode_varint(untracked->untracked_nr, intbuf);
3600 strbuf_add(out, intbuf, intlen);
3602 /* skip non-recurse directories */
3603 for (i = 0, value = 0; i < untracked->dirs_nr; i++)
3604 if (untracked->dirs[i]->recurse)
3605 value++;
3606 intlen = encode_varint(value, intbuf);
3607 strbuf_add(out, intbuf, intlen);
3609 strbuf_add(out, untracked->name, strlen(untracked->name) + 1);
3611 for (i = 0; i < untracked->untracked_nr; i++)
3612 strbuf_add(out, untracked->untracked[i],
3613 strlen(untracked->untracked[i]) + 1);
3615 for (i = 0; i < untracked->dirs_nr; i++)
3616 if (untracked->dirs[i]->recurse)
3617 write_one_dir(untracked->dirs[i], wd);
3620 void write_untracked_extension(struct strbuf *out, struct untracked_cache *untracked)
3622 struct ondisk_untracked_cache *ouc;
3623 struct write_data wd;
3624 unsigned char varbuf[16];
3625 int varint_len;
3626 const unsigned hashsz = the_hash_algo->rawsz;
3628 CALLOC_ARRAY(ouc, 1);
3629 stat_data_to_disk(&ouc->info_exclude_stat, &untracked->ss_info_exclude.stat);
3630 stat_data_to_disk(&ouc->excludes_file_stat, &untracked->ss_excludes_file.stat);
3631 ouc->dir_flags = htonl(untracked->dir_flags);
3633 varint_len = encode_varint(untracked->ident.len, varbuf);
3634 strbuf_add(out, varbuf, varint_len);
3635 strbuf_addbuf(out, &untracked->ident);
3637 strbuf_add(out, ouc, sizeof(*ouc));
3638 strbuf_add(out, untracked->ss_info_exclude.oid.hash, hashsz);
3639 strbuf_add(out, untracked->ss_excludes_file.oid.hash, hashsz);
3640 strbuf_add(out, untracked->exclude_per_dir, strlen(untracked->exclude_per_dir) + 1);
3641 FREE_AND_NULL(ouc);
3643 if (!untracked->root) {
3644 varint_len = encode_varint(0, varbuf);
3645 strbuf_add(out, varbuf, varint_len);
3646 return;
3649 wd.index = 0;
3650 wd.check_only = ewah_new();
3651 wd.valid = ewah_new();
3652 wd.sha1_valid = ewah_new();
3653 strbuf_init(&wd.out, 1024);
3654 strbuf_init(&wd.sb_stat, 1024);
3655 strbuf_init(&wd.sb_sha1, 1024);
3656 write_one_dir(untracked->root, &wd);
3658 varint_len = encode_varint(wd.index, varbuf);
3659 strbuf_add(out, varbuf, varint_len);
3660 strbuf_addbuf(out, &wd.out);
3661 ewah_serialize_strbuf(wd.valid, out);
3662 ewah_serialize_strbuf(wd.check_only, out);
3663 ewah_serialize_strbuf(wd.sha1_valid, out);
3664 strbuf_addbuf(out, &wd.sb_stat);
3665 strbuf_addbuf(out, &wd.sb_sha1);
3666 strbuf_addch(out, '\0'); /* safe guard for string lists */
3668 ewah_free(wd.valid);
3669 ewah_free(wd.check_only);
3670 ewah_free(wd.sha1_valid);
3671 strbuf_release(&wd.out);
3672 strbuf_release(&wd.sb_stat);
3673 strbuf_release(&wd.sb_sha1);
3676 static void free_untracked(struct untracked_cache_dir *ucd)
3678 int i;
3679 if (!ucd)
3680 return;
3681 for (i = 0; i < ucd->dirs_nr; i++)
3682 free_untracked(ucd->dirs[i]);
3683 for (i = 0; i < ucd->untracked_nr; i++)
3684 free(ucd->untracked[i]);
3685 free(ucd->untracked);
3686 free(ucd->dirs);
3687 free(ucd);
3690 void free_untracked_cache(struct untracked_cache *uc)
3692 if (!uc)
3693 return;
3695 free(uc->exclude_per_dir_to_free);
3696 strbuf_release(&uc->ident);
3697 free_untracked(uc->root);
3698 free(uc);
3701 struct read_data {
3702 int index;
3703 struct untracked_cache_dir **ucd;
3704 struct ewah_bitmap *check_only;
3705 struct ewah_bitmap *valid;
3706 struct ewah_bitmap *sha1_valid;
3707 const unsigned char *data;
3708 const unsigned char *end;
3711 static void stat_data_from_disk(struct stat_data *to, const unsigned char *data)
3713 memcpy(to, data, sizeof(*to));
3714 to->sd_ctime.sec = ntohl(to->sd_ctime.sec);
3715 to->sd_ctime.nsec = ntohl(to->sd_ctime.nsec);
3716 to->sd_mtime.sec = ntohl(to->sd_mtime.sec);
3717 to->sd_mtime.nsec = ntohl(to->sd_mtime.nsec);
3718 to->sd_dev = ntohl(to->sd_dev);
3719 to->sd_ino = ntohl(to->sd_ino);
3720 to->sd_uid = ntohl(to->sd_uid);
3721 to->sd_gid = ntohl(to->sd_gid);
3722 to->sd_size = ntohl(to->sd_size);
3725 static int read_one_dir(struct untracked_cache_dir **untracked_,
3726 struct read_data *rd)
3728 struct untracked_cache_dir ud, *untracked;
3729 const unsigned char *data = rd->data, *end = rd->end;
3730 const unsigned char *eos;
3731 unsigned int value;
3732 int i;
3734 memset(&ud, 0, sizeof(ud));
3736 value = decode_varint(&data);
3737 if (data > end)
3738 return -1;
3739 ud.recurse = 1;
3740 ud.untracked_alloc = value;
3741 ud.untracked_nr = value;
3742 if (ud.untracked_nr)
3743 ALLOC_ARRAY(ud.untracked, ud.untracked_nr);
3745 ud.dirs_alloc = ud.dirs_nr = decode_varint(&data);
3746 if (data > end)
3747 return -1;
3748 ALLOC_ARRAY(ud.dirs, ud.dirs_nr);
3750 eos = memchr(data, '\0', end - data);
3751 if (!eos || eos == end)
3752 return -1;
3754 *untracked_ = untracked = xmalloc(st_add3(sizeof(*untracked), eos - data, 1));
3755 memcpy(untracked, &ud, sizeof(ud));
3756 memcpy(untracked->name, data, eos - data + 1);
3757 data = eos + 1;
3759 for (i = 0; i < untracked->untracked_nr; i++) {
3760 eos = memchr(data, '\0', end - data);
3761 if (!eos || eos == end)
3762 return -1;
3763 untracked->untracked[i] = xmemdupz(data, eos - data);
3764 data = eos + 1;
3767 rd->ucd[rd->index++] = untracked;
3768 rd->data = data;
3770 for (i = 0; i < untracked->dirs_nr; i++) {
3771 if (read_one_dir(untracked->dirs + i, rd) < 0)
3772 return -1;
3774 return 0;
3777 static void set_check_only(size_t pos, void *cb)
3779 struct read_data *rd = cb;
3780 struct untracked_cache_dir *ud = rd->ucd[pos];
3781 ud->check_only = 1;
3784 static void read_stat(size_t pos, void *cb)
3786 struct read_data *rd = cb;
3787 struct untracked_cache_dir *ud = rd->ucd[pos];
3788 if (rd->data + sizeof(struct stat_data) > rd->end) {
3789 rd->data = rd->end + 1;
3790 return;
3792 stat_data_from_disk(&ud->stat_data, rd->data);
3793 rd->data += sizeof(struct stat_data);
3794 ud->valid = 1;
3797 static void read_oid(size_t pos, void *cb)
3799 struct read_data *rd = cb;
3800 struct untracked_cache_dir *ud = rd->ucd[pos];
3801 if (rd->data + the_hash_algo->rawsz > rd->end) {
3802 rd->data = rd->end + 1;
3803 return;
3805 oidread(&ud->exclude_oid, rd->data, the_repository->hash_algo);
3806 rd->data += the_hash_algo->rawsz;
3809 static void load_oid_stat(struct oid_stat *oid_stat, const unsigned char *data,
3810 const unsigned char *sha1)
3812 stat_data_from_disk(&oid_stat->stat, data);
3813 oidread(&oid_stat->oid, sha1, the_repository->hash_algo);
3814 oid_stat->valid = 1;
3817 struct untracked_cache *read_untracked_extension(const void *data, unsigned long sz)
3819 struct untracked_cache *uc;
3820 struct read_data rd;
3821 const unsigned char *next = data, *end = (const unsigned char *)data + sz;
3822 const char *ident;
3823 int ident_len;
3824 ssize_t len;
3825 const char *exclude_per_dir;
3826 const unsigned hashsz = the_hash_algo->rawsz;
3827 const unsigned offset = sizeof(struct ondisk_untracked_cache);
3828 const unsigned exclude_per_dir_offset = offset + 2 * hashsz;
3830 if (sz <= 1 || end[-1] != '\0')
3831 return NULL;
3832 end--;
3834 ident_len = decode_varint(&next);
3835 if (next + ident_len > end)
3836 return NULL;
3837 ident = (const char *)next;
3838 next += ident_len;
3840 if (next + exclude_per_dir_offset + 1 > end)
3841 return NULL;
3843 CALLOC_ARRAY(uc, 1);
3844 strbuf_init(&uc->ident, ident_len);
3845 strbuf_add(&uc->ident, ident, ident_len);
3846 load_oid_stat(&uc->ss_info_exclude,
3847 next + ouc_offset(info_exclude_stat),
3848 next + offset);
3849 load_oid_stat(&uc->ss_excludes_file,
3850 next + ouc_offset(excludes_file_stat),
3851 next + offset + hashsz);
3852 uc->dir_flags = get_be32(next + ouc_offset(dir_flags));
3853 exclude_per_dir = (const char *)next + exclude_per_dir_offset;
3854 uc->exclude_per_dir = uc->exclude_per_dir_to_free = xstrdup(exclude_per_dir);
3855 /* NUL after exclude_per_dir is covered by sizeof(*ouc) */
3856 next += exclude_per_dir_offset + strlen(exclude_per_dir) + 1;
3857 if (next >= end)
3858 goto done2;
3860 len = decode_varint(&next);
3861 if (next > end || len == 0)
3862 goto done2;
3864 rd.valid = ewah_new();
3865 rd.check_only = ewah_new();
3866 rd.sha1_valid = ewah_new();
3867 rd.data = next;
3868 rd.end = end;
3869 rd.index = 0;
3870 ALLOC_ARRAY(rd.ucd, len);
3872 if (read_one_dir(&uc->root, &rd) || rd.index != len)
3873 goto done;
3875 next = rd.data;
3876 len = ewah_read_mmap(rd.valid, next, end - next);
3877 if (len < 0)
3878 goto done;
3880 next += len;
3881 len = ewah_read_mmap(rd.check_only, next, end - next);
3882 if (len < 0)
3883 goto done;
3885 next += len;
3886 len = ewah_read_mmap(rd.sha1_valid, next, end - next);
3887 if (len < 0)
3888 goto done;
3890 ewah_each_bit(rd.check_only, set_check_only, &rd);
3891 rd.data = next + len;
3892 ewah_each_bit(rd.valid, read_stat, &rd);
3893 ewah_each_bit(rd.sha1_valid, read_oid, &rd);
3894 next = rd.data;
3896 done:
3897 free(rd.ucd);
3898 ewah_free(rd.valid);
3899 ewah_free(rd.check_only);
3900 ewah_free(rd.sha1_valid);
3901 done2:
3902 if (next != end) {
3903 free_untracked_cache(uc);
3904 uc = NULL;
3906 return uc;
3909 static void invalidate_one_directory(struct untracked_cache *uc,
3910 struct untracked_cache_dir *ucd)
3912 uc->dir_invalidated++;
3913 ucd->valid = 0;
3914 for (size_t i = 0; i < ucd->untracked_nr; i++)
3915 free(ucd->untracked[i]);
3916 ucd->untracked_nr = 0;
3920 * Normally when an entry is added or removed from a directory,
3921 * invalidating that directory is enough. No need to touch its
3922 * ancestors. When a directory is shown as "foo/bar/" in git-status
3923 * however, deleting or adding an entry may have cascading effect.
3925 * Say the "foo/bar/file" has become untracked, we need to tell the
3926 * untracked_cache_dir of "foo" that "bar/" is not an untracked
3927 * directory any more (because "bar" is managed by foo as an untracked
3928 * "file").
3930 * Similarly, if "foo/bar/file" moves from untracked to tracked and it
3931 * was the last untracked entry in the entire "foo", we should show
3932 * "foo/" instead. Which means we have to invalidate past "bar" up to
3933 * "foo".
3935 * This function traverses all directories from root to leaf. If there
3936 * is a chance of one of the above cases happening, we invalidate back
3937 * to root. Otherwise we just invalidate the leaf. There may be a more
3938 * sophisticated way than checking for SHOW_OTHER_DIRECTORIES to
3939 * detect these cases and avoid unnecessary invalidation, for example,
3940 * checking for the untracked entry named "bar/" in "foo", but for now
3941 * stick to something safe and simple.
3943 static int invalidate_one_component(struct untracked_cache *uc,
3944 struct untracked_cache_dir *dir,
3945 const char *path, int len)
3947 const char *rest = strchr(path, '/');
3949 if (rest) {
3950 int component_len = rest - path;
3951 struct untracked_cache_dir *d =
3952 lookup_untracked(uc, dir, path, component_len);
3953 int ret =
3954 invalidate_one_component(uc, d, rest + 1,
3955 len - (component_len + 1));
3956 if (ret)
3957 invalidate_one_directory(uc, dir);
3958 return ret;
3961 invalidate_one_directory(uc, dir);
3962 return uc->dir_flags & DIR_SHOW_OTHER_DIRECTORIES;
3965 void untracked_cache_invalidate_path(struct index_state *istate,
3966 const char *path, int safe_path)
3968 if (!istate->untracked || !istate->untracked->root)
3969 return;
3970 if (!safe_path && !verify_path(path, 0))
3971 return;
3972 invalidate_one_component(istate->untracked, istate->untracked->root,
3973 path, strlen(path));
3976 void untracked_cache_invalidate_trimmed_path(struct index_state *istate,
3977 const char *path,
3978 int safe_path)
3980 size_t len = strlen(path);
3982 if (!len)
3983 BUG("untracked_cache_invalidate_trimmed_path given zero length path");
3985 if (path[len - 1] != '/') {
3986 untracked_cache_invalidate_path(istate, path, safe_path);
3987 } else {
3988 struct strbuf tmp = STRBUF_INIT;
3990 strbuf_add(&tmp, path, len - 1);
3991 untracked_cache_invalidate_path(istate, tmp.buf, safe_path);
3992 strbuf_release(&tmp);
3996 void untracked_cache_remove_from_index(struct index_state *istate,
3997 const char *path)
3999 untracked_cache_invalidate_path(istate, path, 1);
4002 void untracked_cache_add_to_index(struct index_state *istate,
4003 const char *path)
4005 untracked_cache_invalidate_path(istate, path, 1);
4008 static void connect_wt_gitdir_in_nested(const char *sub_worktree,
4009 const char *sub_gitdir)
4011 int i;
4012 struct repository subrepo;
4013 struct strbuf sub_wt = STRBUF_INIT;
4014 struct strbuf sub_gd = STRBUF_INIT;
4016 const struct submodule *sub;
4018 /* If the submodule has no working tree, we can ignore it. */
4019 if (repo_init(&subrepo, sub_gitdir, sub_worktree))
4020 return;
4022 if (repo_read_index(&subrepo) < 0)
4023 die(_("index file corrupt in repo %s"), subrepo.gitdir);
4025 /* TODO: audit for interaction with sparse-index. */
4026 ensure_full_index(subrepo.index);
4027 for (i = 0; i < subrepo.index->cache_nr; i++) {
4028 const struct cache_entry *ce = subrepo.index->cache[i];
4030 if (!S_ISGITLINK(ce->ce_mode))
4031 continue;
4033 while (i + 1 < subrepo.index->cache_nr &&
4034 !strcmp(ce->name, subrepo.index->cache[i + 1]->name))
4036 * Skip entries with the same name in different stages
4037 * to make sure an entry is returned only once.
4039 i++;
4041 sub = submodule_from_path(&subrepo, null_oid(), ce->name);
4042 if (!sub || !is_submodule_active(&subrepo, ce->name))
4043 /* .gitmodules broken or inactive sub */
4044 continue;
4046 strbuf_reset(&sub_wt);
4047 strbuf_reset(&sub_gd);
4048 strbuf_addf(&sub_wt, "%s/%s", sub_worktree, sub->path);
4049 submodule_name_to_gitdir(&sub_gd, &subrepo, sub->name);
4051 connect_work_tree_and_git_dir(sub_wt.buf, sub_gd.buf, 1);
4053 strbuf_release(&sub_wt);
4054 strbuf_release(&sub_gd);
4055 repo_clear(&subrepo);
4058 void connect_work_tree_and_git_dir(const char *work_tree_,
4059 const char *git_dir_,
4060 int recurse_into_nested)
4062 struct strbuf gitfile_sb = STRBUF_INIT;
4063 struct strbuf cfg_sb = STRBUF_INIT;
4064 struct strbuf rel_path = STRBUF_INIT;
4065 char *git_dir, *work_tree;
4067 /* Prepare .git file */
4068 strbuf_addf(&gitfile_sb, "%s/.git", work_tree_);
4069 if (safe_create_leading_directories_const(gitfile_sb.buf))
4070 die(_("could not create directories for %s"), gitfile_sb.buf);
4072 /* Prepare config file */
4073 strbuf_addf(&cfg_sb, "%s/config", git_dir_);
4074 if (safe_create_leading_directories_const(cfg_sb.buf))
4075 die(_("could not create directories for %s"), cfg_sb.buf);
4077 git_dir = real_pathdup(git_dir_, 1);
4078 work_tree = real_pathdup(work_tree_, 1);
4080 /* Write .git file */
4081 write_file(gitfile_sb.buf, "gitdir: %s",
4082 relative_path(git_dir, work_tree, &rel_path));
4083 /* Update core.worktree setting */
4084 git_config_set_in_file(cfg_sb.buf, "core.worktree",
4085 relative_path(work_tree, git_dir, &rel_path));
4087 strbuf_release(&gitfile_sb);
4088 strbuf_release(&cfg_sb);
4089 strbuf_release(&rel_path);
4091 if (recurse_into_nested)
4092 connect_wt_gitdir_in_nested(work_tree, git_dir);
4094 free(work_tree);
4095 free(git_dir);
4099 * Migrate the git directory of the given path from old_git_dir to new_git_dir.
4101 void relocate_gitdir(const char *path, const char *old_git_dir, const char *new_git_dir)
4103 if (rename(old_git_dir, new_git_dir) < 0)
4104 die_errno(_("could not migrate git directory from '%s' to '%s'"),
4105 old_git_dir, new_git_dir);
4107 connect_work_tree_and_git_dir(path, new_git_dir, 0);
4110 int path_match_flags(const char *const str, const enum path_match_flags flags)
4112 const char *p = str;
4114 if (flags & PATH_MATCH_NATIVE &&
4115 flags & PATH_MATCH_XPLATFORM)
4116 BUG("path_match_flags() must get one match kind, not multiple!");
4117 else if (!(flags & PATH_MATCH_KINDS_MASK))
4118 BUG("path_match_flags() must get at least one match kind!");
4120 if (flags & PATH_MATCH_STARTS_WITH_DOT_SLASH &&
4121 flags & PATH_MATCH_STARTS_WITH_DOT_DOT_SLASH)
4122 BUG("path_match_flags() must get one platform kind, not multiple!");
4123 else if (!(flags & PATH_MATCH_PLATFORM_MASK))
4124 BUG("path_match_flags() must get at least one platform kind!");
4126 if (*p++ != '.')
4127 return 0;
4128 if (flags & PATH_MATCH_STARTS_WITH_DOT_DOT_SLASH &&
4129 *p++ != '.')
4130 return 0;
4132 if (flags & PATH_MATCH_NATIVE)
4133 return is_dir_sep(*p);
4134 else if (flags & PATH_MATCH_XPLATFORM)
4135 return is_xplatform_dir_sep(*p);
4136 BUG("unreachable");