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