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