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