The second batch
[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(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(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(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(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(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(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 /* Flags for add_patterns() */
1050 #define PATTERN_NOFOLLOW (1<<0)
1051
1052 /*
1053  * Given a file with name "fname", read it (either from disk, or from
1054  * an index if 'istate' is non-null), parse it and store the
1055  * exclude rules in "pl".
1056  *
1057  * If "oid_stat" is not NULL, compute oid of the exclude file and fill
1058  * stat data from disk (only valid if add_patterns returns zero). If
1059  * oid_stat.valid is non-zero, "oid_stat" must contain good value as input.
1060  */
1061 static int add_patterns(const char *fname, const char *base, int baselen,
1062                         struct pattern_list *pl, struct index_state *istate,
1063                         unsigned flags, struct oid_stat *oid_stat)
1064 {
1065         struct stat st;
1066         int r;
1067         int fd;
1068         size_t size = 0;
1069         char *buf;
1070
1071         if (flags & PATTERN_NOFOLLOW)
1072                 fd = open_nofollow(fname, O_RDONLY);
1073         else
1074                 fd = open(fname, O_RDONLY);
1075
1076         if (fd < 0 || fstat(fd, &st) < 0) {
1077                 if (fd < 0)
1078                         warn_on_fopen_errors(fname);
1079                 else
1080                         close(fd);
1081                 if (!istate)
1082                         return -1;
1083                 r = read_skip_worktree_file_from_index(istate, fname,
1084                                                        &size, &buf,
1085                                                        oid_stat);
1086                 if (r != 1)
1087                         return r;
1088         } else {
1089                 size = xsize_t(st.st_size);
1090                 if (size == 0) {
1091                         if (oid_stat) {
1092                                 fill_stat_data(&oid_stat->stat, &st);
1093                                 oidcpy(&oid_stat->oid, the_hash_algo->empty_blob);
1094                                 oid_stat->valid = 1;
1095                         }
1096                         close(fd);
1097                         return 0;
1098                 }
1099                 buf = xmallocz(size);
1100                 if (read_in_full(fd, buf, size) != size) {
1101                         free(buf);
1102                         close(fd);
1103                         return -1;
1104                 }
1105                 buf[size++] = '\n';
1106                 close(fd);
1107                 if (oid_stat) {
1108                         int pos;
1109                         if (oid_stat->valid &&
1110                             !match_stat_data_racy(istate, &oid_stat->stat, &st))
1111                                 ; /* no content change, oid_stat->oid still good */
1112                         else if (istate &&
1113                                  (pos = index_name_pos(istate, fname, strlen(fname))) >= 0 &&
1114                                  !ce_stage(istate->cache[pos]) &&
1115                                  ce_uptodate(istate->cache[pos]) &&
1116                                  !would_convert_to_git(istate, fname))
1117                                 oidcpy(&oid_stat->oid,
1118                                        &istate->cache[pos]->oid);
1119                         else
1120                                 hash_object_file(the_hash_algo, buf, size,
1121                                                  "blob", &oid_stat->oid);
1122                         fill_stat_data(&oid_stat->stat, &st);
1123                         oid_stat->valid = 1;
1124                 }
1125         }
1126
1127         add_patterns_from_buffer(buf, size, base, baselen, pl);
1128         return 0;
1129 }
1130
1131 static int add_patterns_from_buffer(char *buf, size_t size,
1132                                     const char *base, int baselen,
1133                                     struct pattern_list *pl)
1134 {
1135         int i, lineno = 1;
1136         char *entry;
1137
1138         hashmap_init(&pl->recursive_hashmap, pl_hashmap_cmp, NULL, 0);
1139         hashmap_init(&pl->parent_hashmap, pl_hashmap_cmp, NULL, 0);
1140
1141         pl->filebuf = buf;
1142
1143         if (skip_utf8_bom(&buf, size))
1144                 size -= buf - pl->filebuf;
1145
1146         entry = buf;
1147
1148         for (i = 0; i < size; i++) {
1149                 if (buf[i] == '\n') {
1150                         if (entry != buf + i && entry[0] != '#') {
1151                                 buf[i - (i && buf[i-1] == '\r')] = 0;
1152                                 trim_trailing_spaces(entry);
1153                                 add_pattern(entry, base, baselen, pl, lineno);
1154                         }
1155                         lineno++;
1156                         entry = buf + i + 1;
1157                 }
1158         }
1159         return 0;
1160 }
1161
1162 int add_patterns_from_file_to_list(const char *fname, const char *base,
1163                                    int baselen, struct pattern_list *pl,
1164                                    struct index_state *istate,
1165                                    unsigned flags)
1166 {
1167         return add_patterns(fname, base, baselen, pl, istate, flags, NULL);
1168 }
1169
1170 int add_patterns_from_blob_to_list(
1171         struct object_id *oid,
1172         const char *base, int baselen,
1173         struct pattern_list *pl)
1174 {
1175         char *buf;
1176         size_t size;
1177         int r;
1178
1179         r = do_read_blob(oid, NULL, &size, &buf);
1180         if (r != 1)
1181                 return r;
1182
1183         add_patterns_from_buffer(buf, size, base, baselen, pl);
1184         return 0;
1185 }
1186
1187 struct pattern_list *add_pattern_list(struct dir_struct *dir,
1188                                       int group_type, const char *src)
1189 {
1190         struct pattern_list *pl;
1191         struct exclude_list_group *group;
1192
1193         group = &dir->exclude_list_group[group_type];
1194         ALLOC_GROW(group->pl, group->nr + 1, group->alloc);
1195         pl = &group->pl[group->nr++];
1196         memset(pl, 0, sizeof(*pl));
1197         pl->src = src;
1198         return pl;
1199 }
1200
1201 /*
1202  * Used to set up core.excludesfile and .git/info/exclude lists.
1203  */
1204 static void add_patterns_from_file_1(struct dir_struct *dir, const char *fname,
1205                                      struct oid_stat *oid_stat)
1206 {
1207         struct pattern_list *pl;
1208         /*
1209          * catch setup_standard_excludes() that's called before
1210          * dir->untracked is assigned. That function behaves
1211          * differently when dir->untracked is non-NULL.
1212          */
1213         if (!dir->untracked)
1214                 dir->unmanaged_exclude_files++;
1215         pl = add_pattern_list(dir, EXC_FILE, fname);
1216         if (add_patterns(fname, "", 0, pl, NULL, 0, oid_stat) < 0)
1217                 die(_("cannot use %s as an exclude file"), fname);
1218 }
1219
1220 void add_patterns_from_file(struct dir_struct *dir, const char *fname)
1221 {
1222         dir->unmanaged_exclude_files++; /* see validate_untracked_cache() */
1223         add_patterns_from_file_1(dir, fname, NULL);
1224 }
1225
1226 int match_basename(const char *basename, int basenamelen,
1227                    const char *pattern, int prefix, int patternlen,
1228                    unsigned flags)
1229 {
1230         if (prefix == patternlen) {
1231                 if (patternlen == basenamelen &&
1232                     !fspathncmp(pattern, basename, basenamelen))
1233                         return 1;
1234         } else if (flags & PATTERN_FLAG_ENDSWITH) {
1235                 /* "*literal" matching against "fooliteral" */
1236                 if (patternlen - 1 <= basenamelen &&
1237                     !fspathncmp(pattern + 1,
1238                                    basename + basenamelen - (patternlen - 1),
1239                                    patternlen - 1))
1240                         return 1;
1241         } else {
1242                 if (fnmatch_icase_mem(pattern, patternlen,
1243                                       basename, basenamelen,
1244                                       0) == 0)
1245                         return 1;
1246         }
1247         return 0;
1248 }
1249
1250 int match_pathname(const char *pathname, int pathlen,
1251                    const char *base, int baselen,
1252                    const char *pattern, int prefix, int patternlen,
1253                    unsigned flags)
1254 {
1255         const char *name;
1256         int namelen;
1257
1258         /*
1259          * match with FNM_PATHNAME; the pattern has base implicitly
1260          * in front of it.
1261          */
1262         if (*pattern == '/') {
1263                 pattern++;
1264                 patternlen--;
1265                 prefix--;
1266         }
1267
1268         /*
1269          * baselen does not count the trailing slash. base[] may or
1270          * may not end with a trailing slash though.
1271          */
1272         if (pathlen < baselen + 1 ||
1273             (baselen && pathname[baselen] != '/') ||
1274             fspathncmp(pathname, base, baselen))
1275                 return 0;
1276
1277         namelen = baselen ? pathlen - baselen - 1 : pathlen;
1278         name = pathname + pathlen - namelen;
1279
1280         if (prefix) {
1281                 /*
1282                  * if the non-wildcard part is longer than the
1283                  * remaining pathname, surely it cannot match.
1284                  */
1285                 if (prefix > namelen)
1286                         return 0;
1287
1288                 if (fspathncmp(pattern, name, prefix))
1289                         return 0;
1290                 pattern += prefix;
1291                 patternlen -= prefix;
1292                 name    += prefix;
1293                 namelen -= prefix;
1294
1295                 /*
1296                  * If the whole pattern did not have a wildcard,
1297                  * then our prefix match is all we need; we
1298                  * do not need to call fnmatch at all.
1299                  */
1300                 if (!patternlen && !namelen)
1301                         return 1;
1302         }
1303
1304         return fnmatch_icase_mem(pattern, patternlen,
1305                                  name, namelen,
1306                                  WM_PATHNAME) == 0;
1307 }
1308
1309 /*
1310  * Scan the given exclude list in reverse to see whether pathname
1311  * should be ignored.  The first match (i.e. the last on the list), if
1312  * any, determines the fate.  Returns the exclude_list element which
1313  * matched, or NULL for undecided.
1314  */
1315 static struct path_pattern *last_matching_pattern_from_list(const char *pathname,
1316                                                        int pathlen,
1317                                                        const char *basename,
1318                                                        int *dtype,
1319                                                        struct pattern_list *pl,
1320                                                        struct index_state *istate)
1321 {
1322         struct path_pattern *res = NULL; /* undecided */
1323         int i;
1324
1325         if (!pl->nr)
1326                 return NULL;    /* undefined */
1327
1328         for (i = pl->nr - 1; 0 <= i; i--) {
1329                 struct path_pattern *pattern = pl->patterns[i];
1330                 const char *exclude = pattern->pattern;
1331                 int prefix = pattern->nowildcardlen;
1332
1333                 if (pattern->flags & PATTERN_FLAG_MUSTBEDIR) {
1334                         *dtype = resolve_dtype(*dtype, istate, pathname, pathlen);
1335                         if (*dtype != DT_DIR)
1336                                 continue;
1337                 }
1338
1339                 if (pattern->flags & PATTERN_FLAG_NODIR) {
1340                         if (match_basename(basename,
1341                                            pathlen - (basename - pathname),
1342                                            exclude, prefix, pattern->patternlen,
1343                                            pattern->flags)) {
1344                                 res = pattern;
1345                                 break;
1346                         }
1347                         continue;
1348                 }
1349
1350                 assert(pattern->baselen == 0 ||
1351                        pattern->base[pattern->baselen - 1] == '/');
1352                 if (match_pathname(pathname, pathlen,
1353                                    pattern->base,
1354                                    pattern->baselen ? pattern->baselen - 1 : 0,
1355                                    exclude, prefix, pattern->patternlen,
1356                                    pattern->flags)) {
1357                         res = pattern;
1358                         break;
1359                 }
1360         }
1361         return res;
1362 }
1363
1364 /*
1365  * Scan the list of patterns to determine if the ordered list
1366  * of patterns matches on 'pathname'.
1367  *
1368  * Return 1 for a match, 0 for not matched and -1 for undecided.
1369  */
1370 enum pattern_match_result path_matches_pattern_list(
1371                                 const char *pathname, int pathlen,
1372                                 const char *basename, int *dtype,
1373                                 struct pattern_list *pl,
1374                                 struct index_state *istate)
1375 {
1376         struct path_pattern *pattern;
1377         struct strbuf parent_pathname = STRBUF_INIT;
1378         int result = NOT_MATCHED;
1379         const char *slash_pos;
1380
1381         if (!pl->use_cone_patterns) {
1382                 pattern = last_matching_pattern_from_list(pathname, pathlen, basename,
1383                                                         dtype, pl, istate);
1384                 if (pattern) {
1385                         if (pattern->flags & PATTERN_FLAG_NEGATIVE)
1386                                 return NOT_MATCHED;
1387                         else
1388                                 return MATCHED;
1389                 }
1390
1391                 return UNDECIDED;
1392         }
1393
1394         if (pl->full_cone)
1395                 return MATCHED;
1396
1397         strbuf_addch(&parent_pathname, '/');
1398         strbuf_add(&parent_pathname, pathname, pathlen);
1399
1400         if (hashmap_contains_path(&pl->recursive_hashmap,
1401                                   &parent_pathname)) {
1402                 result = MATCHED_RECURSIVE;
1403                 goto done;
1404         }
1405
1406         slash_pos = strrchr(parent_pathname.buf, '/');
1407
1408         if (slash_pos == parent_pathname.buf) {
1409                 /* include every file in root */
1410                 result = MATCHED;
1411                 goto done;
1412         }
1413
1414         strbuf_setlen(&parent_pathname, slash_pos - parent_pathname.buf);
1415
1416         if (hashmap_contains_path(&pl->parent_hashmap, &parent_pathname)) {
1417                 result = MATCHED;
1418                 goto done;
1419         }
1420
1421         if (hashmap_contains_parent(&pl->recursive_hashmap,
1422                                     pathname,
1423                                     &parent_pathname))
1424                 result = MATCHED_RECURSIVE;
1425
1426 done:
1427         strbuf_release(&parent_pathname);
1428         return result;
1429 }
1430
1431 static struct path_pattern *last_matching_pattern_from_lists(
1432                 struct dir_struct *dir, struct index_state *istate,
1433                 const char *pathname, int pathlen,
1434                 const char *basename, int *dtype_p)
1435 {
1436         int i, j;
1437         struct exclude_list_group *group;
1438         struct path_pattern *pattern;
1439         for (i = EXC_CMDL; i <= EXC_FILE; i++) {
1440                 group = &dir->exclude_list_group[i];
1441                 for (j = group->nr - 1; j >= 0; j--) {
1442                         pattern = last_matching_pattern_from_list(
1443                                 pathname, pathlen, basename, dtype_p,
1444                                 &group->pl[j], istate);
1445                         if (pattern)
1446                                 return pattern;
1447                 }
1448         }
1449         return NULL;
1450 }
1451
1452 /*
1453  * Loads the per-directory exclude list for the substring of base
1454  * which has a char length of baselen.
1455  */
1456 static void prep_exclude(struct dir_struct *dir,
1457                          struct index_state *istate,
1458                          const char *base, int baselen)
1459 {
1460         struct exclude_list_group *group;
1461         struct pattern_list *pl;
1462         struct exclude_stack *stk = NULL;
1463         struct untracked_cache_dir *untracked;
1464         int current;
1465
1466         group = &dir->exclude_list_group[EXC_DIRS];
1467
1468         /*
1469          * Pop the exclude lists from the EXCL_DIRS exclude_list_group
1470          * which originate from directories not in the prefix of the
1471          * path being checked.
1472          */
1473         while ((stk = dir->exclude_stack) != NULL) {
1474                 if (stk->baselen <= baselen &&
1475                     !strncmp(dir->basebuf.buf, base, stk->baselen))
1476                         break;
1477                 pl = &group->pl[dir->exclude_stack->exclude_ix];
1478                 dir->exclude_stack = stk->prev;
1479                 dir->pattern = NULL;
1480                 free((char *)pl->src); /* see strbuf_detach() below */
1481                 clear_pattern_list(pl);
1482                 free(stk);
1483                 group->nr--;
1484         }
1485
1486         /* Skip traversing into sub directories if the parent is excluded */
1487         if (dir->pattern)
1488                 return;
1489
1490         /*
1491          * Lazy initialization. All call sites currently just
1492          * memset(dir, 0, sizeof(*dir)) before use. Changing all of
1493          * them seems lots of work for little benefit.
1494          */
1495         if (!dir->basebuf.buf)
1496                 strbuf_init(&dir->basebuf, PATH_MAX);
1497
1498         /* Read from the parent directories and push them down. */
1499         current = stk ? stk->baselen : -1;
1500         strbuf_setlen(&dir->basebuf, current < 0 ? 0 : current);
1501         if (dir->untracked)
1502                 untracked = stk ? stk->ucd : dir->untracked->root;
1503         else
1504                 untracked = NULL;
1505
1506         while (current < baselen) {
1507                 const char *cp;
1508                 struct oid_stat oid_stat;
1509
1510                 CALLOC_ARRAY(stk, 1);
1511                 if (current < 0) {
1512                         cp = base;
1513                         current = 0;
1514                 } else {
1515                         cp = strchr(base + current + 1, '/');
1516                         if (!cp)
1517                                 die("oops in prep_exclude");
1518                         cp++;
1519                         untracked =
1520                                 lookup_untracked(dir->untracked, untracked,
1521                                                  base + current,
1522                                                  cp - base - current);
1523                 }
1524                 stk->prev = dir->exclude_stack;
1525                 stk->baselen = cp - base;
1526                 stk->exclude_ix = group->nr;
1527                 stk->ucd = untracked;
1528                 pl = add_pattern_list(dir, EXC_DIRS, NULL);
1529                 strbuf_add(&dir->basebuf, base + current, stk->baselen - current);
1530                 assert(stk->baselen == dir->basebuf.len);
1531
1532                 /* Abort if the directory is excluded */
1533                 if (stk->baselen) {
1534                         int dt = DT_DIR;
1535                         dir->basebuf.buf[stk->baselen - 1] = 0;
1536                         dir->pattern = last_matching_pattern_from_lists(dir,
1537                                                                         istate,
1538                                 dir->basebuf.buf, stk->baselen - 1,
1539                                 dir->basebuf.buf + current, &dt);
1540                         dir->basebuf.buf[stk->baselen - 1] = '/';
1541                         if (dir->pattern &&
1542                             dir->pattern->flags & PATTERN_FLAG_NEGATIVE)
1543                                 dir->pattern = NULL;
1544                         if (dir->pattern) {
1545                                 dir->exclude_stack = stk;
1546                                 return;
1547                         }
1548                 }
1549
1550                 /* Try to read per-directory file */
1551                 oidclr(&oid_stat.oid);
1552                 oid_stat.valid = 0;
1553                 if (dir->exclude_per_dir &&
1554                     /*
1555                      * If we know that no files have been added in
1556                      * this directory (i.e. valid_cached_dir() has
1557                      * been executed and set untracked->valid) ..
1558                      */
1559                     (!untracked || !untracked->valid ||
1560                      /*
1561                       * .. and .gitignore does not exist before
1562                       * (i.e. null exclude_oid). Then we can skip
1563                       * loading .gitignore, which would result in
1564                       * ENOENT anyway.
1565                       */
1566                      !is_null_oid(&untracked->exclude_oid))) {
1567                         /*
1568                          * dir->basebuf gets reused by the traversal, but we
1569                          * need fname to remain unchanged to ensure the src
1570                          * member of each struct path_pattern correctly
1571                          * back-references its source file.  Other invocations
1572                          * of add_pattern_list provide stable strings, so we
1573                          * strbuf_detach() and free() here in the caller.
1574                          */
1575                         struct strbuf sb = STRBUF_INIT;
1576                         strbuf_addbuf(&sb, &dir->basebuf);
1577                         strbuf_addstr(&sb, dir->exclude_per_dir);
1578                         pl->src = strbuf_detach(&sb, NULL);
1579                         add_patterns(pl->src, pl->src, stk->baselen, pl, istate,
1580                                      PATTERN_NOFOLLOW,
1581                                      untracked ? &oid_stat : NULL);
1582                 }
1583                 /*
1584                  * NEEDSWORK: when untracked cache is enabled, prep_exclude()
1585                  * will first be called in valid_cached_dir() then maybe many
1586                  * times more in last_matching_pattern(). When the cache is
1587                  * used, last_matching_pattern() will not be called and
1588                  * reading .gitignore content will be a waste.
1589                  *
1590                  * So when it's called by valid_cached_dir() and we can get
1591                  * .gitignore SHA-1 from the index (i.e. .gitignore is not
1592                  * modified on work tree), we could delay reading the
1593                  * .gitignore content until we absolutely need it in
1594                  * last_matching_pattern(). Be careful about ignore rule
1595                  * order, though, if you do that.
1596                  */
1597                 if (untracked &&
1598                     !oideq(&oid_stat.oid, &untracked->exclude_oid)) {
1599                         invalidate_gitignore(dir->untracked, untracked);
1600                         oidcpy(&untracked->exclude_oid, &oid_stat.oid);
1601                 }
1602                 dir->exclude_stack = stk;
1603                 current = stk->baselen;
1604         }
1605         strbuf_setlen(&dir->basebuf, baselen);
1606 }
1607
1608 /*
1609  * Loads the exclude lists for the directory containing pathname, then
1610  * scans all exclude lists to determine whether pathname is excluded.
1611  * Returns the exclude_list element which matched, or NULL for
1612  * undecided.
1613  */
1614 struct path_pattern *last_matching_pattern(struct dir_struct *dir,
1615                                       struct index_state *istate,
1616                                       const char *pathname,
1617                                       int *dtype_p)
1618 {
1619         int pathlen = strlen(pathname);
1620         const char *basename = strrchr(pathname, '/');
1621         basename = (basename) ? basename+1 : pathname;
1622
1623         prep_exclude(dir, istate, pathname, basename-pathname);
1624
1625         if (dir->pattern)
1626                 return dir->pattern;
1627
1628         return last_matching_pattern_from_lists(dir, istate, pathname, pathlen,
1629                         basename, dtype_p);
1630 }
1631
1632 /*
1633  * Loads the exclude lists for the directory containing pathname, then
1634  * scans all exclude lists to determine whether pathname is excluded.
1635  * Returns 1 if true, otherwise 0.
1636  */
1637 int is_excluded(struct dir_struct *dir, struct index_state *istate,
1638                 const char *pathname, int *dtype_p)
1639 {
1640         struct path_pattern *pattern =
1641                 last_matching_pattern(dir, istate, pathname, dtype_p);
1642         if (pattern)
1643                 return pattern->flags & PATTERN_FLAG_NEGATIVE ? 0 : 1;
1644         return 0;
1645 }
1646
1647 static struct dir_entry *dir_entry_new(const char *pathname, int len)
1648 {
1649         struct dir_entry *ent;
1650
1651         FLEX_ALLOC_MEM(ent, name, pathname, len);
1652         ent->len = len;
1653         return ent;
1654 }
1655
1656 static struct dir_entry *dir_add_name(struct dir_struct *dir,
1657                                       struct index_state *istate,
1658                                       const char *pathname, int len)
1659 {
1660         if (index_file_exists(istate, pathname, len, ignore_case))
1661                 return NULL;
1662
1663         ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc);
1664         return dir->entries[dir->nr++] = dir_entry_new(pathname, len);
1665 }
1666
1667 struct dir_entry *dir_add_ignored(struct dir_struct *dir,
1668                                   struct index_state *istate,
1669                                   const char *pathname, int len)
1670 {
1671         if (!index_name_is_other(istate, pathname, len))
1672                 return NULL;
1673
1674         ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc);
1675         return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);
1676 }
1677
1678 enum exist_status {
1679         index_nonexistent = 0,
1680         index_directory,
1681         index_gitdir
1682 };
1683
1684 /*
1685  * Do not use the alphabetically sorted index to look up
1686  * the directory name; instead, use the case insensitive
1687  * directory hash.
1688  */
1689 static enum exist_status directory_exists_in_index_icase(struct index_state *istate,
1690                                                          const char *dirname, int len)
1691 {
1692         struct cache_entry *ce;
1693
1694         if (index_dir_exists(istate, dirname, len))
1695                 return index_directory;
1696
1697         ce = index_file_exists(istate, dirname, len, ignore_case);
1698         if (ce && S_ISGITLINK(ce->ce_mode))
1699                 return index_gitdir;
1700
1701         return index_nonexistent;
1702 }
1703
1704 /*
1705  * The index sorts alphabetically by entry name, which
1706  * means that a gitlink sorts as '\0' at the end, while
1707  * a directory (which is defined not as an entry, but as
1708  * the files it contains) will sort with the '/' at the
1709  * end.
1710  */
1711 static enum exist_status directory_exists_in_index(struct index_state *istate,
1712                                                    const char *dirname, int len)
1713 {
1714         int pos;
1715
1716         if (ignore_case)
1717                 return directory_exists_in_index_icase(istate, dirname, len);
1718
1719         pos = index_name_pos(istate, dirname, len);
1720         if (pos < 0)
1721                 pos = -pos-1;
1722         while (pos < istate->cache_nr) {
1723                 const struct cache_entry *ce = istate->cache[pos++];
1724                 unsigned char endchar;
1725
1726                 if (strncmp(ce->name, dirname, len))
1727                         break;
1728                 endchar = ce->name[len];
1729                 if (endchar > '/')
1730                         break;
1731                 if (endchar == '/')
1732                         return index_directory;
1733                 if (!endchar && S_ISGITLINK(ce->ce_mode))
1734                         return index_gitdir;
1735         }
1736         return index_nonexistent;
1737 }
1738
1739 /*
1740  * When we find a directory when traversing the filesystem, we
1741  * have three distinct cases:
1742  *
1743  *  - ignore it
1744  *  - see it as a directory
1745  *  - recurse into it
1746  *
1747  * and which one we choose depends on a combination of existing
1748  * git index contents and the flags passed into the directory
1749  * traversal routine.
1750  *
1751  * Case 1: If we *already* have entries in the index under that
1752  * directory name, we always recurse into the directory to see
1753  * all the files.
1754  *
1755  * Case 2: If we *already* have that directory name as a gitlink,
1756  * we always continue to see it as a gitlink, regardless of whether
1757  * there is an actual git directory there or not (it might not
1758  * be checked out as a subproject!)
1759  *
1760  * Case 3: if we didn't have it in the index previously, we
1761  * have a few sub-cases:
1762  *
1763  *  (a) if DIR_SHOW_OTHER_DIRECTORIES flag is set, we show it as
1764  *      just a directory, unless DIR_HIDE_EMPTY_DIRECTORIES is
1765  *      also true, in which case we need to check if it contains any
1766  *      untracked and / or ignored files.
1767  *  (b) if it looks like a git directory and we don't have the
1768  *      DIR_NO_GITLINKS flag, then we treat it as a gitlink, and
1769  *      show it as a directory.
1770  *  (c) otherwise, we recurse into it.
1771  */
1772 static enum path_treatment treat_directory(struct dir_struct *dir,
1773         struct index_state *istate,
1774         struct untracked_cache_dir *untracked,
1775         const char *dirname, int len, int baselen, int excluded,
1776         const struct pathspec *pathspec)
1777 {
1778         /*
1779          * WARNING: From this function, you can return path_recurse or you
1780          *          can call read_directory_recursive() (or neither), but
1781          *          you CAN'T DO BOTH.
1782          */
1783         enum path_treatment state;
1784         int matches_how = 0;
1785         int nested_repo = 0, check_only, stop_early;
1786         int old_ignored_nr, old_untracked_nr;
1787         /* The "len-1" is to strip the final '/' */
1788         enum exist_status status = directory_exists_in_index(istate, dirname, len-1);
1789
1790         if (status == index_directory)
1791                 return path_recurse;
1792         if (status == index_gitdir)
1793                 return path_none;
1794         if (status != index_nonexistent)
1795                 BUG("Unhandled value for directory_exists_in_index: %d\n", status);
1796
1797         /*
1798          * We don't want to descend into paths that don't match the necessary
1799          * patterns.  Clearly, if we don't have a pathspec, then we can't check
1800          * for matching patterns.  Also, if (excluded) then we know we matched
1801          * the exclusion patterns so as an optimization we can skip checking
1802          * for matching patterns.
1803          */
1804         if (pathspec && !excluded) {
1805                 matches_how = match_pathspec_with_flags(istate, pathspec,
1806                                                         dirname, len,
1807                                                         0 /* prefix */,
1808                                                         NULL /* seen */,
1809                                                         DO_MATCH_LEADING_PATHSPEC);
1810                 if (!matches_how)
1811                         return path_none;
1812         }
1813
1814
1815         if ((dir->flags & DIR_SKIP_NESTED_GIT) ||
1816                 !(dir->flags & DIR_NO_GITLINKS)) {
1817                 struct strbuf sb = STRBUF_INIT;
1818                 strbuf_addstr(&sb, dirname);
1819                 nested_repo = is_nonbare_repository_dir(&sb);
1820                 strbuf_release(&sb);
1821         }
1822         if (nested_repo) {
1823                 if ((dir->flags & DIR_SKIP_NESTED_GIT) ||
1824                     (matches_how == MATCHED_RECURSIVELY_LEADING_PATHSPEC))
1825                         return path_none;
1826                 return excluded ? path_excluded : path_untracked;
1827         }
1828
1829         if (!(dir->flags & DIR_SHOW_OTHER_DIRECTORIES)) {
1830                 if (excluded &&
1831                     (dir->flags & DIR_SHOW_IGNORED_TOO) &&
1832                     (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING)) {
1833
1834                         /*
1835                          * This is an excluded directory and we are
1836                          * showing ignored paths that match an exclude
1837                          * pattern.  (e.g. show directory as ignored
1838                          * only if it matches an exclude pattern).
1839                          * This path will either be 'path_excluded`
1840                          * (if we are showing empty directories or if
1841                          * the directory is not empty), or will be
1842                          * 'path_none' (empty directory, and we are
1843                          * not showing empty directories).
1844                          */
1845                         if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
1846                                 return path_excluded;
1847
1848                         if (read_directory_recursive(dir, istate, dirname, len,
1849                                                      untracked, 1, 1, pathspec) == path_excluded)
1850                                 return path_excluded;
1851
1852                         return path_none;
1853                 }
1854                 return path_recurse;
1855         }
1856
1857         assert(dir->flags & DIR_SHOW_OTHER_DIRECTORIES);
1858
1859         /*
1860          * If we have a pathspec which could match something _below_ this
1861          * directory (e.g. when checking 'subdir/' having a pathspec like
1862          * 'subdir/some/deep/path/file' or 'subdir/widget-*.c'), then we
1863          * need to recurse.
1864          */
1865         if (matches_how == MATCHED_RECURSIVELY_LEADING_PATHSPEC)
1866                 return path_recurse;
1867
1868         /* Special cases for where this directory is excluded/ignored */
1869         if (excluded) {
1870                 /*
1871                  * If DIR_SHOW_OTHER_DIRECTORIES is set and we're not
1872                  * hiding empty directories, there is no need to
1873                  * recurse into an ignored directory.
1874                  */
1875                 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
1876                         return path_excluded;
1877
1878                 /*
1879                  * Even if we are hiding empty directories, we can still avoid
1880                  * recursing into ignored directories for DIR_SHOW_IGNORED_TOO
1881                  * if DIR_SHOW_IGNORED_TOO_MODE_MATCHING is also set.
1882                  */
1883                 if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
1884                     (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING))
1885                         return path_excluded;
1886         }
1887
1888         /*
1889          * Other than the path_recurse case above, we only need to
1890          * recurse into untracked directories if any of the following
1891          * bits is set:
1892          *   - DIR_SHOW_IGNORED (because then we need to determine if
1893          *                       there are ignored entries below)
1894          *   - DIR_SHOW_IGNORED_TOO (same as above)
1895          *   - DIR_HIDE_EMPTY_DIRECTORIES (because we have to determine if
1896          *                                 the directory is empty)
1897          */
1898         if (!excluded &&
1899             !(dir->flags & (DIR_SHOW_IGNORED |
1900                             DIR_SHOW_IGNORED_TOO |
1901                             DIR_HIDE_EMPTY_DIRECTORIES))) {
1902                 return path_untracked;
1903         }
1904
1905         /*
1906          * Even if we don't want to know all the paths under an untracked or
1907          * ignored directory, we may still need to go into the directory to
1908          * determine if it is empty (because with DIR_HIDE_EMPTY_DIRECTORIES,
1909          * an empty directory should be path_none instead of path_excluded or
1910          * path_untracked).
1911          */
1912         check_only = ((dir->flags & DIR_HIDE_EMPTY_DIRECTORIES) &&
1913                       !(dir->flags & DIR_SHOW_IGNORED_TOO));
1914
1915         /*
1916          * However, there's another optimization possible as a subset of
1917          * check_only, based on the cases we have to consider:
1918          *   A) Directory matches no exclude patterns:
1919          *     * Directory is empty => path_none
1920          *     * Directory has an untracked file under it => path_untracked
1921          *     * Directory has only ignored files under it => path_excluded
1922          *   B) Directory matches an exclude pattern:
1923          *     * Directory is empty => path_none
1924          *     * Directory has an untracked file under it => path_excluded
1925          *     * Directory has only ignored files under it => path_excluded
1926          * In case A, we can exit as soon as we've found an untracked
1927          * file but otherwise have to walk all files.  In case B, though,
1928          * we can stop at the first file we find under the directory.
1929          */
1930         stop_early = check_only && excluded;
1931
1932         /*
1933          * If /every/ file within an untracked directory is ignored, then
1934          * we want to treat the directory as ignored (for e.g. status
1935          * --porcelain), without listing the individual ignored files
1936          * underneath.  To do so, we'll save the current ignored_nr, and
1937          * pop all the ones added after it if it turns out the entire
1938          * directory is ignored.  Also, when DIR_SHOW_IGNORED_TOO and
1939          * !DIR_KEEP_UNTRACKED_CONTENTS then we don't want to show
1940          * untracked paths so will need to pop all those off the last
1941          * after we traverse.
1942          */
1943         old_ignored_nr = dir->ignored_nr;
1944         old_untracked_nr = dir->nr;
1945
1946         /* Actually recurse into dirname now, we'll fixup the state later. */
1947         untracked = lookup_untracked(dir->untracked, untracked,
1948                                      dirname + baselen, len - baselen);
1949         state = read_directory_recursive(dir, istate, dirname, len, untracked,
1950                                          check_only, stop_early, pathspec);
1951
1952         /* There are a variety of reasons we may need to fixup the state... */
1953         if (state == path_excluded) {
1954                 /* state == path_excluded implies all paths under
1955                  * dirname were ignored...
1956                  *
1957                  * if running e.g. `git status --porcelain --ignored=matching`,
1958                  * then we want to see the subpaths that are ignored.
1959                  *
1960                  * if running e.g. just `git status --porcelain`, then
1961                  * we just want the directory itself to be listed as ignored
1962                  * and not the individual paths underneath.
1963                  */
1964                 int want_ignored_subpaths =
1965                         ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
1966                          (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING));
1967
1968                 if (want_ignored_subpaths) {
1969                         /*
1970                          * with --ignored=matching, we want the subpaths
1971                          * INSTEAD of the directory itself.
1972                          */
1973                         state = path_none;
1974                 } else {
1975                         int i;
1976                         for (i = old_ignored_nr + 1; i<dir->ignored_nr; ++i)
1977                                 FREE_AND_NULL(dir->ignored[i]);
1978                         dir->ignored_nr = old_ignored_nr;
1979                 }
1980         }
1981
1982         /*
1983          * We may need to ignore some of the untracked paths we found while
1984          * traversing subdirectories.
1985          */
1986         if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&
1987             !(dir->flags & DIR_KEEP_UNTRACKED_CONTENTS)) {
1988                 int i;
1989                 for (i = old_untracked_nr + 1; i<dir->nr; ++i)
1990                         FREE_AND_NULL(dir->entries[i]);
1991                 dir->nr = old_untracked_nr;
1992         }
1993
1994         /*
1995          * If there is nothing under the current directory and we are not
1996          * hiding empty directories, then we need to report on the
1997          * untracked or ignored status of the directory itself.
1998          */
1999         if (state == path_none && !(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
2000                 state = excluded ? path_excluded : path_untracked;
2001
2002         return state;
2003 }
2004
2005 /*
2006  * This is an inexact early pruning of any recursive directory
2007  * reading - if the path cannot possibly be in the pathspec,
2008  * return true, and we'll skip it early.
2009  */
2010 static int simplify_away(const char *path, int pathlen,
2011                          const struct pathspec *pathspec)
2012 {
2013         int i;
2014
2015         if (!pathspec || !pathspec->nr)
2016                 return 0;
2017
2018         GUARD_PATHSPEC(pathspec,
2019                        PATHSPEC_FROMTOP |
2020                        PATHSPEC_MAXDEPTH |
2021                        PATHSPEC_LITERAL |
2022                        PATHSPEC_GLOB |
2023                        PATHSPEC_ICASE |
2024                        PATHSPEC_EXCLUDE |
2025                        PATHSPEC_ATTR);
2026
2027         for (i = 0; i < pathspec->nr; i++) {
2028                 const struct pathspec_item *item = &pathspec->items[i];
2029                 int len = item->nowildcard_len;
2030
2031                 if (len > pathlen)
2032                         len = pathlen;
2033                 if (!ps_strncmp(item, item->match, path, len))
2034                         return 0;
2035         }
2036
2037         return 1;
2038 }
2039
2040 /*
2041  * This function tells us whether an excluded path matches a
2042  * list of "interesting" pathspecs. That is, whether a path matched
2043  * by any of the pathspecs could possibly be ignored by excluding
2044  * the specified path. This can happen if:
2045  *
2046  *   1. the path is mentioned explicitly in the pathspec
2047  *
2048  *   2. the path is a directory prefix of some element in the
2049  *      pathspec
2050  */
2051 static int exclude_matches_pathspec(const char *path, int pathlen,
2052                                     const struct pathspec *pathspec)
2053 {
2054         int i;
2055
2056         if (!pathspec || !pathspec->nr)
2057                 return 0;
2058
2059         GUARD_PATHSPEC(pathspec,
2060                        PATHSPEC_FROMTOP |
2061                        PATHSPEC_MAXDEPTH |
2062                        PATHSPEC_LITERAL |
2063                        PATHSPEC_GLOB |
2064                        PATHSPEC_ICASE |
2065                        PATHSPEC_EXCLUDE);
2066
2067         for (i = 0; i < pathspec->nr; i++) {
2068                 const struct pathspec_item *item = &pathspec->items[i];
2069                 int len = item->nowildcard_len;
2070
2071                 if (len == pathlen &&
2072                     !ps_strncmp(item, item->match, path, pathlen))
2073                         return 1;
2074                 if (len > pathlen &&
2075                     item->match[pathlen] == '/' &&
2076                     !ps_strncmp(item, item->match, path, pathlen))
2077                         return 1;
2078         }
2079         return 0;
2080 }
2081
2082 static int get_index_dtype(struct index_state *istate,
2083                            const char *path, int len)
2084 {
2085         int pos;
2086         const struct cache_entry *ce;
2087
2088         ce = index_file_exists(istate, path, len, 0);
2089         if (ce) {
2090                 if (!ce_uptodate(ce))
2091                         return DT_UNKNOWN;
2092                 if (S_ISGITLINK(ce->ce_mode))
2093                         return DT_DIR;
2094                 /*
2095                  * Nobody actually cares about the
2096                  * difference between DT_LNK and DT_REG
2097                  */
2098                 return DT_REG;
2099         }
2100
2101         /* Try to look it up as a directory */
2102         pos = index_name_pos(istate, path, len);
2103         if (pos >= 0)
2104                 return DT_UNKNOWN;
2105         pos = -pos-1;
2106         while (pos < istate->cache_nr) {
2107                 ce = istate->cache[pos++];
2108                 if (strncmp(ce->name, path, len))
2109                         break;
2110                 if (ce->name[len] > '/')
2111                         break;
2112                 if (ce->name[len] < '/')
2113                         continue;
2114                 if (!ce_uptodate(ce))
2115                         break;  /* continue? */
2116                 return DT_DIR;
2117         }
2118         return DT_UNKNOWN;
2119 }
2120
2121 static int resolve_dtype(int dtype, struct index_state *istate,
2122                          const char *path, int len)
2123 {
2124         struct stat st;
2125
2126         if (dtype != DT_UNKNOWN)
2127                 return dtype;
2128         dtype = get_index_dtype(istate, path, len);
2129         if (dtype != DT_UNKNOWN)
2130                 return dtype;
2131         if (lstat(path, &st))
2132                 return dtype;
2133         if (S_ISREG(st.st_mode))
2134                 return DT_REG;
2135         if (S_ISDIR(st.st_mode))
2136                 return DT_DIR;
2137         if (S_ISLNK(st.st_mode))
2138                 return DT_LNK;
2139         return dtype;
2140 }
2141
2142 static enum path_treatment treat_path_fast(struct dir_struct *dir,
2143                                            struct cached_dir *cdir,
2144                                            struct index_state *istate,
2145                                            struct strbuf *path,
2146                                            int baselen,
2147                                            const struct pathspec *pathspec)
2148 {
2149         /*
2150          * WARNING: From this function, you can return path_recurse or you
2151          *          can call read_directory_recursive() (or neither), but
2152          *          you CAN'T DO BOTH.
2153          */
2154         strbuf_setlen(path, baselen);
2155         if (!cdir->ucd) {
2156                 strbuf_addstr(path, cdir->file);
2157                 return path_untracked;
2158         }
2159         strbuf_addstr(path, cdir->ucd->name);
2160         /* treat_one_path() does this before it calls treat_directory() */
2161         strbuf_complete(path, '/');
2162         if (cdir->ucd->check_only)
2163                 /*
2164                  * check_only is set as a result of treat_directory() getting
2165                  * to its bottom. Verify again the same set of directories
2166                  * with check_only set.
2167                  */
2168                 return read_directory_recursive(dir, istate, path->buf, path->len,
2169                                                 cdir->ucd, 1, 0, pathspec);
2170         /*
2171          * We get path_recurse in the first run when
2172          * directory_exists_in_index() returns index_nonexistent. We
2173          * are sure that new changes in the index does not impact the
2174          * outcome. Return now.
2175          */
2176         return path_recurse;
2177 }
2178
2179 static enum path_treatment treat_path(struct dir_struct *dir,
2180                                       struct untracked_cache_dir *untracked,
2181                                       struct cached_dir *cdir,
2182                                       struct index_state *istate,
2183                                       struct strbuf *path,
2184                                       int baselen,
2185                                       const struct pathspec *pathspec)
2186 {
2187         int has_path_in_index, dtype, excluded;
2188
2189         if (!cdir->d_name)
2190                 return treat_path_fast(dir, cdir, istate, path,
2191                                        baselen, pathspec);
2192         if (is_dot_or_dotdot(cdir->d_name) || !fspathcmp(cdir->d_name, ".git"))
2193                 return path_none;
2194         strbuf_setlen(path, baselen);
2195         strbuf_addstr(path, cdir->d_name);
2196         if (simplify_away(path->buf, path->len, pathspec))
2197                 return path_none;
2198
2199         dtype = resolve_dtype(cdir->d_type, istate, path->buf, path->len);
2200
2201         /* Always exclude indexed files */
2202         has_path_in_index = !!index_file_exists(istate, path->buf, path->len,
2203                                                 ignore_case);
2204         if (dtype != DT_DIR && has_path_in_index)
2205                 return path_none;
2206
2207         /*
2208          * When we are looking at a directory P in the working tree,
2209          * there are three cases:
2210          *
2211          * (1) P exists in the index.  Everything inside the directory P in
2212          * the working tree needs to go when P is checked out from the
2213          * index.
2214          *
2215          * (2) P does not exist in the index, but there is P/Q in the index.
2216          * We know P will stay a directory when we check out the contents
2217          * of the index, but we do not know yet if there is a directory
2218          * P/Q in the working tree to be killed, so we need to recurse.
2219          *
2220          * (3) P does not exist in the index, and there is no P/Q in the index
2221          * to require P to be a directory, either.  Only in this case, we
2222          * know that everything inside P will not be killed without
2223          * recursing.
2224          */
2225         if ((dir->flags & DIR_COLLECT_KILLED_ONLY) &&
2226             (dtype == DT_DIR) &&
2227             !has_path_in_index &&
2228             (directory_exists_in_index(istate, path->buf, path->len) == index_nonexistent))
2229                 return path_none;
2230
2231         excluded = is_excluded(dir, istate, path->buf, &dtype);
2232
2233         /*
2234          * Excluded? If we don't explicitly want to show
2235          * ignored files, ignore it
2236          */
2237         if (excluded && !(dir->flags & (DIR_SHOW_IGNORED|DIR_SHOW_IGNORED_TOO)))
2238                 return path_excluded;
2239
2240         switch (dtype) {
2241         default:
2242                 return path_none;
2243         case DT_DIR:
2244                 /*
2245                  * WARNING: Do not ignore/amend the return value from
2246                  * treat_directory(), and especially do not change it to return
2247                  * path_recurse as that can cause exponential slowdown.
2248                  * Instead, modify treat_directory() to return the right value.
2249                  */
2250                 strbuf_addch(path, '/');
2251                 return treat_directory(dir, istate, untracked,
2252                                        path->buf, path->len,
2253                                        baselen, excluded, pathspec);
2254         case DT_REG:
2255         case DT_LNK:
2256                 if (pathspec &&
2257                     !match_pathspec(istate, pathspec, path->buf, path->len,
2258                                     0 /* prefix */, NULL /* seen */,
2259                                     0 /* is_dir */))
2260                         return path_none;
2261                 if (excluded)
2262                         return path_excluded;
2263                 return path_untracked;
2264         }
2265 }
2266
2267 static void add_untracked(struct untracked_cache_dir *dir, const char *name)
2268 {
2269         if (!dir)
2270                 return;
2271         ALLOC_GROW(dir->untracked, dir->untracked_nr + 1,
2272                    dir->untracked_alloc);
2273         dir->untracked[dir->untracked_nr++] = xstrdup(name);
2274 }
2275
2276 static int valid_cached_dir(struct dir_struct *dir,
2277                             struct untracked_cache_dir *untracked,
2278                             struct index_state *istate,
2279                             struct strbuf *path,
2280                             int check_only)
2281 {
2282         struct stat st;
2283
2284         if (!untracked)
2285                 return 0;
2286
2287         /*
2288          * With fsmonitor, we can trust the untracked cache's valid field.
2289          */
2290         refresh_fsmonitor(istate);
2291         if (!(dir->untracked->use_fsmonitor && untracked->valid)) {
2292                 if (lstat(path->len ? path->buf : ".", &st)) {
2293                         memset(&untracked->stat_data, 0, sizeof(untracked->stat_data));
2294                         return 0;
2295                 }
2296                 if (!untracked->valid ||
2297                         match_stat_data_racy(istate, &untracked->stat_data, &st)) {
2298                         fill_stat_data(&untracked->stat_data, &st);
2299                         return 0;
2300                 }
2301         }
2302
2303         if (untracked->check_only != !!check_only)
2304                 return 0;
2305
2306         /*
2307          * prep_exclude will be called eventually on this directory,
2308          * but it's called much later in last_matching_pattern(). We
2309          * need it now to determine the validity of the cache for this
2310          * path. The next calls will be nearly no-op, the way
2311          * prep_exclude() is designed.
2312          */
2313         if (path->len && path->buf[path->len - 1] != '/') {
2314                 strbuf_addch(path, '/');
2315                 prep_exclude(dir, istate, path->buf, path->len);
2316                 strbuf_setlen(path, path->len - 1);
2317         } else
2318                 prep_exclude(dir, istate, path->buf, path->len);
2319
2320         /* hopefully prep_exclude() haven't invalidated this entry... */
2321         return untracked->valid;
2322 }
2323
2324 static int open_cached_dir(struct cached_dir *cdir,
2325                            struct dir_struct *dir,
2326                            struct untracked_cache_dir *untracked,
2327                            struct index_state *istate,
2328                            struct strbuf *path,
2329                            int check_only)
2330 {
2331         const char *c_path;
2332
2333         memset(cdir, 0, sizeof(*cdir));
2334         cdir->untracked = untracked;
2335         if (valid_cached_dir(dir, untracked, istate, path, check_only))
2336                 return 0;
2337         c_path = path->len ? path->buf : ".";
2338         cdir->fdir = opendir(c_path);
2339         if (!cdir->fdir)
2340                 warning_errno(_("could not open directory '%s'"), c_path);
2341         if (dir->untracked) {
2342                 invalidate_directory(dir->untracked, untracked);
2343                 dir->untracked->dir_opened++;
2344         }
2345         if (!cdir->fdir)
2346                 return -1;
2347         return 0;
2348 }
2349
2350 static int read_cached_dir(struct cached_dir *cdir)
2351 {
2352         struct dirent *de;
2353
2354         if (cdir->fdir) {
2355                 de = readdir_skip_dot_and_dotdot(cdir->fdir);
2356                 if (!de) {
2357                         cdir->d_name = NULL;
2358                         cdir->d_type = DT_UNKNOWN;
2359                         return -1;
2360                 }
2361                 cdir->d_name = de->d_name;
2362                 cdir->d_type = DTYPE(de);
2363                 return 0;
2364         }
2365         while (cdir->nr_dirs < cdir->untracked->dirs_nr) {
2366                 struct untracked_cache_dir *d = cdir->untracked->dirs[cdir->nr_dirs];
2367                 if (!d->recurse) {
2368                         cdir->nr_dirs++;
2369                         continue;
2370                 }
2371                 cdir->ucd = d;
2372                 cdir->nr_dirs++;
2373                 return 0;
2374         }
2375         cdir->ucd = NULL;
2376         if (cdir->nr_files < cdir->untracked->untracked_nr) {
2377                 struct untracked_cache_dir *d = cdir->untracked;
2378                 cdir->file = d->untracked[cdir->nr_files++];
2379                 return 0;
2380         }
2381         return -1;
2382 }
2383
2384 static void close_cached_dir(struct cached_dir *cdir)
2385 {
2386         if (cdir->fdir)
2387                 closedir(cdir->fdir);
2388         /*
2389          * We have gone through this directory and found no untracked
2390          * entries. Mark it valid.
2391          */
2392         if (cdir->untracked) {
2393                 cdir->untracked->valid = 1;
2394                 cdir->untracked->recurse = 1;
2395         }
2396 }
2397
2398 static void add_path_to_appropriate_result_list(struct dir_struct *dir,
2399         struct untracked_cache_dir *untracked,
2400         struct cached_dir *cdir,
2401         struct index_state *istate,
2402         struct strbuf *path,
2403         int baselen,
2404         const struct pathspec *pathspec,
2405         enum path_treatment state)
2406 {
2407         /* add the path to the appropriate result list */
2408         switch (state) {
2409         case path_excluded:
2410                 if (dir->flags & DIR_SHOW_IGNORED)
2411                         dir_add_name(dir, istate, path->buf, path->len);
2412                 else if ((dir->flags & DIR_SHOW_IGNORED_TOO) ||
2413                         ((dir->flags & DIR_COLLECT_IGNORED) &&
2414                         exclude_matches_pathspec(path->buf, path->len,
2415                                                  pathspec)))
2416                         dir_add_ignored(dir, istate, path->buf, path->len);
2417                 break;
2418
2419         case path_untracked:
2420                 if (dir->flags & DIR_SHOW_IGNORED)
2421                         break;
2422                 dir_add_name(dir, istate, path->buf, path->len);
2423                 if (cdir->fdir)
2424                         add_untracked(untracked, path->buf + baselen);
2425                 break;
2426
2427         default:
2428                 break;
2429         }
2430 }
2431
2432 /*
2433  * Read a directory tree. We currently ignore anything but
2434  * directories, regular files and symlinks. That's because git
2435  * doesn't handle them at all yet. Maybe that will change some
2436  * day.
2437  *
2438  * Also, we ignore the name ".git" (even if it is not a directory).
2439  * That likely will not change.
2440  *
2441  * If 'stop_at_first_file' is specified, 'path_excluded' is returned
2442  * to signal that a file was found. This is the least significant value that
2443  * indicates that a file was encountered that does not depend on the order of
2444  * whether an untracked or excluded path was encountered first.
2445  *
2446  * Returns the most significant path_treatment value encountered in the scan.
2447  * If 'stop_at_first_file' is specified, `path_excluded` is the most
2448  * significant path_treatment value that will be returned.
2449  */
2450
2451 static enum path_treatment read_directory_recursive(struct dir_struct *dir,
2452         struct index_state *istate, const char *base, int baselen,
2453         struct untracked_cache_dir *untracked, int check_only,
2454         int stop_at_first_file, const struct pathspec *pathspec)
2455 {
2456         /*
2457          * WARNING: Do NOT recurse unless path_recurse is returned from
2458          *          treat_path().  Recursing on any other return value
2459          *          can result in exponential slowdown.
2460          */
2461         struct cached_dir cdir;
2462         enum path_treatment state, subdir_state, dir_state = path_none;
2463         struct strbuf path = STRBUF_INIT;
2464
2465         strbuf_add(&path, base, baselen);
2466
2467         if (open_cached_dir(&cdir, dir, untracked, istate, &path, check_only))
2468                 goto out;
2469         dir->visited_directories++;
2470
2471         if (untracked)
2472                 untracked->check_only = !!check_only;
2473
2474         while (!read_cached_dir(&cdir)) {
2475                 /* check how the file or directory should be treated */
2476                 state = treat_path(dir, untracked, &cdir, istate, &path,
2477                                    baselen, pathspec);
2478                 dir->visited_paths++;
2479
2480                 if (state > dir_state)
2481                         dir_state = state;
2482
2483                 /* recurse into subdir if instructed by treat_path */
2484                 if (state == path_recurse) {
2485                         struct untracked_cache_dir *ud;
2486                         ud = lookup_untracked(dir->untracked, untracked,
2487                                               path.buf + baselen,
2488                                               path.len - baselen);
2489                         subdir_state =
2490                                 read_directory_recursive(dir, istate, path.buf,
2491                                                          path.len, ud,
2492                                                          check_only, stop_at_first_file, pathspec);
2493                         if (subdir_state > dir_state)
2494                                 dir_state = subdir_state;
2495
2496                         if (pathspec &&
2497                             !match_pathspec(istate, pathspec, path.buf, path.len,
2498                                             0 /* prefix */, NULL,
2499                                             0 /* do NOT special case dirs */))
2500                                 state = path_none;
2501                 }
2502
2503                 if (check_only) {
2504                         if (stop_at_first_file) {
2505                                 /*
2506                                  * If stopping at first file, then
2507                                  * signal that a file was found by
2508                                  * returning `path_excluded`. This is
2509                                  * to return a consistent value
2510                                  * regardless of whether an ignored or
2511                                  * excluded file happened to be
2512                                  * encountered 1st.
2513                                  *
2514                                  * In current usage, the
2515                                  * `stop_at_first_file` is passed when
2516                                  * an ancestor directory has matched
2517                                  * an exclude pattern, so any found
2518                                  * files will be excluded.
2519                                  */
2520                                 if (dir_state >= path_excluded) {
2521                                         dir_state = path_excluded;
2522                                         break;
2523                                 }
2524                         }
2525
2526                         /* abort early if maximum state has been reached */
2527                         if (dir_state == path_untracked) {
2528                                 if (cdir.fdir)
2529                                         add_untracked(untracked, path.buf + baselen);
2530                                 break;
2531                         }
2532                         /* skip the add_path_to_appropriate_result_list() */
2533                         continue;
2534                 }
2535
2536                 add_path_to_appropriate_result_list(dir, untracked, &cdir,
2537                                                     istate, &path, baselen,
2538                                                     pathspec, state);
2539         }
2540         close_cached_dir(&cdir);
2541  out:
2542         strbuf_release(&path);
2543
2544         return dir_state;
2545 }
2546
2547 int cmp_dir_entry(const void *p1, const void *p2)
2548 {
2549         const struct dir_entry *e1 = *(const struct dir_entry **)p1;
2550         const struct dir_entry *e2 = *(const struct dir_entry **)p2;
2551
2552         return name_compare(e1->name, e1->len, e2->name, e2->len);
2553 }
2554
2555 /* check if *out lexically strictly contains *in */
2556 int check_dir_entry_contains(const struct dir_entry *out, const struct dir_entry *in)
2557 {
2558         return (out->len < in->len) &&
2559                 (out->name[out->len - 1] == '/') &&
2560                 !memcmp(out->name, in->name, out->len);
2561 }
2562
2563 static int treat_leading_path(struct dir_struct *dir,
2564                               struct index_state *istate,
2565                               const char *path, int len,
2566                               const struct pathspec *pathspec)
2567 {
2568         struct strbuf sb = STRBUF_INIT;
2569         struct strbuf subdir = STRBUF_INIT;
2570         int prevlen, baselen;
2571         const char *cp;
2572         struct cached_dir cdir;
2573         enum path_treatment state = path_none;
2574
2575         /*
2576          * For each directory component of path, we are going to check whether
2577          * that path is relevant given the pathspec.  For example, if path is
2578          *    foo/bar/baz/
2579          * then we will ask treat_path() whether we should go into foo, then
2580          * whether we should go into bar, then whether baz is relevant.
2581          * Checking each is important because e.g. if path is
2582          *    .git/info/
2583          * then we need to check .git to know we shouldn't traverse it.
2584          * If the return from treat_path() is:
2585          *    * path_none, for any path, we return false.
2586          *    * path_recurse, for all path components, we return true
2587          *    * <anything else> for some intermediate component, we make sure
2588          *        to add that path to the relevant list but return false
2589          *        signifying that we shouldn't recurse into it.
2590          */
2591
2592         while (len && path[len - 1] == '/')
2593                 len--;
2594         if (!len)
2595                 return 1;
2596
2597         memset(&cdir, 0, sizeof(cdir));
2598         cdir.d_type = DT_DIR;
2599         baselen = 0;
2600         prevlen = 0;
2601         while (1) {
2602                 prevlen = baselen + !!baselen;
2603                 cp = path + prevlen;
2604                 cp = memchr(cp, '/', path + len - cp);
2605                 if (!cp)
2606                         baselen = len;
2607                 else
2608                         baselen = cp - path;
2609                 strbuf_reset(&sb);
2610                 strbuf_add(&sb, path, baselen);
2611                 if (!is_directory(sb.buf))
2612                         break;
2613                 strbuf_reset(&sb);
2614                 strbuf_add(&sb, path, prevlen);
2615                 strbuf_reset(&subdir);
2616                 strbuf_add(&subdir, path+prevlen, baselen-prevlen);
2617                 cdir.d_name = subdir.buf;
2618                 state = treat_path(dir, NULL, &cdir, istate, &sb, prevlen, pathspec);
2619
2620                 if (state != path_recurse)
2621                         break; /* do not recurse into it */
2622                 if (len <= baselen)
2623                         break; /* finished checking */
2624         }
2625         add_path_to_appropriate_result_list(dir, NULL, &cdir, istate,
2626                                             &sb, baselen, pathspec,
2627                                             state);
2628
2629         strbuf_release(&subdir);
2630         strbuf_release(&sb);
2631         return state == path_recurse;
2632 }
2633
2634 static const char *get_ident_string(void)
2635 {
2636         static struct strbuf sb = STRBUF_INIT;
2637         struct utsname uts;
2638
2639         if (sb.len)
2640                 return sb.buf;
2641         if (uname(&uts) < 0)
2642                 die_errno(_("failed to get kernel name and information"));
2643         strbuf_addf(&sb, "Location %s, system %s", get_git_work_tree(),
2644                     uts.sysname);
2645         return sb.buf;
2646 }
2647
2648 static int ident_in_untracked(const struct untracked_cache *uc)
2649 {
2650         /*
2651          * Previous git versions may have saved many NUL separated
2652          * strings in the "ident" field, but it is insane to manage
2653          * many locations, so just take care of the first one.
2654          */
2655
2656         return !strcmp(uc->ident.buf, get_ident_string());
2657 }
2658
2659 static void set_untracked_ident(struct untracked_cache *uc)
2660 {
2661         strbuf_reset(&uc->ident);
2662         strbuf_addstr(&uc->ident, get_ident_string());
2663
2664         /*
2665          * This strbuf used to contain a list of NUL separated
2666          * strings, so save NUL too for backward compatibility.
2667          */
2668         strbuf_addch(&uc->ident, 0);
2669 }
2670
2671 static void new_untracked_cache(struct index_state *istate)
2672 {
2673         struct untracked_cache *uc = xcalloc(1, sizeof(*uc));
2674         strbuf_init(&uc->ident, 100);
2675         uc->exclude_per_dir = ".gitignore";
2676         /* should be the same flags used by git-status */
2677         uc->dir_flags = DIR_SHOW_OTHER_DIRECTORIES | DIR_HIDE_EMPTY_DIRECTORIES;
2678         set_untracked_ident(uc);
2679         istate->untracked = uc;
2680         istate->cache_changed |= UNTRACKED_CHANGED;
2681 }
2682
2683 void add_untracked_cache(struct index_state *istate)
2684 {
2685         if (!istate->untracked) {
2686                 new_untracked_cache(istate);
2687         } else {
2688                 if (!ident_in_untracked(istate->untracked)) {
2689                         free_untracked_cache(istate->untracked);
2690                         new_untracked_cache(istate);
2691                 }
2692         }
2693 }
2694
2695 void remove_untracked_cache(struct index_state *istate)
2696 {
2697         if (istate->untracked) {
2698                 free_untracked_cache(istate->untracked);
2699                 istate->untracked = NULL;
2700                 istate->cache_changed |= UNTRACKED_CHANGED;
2701         }
2702 }
2703
2704 static struct untracked_cache_dir *validate_untracked_cache(struct dir_struct *dir,
2705                                                       int base_len,
2706                                                       const struct pathspec *pathspec)
2707 {
2708         struct untracked_cache_dir *root;
2709         static int untracked_cache_disabled = -1;
2710
2711         if (!dir->untracked)
2712                 return NULL;
2713         if (untracked_cache_disabled < 0)
2714                 untracked_cache_disabled = git_env_bool("GIT_DISABLE_UNTRACKED_CACHE", 0);
2715         if (untracked_cache_disabled)
2716                 return NULL;
2717
2718         /*
2719          * We only support $GIT_DIR/info/exclude and core.excludesfile
2720          * as the global ignore rule files. Any other additions
2721          * (e.g. from command line) invalidate the cache. This
2722          * condition also catches running setup_standard_excludes()
2723          * before setting dir->untracked!
2724          */
2725         if (dir->unmanaged_exclude_files)
2726                 return NULL;
2727
2728         /*
2729          * Optimize for the main use case only: whole-tree git
2730          * status. More work involved in treat_leading_path() if we
2731          * use cache on just a subset of the worktree. pathspec
2732          * support could make the matter even worse.
2733          */
2734         if (base_len || (pathspec && pathspec->nr))
2735                 return NULL;
2736
2737         /* Different set of flags may produce different results */
2738         if (dir->flags != dir->untracked->dir_flags ||
2739             /*
2740              * See treat_directory(), case index_nonexistent. Without
2741              * this flag, we may need to also cache .git file content
2742              * for the resolve_gitlink_ref() call, which we don't.
2743              */
2744             !(dir->flags & DIR_SHOW_OTHER_DIRECTORIES) ||
2745             /* We don't support collecting ignore files */
2746             (dir->flags & (DIR_SHOW_IGNORED | DIR_SHOW_IGNORED_TOO |
2747                            DIR_COLLECT_IGNORED)))
2748                 return NULL;
2749
2750         /*
2751          * If we use .gitignore in the cache and now you change it to
2752          * .gitexclude, everything will go wrong.
2753          */
2754         if (dir->exclude_per_dir != dir->untracked->exclude_per_dir &&
2755             strcmp(dir->exclude_per_dir, dir->untracked->exclude_per_dir))
2756                 return NULL;
2757
2758         /*
2759          * EXC_CMDL is not considered in the cache. If people set it,
2760          * skip the cache.
2761          */
2762         if (dir->exclude_list_group[EXC_CMDL].nr)
2763                 return NULL;
2764
2765         if (!ident_in_untracked(dir->untracked)) {
2766                 warning(_("untracked cache is disabled on this system or location"));
2767                 return NULL;
2768         }
2769
2770         if (!dir->untracked->root)
2771                 FLEX_ALLOC_STR(dir->untracked->root, name, "");
2772
2773         /* Validate $GIT_DIR/info/exclude and core.excludesfile */
2774         root = dir->untracked->root;
2775         if (!oideq(&dir->ss_info_exclude.oid,
2776                    &dir->untracked->ss_info_exclude.oid)) {
2777                 invalidate_gitignore(dir->untracked, root);
2778                 dir->untracked->ss_info_exclude = dir->ss_info_exclude;
2779         }
2780         if (!oideq(&dir->ss_excludes_file.oid,
2781                    &dir->untracked->ss_excludes_file.oid)) {
2782                 invalidate_gitignore(dir->untracked, root);
2783                 dir->untracked->ss_excludes_file = dir->ss_excludes_file;
2784         }
2785
2786         /* Make sure this directory is not dropped out at saving phase */
2787         root->recurse = 1;
2788         return root;
2789 }
2790
2791 static void emit_traversal_statistics(struct dir_struct *dir,
2792                                       struct repository *repo,
2793                                       const char *path,
2794                                       int path_len)
2795 {
2796         if (!trace2_is_enabled())
2797                 return;
2798
2799         if (!path_len) {
2800                 trace2_data_string("read_directory", repo, "path", "");
2801         } else {
2802                 struct strbuf tmp = STRBUF_INIT;
2803                 strbuf_add(&tmp, path, path_len);
2804                 trace2_data_string("read_directory", repo, "path", tmp.buf);
2805                 strbuf_release(&tmp);
2806         }
2807
2808         trace2_data_intmax("read_directory", repo,
2809                            "directories-visited", dir->visited_directories);
2810         trace2_data_intmax("read_directory", repo,
2811                            "paths-visited", dir->visited_paths);
2812
2813         if (!dir->untracked)
2814                 return;
2815         trace2_data_intmax("read_directory", repo,
2816                            "node-creation", dir->untracked->dir_created);
2817         trace2_data_intmax("read_directory", repo,
2818                            "gitignore-invalidation",
2819                            dir->untracked->gitignore_invalidated);
2820         trace2_data_intmax("read_directory", repo,
2821                            "directory-invalidation",
2822                            dir->untracked->dir_invalidated);
2823         trace2_data_intmax("read_directory", repo,
2824                            "opendir", dir->untracked->dir_opened);
2825 }
2826
2827 int read_directory(struct dir_struct *dir, struct index_state *istate,
2828                    const char *path, int len, const struct pathspec *pathspec)
2829 {
2830         struct untracked_cache_dir *untracked;
2831
2832         trace2_region_enter("dir", "read_directory", istate->repo);
2833         dir->visited_paths = 0;
2834         dir->visited_directories = 0;
2835
2836         if (has_symlink_leading_path(path, len)) {
2837                 trace2_region_leave("dir", "read_directory", istate->repo);
2838                 return dir->nr;
2839         }
2840
2841         untracked = validate_untracked_cache(dir, len, pathspec);
2842         if (!untracked)
2843                 /*
2844                  * make sure untracked cache code path is disabled,
2845                  * e.g. prep_exclude()
2846                  */
2847                 dir->untracked = NULL;
2848         if (!len || treat_leading_path(dir, istate, path, len, pathspec))
2849                 read_directory_recursive(dir, istate, path, len, untracked, 0, 0, pathspec);
2850         QSORT(dir->entries, dir->nr, cmp_dir_entry);
2851         QSORT(dir->ignored, dir->ignored_nr, cmp_dir_entry);
2852
2853         emit_traversal_statistics(dir, istate->repo, path, len);
2854
2855         trace2_region_leave("dir", "read_directory", istate->repo);
2856         if (dir->untracked) {
2857                 static int force_untracked_cache = -1;
2858
2859                 if (force_untracked_cache < 0)
2860                         force_untracked_cache =
2861                                 git_env_bool("GIT_FORCE_UNTRACKED_CACHE", 0);
2862                 if (force_untracked_cache &&
2863                         dir->untracked == istate->untracked &&
2864                     (dir->untracked->dir_opened ||
2865                      dir->untracked->gitignore_invalidated ||
2866                      dir->untracked->dir_invalidated))
2867                         istate->cache_changed |= UNTRACKED_CHANGED;
2868                 if (dir->untracked != istate->untracked) {
2869                         FREE_AND_NULL(dir->untracked);
2870                 }
2871         }
2872
2873         return dir->nr;
2874 }
2875
2876 int file_exists(const char *f)
2877 {
2878         struct stat sb;
2879         return lstat(f, &sb) == 0;
2880 }
2881
2882 int repo_file_exists(struct repository *repo, const char *path)
2883 {
2884         if (repo != the_repository)
2885                 BUG("do not know how to check file existence in arbitrary repo");
2886
2887         return file_exists(path);
2888 }
2889
2890 static int cmp_icase(char a, char b)
2891 {
2892         if (a == b)
2893                 return 0;
2894         if (ignore_case)
2895                 return toupper(a) - toupper(b);
2896         return a - b;
2897 }
2898
2899 /*
2900  * Given two normalized paths (a trailing slash is ok), if subdir is
2901  * outside dir, return -1.  Otherwise return the offset in subdir that
2902  * can be used as relative path to dir.
2903  */
2904 int dir_inside_of(const char *subdir, const char *dir)
2905 {
2906         int offset = 0;
2907
2908         assert(dir && subdir && *dir && *subdir);
2909
2910         while (*dir && *subdir && !cmp_icase(*dir, *subdir)) {
2911                 dir++;
2912                 subdir++;
2913                 offset++;
2914         }
2915
2916         /* hel[p]/me vs hel[l]/yeah */
2917         if (*dir && *subdir)
2918                 return -1;
2919
2920         if (!*subdir)
2921                 return !*dir ? offset : -1; /* same dir */
2922
2923         /* foo/[b]ar vs foo/[] */
2924         if (is_dir_sep(dir[-1]))
2925                 return is_dir_sep(subdir[-1]) ? offset : -1;
2926
2927         /* foo[/]bar vs foo[] */
2928         return is_dir_sep(*subdir) ? offset + 1 : -1;
2929 }
2930
2931 int is_inside_dir(const char *dir)
2932 {
2933         char *cwd;
2934         int rc;
2935
2936         if (!dir)
2937                 return 0;
2938
2939         cwd = xgetcwd();
2940         rc = (dir_inside_of(cwd, dir) >= 0);
2941         free(cwd);
2942         return rc;
2943 }
2944
2945 int is_empty_dir(const char *path)
2946 {
2947         DIR *dir = opendir(path);
2948         struct dirent *e;
2949         int ret = 1;
2950
2951         if (!dir)
2952                 return 0;
2953
2954         e = readdir_skip_dot_and_dotdot(dir);
2955         if (e)
2956                 ret = 0;
2957
2958         closedir(dir);
2959         return ret;
2960 }
2961
2962 static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up)
2963 {
2964         DIR *dir;
2965         struct dirent *e;
2966         int ret = 0, original_len = path->len, len, kept_down = 0;
2967         int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY);
2968         int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL);
2969         struct object_id submodule_head;
2970
2971         if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) &&
2972             !resolve_gitlink_ref(path->buf, "HEAD", &submodule_head)) {
2973                 /* Do not descend and nuke a nested git work tree. */
2974                 if (kept_up)
2975                         *kept_up = 1;
2976                 return 0;
2977         }
2978
2979         flag &= ~REMOVE_DIR_KEEP_TOPLEVEL;
2980         dir = opendir(path->buf);
2981         if (!dir) {
2982                 if (errno == ENOENT)
2983                         return keep_toplevel ? -1 : 0;
2984                 else if (errno == EACCES && !keep_toplevel)
2985                         /*
2986                          * An empty dir could be removable even if it
2987                          * is unreadable:
2988                          */
2989                         return rmdir(path->buf);
2990                 else
2991                         return -1;
2992         }
2993         strbuf_complete(path, '/');
2994
2995         len = path->len;
2996         while ((e = readdir_skip_dot_and_dotdot(dir)) != NULL) {
2997                 struct stat st;
2998
2999                 strbuf_setlen(path, len);
3000                 strbuf_addstr(path, e->d_name);
3001                 if (lstat(path->buf, &st)) {
3002                         if (errno == ENOENT)
3003                                 /*
3004                                  * file disappeared, which is what we
3005                                  * wanted anyway
3006                                  */
3007                                 continue;
3008                         /* fall through */
3009                 } else if (S_ISDIR(st.st_mode)) {
3010                         if (!remove_dir_recurse(path, flag, &kept_down))
3011                                 continue; /* happy */
3012                 } else if (!only_empty &&
3013                            (!unlink(path->buf) || errno == ENOENT)) {
3014                         continue; /* happy, too */
3015                 }
3016
3017                 /* path too long, stat fails, or non-directory still exists */
3018                 ret = -1;
3019                 break;
3020         }
3021         closedir(dir);
3022
3023         strbuf_setlen(path, original_len);
3024         if (!ret && !keep_toplevel && !kept_down)
3025                 ret = (!rmdir(path->buf) || errno == ENOENT) ? 0 : -1;
3026         else if (kept_up)
3027                 /*
3028                  * report the uplevel that it is not an error that we
3029                  * did not rmdir() our directory.
3030                  */
3031                 *kept_up = !ret;
3032         return ret;
3033 }
3034
3035 int remove_dir_recursively(struct strbuf *path, int flag)
3036 {
3037         return remove_dir_recurse(path, flag, NULL);
3038 }
3039
3040 static GIT_PATH_FUNC(git_path_info_exclude, "info/exclude")
3041
3042 void setup_standard_excludes(struct dir_struct *dir)
3043 {
3044         dir->exclude_per_dir = ".gitignore";
3045
3046         /* core.excludesfile defaulting to $XDG_CONFIG_HOME/git/ignore */
3047         if (!excludes_file)
3048                 excludes_file = xdg_config_home("ignore");
3049         if (excludes_file && !access_or_warn(excludes_file, R_OK, 0))
3050                 add_patterns_from_file_1(dir, excludes_file,
3051                                          dir->untracked ? &dir->ss_excludes_file : NULL);
3052
3053         /* per repository user preference */
3054         if (startup_info->have_repository) {
3055                 const char *path = git_path_info_exclude();
3056                 if (!access_or_warn(path, R_OK, 0))
3057                         add_patterns_from_file_1(dir, path,
3058                                                  dir->untracked ? &dir->ss_info_exclude : NULL);
3059         }
3060 }
3061
3062 char *get_sparse_checkout_filename(void)
3063 {
3064         return git_pathdup("info/sparse-checkout");
3065 }
3066
3067 int get_sparse_checkout_patterns(struct pattern_list *pl)
3068 {
3069         int res;
3070         char *sparse_filename = get_sparse_checkout_filename();
3071
3072         pl->use_cone_patterns = core_sparse_checkout_cone;
3073         res = add_patterns_from_file_to_list(sparse_filename, "", 0, pl, NULL, 0);
3074
3075         free(sparse_filename);
3076         return res;
3077 }
3078
3079 int remove_path(const char *name)
3080 {
3081         char *slash;
3082
3083         if (unlink(name) && !is_missing_file_error(errno))
3084                 return -1;
3085
3086         slash = strrchr(name, '/');
3087         if (slash) {
3088                 char *dirs = xstrdup(name);
3089                 slash = dirs + (slash - name);
3090                 do {
3091                         *slash = '\0';
3092                 } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/')));
3093                 free(dirs);
3094         }
3095         return 0;
3096 }
3097
3098 /*
3099  * Frees memory within dir which was allocated, and resets fields for further
3100  * use.  Does not free dir itself.
3101  */
3102 void dir_clear(struct dir_struct *dir)
3103 {
3104         int i, j;
3105         struct exclude_list_group *group;
3106         struct pattern_list *pl;
3107         struct exclude_stack *stk;
3108
3109         for (i = EXC_CMDL; i <= EXC_FILE; i++) {
3110                 group = &dir->exclude_list_group[i];
3111                 for (j = 0; j < group->nr; j++) {
3112                         pl = &group->pl[j];
3113                         if (i == EXC_DIRS)
3114                                 free((char *)pl->src);
3115                         clear_pattern_list(pl);
3116                 }
3117                 free(group->pl);
3118         }
3119
3120         for (i = 0; i < dir->ignored_nr; i++)
3121                 free(dir->ignored[i]);
3122         for (i = 0; i < dir->nr; i++)
3123                 free(dir->entries[i]);
3124         free(dir->ignored);
3125         free(dir->entries);
3126
3127         stk = dir->exclude_stack;
3128         while (stk) {
3129                 struct exclude_stack *prev = stk->prev;
3130                 free(stk);
3131                 stk = prev;
3132         }
3133         strbuf_release(&dir->basebuf);
3134
3135         dir_init(dir);
3136 }
3137
3138 struct ondisk_untracked_cache {
3139         struct stat_data info_exclude_stat;
3140         struct stat_data excludes_file_stat;
3141         uint32_t dir_flags;
3142 };
3143
3144 #define ouc_offset(x) offsetof(struct ondisk_untracked_cache, x)
3145
3146 struct write_data {
3147         int index;         /* number of written untracked_cache_dir */
3148         struct ewah_bitmap *check_only; /* from untracked_cache_dir */
3149         struct ewah_bitmap *valid;      /* from untracked_cache_dir */
3150         struct ewah_bitmap *sha1_valid; /* set if exclude_sha1 is not null */
3151         struct strbuf out;
3152         struct strbuf sb_stat;
3153         struct strbuf sb_sha1;
3154 };
3155
3156 static void stat_data_to_disk(struct stat_data *to, const struct stat_data *from)
3157 {
3158         to->sd_ctime.sec  = htonl(from->sd_ctime.sec);
3159         to->sd_ctime.nsec = htonl(from->sd_ctime.nsec);
3160         to->sd_mtime.sec  = htonl(from->sd_mtime.sec);
3161         to->sd_mtime.nsec = htonl(from->sd_mtime.nsec);
3162         to->sd_dev        = htonl(from->sd_dev);
3163         to->sd_ino        = htonl(from->sd_ino);
3164         to->sd_uid        = htonl(from->sd_uid);
3165         to->sd_gid        = htonl(from->sd_gid);
3166         to->sd_size       = htonl(from->sd_size);
3167 }
3168
3169 static void write_one_dir(struct untracked_cache_dir *untracked,
3170                           struct write_data *wd)
3171 {
3172         struct stat_data stat_data;
3173         struct strbuf *out = &wd->out;
3174         unsigned char intbuf[16];
3175         unsigned int intlen, value;
3176         int i = wd->index++;
3177
3178         /*
3179          * untracked_nr should be reset whenever valid is clear, but
3180          * for safety..
3181          */
3182         if (!untracked->valid) {
3183                 untracked->untracked_nr = 0;
3184                 untracked->check_only = 0;
3185         }
3186
3187         if (untracked->check_only)
3188                 ewah_set(wd->check_only, i);
3189         if (untracked->valid) {
3190                 ewah_set(wd->valid, i);
3191                 stat_data_to_disk(&stat_data, &untracked->stat_data);
3192                 strbuf_add(&wd->sb_stat, &stat_data, sizeof(stat_data));
3193         }
3194         if (!is_null_oid(&untracked->exclude_oid)) {
3195                 ewah_set(wd->sha1_valid, i);
3196                 strbuf_add(&wd->sb_sha1, untracked->exclude_oid.hash,
3197                            the_hash_algo->rawsz);
3198         }
3199
3200         intlen = encode_varint(untracked->untracked_nr, intbuf);
3201         strbuf_add(out, intbuf, intlen);
3202
3203         /* skip non-recurse directories */
3204         for (i = 0, value = 0; i < untracked->dirs_nr; i++)
3205                 if (untracked->dirs[i]->recurse)
3206                         value++;
3207         intlen = encode_varint(value, intbuf);
3208         strbuf_add(out, intbuf, intlen);
3209
3210         strbuf_add(out, untracked->name, strlen(untracked->name) + 1);
3211
3212         for (i = 0; i < untracked->untracked_nr; i++)
3213                 strbuf_add(out, untracked->untracked[i],
3214                            strlen(untracked->untracked[i]) + 1);
3215
3216         for (i = 0; i < untracked->dirs_nr; i++)
3217                 if (untracked->dirs[i]->recurse)
3218                         write_one_dir(untracked->dirs[i], wd);
3219 }
3220
3221 void write_untracked_extension(struct strbuf *out, struct untracked_cache *untracked)
3222 {
3223         struct ondisk_untracked_cache *ouc;
3224         struct write_data wd;
3225         unsigned char varbuf[16];
3226         int varint_len;
3227         const unsigned hashsz = the_hash_algo->rawsz;
3228
3229         CALLOC_ARRAY(ouc, 1);
3230         stat_data_to_disk(&ouc->info_exclude_stat, &untracked->ss_info_exclude.stat);
3231         stat_data_to_disk(&ouc->excludes_file_stat, &untracked->ss_excludes_file.stat);
3232         ouc->dir_flags = htonl(untracked->dir_flags);
3233
3234         varint_len = encode_varint(untracked->ident.len, varbuf);
3235         strbuf_add(out, varbuf, varint_len);
3236         strbuf_addbuf(out, &untracked->ident);
3237
3238         strbuf_add(out, ouc, sizeof(*ouc));
3239         strbuf_add(out, untracked->ss_info_exclude.oid.hash, hashsz);
3240         strbuf_add(out, untracked->ss_excludes_file.oid.hash, hashsz);
3241         strbuf_add(out, untracked->exclude_per_dir, strlen(untracked->exclude_per_dir) + 1);
3242         FREE_AND_NULL(ouc);
3243
3244         if (!untracked->root) {
3245                 varint_len = encode_varint(0, varbuf);
3246                 strbuf_add(out, varbuf, varint_len);
3247                 return;
3248         }
3249
3250         wd.index      = 0;
3251         wd.check_only = ewah_new();
3252         wd.valid      = ewah_new();
3253         wd.sha1_valid = ewah_new();
3254         strbuf_init(&wd.out, 1024);
3255         strbuf_init(&wd.sb_stat, 1024);
3256         strbuf_init(&wd.sb_sha1, 1024);
3257         write_one_dir(untracked->root, &wd);
3258
3259         varint_len = encode_varint(wd.index, varbuf);
3260         strbuf_add(out, varbuf, varint_len);
3261         strbuf_addbuf(out, &wd.out);
3262         ewah_serialize_strbuf(wd.valid, out);
3263         ewah_serialize_strbuf(wd.check_only, out);
3264         ewah_serialize_strbuf(wd.sha1_valid, out);
3265         strbuf_addbuf(out, &wd.sb_stat);
3266         strbuf_addbuf(out, &wd.sb_sha1);
3267         strbuf_addch(out, '\0'); /* safe guard for string lists */
3268
3269         ewah_free(wd.valid);
3270         ewah_free(wd.check_only);
3271         ewah_free(wd.sha1_valid);
3272         strbuf_release(&wd.out);
3273         strbuf_release(&wd.sb_stat);
3274         strbuf_release(&wd.sb_sha1);
3275 }
3276
3277 static void free_untracked(struct untracked_cache_dir *ucd)
3278 {
3279         int i;
3280         if (!ucd)
3281                 return;
3282         for (i = 0; i < ucd->dirs_nr; i++)
3283                 free_untracked(ucd->dirs[i]);
3284         for (i = 0; i < ucd->untracked_nr; i++)
3285                 free(ucd->untracked[i]);
3286         free(ucd->untracked);
3287         free(ucd->dirs);
3288         free(ucd);
3289 }
3290
3291 void free_untracked_cache(struct untracked_cache *uc)
3292 {
3293         if (uc)
3294                 free_untracked(uc->root);
3295         free(uc);
3296 }
3297
3298 struct read_data {
3299         int index;
3300         struct untracked_cache_dir **ucd;
3301         struct ewah_bitmap *check_only;
3302         struct ewah_bitmap *valid;
3303         struct ewah_bitmap *sha1_valid;
3304         const unsigned char *data;
3305         const unsigned char *end;
3306 };
3307
3308 static void stat_data_from_disk(struct stat_data *to, const unsigned char *data)
3309 {
3310         memcpy(to, data, sizeof(*to));
3311         to->sd_ctime.sec  = ntohl(to->sd_ctime.sec);
3312         to->sd_ctime.nsec = ntohl(to->sd_ctime.nsec);
3313         to->sd_mtime.sec  = ntohl(to->sd_mtime.sec);
3314         to->sd_mtime.nsec = ntohl(to->sd_mtime.nsec);
3315         to->sd_dev        = ntohl(to->sd_dev);
3316         to->sd_ino        = ntohl(to->sd_ino);
3317         to->sd_uid        = ntohl(to->sd_uid);
3318         to->sd_gid        = ntohl(to->sd_gid);
3319         to->sd_size       = ntohl(to->sd_size);
3320 }
3321
3322 static int read_one_dir(struct untracked_cache_dir **untracked_,
3323                         struct read_data *rd)
3324 {
3325         struct untracked_cache_dir ud, *untracked;
3326         const unsigned char *data = rd->data, *end = rd->end;
3327         const unsigned char *eos;
3328         unsigned int value;
3329         int i;
3330
3331         memset(&ud, 0, sizeof(ud));
3332
3333         value = decode_varint(&data);
3334         if (data > end)
3335                 return -1;
3336         ud.recurse         = 1;
3337         ud.untracked_alloc = value;
3338         ud.untracked_nr    = value;
3339         if (ud.untracked_nr)
3340                 ALLOC_ARRAY(ud.untracked, ud.untracked_nr);
3341
3342         ud.dirs_alloc = ud.dirs_nr = decode_varint(&data);
3343         if (data > end)
3344                 return -1;
3345         ALLOC_ARRAY(ud.dirs, ud.dirs_nr);
3346
3347         eos = memchr(data, '\0', end - data);
3348         if (!eos || eos == end)
3349                 return -1;
3350
3351         *untracked_ = untracked = xmalloc(st_add3(sizeof(*untracked), eos - data, 1));
3352         memcpy(untracked, &ud, sizeof(ud));
3353         memcpy(untracked->name, data, eos - data + 1);
3354         data = eos + 1;
3355
3356         for (i = 0; i < untracked->untracked_nr; i++) {
3357                 eos = memchr(data, '\0', end - data);
3358                 if (!eos || eos == end)
3359                         return -1;
3360                 untracked->untracked[i] = xmemdupz(data, eos - data);
3361                 data = eos + 1;
3362         }
3363
3364         rd->ucd[rd->index++] = untracked;
3365         rd->data = data;
3366
3367         for (i = 0; i < untracked->dirs_nr; i++) {
3368                 if (read_one_dir(untracked->dirs + i, rd) < 0)
3369                         return -1;
3370         }
3371         return 0;
3372 }
3373
3374 static void set_check_only(size_t pos, void *cb)
3375 {
3376         struct read_data *rd = cb;
3377         struct untracked_cache_dir *ud = rd->ucd[pos];
3378         ud->check_only = 1;
3379 }
3380
3381 static void read_stat(size_t pos, void *cb)
3382 {
3383         struct read_data *rd = cb;
3384         struct untracked_cache_dir *ud = rd->ucd[pos];
3385         if (rd->data + sizeof(struct stat_data) > rd->end) {
3386                 rd->data = rd->end + 1;
3387                 return;
3388         }
3389         stat_data_from_disk(&ud->stat_data, rd->data);
3390         rd->data += sizeof(struct stat_data);
3391         ud->valid = 1;
3392 }
3393
3394 static void read_oid(size_t pos, void *cb)
3395 {
3396         struct read_data *rd = cb;
3397         struct untracked_cache_dir *ud = rd->ucd[pos];
3398         if (rd->data + the_hash_algo->rawsz > rd->end) {
3399                 rd->data = rd->end + 1;
3400                 return;
3401         }
3402         oidread(&ud->exclude_oid, rd->data);
3403         rd->data += the_hash_algo->rawsz;
3404 }
3405
3406 static void load_oid_stat(struct oid_stat *oid_stat, const unsigned char *data,
3407                           const unsigned char *sha1)
3408 {
3409         stat_data_from_disk(&oid_stat->stat, data);
3410         oidread(&oid_stat->oid, sha1);
3411         oid_stat->valid = 1;
3412 }
3413
3414 struct untracked_cache *read_untracked_extension(const void *data, unsigned long sz)
3415 {
3416         struct untracked_cache *uc;
3417         struct read_data rd;
3418         const unsigned char *next = data, *end = (const unsigned char *)data + sz;
3419         const char *ident;
3420         int ident_len;
3421         ssize_t len;
3422         const char *exclude_per_dir;
3423         const unsigned hashsz = the_hash_algo->rawsz;
3424         const unsigned offset = sizeof(struct ondisk_untracked_cache);
3425         const unsigned exclude_per_dir_offset = offset + 2 * hashsz;
3426
3427         if (sz <= 1 || end[-1] != '\0')
3428                 return NULL;
3429         end--;
3430
3431         ident_len = decode_varint(&next);
3432         if (next + ident_len > end)
3433                 return NULL;
3434         ident = (const char *)next;
3435         next += ident_len;
3436
3437         if (next + exclude_per_dir_offset + 1 > end)
3438                 return NULL;
3439
3440         CALLOC_ARRAY(uc, 1);
3441         strbuf_init(&uc->ident, ident_len);
3442         strbuf_add(&uc->ident, ident, ident_len);
3443         load_oid_stat(&uc->ss_info_exclude,
3444                       next + ouc_offset(info_exclude_stat),
3445                       next + offset);
3446         load_oid_stat(&uc->ss_excludes_file,
3447                       next + ouc_offset(excludes_file_stat),
3448                       next + offset + hashsz);
3449         uc->dir_flags = get_be32(next + ouc_offset(dir_flags));
3450         exclude_per_dir = (const char *)next + exclude_per_dir_offset;
3451         uc->exclude_per_dir = xstrdup(exclude_per_dir);
3452         /* NUL after exclude_per_dir is covered by sizeof(*ouc) */
3453         next += exclude_per_dir_offset + strlen(exclude_per_dir) + 1;
3454         if (next >= end)
3455                 goto done2;
3456
3457         len = decode_varint(&next);
3458         if (next > end || len == 0)
3459                 goto done2;
3460
3461         rd.valid      = ewah_new();
3462         rd.check_only = ewah_new();
3463         rd.sha1_valid = ewah_new();
3464         rd.data       = next;
3465         rd.end        = end;
3466         rd.index      = 0;
3467         ALLOC_ARRAY(rd.ucd, len);
3468
3469         if (read_one_dir(&uc->root, &rd) || rd.index != len)
3470                 goto done;
3471
3472         next = rd.data;
3473         len = ewah_read_mmap(rd.valid, next, end - next);
3474         if (len < 0)
3475                 goto done;
3476
3477         next += len;
3478         len = ewah_read_mmap(rd.check_only, next, end - next);
3479         if (len < 0)
3480                 goto done;
3481
3482         next += len;
3483         len = ewah_read_mmap(rd.sha1_valid, next, end - next);
3484         if (len < 0)
3485                 goto done;
3486
3487         ewah_each_bit(rd.check_only, set_check_only, &rd);
3488         rd.data = next + len;
3489         ewah_each_bit(rd.valid, read_stat, &rd);
3490         ewah_each_bit(rd.sha1_valid, read_oid, &rd);
3491         next = rd.data;
3492
3493 done:
3494         free(rd.ucd);
3495         ewah_free(rd.valid);
3496         ewah_free(rd.check_only);
3497         ewah_free(rd.sha1_valid);
3498 done2:
3499         if (next != end) {
3500                 free_untracked_cache(uc);
3501                 uc = NULL;
3502         }
3503         return uc;
3504 }
3505
3506 static void invalidate_one_directory(struct untracked_cache *uc,
3507                                      struct untracked_cache_dir *ucd)
3508 {
3509         uc->dir_invalidated++;
3510         ucd->valid = 0;
3511         ucd->untracked_nr = 0;
3512 }
3513
3514 /*
3515  * Normally when an entry is added or removed from a directory,
3516  * invalidating that directory is enough. No need to touch its
3517  * ancestors. When a directory is shown as "foo/bar/" in git-status
3518  * however, deleting or adding an entry may have cascading effect.
3519  *
3520  * Say the "foo/bar/file" has become untracked, we need to tell the
3521  * untracked_cache_dir of "foo" that "bar/" is not an untracked
3522  * directory any more (because "bar" is managed by foo as an untracked
3523  * "file").
3524  *
3525  * Similarly, if "foo/bar/file" moves from untracked to tracked and it
3526  * was the last untracked entry in the entire "foo", we should show
3527  * "foo/" instead. Which means we have to invalidate past "bar" up to
3528  * "foo".
3529  *
3530  * This function traverses all directories from root to leaf. If there
3531  * is a chance of one of the above cases happening, we invalidate back
3532  * to root. Otherwise we just invalidate the leaf. There may be a more
3533  * sophisticated way than checking for SHOW_OTHER_DIRECTORIES to
3534  * detect these cases and avoid unnecessary invalidation, for example,
3535  * checking for the untracked entry named "bar/" in "foo", but for now
3536  * stick to something safe and simple.
3537  */
3538 static int invalidate_one_component(struct untracked_cache *uc,
3539                                     struct untracked_cache_dir *dir,
3540                                     const char *path, int len)
3541 {
3542         const char *rest = strchr(path, '/');
3543
3544         if (rest) {
3545                 int component_len = rest - path;
3546                 struct untracked_cache_dir *d =
3547                         lookup_untracked(uc, dir, path, component_len);
3548                 int ret =
3549                         invalidate_one_component(uc, d, rest + 1,
3550                                                  len - (component_len + 1));
3551                 if (ret)
3552                         invalidate_one_directory(uc, dir);
3553                 return ret;
3554         }
3555
3556         invalidate_one_directory(uc, dir);
3557         return uc->dir_flags & DIR_SHOW_OTHER_DIRECTORIES;
3558 }
3559
3560 void untracked_cache_invalidate_path(struct index_state *istate,
3561                                      const char *path, int safe_path)
3562 {
3563         if (!istate->untracked || !istate->untracked->root)
3564                 return;
3565         if (!safe_path && !verify_path(path, 0))
3566                 return;
3567         invalidate_one_component(istate->untracked, istate->untracked->root,
3568                                  path, strlen(path));
3569 }
3570
3571 void untracked_cache_remove_from_index(struct index_state *istate,
3572                                        const char *path)
3573 {
3574         untracked_cache_invalidate_path(istate, path, 1);
3575 }
3576
3577 void untracked_cache_add_to_index(struct index_state *istate,
3578                                   const char *path)
3579 {
3580         untracked_cache_invalidate_path(istate, path, 1);
3581 }
3582
3583 static void connect_wt_gitdir_in_nested(const char *sub_worktree,
3584                                         const char *sub_gitdir)
3585 {
3586         int i;
3587         struct repository subrepo;
3588         struct strbuf sub_wt = STRBUF_INIT;
3589         struct strbuf sub_gd = STRBUF_INIT;
3590
3591         const struct submodule *sub;
3592
3593         /* If the submodule has no working tree, we can ignore it. */
3594         if (repo_init(&subrepo, sub_gitdir, sub_worktree))
3595                 return;
3596
3597         if (repo_read_index(&subrepo) < 0)
3598                 die(_("index file corrupt in repo %s"), subrepo.gitdir);
3599
3600         /* TODO: audit for interaction with sparse-index. */
3601         ensure_full_index(subrepo.index);
3602         for (i = 0; i < subrepo.index->cache_nr; i++) {
3603                 const struct cache_entry *ce = subrepo.index->cache[i];
3604
3605                 if (!S_ISGITLINK(ce->ce_mode))
3606                         continue;
3607
3608                 while (i + 1 < subrepo.index->cache_nr &&
3609                        !strcmp(ce->name, subrepo.index->cache[i + 1]->name))
3610                         /*
3611                          * Skip entries with the same name in different stages
3612                          * to make sure an entry is returned only once.
3613                          */
3614                         i++;
3615
3616                 sub = submodule_from_path(&subrepo, null_oid(), ce->name);
3617                 if (!sub || !is_submodule_active(&subrepo, ce->name))
3618                         /* .gitmodules broken or inactive sub */
3619                         continue;
3620
3621                 strbuf_reset(&sub_wt);
3622                 strbuf_reset(&sub_gd);
3623                 strbuf_addf(&sub_wt, "%s/%s", sub_worktree, sub->path);
3624                 strbuf_addf(&sub_gd, "%s/modules/%s", sub_gitdir, sub->name);
3625
3626                 connect_work_tree_and_git_dir(sub_wt.buf, sub_gd.buf, 1);
3627         }
3628         strbuf_release(&sub_wt);
3629         strbuf_release(&sub_gd);
3630         repo_clear(&subrepo);
3631 }
3632
3633 void connect_work_tree_and_git_dir(const char *work_tree_,
3634                                    const char *git_dir_,
3635                                    int recurse_into_nested)
3636 {
3637         struct strbuf gitfile_sb = STRBUF_INIT;
3638         struct strbuf cfg_sb = STRBUF_INIT;
3639         struct strbuf rel_path = STRBUF_INIT;
3640         char *git_dir, *work_tree;
3641
3642         /* Prepare .git file */
3643         strbuf_addf(&gitfile_sb, "%s/.git", work_tree_);
3644         if (safe_create_leading_directories_const(gitfile_sb.buf))
3645                 die(_("could not create directories for %s"), gitfile_sb.buf);
3646
3647         /* Prepare config file */
3648         strbuf_addf(&cfg_sb, "%s/config", git_dir_);
3649         if (safe_create_leading_directories_const(cfg_sb.buf))
3650                 die(_("could not create directories for %s"), cfg_sb.buf);
3651
3652         git_dir = real_pathdup(git_dir_, 1);
3653         work_tree = real_pathdup(work_tree_, 1);
3654
3655         /* Write .git file */
3656         write_file(gitfile_sb.buf, "gitdir: %s",
3657                    relative_path(git_dir, work_tree, &rel_path));
3658         /* Update core.worktree setting */
3659         git_config_set_in_file(cfg_sb.buf, "core.worktree",
3660                                relative_path(work_tree, git_dir, &rel_path));
3661
3662         strbuf_release(&gitfile_sb);
3663         strbuf_release(&cfg_sb);
3664         strbuf_release(&rel_path);
3665
3666         if (recurse_into_nested)
3667                 connect_wt_gitdir_in_nested(work_tree, git_dir);
3668
3669         free(work_tree);
3670         free(git_dir);
3671 }
3672
3673 /*
3674  * Migrate the git directory of the given path from old_git_dir to new_git_dir.
3675  */
3676 void relocate_gitdir(const char *path, const char *old_git_dir, const char *new_git_dir)
3677 {
3678         if (rename(old_git_dir, new_git_dir) < 0)
3679                 die_errno(_("could not migrate git directory from '%s' to '%s'"),
3680                         old_git_dir, new_git_dir);
3681
3682         connect_work_tree_and_git_dir(path, new_git_dir, 0);
3683 }