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