2 * This handles recursive filename detection with exclude
3 * files, index knowledge etc..
5 * Copyright (C) Linus Torvalds, 2005-2006
6 * Junio Hamano, 2005-2006
12 struct path_simplify {
17 static int read_directory_recursive(struct dir_struct *dir, const char *path, int len,
18 int check_only, const struct path_simplify *simplify);
19 static int get_dtype(struct dirent *de, const char *path, int len);
21 /* helper string functions with support for the ignore_case flag */
22 int strcmp_icase(const char *a, const char *b)
24 return ignore_case ? strcasecmp(a, b) : strcmp(a, b);
27 int strncmp_icase(const char *a, const char *b, size_t count)
29 return ignore_case ? strncasecmp(a, b, count) : strncmp(a, b, count);
32 int fnmatch_icase(const char *pattern, const char *string, int flags)
34 return fnmatch(pattern, string, flags | (ignore_case ? FNM_CASEFOLD : 0));
37 static size_t common_prefix_len(const char **pathspec)
39 const char *n, *first;
46 while ((n = *pathspec++)) {
48 for (i = 0; first == n || i < max; i++) {
50 if (!c || c != first[i] || is_glob_special(c))
55 if (first == n || len < max) {
65 * Returns a copy of the longest leading path common among all
68 char *common_prefix(const char **pathspec)
70 unsigned long len = common_prefix_len(pathspec);
72 return len ? xmemdupz(*pathspec, len) : NULL;
75 int fill_directory(struct dir_struct *dir, const char **pathspec)
80 * Calculate common prefix for the pathspec, and
81 * use that to optimize the directory walk
83 len = common_prefix_len(pathspec);
85 /* Read the directory and prune it */
86 read_directory(dir, pathspec ? *pathspec : "", len, pathspec);
90 int within_depth(const char *name, int namelen,
91 int depth, int max_depth)
93 const char *cp = name, *cpe = name + namelen;
99 if (depth > max_depth)
106 * Does 'match' match the given name?
107 * A match is found if
109 * (1) the 'match' string is leading directory of 'name', or
110 * (2) the 'match' string is a wildcard and matches 'name', or
111 * (3) the 'match' string is exactly the same as 'name'.
113 * and the return value tells which case it was.
115 * It returns 0 when there is no match.
117 static int match_one(const char *match, const char *name, int namelen)
121 /* If the match was just the prefix, we matched */
123 return MATCHED_RECURSIVELY;
127 unsigned char c1 = tolower(*match);
128 unsigned char c2 = tolower(*name);
129 if (c1 == '\0' || is_glob_special(c1))
139 unsigned char c1 = *match;
140 unsigned char c2 = *name;
141 if (c1 == '\0' || is_glob_special(c1))
153 * If we don't match the matchstring exactly,
154 * we need to match by fnmatch
156 matchlen = strlen(match);
157 if (strncmp_icase(match, name, matchlen))
158 return !fnmatch_icase(match, name, 0) ? MATCHED_FNMATCH : 0;
160 if (namelen == matchlen)
161 return MATCHED_EXACTLY;
162 if (match[matchlen-1] == '/' || name[matchlen] == '/')
163 return MATCHED_RECURSIVELY;
168 * Given a name and a list of pathspecs, see if the name matches
169 * any of the pathspecs. The caller is also interested in seeing
170 * all pathspec matches some names it calls this function with
171 * (otherwise the user could have mistyped the unmatched pathspec),
172 * and a mark is left in seen[] array for pathspec element that
173 * actually matched anything.
175 int match_pathspec(const char **pathspec, const char *name, int namelen,
176 int prefix, char *seen)
186 for (i = 0; pathspec[i] != NULL; i++) {
188 const char *match = pathspec[i] + prefix;
189 if (seen && seen[i] == MATCHED_EXACTLY)
191 how = match_one(match, name, namelen);
195 if (seen && seen[i] < how)
203 * Does 'match' match the given name?
204 * A match is found if
206 * (1) the 'match' string is leading directory of 'name', or
207 * (2) the 'match' string is a wildcard and matches 'name', or
208 * (3) the 'match' string is exactly the same as 'name'.
210 * and the return value tells which case it was.
212 * It returns 0 when there is no match.
214 static int match_pathspec_item(const struct pathspec_item *item, int prefix,
215 const char *name, int namelen)
217 /* name/namelen has prefix cut off by caller */
218 const char *match = item->match + prefix;
219 int matchlen = item->len - prefix;
221 /* If the match was just the prefix, we matched */
223 return MATCHED_RECURSIVELY;
225 if (matchlen <= namelen && !strncmp(match, name, matchlen)) {
226 if (matchlen == namelen)
227 return MATCHED_EXACTLY;
229 if (match[matchlen-1] == '/' || name[matchlen] == '/')
230 return MATCHED_RECURSIVELY;
233 if (item->use_wildcard && !fnmatch(match, name, 0))
234 return MATCHED_FNMATCH;
240 * Given a name and a list of pathspecs, see if the name matches
241 * any of the pathspecs. The caller is also interested in seeing
242 * all pathspec matches some names it calls this function with
243 * (otherwise the user could have mistyped the unmatched pathspec),
244 * and a mark is left in seen[] array for pathspec element that
245 * actually matched anything.
247 int match_pathspec_depth(const struct pathspec *ps,
248 const char *name, int namelen,
249 int prefix, char *seen)
254 if (!ps->recursive || ps->max_depth == -1)
255 return MATCHED_RECURSIVELY;
257 if (within_depth(name, namelen, 0, ps->max_depth))
258 return MATCHED_EXACTLY;
266 for (i = ps->nr - 1; i >= 0; i--) {
268 if (seen && seen[i] == MATCHED_EXACTLY)
270 how = match_pathspec_item(ps->items+i, prefix, name, namelen);
271 if (ps->recursive && ps->max_depth != -1 &&
272 how && how != MATCHED_FNMATCH) {
273 int len = ps->items[i].len;
274 if (name[len] == '/')
276 if (within_depth(name+len, namelen-len, 0, ps->max_depth))
277 how = MATCHED_EXACTLY;
284 if (seen && seen[i] < how)
292 * Return the length of the "simple" part of a path match limiter.
294 static int simple_length(const char *match)
299 unsigned char c = *match++;
301 if (c == '\0' || is_glob_special(c))
306 static int no_wildcard(const char *string)
308 return string[simple_length(string)] == '\0';
311 void add_exclude(const char *string, const char *base,
312 int baselen, struct exclude_list *which)
319 if (*string == '!') {
323 len = strlen(string);
324 if (len && string[len - 1] == '/') {
326 x = xmalloc(sizeof(*x) + len);
328 memcpy(s, string, len - 1);
332 flags = EXC_FLAG_MUSTBEDIR;
334 x = xmalloc(sizeof(*x));
337 x->to_exclude = to_exclude;
338 x->patternlen = strlen(string);
340 x->baselen = baselen;
342 if (!strchr(string, '/'))
343 x->flags |= EXC_FLAG_NODIR;
344 x->nowildcardlen = simple_length(string);
345 if (*string == '*' && no_wildcard(string+1))
346 x->flags |= EXC_FLAG_ENDSWITH;
347 ALLOC_GROW(which->excludes, which->nr + 1, which->alloc);
348 which->excludes[which->nr++] = x;
351 static void *read_skip_worktree_file_from_index(const char *path, size_t *size)
355 enum object_type type;
357 struct index_state *istate = &the_index;
360 pos = index_name_pos(istate, path, len);
363 if (!ce_skip_worktree(istate->cache[pos]))
365 data = read_sha1_file(istate->cache[pos]->sha1, &type, &sz);
366 if (!data || type != OBJ_BLOB) {
374 void free_excludes(struct exclude_list *el)
378 for (i = 0; i < el->nr; i++)
379 free(el->excludes[i]);
386 int add_excludes_from_file_to_list(const char *fname,
390 struct exclude_list *which,
398 fd = open(fname, O_RDONLY);
399 if (fd < 0 || fstat(fd, &st) < 0) {
403 (buf = read_skip_worktree_file_from_index(fname, &size)) == NULL)
409 if (buf[size-1] != '\n') {
410 buf = xrealloc(buf, size+1);
415 size = xsize_t(st.st_size);
420 buf = xmalloc(size+1);
421 if (read_in_full(fd, buf, size) != size) {
433 for (i = 0; i < size; i++) {
434 if (buf[i] == '\n') {
435 if (entry != buf + i && entry[0] != '#') {
436 buf[i - (i && buf[i-1] == '\r')] = 0;
437 add_exclude(entry, base, baselen, which);
445 void add_excludes_from_file(struct dir_struct *dir, const char *fname)
447 if (add_excludes_from_file_to_list(fname, "", 0, NULL,
448 &dir->exclude_list[EXC_FILE], 0) < 0)
449 die("cannot use %s as an exclude file", fname);
452 static void prep_exclude(struct dir_struct *dir, const char *base, int baselen)
454 struct exclude_list *el;
455 struct exclude_stack *stk = NULL;
458 if ((!dir->exclude_per_dir) ||
459 (baselen + strlen(dir->exclude_per_dir) >= PATH_MAX))
460 return; /* too long a path -- ignore */
462 /* Pop the ones that are not the prefix of the path being checked. */
463 el = &dir->exclude_list[EXC_DIRS];
464 while ((stk = dir->exclude_stack) != NULL) {
465 if (stk->baselen <= baselen &&
466 !strncmp(dir->basebuf, base, stk->baselen))
468 dir->exclude_stack = stk->prev;
469 while (stk->exclude_ix < el->nr)
470 free(el->excludes[--el->nr]);
475 /* Read from the parent directories and push them down. */
476 current = stk ? stk->baselen : -1;
477 while (current < baselen) {
478 struct exclude_stack *stk = xcalloc(1, sizeof(*stk));
486 cp = strchr(base + current + 1, '/');
488 die("oops in prep_exclude");
491 stk->prev = dir->exclude_stack;
492 stk->baselen = cp - base;
493 stk->exclude_ix = el->nr;
494 memcpy(dir->basebuf + current, base + current,
495 stk->baselen - current);
496 strcpy(dir->basebuf + stk->baselen, dir->exclude_per_dir);
497 add_excludes_from_file_to_list(dir->basebuf,
498 dir->basebuf, stk->baselen,
499 &stk->filebuf, el, 1);
500 dir->exclude_stack = stk;
501 current = stk->baselen;
503 dir->basebuf[baselen] = '\0';
506 /* Scan the list and let the last match determine the fate.
507 * Return 1 for exclude, 0 for include and -1 for undecided.
509 int excluded_from_list(const char *pathname,
510 int pathlen, const char *basename, int *dtype,
511 struct exclude_list *el)
516 return -1; /* undefined */
518 for (i = el->nr - 1; 0 <= i; i--) {
519 struct exclude *x = el->excludes[i];
520 const char *name, *exclude = x->pattern;
521 int to_exclude = x->to_exclude;
522 int namelen, prefix = x->nowildcardlen;
524 if (x->flags & EXC_FLAG_MUSTBEDIR) {
525 if (*dtype == DT_UNKNOWN)
526 *dtype = get_dtype(NULL, pathname, pathlen);
527 if (*dtype != DT_DIR)
531 if (x->flags & EXC_FLAG_NODIR) {
533 if (prefix == x->patternlen) {
534 if (!strcmp_icase(exclude, basename))
536 } else if (x->flags & EXC_FLAG_ENDSWITH) {
537 int len = pathlen - (basename - pathname);
538 if (x->patternlen - 1 <= len &&
539 !strcmp_icase(exclude + 1, basename + len - x->patternlen + 1))
542 if (fnmatch_icase(exclude, basename, 0) == 0)
548 /* match with FNM_PATHNAME:
549 * exclude has base (baselen long) implicitly in front of it.
551 if (*exclude == '/') {
556 if (pathlen < x->baselen ||
557 (x->baselen && pathname[x->baselen-1] != '/') ||
558 strncmp_icase(pathname, x->base, x->baselen))
561 namelen = x->baselen ? pathlen - x->baselen : pathlen;
562 name = pathname + pathlen - namelen;
564 /* if the non-wildcard part is longer than the
565 remaining pathname, surely it cannot match */
566 if (prefix > namelen)
570 if (strncmp_icase(exclude, name, prefix))
577 if (!namelen || !fnmatch_icase(exclude, name, FNM_PATHNAME))
580 return -1; /* undecided */
583 static int excluded(struct dir_struct *dir, const char *pathname, int *dtype_p)
585 int pathlen = strlen(pathname);
587 const char *basename = strrchr(pathname, '/');
588 basename = (basename) ? basename+1 : pathname;
590 prep_exclude(dir, pathname, basename-pathname);
591 for (st = EXC_CMDL; st <= EXC_FILE; st++) {
592 switch (excluded_from_list(pathname, pathlen, basename,
593 dtype_p, &dir->exclude_list[st])) {
603 void path_exclude_check_init(struct path_exclude_check *check,
604 struct dir_struct *dir)
607 strbuf_init(&check->path, 256);
610 void path_exclude_check_clear(struct path_exclude_check *check)
612 strbuf_release(&check->path);
616 * Is this name excluded? This is for a caller like show_files() that
617 * do not honor directory hierarchy and iterate through paths that are
618 * possibly in an ignored directory.
620 * A path to a directory known to be excluded is left in check->path to
621 * optimize for repeated checks for files in the same excluded directory.
623 int path_excluded(struct path_exclude_check *check,
624 const char *name, int namelen, int *dtype)
627 struct strbuf *path = &check->path;
630 * we allow the caller to pass namelen as an optimization; it
631 * must match the length of the name, as we eventually call
632 * excluded() on the whole name string.
635 namelen = strlen(name);
638 path->len <= namelen &&
639 !memcmp(name, path->buf, path->len) &&
640 (!name[path->len] || name[path->len] == '/'))
643 strbuf_setlen(path, 0);
644 for (i = 0; name[i]; i++) {
649 if (excluded(check->dir, path->buf, &dt))
652 strbuf_addch(path, ch);
655 /* An entry in the index; cannot be a directory with subentries */
656 strbuf_setlen(path, 0);
658 return excluded(check->dir, name, dtype);
661 static struct dir_entry *dir_entry_new(const char *pathname, int len)
663 struct dir_entry *ent;
665 ent = xmalloc(sizeof(*ent) + len + 1);
667 memcpy(ent->name, pathname, len);
672 static struct dir_entry *dir_add_name(struct dir_struct *dir, const char *pathname, int len)
674 if (cache_name_exists(pathname, len, ignore_case))
677 ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc);
678 return dir->entries[dir->nr++] = dir_entry_new(pathname, len);
681 struct dir_entry *dir_add_ignored(struct dir_struct *dir, const char *pathname, int len)
683 if (!cache_name_is_other(pathname, len))
686 ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc);
687 return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);
691 index_nonexistent = 0,
697 * Do not use the alphabetically stored index to look up
698 * the directory name; instead, use the case insensitive
701 static enum exist_status directory_exists_in_index_icase(const char *dirname, int len)
703 struct cache_entry *ce = index_name_exists(&the_index, dirname, len + 1, ignore_case);
704 unsigned char endchar;
707 return index_nonexistent;
708 endchar = ce->name[len];
711 * The cache_entry structure returned will contain this dirname
712 * and possibly additional path components.
715 return index_directory;
718 * If there are no additional path components, then this cache_entry
719 * represents a submodule. Submodules, despite being directories,
720 * are stored in the cache without a closing slash.
722 if (!endchar && S_ISGITLINK(ce->ce_mode))
725 /* This should never be hit, but it exists just in case. */
726 return index_nonexistent;
730 * The index sorts alphabetically by entry name, which
731 * means that a gitlink sorts as '\0' at the end, while
732 * a directory (which is defined not as an entry, but as
733 * the files it contains) will sort with the '/' at the
736 static enum exist_status directory_exists_in_index(const char *dirname, int len)
741 return directory_exists_in_index_icase(dirname, len);
743 pos = cache_name_pos(dirname, len);
746 while (pos < active_nr) {
747 struct cache_entry *ce = active_cache[pos++];
748 unsigned char endchar;
750 if (strncmp(ce->name, dirname, len))
752 endchar = ce->name[len];
756 return index_directory;
757 if (!endchar && S_ISGITLINK(ce->ce_mode))
760 return index_nonexistent;
764 * When we find a directory when traversing the filesystem, we
765 * have three distinct cases:
768 * - see it as a directory
771 * and which one we choose depends on a combination of existing
772 * git index contents and the flags passed into the directory
775 * Case 1: If we *already* have entries in the index under that
776 * directory name, we always recurse into the directory to see
779 * Case 2: If we *already* have that directory name as a gitlink,
780 * we always continue to see it as a gitlink, regardless of whether
781 * there is an actual git directory there or not (it might not
782 * be checked out as a subproject!)
784 * Case 3: if we didn't have it in the index previously, we
785 * have a few sub-cases:
787 * (a) if "show_other_directories" is true, we show it as
788 * just a directory, unless "hide_empty_directories" is
789 * also true and the directory is empty, in which case
790 * we just ignore it entirely.
791 * (b) if it looks like a git directory, and we don't have
792 * 'no_gitlinks' set we treat it as a gitlink, and show it
794 * (c) otherwise, we recurse into it.
796 enum directory_treatment {
799 recurse_into_directory
802 static enum directory_treatment treat_directory(struct dir_struct *dir,
803 const char *dirname, int len,
804 const struct path_simplify *simplify)
806 /* The "len-1" is to strip the final '/' */
807 switch (directory_exists_in_index(dirname, len-1)) {
808 case index_directory:
809 return recurse_into_directory;
812 if (dir->flags & DIR_SHOW_OTHER_DIRECTORIES)
813 return ignore_directory;
814 return show_directory;
816 case index_nonexistent:
817 if (dir->flags & DIR_SHOW_OTHER_DIRECTORIES)
819 if (!(dir->flags & DIR_NO_GITLINKS)) {
820 unsigned char sha1[20];
821 if (resolve_gitlink_ref(dirname, "HEAD", sha1) == 0)
822 return show_directory;
824 return recurse_into_directory;
827 /* This is the "show_other_directories" case */
828 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
829 return show_directory;
830 if (!read_directory_recursive(dir, dirname, len, 1, simplify))
831 return ignore_directory;
832 return show_directory;
836 * This is an inexact early pruning of any recursive directory
837 * reading - if the path cannot possibly be in the pathspec,
838 * return true, and we'll skip it early.
840 static int simplify_away(const char *path, int pathlen, const struct path_simplify *simplify)
844 const char *match = simplify->path;
845 int len = simplify->len;
851 if (!memcmp(path, match, len))
861 * This function tells us whether an excluded path matches a
862 * list of "interesting" pathspecs. That is, whether a path matched
863 * by any of the pathspecs could possibly be ignored by excluding
864 * the specified path. This can happen if:
866 * 1. the path is mentioned explicitly in the pathspec
868 * 2. the path is a directory prefix of some element in the
871 static int exclude_matches_pathspec(const char *path, int len,
872 const struct path_simplify *simplify)
875 for (; simplify->path; simplify++) {
876 if (len == simplify->len
877 && !memcmp(path, simplify->path, len))
879 if (len < simplify->len
880 && simplify->path[len] == '/'
881 && !memcmp(path, simplify->path, len))
888 static int get_index_dtype(const char *path, int len)
891 struct cache_entry *ce;
893 ce = cache_name_exists(path, len, 0);
895 if (!ce_uptodate(ce))
897 if (S_ISGITLINK(ce->ce_mode))
900 * Nobody actually cares about the
901 * difference between DT_LNK and DT_REG
906 /* Try to look it up as a directory */
907 pos = cache_name_pos(path, len);
911 while (pos < active_nr) {
912 ce = active_cache[pos++];
913 if (strncmp(ce->name, path, len))
915 if (ce->name[len] > '/')
917 if (ce->name[len] < '/')
919 if (!ce_uptodate(ce))
920 break; /* continue? */
926 static int get_dtype(struct dirent *de, const char *path, int len)
928 int dtype = de ? DTYPE(de) : DT_UNKNOWN;
931 if (dtype != DT_UNKNOWN)
933 dtype = get_index_dtype(path, len);
934 if (dtype != DT_UNKNOWN)
936 if (lstat(path, &st))
938 if (S_ISREG(st.st_mode))
940 if (S_ISDIR(st.st_mode))
942 if (S_ISLNK(st.st_mode))
947 enum path_treatment {
953 static enum path_treatment treat_one_path(struct dir_struct *dir,
955 const struct path_simplify *simplify,
956 int dtype, struct dirent *de)
958 int exclude = excluded(dir, path->buf, &dtype);
959 if (exclude && (dir->flags & DIR_COLLECT_IGNORED)
960 && exclude_matches_pathspec(path->buf, path->len, simplify))
961 dir_add_ignored(dir, path->buf, path->len);
964 * Excluded? If we don't explicitly want to show
965 * ignored files, ignore it
967 if (exclude && !(dir->flags & DIR_SHOW_IGNORED))
970 if (dtype == DT_UNKNOWN)
971 dtype = get_dtype(de, path->buf, path->len);
974 * Do we want to see just the ignored files?
975 * We still need to recurse into directories,
976 * even if we don't ignore them, since the
977 * directory may contain files that we do..
979 if (!exclude && (dir->flags & DIR_SHOW_IGNORED)) {
988 strbuf_addch(path, '/');
989 switch (treat_directory(dir, path->buf, path->len, simplify)) {
991 if (exclude != !!(dir->flags
995 case recurse_into_directory:
997 case ignore_directory:
1005 return path_handled;
1008 static enum path_treatment treat_path(struct dir_struct *dir,
1010 struct strbuf *path,
1012 const struct path_simplify *simplify)
1016 if (is_dot_or_dotdot(de->d_name) || !strcmp(de->d_name, ".git"))
1017 return path_ignored;
1018 strbuf_setlen(path, baselen);
1019 strbuf_addstr(path, de->d_name);
1020 if (simplify_away(path->buf, path->len, simplify))
1021 return path_ignored;
1024 return treat_one_path(dir, path, simplify, dtype, de);
1028 * Read a directory tree. We currently ignore anything but
1029 * directories, regular files and symlinks. That's because git
1030 * doesn't handle them at all yet. Maybe that will change some
1033 * Also, we ignore the name ".git" (even if it is not a directory).
1034 * That likely will not change.
1036 static int read_directory_recursive(struct dir_struct *dir,
1037 const char *base, int baselen,
1039 const struct path_simplify *simplify)
1044 struct strbuf path = STRBUF_INIT;
1046 strbuf_add(&path, base, baselen);
1048 fdir = opendir(path.len ? path.buf : ".");
1052 while ((de = readdir(fdir)) != NULL) {
1053 switch (treat_path(dir, de, &path, baselen, simplify)) {
1055 contents += read_directory_recursive(dir, path.buf,
1067 dir_add_name(dir, path.buf, path.len);
1071 strbuf_release(&path);
1076 static int cmp_name(const void *p1, const void *p2)
1078 const struct dir_entry *e1 = *(const struct dir_entry **)p1;
1079 const struct dir_entry *e2 = *(const struct dir_entry **)p2;
1081 return cache_name_compare(e1->name, e1->len,
1085 static struct path_simplify *create_simplify(const char **pathspec)
1088 struct path_simplify *simplify = NULL;
1093 for (nr = 0 ; ; nr++) {
1096 alloc = alloc_nr(alloc);
1097 simplify = xrealloc(simplify, alloc * sizeof(*simplify));
1099 match = *pathspec++;
1102 simplify[nr].path = match;
1103 simplify[nr].len = simple_length(match);
1105 simplify[nr].path = NULL;
1106 simplify[nr].len = 0;
1110 static void free_simplify(struct path_simplify *simplify)
1115 static int treat_leading_path(struct dir_struct *dir,
1116 const char *path, int len,
1117 const struct path_simplify *simplify)
1119 struct strbuf sb = STRBUF_INIT;
1120 int baselen, rc = 0;
1123 while (len && path[len - 1] == '/')
1129 cp = path + baselen + !!baselen;
1130 cp = memchr(cp, '/', path + len - cp);
1134 baselen = cp - path;
1135 strbuf_setlen(&sb, 0);
1136 strbuf_add(&sb, path, baselen);
1137 if (!is_directory(sb.buf))
1139 if (simplify_away(sb.buf, sb.len, simplify))
1141 if (treat_one_path(dir, &sb, simplify,
1142 DT_DIR, NULL) == path_ignored)
1143 break; /* do not recurse into it */
1144 if (len <= baselen) {
1146 break; /* finished checking */
1149 strbuf_release(&sb);
1153 int read_directory(struct dir_struct *dir, const char *path, int len, const char **pathspec)
1155 struct path_simplify *simplify;
1157 if (has_symlink_leading_path(path, len))
1160 simplify = create_simplify(pathspec);
1161 if (!len || treat_leading_path(dir, path, len, simplify))
1162 read_directory_recursive(dir, path, len, 0, simplify);
1163 free_simplify(simplify);
1164 qsort(dir->entries, dir->nr, sizeof(struct dir_entry *), cmp_name);
1165 qsort(dir->ignored, dir->ignored_nr, sizeof(struct dir_entry *), cmp_name);
1169 int file_exists(const char *f)
1172 return lstat(f, &sb) == 0;
1176 * Given two normalized paths (a trailing slash is ok), if subdir is
1177 * outside dir, return -1. Otherwise return the offset in subdir that
1178 * can be used as relative path to dir.
1180 int dir_inside_of(const char *subdir, const char *dir)
1184 assert(dir && subdir && *dir && *subdir);
1186 while (*dir && *subdir && *dir == *subdir) {
1192 /* hel[p]/me vs hel[l]/yeah */
1193 if (*dir && *subdir)
1197 return !*dir ? offset : -1; /* same dir */
1199 /* foo/[b]ar vs foo/[] */
1200 if (is_dir_sep(dir[-1]))
1201 return is_dir_sep(subdir[-1]) ? offset : -1;
1203 /* foo[/]bar vs foo[] */
1204 return is_dir_sep(*subdir) ? offset + 1 : -1;
1207 int is_inside_dir(const char *dir)
1212 if (!getcwd(cwd, sizeof(cwd)))
1213 die_errno("can't find the current directory");
1214 return dir_inside_of(cwd, dir) >= 0;
1217 int is_empty_dir(const char *path)
1219 DIR *dir = opendir(path);
1226 while ((e = readdir(dir)) != NULL)
1227 if (!is_dot_or_dotdot(e->d_name)) {
1236 static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up)
1240 int ret = 0, original_len = path->len, len, kept_down = 0;
1241 int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY);
1242 int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL);
1243 unsigned char submodule_head[20];
1245 if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) &&
1246 !resolve_gitlink_ref(path->buf, "HEAD", submodule_head)) {
1247 /* Do not descend and nuke a nested git work tree. */
1253 flag &= ~REMOVE_DIR_KEEP_TOPLEVEL;
1254 dir = opendir(path->buf);
1256 /* an empty dir could be removed even if it is unreadble */
1258 return rmdir(path->buf);
1262 if (path->buf[original_len - 1] != '/')
1263 strbuf_addch(path, '/');
1266 while ((e = readdir(dir)) != NULL) {
1268 if (is_dot_or_dotdot(e->d_name))
1271 strbuf_setlen(path, len);
1272 strbuf_addstr(path, e->d_name);
1273 if (lstat(path->buf, &st))
1275 else if (S_ISDIR(st.st_mode)) {
1276 if (!remove_dir_recurse(path, flag, &kept_down))
1277 continue; /* happy */
1278 } else if (!only_empty && !unlink(path->buf))
1279 continue; /* happy, too */
1281 /* path too long, stat fails, or non-directory still exists */
1287 strbuf_setlen(path, original_len);
1288 if (!ret && !keep_toplevel && !kept_down)
1289 ret = rmdir(path->buf);
1292 * report the uplevel that it is not an error that we
1293 * did not rmdir() our directory.
1299 int remove_dir_recursively(struct strbuf *path, int flag)
1301 return remove_dir_recurse(path, flag, NULL);
1304 void setup_standard_excludes(struct dir_struct *dir)
1308 dir->exclude_per_dir = ".gitignore";
1309 path = git_path("info/exclude");
1310 if (!access(path, R_OK))
1311 add_excludes_from_file(dir, path);
1312 if (excludes_file && !access(excludes_file, R_OK))
1313 add_excludes_from_file(dir, excludes_file);
1316 int remove_path(const char *name)
1320 if (unlink(name) && errno != ENOENT)
1323 slash = strrchr(name, '/');
1325 char *dirs = xstrdup(name);
1326 slash = dirs + (slash - name);
1329 } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/')));
1335 static int pathspec_item_cmp(const void *a_, const void *b_)
1337 struct pathspec_item *a, *b;
1339 a = (struct pathspec_item *)a_;
1340 b = (struct pathspec_item *)b_;
1341 return strcmp(a->match, b->match);
1344 int init_pathspec(struct pathspec *pathspec, const char **paths)
1346 const char **p = paths;
1349 memset(pathspec, 0, sizeof(*pathspec));
1354 pathspec->raw = paths;
1355 pathspec->nr = p - paths;
1359 pathspec->items = xmalloc(sizeof(struct pathspec_item)*pathspec->nr);
1360 for (i = 0; i < pathspec->nr; i++) {
1361 struct pathspec_item *item = pathspec->items+i;
1362 const char *path = paths[i];
1365 item->len = strlen(path);
1366 item->use_wildcard = !no_wildcard(path);
1367 if (item->use_wildcard)
1368 pathspec->has_wildcard = 1;
1371 qsort(pathspec->items, pathspec->nr,
1372 sizeof(struct pathspec_item), pathspec_item_cmp);
1377 void free_pathspec(struct pathspec *pathspec)
1379 free(pathspec->items);
1380 pathspec->items = NULL;