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