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