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