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