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