Merge branch 'jk/subtree-install-fix' into maint
[git/raj.git] / dir.c
blob1d63e9898783e3d26dc8b4a23fc785810142d9a1
1 /*
2 * This handles recursive filename detection with exclude
3 * files, index knowledge etc..
5 * See Documentation/technical/api-directory-listing.txt
7 * Copyright (C) Linus Torvalds, 2005-2006
8 * Junio Hamano, 2005-2006
9 */
10 #include "cache.h"
11 #include "dir.h"
12 #include "refs.h"
13 #include "wildmatch.h"
15 struct path_simplify {
16 int len;
17 const char *path;
21 * Tells read_directory_recursive how a file or directory should be treated.
22 * Values are ordered by significance, e.g. if a directory contains both
23 * excluded and untracked files, it is listed as untracked because
24 * path_untracked > path_excluded.
26 enum path_treatment {
27 path_none = 0,
28 path_recurse,
29 path_excluded,
30 path_untracked
33 static enum path_treatment read_directory_recursive(struct dir_struct *dir,
34 const char *path, int len,
35 int check_only, const struct path_simplify *simplify);
36 static int get_dtype(struct dirent *de, const char *path, int len);
38 /* helper string functions with support for the ignore_case flag */
39 int strcmp_icase(const char *a, const char *b)
41 return ignore_case ? strcasecmp(a, b) : strcmp(a, b);
44 int strncmp_icase(const char *a, const char *b, size_t count)
46 return ignore_case ? strncasecmp(a, b, count) : strncmp(a, b, count);
49 int fnmatch_icase(const char *pattern, const char *string, int flags)
51 return fnmatch(pattern, string, flags | (ignore_case ? FNM_CASEFOLD : 0));
54 inline int git_fnmatch(const char *pattern, const char *string,
55 int flags, int prefix)
57 int fnm_flags = 0;
58 if (flags & GFNM_PATHNAME)
59 fnm_flags |= FNM_PATHNAME;
60 if (prefix > 0) {
61 if (strncmp(pattern, string, prefix))
62 return FNM_NOMATCH;
63 pattern += prefix;
64 string += prefix;
66 if (flags & GFNM_ONESTAR) {
67 int pattern_len = strlen(++pattern);
68 int string_len = strlen(string);
69 return string_len < pattern_len ||
70 strcmp(pattern,
71 string + string_len - pattern_len);
73 return fnmatch(pattern, string, fnm_flags);
76 static int fnmatch_icase_mem(const char *pattern, int patternlen,
77 const char *string, int stringlen,
78 int flags)
80 int match_status;
81 struct strbuf pat_buf = STRBUF_INIT;
82 struct strbuf str_buf = STRBUF_INIT;
83 const char *use_pat = pattern;
84 const char *use_str = string;
86 if (pattern[patternlen]) {
87 strbuf_add(&pat_buf, pattern, patternlen);
88 use_pat = pat_buf.buf;
90 if (string[stringlen]) {
91 strbuf_add(&str_buf, string, stringlen);
92 use_str = str_buf.buf;
95 if (ignore_case)
96 flags |= WM_CASEFOLD;
97 match_status = wildmatch(use_pat, use_str, flags, NULL);
99 strbuf_release(&pat_buf);
100 strbuf_release(&str_buf);
102 return match_status;
105 static size_t common_prefix_len(const char **pathspec)
107 const char *n, *first;
108 size_t max = 0;
109 int literal = limit_pathspec_to_literal();
111 if (!pathspec)
112 return max;
114 first = *pathspec;
115 while ((n = *pathspec++)) {
116 size_t i, len = 0;
117 for (i = 0; first == n || i < max; i++) {
118 char c = n[i];
119 if (!c || c != first[i] || (!literal && is_glob_special(c)))
120 break;
121 if (c == '/')
122 len = i + 1;
124 if (first == n || len < max) {
125 max = len;
126 if (!max)
127 break;
130 return max;
134 * Returns a copy of the longest leading path common among all
135 * pathspecs.
137 char *common_prefix(const char **pathspec)
139 unsigned long len = common_prefix_len(pathspec);
141 return len ? xmemdupz(*pathspec, len) : NULL;
144 int fill_directory(struct dir_struct *dir, const char **pathspec)
146 size_t len;
149 * Calculate common prefix for the pathspec, and
150 * use that to optimize the directory walk
152 len = common_prefix_len(pathspec);
154 /* Read the directory and prune it */
155 read_directory(dir, pathspec ? *pathspec : "", len, pathspec);
156 return len;
159 int within_depth(const char *name, int namelen,
160 int depth, int max_depth)
162 const char *cp = name, *cpe = name + namelen;
164 while (cp < cpe) {
165 if (*cp++ != '/')
166 continue;
167 depth++;
168 if (depth > max_depth)
169 return 0;
171 return 1;
175 * Does 'match' match the given name?
176 * A match is found if
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'.
182 * and the return value tells which case it was.
184 * It returns 0 when there is no match.
186 static int match_one(const char *match, const char *name, int namelen)
188 int matchlen;
189 int literal = limit_pathspec_to_literal();
191 /* If the match was just the prefix, we matched */
192 if (!*match)
193 return MATCHED_RECURSIVELY;
195 if (ignore_case) {
196 for (;;) {
197 unsigned char c1 = tolower(*match);
198 unsigned char c2 = tolower(*name);
199 if (c1 == '\0' || (!literal && is_glob_special(c1)))
200 break;
201 if (c1 != c2)
202 return 0;
203 match++;
204 name++;
205 namelen--;
207 } else {
208 for (;;) {
209 unsigned char c1 = *match;
210 unsigned char c2 = *name;
211 if (c1 == '\0' || (!literal && is_glob_special(c1)))
212 break;
213 if (c1 != c2)
214 return 0;
215 match++;
216 name++;
217 namelen--;
222 * If we don't match the matchstring exactly,
223 * we need to match by fnmatch
225 matchlen = strlen(match);
226 if (strncmp_icase(match, name, matchlen)) {
227 if (literal)
228 return 0;
229 return !fnmatch_icase(match, name, 0) ? MATCHED_FNMATCH : 0;
232 if (namelen == matchlen)
233 return MATCHED_EXACTLY;
234 if (match[matchlen-1] == '/' || name[matchlen] == '/')
235 return MATCHED_RECURSIVELY;
236 return 0;
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.
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.
254 int match_pathspec(const char **pathspec, const char *name, int namelen,
255 int prefix, char *seen)
257 int i, retval = 0;
259 if (!pathspec)
260 return 1;
262 name += prefix;
263 namelen -= prefix;
265 for (i = 0; pathspec[i] != NULL; i++) {
266 int how;
267 const char *match = pathspec[i] + prefix;
268 if (seen && seen[i] == MATCHED_EXACTLY)
269 continue;
270 how = match_one(match, name, namelen);
271 if (how) {
272 if (retval < how)
273 retval = how;
274 if (seen && seen[i] < how)
275 seen[i] = how;
278 return retval;
282 * Does 'match' match the given name?
283 * A match is found if
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'.
289 * and the return value tells which case it was.
291 * It returns 0 when there is no match.
293 static int match_pathspec_item(const struct pathspec_item *item, int prefix,
294 const char *name, int namelen)
296 /* name/namelen has prefix cut off by caller */
297 const char *match = item->match + prefix;
298 int matchlen = item->len - prefix;
300 /* If the match was just the prefix, we matched */
301 if (!*match)
302 return MATCHED_RECURSIVELY;
304 if (matchlen <= namelen && !strncmp(match, name, matchlen)) {
305 if (matchlen == namelen)
306 return MATCHED_EXACTLY;
308 if (match[matchlen-1] == '/' || name[matchlen] == '/')
309 return MATCHED_RECURSIVELY;
312 if (item->nowildcard_len < item->len &&
313 !git_fnmatch(match, name,
314 item->flags & PATHSPEC_ONESTAR ? GFNM_ONESTAR : 0,
315 item->nowildcard_len - prefix))
316 return MATCHED_FNMATCH;
318 return 0;
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.
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.
336 int match_pathspec_depth(const struct pathspec *ps,
337 const char *name, int namelen,
338 int prefix, char *seen)
340 int i, retval = 0;
342 if (!ps->nr) {
343 if (!ps->recursive || ps->max_depth == -1)
344 return MATCHED_RECURSIVELY;
346 if (within_depth(name, namelen, 0, ps->max_depth))
347 return MATCHED_EXACTLY;
348 else
349 return 0;
352 name += prefix;
353 namelen -= prefix;
355 for (i = ps->nr - 1; i >= 0; i--) {
356 int how;
357 if (seen && seen[i] == MATCHED_EXACTLY)
358 continue;
359 how = match_pathspec_item(ps->items+i, prefix, name, namelen);
360 if (ps->recursive && ps->max_depth != -1 &&
361 how && how != MATCHED_FNMATCH) {
362 int len = ps->items[i].len;
363 if (name[len] == '/')
364 len++;
365 if (within_depth(name+len, namelen-len, 0, ps->max_depth))
366 how = MATCHED_EXACTLY;
367 else
368 how = 0;
370 if (how) {
371 if (retval < how)
372 retval = how;
373 if (seen && seen[i] < how)
374 seen[i] = how;
377 return retval;
381 * Return the length of the "simple" part of a path match limiter.
383 static int simple_length(const char *match)
385 int len = -1;
387 for (;;) {
388 unsigned char c = *match++;
389 len++;
390 if (c == '\0' || is_glob_special(c))
391 return len;
395 static int no_wildcard(const char *string)
397 return string[simple_length(string)] == '\0';
400 void parse_exclude_pattern(const char **pattern,
401 int *patternlen,
402 int *flags,
403 int *nowildcardlen)
405 const char *p = *pattern;
406 size_t i, len;
408 *flags = 0;
409 if (*p == '!') {
410 *flags |= EXC_FLAG_NEGATIVE;
411 p++;
413 len = strlen(p);
414 if (len && p[len - 1] == '/') {
415 len--;
416 *flags |= EXC_FLAG_MUSTBEDIR;
418 for (i = 0; i < len; i++) {
419 if (p[i] == '/')
420 break;
422 if (i == len)
423 *flags |= EXC_FLAG_NODIR;
424 *nowildcardlen = simple_length(p);
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
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;
438 void add_exclude(const char *string, const char *base,
439 int baselen, struct exclude_list *el, int srcpos)
441 struct exclude *x;
442 int patternlen;
443 int flags;
444 int nowildcardlen;
446 parse_exclude_pattern(&string, &patternlen, &flags, &nowildcardlen);
447 if (flags & EXC_FLAG_MUSTBEDIR) {
448 char *s;
449 x = xmalloc(sizeof(*x) + patternlen + 1);
450 s = (char *)(x+1);
451 memcpy(s, string, patternlen);
452 s[patternlen] = '\0';
453 x->pattern = s;
454 } else {
455 x = xmalloc(sizeof(*x));
456 x->pattern = string;
458 x->patternlen = patternlen;
459 x->nowildcardlen = nowildcardlen;
460 x->base = base;
461 x->baselen = baselen;
462 x->flags = flags;
463 x->srcpos = srcpos;
464 ALLOC_GROW(el->excludes, el->nr + 1, el->alloc);
465 el->excludes[el->nr++] = x;
466 x->el = el;
469 static void *read_skip_worktree_file_from_index(const char *path, size_t *size)
471 int pos, len;
472 unsigned long sz;
473 enum object_type type;
474 void *data;
476 len = strlen(path);
477 pos = cache_name_pos(path, len);
478 if (pos < 0)
479 return NULL;
480 if (!ce_skip_worktree(active_cache[pos]))
481 return NULL;
482 data = read_sha1_file(active_cache[pos]->sha1, &type, &sz);
483 if (!data || type != OBJ_BLOB) {
484 free(data);
485 return NULL;
487 *size = xsize_t(sz);
488 return data;
492 * Frees memory within el which was allocated for exclude patterns and
493 * the file buffer. Does not free el itself.
495 void clear_exclude_list(struct exclude_list *el)
497 int i;
499 for (i = 0; i < el->nr; i++)
500 free(el->excludes[i]);
501 free(el->excludes);
502 free(el->filebuf);
504 el->nr = 0;
505 el->excludes = NULL;
506 el->filebuf = NULL;
509 int add_excludes_from_file_to_list(const char *fname,
510 const char *base,
511 int baselen,
512 struct exclude_list *el,
513 int check_index)
515 struct stat st;
516 int fd, i, lineno = 1;
517 size_t size = 0;
518 char *buf, *entry;
520 fd = open(fname, O_RDONLY);
521 if (fd < 0 || fstat(fd, &st) < 0) {
522 if (errno != ENOENT)
523 warn_on_inaccessible(fname);
524 if (0 <= fd)
525 close(fd);
526 if (!check_index ||
527 (buf = read_skip_worktree_file_from_index(fname, &size)) == NULL)
528 return -1;
529 if (size == 0) {
530 free(buf);
531 return 0;
533 if (buf[size-1] != '\n') {
534 buf = xrealloc(buf, size+1);
535 buf[size++] = '\n';
538 else {
539 size = xsize_t(st.st_size);
540 if (size == 0) {
541 close(fd);
542 return 0;
544 buf = xmalloc(size+1);
545 if (read_in_full(fd, buf, size) != size) {
546 free(buf);
547 close(fd);
548 return -1;
550 buf[size++] = '\n';
551 close(fd);
554 el->filebuf = buf;
555 entry = buf;
556 for (i = 0; i < size; i++) {
557 if (buf[i] == '\n') {
558 if (entry != buf + i && entry[0] != '#') {
559 buf[i - (i && buf[i-1] == '\r')] = 0;
560 add_exclude(entry, base, baselen, el, lineno);
562 lineno++;
563 entry = buf + i + 1;
566 return 0;
569 struct exclude_list *add_exclude_list(struct dir_struct *dir,
570 int group_type, const char *src)
572 struct exclude_list *el;
573 struct exclude_list_group *group;
575 group = &dir->exclude_list_group[group_type];
576 ALLOC_GROW(group->el, group->nr + 1, group->alloc);
577 el = &group->el[group->nr++];
578 memset(el, 0, sizeof(*el));
579 el->src = src;
580 return el;
584 * Used to set up core.excludesfile and .git/info/exclude lists.
586 void add_excludes_from_file(struct dir_struct *dir, const char *fname)
588 struct exclude_list *el;
589 el = add_exclude_list(dir, EXC_FILE, fname);
590 if (add_excludes_from_file_to_list(fname, "", 0, el, 0) < 0)
591 die("cannot use %s as an exclude file", fname);
594 int match_basename(const char *basename, int basenamelen,
595 const char *pattern, int prefix, int patternlen,
596 int flags)
598 if (prefix == patternlen) {
599 if (patternlen == basenamelen &&
600 !strncmp_icase(pattern, basename, basenamelen))
601 return 1;
602 } else if (flags & EXC_FLAG_ENDSWITH) {
603 /* "*literal" matching against "fooliteral" */
604 if (patternlen - 1 <= basenamelen &&
605 !strncmp_icase(pattern + 1,
606 basename + basenamelen - (patternlen - 1),
607 patternlen - 1))
608 return 1;
609 } else {
610 if (fnmatch_icase_mem(pattern, patternlen,
611 basename, basenamelen,
612 0) == 0)
613 return 1;
615 return 0;
618 int match_pathname(const char *pathname, int pathlen,
619 const char *base, int baselen,
620 const char *pattern, int prefix, int patternlen,
621 int flags)
623 const char *name;
624 int namelen;
627 * match with FNM_PATHNAME; the pattern has base implicitly
628 * in front of it.
630 if (*pattern == '/') {
631 pattern++;
632 patternlen--;
633 prefix--;
637 * baselen does not count the trailing slash. base[] may or
638 * may not end with a trailing slash though.
640 if (pathlen < baselen + 1 ||
641 (baselen && pathname[baselen] != '/') ||
642 strncmp_icase(pathname, base, baselen))
643 return 0;
645 namelen = baselen ? pathlen - baselen - 1 : pathlen;
646 name = pathname + pathlen - namelen;
648 if (prefix) {
650 * if the non-wildcard part is longer than the
651 * remaining pathname, surely it cannot match.
653 if (prefix > namelen)
654 return 0;
656 if (strncmp_icase(pattern, name, prefix))
657 return 0;
658 pattern += prefix;
659 patternlen -= prefix;
660 name += prefix;
661 namelen -= prefix;
664 * If the whole pattern did not have a wildcard,
665 * then our prefix match is all we need; we
666 * do not need to call fnmatch at all.
668 if (!patternlen && !namelen)
669 return 1;
672 return fnmatch_icase_mem(pattern, patternlen,
673 name, namelen,
674 WM_PATHNAME) == 0;
678 * Scan the given exclude list in reverse to see whether pathname
679 * should be ignored. The first match (i.e. the last on the list), if
680 * any, determines the fate. Returns the exclude_list element which
681 * matched, or NULL for undecided.
683 static struct exclude *last_exclude_matching_from_list(const char *pathname,
684 int pathlen,
685 const char *basename,
686 int *dtype,
687 struct exclude_list *el)
689 int i;
691 if (!el->nr)
692 return NULL; /* undefined */
694 for (i = el->nr - 1; 0 <= i; i--) {
695 struct exclude *x = el->excludes[i];
696 const char *exclude = x->pattern;
697 int prefix = x->nowildcardlen;
699 if (x->flags & EXC_FLAG_MUSTBEDIR) {
700 if (*dtype == DT_UNKNOWN)
701 *dtype = get_dtype(NULL, pathname, pathlen);
702 if (*dtype != DT_DIR)
703 continue;
706 if (x->flags & EXC_FLAG_NODIR) {
707 if (match_basename(basename,
708 pathlen - (basename - pathname),
709 exclude, prefix, x->patternlen,
710 x->flags))
711 return x;
712 continue;
715 assert(x->baselen == 0 || x->base[x->baselen - 1] == '/');
716 if (match_pathname(pathname, pathlen,
717 x->base, x->baselen ? x->baselen - 1 : 0,
718 exclude, prefix, x->patternlen, x->flags))
719 return x;
721 return NULL; /* undecided */
725 * Scan the list and let the last match determine the fate.
726 * Return 1 for exclude, 0 for include and -1 for undecided.
728 int is_excluded_from_list(const char *pathname,
729 int pathlen, const char *basename, int *dtype,
730 struct exclude_list *el)
732 struct exclude *exclude;
733 exclude = last_exclude_matching_from_list(pathname, pathlen, basename, dtype, el);
734 if (exclude)
735 return exclude->flags & EXC_FLAG_NEGATIVE ? 0 : 1;
736 return -1; /* undecided */
739 static struct exclude *last_exclude_matching_from_lists(struct dir_struct *dir,
740 const char *pathname, int pathlen, const char *basename,
741 int *dtype_p)
743 int i, j;
744 struct exclude_list_group *group;
745 struct exclude *exclude;
746 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
747 group = &dir->exclude_list_group[i];
748 for (j = group->nr - 1; j >= 0; j--) {
749 exclude = last_exclude_matching_from_list(
750 pathname, pathlen, basename, dtype_p,
751 &group->el[j]);
752 if (exclude)
753 return exclude;
756 return NULL;
760 * Loads the per-directory exclude list for the substring of base
761 * which has a char length of baselen.
763 static void prep_exclude(struct dir_struct *dir, const char *base, int baselen)
765 struct exclude_list_group *group;
766 struct exclude_list *el;
767 struct exclude_stack *stk = NULL;
768 int current;
770 group = &dir->exclude_list_group[EXC_DIRS];
772 /* Pop the exclude lists from the EXCL_DIRS exclude_list_group
773 * which originate from directories not in the prefix of the
774 * path being checked. */
775 while ((stk = dir->exclude_stack) != NULL) {
776 if (stk->baselen <= baselen &&
777 !strncmp(dir->basebuf, base, stk->baselen))
778 break;
779 el = &group->el[dir->exclude_stack->exclude_ix];
780 dir->exclude_stack = stk->prev;
781 dir->exclude = NULL;
782 free((char *)el->src); /* see strdup() below */
783 clear_exclude_list(el);
784 free(stk);
785 group->nr--;
788 /* Skip traversing into sub directories if the parent is excluded */
789 if (dir->exclude)
790 return;
792 /* Read from the parent directories and push them down. */
793 current = stk ? stk->baselen : -1;
794 while (current < baselen) {
795 struct exclude_stack *stk = xcalloc(1, sizeof(*stk));
796 const char *cp;
798 if (current < 0) {
799 cp = base;
800 current = 0;
802 else {
803 cp = strchr(base + current + 1, '/');
804 if (!cp)
805 die("oops in prep_exclude");
806 cp++;
808 stk->prev = dir->exclude_stack;
809 stk->baselen = cp - base;
810 stk->exclude_ix = group->nr;
811 el = add_exclude_list(dir, EXC_DIRS, NULL);
812 memcpy(dir->basebuf + current, base + current,
813 stk->baselen - current);
815 /* Abort if the directory is excluded */
816 if (stk->baselen) {
817 int dt = DT_DIR;
818 dir->basebuf[stk->baselen - 1] = 0;
819 dir->exclude = last_exclude_matching_from_lists(dir,
820 dir->basebuf, stk->baselen - 1,
821 dir->basebuf + current, &dt);
822 dir->basebuf[stk->baselen - 1] = '/';
823 if (dir->exclude &&
824 dir->exclude->flags & EXC_FLAG_NEGATIVE)
825 dir->exclude = NULL;
826 if (dir->exclude) {
827 dir->basebuf[stk->baselen] = 0;
828 dir->exclude_stack = stk;
829 return;
833 /* Try to read per-directory file unless path is too long */
834 if (dir->exclude_per_dir &&
835 stk->baselen + strlen(dir->exclude_per_dir) < PATH_MAX) {
836 strcpy(dir->basebuf + stk->baselen,
837 dir->exclude_per_dir);
839 * dir->basebuf gets reused by the traversal, but we
840 * need fname to remain unchanged to ensure the src
841 * member of each struct exclude correctly
842 * back-references its source file. Other invocations
843 * of add_exclude_list provide stable strings, so we
844 * strdup() and free() here in the caller.
846 el->src = strdup(dir->basebuf);
847 add_excludes_from_file_to_list(dir->basebuf,
848 dir->basebuf, stk->baselen, el, 1);
850 dir->exclude_stack = stk;
851 current = stk->baselen;
853 dir->basebuf[baselen] = '\0';
857 * Loads the exclude lists for the directory containing pathname, then
858 * scans all exclude lists to determine whether pathname is excluded.
859 * Returns the exclude_list element which matched, or NULL for
860 * undecided.
862 struct exclude *last_exclude_matching(struct dir_struct *dir,
863 const char *pathname,
864 int *dtype_p)
866 int pathlen = strlen(pathname);
867 const char *basename = strrchr(pathname, '/');
868 basename = (basename) ? basename+1 : pathname;
870 prep_exclude(dir, pathname, basename-pathname);
872 if (dir->exclude)
873 return dir->exclude;
875 return last_exclude_matching_from_lists(dir, pathname, pathlen,
876 basename, dtype_p);
880 * Loads the exclude lists for the directory containing pathname, then
881 * scans all exclude lists to determine whether pathname is excluded.
882 * Returns 1 if true, otherwise 0.
884 int is_excluded(struct dir_struct *dir, const char *pathname, int *dtype_p)
886 struct exclude *exclude =
887 last_exclude_matching(dir, pathname, dtype_p);
888 if (exclude)
889 return exclude->flags & EXC_FLAG_NEGATIVE ? 0 : 1;
890 return 0;
893 static struct dir_entry *dir_entry_new(const char *pathname, int len)
895 struct dir_entry *ent;
897 ent = xmalloc(sizeof(*ent) + len + 1);
898 ent->len = len;
899 memcpy(ent->name, pathname, len);
900 ent->name[len] = 0;
901 return ent;
904 static struct dir_entry *dir_add_name(struct dir_struct *dir, const char *pathname, int len)
906 if (cache_name_exists(pathname, len, ignore_case))
907 return NULL;
909 ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc);
910 return dir->entries[dir->nr++] = dir_entry_new(pathname, len);
913 struct dir_entry *dir_add_ignored(struct dir_struct *dir, const char *pathname, int len)
915 if (!cache_name_is_other(pathname, len))
916 return NULL;
918 ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc);
919 return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);
922 enum exist_status {
923 index_nonexistent = 0,
924 index_directory,
925 index_gitdir
929 * Do not use the alphabetically sorted index to look up
930 * the directory name; instead, use the case insensitive
931 * name hash.
933 static enum exist_status directory_exists_in_index_icase(const char *dirname, int len)
935 const struct cache_entry *ce = cache_name_exists(dirname, len + 1, ignore_case);
936 unsigned char endchar;
938 if (!ce)
939 return index_nonexistent;
940 endchar = ce->name[len];
943 * The cache_entry structure returned will contain this dirname
944 * and possibly additional path components.
946 if (endchar == '/')
947 return index_directory;
950 * If there are no additional path components, then this cache_entry
951 * represents a submodule. Submodules, despite being directories,
952 * are stored in the cache without a closing slash.
954 if (!endchar && S_ISGITLINK(ce->ce_mode))
955 return index_gitdir;
957 /* This should never be hit, but it exists just in case. */
958 return index_nonexistent;
962 * The index sorts alphabetically by entry name, which
963 * means that a gitlink sorts as '\0' at the end, while
964 * a directory (which is defined not as an entry, but as
965 * the files it contains) will sort with the '/' at the
966 * end.
968 static enum exist_status directory_exists_in_index(const char *dirname, int len)
970 int pos;
972 if (ignore_case)
973 return directory_exists_in_index_icase(dirname, len);
975 pos = cache_name_pos(dirname, len);
976 if (pos < 0)
977 pos = -pos-1;
978 while (pos < active_nr) {
979 const struct cache_entry *ce = active_cache[pos++];
980 unsigned char endchar;
982 if (strncmp(ce->name, dirname, len))
983 break;
984 endchar = ce->name[len];
985 if (endchar > '/')
986 break;
987 if (endchar == '/')
988 return index_directory;
989 if (!endchar && S_ISGITLINK(ce->ce_mode))
990 return index_gitdir;
992 return index_nonexistent;
996 * When we find a directory when traversing the filesystem, we
997 * have three distinct cases:
999 * - ignore it
1000 * - see it as a directory
1001 * - recurse into it
1003 * and which one we choose depends on a combination of existing
1004 * git index contents and the flags passed into the directory
1005 * traversal routine.
1007 * Case 1: If we *already* have entries in the index under that
1008 * directory name, we always recurse into the directory to see
1009 * all the files.
1011 * Case 2: If we *already* have that directory name as a gitlink,
1012 * we always continue to see it as a gitlink, regardless of whether
1013 * there is an actual git directory there or not (it might not
1014 * be checked out as a subproject!)
1016 * Case 3: if we didn't have it in the index previously, we
1017 * have a few sub-cases:
1019 * (a) if "show_other_directories" is true, we show it as
1020 * just a directory, unless "hide_empty_directories" is
1021 * also true, in which case we need to check if it contains any
1022 * untracked and / or ignored files.
1023 * (b) if it looks like a git directory, and we don't have
1024 * 'no_gitlinks' set we treat it as a gitlink, and show it
1025 * as a directory.
1026 * (c) otherwise, we recurse into it.
1028 static enum path_treatment treat_directory(struct dir_struct *dir,
1029 const char *dirname, int len, int exclude,
1030 const struct path_simplify *simplify)
1032 /* The "len-1" is to strip the final '/' */
1033 switch (directory_exists_in_index(dirname, len-1)) {
1034 case index_directory:
1035 return path_recurse;
1037 case index_gitdir:
1038 return path_none;
1040 case index_nonexistent:
1041 if (dir->flags & DIR_SHOW_OTHER_DIRECTORIES)
1042 break;
1043 if (!(dir->flags & DIR_NO_GITLINKS)) {
1044 unsigned char sha1[20];
1045 if (resolve_gitlink_ref(dirname, "HEAD", sha1) == 0)
1046 return path_untracked;
1048 return path_recurse;
1051 /* This is the "show_other_directories" case */
1053 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
1054 return exclude ? path_excluded : path_untracked;
1056 return read_directory_recursive(dir, dirname, len, 1, simplify);
1060 * This is an inexact early pruning of any recursive directory
1061 * reading - if the path cannot possibly be in the pathspec,
1062 * return true, and we'll skip it early.
1064 static int simplify_away(const char *path, int pathlen, const struct path_simplify *simplify)
1066 if (simplify) {
1067 for (;;) {
1068 const char *match = simplify->path;
1069 int len = simplify->len;
1071 if (!match)
1072 break;
1073 if (len > pathlen)
1074 len = pathlen;
1075 if (!memcmp(path, match, len))
1076 return 0;
1077 simplify++;
1079 return 1;
1081 return 0;
1085 * This function tells us whether an excluded path matches a
1086 * list of "interesting" pathspecs. That is, whether a path matched
1087 * by any of the pathspecs could possibly be ignored by excluding
1088 * the specified path. This can happen if:
1090 * 1. the path is mentioned explicitly in the pathspec
1092 * 2. the path is a directory prefix of some element in the
1093 * pathspec
1095 static int exclude_matches_pathspec(const char *path, int len,
1096 const struct path_simplify *simplify)
1098 if (simplify) {
1099 for (; simplify->path; simplify++) {
1100 if (len == simplify->len
1101 && !memcmp(path, simplify->path, len))
1102 return 1;
1103 if (len < simplify->len
1104 && simplify->path[len] == '/'
1105 && !memcmp(path, simplify->path, len))
1106 return 1;
1109 return 0;
1112 static int get_index_dtype(const char *path, int len)
1114 int pos;
1115 const struct cache_entry *ce;
1117 ce = cache_name_exists(path, len, 0);
1118 if (ce) {
1119 if (!ce_uptodate(ce))
1120 return DT_UNKNOWN;
1121 if (S_ISGITLINK(ce->ce_mode))
1122 return DT_DIR;
1124 * Nobody actually cares about the
1125 * difference between DT_LNK and DT_REG
1127 return DT_REG;
1130 /* Try to look it up as a directory */
1131 pos = cache_name_pos(path, len);
1132 if (pos >= 0)
1133 return DT_UNKNOWN;
1134 pos = -pos-1;
1135 while (pos < active_nr) {
1136 ce = active_cache[pos++];
1137 if (strncmp(ce->name, path, len))
1138 break;
1139 if (ce->name[len] > '/')
1140 break;
1141 if (ce->name[len] < '/')
1142 continue;
1143 if (!ce_uptodate(ce))
1144 break; /* continue? */
1145 return DT_DIR;
1147 return DT_UNKNOWN;
1150 static int get_dtype(struct dirent *de, const char *path, int len)
1152 int dtype = de ? DTYPE(de) : DT_UNKNOWN;
1153 struct stat st;
1155 if (dtype != DT_UNKNOWN)
1156 return dtype;
1157 dtype = get_index_dtype(path, len);
1158 if (dtype != DT_UNKNOWN)
1159 return dtype;
1160 if (lstat(path, &st))
1161 return dtype;
1162 if (S_ISREG(st.st_mode))
1163 return DT_REG;
1164 if (S_ISDIR(st.st_mode))
1165 return DT_DIR;
1166 if (S_ISLNK(st.st_mode))
1167 return DT_LNK;
1168 return dtype;
1171 static enum path_treatment treat_one_path(struct dir_struct *dir,
1172 struct strbuf *path,
1173 const struct path_simplify *simplify,
1174 int dtype, struct dirent *de)
1176 int exclude;
1177 int has_path_in_index = !!cache_name_exists(path->buf, path->len, ignore_case);
1179 if (dtype == DT_UNKNOWN)
1180 dtype = get_dtype(de, path->buf, path->len);
1182 /* Always exclude indexed files */
1183 if (dtype != DT_DIR && has_path_in_index)
1184 return path_none;
1187 * When we are looking at a directory P in the working tree,
1188 * there are three cases:
1190 * (1) P exists in the index. Everything inside the directory P in
1191 * the working tree needs to go when P is checked out from the
1192 * index.
1194 * (2) P does not exist in the index, but there is P/Q in the index.
1195 * We know P will stay a directory when we check out the contents
1196 * of the index, but we do not know yet if there is a directory
1197 * P/Q in the working tree to be killed, so we need to recurse.
1199 * (3) P does not exist in the index, and there is no P/Q in the index
1200 * to require P to be a directory, either. Only in this case, we
1201 * know that everything inside P will not be killed without
1202 * recursing.
1204 if ((dir->flags & DIR_COLLECT_KILLED_ONLY) &&
1205 (dtype == DT_DIR) &&
1206 !has_path_in_index) {
1208 * NEEDSWORK: directory_exists_in_index_icase()
1209 * assumes that one byte past the given path is
1210 * readable and has '/', which needs to be fixed, but
1211 * until then, work it around in the caller.
1213 strbuf_addch(path, '/');
1214 if (directory_exists_in_index(path->buf, path->len - 1) ==
1215 index_nonexistent) {
1216 strbuf_setlen(path, path->len - 1);
1217 return path_none;
1219 strbuf_setlen(path, path->len - 1);
1222 exclude = is_excluded(dir, path->buf, &dtype);
1225 * Excluded? If we don't explicitly want to show
1226 * ignored files, ignore it
1228 if (exclude && !(dir->flags & (DIR_SHOW_IGNORED|DIR_SHOW_IGNORED_TOO)))
1229 return path_excluded;
1231 switch (dtype) {
1232 default:
1233 return path_none;
1234 case DT_DIR:
1235 strbuf_addch(path, '/');
1236 return treat_directory(dir, path->buf, path->len, exclude,
1237 simplify);
1238 case DT_REG:
1239 case DT_LNK:
1240 return exclude ? path_excluded : path_untracked;
1244 static enum path_treatment treat_path(struct dir_struct *dir,
1245 struct dirent *de,
1246 struct strbuf *path,
1247 int baselen,
1248 const struct path_simplify *simplify)
1250 int dtype;
1252 if (is_dot_or_dotdot(de->d_name) || !strcmp(de->d_name, ".git"))
1253 return path_none;
1254 strbuf_setlen(path, baselen);
1255 strbuf_addstr(path, de->d_name);
1256 if (simplify_away(path->buf, path->len, simplify))
1257 return path_none;
1259 dtype = DTYPE(de);
1260 return treat_one_path(dir, path, simplify, dtype, de);
1264 * Read a directory tree. We currently ignore anything but
1265 * directories, regular files and symlinks. That's because git
1266 * doesn't handle them at all yet. Maybe that will change some
1267 * day.
1269 * Also, we ignore the name ".git" (even if it is not a directory).
1270 * That likely will not change.
1272 * Returns the most significant path_treatment value encountered in the scan.
1274 static enum path_treatment read_directory_recursive(struct dir_struct *dir,
1275 const char *base, int baselen,
1276 int check_only,
1277 const struct path_simplify *simplify)
1279 DIR *fdir;
1280 enum path_treatment state, subdir_state, dir_state = path_none;
1281 struct dirent *de;
1282 struct strbuf path = STRBUF_INIT;
1284 strbuf_add(&path, base, baselen);
1286 fdir = opendir(path.len ? path.buf : ".");
1287 if (!fdir)
1288 goto out;
1290 while ((de = readdir(fdir)) != NULL) {
1291 /* check how the file or directory should be treated */
1292 state = treat_path(dir, de, &path, baselen, simplify);
1293 if (state > dir_state)
1294 dir_state = state;
1296 /* recurse into subdir if instructed by treat_path */
1297 if (state == path_recurse) {
1298 subdir_state = read_directory_recursive(dir, path.buf,
1299 path.len, check_only, simplify);
1300 if (subdir_state > dir_state)
1301 dir_state = subdir_state;
1304 if (check_only) {
1305 /* abort early if maximum state has been reached */
1306 if (dir_state == path_untracked)
1307 break;
1308 /* skip the dir_add_* part */
1309 continue;
1312 /* add the path to the appropriate result list */
1313 switch (state) {
1314 case path_excluded:
1315 if (dir->flags & DIR_SHOW_IGNORED)
1316 dir_add_name(dir, path.buf, path.len);
1317 else if ((dir->flags & DIR_SHOW_IGNORED_TOO) ||
1318 ((dir->flags & DIR_COLLECT_IGNORED) &&
1319 exclude_matches_pathspec(path.buf, path.len,
1320 simplify)))
1321 dir_add_ignored(dir, path.buf, path.len);
1322 break;
1324 case path_untracked:
1325 if (!(dir->flags & DIR_SHOW_IGNORED))
1326 dir_add_name(dir, path.buf, path.len);
1327 break;
1329 default:
1330 break;
1333 closedir(fdir);
1334 out:
1335 strbuf_release(&path);
1337 return dir_state;
1340 static int cmp_name(const void *p1, const void *p2)
1342 const struct dir_entry *e1 = *(const struct dir_entry **)p1;
1343 const struct dir_entry *e2 = *(const struct dir_entry **)p2;
1345 return cache_name_compare(e1->name, e1->len,
1346 e2->name, e2->len);
1349 static struct path_simplify *create_simplify(const char **pathspec)
1351 int nr, alloc = 0;
1352 struct path_simplify *simplify = NULL;
1354 if (!pathspec)
1355 return NULL;
1357 for (nr = 0 ; ; nr++) {
1358 const char *match;
1359 if (nr >= alloc) {
1360 alloc = alloc_nr(alloc);
1361 simplify = xrealloc(simplify, alloc * sizeof(*simplify));
1363 match = *pathspec++;
1364 if (!match)
1365 break;
1366 simplify[nr].path = match;
1367 simplify[nr].len = simple_length(match);
1369 simplify[nr].path = NULL;
1370 simplify[nr].len = 0;
1371 return simplify;
1374 static void free_simplify(struct path_simplify *simplify)
1376 free(simplify);
1379 static int treat_leading_path(struct dir_struct *dir,
1380 const char *path, int len,
1381 const struct path_simplify *simplify)
1383 struct strbuf sb = STRBUF_INIT;
1384 int baselen, rc = 0;
1385 const char *cp;
1386 int old_flags = dir->flags;
1388 while (len && path[len - 1] == '/')
1389 len--;
1390 if (!len)
1391 return 1;
1392 baselen = 0;
1393 dir->flags &= ~DIR_SHOW_OTHER_DIRECTORIES;
1394 while (1) {
1395 cp = path + baselen + !!baselen;
1396 cp = memchr(cp, '/', path + len - cp);
1397 if (!cp)
1398 baselen = len;
1399 else
1400 baselen = cp - path;
1401 strbuf_setlen(&sb, 0);
1402 strbuf_add(&sb, path, baselen);
1403 if (!is_directory(sb.buf))
1404 break;
1405 if (simplify_away(sb.buf, sb.len, simplify))
1406 break;
1407 if (treat_one_path(dir, &sb, simplify,
1408 DT_DIR, NULL) == path_none)
1409 break; /* do not recurse into it */
1410 if (len <= baselen) {
1411 rc = 1;
1412 break; /* finished checking */
1415 strbuf_release(&sb);
1416 dir->flags = old_flags;
1417 return rc;
1420 int read_directory(struct dir_struct *dir, const char *path, int len, const char **pathspec)
1422 struct path_simplify *simplify;
1424 if (has_symlink_leading_path(path, len))
1425 return dir->nr;
1427 simplify = create_simplify(pathspec);
1428 if (!len || treat_leading_path(dir, path, len, simplify))
1429 read_directory_recursive(dir, path, len, 0, simplify);
1430 free_simplify(simplify);
1431 qsort(dir->entries, dir->nr, sizeof(struct dir_entry *), cmp_name);
1432 qsort(dir->ignored, dir->ignored_nr, sizeof(struct dir_entry *), cmp_name);
1433 return dir->nr;
1436 int file_exists(const char *f)
1438 struct stat sb;
1439 return lstat(f, &sb) == 0;
1443 * Given two normalized paths (a trailing slash is ok), if subdir is
1444 * outside dir, return -1. Otherwise return the offset in subdir that
1445 * can be used as relative path to dir.
1447 int dir_inside_of(const char *subdir, const char *dir)
1449 int offset = 0;
1451 assert(dir && subdir && *dir && *subdir);
1453 while (*dir && *subdir && *dir == *subdir) {
1454 dir++;
1455 subdir++;
1456 offset++;
1459 /* hel[p]/me vs hel[l]/yeah */
1460 if (*dir && *subdir)
1461 return -1;
1463 if (!*subdir)
1464 return !*dir ? offset : -1; /* same dir */
1466 /* foo/[b]ar vs foo/[] */
1467 if (is_dir_sep(dir[-1]))
1468 return is_dir_sep(subdir[-1]) ? offset : -1;
1470 /* foo[/]bar vs foo[] */
1471 return is_dir_sep(*subdir) ? offset + 1 : -1;
1474 int is_inside_dir(const char *dir)
1476 char cwd[PATH_MAX];
1477 if (!dir)
1478 return 0;
1479 if (!getcwd(cwd, sizeof(cwd)))
1480 die_errno("can't find the current directory");
1481 return dir_inside_of(cwd, dir) >= 0;
1484 int is_empty_dir(const char *path)
1486 DIR *dir = opendir(path);
1487 struct dirent *e;
1488 int ret = 1;
1490 if (!dir)
1491 return 0;
1493 while ((e = readdir(dir)) != NULL)
1494 if (!is_dot_or_dotdot(e->d_name)) {
1495 ret = 0;
1496 break;
1499 closedir(dir);
1500 return ret;
1503 static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up)
1505 DIR *dir;
1506 struct dirent *e;
1507 int ret = 0, original_len = path->len, len, kept_down = 0;
1508 int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY);
1509 int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL);
1510 unsigned char submodule_head[20];
1512 if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) &&
1513 !resolve_gitlink_ref(path->buf, "HEAD", submodule_head)) {
1514 /* Do not descend and nuke a nested git work tree. */
1515 if (kept_up)
1516 *kept_up = 1;
1517 return 0;
1520 flag &= ~REMOVE_DIR_KEEP_TOPLEVEL;
1521 dir = opendir(path->buf);
1522 if (!dir) {
1523 /* an empty dir could be removed even if it is unreadble */
1524 if (!keep_toplevel)
1525 return rmdir(path->buf);
1526 else
1527 return -1;
1529 if (path->buf[original_len - 1] != '/')
1530 strbuf_addch(path, '/');
1532 len = path->len;
1533 while ((e = readdir(dir)) != NULL) {
1534 struct stat st;
1535 if (is_dot_or_dotdot(e->d_name))
1536 continue;
1538 strbuf_setlen(path, len);
1539 strbuf_addstr(path, e->d_name);
1540 if (lstat(path->buf, &st))
1541 ; /* fall thru */
1542 else if (S_ISDIR(st.st_mode)) {
1543 if (!remove_dir_recurse(path, flag, &kept_down))
1544 continue; /* happy */
1545 } else if (!only_empty && !unlink(path->buf))
1546 continue; /* happy, too */
1548 /* path too long, stat fails, or non-directory still exists */
1549 ret = -1;
1550 break;
1552 closedir(dir);
1554 strbuf_setlen(path, original_len);
1555 if (!ret && !keep_toplevel && !kept_down)
1556 ret = rmdir(path->buf);
1557 else if (kept_up)
1559 * report the uplevel that it is not an error that we
1560 * did not rmdir() our directory.
1562 *kept_up = !ret;
1563 return ret;
1566 int remove_dir_recursively(struct strbuf *path, int flag)
1568 return remove_dir_recurse(path, flag, NULL);
1571 void setup_standard_excludes(struct dir_struct *dir)
1573 const char *path;
1574 char *xdg_path;
1576 dir->exclude_per_dir = ".gitignore";
1577 path = git_path("info/exclude");
1578 if (!excludes_file) {
1579 home_config_paths(NULL, &xdg_path, "ignore");
1580 excludes_file = xdg_path;
1582 if (!access_or_warn(path, R_OK, 0))
1583 add_excludes_from_file(dir, path);
1584 if (excludes_file && !access_or_warn(excludes_file, R_OK, 0))
1585 add_excludes_from_file(dir, excludes_file);
1588 int remove_path(const char *name)
1590 char *slash;
1592 if (unlink(name) && errno != ENOENT && errno != ENOTDIR)
1593 return -1;
1595 slash = strrchr(name, '/');
1596 if (slash) {
1597 char *dirs = xstrdup(name);
1598 slash = dirs + (slash - name);
1599 do {
1600 *slash = '\0';
1601 } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/')));
1602 free(dirs);
1604 return 0;
1607 static int pathspec_item_cmp(const void *a_, const void *b_)
1609 struct pathspec_item *a, *b;
1611 a = (struct pathspec_item *)a_;
1612 b = (struct pathspec_item *)b_;
1613 return strcmp(a->match, b->match);
1616 int init_pathspec(struct pathspec *pathspec, const char **paths)
1618 const char **p = paths;
1619 int i;
1621 memset(pathspec, 0, sizeof(*pathspec));
1622 if (!p)
1623 return 0;
1624 while (*p)
1625 p++;
1626 pathspec->raw = paths;
1627 pathspec->nr = p - paths;
1628 if (!pathspec->nr)
1629 return 0;
1631 pathspec->items = xmalloc(sizeof(struct pathspec_item)*pathspec->nr);
1632 for (i = 0; i < pathspec->nr; i++) {
1633 struct pathspec_item *item = pathspec->items+i;
1634 const char *path = paths[i];
1636 item->match = path;
1637 item->len = strlen(path);
1638 item->flags = 0;
1639 if (limit_pathspec_to_literal()) {
1640 item->nowildcard_len = item->len;
1641 } else {
1642 item->nowildcard_len = simple_length(path);
1643 if (item->nowildcard_len < item->len) {
1644 pathspec->has_wildcard = 1;
1645 if (path[item->nowildcard_len] == '*' &&
1646 no_wildcard(path + item->nowildcard_len + 1))
1647 item->flags |= PATHSPEC_ONESTAR;
1652 qsort(pathspec->items, pathspec->nr,
1653 sizeof(struct pathspec_item), pathspec_item_cmp);
1655 return 0;
1658 void free_pathspec(struct pathspec *pathspec)
1660 free(pathspec->items);
1661 pathspec->items = NULL;
1664 int limit_pathspec_to_literal(void)
1666 static int flag = -1;
1667 if (flag < 0)
1668 flag = git_env_bool(GIT_LITERAL_PATHSPECS_ENVIRONMENT, 0);
1669 return flag;
1673 * Frees memory within dir which was allocated for exclude lists and
1674 * the exclude_stack. Does not free dir itself.
1676 void clear_directory(struct dir_struct *dir)
1678 int i, j;
1679 struct exclude_list_group *group;
1680 struct exclude_list *el;
1681 struct exclude_stack *stk;
1683 for (i = EXC_CMDL; i <= EXC_FILE; i++) {
1684 group = &dir->exclude_list_group[i];
1685 for (j = 0; j < group->nr; j++) {
1686 el = &group->el[j];
1687 if (i == EXC_DIRS)
1688 free((char *)el->src);
1689 clear_exclude_list(el);
1691 free(group->el);
1694 stk = dir->exclude_stack;
1695 while (stk) {
1696 struct exclude_stack *prev = stk->prev;
1697 free(stk);
1698 stk = prev;