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