Merge branch 'ds/line-log-asan-fix'
[git/gitster.git] / dir.c
blobe3ddd5b529647580b77ec1db54c59ce04ea6f9ac
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 dir->untracked_nr = 0;
1060 for (i = 0; i < dir->dirs_nr; i++)
1061 do_invalidate_gitignore(dir->dirs[i]);
1064 static void invalidate_gitignore(struct untracked_cache *uc,
1065 struct untracked_cache_dir *dir)
1067 uc->gitignore_invalidated++;
1068 do_invalidate_gitignore(dir);
1071 static void invalidate_directory(struct untracked_cache *uc,
1072 struct untracked_cache_dir *dir)
1074 int i;
1077 * Invalidation increment here is just roughly correct. If
1078 * untracked_nr or any of dirs[].recurse is non-zero, we
1079 * should increment dir_invalidated too. But that's more
1080 * expensive to do.
1082 if (dir->valid)
1083 uc->dir_invalidated++;
1085 dir->valid = 0;
1086 dir->untracked_nr = 0;
1087 for (i = 0; i < dir->dirs_nr; i++)
1088 dir->dirs[i]->recurse = 0;
1091 static int add_patterns_from_buffer(char *buf, size_t size,
1092 const char *base, int baselen,
1093 struct pattern_list *pl);
1095 /* Flags for add_patterns() */
1096 #define PATTERN_NOFOLLOW (1<<0)
1099 * Given a file with name "fname", read it (either from disk, or from
1100 * an index if 'istate' is non-null), parse it and store the
1101 * exclude rules in "pl".
1103 * If "oid_stat" is not NULL, compute oid of the exclude file and fill
1104 * stat data from disk (only valid if add_patterns returns zero). If
1105 * oid_stat.valid is non-zero, "oid_stat" must contain good value as input.
1107 static int add_patterns(const char *fname, const char *base, int baselen,
1108 struct pattern_list *pl, struct index_state *istate,
1109 unsigned flags, struct oid_stat *oid_stat)
1111 struct stat st;
1112 int r;
1113 int fd;
1114 size_t size = 0;
1115 char *buf;
1117 if (flags & PATTERN_NOFOLLOW)
1118 fd = open_nofollow(fname, O_RDONLY);
1119 else
1120 fd = open(fname, O_RDONLY);
1122 if (fd < 0 || fstat(fd, &st) < 0) {
1123 if (fd < 0)
1124 warn_on_fopen_errors(fname);
1125 else
1126 close(fd);
1127 if (!istate)
1128 return -1;
1129 r = read_skip_worktree_file_from_index(istate, fname,
1130 &size, &buf,
1131 oid_stat);
1132 if (r != 1)
1133 return r;
1134 } else {
1135 size = xsize_t(st.st_size);
1136 if (size == 0) {
1137 if (oid_stat) {
1138 fill_stat_data(&oid_stat->stat, &st);
1139 oidcpy(&oid_stat->oid, the_hash_algo->empty_blob);
1140 oid_stat->valid = 1;
1142 close(fd);
1143 return 0;
1145 buf = xmallocz(size);
1146 if (read_in_full(fd, buf, size) != size) {
1147 free(buf);
1148 close(fd);
1149 return -1;
1151 buf[size++] = '\n';
1152 close(fd);
1153 if (oid_stat) {
1154 int pos;
1155 if (oid_stat->valid &&
1156 !match_stat_data_racy(istate, &oid_stat->stat, &st))
1157 ; /* no content change, oid_stat->oid still good */
1158 else if (istate &&
1159 (pos = index_name_pos(istate, fname, strlen(fname))) >= 0 &&
1160 !ce_stage(istate->cache[pos]) &&
1161 ce_uptodate(istate->cache[pos]) &&
1162 !would_convert_to_git(istate, fname))
1163 oidcpy(&oid_stat->oid,
1164 &istate->cache[pos]->oid);
1165 else
1166 hash_object_file(the_hash_algo, buf, size,
1167 OBJ_BLOB, &oid_stat->oid);
1168 fill_stat_data(&oid_stat->stat, &st);
1169 oid_stat->valid = 1;
1173 if (size > PATTERN_MAX_FILE_SIZE) {
1174 warning("ignoring excessively large pattern file: %s", fname);
1175 free(buf);
1176 return -1;
1179 add_patterns_from_buffer(buf, size, base, baselen, pl);
1180 free(buf);
1181 return 0;
1184 static int add_patterns_from_buffer(char *buf, size_t size,
1185 const char *base, int baselen,
1186 struct pattern_list *pl)
1188 char *orig = buf;
1189 int i, lineno = 1;
1190 char *entry;
1192 hashmap_init(&pl->recursive_hashmap, pl_hashmap_cmp, NULL, 0);
1193 hashmap_init(&pl->parent_hashmap, pl_hashmap_cmp, NULL, 0);
1195 if (skip_utf8_bom(&buf, size))
1196 size -= buf - orig;
1198 entry = buf;
1200 for (i = 0; i < size; i++) {
1201 if (buf[i] == '\n') {
1202 if (entry != buf + i && entry[0] != '#') {
1203 buf[i - (i && buf[i-1] == '\r')] = 0;
1204 trim_trailing_spaces(entry);
1205 add_pattern(entry, base, baselen, pl, lineno);
1207 lineno++;
1208 entry = buf + i + 1;
1211 return 0;
1214 int add_patterns_from_file_to_list(const char *fname, const char *base,
1215 int baselen, struct pattern_list *pl,
1216 struct index_state *istate,
1217 unsigned flags)
1219 return add_patterns(fname, base, baselen, pl, istate, flags, NULL);
1222 int add_patterns_from_blob_to_list(
1223 struct object_id *oid,
1224 const char *base, int baselen,
1225 struct pattern_list *pl)
1227 char *buf;
1228 size_t size;
1229 int r;
1231 r = do_read_blob(oid, NULL, &size, &buf);
1232 if (r != 1)
1233 return r;
1235 if (size > PATTERN_MAX_FILE_SIZE) {
1236 warning("ignoring excessively large pattern blob: %s",
1237 oid_to_hex(oid));
1238 free(buf);
1239 return -1;
1242 add_patterns_from_buffer(buf, size, base, baselen, pl);
1243 free(buf);
1244 return 0;
1247 struct pattern_list *add_pattern_list(struct dir_struct *dir,
1248 int group_type, const char *src)
1250 struct pattern_list *pl;
1251 struct exclude_list_group *group;
1253 group = &dir->internal.exclude_list_group[group_type];
1254 ALLOC_GROW(group->pl, group->nr + 1, group->alloc);
1255 pl = &group->pl[group->nr++];
1256 memset(pl, 0, sizeof(*pl));
1257 pl->src = src;
1258 return pl;
1262 * Used to set up core.excludesfile and .git/info/exclude lists.
1264 static void add_patterns_from_file_1(struct dir_struct *dir, const char *fname,
1265 struct oid_stat *oid_stat)
1267 struct pattern_list *pl;
1269 * catch setup_standard_excludes() that's called before
1270 * dir->untracked is assigned. That function behaves
1271 * differently when dir->untracked is non-NULL.
1273 if (!dir->untracked)
1274 dir->internal.unmanaged_exclude_files++;
1275 pl = add_pattern_list(dir, EXC_FILE, fname);
1276 if (add_patterns(fname, "", 0, pl, NULL, 0, oid_stat) < 0)
1277 die(_("cannot use %s as an exclude file"), fname);
1280 void add_patterns_from_file(struct dir_struct *dir, const char *fname)
1282 dir->internal.unmanaged_exclude_files++; /* see validate_untracked_cache() */
1283 add_patterns_from_file_1(dir, fname, NULL);
1286 int match_basename(const char *basename, int basenamelen,
1287 const char *pattern, int prefix, int patternlen,
1288 unsigned flags)
1290 if (prefix == patternlen) {
1291 if (patternlen == basenamelen &&
1292 !fspathncmp(pattern, basename, basenamelen))
1293 return 1;
1294 } else if (flags & PATTERN_FLAG_ENDSWITH) {
1295 /* "*literal" matching against "fooliteral" */
1296 if (patternlen - 1 <= basenamelen &&
1297 !fspathncmp(pattern + 1,
1298 basename + basenamelen - (patternlen - 1),
1299 patternlen - 1))
1300 return 1;
1301 } else {
1302 if (fnmatch_icase_mem(pattern, patternlen,
1303 basename, basenamelen,
1304 0) == 0)
1305 return 1;
1307 return 0;
1310 int match_pathname(const char *pathname, int pathlen,
1311 const char *base, int baselen,
1312 const char *pattern, int prefix, int patternlen)
1314 const char *name;
1315 int namelen;
1318 * match with FNM_PATHNAME; the pattern has base implicitly
1319 * in front of it.
1321 if (*pattern == '/') {
1322 pattern++;
1323 patternlen--;
1324 prefix--;
1328 * baselen does not count the trailing slash. base[] may or
1329 * may not end with a trailing slash though.
1331 if (pathlen < baselen + 1 ||
1332 (baselen && pathname[baselen] != '/') ||
1333 fspathncmp(pathname, base, baselen))
1334 return 0;
1336 namelen = baselen ? pathlen - baselen - 1 : pathlen;
1337 name = pathname + pathlen - namelen;
1339 if (prefix) {
1341 * if the non-wildcard part is longer than the
1342 * remaining pathname, surely it cannot match.
1344 if (prefix > namelen)
1345 return 0;
1347 if (fspathncmp(pattern, name, prefix))
1348 return 0;
1349 pattern += prefix;
1350 patternlen -= prefix;
1351 name += prefix;
1352 namelen -= prefix;
1355 * If the whole pattern did not have a wildcard,
1356 * then our prefix match is all we need; we
1357 * do not need to call fnmatch at all.
1359 if (!patternlen && !namelen)
1360 return 1;
1363 return fnmatch_icase_mem(pattern, patternlen,
1364 name, namelen,
1365 WM_PATHNAME) == 0;
1369 * Scan the given exclude list in reverse to see whether pathname
1370 * should be ignored. The first match (i.e. the last on the list), if
1371 * any, determines the fate. Returns the exclude_list element which
1372 * matched, or NULL for undecided.
1374 static struct path_pattern *last_matching_pattern_from_list(const char *pathname,
1375 int pathlen,
1376 const char *basename,
1377 int *dtype,
1378 struct pattern_list *pl,
1379 struct index_state *istate)
1381 struct path_pattern *res = NULL; /* undecided */
1382 int i;
1384 if (!pl->nr)
1385 return NULL; /* undefined */
1387 for (i = pl->nr - 1; 0 <= i; i--) {
1388 struct path_pattern *pattern = pl->patterns[i];
1389 const char *exclude = pattern->pattern;
1390 int prefix = pattern->nowildcardlen;
1392 if (pattern->flags & PATTERN_FLAG_MUSTBEDIR) {
1393 *dtype = resolve_dtype(*dtype, istate, pathname, pathlen);
1394 if (*dtype != DT_DIR)
1395 continue;
1398 if (pattern->flags & PATTERN_FLAG_NODIR) {
1399 if (match_basename(basename,
1400 pathlen - (basename - pathname),
1401 exclude, prefix, pattern->patternlen,
1402 pattern->flags)) {
1403 res = pattern;
1404 break;
1406 continue;
1409 assert(pattern->baselen == 0 ||
1410 pattern->base[pattern->baselen - 1] == '/');
1411 if (match_pathname(pathname, pathlen,
1412 pattern->base,
1413 pattern->baselen ? pattern->baselen - 1 : 0,
1414 exclude, prefix, pattern->patternlen)) {
1415 res = pattern;
1416 break;
1419 return res;
1423 * Scan the list of patterns to determine if the ordered list
1424 * of patterns matches on 'pathname'.
1426 * Return 1 for a match, 0 for not matched and -1 for undecided.
1428 enum pattern_match_result path_matches_pattern_list(
1429 const char *pathname, int pathlen,
1430 const char *basename, int *dtype,
1431 struct pattern_list *pl,
1432 struct index_state *istate)
1434 struct path_pattern *pattern;
1435 struct strbuf parent_pathname = STRBUF_INIT;
1436 int result = NOT_MATCHED;
1437 size_t slash_pos;
1439 if (!pl->use_cone_patterns) {
1440 pattern = last_matching_pattern_from_list(pathname, pathlen, basename,
1441 dtype, pl, istate);
1442 if (pattern) {
1443 if (pattern->flags & PATTERN_FLAG_NEGATIVE)
1444 return NOT_MATCHED;
1445 else
1446 return MATCHED;
1449 return UNDECIDED;
1452 if (pl->full_cone)
1453 return MATCHED;
1455 strbuf_addch(&parent_pathname, '/');
1456 strbuf_add(&parent_pathname, pathname, pathlen);
1459 * Directory entries are matched if and only if a file
1460 * contained immediately within them is matched. For the
1461 * case of a directory entry, modify the path to create
1462 * a fake filename within this directory, allowing us to
1463 * use the file-base matching logic in an equivalent way.
1465 if (parent_pathname.len > 0 &&
1466 parent_pathname.buf[parent_pathname.len - 1] == '/') {
1467 slash_pos = parent_pathname.len - 1;
1468 strbuf_add(&parent_pathname, "-", 1);
1469 } else {
1470 const char *slash_ptr = strrchr(parent_pathname.buf, '/');
1471 slash_pos = slash_ptr ? slash_ptr - parent_pathname.buf : 0;
1474 if (hashmap_contains_path(&pl->recursive_hashmap,
1475 &parent_pathname)) {
1476 result = MATCHED_RECURSIVE;
1477 goto done;
1480 if (!slash_pos) {
1481 /* include every file in root */
1482 result = MATCHED;
1483 goto done;
1486 strbuf_setlen(&parent_pathname, slash_pos);
1488 if (hashmap_contains_path(&pl->parent_hashmap, &parent_pathname)) {
1489 result = MATCHED;
1490 goto done;
1493 if (hashmap_contains_parent(&pl->recursive_hashmap,
1494 pathname,
1495 &parent_pathname))
1496 result = MATCHED_RECURSIVE;
1498 done:
1499 strbuf_release(&parent_pathname);
1500 return result;
1503 int init_sparse_checkout_patterns(struct index_state *istate)
1505 if (!core_apply_sparse_checkout)
1506 return 1;
1507 if (istate->sparse_checkout_patterns)
1508 return 0;
1510 CALLOC_ARRAY(istate->sparse_checkout_patterns, 1);
1512 if (get_sparse_checkout_patterns(istate->sparse_checkout_patterns) < 0) {
1513 FREE_AND_NULL(istate->sparse_checkout_patterns);
1514 return -1;
1517 return 0;
1520 static int path_in_sparse_checkout_1(const char *path,
1521 struct index_state *istate,
1522 int require_cone_mode)
1524 int dtype = DT_REG;
1525 enum pattern_match_result match = UNDECIDED;
1526 const char *end, *slash;
1529 * We default to accepting a path if the path is empty, there are no
1530 * patterns, or the patterns are of the wrong type.
1532 if (!*path ||
1533 init_sparse_checkout_patterns(istate) ||
1534 (require_cone_mode &&
1535 !istate->sparse_checkout_patterns->use_cone_patterns))
1536 return 1;
1539 * If UNDECIDED, use the match from the parent dir (recursively), or
1540 * fall back to NOT_MATCHED at the topmost level. Note that cone mode
1541 * never returns UNDECIDED, so we will execute only one iteration in
1542 * this case.
1544 for (end = path + strlen(path);
1545 end > path && match == UNDECIDED;
1546 end = slash) {
1548 for (slash = end - 1; slash > path && *slash != '/'; slash--)
1549 ; /* do nothing */
1551 match = path_matches_pattern_list(path, end - path,
1552 slash > path ? slash + 1 : path, &dtype,
1553 istate->sparse_checkout_patterns, istate);
1555 /* We are going to match the parent dir now */
1556 dtype = DT_DIR;
1558 return match > 0;
1561 int path_in_sparse_checkout(const char *path,
1562 struct index_state *istate)
1564 return path_in_sparse_checkout_1(path, istate, 0);
1567 int path_in_cone_mode_sparse_checkout(const char *path,
1568 struct index_state *istate)
1570 return path_in_sparse_checkout_1(path, istate, 1);
1573 static struct path_pattern *last_matching_pattern_from_lists(
1574 struct dir_struct *dir, struct index_state *istate,
1575 const char *pathname, int pathlen,
1576 const char *basename, int *dtype_p)
1578 int i, j;
1579 struct exclude_list_group *group;
1580 struct path_pattern *pattern;
1581 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
1582 group = &dir->internal.exclude_list_group[i];
1583 for (j = group->nr - 1; j >= 0; j--) {
1584 pattern = last_matching_pattern_from_list(
1585 pathname, pathlen, basename, dtype_p,
1586 &group->pl[j], istate);
1587 if (pattern)
1588 return pattern;
1591 return NULL;
1595 * Loads the per-directory exclude list for the substring of base
1596 * which has a char length of baselen.
1598 static void prep_exclude(struct dir_struct *dir,
1599 struct index_state *istate,
1600 const char *base, int baselen)
1602 struct exclude_list_group *group;
1603 struct pattern_list *pl;
1604 struct exclude_stack *stk = NULL;
1605 struct untracked_cache_dir *untracked;
1606 int current;
1608 group = &dir->internal.exclude_list_group[EXC_DIRS];
1611 * Pop the exclude lists from the EXCL_DIRS exclude_list_group
1612 * which originate from directories not in the prefix of the
1613 * path being checked.
1615 while ((stk = dir->internal.exclude_stack) != NULL) {
1616 if (stk->baselen <= baselen &&
1617 !strncmp(dir->internal.basebuf.buf, base, stk->baselen))
1618 break;
1619 pl = &group->pl[dir->internal.exclude_stack->exclude_ix];
1620 dir->internal.exclude_stack = stk->prev;
1621 dir->internal.pattern = NULL;
1622 free((char *)pl->src); /* see strbuf_detach() below */
1623 clear_pattern_list(pl);
1624 free(stk);
1625 group->nr--;
1628 /* Skip traversing into sub directories if the parent is excluded */
1629 if (dir->internal.pattern)
1630 return;
1633 * Lazy initialization. All call sites currently just
1634 * memset(dir, 0, sizeof(*dir)) before use. Changing all of
1635 * them seems lots of work for little benefit.
1637 if (!dir->internal.basebuf.buf)
1638 strbuf_init(&dir->internal.basebuf, PATH_MAX);
1640 /* Read from the parent directories and push them down. */
1641 current = stk ? stk->baselen : -1;
1642 strbuf_setlen(&dir->internal.basebuf, current < 0 ? 0 : current);
1643 if (dir->untracked)
1644 untracked = stk ? stk->ucd : dir->untracked->root;
1645 else
1646 untracked = NULL;
1648 while (current < baselen) {
1649 const char *cp;
1650 struct oid_stat oid_stat;
1652 CALLOC_ARRAY(stk, 1);
1653 if (current < 0) {
1654 cp = base;
1655 current = 0;
1656 } else {
1657 cp = strchr(base + current + 1, '/');
1658 if (!cp)
1659 die("oops in prep_exclude");
1660 cp++;
1661 untracked =
1662 lookup_untracked(dir->untracked,
1663 untracked,
1664 base + current,
1665 cp - base - current);
1667 stk->prev = dir->internal.exclude_stack;
1668 stk->baselen = cp - base;
1669 stk->exclude_ix = group->nr;
1670 stk->ucd = untracked;
1671 pl = add_pattern_list(dir, EXC_DIRS, NULL);
1672 strbuf_add(&dir->internal.basebuf, base + current, stk->baselen - current);
1673 assert(stk->baselen == dir->internal.basebuf.len);
1675 /* Abort if the directory is excluded */
1676 if (stk->baselen) {
1677 int dt = DT_DIR;
1678 dir->internal.basebuf.buf[stk->baselen - 1] = 0;
1679 dir->internal.pattern = last_matching_pattern_from_lists(dir,
1680 istate,
1681 dir->internal.basebuf.buf, stk->baselen - 1,
1682 dir->internal.basebuf.buf + current, &dt);
1683 dir->internal.basebuf.buf[stk->baselen - 1] = '/';
1684 if (dir->internal.pattern &&
1685 dir->internal.pattern->flags & PATTERN_FLAG_NEGATIVE)
1686 dir->internal.pattern = NULL;
1687 if (dir->internal.pattern) {
1688 dir->internal.exclude_stack = stk;
1689 return;
1693 /* Try to read per-directory file */
1694 oidclr(&oid_stat.oid, the_repository->hash_algo);
1695 oid_stat.valid = 0;
1696 if (dir->exclude_per_dir &&
1698 * If we know that no files have been added in
1699 * this directory (i.e. valid_cached_dir() has
1700 * been executed and set untracked->valid) ..
1702 (!untracked || !untracked->valid ||
1704 * .. and .gitignore does not exist before
1705 * (i.e. null exclude_oid). Then we can skip
1706 * loading .gitignore, which would result in
1707 * ENOENT anyway.
1709 !is_null_oid(&untracked->exclude_oid))) {
1711 * dir->internal.basebuf gets reused by the traversal,
1712 * but we need fname to remain unchanged to ensure the
1713 * src member of each struct path_pattern correctly
1714 * back-references its source file. Other invocations
1715 * of add_pattern_list provide stable strings, so we
1716 * strbuf_detach() and free() here in the caller.
1718 struct strbuf sb = STRBUF_INIT;
1719 strbuf_addbuf(&sb, &dir->internal.basebuf);
1720 strbuf_addstr(&sb, dir->exclude_per_dir);
1721 pl->src = strbuf_detach(&sb, NULL);
1722 add_patterns(pl->src, pl->src, stk->baselen, pl, istate,
1723 PATTERN_NOFOLLOW,
1724 untracked ? &oid_stat : NULL);
1727 * NEEDSWORK: when untracked cache is enabled, prep_exclude()
1728 * will first be called in valid_cached_dir() then maybe many
1729 * times more in last_matching_pattern(). When the cache is
1730 * used, last_matching_pattern() will not be called and
1731 * reading .gitignore content will be a waste.
1733 * So when it's called by valid_cached_dir() and we can get
1734 * .gitignore SHA-1 from the index (i.e. .gitignore is not
1735 * modified on work tree), we could delay reading the
1736 * .gitignore content until we absolutely need it in
1737 * last_matching_pattern(). Be careful about ignore rule
1738 * order, though, if you do that.
1740 if (untracked &&
1741 !oideq(&oid_stat.oid, &untracked->exclude_oid)) {
1742 invalidate_gitignore(dir->untracked, untracked);
1743 oidcpy(&untracked->exclude_oid, &oid_stat.oid);
1745 dir->internal.exclude_stack = stk;
1746 current = stk->baselen;
1748 strbuf_setlen(&dir->internal.basebuf, baselen);
1752 * Loads the exclude lists for the directory containing pathname, then
1753 * scans all exclude lists to determine whether pathname is excluded.
1754 * Returns the exclude_list element which matched, or NULL for
1755 * undecided.
1757 struct path_pattern *last_matching_pattern(struct dir_struct *dir,
1758 struct index_state *istate,
1759 const char *pathname,
1760 int *dtype_p)
1762 int pathlen = strlen(pathname);
1763 const char *basename = strrchr(pathname, '/');
1764 basename = (basename) ? basename+1 : pathname;
1766 prep_exclude(dir, istate, pathname, basename-pathname);
1768 if (dir->internal.pattern)
1769 return dir->internal.pattern;
1771 return last_matching_pattern_from_lists(dir, istate, pathname, pathlen,
1772 basename, dtype_p);
1776 * Loads the exclude lists for the directory containing pathname, then
1777 * scans all exclude lists to determine whether pathname is excluded.
1778 * Returns 1 if true, otherwise 0.
1780 int is_excluded(struct dir_struct *dir, struct index_state *istate,
1781 const char *pathname, int *dtype_p)
1783 struct path_pattern *pattern =
1784 last_matching_pattern(dir, istate, pathname, dtype_p);
1785 if (pattern)
1786 return pattern->flags & PATTERN_FLAG_NEGATIVE ? 0 : 1;
1787 return 0;
1790 static struct dir_entry *dir_entry_new(const char *pathname, int len)
1792 struct dir_entry *ent;
1794 FLEX_ALLOC_MEM(ent, name, pathname, len);
1795 ent->len = len;
1796 return ent;
1799 static struct dir_entry *dir_add_name(struct dir_struct *dir,
1800 struct index_state *istate,
1801 const char *pathname, int len)
1803 if (index_file_exists(istate, pathname, len, ignore_case))
1804 return NULL;
1806 ALLOC_GROW(dir->entries, dir->nr+1, dir->internal.alloc);
1807 return dir->entries[dir->nr++] = dir_entry_new(pathname, len);
1810 struct dir_entry *dir_add_ignored(struct dir_struct *dir,
1811 struct index_state *istate,
1812 const char *pathname, int len)
1814 if (!index_name_is_other(istate, pathname, len))
1815 return NULL;
1817 ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->internal.ignored_alloc);
1818 return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);
1821 enum exist_status {
1822 index_nonexistent = 0,
1823 index_directory,
1824 index_gitdir
1828 * Do not use the alphabetically sorted index to look up
1829 * the directory name; instead, use the case insensitive
1830 * directory hash.
1832 static enum exist_status directory_exists_in_index_icase(struct index_state *istate,
1833 const char *dirname, int len)
1835 struct cache_entry *ce;
1837 if (index_dir_exists(istate, dirname, len))
1838 return index_directory;
1840 ce = index_file_exists(istate, dirname, len, ignore_case);
1841 if (ce && S_ISGITLINK(ce->ce_mode))
1842 return index_gitdir;
1844 return index_nonexistent;
1848 * The index sorts alphabetically by entry name, which
1849 * means that a gitlink sorts as '\0' at the end, while
1850 * a directory (which is defined not as an entry, but as
1851 * the files it contains) will sort with the '/' at the
1852 * end.
1854 static enum exist_status directory_exists_in_index(struct index_state *istate,
1855 const char *dirname, int len)
1857 int pos;
1859 if (ignore_case)
1860 return directory_exists_in_index_icase(istate, dirname, len);
1862 pos = index_name_pos(istate, dirname, len);
1863 if (pos < 0)
1864 pos = -pos-1;
1865 while (pos < istate->cache_nr) {
1866 const struct cache_entry *ce = istate->cache[pos++];
1867 unsigned char endchar;
1869 if (strncmp(ce->name, dirname, len))
1870 break;
1871 endchar = ce->name[len];
1872 if (endchar > '/')
1873 break;
1874 if (endchar == '/')
1875 return index_directory;
1876 if (!endchar && S_ISGITLINK(ce->ce_mode))
1877 return index_gitdir;
1879 return index_nonexistent;
1883 * When we find a directory when traversing the filesystem, we
1884 * have three distinct cases:
1886 * - ignore it
1887 * - see it as a directory
1888 * - recurse into it
1890 * and which one we choose depends on a combination of existing
1891 * git index contents and the flags passed into the directory
1892 * traversal routine.
1894 * Case 1: If we *already* have entries in the index under that
1895 * directory name, we always recurse into the directory to see
1896 * all the files.
1898 * Case 2: If we *already* have that directory name as a gitlink,
1899 * we always continue to see it as a gitlink, regardless of whether
1900 * there is an actual git directory there or not (it might not
1901 * be checked out as a subproject!)
1903 * Case 3: if we didn't have it in the index previously, we
1904 * have a few sub-cases:
1906 * (a) if DIR_SHOW_OTHER_DIRECTORIES flag is set, we show it as
1907 * just a directory, unless DIR_HIDE_EMPTY_DIRECTORIES is
1908 * also true, in which case we need to check if it contains any
1909 * untracked and / or ignored files.
1910 * (b) if it looks like a git directory and we don't have the
1911 * DIR_NO_GITLINKS flag, then we treat it as a gitlink, and
1912 * show it as a directory.
1913 * (c) otherwise, we recurse into it.
1915 static enum path_treatment treat_directory(struct dir_struct *dir,
1916 struct index_state *istate,
1917 struct untracked_cache_dir *untracked,
1918 const char *dirname, int len, int baselen, int excluded,
1919 const struct pathspec *pathspec)
1922 * WARNING: From this function, you can return path_recurse or you
1923 * can call read_directory_recursive() (or neither), but
1924 * you CAN'T DO BOTH.
1926 enum path_treatment state;
1927 int matches_how = 0;
1928 int check_only, stop_early;
1929 int old_ignored_nr, old_untracked_nr;
1930 /* The "len-1" is to strip the final '/' */
1931 enum exist_status status = directory_exists_in_index(istate, dirname, len-1);
1933 if (status == index_directory)
1934 return path_recurse;
1935 if (status == index_gitdir)
1936 return path_none;
1937 if (status != index_nonexistent)
1938 BUG("Unhandled value for directory_exists_in_index: %d\n", status);
1941 * We don't want to descend into paths that don't match the necessary
1942 * patterns. Clearly, if we don't have a pathspec, then we can't check
1943 * for matching patterns. Also, if (excluded) then we know we matched
1944 * the exclusion patterns so as an optimization we can skip checking
1945 * for matching patterns.
1947 if (pathspec && !excluded) {
1948 matches_how = match_pathspec_with_flags(istate, pathspec,
1949 dirname, len,
1950 0 /* prefix */,
1951 NULL /* seen */,
1952 DO_MATCH_LEADING_PATHSPEC);
1953 if (!matches_how)
1954 return path_none;
1958 if ((dir->flags & DIR_SKIP_NESTED_GIT) ||
1959 !(dir->flags & DIR_NO_GITLINKS)) {
1961 * Determine if `dirname` is a nested repo by confirming that:
1962 * 1) we are in a nonbare repository, and
1963 * 2) `dirname` is not an immediate parent of `the_repository->gitdir`,
1964 * which could occur if the git_dir or worktree location was
1965 * manually configured by the user; see t2205 testcases 1-3 for
1966 * examples where this matters
1968 int nested_repo;
1969 struct strbuf sb = STRBUF_INIT;
1970 strbuf_addstr(&sb, dirname);
1971 nested_repo = is_nonbare_repository_dir(&sb);
1973 if (nested_repo) {
1974 char *real_dirname, *real_gitdir;
1975 strbuf_addstr(&sb, ".git");
1976 real_dirname = real_pathdup(sb.buf, 1);
1977 real_gitdir = real_pathdup(the_repository->gitdir, 1);
1979 nested_repo = !!strcmp(real_dirname, real_gitdir);
1980 free(real_gitdir);
1981 free(real_dirname);
1983 strbuf_release(&sb);
1985 if (nested_repo) {
1986 if ((dir->flags & DIR_SKIP_NESTED_GIT) ||
1987 (matches_how == MATCHED_RECURSIVELY_LEADING_PATHSPEC))
1988 return path_none;
1989 return excluded ? path_excluded : path_untracked;
1993 if (!(dir->flags & DIR_SHOW_OTHER_DIRECTORIES)) {
1994 if (excluded &&
1995 (dir->flags & DIR_SHOW_IGNORED_TOO) &&
1996 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING)) {
1999 * This is an excluded directory and we are
2000 * showing ignored paths that match an exclude
2001 * pattern. (e.g. show directory as ignored
2002 * only if it matches an exclude pattern).
2003 * This path will either be 'path_excluded`
2004 * (if we are showing empty directories or if
2005 * the directory is not empty), or will be
2006 * 'path_none' (empty directory, and we are
2007 * not showing empty directories).
2009 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
2010 return path_excluded;
2012 if (read_directory_recursive(dir, istate, dirname, len,
2013 untracked, 1, 1, pathspec) == path_excluded)
2014 return path_excluded;
2016 return path_none;
2018 return path_recurse;
2021 assert(dir->flags & DIR_SHOW_OTHER_DIRECTORIES);
2024 * If we have a pathspec which could match something _below_ this
2025 * directory (e.g. when checking 'subdir/' having a pathspec like
2026 * 'subdir/some/deep/path/file' or 'subdir/widget-*.c'), then we
2027 * need to recurse.
2029 if (matches_how == MATCHED_RECURSIVELY_LEADING_PATHSPEC)
2030 return path_recurse;
2032 /* Special cases for where this directory is excluded/ignored */
2033 if (excluded) {
2035 * If DIR_SHOW_OTHER_DIRECTORIES is set and we're not
2036 * hiding empty directories, there is no need to
2037 * recurse into an ignored directory.
2039 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
2040 return path_excluded;
2043 * Even if we are hiding empty directories, we can still avoid
2044 * recursing into ignored directories for DIR_SHOW_IGNORED_TOO
2045 * if DIR_SHOW_IGNORED_TOO_MODE_MATCHING is also set.
2047 if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
2048 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING))
2049 return path_excluded;
2053 * Other than the path_recurse case above, we only need to
2054 * recurse into untracked directories if any of the following
2055 * bits is set:
2056 * - DIR_SHOW_IGNORED (because then we need to determine if
2057 * there are ignored entries below)
2058 * - DIR_SHOW_IGNORED_TOO (same as above)
2059 * - DIR_HIDE_EMPTY_DIRECTORIES (because we have to determine if
2060 * the directory is empty)
2062 if (!excluded &&
2063 !(dir->flags & (DIR_SHOW_IGNORED |
2064 DIR_SHOW_IGNORED_TOO |
2065 DIR_HIDE_EMPTY_DIRECTORIES))) {
2066 return path_untracked;
2070 * Even if we don't want to know all the paths under an untracked or
2071 * ignored directory, we may still need to go into the directory to
2072 * determine if it is empty (because with DIR_HIDE_EMPTY_DIRECTORIES,
2073 * an empty directory should be path_none instead of path_excluded or
2074 * path_untracked).
2076 check_only = ((dir->flags & DIR_HIDE_EMPTY_DIRECTORIES) &&
2077 !(dir->flags & DIR_SHOW_IGNORED_TOO));
2080 * However, there's another optimization possible as a subset of
2081 * check_only, based on the cases we have to consider:
2082 * A) Directory matches no exclude patterns:
2083 * * Directory is empty => path_none
2084 * * Directory has an untracked file under it => path_untracked
2085 * * Directory has only ignored files under it => path_excluded
2086 * B) Directory matches an exclude pattern:
2087 * * Directory is empty => path_none
2088 * * Directory has an untracked file under it => path_excluded
2089 * * Directory has only ignored files under it => path_excluded
2090 * In case A, we can exit as soon as we've found an untracked
2091 * file but otherwise have to walk all files. In case B, though,
2092 * we can stop at the first file we find under the directory.
2094 stop_early = check_only && excluded;
2097 * If /every/ file within an untracked directory is ignored, then
2098 * we want to treat the directory as ignored (for e.g. status
2099 * --porcelain), without listing the individual ignored files
2100 * underneath. To do so, we'll save the current ignored_nr, and
2101 * pop all the ones added after it if it turns out the entire
2102 * directory is ignored. Also, when DIR_SHOW_IGNORED_TOO and
2103 * !DIR_KEEP_UNTRACKED_CONTENTS then we don't want to show
2104 * untracked paths so will need to pop all those off the last
2105 * after we traverse.
2107 old_ignored_nr = dir->ignored_nr;
2108 old_untracked_nr = dir->nr;
2110 /* Actually recurse into dirname now, we'll fixup the state later. */
2111 untracked = lookup_untracked(dir->untracked, untracked,
2112 dirname + baselen, len - baselen);
2113 state = read_directory_recursive(dir, istate, dirname, len, untracked,
2114 check_only, stop_early, pathspec);
2116 /* There are a variety of reasons we may need to fixup the state... */
2117 if (state == path_excluded) {
2118 /* state == path_excluded implies all paths under
2119 * dirname were ignored...
2121 * if running e.g. `git status --porcelain --ignored=matching`,
2122 * then we want to see the subpaths that are ignored.
2124 * if running e.g. just `git status --porcelain`, then
2125 * we just want the directory itself to be listed as ignored
2126 * and not the individual paths underneath.
2128 int want_ignored_subpaths =
2129 ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
2130 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING));
2132 if (want_ignored_subpaths) {
2134 * with --ignored=matching, we want the subpaths
2135 * INSTEAD of the directory itself.
2137 state = path_none;
2138 } else {
2139 for (int i = old_ignored_nr; i < dir->ignored_nr; i++)
2140 FREE_AND_NULL(dir->ignored[i]);
2141 dir->ignored_nr = old_ignored_nr;
2146 * We may need to ignore some of the untracked paths we found while
2147 * traversing subdirectories.
2149 if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
2150 !(dir->flags & DIR_KEEP_UNTRACKED_CONTENTS)) {
2151 for (int i = old_untracked_nr; i < dir->nr; i++)
2152 FREE_AND_NULL(dir->entries[i]);
2153 dir->nr = old_untracked_nr;
2157 * If there is nothing under the current directory and we are not
2158 * hiding empty directories, then we need to report on the
2159 * untracked or ignored status of the directory itself.
2161 if (state == path_none && !(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
2162 state = excluded ? path_excluded : path_untracked;
2164 return state;
2168 * This is an inexact early pruning of any recursive directory
2169 * reading - if the path cannot possibly be in the pathspec,
2170 * return true, and we'll skip it early.
2172 static int simplify_away(const char *path, int pathlen,
2173 const struct pathspec *pathspec)
2175 int i;
2177 if (!pathspec || !pathspec->nr)
2178 return 0;
2180 GUARD_PATHSPEC(pathspec,
2181 PATHSPEC_FROMTOP |
2182 PATHSPEC_MAXDEPTH |
2183 PATHSPEC_LITERAL |
2184 PATHSPEC_GLOB |
2185 PATHSPEC_ICASE |
2186 PATHSPEC_EXCLUDE |
2187 PATHSPEC_ATTR);
2189 for (i = 0; i < pathspec->nr; i++) {
2190 const struct pathspec_item *item = &pathspec->items[i];
2191 int len = item->nowildcard_len;
2193 if (len > pathlen)
2194 len = pathlen;
2195 if (!ps_strncmp(item, item->match, path, len))
2196 return 0;
2199 return 1;
2203 * This function tells us whether an excluded path matches a
2204 * list of "interesting" pathspecs. That is, whether a path matched
2205 * by any of the pathspecs could possibly be ignored by excluding
2206 * the specified path. This can happen if:
2208 * 1. the path is mentioned explicitly in the pathspec
2210 * 2. the path is a directory prefix of some element in the
2211 * pathspec
2213 static int exclude_matches_pathspec(const char *path, int pathlen,
2214 const struct pathspec *pathspec)
2216 int i;
2218 if (!pathspec || !pathspec->nr)
2219 return 0;
2221 GUARD_PATHSPEC(pathspec,
2222 PATHSPEC_FROMTOP |
2223 PATHSPEC_MAXDEPTH |
2224 PATHSPEC_LITERAL |
2225 PATHSPEC_GLOB |
2226 PATHSPEC_ICASE |
2227 PATHSPEC_EXCLUDE |
2228 PATHSPEC_ATTR);
2230 for (i = 0; i < pathspec->nr; i++) {
2231 const struct pathspec_item *item = &pathspec->items[i];
2232 int len = item->nowildcard_len;
2234 if (len == pathlen &&
2235 !ps_strncmp(item, item->match, path, pathlen))
2236 return 1;
2237 if (len > pathlen &&
2238 item->match[pathlen] == '/' &&
2239 !ps_strncmp(item, item->match, path, pathlen))
2240 return 1;
2242 return 0;
2245 static int get_index_dtype(struct index_state *istate,
2246 const char *path, int len)
2248 int pos;
2249 const struct cache_entry *ce;
2251 ce = index_file_exists(istate, path, len, 0);
2252 if (ce) {
2253 if (!ce_uptodate(ce))
2254 return DT_UNKNOWN;
2255 if (S_ISGITLINK(ce->ce_mode))
2256 return DT_DIR;
2258 * Nobody actually cares about the
2259 * difference between DT_LNK and DT_REG
2261 return DT_REG;
2264 /* Try to look it up as a directory */
2265 pos = index_name_pos(istate, path, len);
2266 if (pos >= 0)
2267 return DT_UNKNOWN;
2268 pos = -pos-1;
2269 while (pos < istate->cache_nr) {
2270 ce = istate->cache[pos++];
2271 if (strncmp(ce->name, path, len))
2272 break;
2273 if (ce->name[len] > '/')
2274 break;
2275 if (ce->name[len] < '/')
2276 continue;
2277 if (!ce_uptodate(ce))
2278 break; /* continue? */
2279 return DT_DIR;
2281 return DT_UNKNOWN;
2284 unsigned char get_dtype(struct dirent *e, struct strbuf *path,
2285 int follow_symlink)
2287 struct stat st;
2288 unsigned char dtype = DTYPE(e);
2289 size_t base_path_len;
2291 if (dtype != DT_UNKNOWN && !(follow_symlink && dtype == DT_LNK))
2292 return dtype;
2295 * d_type unknown or unfollowed symlink, try to fall back on [l]stat
2296 * results. If [l]stat fails, explicitly set DT_UNKNOWN.
2298 base_path_len = path->len;
2299 strbuf_addstr(path, e->d_name);
2300 if ((follow_symlink && stat(path->buf, &st)) ||
2301 (!follow_symlink && lstat(path->buf, &st)))
2302 goto cleanup;
2304 /* determine d_type from st_mode */
2305 if (S_ISREG(st.st_mode))
2306 dtype = DT_REG;
2307 else if (S_ISDIR(st.st_mode))
2308 dtype = DT_DIR;
2309 else if (S_ISLNK(st.st_mode))
2310 dtype = DT_LNK;
2312 cleanup:
2313 strbuf_setlen(path, base_path_len);
2314 return dtype;
2317 static int resolve_dtype(int dtype, struct index_state *istate,
2318 const char *path, int len)
2320 struct stat st;
2322 if (dtype != DT_UNKNOWN)
2323 return dtype;
2324 dtype = get_index_dtype(istate, path, len);
2325 if (dtype != DT_UNKNOWN)
2326 return dtype;
2327 if (lstat(path, &st))
2328 return dtype;
2329 if (S_ISREG(st.st_mode))
2330 return DT_REG;
2331 if (S_ISDIR(st.st_mode))
2332 return DT_DIR;
2333 if (S_ISLNK(st.st_mode))
2334 return DT_LNK;
2335 return dtype;
2338 static enum path_treatment treat_path_fast(struct dir_struct *dir,
2339 struct cached_dir *cdir,
2340 struct index_state *istate,
2341 struct strbuf *path,
2342 int baselen,
2343 const struct pathspec *pathspec)
2346 * WARNING: From this function, you can return path_recurse or you
2347 * can call read_directory_recursive() (or neither), but
2348 * you CAN'T DO BOTH.
2350 strbuf_setlen(path, baselen);
2351 if (!cdir->ucd) {
2352 strbuf_addstr(path, cdir->file);
2353 return path_untracked;
2355 strbuf_addstr(path, cdir->ucd->name);
2356 /* treat_one_path() does this before it calls treat_directory() */
2357 strbuf_complete(path, '/');
2358 if (cdir->ucd->check_only)
2360 * check_only is set as a result of treat_directory() getting
2361 * to its bottom. Verify again the same set of directories
2362 * with check_only set.
2364 return read_directory_recursive(dir, istate, path->buf, path->len,
2365 cdir->ucd, 1, 0, pathspec);
2367 * We get path_recurse in the first run when
2368 * directory_exists_in_index() returns index_nonexistent. We
2369 * are sure that new changes in the index does not impact the
2370 * outcome. Return now.
2372 return path_recurse;
2375 static enum path_treatment treat_path(struct dir_struct *dir,
2376 struct untracked_cache_dir *untracked,
2377 struct cached_dir *cdir,
2378 struct index_state *istate,
2379 struct strbuf *path,
2380 int baselen,
2381 const struct pathspec *pathspec)
2383 int has_path_in_index, dtype, excluded;
2385 if (!cdir->d_name)
2386 return treat_path_fast(dir, cdir, istate, path,
2387 baselen, pathspec);
2388 if (is_dot_or_dotdot(cdir->d_name) || !fspathcmp(cdir->d_name, ".git"))
2389 return path_none;
2390 strbuf_setlen(path, baselen);
2391 strbuf_addstr(path, cdir->d_name);
2392 if (simplify_away(path->buf, path->len, pathspec))
2393 return path_none;
2395 dtype = resolve_dtype(cdir->d_type, istate, path->buf, path->len);
2397 /* Always exclude indexed files */
2398 has_path_in_index = !!index_file_exists(istate, path->buf, path->len,
2399 ignore_case);
2400 if (dtype != DT_DIR && has_path_in_index)
2401 return path_none;
2404 * When we are looking at a directory P in the working tree,
2405 * there are three cases:
2407 * (1) P exists in the index. Everything inside the directory P in
2408 * the working tree needs to go when P is checked out from the
2409 * index.
2411 * (2) P does not exist in the index, but there is P/Q in the index.
2412 * We know P will stay a directory when we check out the contents
2413 * of the index, but we do not know yet if there is a directory
2414 * P/Q in the working tree to be killed, so we need to recurse.
2416 * (3) P does not exist in the index, and there is no P/Q in the index
2417 * to require P to be a directory, either. Only in this case, we
2418 * know that everything inside P will not be killed without
2419 * recursing.
2421 if ((dir->flags & DIR_COLLECT_KILLED_ONLY) &&
2422 (dtype == DT_DIR) &&
2423 !has_path_in_index &&
2424 (directory_exists_in_index(istate, path->buf, path->len) == index_nonexistent))
2425 return path_none;
2427 excluded = is_excluded(dir, istate, path->buf, &dtype);
2430 * Excluded? If we don't explicitly want to show
2431 * ignored files, ignore it
2433 if (excluded && !(dir->flags & (DIR_SHOW_IGNORED|DIR_SHOW_IGNORED_TOO)))
2434 return path_excluded;
2436 switch (dtype) {
2437 default:
2438 return path_none;
2439 case DT_DIR:
2441 * WARNING: Do not ignore/amend the return value from
2442 * treat_directory(), and especially do not change it to return
2443 * path_recurse as that can cause exponential slowdown.
2444 * Instead, modify treat_directory() to return the right value.
2446 strbuf_addch(path, '/');
2447 return treat_directory(dir, istate, untracked,
2448 path->buf, path->len,
2449 baselen, excluded, pathspec);
2450 case DT_REG:
2451 case DT_LNK:
2452 if (pathspec &&
2453 !match_pathspec(istate, pathspec, path->buf, path->len,
2454 0 /* prefix */, NULL /* seen */,
2455 0 /* is_dir */))
2456 return path_none;
2457 if (excluded)
2458 return path_excluded;
2459 return path_untracked;
2463 static void add_untracked(struct untracked_cache_dir *dir, const char *name)
2465 if (!dir)
2466 return;
2467 ALLOC_GROW(dir->untracked, dir->untracked_nr + 1,
2468 dir->untracked_alloc);
2469 dir->untracked[dir->untracked_nr++] = xstrdup(name);
2472 static int valid_cached_dir(struct dir_struct *dir,
2473 struct untracked_cache_dir *untracked,
2474 struct index_state *istate,
2475 struct strbuf *path,
2476 int check_only)
2478 struct stat st;
2480 if (!untracked)
2481 return 0;
2484 * With fsmonitor, we can trust the untracked cache's valid field.
2486 refresh_fsmonitor(istate);
2487 if (!(dir->untracked->use_fsmonitor && untracked->valid)) {
2488 if (lstat(path->len ? path->buf : ".", &st)) {
2489 memset(&untracked->stat_data, 0, sizeof(untracked->stat_data));
2490 return 0;
2492 if (!untracked->valid ||
2493 match_stat_data_racy(istate, &untracked->stat_data, &st)) {
2494 fill_stat_data(&untracked->stat_data, &st);
2495 return 0;
2499 if (untracked->check_only != !!check_only)
2500 return 0;
2503 * prep_exclude will be called eventually on this directory,
2504 * but it's called much later in last_matching_pattern(). We
2505 * need it now to determine the validity of the cache for this
2506 * path. The next calls will be nearly no-op, the way
2507 * prep_exclude() is designed.
2509 if (path->len && path->buf[path->len - 1] != '/') {
2510 strbuf_addch(path, '/');
2511 prep_exclude(dir, istate, path->buf, path->len);
2512 strbuf_setlen(path, path->len - 1);
2513 } else
2514 prep_exclude(dir, istate, path->buf, path->len);
2516 /* hopefully prep_exclude() haven't invalidated this entry... */
2517 return untracked->valid;
2520 static int open_cached_dir(struct cached_dir *cdir,
2521 struct dir_struct *dir,
2522 struct untracked_cache_dir *untracked,
2523 struct index_state *istate,
2524 struct strbuf *path,
2525 int check_only)
2527 const char *c_path;
2529 memset(cdir, 0, sizeof(*cdir));
2530 cdir->untracked = untracked;
2531 if (valid_cached_dir(dir, untracked, istate, path, check_only))
2532 return 0;
2533 c_path = path->len ? path->buf : ".";
2534 cdir->fdir = opendir(c_path);
2535 if (!cdir->fdir)
2536 warning_errno(_("could not open directory '%s'"), c_path);
2537 if (dir->untracked) {
2538 invalidate_directory(dir->untracked, untracked);
2539 dir->untracked->dir_opened++;
2541 if (!cdir->fdir)
2542 return -1;
2543 return 0;
2546 static int read_cached_dir(struct cached_dir *cdir)
2548 struct dirent *de;
2550 if (cdir->fdir) {
2551 de = readdir_skip_dot_and_dotdot(cdir->fdir);
2552 if (!de) {
2553 cdir->d_name = NULL;
2554 cdir->d_type = DT_UNKNOWN;
2555 return -1;
2557 cdir->d_name = de->d_name;
2558 cdir->d_type = DTYPE(de);
2559 return 0;
2561 while (cdir->nr_dirs < cdir->untracked->dirs_nr) {
2562 struct untracked_cache_dir *d = cdir->untracked->dirs[cdir->nr_dirs];
2563 if (!d->recurse) {
2564 cdir->nr_dirs++;
2565 continue;
2567 cdir->ucd = d;
2568 cdir->nr_dirs++;
2569 return 0;
2571 cdir->ucd = NULL;
2572 if (cdir->nr_files < cdir->untracked->untracked_nr) {
2573 struct untracked_cache_dir *d = cdir->untracked;
2574 cdir->file = d->untracked[cdir->nr_files++];
2575 return 0;
2577 return -1;
2580 static void close_cached_dir(struct cached_dir *cdir)
2582 if (cdir->fdir)
2583 closedir(cdir->fdir);
2585 * We have gone through this directory and found no untracked
2586 * entries. Mark it valid.
2588 if (cdir->untracked) {
2589 cdir->untracked->valid = 1;
2590 cdir->untracked->recurse = 1;
2594 static void add_path_to_appropriate_result_list(struct dir_struct *dir,
2595 struct untracked_cache_dir *untracked,
2596 struct cached_dir *cdir,
2597 struct index_state *istate,
2598 struct strbuf *path,
2599 int baselen,
2600 const struct pathspec *pathspec,
2601 enum path_treatment state)
2603 /* add the path to the appropriate result list */
2604 switch (state) {
2605 case path_excluded:
2606 if (dir->flags & DIR_SHOW_IGNORED)
2607 dir_add_name(dir, istate, path->buf, path->len);
2608 else if ((dir->flags & DIR_SHOW_IGNORED_TOO) ||
2609 ((dir->flags & DIR_COLLECT_IGNORED) &&
2610 exclude_matches_pathspec(path->buf, path->len,
2611 pathspec)))
2612 dir_add_ignored(dir, istate, path->buf, path->len);
2613 break;
2615 case path_untracked:
2616 if (dir->flags & DIR_SHOW_IGNORED)
2617 break;
2618 dir_add_name(dir, istate, path->buf, path->len);
2619 if (cdir->fdir)
2620 add_untracked(untracked, path->buf + baselen);
2621 break;
2623 default:
2624 break;
2629 * Read a directory tree. We currently ignore anything but
2630 * directories, regular files and symlinks. That's because git
2631 * doesn't handle them at all yet. Maybe that will change some
2632 * day.
2634 * Also, we ignore the name ".git" (even if it is not a directory).
2635 * That likely will not change.
2637 * If 'stop_at_first_file' is specified, 'path_excluded' is returned
2638 * to signal that a file was found. This is the least significant value that
2639 * indicates that a file was encountered that does not depend on the order of
2640 * whether an untracked or excluded path was encountered first.
2642 * Returns the most significant path_treatment value encountered in the scan.
2643 * If 'stop_at_first_file' is specified, `path_excluded` is the most
2644 * significant path_treatment value that will be returned.
2647 static enum path_treatment read_directory_recursive(struct dir_struct *dir,
2648 struct index_state *istate, const char *base, int baselen,
2649 struct untracked_cache_dir *untracked, int check_only,
2650 int stop_at_first_file, const struct pathspec *pathspec)
2653 * WARNING: Do NOT recurse unless path_recurse is returned from
2654 * treat_path(). Recursing on any other return value
2655 * can result in exponential slowdown.
2657 struct cached_dir cdir;
2658 enum path_treatment state, subdir_state, dir_state = path_none;
2659 struct strbuf path = STRBUF_INIT;
2661 strbuf_add(&path, base, baselen);
2663 if (open_cached_dir(&cdir, dir, untracked, istate, &path, check_only))
2664 goto out;
2665 dir->internal.visited_directories++;
2667 if (untracked)
2668 untracked->check_only = !!check_only;
2670 while (!read_cached_dir(&cdir)) {
2671 /* check how the file or directory should be treated */
2672 state = treat_path(dir, untracked, &cdir, istate, &path,
2673 baselen, pathspec);
2674 dir->internal.visited_paths++;
2676 if (state > dir_state)
2677 dir_state = state;
2679 /* recurse into subdir if instructed by treat_path */
2680 if (state == path_recurse) {
2681 struct untracked_cache_dir *ud;
2682 ud = lookup_untracked(dir->untracked,
2683 untracked,
2684 path.buf + baselen,
2685 path.len - baselen);
2686 subdir_state =
2687 read_directory_recursive(dir, istate, path.buf,
2688 path.len, ud,
2689 check_only, stop_at_first_file, pathspec);
2690 if (subdir_state > dir_state)
2691 dir_state = subdir_state;
2693 if (pathspec &&
2694 !match_pathspec(istate, pathspec, path.buf, path.len,
2695 0 /* prefix */, NULL,
2696 0 /* do NOT special case dirs */))
2697 state = path_none;
2700 if (check_only) {
2701 if (stop_at_first_file) {
2703 * If stopping at first file, then
2704 * signal that a file was found by
2705 * returning `path_excluded`. This is
2706 * to return a consistent value
2707 * regardless of whether an ignored or
2708 * excluded file happened to be
2709 * encountered 1st.
2711 * In current usage, the
2712 * `stop_at_first_file` is passed when
2713 * an ancestor directory has matched
2714 * an exclude pattern, so any found
2715 * files will be excluded.
2717 if (dir_state >= path_excluded) {
2718 dir_state = path_excluded;
2719 break;
2723 /* abort early if maximum state has been reached */
2724 if (dir_state == path_untracked) {
2725 if (cdir.fdir)
2726 add_untracked(untracked, path.buf + baselen);
2727 break;
2729 /* skip the add_path_to_appropriate_result_list() */
2730 continue;
2733 add_path_to_appropriate_result_list(dir, untracked, &cdir,
2734 istate, &path, baselen,
2735 pathspec, state);
2737 close_cached_dir(&cdir);
2738 out:
2739 strbuf_release(&path);
2741 return dir_state;
2744 int cmp_dir_entry(const void *p1, const void *p2)
2746 const struct dir_entry *e1 = *(const struct dir_entry **)p1;
2747 const struct dir_entry *e2 = *(const struct dir_entry **)p2;
2749 return name_compare(e1->name, e1->len, e2->name, e2->len);
2752 /* check if *out lexically strictly contains *in */
2753 int check_dir_entry_contains(const struct dir_entry *out, const struct dir_entry *in)
2755 return (out->len < in->len) &&
2756 (out->name[out->len - 1] == '/') &&
2757 !memcmp(out->name, in->name, out->len);
2760 static int treat_leading_path(struct dir_struct *dir,
2761 struct index_state *istate,
2762 const char *path, int len,
2763 const struct pathspec *pathspec)
2765 struct strbuf sb = STRBUF_INIT;
2766 struct strbuf subdir = STRBUF_INIT;
2767 int prevlen, baselen;
2768 const char *cp;
2769 struct cached_dir cdir;
2770 enum path_treatment state = path_none;
2773 * For each directory component of path, we are going to check whether
2774 * that path is relevant given the pathspec. For example, if path is
2775 * foo/bar/baz/
2776 * then we will ask treat_path() whether we should go into foo, then
2777 * whether we should go into bar, then whether baz is relevant.
2778 * Checking each is important because e.g. if path is
2779 * .git/info/
2780 * then we need to check .git to know we shouldn't traverse it.
2781 * If the return from treat_path() is:
2782 * * path_none, for any path, we return false.
2783 * * path_recurse, for all path components, we return true
2784 * * <anything else> for some intermediate component, we make sure
2785 * to add that path to the relevant list but return false
2786 * signifying that we shouldn't recurse into it.
2789 while (len && path[len - 1] == '/')
2790 len--;
2791 if (!len)
2792 return 1;
2794 memset(&cdir, 0, sizeof(cdir));
2795 cdir.d_type = DT_DIR;
2796 baselen = 0;
2797 prevlen = 0;
2798 while (1) {
2799 prevlen = baselen + !!baselen;
2800 cp = path + prevlen;
2801 cp = memchr(cp, '/', path + len - cp);
2802 if (!cp)
2803 baselen = len;
2804 else
2805 baselen = cp - path;
2806 strbuf_reset(&sb);
2807 strbuf_add(&sb, path, baselen);
2808 if (!is_directory(sb.buf))
2809 break;
2810 strbuf_reset(&sb);
2811 strbuf_add(&sb, path, prevlen);
2812 strbuf_reset(&subdir);
2813 strbuf_add(&subdir, path+prevlen, baselen-prevlen);
2814 cdir.d_name = subdir.buf;
2815 state = treat_path(dir, NULL, &cdir, istate, &sb, prevlen, pathspec);
2817 if (state != path_recurse)
2818 break; /* do not recurse into it */
2819 if (len <= baselen)
2820 break; /* finished checking */
2822 add_path_to_appropriate_result_list(dir, NULL, &cdir, istate,
2823 &sb, baselen, pathspec,
2824 state);
2826 strbuf_release(&subdir);
2827 strbuf_release(&sb);
2828 return state == path_recurse;
2831 static const char *get_ident_string(void)
2833 static struct strbuf sb = STRBUF_INIT;
2834 struct utsname uts;
2836 if (sb.len)
2837 return sb.buf;
2838 if (uname(&uts) < 0)
2839 die_errno(_("failed to get kernel name and information"));
2840 strbuf_addf(&sb, "Location %s, system %s", repo_get_work_tree(the_repository),
2841 uts.sysname);
2842 return sb.buf;
2845 static int ident_in_untracked(const struct untracked_cache *uc)
2848 * Previous git versions may have saved many NUL separated
2849 * strings in the "ident" field, but it is insane to manage
2850 * many locations, so just take care of the first one.
2853 return !strcmp(uc->ident.buf, get_ident_string());
2856 static void set_untracked_ident(struct untracked_cache *uc)
2858 strbuf_reset(&uc->ident);
2859 strbuf_addstr(&uc->ident, get_ident_string());
2862 * This strbuf used to contain a list of NUL separated
2863 * strings, so save NUL too for backward compatibility.
2865 strbuf_addch(&uc->ident, 0);
2868 static unsigned new_untracked_cache_flags(struct index_state *istate)
2870 struct repository *repo = istate->repo;
2871 char *val;
2874 * This logic is coordinated with the setting of these flags in
2875 * wt-status.c#wt_status_collect_untracked(), and the evaluation
2876 * of the config setting in commit.c#git_status_config()
2878 if (!repo_config_get_string(repo, "status.showuntrackedfiles", &val) &&
2879 !strcmp(val, "all"))
2880 return 0;
2883 * The default, if "all" is not set, is "normal" - leading us here.
2884 * If the value is "none" then it really doesn't matter.
2886 return DIR_SHOW_OTHER_DIRECTORIES | DIR_HIDE_EMPTY_DIRECTORIES;
2889 static void new_untracked_cache(struct index_state *istate, int flags)
2891 struct untracked_cache *uc = xcalloc(1, sizeof(*uc));
2892 strbuf_init(&uc->ident, 100);
2893 uc->exclude_per_dir = ".gitignore";
2894 uc->dir_flags = flags >= 0 ? flags : new_untracked_cache_flags(istate);
2895 set_untracked_ident(uc);
2896 istate->untracked = uc;
2897 istate->cache_changed |= UNTRACKED_CHANGED;
2900 void add_untracked_cache(struct index_state *istate)
2902 if (!istate->untracked) {
2903 new_untracked_cache(istate, -1);
2904 } else {
2905 if (!ident_in_untracked(istate->untracked)) {
2906 free_untracked_cache(istate->untracked);
2907 new_untracked_cache(istate, -1);
2912 void remove_untracked_cache(struct index_state *istate)
2914 if (istate->untracked) {
2915 free_untracked_cache(istate->untracked);
2916 istate->untracked = NULL;
2917 istate->cache_changed |= UNTRACKED_CHANGED;
2921 static struct untracked_cache_dir *validate_untracked_cache(struct dir_struct *dir,
2922 int base_len,
2923 const struct pathspec *pathspec,
2924 struct index_state *istate)
2926 struct untracked_cache_dir *root;
2927 static int untracked_cache_disabled = -1;
2929 if (!dir->untracked)
2930 return NULL;
2931 if (untracked_cache_disabled < 0)
2932 untracked_cache_disabled = git_env_bool("GIT_DISABLE_UNTRACKED_CACHE", 0);
2933 if (untracked_cache_disabled)
2934 return NULL;
2937 * We only support $GIT_DIR/info/exclude and core.excludesfile
2938 * as the global ignore rule files. Any other additions
2939 * (e.g. from command line) invalidate the cache. This
2940 * condition also catches running setup_standard_excludes()
2941 * before setting dir->untracked!
2943 if (dir->internal.unmanaged_exclude_files)
2944 return NULL;
2947 * Optimize for the main use case only: whole-tree git
2948 * status. More work involved in treat_leading_path() if we
2949 * use cache on just a subset of the worktree. pathspec
2950 * support could make the matter even worse.
2952 if (base_len || (pathspec && pathspec->nr))
2953 return NULL;
2955 /* We don't support collecting ignore files */
2956 if (dir->flags & (DIR_SHOW_IGNORED | DIR_SHOW_IGNORED_TOO |
2957 DIR_COLLECT_IGNORED))
2958 return NULL;
2961 * If we use .gitignore in the cache and now you change it to
2962 * .gitexclude, everything will go wrong.
2964 if (dir->exclude_per_dir != dir->untracked->exclude_per_dir &&
2965 strcmp(dir->exclude_per_dir, dir->untracked->exclude_per_dir))
2966 return NULL;
2969 * EXC_CMDL is not considered in the cache. If people set it,
2970 * skip the cache.
2972 if (dir->internal.exclude_list_group[EXC_CMDL].nr)
2973 return NULL;
2975 if (!ident_in_untracked(dir->untracked)) {
2976 warning(_("untracked cache is disabled on this system or location"));
2977 return NULL;
2981 * If the untracked structure we received does not have the same flags
2982 * as requested in this run, we're going to need to either discard the
2983 * existing structure (and potentially later recreate), or bypass the
2984 * untracked cache mechanism for this run.
2986 if (dir->flags != dir->untracked->dir_flags) {
2988 * If the untracked structure we received does not have the same flags
2989 * as configured, then we need to reset / create a new "untracked"
2990 * structure to match the new config.
2992 * Keeping the saved and used untracked cache consistent with the
2993 * configuration provides an opportunity for frequent users of
2994 * "git status -uall" to leverage the untracked cache by aligning their
2995 * configuration - setting "status.showuntrackedfiles" to "all" or
2996 * "normal" as appropriate.
2998 * Previously using -uall (or setting "status.showuntrackedfiles" to
2999 * "all") was incompatible with untracked cache and *consistently*
3000 * caused surprisingly bad performance (with fscache and fsmonitor
3001 * enabled) on Windows.
3003 * IMPROVEMENT OPPORTUNITY: If we reworked the untracked cache storage
3004 * to not be as bound up with the desired output in a given run,
3005 * and instead iterated through and stored enough information to
3006 * correctly serve both "modes", then users could get peak performance
3007 * with or without '-uall' regardless of their
3008 * "status.showuntrackedfiles" config.
3010 if (dir->untracked->dir_flags != new_untracked_cache_flags(istate)) {
3011 free_untracked_cache(istate->untracked);
3012 new_untracked_cache(istate, dir->flags);
3013 dir->untracked = istate->untracked;
3015 else {
3017 * Current untracked cache data is consistent with config, but not
3018 * usable in this request/run; just bypass untracked cache.
3020 return NULL;
3024 if (!dir->untracked->root) {
3025 /* Untracked cache existed but is not initialized; fix that */
3026 FLEX_ALLOC_STR(dir->untracked->root, name, "");
3027 istate->cache_changed |= UNTRACKED_CHANGED;
3030 /* Validate $GIT_DIR/info/exclude and core.excludesfile */
3031 root = dir->untracked->root;
3032 if (!oideq(&dir->internal.ss_info_exclude.oid,
3033 &dir->untracked->ss_info_exclude.oid)) {
3034 invalidate_gitignore(dir->untracked, root);
3035 dir->untracked->ss_info_exclude = dir->internal.ss_info_exclude;
3037 if (!oideq(&dir->internal.ss_excludes_file.oid,
3038 &dir->untracked->ss_excludes_file.oid)) {
3039 invalidate_gitignore(dir->untracked, root);
3040 dir->untracked->ss_excludes_file = dir->internal.ss_excludes_file;
3043 /* Make sure this directory is not dropped out at saving phase */
3044 root->recurse = 1;
3045 return root;
3048 static void emit_traversal_statistics(struct dir_struct *dir,
3049 struct repository *repo,
3050 const char *path,
3051 int path_len)
3053 if (!trace2_is_enabled())
3054 return;
3056 if (!path_len) {
3057 trace2_data_string("read_directory", repo, "path", "");
3058 } else {
3059 struct strbuf tmp = STRBUF_INIT;
3060 strbuf_add(&tmp, path, path_len);
3061 trace2_data_string("read_directory", repo, "path", tmp.buf);
3062 strbuf_release(&tmp);
3065 trace2_data_intmax("read_directory", repo,
3066 "directories-visited", dir->internal.visited_directories);
3067 trace2_data_intmax("read_directory", repo,
3068 "paths-visited", dir->internal.visited_paths);
3070 if (!dir->untracked)
3071 return;
3072 trace2_data_intmax("read_directory", repo,
3073 "node-creation", dir->untracked->dir_created);
3074 trace2_data_intmax("read_directory", repo,
3075 "gitignore-invalidation",
3076 dir->untracked->gitignore_invalidated);
3077 trace2_data_intmax("read_directory", repo,
3078 "directory-invalidation",
3079 dir->untracked->dir_invalidated);
3080 trace2_data_intmax("read_directory", repo,
3081 "opendir", dir->untracked->dir_opened);
3084 int read_directory(struct dir_struct *dir, struct index_state *istate,
3085 const char *path, int len, const struct pathspec *pathspec)
3087 struct untracked_cache_dir *untracked;
3089 trace2_region_enter("dir", "read_directory", istate->repo);
3090 dir->internal.visited_paths = 0;
3091 dir->internal.visited_directories = 0;
3093 if (has_symlink_leading_path(path, len)) {
3094 trace2_region_leave("dir", "read_directory", istate->repo);
3095 return dir->nr;
3098 untracked = validate_untracked_cache(dir, len, pathspec, istate);
3099 if (!untracked)
3101 * make sure untracked cache code path is disabled,
3102 * e.g. prep_exclude()
3104 dir->untracked = NULL;
3105 if (!len || treat_leading_path(dir, istate, path, len, pathspec))
3106 read_directory_recursive(dir, istate, path, len, untracked, 0, 0, pathspec);
3107 QSORT(dir->entries, dir->nr, cmp_dir_entry);
3108 QSORT(dir->ignored, dir->ignored_nr, cmp_dir_entry);
3110 emit_traversal_statistics(dir, istate->repo, path, len);
3112 trace2_region_leave("dir", "read_directory", istate->repo);
3113 if (dir->untracked) {
3114 static int force_untracked_cache = -1;
3116 if (force_untracked_cache < 0)
3117 force_untracked_cache =
3118 git_env_bool("GIT_FORCE_UNTRACKED_CACHE", -1);
3119 if (force_untracked_cache < 0)
3120 force_untracked_cache = (istate->repo->settings.core_untracked_cache == UNTRACKED_CACHE_WRITE);
3121 if (force_untracked_cache &&
3122 dir->untracked == istate->untracked &&
3123 (dir->untracked->dir_opened ||
3124 dir->untracked->gitignore_invalidated ||
3125 dir->untracked->dir_invalidated))
3126 istate->cache_changed |= UNTRACKED_CHANGED;
3127 if (dir->untracked != istate->untracked) {
3128 FREE_AND_NULL(dir->untracked);
3132 return dir->nr;
3135 int file_exists(const char *f)
3137 struct stat sb;
3138 return lstat(f, &sb) == 0;
3141 int repo_file_exists(struct repository *repo, const char *path)
3143 if (repo != the_repository)
3144 BUG("do not know how to check file existence in arbitrary repo");
3146 return file_exists(path);
3149 static int cmp_icase(char a, char b)
3151 if (a == b)
3152 return 0;
3153 if (ignore_case)
3154 return toupper(a) - toupper(b);
3155 return a - b;
3159 * Given two normalized paths (a trailing slash is ok), if subdir is
3160 * outside dir, return -1. Otherwise return the offset in subdir that
3161 * can be used as relative path to dir.
3163 int dir_inside_of(const char *subdir, const char *dir)
3165 int offset = 0;
3167 assert(dir && subdir && *dir && *subdir);
3169 while (*dir && *subdir && !cmp_icase(*dir, *subdir)) {
3170 dir++;
3171 subdir++;
3172 offset++;
3175 /* hel[p]/me vs hel[l]/yeah */
3176 if (*dir && *subdir)
3177 return -1;
3179 if (!*subdir)
3180 return !*dir ? offset : -1; /* same dir */
3182 /* foo/[b]ar vs foo/[] */
3183 if (is_dir_sep(dir[-1]))
3184 return is_dir_sep(subdir[-1]) ? offset : -1;
3186 /* foo[/]bar vs foo[] */
3187 return is_dir_sep(*subdir) ? offset + 1 : -1;
3190 int is_inside_dir(const char *dir)
3192 char *cwd;
3193 int rc;
3195 if (!dir)
3196 return 0;
3198 cwd = xgetcwd();
3199 rc = (dir_inside_of(cwd, dir) >= 0);
3200 free(cwd);
3201 return rc;
3204 int is_empty_dir(const char *path)
3206 DIR *dir = opendir(path);
3207 struct dirent *e;
3208 int ret = 1;
3210 if (!dir)
3211 return 0;
3213 e = readdir_skip_dot_and_dotdot(dir);
3214 if (e)
3215 ret = 0;
3217 closedir(dir);
3218 return ret;
3221 char *git_url_basename(const char *repo, int is_bundle, int is_bare)
3223 const char *end = repo + strlen(repo), *start, *ptr;
3224 size_t len;
3225 char *dir;
3228 * Skip scheme.
3230 start = strstr(repo, "://");
3231 if (!start)
3232 start = repo;
3233 else
3234 start += 3;
3237 * Skip authentication data. The stripping does happen
3238 * greedily, such that we strip up to the last '@' inside
3239 * the host part.
3241 for (ptr = start; ptr < end && !is_dir_sep(*ptr); ptr++) {
3242 if (*ptr == '@')
3243 start = ptr + 1;
3247 * Strip trailing spaces, slashes and /.git
3249 while (start < end && (is_dir_sep(end[-1]) || isspace(end[-1])))
3250 end--;
3251 if (end - start > 5 && is_dir_sep(end[-5]) &&
3252 !strncmp(end - 4, ".git", 4)) {
3253 end -= 5;
3254 while (start < end && is_dir_sep(end[-1]))
3255 end--;
3259 * It should not be possible to overflow `ptrdiff_t` by passing in an
3260 * insanely long URL, but GCC does not know that and will complain
3261 * without this check.
3263 if (end - start < 0)
3264 die(_("No directory name could be guessed.\n"
3265 "Please specify a directory on the command line"));
3268 * Strip trailing port number if we've got only a
3269 * hostname (that is, there is no dir separator but a
3270 * colon). This check is required such that we do not
3271 * strip URI's like '/foo/bar:2222.git', which should
3272 * result in a dir '2222' being guessed due to backwards
3273 * compatibility.
3275 if (memchr(start, '/', end - start) == NULL
3276 && memchr(start, ':', end - start) != NULL) {
3277 ptr = end;
3278 while (start < ptr && isdigit(ptr[-1]) && ptr[-1] != ':')
3279 ptr--;
3280 if (start < ptr && ptr[-1] == ':')
3281 end = ptr - 1;
3285 * Find last component. To remain backwards compatible we
3286 * also regard colons as path separators, such that
3287 * cloning a repository 'foo:bar.git' would result in a
3288 * directory 'bar' being guessed.
3290 ptr = end;
3291 while (start < ptr && !is_dir_sep(ptr[-1]) && ptr[-1] != ':')
3292 ptr--;
3293 start = ptr;
3296 * Strip .{bundle,git}.
3298 len = end - start;
3299 strip_suffix_mem(start, &len, is_bundle ? ".bundle" : ".git");
3301 if (!len || (len == 1 && *start == '/'))
3302 die(_("No directory name could be guessed.\n"
3303 "Please specify a directory on the command line"));
3305 if (is_bare)
3306 dir = xstrfmt("%.*s.git", (int)len, start);
3307 else
3308 dir = xstrndup(start, len);
3310 * Replace sequences of 'control' characters and whitespace
3311 * with one ascii space, remove leading and trailing spaces.
3313 if (*dir) {
3314 char *out = dir;
3315 int prev_space = 1 /* strip leading whitespace */;
3316 for (end = dir; *end; ++end) {
3317 char ch = *end;
3318 if ((unsigned char)ch < '\x20')
3319 ch = '\x20';
3320 if (isspace(ch)) {
3321 if (prev_space)
3322 continue;
3323 prev_space = 1;
3324 } else
3325 prev_space = 0;
3326 *out++ = ch;
3328 *out = '\0';
3329 if (out > dir && prev_space)
3330 out[-1] = '\0';
3332 return dir;
3335 void strip_dir_trailing_slashes(char *dir)
3337 char *end = dir + strlen(dir);
3339 while (dir < end - 1 && is_dir_sep(end[-1]))
3340 end--;
3341 *end = '\0';
3344 static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up)
3346 DIR *dir;
3347 struct dirent *e;
3348 int ret = 0, original_len = path->len, len, kept_down = 0;
3349 int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY);
3350 int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL);
3351 int purge_original_cwd = (flag & REMOVE_DIR_PURGE_ORIGINAL_CWD);
3352 struct object_id submodule_head;
3354 if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) &&
3355 !repo_resolve_gitlink_ref(the_repository, path->buf,
3356 "HEAD", &submodule_head)) {
3357 /* Do not descend and nuke a nested git work tree. */
3358 if (kept_up)
3359 *kept_up = 1;
3360 return 0;
3363 flag &= ~REMOVE_DIR_KEEP_TOPLEVEL;
3364 dir = opendir(path->buf);
3365 if (!dir) {
3366 if (errno == ENOENT)
3367 return keep_toplevel ? -1 : 0;
3368 else if (errno == EACCES && !keep_toplevel)
3370 * An empty dir could be removable even if it
3371 * is unreadable:
3373 return rmdir(path->buf);
3374 else
3375 return -1;
3377 strbuf_complete(path, '/');
3379 len = path->len;
3380 while ((e = readdir_skip_dot_and_dotdot(dir)) != NULL) {
3381 struct stat st;
3383 strbuf_setlen(path, len);
3384 strbuf_addstr(path, e->d_name);
3385 if (lstat(path->buf, &st)) {
3386 if (errno == ENOENT)
3388 * file disappeared, which is what we
3389 * wanted anyway
3391 continue;
3392 /* fall through */
3393 } else if (S_ISDIR(st.st_mode)) {
3394 if (!remove_dir_recurse(path, flag, &kept_down))
3395 continue; /* happy */
3396 } else if (!only_empty &&
3397 (!unlink(path->buf) || errno == ENOENT)) {
3398 continue; /* happy, too */
3401 /* path too long, stat fails, or non-directory still exists */
3402 ret = -1;
3403 break;
3405 closedir(dir);
3407 strbuf_setlen(path, original_len);
3408 if (!ret && !keep_toplevel && !kept_down) {
3409 if (!purge_original_cwd &&
3410 startup_info->original_cwd &&
3411 !strcmp(startup_info->original_cwd, path->buf))
3412 ret = -1; /* Do not remove current working directory */
3413 else
3414 ret = (!rmdir(path->buf) || errno == ENOENT) ? 0 : -1;
3415 } else if (kept_up)
3417 * report the uplevel that it is not an error that we
3418 * did not rmdir() our directory.
3420 *kept_up = !ret;
3421 return ret;
3424 int remove_dir_recursively(struct strbuf *path, int flag)
3426 return remove_dir_recurse(path, flag, NULL);
3429 static GIT_PATH_FUNC(git_path_info_exclude, "info/exclude")
3431 void setup_standard_excludes(struct dir_struct *dir)
3433 dir->exclude_per_dir = ".gitignore";
3435 /* core.excludesfile defaulting to $XDG_CONFIG_HOME/git/ignore */
3436 if (!excludes_file)
3437 excludes_file = xdg_config_home("ignore");
3438 if (excludes_file && !access_or_warn(excludes_file, R_OK, 0))
3439 add_patterns_from_file_1(dir, excludes_file,
3440 dir->untracked ? &dir->internal.ss_excludes_file : NULL);
3442 /* per repository user preference */
3443 if (startup_info->have_repository) {
3444 const char *path = git_path_info_exclude();
3445 if (!access_or_warn(path, R_OK, 0))
3446 add_patterns_from_file_1(dir, path,
3447 dir->untracked ? &dir->internal.ss_info_exclude : NULL);
3451 char *get_sparse_checkout_filename(void)
3453 return git_pathdup("info/sparse-checkout");
3456 int get_sparse_checkout_patterns(struct pattern_list *pl)
3458 int res;
3459 char *sparse_filename = get_sparse_checkout_filename();
3461 pl->use_cone_patterns = core_sparse_checkout_cone;
3462 res = add_patterns_from_file_to_list(sparse_filename, "", 0, pl, NULL, 0);
3464 free(sparse_filename);
3465 return res;
3468 int remove_path(const char *name)
3470 char *slash;
3472 if (unlink(name) && !is_missing_file_error(errno))
3473 return -1;
3475 slash = strrchr(name, '/');
3476 if (slash) {
3477 char *dirs = xstrdup(name);
3478 slash = dirs + (slash - name);
3479 do {
3480 *slash = '\0';
3481 if (startup_info->original_cwd &&
3482 !strcmp(startup_info->original_cwd, dirs))
3483 break;
3484 } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/')));
3485 free(dirs);
3487 return 0;
3491 * Frees memory within dir which was allocated, and resets fields for further
3492 * use. Does not free dir itself.
3494 void dir_clear(struct dir_struct *dir)
3496 int i, j;
3497 struct exclude_list_group *group;
3498 struct pattern_list *pl;
3499 struct exclude_stack *stk;
3500 struct dir_struct new = DIR_INIT;
3502 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
3503 group = &dir->internal.exclude_list_group[i];
3504 for (j = 0; j < group->nr; j++) {
3505 pl = &group->pl[j];
3506 if (i == EXC_DIRS)
3507 free((char *)pl->src);
3508 clear_pattern_list(pl);
3510 free(group->pl);
3513 for (i = 0; i < dir->ignored_nr; i++)
3514 free(dir->ignored[i]);
3515 for (i = 0; i < dir->nr; i++)
3516 free(dir->entries[i]);
3517 free(dir->ignored);
3518 free(dir->entries);
3520 stk = dir->internal.exclude_stack;
3521 while (stk) {
3522 struct exclude_stack *prev = stk->prev;
3523 free(stk);
3524 stk = prev;
3526 strbuf_release(&dir->internal.basebuf);
3528 memcpy(dir, &new, sizeof(*dir));
3531 struct ondisk_untracked_cache {
3532 struct stat_data info_exclude_stat;
3533 struct stat_data excludes_file_stat;
3534 uint32_t dir_flags;
3537 #define ouc_offset(x) offsetof(struct ondisk_untracked_cache, x)
3539 struct write_data {
3540 int index; /* number of written untracked_cache_dir */
3541 struct ewah_bitmap *check_only; /* from untracked_cache_dir */
3542 struct ewah_bitmap *valid; /* from untracked_cache_dir */
3543 struct ewah_bitmap *sha1_valid; /* set if exclude_sha1 is not null */
3544 struct strbuf out;
3545 struct strbuf sb_stat;
3546 struct strbuf sb_sha1;
3549 static void stat_data_to_disk(struct stat_data *to, const struct stat_data *from)
3551 to->sd_ctime.sec = htonl(from->sd_ctime.sec);
3552 to->sd_ctime.nsec = htonl(from->sd_ctime.nsec);
3553 to->sd_mtime.sec = htonl(from->sd_mtime.sec);
3554 to->sd_mtime.nsec = htonl(from->sd_mtime.nsec);
3555 to->sd_dev = htonl(from->sd_dev);
3556 to->sd_ino = htonl(from->sd_ino);
3557 to->sd_uid = htonl(from->sd_uid);
3558 to->sd_gid = htonl(from->sd_gid);
3559 to->sd_size = htonl(from->sd_size);
3562 static void write_one_dir(struct untracked_cache_dir *untracked,
3563 struct write_data *wd)
3565 struct stat_data stat_data;
3566 struct strbuf *out = &wd->out;
3567 unsigned char intbuf[16];
3568 unsigned int intlen, value;
3569 int i = wd->index++;
3572 * untracked_nr should be reset whenever valid is clear, but
3573 * for safety..
3575 if (!untracked->valid) {
3576 untracked->untracked_nr = 0;
3577 untracked->check_only = 0;
3580 if (untracked->check_only)
3581 ewah_set(wd->check_only, i);
3582 if (untracked->valid) {
3583 ewah_set(wd->valid, i);
3584 stat_data_to_disk(&stat_data, &untracked->stat_data);
3585 strbuf_add(&wd->sb_stat, &stat_data, sizeof(stat_data));
3587 if (!is_null_oid(&untracked->exclude_oid)) {
3588 ewah_set(wd->sha1_valid, i);
3589 strbuf_add(&wd->sb_sha1, untracked->exclude_oid.hash,
3590 the_hash_algo->rawsz);
3593 intlen = encode_varint(untracked->untracked_nr, intbuf);
3594 strbuf_add(out, intbuf, intlen);
3596 /* skip non-recurse directories */
3597 for (i = 0, value = 0; i < untracked->dirs_nr; i++)
3598 if (untracked->dirs[i]->recurse)
3599 value++;
3600 intlen = encode_varint(value, intbuf);
3601 strbuf_add(out, intbuf, intlen);
3603 strbuf_add(out, untracked->name, strlen(untracked->name) + 1);
3605 for (i = 0; i < untracked->untracked_nr; i++)
3606 strbuf_add(out, untracked->untracked[i],
3607 strlen(untracked->untracked[i]) + 1);
3609 for (i = 0; i < untracked->dirs_nr; i++)
3610 if (untracked->dirs[i]->recurse)
3611 write_one_dir(untracked->dirs[i], wd);
3614 void write_untracked_extension(struct strbuf *out, struct untracked_cache *untracked)
3616 struct ondisk_untracked_cache *ouc;
3617 struct write_data wd;
3618 unsigned char varbuf[16];
3619 int varint_len;
3620 const unsigned hashsz = the_hash_algo->rawsz;
3622 CALLOC_ARRAY(ouc, 1);
3623 stat_data_to_disk(&ouc->info_exclude_stat, &untracked->ss_info_exclude.stat);
3624 stat_data_to_disk(&ouc->excludes_file_stat, &untracked->ss_excludes_file.stat);
3625 ouc->dir_flags = htonl(untracked->dir_flags);
3627 varint_len = encode_varint(untracked->ident.len, varbuf);
3628 strbuf_add(out, varbuf, varint_len);
3629 strbuf_addbuf(out, &untracked->ident);
3631 strbuf_add(out, ouc, sizeof(*ouc));
3632 strbuf_add(out, untracked->ss_info_exclude.oid.hash, hashsz);
3633 strbuf_add(out, untracked->ss_excludes_file.oid.hash, hashsz);
3634 strbuf_add(out, untracked->exclude_per_dir, strlen(untracked->exclude_per_dir) + 1);
3635 FREE_AND_NULL(ouc);
3637 if (!untracked->root) {
3638 varint_len = encode_varint(0, varbuf);
3639 strbuf_add(out, varbuf, varint_len);
3640 return;
3643 wd.index = 0;
3644 wd.check_only = ewah_new();
3645 wd.valid = ewah_new();
3646 wd.sha1_valid = ewah_new();
3647 strbuf_init(&wd.out, 1024);
3648 strbuf_init(&wd.sb_stat, 1024);
3649 strbuf_init(&wd.sb_sha1, 1024);
3650 write_one_dir(untracked->root, &wd);
3652 varint_len = encode_varint(wd.index, varbuf);
3653 strbuf_add(out, varbuf, varint_len);
3654 strbuf_addbuf(out, &wd.out);
3655 ewah_serialize_strbuf(wd.valid, out);
3656 ewah_serialize_strbuf(wd.check_only, out);
3657 ewah_serialize_strbuf(wd.sha1_valid, out);
3658 strbuf_addbuf(out, &wd.sb_stat);
3659 strbuf_addbuf(out, &wd.sb_sha1);
3660 strbuf_addch(out, '\0'); /* safe guard for string lists */
3662 ewah_free(wd.valid);
3663 ewah_free(wd.check_only);
3664 ewah_free(wd.sha1_valid);
3665 strbuf_release(&wd.out);
3666 strbuf_release(&wd.sb_stat);
3667 strbuf_release(&wd.sb_sha1);
3670 static void free_untracked(struct untracked_cache_dir *ucd)
3672 int i;
3673 if (!ucd)
3674 return;
3675 for (i = 0; i < ucd->dirs_nr; i++)
3676 free_untracked(ucd->dirs[i]);
3677 for (i = 0; i < ucd->untracked_nr; i++)
3678 free(ucd->untracked[i]);
3679 free(ucd->untracked);
3680 free(ucd->dirs);
3681 free(ucd);
3684 void free_untracked_cache(struct untracked_cache *uc)
3686 if (!uc)
3687 return;
3689 free(uc->exclude_per_dir_to_free);
3690 strbuf_release(&uc->ident);
3691 free_untracked(uc->root);
3692 free(uc);
3695 struct read_data {
3696 int index;
3697 struct untracked_cache_dir **ucd;
3698 struct ewah_bitmap *check_only;
3699 struct ewah_bitmap *valid;
3700 struct ewah_bitmap *sha1_valid;
3701 const unsigned char *data;
3702 const unsigned char *end;
3705 static void stat_data_from_disk(struct stat_data *to, const unsigned char *data)
3707 memcpy(to, data, sizeof(*to));
3708 to->sd_ctime.sec = ntohl(to->sd_ctime.sec);
3709 to->sd_ctime.nsec = ntohl(to->sd_ctime.nsec);
3710 to->sd_mtime.sec = ntohl(to->sd_mtime.sec);
3711 to->sd_mtime.nsec = ntohl(to->sd_mtime.nsec);
3712 to->sd_dev = ntohl(to->sd_dev);
3713 to->sd_ino = ntohl(to->sd_ino);
3714 to->sd_uid = ntohl(to->sd_uid);
3715 to->sd_gid = ntohl(to->sd_gid);
3716 to->sd_size = ntohl(to->sd_size);
3719 static int read_one_dir(struct untracked_cache_dir **untracked_,
3720 struct read_data *rd)
3722 struct untracked_cache_dir ud, *untracked;
3723 const unsigned char *data = rd->data, *end = rd->end;
3724 const unsigned char *eos;
3725 unsigned int value;
3726 int i;
3728 memset(&ud, 0, sizeof(ud));
3730 value = decode_varint(&data);
3731 if (data > end)
3732 return -1;
3733 ud.recurse = 1;
3734 ud.untracked_alloc = value;
3735 ud.untracked_nr = value;
3736 if (ud.untracked_nr)
3737 ALLOC_ARRAY(ud.untracked, ud.untracked_nr);
3739 ud.dirs_alloc = ud.dirs_nr = decode_varint(&data);
3740 if (data > end)
3741 return -1;
3742 ALLOC_ARRAY(ud.dirs, ud.dirs_nr);
3744 eos = memchr(data, '\0', end - data);
3745 if (!eos || eos == end)
3746 return -1;
3748 *untracked_ = untracked = xmalloc(st_add3(sizeof(*untracked), eos - data, 1));
3749 memcpy(untracked, &ud, sizeof(ud));
3750 memcpy(untracked->name, data, eos - data + 1);
3751 data = eos + 1;
3753 for (i = 0; i < untracked->untracked_nr; i++) {
3754 eos = memchr(data, '\0', end - data);
3755 if (!eos || eos == end)
3756 return -1;
3757 untracked->untracked[i] = xmemdupz(data, eos - data);
3758 data = eos + 1;
3761 rd->ucd[rd->index++] = untracked;
3762 rd->data = data;
3764 for (i = 0; i < untracked->dirs_nr; i++) {
3765 if (read_one_dir(untracked->dirs + i, rd) < 0)
3766 return -1;
3768 return 0;
3771 static void set_check_only(size_t pos, void *cb)
3773 struct read_data *rd = cb;
3774 struct untracked_cache_dir *ud = rd->ucd[pos];
3775 ud->check_only = 1;
3778 static void read_stat(size_t pos, void *cb)
3780 struct read_data *rd = cb;
3781 struct untracked_cache_dir *ud = rd->ucd[pos];
3782 if (rd->data + sizeof(struct stat_data) > rd->end) {
3783 rd->data = rd->end + 1;
3784 return;
3786 stat_data_from_disk(&ud->stat_data, rd->data);
3787 rd->data += sizeof(struct stat_data);
3788 ud->valid = 1;
3791 static void read_oid(size_t pos, void *cb)
3793 struct read_data *rd = cb;
3794 struct untracked_cache_dir *ud = rd->ucd[pos];
3795 if (rd->data + the_hash_algo->rawsz > rd->end) {
3796 rd->data = rd->end + 1;
3797 return;
3799 oidread(&ud->exclude_oid, rd->data, the_repository->hash_algo);
3800 rd->data += the_hash_algo->rawsz;
3803 static void load_oid_stat(struct oid_stat *oid_stat, const unsigned char *data,
3804 const unsigned char *sha1)
3806 stat_data_from_disk(&oid_stat->stat, data);
3807 oidread(&oid_stat->oid, sha1, the_repository->hash_algo);
3808 oid_stat->valid = 1;
3811 struct untracked_cache *read_untracked_extension(const void *data, unsigned long sz)
3813 struct untracked_cache *uc;
3814 struct read_data rd;
3815 const unsigned char *next = data, *end = (const unsigned char *)data + sz;
3816 const char *ident;
3817 int ident_len;
3818 ssize_t len;
3819 const char *exclude_per_dir;
3820 const unsigned hashsz = the_hash_algo->rawsz;
3821 const unsigned offset = sizeof(struct ondisk_untracked_cache);
3822 const unsigned exclude_per_dir_offset = offset + 2 * hashsz;
3824 if (sz <= 1 || end[-1] != '\0')
3825 return NULL;
3826 end--;
3828 ident_len = decode_varint(&next);
3829 if (next + ident_len > end)
3830 return NULL;
3831 ident = (const char *)next;
3832 next += ident_len;
3834 if (next + exclude_per_dir_offset + 1 > end)
3835 return NULL;
3837 CALLOC_ARRAY(uc, 1);
3838 strbuf_init(&uc->ident, ident_len);
3839 strbuf_add(&uc->ident, ident, ident_len);
3840 load_oid_stat(&uc->ss_info_exclude,
3841 next + ouc_offset(info_exclude_stat),
3842 next + offset);
3843 load_oid_stat(&uc->ss_excludes_file,
3844 next + ouc_offset(excludes_file_stat),
3845 next + offset + hashsz);
3846 uc->dir_flags = get_be32(next + ouc_offset(dir_flags));
3847 exclude_per_dir = (const char *)next + exclude_per_dir_offset;
3848 uc->exclude_per_dir = uc->exclude_per_dir_to_free = xstrdup(exclude_per_dir);
3849 /* NUL after exclude_per_dir is covered by sizeof(*ouc) */
3850 next += exclude_per_dir_offset + strlen(exclude_per_dir) + 1;
3851 if (next >= end)
3852 goto done2;
3854 len = decode_varint(&next);
3855 if (next > end || len == 0)
3856 goto done2;
3858 rd.valid = ewah_new();
3859 rd.check_only = ewah_new();
3860 rd.sha1_valid = ewah_new();
3861 rd.data = next;
3862 rd.end = end;
3863 rd.index = 0;
3864 ALLOC_ARRAY(rd.ucd, len);
3866 if (read_one_dir(&uc->root, &rd) || rd.index != len)
3867 goto done;
3869 next = rd.data;
3870 len = ewah_read_mmap(rd.valid, next, end - next);
3871 if (len < 0)
3872 goto done;
3874 next += len;
3875 len = ewah_read_mmap(rd.check_only, next, end - next);
3876 if (len < 0)
3877 goto done;
3879 next += len;
3880 len = ewah_read_mmap(rd.sha1_valid, next, end - next);
3881 if (len < 0)
3882 goto done;
3884 ewah_each_bit(rd.check_only, set_check_only, &rd);
3885 rd.data = next + len;
3886 ewah_each_bit(rd.valid, read_stat, &rd);
3887 ewah_each_bit(rd.sha1_valid, read_oid, &rd);
3888 next = rd.data;
3890 done:
3891 free(rd.ucd);
3892 ewah_free(rd.valid);
3893 ewah_free(rd.check_only);
3894 ewah_free(rd.sha1_valid);
3895 done2:
3896 if (next != end) {
3897 free_untracked_cache(uc);
3898 uc = NULL;
3900 return uc;
3903 static void invalidate_one_directory(struct untracked_cache *uc,
3904 struct untracked_cache_dir *ucd)
3906 uc->dir_invalidated++;
3907 ucd->valid = 0;
3908 ucd->untracked_nr = 0;
3912 * Normally when an entry is added or removed from a directory,
3913 * invalidating that directory is enough. No need to touch its
3914 * ancestors. When a directory is shown as "foo/bar/" in git-status
3915 * however, deleting or adding an entry may have cascading effect.
3917 * Say the "foo/bar/file" has become untracked, we need to tell the
3918 * untracked_cache_dir of "foo" that "bar/" is not an untracked
3919 * directory any more (because "bar" is managed by foo as an untracked
3920 * "file").
3922 * Similarly, if "foo/bar/file" moves from untracked to tracked and it
3923 * was the last untracked entry in the entire "foo", we should show
3924 * "foo/" instead. Which means we have to invalidate past "bar" up to
3925 * "foo".
3927 * This function traverses all directories from root to leaf. If there
3928 * is a chance of one of the above cases happening, we invalidate back
3929 * to root. Otherwise we just invalidate the leaf. There may be a more
3930 * sophisticated way than checking for SHOW_OTHER_DIRECTORIES to
3931 * detect these cases and avoid unnecessary invalidation, for example,
3932 * checking for the untracked entry named "bar/" in "foo", but for now
3933 * stick to something safe and simple.
3935 static int invalidate_one_component(struct untracked_cache *uc,
3936 struct untracked_cache_dir *dir,
3937 const char *path, int len)
3939 const char *rest = strchr(path, '/');
3941 if (rest) {
3942 int component_len = rest - path;
3943 struct untracked_cache_dir *d =
3944 lookup_untracked(uc, dir, path, component_len);
3945 int ret =
3946 invalidate_one_component(uc, d, rest + 1,
3947 len - (component_len + 1));
3948 if (ret)
3949 invalidate_one_directory(uc, dir);
3950 return ret;
3953 invalidate_one_directory(uc, dir);
3954 return uc->dir_flags & DIR_SHOW_OTHER_DIRECTORIES;
3957 void untracked_cache_invalidate_path(struct index_state *istate,
3958 const char *path, int safe_path)
3960 if (!istate->untracked || !istate->untracked->root)
3961 return;
3962 if (!safe_path && !verify_path(path, 0))
3963 return;
3964 invalidate_one_component(istate->untracked, istate->untracked->root,
3965 path, strlen(path));
3968 void untracked_cache_invalidate_trimmed_path(struct index_state *istate,
3969 const char *path,
3970 int safe_path)
3972 size_t len = strlen(path);
3974 if (!len)
3975 BUG("untracked_cache_invalidate_trimmed_path given zero length path");
3977 if (path[len - 1] != '/') {
3978 untracked_cache_invalidate_path(istate, path, safe_path);
3979 } else {
3980 struct strbuf tmp = STRBUF_INIT;
3982 strbuf_add(&tmp, path, len - 1);
3983 untracked_cache_invalidate_path(istate, tmp.buf, safe_path);
3984 strbuf_release(&tmp);
3988 void untracked_cache_remove_from_index(struct index_state *istate,
3989 const char *path)
3991 untracked_cache_invalidate_path(istate, path, 1);
3994 void untracked_cache_add_to_index(struct index_state *istate,
3995 const char *path)
3997 untracked_cache_invalidate_path(istate, path, 1);
4000 static void connect_wt_gitdir_in_nested(const char *sub_worktree,
4001 const char *sub_gitdir)
4003 int i;
4004 struct repository subrepo;
4005 struct strbuf sub_wt = STRBUF_INIT;
4006 struct strbuf sub_gd = STRBUF_INIT;
4008 const struct submodule *sub;
4010 /* If the submodule has no working tree, we can ignore it. */
4011 if (repo_init(&subrepo, sub_gitdir, sub_worktree))
4012 return;
4014 if (repo_read_index(&subrepo) < 0)
4015 die(_("index file corrupt in repo %s"), subrepo.gitdir);
4017 /* TODO: audit for interaction with sparse-index. */
4018 ensure_full_index(subrepo.index);
4019 for (i = 0; i < subrepo.index->cache_nr; i++) {
4020 const struct cache_entry *ce = subrepo.index->cache[i];
4022 if (!S_ISGITLINK(ce->ce_mode))
4023 continue;
4025 while (i + 1 < subrepo.index->cache_nr &&
4026 !strcmp(ce->name, subrepo.index->cache[i + 1]->name))
4028 * Skip entries with the same name in different stages
4029 * to make sure an entry is returned only once.
4031 i++;
4033 sub = submodule_from_path(&subrepo, null_oid(), ce->name);
4034 if (!sub || !is_submodule_active(&subrepo, ce->name))
4035 /* .gitmodules broken or inactive sub */
4036 continue;
4038 strbuf_reset(&sub_wt);
4039 strbuf_reset(&sub_gd);
4040 strbuf_addf(&sub_wt, "%s/%s", sub_worktree, sub->path);
4041 submodule_name_to_gitdir(&sub_gd, &subrepo, sub->name);
4043 connect_work_tree_and_git_dir(sub_wt.buf, sub_gd.buf, 1);
4045 strbuf_release(&sub_wt);
4046 strbuf_release(&sub_gd);
4047 repo_clear(&subrepo);
4050 void connect_work_tree_and_git_dir(const char *work_tree_,
4051 const char *git_dir_,
4052 int recurse_into_nested)
4054 struct strbuf gitfile_sb = STRBUF_INIT;
4055 struct strbuf cfg_sb = STRBUF_INIT;
4056 struct strbuf rel_path = STRBUF_INIT;
4057 char *git_dir, *work_tree;
4059 /* Prepare .git file */
4060 strbuf_addf(&gitfile_sb, "%s/.git", work_tree_);
4061 if (safe_create_leading_directories_const(gitfile_sb.buf))
4062 die(_("could not create directories for %s"), gitfile_sb.buf);
4064 /* Prepare config file */
4065 strbuf_addf(&cfg_sb, "%s/config", git_dir_);
4066 if (safe_create_leading_directories_const(cfg_sb.buf))
4067 die(_("could not create directories for %s"), cfg_sb.buf);
4069 git_dir = real_pathdup(git_dir_, 1);
4070 work_tree = real_pathdup(work_tree_, 1);
4072 /* Write .git file */
4073 write_file(gitfile_sb.buf, "gitdir: %s",
4074 relative_path(git_dir, work_tree, &rel_path));
4075 /* Update core.worktree setting */
4076 git_config_set_in_file(cfg_sb.buf, "core.worktree",
4077 relative_path(work_tree, git_dir, &rel_path));
4079 strbuf_release(&gitfile_sb);
4080 strbuf_release(&cfg_sb);
4081 strbuf_release(&rel_path);
4083 if (recurse_into_nested)
4084 connect_wt_gitdir_in_nested(work_tree, git_dir);
4086 free(work_tree);
4087 free(git_dir);
4091 * Migrate the git directory of the given path from old_git_dir to new_git_dir.
4093 void relocate_gitdir(const char *path, const char *old_git_dir, const char *new_git_dir)
4095 if (rename(old_git_dir, new_git_dir) < 0)
4096 die_errno(_("could not migrate git directory from '%s' to '%s'"),
4097 old_git_dir, new_git_dir);
4099 connect_work_tree_and_git_dir(path, new_git_dir, 0);
4102 int path_match_flags(const char *const str, const enum path_match_flags flags)
4104 const char *p = str;
4106 if (flags & PATH_MATCH_NATIVE &&
4107 flags & PATH_MATCH_XPLATFORM)
4108 BUG("path_match_flags() must get one match kind, not multiple!");
4109 else if (!(flags & PATH_MATCH_KINDS_MASK))
4110 BUG("path_match_flags() must get at least one match kind!");
4112 if (flags & PATH_MATCH_STARTS_WITH_DOT_SLASH &&
4113 flags & PATH_MATCH_STARTS_WITH_DOT_DOT_SLASH)
4114 BUG("path_match_flags() must get one platform kind, not multiple!");
4115 else if (!(flags & PATH_MATCH_PLATFORM_MASK))
4116 BUG("path_match_flags() must get at least one platform kind!");
4118 if (*p++ != '.')
4119 return 0;
4120 if (flags & PATH_MATCH_STARTS_WITH_DOT_DOT_SLASH &&
4121 *p++ != '.')
4122 return 0;
4124 if (flags & PATH_MATCH_NATIVE)
4125 return is_dir_sep(*p);
4126 else if (flags & PATH_MATCH_XPLATFORM)
4127 return is_xplatform_dir_sep(*p);
4128 BUG("unreachable");