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