attr.c: replace home_config_paths() with xdg_config_home()
[git/git.git] / dir.c
CommitLineData
453ec4bd
LT
1/*
2 * This handles recursive filename detection with exclude
3 * files, index knowledge etc..
4 *
95a68344
AS
5 * See Documentation/technical/api-directory-listing.txt
6 *
453ec4bd
LT
7 * Copyright (C) Linus Torvalds, 2005-2006
8 * Junio Hamano, 2005-2006
9 */
453ec4bd
LT
10#include "cache.h"
11#include "dir.h"
09595258 12#include "refs.h"
237ec6e4 13#include "wildmatch.h"
64acde94 14#include "pathspec.h"
453ec4bd 15
9fc42d60
LT
16struct path_simplify {
17 int len;
18 const char *path;
19};
20
defd7c7b
KB
21/*
22 * Tells read_directory_recursive how a file or directory should be treated.
23 * Values are ordered by significance, e.g. if a directory contains both
24 * excluded and untracked files, it is listed as untracked because
25 * path_untracked > path_excluded.
26 */
27enum path_treatment {
28 path_none = 0,
29 path_recurse,
30 path_excluded,
31 path_untracked
32};
33
34static enum path_treatment read_directory_recursive(struct dir_struct *dir,
35 const char *path, int len,
09595258 36 int check_only, const struct path_simplify *simplify);
caa6b782 37static int get_dtype(struct dirent *de, const char *path, int len);
09595258 38
8cf2a84e
JJ
39/* helper string functions with support for the ignore_case flag */
40int strcmp_icase(const char *a, const char *b)
41{
42 return ignore_case ? strcasecmp(a, b) : strcmp(a, b);
43}
44
45int strncmp_icase(const char *a, const char *b, size_t count)
46{
47 return ignore_case ? strncasecmp(a, b, count) : strncmp(a, b, count);
48}
49
50int fnmatch_icase(const char *pattern, const char *string, int flags)
51{
eb07894f
NTND
52 return wildmatch(pattern, string,
53 flags | (ignore_case ? WM_CASEFOLD : 0),
54 NULL);
8cf2a84e
JJ
55}
56
1f26ce61
CB
57int git_fnmatch(const struct pathspec_item *item,
58 const char *pattern, const char *string,
59 int prefix)
5d74762d 60{
5d74762d 61 if (prefix > 0) {
93d93537 62 if (ps_strncmp(item, pattern, string, prefix))
eb07894f 63 return WM_NOMATCH;
5d74762d
NTND
64 pattern += prefix;
65 string += prefix;
66 }
bd30c2e4 67 if (item->flags & PATHSPEC_ONESTAR) {
8c6abbcd
NTND
68 int pattern_len = strlen(++pattern);
69 int string_len = strlen(string);
70 return string_len < pattern_len ||
93d93537
NTND
71 ps_strcmp(item, pattern,
72 string + string_len - pattern_len);
8c6abbcd 73 }
bd30c2e4 74 if (item->magic & PATHSPEC_GLOB)
93d93537
NTND
75 return wildmatch(pattern, string,
76 WM_PATHNAME |
77 (item->magic & PATHSPEC_ICASE ? WM_CASEFOLD : 0),
78 NULL);
bd30c2e4
NTND
79 else
80 /* wildmatch has not learned no FNM_PATHNAME mode yet */
eb07894f
NTND
81 return wildmatch(pattern, string,
82 item->magic & PATHSPEC_ICASE ? WM_CASEFOLD : 0,
83 NULL);
5d74762d
NTND
84}
85
0b6e56df
JH
86static int fnmatch_icase_mem(const char *pattern, int patternlen,
87 const char *string, int stringlen,
88 int flags)
89{
90 int match_status;
91 struct strbuf pat_buf = STRBUF_INIT;
92 struct strbuf str_buf = STRBUF_INIT;
93 const char *use_pat = pattern;
94 const char *use_str = string;
95
96 if (pattern[patternlen]) {
97 strbuf_add(&pat_buf, pattern, patternlen);
98 use_pat = pat_buf.buf;
99 }
100 if (string[stringlen]) {
101 strbuf_add(&str_buf, string, stringlen);
102 use_str = str_buf.buf;
103 }
104
f30366b2
JH
105 if (ignore_case)
106 flags |= WM_CASEFOLD;
107 match_status = wildmatch(use_pat, use_str, flags, NULL);
0b6e56df
JH
108
109 strbuf_release(&pat_buf);
110 strbuf_release(&str_buf);
111
112 return match_status;
113}
114
827f4d6c 115static size_t common_prefix_len(const struct pathspec *pathspec)
3c6a370b 116{
827f4d6c 117 int n;
4a085b16 118 size_t max = 0;
3c6a370b 119
93d93537
NTND
120 /*
121 * ":(icase)path" is treated as a pathspec full of
122 * wildcard. In other words, only prefix is considered common
123 * prefix. If the pathspec is abc/foo abc/bar, running in
124 * subdir xyz, the common prefix is still xyz, not xuz/abc as
125 * in non-:(icase).
126 */
5c6933d2
NTND
127 GUARD_PATHSPEC(pathspec,
128 PATHSPEC_FROMTOP |
129 PATHSPEC_MAXDEPTH |
bd30c2e4 130 PATHSPEC_LITERAL |
93d93537 131 PATHSPEC_GLOB |
ef79b1f8
NTND
132 PATHSPEC_ICASE |
133 PATHSPEC_EXCLUDE);
4a085b16 134
827f4d6c 135 for (n = 0; n < pathspec->nr; n++) {
93d93537 136 size_t i = 0, len = 0, item_len;
ef79b1f8
NTND
137 if (pathspec->items[n].magic & PATHSPEC_EXCLUDE)
138 continue;
93d93537
NTND
139 if (pathspec->items[n].magic & PATHSPEC_ICASE)
140 item_len = pathspec->items[n].prefix;
141 else
142 item_len = pathspec->items[n].nowildcard_len;
143 while (i < item_len && (n == 0 || i < max)) {
827f4d6c
NTND
144 char c = pathspec->items[n].match[i];
145 if (c != pathspec->items[0].match[i])
4a085b16
JH
146 break;
147 if (c == '/')
148 len = i + 1;
827f4d6c 149 i++;
4a085b16 150 }
827f4d6c 151 if (n == 0 || len < max) {
4a085b16
JH
152 max = len;
153 if (!max)
154 break;
155 }
3c6a370b 156 }
4a085b16 157 return max;
3c6a370b
LT
158}
159
f950eb95
CB
160/*
161 * Returns a copy of the longest leading path common among all
162 * pathspecs.
163 */
827f4d6c 164char *common_prefix(const struct pathspec *pathspec)
f950eb95
CB
165{
166 unsigned long len = common_prefix_len(pathspec);
167
827f4d6c 168 return len ? xmemdupz(pathspec->items[0].match, len) : NULL;
f950eb95
CB
169}
170
7327d3d1 171int fill_directory(struct dir_struct *dir, const struct pathspec *pathspec)
1d8842d9 172{
4a085b16 173 size_t len;
1d8842d9
LT
174
175 /*
176 * Calculate common prefix for the pathspec, and
177 * use that to optimize the directory walk
178 */
4a085b16 179 len = common_prefix_len(pathspec);
1d8842d9
LT
180
181 /* Read the directory and prune it */
b3920bbd 182 read_directory(dir, pathspec->nr ? pathspec->_raw[0] : "", len, pathspec);
dba2e203 183 return len;
1d8842d9
LT
184}
185
bc96cc87
NTND
186int within_depth(const char *name, int namelen,
187 int depth, int max_depth)
188{
189 const char *cp = name, *cpe = name + namelen;
190
191 while (cp < cpe) {
192 if (*cp++ != '/')
193 continue;
194 depth++;
195 if (depth > max_depth)
196 return 0;
197 }
198 return 1;
199}
200
42b0874a 201#define DO_MATCH_EXCLUDE 1
68690fdd 202#define DO_MATCH_DIRECTORY 2
42b0874a 203
61cf2820
NTND
204/*
205 * Does 'match' match the given name?
206 * A match is found if
207 *
208 * (1) the 'match' string is leading directory of 'name', or
209 * (2) the 'match' string is a wildcard and matches 'name', or
210 * (3) the 'match' string is exactly the same as 'name'.
211 *
212 * and the return value tells which case it was.
213 *
214 * It returns 0 when there is no match.
215 */
216static int match_pathspec_item(const struct pathspec_item *item, int prefix,
42b0874a 217 const char *name, int namelen, unsigned flags)
61cf2820
NTND
218{
219 /* name/namelen has prefix cut off by caller */
220 const char *match = item->match + prefix;
221 int matchlen = item->len - prefix;
222
93d93537
NTND
223 /*
224 * The normal call pattern is:
225 * 1. prefix = common_prefix_len(ps);
226 * 2. prune something, or fill_directory
854b0959 227 * 3. match_pathspec()
93d93537
NTND
228 *
229 * 'prefix' at #1 may be shorter than the command's prefix and
230 * it's ok for #2 to match extra files. Those extras will be
231 * trimmed at #3.
232 *
233 * Suppose the pathspec is 'foo' and '../bar' running from
234 * subdir 'xyz'. The common prefix at #1 will be empty, thanks
235 * to "../". We may have xyz/foo _and_ XYZ/foo after #2. The
236 * user does not want XYZ/foo, only the "foo" part should be
237 * case-insensitive. We need to filter out XYZ/foo here. In
238 * other words, we do not trust the caller on comparing the
239 * prefix part when :(icase) is involved. We do exact
240 * comparison ourselves.
241 *
242 * Normally the caller (common_prefix_len() in fact) does
243 * _exact_ matching on name[-prefix+1..-1] and we do not need
244 * to check that part. Be defensive and check it anyway, in
245 * case common_prefix_len is changed, or a new caller is
246 * introduced that does not use common_prefix_len.
247 *
248 * If the penalty turns out too high when prefix is really
249 * long, maybe change it to
250 * strncmp(match, name, item->prefix - prefix)
251 */
252 if (item->prefix && (item->magic & PATHSPEC_ICASE) &&
253 strncmp(item->match, name - prefix, item->prefix))
254 return 0;
255
61cf2820
NTND
256 /* If the match was just the prefix, we matched */
257 if (!*match)
258 return MATCHED_RECURSIVELY;
259
93d93537 260 if (matchlen <= namelen && !ps_strncmp(item, match, name, matchlen)) {
61cf2820
NTND
261 if (matchlen == namelen)
262 return MATCHED_EXACTLY;
263
264 if (match[matchlen-1] == '/' || name[matchlen] == '/')
265 return MATCHED_RECURSIVELY;
68690fdd
NTND
266 } else if ((flags & DO_MATCH_DIRECTORY) &&
267 match[matchlen - 1] == '/' &&
268 namelen == matchlen - 1 &&
269 !ps_strncmp(item, match, name, namelen))
270 return MATCHED_EXACTLY;
61cf2820 271
5d74762d 272 if (item->nowildcard_len < item->len &&
bd30c2e4 273 !git_fnmatch(item, match, name,
8c6abbcd 274 item->nowildcard_len - prefix))
61cf2820
NTND
275 return MATCHED_FNMATCH;
276
277 return 0;
278}
279
280/*
52ed1894
AS
281 * Given a name and a list of pathspecs, returns the nature of the
282 * closest (i.e. most specific) match of the name to any of the
283 * pathspecs.
284 *
285 * The caller typically calls this multiple times with the same
286 * pathspec and seen[] array but with different name/namelen
287 * (e.g. entries from the index) and is interested in seeing if and
288 * how each pathspec matches all the names it calls this function
289 * with. A mark is left in the seen[] array for each pathspec element
290 * indicating the closest type of match that element achieved, so if
291 * seen[n] remains zero after multiple invocations, that means the nth
292 * pathspec did not match any names, which could indicate that the
293 * user mistyped the nth pathspec.
61cf2820 294 */
854b0959
NTND
295static int do_match_pathspec(const struct pathspec *ps,
296 const char *name, int namelen,
297 int prefix, char *seen,
42b0874a 298 unsigned flags)
61cf2820 299{
42b0874a 300 int i, retval = 0, exclude = flags & DO_MATCH_EXCLUDE;
61cf2820 301
5c6933d2
NTND
302 GUARD_PATHSPEC(ps,
303 PATHSPEC_FROMTOP |
304 PATHSPEC_MAXDEPTH |
bd30c2e4 305 PATHSPEC_LITERAL |
93d93537 306 PATHSPEC_GLOB |
ef79b1f8
NTND
307 PATHSPEC_ICASE |
308 PATHSPEC_EXCLUDE);
8f4f8f45 309
61cf2820 310 if (!ps->nr) {
6330a171
NTND
311 if (!ps->recursive ||
312 !(ps->magic & PATHSPEC_MAXDEPTH) ||
313 ps->max_depth == -1)
61cf2820
NTND
314 return MATCHED_RECURSIVELY;
315
316 if (within_depth(name, namelen, 0, ps->max_depth))
317 return MATCHED_EXACTLY;
318 else
319 return 0;
320 }
321
322 name += prefix;
323 namelen -= prefix;
324
325 for (i = ps->nr - 1; i >= 0; i--) {
326 int how;
ef79b1f8
NTND
327
328 if ((!exclude && ps->items[i].magic & PATHSPEC_EXCLUDE) ||
329 ( exclude && !(ps->items[i].magic & PATHSPEC_EXCLUDE)))
330 continue;
331
61cf2820
NTND
332 if (seen && seen[i] == MATCHED_EXACTLY)
333 continue;
ef79b1f8
NTND
334 /*
335 * Make exclude patterns optional and never report
336 * "pathspec ':(exclude)foo' matches no files"
337 */
338 if (seen && ps->items[i].magic & PATHSPEC_EXCLUDE)
339 seen[i] = MATCHED_FNMATCH;
42b0874a
NTND
340 how = match_pathspec_item(ps->items+i, prefix, name,
341 namelen, flags);
6330a171
NTND
342 if (ps->recursive &&
343 (ps->magic & PATHSPEC_MAXDEPTH) &&
344 ps->max_depth != -1 &&
61cf2820
NTND
345 how && how != MATCHED_FNMATCH) {
346 int len = ps->items[i].len;
347 if (name[len] == '/')
348 len++;
349 if (within_depth(name+len, namelen-len, 0, ps->max_depth))
350 how = MATCHED_EXACTLY;
351 else
352 how = 0;
353 }
354 if (how) {
355 if (retval < how)
356 retval = how;
357 if (seen && seen[i] < how)
358 seen[i] = how;
359 }
360 }
361 return retval;
362}
363
854b0959
NTND
364int match_pathspec(const struct pathspec *ps,
365 const char *name, int namelen,
ae8d0824 366 int prefix, char *seen, int is_dir)
ef79b1f8
NTND
367{
368 int positive, negative;
ae8d0824 369 unsigned flags = is_dir ? DO_MATCH_DIRECTORY : 0;
42b0874a
NTND
370 positive = do_match_pathspec(ps, name, namelen,
371 prefix, seen, flags);
ef79b1f8
NTND
372 if (!(ps->magic & PATHSPEC_EXCLUDE) || !positive)
373 return positive;
42b0874a
NTND
374 negative = do_match_pathspec(ps, name, namelen,
375 prefix, seen,
376 flags | DO_MATCH_EXCLUDE);
ef79b1f8
NTND
377 return negative ? 0 : positive;
378}
379
fcd631ed
NTND
380/*
381 * Return the length of the "simple" part of a path match limiter.
382 */
87323bda 383int simple_length(const char *match)
fcd631ed
NTND
384{
385 int len = -1;
386
387 for (;;) {
388 unsigned char c = *match++;
389 len++;
390 if (c == '\0' || is_glob_special(c))
391 return len;
392 }
393}
394
87323bda 395int no_wildcard(const char *string)
68492fc7 396{
fcd631ed 397 return string[simple_length(string)] == '\0';
68492fc7
LK
398}
399
82dce998
NTND
400void parse_exclude_pattern(const char **pattern,
401 int *patternlen,
402 int *flags,
403 int *nowildcardlen)
84460eec
NTND
404{
405 const char *p = *pattern;
406 size_t i, len;
407
408 *flags = 0;
409 if (*p == '!') {
410 *flags |= EXC_FLAG_NEGATIVE;
411 p++;
412 }
413 len = strlen(p);
414 if (len && p[len - 1] == '/') {
415 len--;
416 *flags |= EXC_FLAG_MUSTBEDIR;
417 }
418 for (i = 0; i < len; i++) {
419 if (p[i] == '/')
420 break;
421 }
422 if (i == len)
423 *flags |= EXC_FLAG_NODIR;
424 *nowildcardlen = simple_length(p);
425 /*
426 * we should have excluded the trailing slash from 'p' too,
427 * but that's one more allocation. Instead just make sure
428 * nowildcardlen does not exceed real patternlen
429 */
430 if (*nowildcardlen > len)
431 *nowildcardlen = len;
432 if (*p == '*' && no_wildcard(p + 1))
433 *flags |= EXC_FLAG_ENDSWITH;
434 *pattern = p;
435 *patternlen = len;
436}
437
453ec4bd 438void add_exclude(const char *string, const char *base,
c04318e4 439 int baselen, struct exclude_list *el, int srcpos)
453ec4bd 440{
d6b8fc30 441 struct exclude *x;
84460eec
NTND
442 int patternlen;
443 int flags;
444 int nowildcardlen;
453ec4bd 445
84460eec
NTND
446 parse_exclude_pattern(&string, &patternlen, &flags, &nowildcardlen);
447 if (flags & EXC_FLAG_MUSTBEDIR) {
d6b8fc30 448 char *s;
84460eec 449 x = xmalloc(sizeof(*x) + patternlen + 1);
4b25d091 450 s = (char *)(x+1);
84460eec
NTND
451 memcpy(s, string, patternlen);
452 s[patternlen] = '\0';
d6b8fc30 453 x->pattern = s;
d6b8fc30
JH
454 } else {
455 x = xmalloc(sizeof(*x));
456 x->pattern = string;
457 }
84460eec
NTND
458 x->patternlen = patternlen;
459 x->nowildcardlen = nowildcardlen;
453ec4bd
LT
460 x->base = base;
461 x->baselen = baselen;
d6b8fc30 462 x->flags = flags;
c04318e4 463 x->srcpos = srcpos;
840fc334
AS
464 ALLOC_GROW(el->excludes, el->nr + 1, el->alloc);
465 el->excludes[el->nr++] = x;
c04318e4 466 x->el = el;
453ec4bd
LT
467}
468
c28b3d6e
NTND
469static void *read_skip_worktree_file_from_index(const char *path, size_t *size)
470{
471 int pos, len;
472 unsigned long sz;
473 enum object_type type;
474 void *data;
c28b3d6e
NTND
475
476 len = strlen(path);
71261027 477 pos = cache_name_pos(path, len);
c28b3d6e
NTND
478 if (pos < 0)
479 return NULL;
71261027 480 if (!ce_skip_worktree(active_cache[pos]))
c28b3d6e 481 return NULL;
71261027 482 data = read_sha1_file(active_cache[pos]->sha1, &type, &sz);
c28b3d6e
NTND
483 if (!data || type != OBJ_BLOB) {
484 free(data);
485 return NULL;
486 }
487 *size = xsize_t(sz);
488 return data;
489}
490
f6198812
AS
491/*
492 * Frees memory within el which was allocated for exclude patterns and
493 * the file buffer. Does not free el itself.
494 */
495void clear_exclude_list(struct exclude_list *el)
0fd0e241
NTND
496{
497 int i;
498
499 for (i = 0; i < el->nr; i++)
500 free(el->excludes[i]);
501 free(el->excludes);
c082df24 502 free(el->filebuf);
0fd0e241
NTND
503
504 el->nr = 0;
505 el->excludes = NULL;
c082df24 506 el->filebuf = NULL;
0fd0e241
NTND
507}
508
7e2e4b37 509static void trim_trailing_spaces(char *buf)
16402b99 510{
e61a6c1d
PB
511 char *p, *last_space = NULL;
512
513 for (p = buf; *p; p++)
514 switch (*p) {
515 case ' ':
516 if (!last_space)
517 last_space = p;
518 break;
519 case '\\':
520 p++;
521 if (!*p)
522 return;
523 /* fallthrough */
524 default:
525 last_space = NULL;
526 }
527
528 if (last_space)
529 *last_space = '\0';
16402b99
NTND
530}
531
cb097534
NTND
532int add_excludes_from_file_to_list(const char *fname,
533 const char *base,
534 int baselen,
840fc334 535 struct exclude_list *el,
cb097534 536 int check_index)
453ec4bd 537{
c470701a 538 struct stat st;
c04318e4 539 int fd, i, lineno = 1;
9d14017a 540 size_t size = 0;
453ec4bd
LT
541 char *buf, *entry;
542
543 fd = open(fname, O_RDONLY);
c28b3d6e 544 if (fd < 0 || fstat(fd, &st) < 0) {
69660731 545 if (errno != ENOENT)
55b38a48 546 warn_on_inaccessible(fname);
c28b3d6e
NTND
547 if (0 <= fd)
548 close(fd);
549 if (!check_index ||
550 (buf = read_skip_worktree_file_from_index(fname, &size)) == NULL)
551 return -1;
45d76f17
NTND
552 if (size == 0) {
553 free(buf);
554 return 0;
555 }
556 if (buf[size-1] != '\n') {
557 buf = xrealloc(buf, size+1);
558 buf[size++] = '\n';
559 }
d961baa8 560 } else {
c28b3d6e
NTND
561 size = xsize_t(st.st_size);
562 if (size == 0) {
563 close(fd);
564 return 0;
565 }
45d76f17 566 buf = xmalloc(size+1);
c28b3d6e 567 if (read_in_full(fd, buf, size) != size) {
45d76f17 568 free(buf);
c28b3d6e
NTND
569 close(fd);
570 return -1;
571 }
45d76f17 572 buf[size++] = '\n';
c28b3d6e 573 close(fd);
6ba78238 574 }
453ec4bd 575
c082df24 576 el->filebuf = buf;
453ec4bd 577 entry = buf;
45d76f17
NTND
578 for (i = 0; i < size; i++) {
579 if (buf[i] == '\n') {
453ec4bd
LT
580 if (entry != buf + i && entry[0] != '#') {
581 buf[i - (i && buf[i-1] == '\r')] = 0;
7e2e4b37 582 trim_trailing_spaces(entry);
c04318e4 583 add_exclude(entry, base, baselen, el, lineno);
453ec4bd 584 }
c04318e4 585 lineno++;
453ec4bd
LT
586 entry = buf + i + 1;
587 }
588 }
589 return 0;
453ec4bd
LT
590}
591
c04318e4
AS
592struct exclude_list *add_exclude_list(struct dir_struct *dir,
593 int group_type, const char *src)
c082df24
AS
594{
595 struct exclude_list *el;
596 struct exclude_list_group *group;
597
598 group = &dir->exclude_list_group[group_type];
599 ALLOC_GROW(group->el, group->nr + 1, group->alloc);
600 el = &group->el[group->nr++];
601 memset(el, 0, sizeof(*el));
c04318e4 602 el->src = src;
c082df24
AS
603 return el;
604}
605
606/*
607 * Used to set up core.excludesfile and .git/info/exclude lists.
608 */
453ec4bd
LT
609void add_excludes_from_file(struct dir_struct *dir, const char *fname)
610{
c082df24 611 struct exclude_list *el;
c04318e4 612 el = add_exclude_list(dir, EXC_FILE, fname);
c082df24 613 if (add_excludes_from_file_to_list(fname, "", 0, el, 0) < 0)
453ec4bd
LT
614 die("cannot use %s as an exclude file", fname);
615}
616
82dce998
NTND
617int match_basename(const char *basename, int basenamelen,
618 const char *pattern, int prefix, int patternlen,
619 int flags)
593cb880
NTND
620{
621 if (prefix == patternlen) {
0b6e56df
JH
622 if (patternlen == basenamelen &&
623 !strncmp_icase(pattern, basename, basenamelen))
593cb880
NTND
624 return 1;
625 } else if (flags & EXC_FLAG_ENDSWITH) {
0b6e56df 626 /* "*literal" matching against "fooliteral" */
593cb880 627 if (patternlen - 1 <= basenamelen &&
0b6e56df
JH
628 !strncmp_icase(pattern + 1,
629 basename + basenamelen - (patternlen - 1),
630 patternlen - 1))
593cb880
NTND
631 return 1;
632 } else {
0b6e56df
JH
633 if (fnmatch_icase_mem(pattern, patternlen,
634 basename, basenamelen,
635 0) == 0)
593cb880
NTND
636 return 1;
637 }
638 return 0;
639}
640
82dce998
NTND
641int match_pathname(const char *pathname, int pathlen,
642 const char *base, int baselen,
643 const char *pattern, int prefix, int patternlen,
644 int flags)
b5592632
NTND
645{
646 const char *name;
647 int namelen;
648
649 /*
650 * match with FNM_PATHNAME; the pattern has base implicitly
651 * in front of it.
652 */
653 if (*pattern == '/') {
654 pattern++;
982ac873 655 patternlen--;
b5592632
NTND
656 prefix--;
657 }
658
659 /*
660 * baselen does not count the trailing slash. base[] may or
661 * may not end with a trailing slash though.
662 */
663 if (pathlen < baselen + 1 ||
664 (baselen && pathname[baselen] != '/') ||
665 strncmp_icase(pathname, base, baselen))
666 return 0;
667
668 namelen = baselen ? pathlen - baselen - 1 : pathlen;
669 name = pathname + pathlen - namelen;
670
671 if (prefix) {
672 /*
673 * if the non-wildcard part is longer than the
674 * remaining pathname, surely it cannot match.
675 */
676 if (prefix > namelen)
677 return 0;
678
679 if (strncmp_icase(pattern, name, prefix))
680 return 0;
681 pattern += prefix;
ab3aebc1 682 patternlen -= prefix;
b5592632
NTND
683 name += prefix;
684 namelen -= prefix;
ab3aebc1
JK
685
686 /*
687 * If the whole pattern did not have a wildcard,
688 * then our prefix match is all we need; we
689 * do not need to call fnmatch at all.
690 */
691 if (!patternlen && !namelen)
692 return 1;
b5592632
NTND
693 }
694
ab3aebc1
JK
695 return fnmatch_icase_mem(pattern, patternlen,
696 name, namelen,
f30366b2 697 WM_PATHNAME) == 0;
b5592632
NTND
698}
699
578cd7c3
AS
700/*
701 * Scan the given exclude list in reverse to see whether pathname
702 * should be ignored. The first match (i.e. the last on the list), if
703 * any, determines the fate. Returns the exclude_list element which
704 * matched, or NULL for undecided.
453ec4bd 705 */
578cd7c3
AS
706static struct exclude *last_exclude_matching_from_list(const char *pathname,
707 int pathlen,
708 const char *basename,
709 int *dtype,
710 struct exclude_list *el)
453ec4bd
LT
711{
712 int i;
713
35a94d44 714 if (!el->nr)
578cd7c3 715 return NULL; /* undefined */
d6b8fc30 716
35a94d44
NTND
717 for (i = el->nr - 1; 0 <= i; i--) {
718 struct exclude *x = el->excludes[i];
b5592632 719 const char *exclude = x->pattern;
b5592632 720 int prefix = x->nowildcardlen;
35a94d44
NTND
721
722 if (x->flags & EXC_FLAG_MUSTBEDIR) {
723 if (*dtype == DT_UNKNOWN)
724 *dtype = get_dtype(NULL, pathname, pathlen);
725 if (*dtype != DT_DIR)
726 continue;
727 }
d6b8fc30 728
35a94d44 729 if (x->flags & EXC_FLAG_NODIR) {
593cb880
NTND
730 if (match_basename(basename,
731 pathlen - (basename - pathname),
732 exclude, prefix, x->patternlen,
733 x->flags))
578cd7c3 734 return x;
35a94d44
NTND
735 continue;
736 }
737
b5592632
NTND
738 assert(x->baselen == 0 || x->base[x->baselen - 1] == '/');
739 if (match_pathname(pathname, pathlen,
740 x->base, x->baselen ? x->baselen - 1 : 0,
741 exclude, prefix, x->patternlen, x->flags))
578cd7c3 742 return x;
453ec4bd 743 }
578cd7c3
AS
744 return NULL; /* undecided */
745}
746
747/*
748 * Scan the list and let the last match determine the fate.
749 * Return 1 for exclude, 0 for include and -1 for undecided.
750 */
751int is_excluded_from_list(const char *pathname,
752 int pathlen, const char *basename, int *dtype,
753 struct exclude_list *el)
754{
755 struct exclude *exclude;
756 exclude = last_exclude_matching_from_list(pathname, pathlen, basename, dtype, el);
757 if (exclude)
758 return exclude->flags & EXC_FLAG_NEGATIVE ? 0 : 1;
453ec4bd
LT
759 return -1; /* undecided */
760}
761
46aa2f95
KB
762static struct exclude *last_exclude_matching_from_lists(struct dir_struct *dir,
763 const char *pathname, int pathlen, const char *basename,
764 int *dtype_p)
765{
766 int i, j;
767 struct exclude_list_group *group;
768 struct exclude *exclude;
769 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
770 group = &dir->exclude_list_group[i];
771 for (j = group->nr - 1; j >= 0; j--) {
772 exclude = last_exclude_matching_from_list(
773 pathname, pathlen, basename, dtype_p,
774 &group->el[j]);
775 if (exclude)
776 return exclude;
777 }
778 }
779 return NULL;
780}
781
6cd5c582
KB
782/*
783 * Loads the per-directory exclude list for the substring of base
784 * which has a char length of baselen.
785 */
786static void prep_exclude(struct dir_struct *dir, const char *base, int baselen)
787{
788 struct exclude_list_group *group;
789 struct exclude_list *el;
790 struct exclude_stack *stk = NULL;
791 int current;
792
6cd5c582
KB
793 group = &dir->exclude_list_group[EXC_DIRS];
794
d961baa8
NTND
795 /*
796 * Pop the exclude lists from the EXCL_DIRS exclude_list_group
6cd5c582 797 * which originate from directories not in the prefix of the
d961baa8
NTND
798 * path being checked.
799 */
6cd5c582
KB
800 while ((stk = dir->exclude_stack) != NULL) {
801 if (stk->baselen <= baselen &&
aceb9429 802 !strncmp(dir->basebuf.buf, base, stk->baselen))
6cd5c582
KB
803 break;
804 el = &group->el[dir->exclude_stack->exclude_ix];
805 dir->exclude_stack = stk->prev;
95c6f271 806 dir->exclude = NULL;
aceb9429 807 free((char *)el->src); /* see strbuf_detach() below */
6cd5c582
KB
808 clear_exclude_list(el);
809 free(stk);
810 group->nr--;
811 }
812
95c6f271
KB
813 /* Skip traversing into sub directories if the parent is excluded */
814 if (dir->exclude)
815 return;
816
aceb9429
NTND
817 /*
818 * Lazy initialization. All call sites currently just
819 * memset(dir, 0, sizeof(*dir)) before use. Changing all of
820 * them seems lots of work for little benefit.
821 */
822 if (!dir->basebuf.buf)
823 strbuf_init(&dir->basebuf, PATH_MAX);
824
6cd5c582
KB
825 /* Read from the parent directories and push them down. */
826 current = stk ? stk->baselen : -1;
aceb9429 827 strbuf_setlen(&dir->basebuf, current < 0 ? 0 : current);
6cd5c582 828 while (current < baselen) {
6cd5c582
KB
829 const char *cp;
830
03e11a71 831 stk = xcalloc(1, sizeof(*stk));
6cd5c582
KB
832 if (current < 0) {
833 cp = base;
834 current = 0;
d961baa8 835 } else {
6cd5c582
KB
836 cp = strchr(base + current + 1, '/');
837 if (!cp)
838 die("oops in prep_exclude");
839 cp++;
840 }
841 stk->prev = dir->exclude_stack;
842 stk->baselen = cp - base;
95c6f271
KB
843 stk->exclude_ix = group->nr;
844 el = add_exclude_list(dir, EXC_DIRS, NULL);
aceb9429
NTND
845 strbuf_add(&dir->basebuf, base + current, stk->baselen - current);
846 assert(stk->baselen == dir->basebuf.len);
95c6f271
KB
847
848 /* Abort if the directory is excluded */
849 if (stk->baselen) {
850 int dt = DT_DIR;
aceb9429 851 dir->basebuf.buf[stk->baselen - 1] = 0;
95c6f271 852 dir->exclude = last_exclude_matching_from_lists(dir,
aceb9429
NTND
853 dir->basebuf.buf, stk->baselen - 1,
854 dir->basebuf.buf + current, &dt);
855 dir->basebuf.buf[stk->baselen - 1] = '/';
c3c327de
KB
856 if (dir->exclude &&
857 dir->exclude->flags & EXC_FLAG_NEGATIVE)
858 dir->exclude = NULL;
95c6f271 859 if (dir->exclude) {
95c6f271
KB
860 dir->exclude_stack = stk;
861 return;
862 }
863 }
864
aceb9429
NTND
865 /* Try to read per-directory file */
866 if (dir->exclude_per_dir) {
95c6f271
KB
867 /*
868 * dir->basebuf gets reused by the traversal, but we
869 * need fname to remain unchanged to ensure the src
870 * member of each struct exclude correctly
871 * back-references its source file. Other invocations
872 * of add_exclude_list provide stable strings, so we
aceb9429 873 * strbuf_detach() and free() here in the caller.
95c6f271 874 */
aceb9429
NTND
875 struct strbuf sb = STRBUF_INIT;
876 strbuf_addbuf(&sb, &dir->basebuf);
877 strbuf_addstr(&sb, dir->exclude_per_dir);
878 el->src = strbuf_detach(&sb, NULL);
879 add_excludes_from_file_to_list(el->src, el->src,
880 stk->baselen, el, 1);
95c6f271 881 }
6cd5c582
KB
882 dir->exclude_stack = stk;
883 current = stk->baselen;
884 }
aceb9429 885 strbuf_setlen(&dir->basebuf, baselen);
6cd5c582
KB
886}
887
f4cd69a6
AS
888/*
889 * Loads the exclude lists for the directory containing pathname, then
890 * scans all exclude lists to determine whether pathname is excluded.
891 * Returns the exclude_list element which matched, or NULL for
892 * undecided.
893 */
b07bc8c8 894struct exclude *last_exclude_matching(struct dir_struct *dir,
f4cd69a6
AS
895 const char *pathname,
896 int *dtype_p)
453ec4bd
LT
897{
898 int pathlen = strlen(pathname);
68492fc7
LK
899 const char *basename = strrchr(pathname, '/');
900 basename = (basename) ? basename+1 : pathname;
453ec4bd 901
63d285c8 902 prep_exclude(dir, pathname, basename-pathname);
c082df24 903
95c6f271
KB
904 if (dir->exclude)
905 return dir->exclude;
906
46aa2f95
KB
907 return last_exclude_matching_from_lists(dir, pathname, pathlen,
908 basename, dtype_p);
f4cd69a6
AS
909}
910
911/*
912 * Loads the exclude lists for the directory containing pathname, then
913 * scans all exclude lists to determine whether pathname is excluded.
914 * Returns 1 if true, otherwise 0.
915 */
b07bc8c8 916int is_excluded(struct dir_struct *dir, const char *pathname, int *dtype_p)
f4cd69a6
AS
917{
918 struct exclude *exclude =
919 last_exclude_matching(dir, pathname, dtype_p);
920 if (exclude)
921 return exclude->flags & EXC_FLAG_NEGATIVE ? 0 : 1;
453ec4bd
LT
922 return 0;
923}
924
f3fa1838
JH
925static struct dir_entry *dir_entry_new(const char *pathname, int len)
926{
453ec4bd
LT
927 struct dir_entry *ent;
928
453ec4bd
LT
929 ent = xmalloc(sizeof(*ent) + len + 1);
930 ent->len = len;
931 memcpy(ent->name, pathname, len);
932 ent->name[len] = 0;
4d06f8ac 933 return ent;
453ec4bd
LT
934}
935
159b3212 936static struct dir_entry *dir_add_name(struct dir_struct *dir, const char *pathname, int len)
6815e569 937{
ebbd7439 938 if (cache_file_exists(pathname, len, ignore_case))
6815e569
JK
939 return NULL;
940
25fd2f7a 941 ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc);
6815e569
JK
942 return dir->entries[dir->nr++] = dir_entry_new(pathname, len);
943}
944
108da0db 945struct dir_entry *dir_add_ignored(struct dir_struct *dir, const char *pathname, int len)
2abd31b0 946{
6e4f981f 947 if (!cache_name_is_other(pathname, len))
2abd31b0
JK
948 return NULL;
949
25fd2f7a 950 ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc);
2abd31b0
JK
951 return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);
952}
953
09595258
LT
954enum exist_status {
955 index_nonexistent = 0,
956 index_directory,
4b05548f 957 index_gitdir
09595258
LT
958};
959
5102c617 960/*
71261027 961 * Do not use the alphabetically sorted index to look up
5102c617 962 * the directory name; instead, use the case insensitive
ebbd7439 963 * directory hash.
5102c617
JJ
964 */
965static enum exist_status directory_exists_in_index_icase(const char *dirname, int len)
966{
d28eec26 967 const struct cache_entry *ce = cache_dir_exists(dirname, len);
5102c617
JJ
968 unsigned char endchar;
969
970 if (!ce)
971 return index_nonexistent;
972 endchar = ce->name[len];
973
974 /*
975 * The cache_entry structure returned will contain this dirname
976 * and possibly additional path components.
977 */
978 if (endchar == '/')
979 return index_directory;
980
981 /*
982 * If there are no additional path components, then this cache_entry
983 * represents a submodule. Submodules, despite being directories,
984 * are stored in the cache without a closing slash.
985 */
986 if (!endchar && S_ISGITLINK(ce->ce_mode))
987 return index_gitdir;
988
989 /* This should never be hit, but it exists just in case. */
990 return index_nonexistent;
991}
992
09595258
LT
993/*
994 * The index sorts alphabetically by entry name, which
995 * means that a gitlink sorts as '\0' at the end, while
996 * a directory (which is defined not as an entry, but as
997 * the files it contains) will sort with the '/' at the
998 * end.
999 */
1000static enum exist_status directory_exists_in_index(const char *dirname, int len)
453ec4bd 1001{
5102c617
JJ
1002 int pos;
1003
1004 if (ignore_case)
1005 return directory_exists_in_index_icase(dirname, len);
1006
1007 pos = cache_name_pos(dirname, len);
09595258
LT
1008 if (pos < 0)
1009 pos = -pos-1;
1010 while (pos < active_nr) {
9c5e6c80 1011 const struct cache_entry *ce = active_cache[pos++];
09595258
LT
1012 unsigned char endchar;
1013
1014 if (strncmp(ce->name, dirname, len))
1015 break;
1016 endchar = ce->name[len];
1017 if (endchar > '/')
1018 break;
1019 if (endchar == '/')
1020 return index_directory;
7a51ed66 1021 if (!endchar && S_ISGITLINK(ce->ce_mode))
09595258
LT
1022 return index_gitdir;
1023 }
1024 return index_nonexistent;
1025}
1026
1027/*
1028 * When we find a directory when traversing the filesystem, we
1029 * have three distinct cases:
1030 *
1031 * - ignore it
1032 * - see it as a directory
1033 * - recurse into it
1034 *
1035 * and which one we choose depends on a combination of existing
1036 * git index contents and the flags passed into the directory
1037 * traversal routine.
1038 *
1039 * Case 1: If we *already* have entries in the index under that
5bd8e2d8
KB
1040 * directory name, we always recurse into the directory to see
1041 * all the files.
09595258
LT
1042 *
1043 * Case 2: If we *already* have that directory name as a gitlink,
1044 * we always continue to see it as a gitlink, regardless of whether
1045 * there is an actual git directory there or not (it might not
1046 * be checked out as a subproject!)
1047 *
1048 * Case 3: if we didn't have it in the index previously, we
1049 * have a few sub-cases:
1050 *
1051 * (a) if "show_other_directories" is true, we show it as
1052 * just a directory, unless "hide_empty_directories" is
defd7c7b
KB
1053 * also true, in which case we need to check if it contains any
1054 * untracked and / or ignored files.
09595258 1055 * (b) if it looks like a git directory, and we don't have
302b9282 1056 * 'no_gitlinks' set we treat it as a gitlink, and show it
09595258
LT
1057 * as a directory.
1058 * (c) otherwise, we recurse into it.
1059 */
defd7c7b 1060static enum path_treatment treat_directory(struct dir_struct *dir,
721ac4ed 1061 const char *dirname, int len, int exclude,
09595258
LT
1062 const struct path_simplify *simplify)
1063{
1064 /* The "len-1" is to strip the final '/' */
1065 switch (directory_exists_in_index(dirname, len-1)) {
1066 case index_directory:
defd7c7b 1067 return path_recurse;
09595258
LT
1068
1069 case index_gitdir:
26c986e1 1070 return path_none;
09595258
LT
1071
1072 case index_nonexistent:
7c4c97c0 1073 if (dir->flags & DIR_SHOW_OTHER_DIRECTORIES)
09595258 1074 break;
7c4c97c0 1075 if (!(dir->flags & DIR_NO_GITLINKS)) {
09595258
LT
1076 unsigned char sha1[20];
1077 if (resolve_gitlink_ref(dirname, "HEAD", sha1) == 0)
defd7c7b 1078 return path_untracked;
09595258 1079 }
defd7c7b 1080 return path_recurse;
09595258
LT
1081 }
1082
1083 /* This is the "show_other_directories" case */
721ac4ed 1084
184d2a8e 1085 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
defd7c7b
KB
1086 return exclude ? path_excluded : path_untracked;
1087
1088 return read_directory_recursive(dir, dirname, len, 1, simplify);
453ec4bd
LT
1089}
1090
9fc42d60
LT
1091/*
1092 * This is an inexact early pruning of any recursive directory
1093 * reading - if the path cannot possibly be in the pathspec,
1094 * return true, and we'll skip it early.
1095 */
1096static int simplify_away(const char *path, int pathlen, const struct path_simplify *simplify)
1097{
1098 if (simplify) {
1099 for (;;) {
1100 const char *match = simplify->path;
1101 int len = simplify->len;
1102
1103 if (!match)
1104 break;
1105 if (len > pathlen)
1106 len = pathlen;
1107 if (!memcmp(path, match, len))
1108 return 0;
1109 simplify++;
1110 }
1111 return 1;
1112 }
1113 return 0;
1114}
1115
29209cbe
JK
1116/*
1117 * This function tells us whether an excluded path matches a
1118 * list of "interesting" pathspecs. That is, whether a path matched
1119 * by any of the pathspecs could possibly be ignored by excluding
1120 * the specified path. This can happen if:
1121 *
1122 * 1. the path is mentioned explicitly in the pathspec
1123 *
1124 * 2. the path is a directory prefix of some element in the
1125 * pathspec
1126 */
1127static int exclude_matches_pathspec(const char *path, int len,
1128 const struct path_simplify *simplify)
e96980ef
JK
1129{
1130 if (simplify) {
1131 for (; simplify->path; simplify++) {
1132 if (len == simplify->len
1133 && !memcmp(path, simplify->path, len))
1134 return 1;
29209cbe
JK
1135 if (len < simplify->len
1136 && simplify->path[len] == '/'
1137 && !memcmp(path, simplify->path, len))
1138 return 1;
e96980ef
JK
1139 }
1140 }
1141 return 0;
1142}
1143
443e061a
LT
1144static int get_index_dtype(const char *path, int len)
1145{
1146 int pos;
9c5e6c80 1147 const struct cache_entry *ce;
443e061a 1148
ebbd7439 1149 ce = cache_file_exists(path, len, 0);
443e061a
LT
1150 if (ce) {
1151 if (!ce_uptodate(ce))
1152 return DT_UNKNOWN;
1153 if (S_ISGITLINK(ce->ce_mode))
1154 return DT_DIR;
1155 /*
1156 * Nobody actually cares about the
1157 * difference between DT_LNK and DT_REG
1158 */
1159 return DT_REG;
1160 }
1161
1162 /* Try to look it up as a directory */
1163 pos = cache_name_pos(path, len);
1164 if (pos >= 0)
1165 return DT_UNKNOWN;
1166 pos = -pos-1;
1167 while (pos < active_nr) {
1168 ce = active_cache[pos++];
1169 if (strncmp(ce->name, path, len))
1170 break;
1171 if (ce->name[len] > '/')
1172 break;
1173 if (ce->name[len] < '/')
1174 continue;
1175 if (!ce_uptodate(ce))
1176 break; /* continue? */
1177 return DT_DIR;
1178 }
1179 return DT_UNKNOWN;
1180}
1181
caa6b782 1182static int get_dtype(struct dirent *de, const char *path, int len)
07134421 1183{
6831a88a 1184 int dtype = de ? DTYPE(de) : DT_UNKNOWN;
07134421
LT
1185 struct stat st;
1186
1187 if (dtype != DT_UNKNOWN)
1188 return dtype;
443e061a
LT
1189 dtype = get_index_dtype(path, len);
1190 if (dtype != DT_UNKNOWN)
1191 return dtype;
1192 if (lstat(path, &st))
07134421
LT
1193 return dtype;
1194 if (S_ISREG(st.st_mode))
1195 return DT_REG;
1196 if (S_ISDIR(st.st_mode))
1197 return DT_DIR;
1198 if (S_ISLNK(st.st_mode))
1199 return DT_LNK;
1200 return dtype;
1201}
1202
16e2cfa9 1203static enum path_treatment treat_one_path(struct dir_struct *dir,
49dc2cc2 1204 struct strbuf *path,
16e2cfa9
JH
1205 const struct path_simplify *simplify,
1206 int dtype, struct dirent *de)
53cc5356 1207{
8aaf8d77 1208 int exclude;
ebbd7439 1209 int has_path_in_index = !!cache_file_exists(path->buf, path->len, ignore_case);
2eac2a4c 1210
8aaf8d77
KB
1211 if (dtype == DT_UNKNOWN)
1212 dtype = get_dtype(de, path->buf, path->len);
1213
1214 /* Always exclude indexed files */
2eac2a4c 1215 if (dtype != DT_DIR && has_path_in_index)
defd7c7b 1216 return path_none;
8aaf8d77 1217
2eac2a4c
JH
1218 /*
1219 * When we are looking at a directory P in the working tree,
1220 * there are three cases:
1221 *
1222 * (1) P exists in the index. Everything inside the directory P in
1223 * the working tree needs to go when P is checked out from the
1224 * index.
1225 *
1226 * (2) P does not exist in the index, but there is P/Q in the index.
1227 * We know P will stay a directory when we check out the contents
1228 * of the index, but we do not know yet if there is a directory
1229 * P/Q in the working tree to be killed, so we need to recurse.
1230 *
1231 * (3) P does not exist in the index, and there is no P/Q in the index
1232 * to require P to be a directory, either. Only in this case, we
1233 * know that everything inside P will not be killed without
1234 * recursing.
1235 */
1236 if ((dir->flags & DIR_COLLECT_KILLED_ONLY) &&
1237 (dtype == DT_DIR) &&
de372b1b
ES
1238 !has_path_in_index &&
1239 (directory_exists_in_index(path->buf, path->len) == index_nonexistent))
1240 return path_none;
8aaf8d77
KB
1241
1242 exclude = is_excluded(dir, path->buf, &dtype);
53cc5356
JH
1243
1244 /*
1245 * Excluded? If we don't explicitly want to show
1246 * ignored files, ignore it
1247 */
0aaf62b6 1248 if (exclude && !(dir->flags & (DIR_SHOW_IGNORED|DIR_SHOW_IGNORED_TOO)))
defd7c7b 1249 return path_excluded;
53cc5356 1250
53cc5356
JH
1251 switch (dtype) {
1252 default:
defd7c7b 1253 return path_none;
53cc5356 1254 case DT_DIR:
49dc2cc2 1255 strbuf_addch(path, '/');
defd7c7b
KB
1256 return treat_directory(dir, path->buf, path->len, exclude,
1257 simplify);
53cc5356
JH
1258 case DT_REG:
1259 case DT_LNK:
defd7c7b 1260 return exclude ? path_excluded : path_untracked;
53cc5356 1261 }
53cc5356
JH
1262}
1263
16e2cfa9
JH
1264static enum path_treatment treat_path(struct dir_struct *dir,
1265 struct dirent *de,
49dc2cc2 1266 struct strbuf *path,
16e2cfa9 1267 int baselen,
49dc2cc2 1268 const struct path_simplify *simplify)
16e2cfa9
JH
1269{
1270 int dtype;
1271
1272 if (is_dot_or_dotdot(de->d_name) || !strcmp(de->d_name, ".git"))
defd7c7b 1273 return path_none;
49dc2cc2
RS
1274 strbuf_setlen(path, baselen);
1275 strbuf_addstr(path, de->d_name);
1276 if (simplify_away(path->buf, path->len, simplify))
defd7c7b 1277 return path_none;
16e2cfa9
JH
1278
1279 dtype = DTYPE(de);
49dc2cc2 1280 return treat_one_path(dir, path, simplify, dtype, de);
16e2cfa9
JH
1281}
1282
453ec4bd
LT
1283/*
1284 * Read a directory tree. We currently ignore anything but
1285 * directories, regular files and symlinks. That's because git
1286 * doesn't handle them at all yet. Maybe that will change some
1287 * day.
1288 *
1289 * Also, we ignore the name ".git" (even if it is not a directory).
1290 * That likely will not change.
defd7c7b
KB
1291 *
1292 * Returns the most significant path_treatment value encountered in the scan.
453ec4bd 1293 */
defd7c7b 1294static enum path_treatment read_directory_recursive(struct dir_struct *dir,
53cc5356
JH
1295 const char *base, int baselen,
1296 int check_only,
1297 const struct path_simplify *simplify)
453ec4bd 1298{
1528d247 1299 DIR *fdir;
defd7c7b 1300 enum path_treatment state, subdir_state, dir_state = path_none;
02cb6753 1301 struct dirent *de;
bef36921 1302 struct strbuf path = STRBUF_INIT;
453ec4bd 1303
bef36921 1304 strbuf_add(&path, base, baselen);
02cb6753 1305
1528d247
RS
1306 fdir = opendir(path.len ? path.buf : ".");
1307 if (!fdir)
1308 goto out;
1309
02cb6753 1310 while ((de = readdir(fdir)) != NULL) {
defd7c7b
KB
1311 /* check how the file or directory should be treated */
1312 state = treat_path(dir, de, &path, baselen, simplify);
1313 if (state > dir_state)
1314 dir_state = state;
1315
1316 /* recurse into subdir if instructed by treat_path */
1317 if (state == path_recurse) {
1318 subdir_state = read_directory_recursive(dir, path.buf,
289ff559 1319 path.len, check_only, simplify);
defd7c7b
KB
1320 if (subdir_state > dir_state)
1321 dir_state = subdir_state;
1322 }
1323
1324 if (check_only) {
1325 /* abort early if maximum state has been reached */
1326 if (dir_state == path_untracked)
1327 break;
1328 /* skip the dir_add_* part */
02cb6753 1329 continue;
453ec4bd 1330 }
defd7c7b
KB
1331
1332 /* add the path to the appropriate result list */
1333 switch (state) {
1334 case path_excluded:
1335 if (dir->flags & DIR_SHOW_IGNORED)
1336 dir_add_name(dir, path.buf, path.len);
0aaf62b6
KB
1337 else if ((dir->flags & DIR_SHOW_IGNORED_TOO) ||
1338 ((dir->flags & DIR_COLLECT_IGNORED) &&
1339 exclude_matches_pathspec(path.buf, path.len,
1340 simplify)))
1341 dir_add_ignored(dir, path.buf, path.len);
defd7c7b
KB
1342 break;
1343
1344 case path_untracked:
1345 if (!(dir->flags & DIR_SHOW_IGNORED))
1346 dir_add_name(dir, path.buf, path.len);
1528d247 1347 break;
defd7c7b
KB
1348
1349 default:
1350 break;
1351 }
453ec4bd 1352 }
02cb6753 1353 closedir(fdir);
1528d247 1354 out:
bef36921 1355 strbuf_release(&path);
453ec4bd 1356
defd7c7b 1357 return dir_state;
453ec4bd
LT
1358}
1359
1360static int cmp_name(const void *p1, const void *p2)
1361{
1362 const struct dir_entry *e1 = *(const struct dir_entry **)p1;
1363 const struct dir_entry *e2 = *(const struct dir_entry **)p2;
1364
ccdd4a0f 1365 return name_compare(e1->name, e1->len, e2->name, e2->len);
453ec4bd
LT
1366}
1367
9fc42d60
LT
1368static struct path_simplify *create_simplify(const char **pathspec)
1369{
1370 int nr, alloc = 0;
1371 struct path_simplify *simplify = NULL;
1372
1373 if (!pathspec)
1374 return NULL;
1375
1376 for (nr = 0 ; ; nr++) {
1377 const char *match;
9af49f82 1378 ALLOC_GROW(simplify, nr + 1, alloc);
9fc42d60
LT
1379 match = *pathspec++;
1380 if (!match)
1381 break;
1382 simplify[nr].path = match;
1383 simplify[nr].len = simple_length(match);
1384 }
1385 simplify[nr].path = NULL;
1386 simplify[nr].len = 0;
1387 return simplify;
1388}
1389
1390static void free_simplify(struct path_simplify *simplify)
1391{
8e0f7003 1392 free(simplify);
9fc42d60
LT
1393}
1394
48ffef96
JH
1395static int treat_leading_path(struct dir_struct *dir,
1396 const char *path, int len,
1397 const struct path_simplify *simplify)
1398{
49dc2cc2
RS
1399 struct strbuf sb = STRBUF_INIT;
1400 int baselen, rc = 0;
48ffef96 1401 const char *cp;
be8a84c5 1402 int old_flags = dir->flags;
48ffef96
JH
1403
1404 while (len && path[len - 1] == '/')
1405 len--;
1406 if (!len)
1407 return 1;
1408 baselen = 0;
be8a84c5 1409 dir->flags &= ~DIR_SHOW_OTHER_DIRECTORIES;
48ffef96
JH
1410 while (1) {
1411 cp = path + baselen + !!baselen;
1412 cp = memchr(cp, '/', path + len - cp);
1413 if (!cp)
1414 baselen = len;
1415 else
1416 baselen = cp - path;
49dc2cc2
RS
1417 strbuf_setlen(&sb, 0);
1418 strbuf_add(&sb, path, baselen);
1419 if (!is_directory(sb.buf))
1420 break;
1421 if (simplify_away(sb.buf, sb.len, simplify))
1422 break;
1423 if (treat_one_path(dir, &sb, simplify,
defd7c7b 1424 DT_DIR, NULL) == path_none)
49dc2cc2
RS
1425 break; /* do not recurse into it */
1426 if (len <= baselen) {
1427 rc = 1;
1428 break; /* finished checking */
1429 }
48ffef96 1430 }
49dc2cc2 1431 strbuf_release(&sb);
be8a84c5 1432 dir->flags = old_flags;
49dc2cc2 1433 return rc;
48ffef96
JH
1434}
1435
7327d3d1 1436int read_directory(struct dir_struct *dir, const char *path, int len, const struct pathspec *pathspec)
9fc42d60 1437{
725b0605 1438 struct path_simplify *simplify;
b4189aa8 1439
7327d3d1
NTND
1440 /*
1441 * Check out create_simplify()
1442 */
1443 if (pathspec)
5c6933d2
NTND
1444 GUARD_PATHSPEC(pathspec,
1445 PATHSPEC_FROMTOP |
1446 PATHSPEC_MAXDEPTH |
bd30c2e4 1447 PATHSPEC_LITERAL |
93d93537 1448 PATHSPEC_GLOB |
ef79b1f8
NTND
1449 PATHSPEC_ICASE |
1450 PATHSPEC_EXCLUDE);
7327d3d1 1451
dba2e203 1452 if (has_symlink_leading_path(path, len))
725b0605
JH
1453 return dir->nr;
1454
ef79b1f8
NTND
1455 /*
1456 * exclude patterns are treated like positive ones in
1457 * create_simplify. Usually exclude patterns should be a
1458 * subset of positive ones, which has no impacts on
1459 * create_simplify().
1460 */
b3920bbd 1461 simplify = create_simplify(pathspec ? pathspec->_raw : NULL);
48ffef96
JH
1462 if (!len || treat_leading_path(dir, path, len, simplify))
1463 read_directory_recursive(dir, path, len, 0, simplify);
9fc42d60 1464 free_simplify(simplify);
453ec4bd 1465 qsort(dir->entries, dir->nr, sizeof(struct dir_entry *), cmp_name);
2abd31b0 1466 qsort(dir->ignored, dir->ignored_nr, sizeof(struct dir_entry *), cmp_name);
453ec4bd
LT
1467 return dir->nr;
1468}
c91f0d92 1469
686a4a06 1470int file_exists(const char *f)
c91f0d92 1471{
686a4a06 1472 struct stat sb;
a50f9fc5 1473 return lstat(f, &sb) == 0;
c91f0d92 1474}
e6636747
JS
1475
1476/*
9b125da4
NTND
1477 * Given two normalized paths (a trailing slash is ok), if subdir is
1478 * outside dir, return -1. Otherwise return the offset in subdir that
1479 * can be used as relative path to dir.
e6636747 1480 */
9b125da4 1481int dir_inside_of(const char *subdir, const char *dir)
e6636747 1482{
9b125da4 1483 int offset = 0;
e6636747 1484
9b125da4 1485 assert(dir && subdir && *dir && *subdir);
e6636747 1486
9b125da4 1487 while (*dir && *subdir && *dir == *subdir) {
e6636747 1488 dir++;
9b125da4
NTND
1489 subdir++;
1490 offset++;
490544b1 1491 }
9b125da4
NTND
1492
1493 /* hel[p]/me vs hel[l]/yeah */
1494 if (*dir && *subdir)
1495 return -1;
1496
1497 if (!*subdir)
1498 return !*dir ? offset : -1; /* same dir */
1499
1500 /* foo/[b]ar vs foo/[] */
1501 if (is_dir_sep(dir[-1]))
1502 return is_dir_sep(subdir[-1]) ? offset : -1;
1503
1504 /* foo[/]bar vs foo[] */
1505 return is_dir_sep(*subdir) ? offset + 1 : -1;
e6636747
JS
1506}
1507
1508int is_inside_dir(const char *dir)
1509{
56b9f6e7
RS
1510 char *cwd;
1511 int rc;
1512
b892913d
NTND
1513 if (!dir)
1514 return 0;
56b9f6e7
RS
1515
1516 cwd = xgetcwd();
1517 rc = (dir_inside_of(cwd, dir) >= 0);
1518 free(cwd);
1519 return rc;
e6636747 1520}
7155b727 1521
55892d23
AP
1522int is_empty_dir(const char *path)
1523{
1524 DIR *dir = opendir(path);
1525 struct dirent *e;
1526 int ret = 1;
1527
1528 if (!dir)
1529 return 0;
1530
1531 while ((e = readdir(dir)) != NULL)
1532 if (!is_dot_or_dotdot(e->d_name)) {
1533 ret = 0;
1534 break;
1535 }
1536
1537 closedir(dir);
1538 return ret;
1539}
1540
ae2f203e 1541static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up)
7155b727 1542{
a0f4afbe 1543 DIR *dir;
7155b727 1544 struct dirent *e;
ae2f203e 1545 int ret = 0, original_len = path->len, len, kept_down = 0;
a0f4afbe 1546 int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY);
c844a803 1547 int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL);
a0f4afbe 1548 unsigned char submodule_head[20];
7155b727 1549
a0f4afbe 1550 if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) &&
ae2f203e 1551 !resolve_gitlink_ref(path->buf, "HEAD", submodule_head)) {
a0f4afbe 1552 /* Do not descend and nuke a nested git work tree. */
ae2f203e
JH
1553 if (kept_up)
1554 *kept_up = 1;
a0f4afbe 1555 return 0;
ae2f203e 1556 }
a0f4afbe 1557
ae2f203e 1558 flag &= ~REMOVE_DIR_KEEP_TOPLEVEL;
a0f4afbe 1559 dir = opendir(path->buf);
c844a803 1560 if (!dir) {
863808cd
MH
1561 if (errno == ENOENT)
1562 return keep_toplevel ? -1 : 0;
1563 else if (errno == EACCES && !keep_toplevel)
ecb2c282
MH
1564 /*
1565 * An empty dir could be removable even if it
1566 * is unreadable:
1567 */
c844a803
JH
1568 return rmdir(path->buf);
1569 else
1570 return -1;
1571 }
7155b727
JS
1572 if (path->buf[original_len - 1] != '/')
1573 strbuf_addch(path, '/');
1574
1575 len = path->len;
1576 while ((e = readdir(dir)) != NULL) {
1577 struct stat st;
8ca12c0d
AP
1578 if (is_dot_or_dotdot(e->d_name))
1579 continue;
7155b727
JS
1580
1581 strbuf_setlen(path, len);
1582 strbuf_addstr(path, e->d_name);
863808cd
MH
1583 if (lstat(path->buf, &st)) {
1584 if (errno == ENOENT)
1585 /*
1586 * file disappeared, which is what we
1587 * wanted anyway
1588 */
1589 continue;
1590 /* fall thru */
1591 } else if (S_ISDIR(st.st_mode)) {
ae2f203e 1592 if (!remove_dir_recurse(path, flag, &kept_down))
7155b727 1593 continue; /* happy */
863808cd
MH
1594 } else if (!only_empty &&
1595 (!unlink(path->buf) || errno == ENOENT)) {
7155b727 1596 continue; /* happy, too */
863808cd 1597 }
7155b727
JS
1598
1599 /* path too long, stat fails, or non-directory still exists */
1600 ret = -1;
1601 break;
1602 }
1603 closedir(dir);
1604
1605 strbuf_setlen(path, original_len);
ae2f203e 1606 if (!ret && !keep_toplevel && !kept_down)
863808cd 1607 ret = (!rmdir(path->buf) || errno == ENOENT) ? 0 : -1;
ae2f203e
JH
1608 else if (kept_up)
1609 /*
1610 * report the uplevel that it is not an error that we
1611 * did not rmdir() our directory.
1612 */
1613 *kept_up = !ret;
7155b727
JS
1614 return ret;
1615}
039bc64e 1616
ae2f203e
JH
1617int remove_dir_recursively(struct strbuf *path, int flag)
1618{
1619 return remove_dir_recurse(path, flag, NULL);
1620}
1621
039bc64e
JH
1622void setup_standard_excludes(struct dir_struct *dir)
1623{
1624 const char *path;
dc79687e 1625 char *xdg_path;
039bc64e
JH
1626
1627 dir->exclude_per_dir = ".gitignore";
1628 path = git_path("info/exclude");
dc79687e
HKNN
1629 if (!excludes_file) {
1630 home_config_paths(NULL, &xdg_path, "ignore");
1631 excludes_file = xdg_path;
1632 }
4698c8fe 1633 if (!access_or_warn(path, R_OK, 0))
039bc64e 1634 add_excludes_from_file(dir, path);
4698c8fe 1635 if (excludes_file && !access_or_warn(excludes_file, R_OK, 0))
039bc64e
JH
1636 add_excludes_from_file(dir, excludes_file);
1637}
4a92d1bf
AR
1638
1639int remove_path(const char *name)
1640{
1641 char *slash;
1642
9a6728d4 1643 if (unlink(name) && errno != ENOENT && errno != ENOTDIR)
4a92d1bf
AR
1644 return -1;
1645
1646 slash = strrchr(name, '/');
1647 if (slash) {
1648 char *dirs = xstrdup(name);
1649 slash = dirs + (slash - name);
1650 do {
1651 *slash = '\0';
3fc0d131 1652 } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/')));
4a92d1bf
AR
1653 free(dirs);
1654 }
1655 return 0;
1656}
1657
270be816
AS
1658/*
1659 * Frees memory within dir which was allocated for exclude lists and
1660 * the exclude_stack. Does not free dir itself.
1661 */
1662void clear_directory(struct dir_struct *dir)
1663{
1664 int i, j;
1665 struct exclude_list_group *group;
1666 struct exclude_list *el;
1667 struct exclude_stack *stk;
1668
1669 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
1670 group = &dir->exclude_list_group[i];
1671 for (j = 0; j < group->nr; j++) {
1672 el = &group->el[j];
1673 if (i == EXC_DIRS)
1674 free((char *)el->src);
1675 clear_exclude_list(el);
1676 }
1677 free(group->el);
1678 }
1679
1680 stk = dir->exclude_stack;
1681 while (stk) {
1682 struct exclude_stack *prev = stk->prev;
1683 free(stk);
1684 stk = prev;
1685 }
aceb9429 1686 strbuf_release(&dir->basebuf);
270be816 1687}