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