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
14 struct path_simplify
{
19 static int read_directory_recursive(struct dir_struct
*dir
, const char *path
, int len
,
20 int check_only
, const struct path_simplify
*simplify
);
21 static int get_dtype(struct dirent
*de
, const char *path
, int len
);
23 /* helper string functions with support for the ignore_case flag */
24 int strcmp_icase(const char *a
, const char *b
)
26 return ignore_case
? strcasecmp(a
, b
) : strcmp(a
, b
);
29 int strncmp_icase(const char *a
, const char *b
, size_t count
)
31 return ignore_case
? strncasecmp(a
, b
, count
) : strncmp(a
, b
, count
);
34 int fnmatch_icase(const char *pattern
, const char *string
, int flags
)
36 return fnmatch(pattern
, string
, flags
| (ignore_case
? FNM_CASEFOLD
: 0));
39 static size_t common_prefix_len(const char **pathspec
)
41 const char *n
, *first
;
48 while ((n
= *pathspec
++)) {
50 for (i
= 0; first
== n
|| i
< max
; i
++) {
52 if (!c
|| c
!= first
[i
] || is_glob_special(c
))
57 if (first
== n
|| len
< max
) {
67 * Returns a copy of the longest leading path common among all
70 char *common_prefix(const char **pathspec
)
72 unsigned long len
= common_prefix_len(pathspec
);
74 return len
? xmemdupz(*pathspec
, len
) : NULL
;
77 int fill_directory(struct dir_struct
*dir
, const char **pathspec
)
82 * Calculate common prefix for the pathspec, and
83 * use that to optimize the directory walk
85 len
= common_prefix_len(pathspec
);
87 /* Read the directory and prune it */
88 read_directory(dir
, pathspec
? *pathspec
: "", len
, pathspec
);
92 int within_depth(const char *name
, int namelen
,
93 int depth
, int max_depth
)
95 const char *cp
= name
, *cpe
= name
+ namelen
;
101 if (depth
> max_depth
)
108 * Does 'match' match the given name?
109 * A match is found if
111 * (1) the 'match' string is leading directory of 'name', or
112 * (2) the 'match' string is a wildcard and matches 'name', or
113 * (3) the 'match' string is exactly the same as 'name'.
115 * and the return value tells which case it was.
117 * It returns 0 when there is no match.
119 static int match_one(const char *match
, const char *name
, int namelen
)
123 /* If the match was just the prefix, we matched */
125 return MATCHED_RECURSIVELY
;
129 unsigned char c1
= tolower(*match
);
130 unsigned char c2
= tolower(*name
);
131 if (c1
== '\0' || is_glob_special(c1
))
141 unsigned char c1
= *match
;
142 unsigned char c2
= *name
;
143 if (c1
== '\0' || is_glob_special(c1
))
155 * If we don't match the matchstring exactly,
156 * we need to match by fnmatch
158 matchlen
= strlen(match
);
159 if (strncmp_icase(match
, name
, matchlen
))
160 return !fnmatch_icase(match
, name
, 0) ? MATCHED_FNMATCH
: 0;
162 if (namelen
== matchlen
)
163 return MATCHED_EXACTLY
;
164 if (match
[matchlen
-1] == '/' || name
[matchlen
] == '/')
165 return MATCHED_RECURSIVELY
;
170 * Given a name and a list of pathspecs, see if the name matches
171 * any of the pathspecs. The caller is also interested in seeing
172 * all pathspec matches some names it calls this function with
173 * (otherwise the user could have mistyped the unmatched pathspec),
174 * and a mark is left in seen[] array for pathspec element that
175 * actually matched anything.
177 int match_pathspec(const char **pathspec
, const char *name
, int namelen
,
178 int prefix
, char *seen
)
188 for (i
= 0; pathspec
[i
] != NULL
; i
++) {
190 const char *match
= pathspec
[i
] + prefix
;
191 if (seen
&& seen
[i
] == MATCHED_EXACTLY
)
193 how
= match_one(match
, name
, namelen
);
197 if (seen
&& seen
[i
] < how
)
205 * Does 'match' match the given name?
206 * A match is found if
208 * (1) the 'match' string is leading directory of 'name', or
209 * (2) the 'match' string is a wildcard and matches 'name', or
210 * (3) the 'match' string is exactly the same as 'name'.
212 * and the return value tells which case it was.
214 * It returns 0 when there is no match.
216 static int match_pathspec_item(const struct pathspec_item
*item
, int prefix
,
217 const char *name
, int namelen
)
219 /* name/namelen has prefix cut off by caller */
220 const char *match
= item
->match
+ prefix
;
221 int matchlen
= item
->len
- prefix
;
223 /* If the match was just the prefix, we matched */
225 return MATCHED_RECURSIVELY
;
227 if (matchlen
<= namelen
&& !strncmp(match
, name
, matchlen
)) {
228 if (matchlen
== namelen
)
229 return MATCHED_EXACTLY
;
231 if (match
[matchlen
-1] == '/' || name
[matchlen
] == '/')
232 return MATCHED_RECURSIVELY
;
235 if (item
->use_wildcard
&& !fnmatch(match
, name
, 0))
236 return MATCHED_FNMATCH
;
242 * Given a name and a list of pathspecs, see if the name matches
243 * any of the pathspecs. The caller is also interested in seeing
244 * all pathspec matches some names it calls this function with
245 * (otherwise the user could have mistyped the unmatched pathspec),
246 * and a mark is left in seen[] array for pathspec element that
247 * actually matched anything.
249 int match_pathspec_depth(const struct pathspec
*ps
,
250 const char *name
, int namelen
,
251 int prefix
, char *seen
)
256 if (!ps
->recursive
|| ps
->max_depth
== -1)
257 return MATCHED_RECURSIVELY
;
259 if (within_depth(name
, namelen
, 0, ps
->max_depth
))
260 return MATCHED_EXACTLY
;
268 for (i
= ps
->nr
- 1; i
>= 0; i
--) {
270 if (seen
&& seen
[i
] == MATCHED_EXACTLY
)
272 how
= match_pathspec_item(ps
->items
+i
, prefix
, name
, namelen
);
273 if (ps
->recursive
&& ps
->max_depth
!= -1 &&
274 how
&& how
!= MATCHED_FNMATCH
) {
275 int len
= ps
->items
[i
].len
;
276 if (name
[len
] == '/')
278 if (within_depth(name
+len
, namelen
-len
, 0, ps
->max_depth
))
279 how
= MATCHED_EXACTLY
;
286 if (seen
&& seen
[i
] < how
)
294 * Return the length of the "simple" part of a path match limiter.
296 static int simple_length(const char *match
)
301 unsigned char c
= *match
++;
303 if (c
== '\0' || is_glob_special(c
))
308 static int no_wildcard(const char *string
)
310 return string
[simple_length(string
)] == '\0';
313 void parse_exclude_pattern(const char **pattern
,
318 const char *p
= *pattern
;
323 *flags
|= EXC_FLAG_NEGATIVE
;
327 if (len
&& p
[len
- 1] == '/') {
329 *flags
|= EXC_FLAG_MUSTBEDIR
;
331 for (i
= 0; i
< len
; i
++) {
336 *flags
|= EXC_FLAG_NODIR
;
337 *nowildcardlen
= simple_length(p
);
339 * we should have excluded the trailing slash from 'p' too,
340 * but that's one more allocation. Instead just make sure
341 * nowildcardlen does not exceed real patternlen
343 if (*nowildcardlen
> len
)
344 *nowildcardlen
= len
;
345 if (*p
== '*' && no_wildcard(p
+ 1))
346 *flags
|= EXC_FLAG_ENDSWITH
;
351 void add_exclude(const char *string
, const char *base
,
352 int baselen
, struct exclude_list
*el
)
359 parse_exclude_pattern(&string
, &patternlen
, &flags
, &nowildcardlen
);
360 if (flags
& EXC_FLAG_MUSTBEDIR
) {
362 x
= xmalloc(sizeof(*x
) + patternlen
+ 1);
364 memcpy(s
, string
, patternlen
);
365 s
[patternlen
] = '\0';
368 x
= xmalloc(sizeof(*x
));
371 x
->patternlen
= patternlen
;
372 x
->nowildcardlen
= nowildcardlen
;
374 x
->baselen
= baselen
;
376 ALLOC_GROW(el
->excludes
, el
->nr
+ 1, el
->alloc
);
377 el
->excludes
[el
->nr
++] = x
;
380 static void *read_skip_worktree_file_from_index(const char *path
, size_t *size
)
384 enum object_type type
;
386 struct index_state
*istate
= &the_index
;
389 pos
= index_name_pos(istate
, path
, len
);
392 if (!ce_skip_worktree(istate
->cache
[pos
]))
394 data
= read_sha1_file(istate
->cache
[pos
]->sha1
, &type
, &sz
);
395 if (!data
|| type
!= OBJ_BLOB
) {
403 void free_excludes(struct exclude_list
*el
)
407 for (i
= 0; i
< el
->nr
; i
++)
408 free(el
->excludes
[i
]);
415 int add_excludes_from_file_to_list(const char *fname
,
419 struct exclude_list
*el
,
427 fd
= open(fname
, O_RDONLY
);
428 if (fd
< 0 || fstat(fd
, &st
) < 0) {
432 (buf
= read_skip_worktree_file_from_index(fname
, &size
)) == NULL
)
438 if (buf
[size
-1] != '\n') {
439 buf
= xrealloc(buf
, size
+1);
444 size
= xsize_t(st
.st_size
);
449 buf
= xmalloc(size
+1);
450 if (read_in_full(fd
, buf
, size
) != size
) {
462 for (i
= 0; i
< size
; i
++) {
463 if (buf
[i
] == '\n') {
464 if (entry
!= buf
+ i
&& entry
[0] != '#') {
465 buf
[i
- (i
&& buf
[i
-1] == '\r')] = 0;
466 add_exclude(entry
, base
, baselen
, el
);
474 void add_excludes_from_file(struct dir_struct
*dir
, const char *fname
)
476 if (add_excludes_from_file_to_list(fname
, "", 0, NULL
,
477 &dir
->exclude_list
[EXC_FILE
], 0) < 0)
478 die("cannot use %s as an exclude file", fname
);
482 * Loads the per-directory exclude list for the substring of base
483 * which has a char length of baselen.
485 static void prep_exclude(struct dir_struct
*dir
, const char *base
, int baselen
)
487 struct exclude_list
*el
;
488 struct exclude_stack
*stk
= NULL
;
491 if ((!dir
->exclude_per_dir
) ||
492 (baselen
+ strlen(dir
->exclude_per_dir
) >= PATH_MAX
))
493 return; /* too long a path -- ignore */
495 /* Pop the directories that are not the prefix of the path being checked. */
496 el
= &dir
->exclude_list
[EXC_DIRS
];
497 while ((stk
= dir
->exclude_stack
) != NULL
) {
498 if (stk
->baselen
<= baselen
&&
499 !strncmp(dir
->basebuf
, base
, stk
->baselen
))
501 dir
->exclude_stack
= stk
->prev
;
502 while (stk
->exclude_ix
< el
->nr
)
503 free(el
->excludes
[--el
->nr
]);
508 /* Read from the parent directories and push them down. */
509 current
= stk
? stk
->baselen
: -1;
510 while (current
< baselen
) {
511 struct exclude_stack
*stk
= xcalloc(1, sizeof(*stk
));
519 cp
= strchr(base
+ current
+ 1, '/');
521 die("oops in prep_exclude");
524 stk
->prev
= dir
->exclude_stack
;
525 stk
->baselen
= cp
- base
;
526 stk
->exclude_ix
= el
->nr
;
527 memcpy(dir
->basebuf
+ current
, base
+ current
,
528 stk
->baselen
- current
);
529 strcpy(dir
->basebuf
+ stk
->baselen
, dir
->exclude_per_dir
);
530 add_excludes_from_file_to_list(dir
->basebuf
,
531 dir
->basebuf
, stk
->baselen
,
532 &stk
->filebuf
, el
, 1);
533 dir
->exclude_stack
= stk
;
534 current
= stk
->baselen
;
536 dir
->basebuf
[baselen
] = '\0';
539 int match_basename(const char *basename
, int basenamelen
,
540 const char *pattern
, int prefix
, int patternlen
,
543 if (prefix
== patternlen
) {
544 if (!strcmp_icase(pattern
, basename
))
546 } else if (flags
& EXC_FLAG_ENDSWITH
) {
547 if (patternlen
- 1 <= basenamelen
&&
548 !strcmp_icase(pattern
+ 1,
549 basename
+ basenamelen
- patternlen
+ 1))
552 if (fnmatch_icase(pattern
, basename
, 0) == 0)
558 int match_pathname(const char *pathname
, int pathlen
,
559 const char *base
, int baselen
,
560 const char *pattern
, int prefix
, int patternlen
,
567 * match with FNM_PATHNAME; the pattern has base implicitly
570 if (*pattern
== '/') {
576 * baselen does not count the trailing slash. base[] may or
577 * may not end with a trailing slash though.
579 if (pathlen
< baselen
+ 1 ||
580 (baselen
&& pathname
[baselen
] != '/') ||
581 strncmp_icase(pathname
, base
, baselen
))
584 namelen
= baselen
? pathlen
- baselen
- 1 : pathlen
;
585 name
= pathname
+ pathlen
- namelen
;
589 * if the non-wildcard part is longer than the
590 * remaining pathname, surely it cannot match.
592 if (prefix
> namelen
)
595 if (strncmp_icase(pattern
, name
, prefix
))
602 return fnmatch_icase(pattern
, name
, FNM_PATHNAME
) == 0;
605 /* Scan the list and let the last match determine the fate.
606 * Return 1 for exclude, 0 for include and -1 for undecided.
608 int is_excluded_from_list(const char *pathname
,
609 int pathlen
, const char *basename
, int *dtype
,
610 struct exclude_list
*el
)
615 return -1; /* undefined */
617 for (i
= el
->nr
- 1; 0 <= i
; i
--) {
618 struct exclude
*x
= el
->excludes
[i
];
619 const char *exclude
= x
->pattern
;
620 int to_exclude
= x
->flags
& EXC_FLAG_NEGATIVE
? 0 : 1;
621 int prefix
= x
->nowildcardlen
;
623 if (x
->flags
& EXC_FLAG_MUSTBEDIR
) {
624 if (*dtype
== DT_UNKNOWN
)
625 *dtype
= get_dtype(NULL
, pathname
, pathlen
);
626 if (*dtype
!= DT_DIR
)
630 if (x
->flags
& EXC_FLAG_NODIR
) {
631 if (match_basename(basename
,
632 pathlen
- (basename
- pathname
),
633 exclude
, prefix
, x
->patternlen
,
639 assert(x
->baselen
== 0 || x
->base
[x
->baselen
- 1] == '/');
640 if (match_pathname(pathname
, pathlen
,
641 x
->base
, x
->baselen
? x
->baselen
- 1 : 0,
642 exclude
, prefix
, x
->patternlen
, x
->flags
))
645 return -1; /* undecided */
648 static int is_excluded(struct dir_struct
*dir
, const char *pathname
, int *dtype_p
)
650 int pathlen
= strlen(pathname
);
652 const char *basename
= strrchr(pathname
, '/');
653 basename
= (basename
) ? basename
+1 : pathname
;
655 prep_exclude(dir
, pathname
, basename
-pathname
);
656 for (st
= EXC_CMDL
; st
<= EXC_FILE
; st
++) {
657 switch (is_excluded_from_list(pathname
, pathlen
,
659 &dir
->exclude_list
[st
])) {
669 void path_exclude_check_init(struct path_exclude_check
*check
,
670 struct dir_struct
*dir
)
673 strbuf_init(&check
->path
, 256);
676 void path_exclude_check_clear(struct path_exclude_check
*check
)
678 strbuf_release(&check
->path
);
682 * Is this name excluded? This is for a caller like show_files() that
683 * do not honor directory hierarchy and iterate through paths that are
684 * possibly in an ignored directory.
686 * A path to a directory known to be excluded is left in check->path to
687 * optimize for repeated checks for files in the same excluded directory.
689 int is_path_excluded(struct path_exclude_check
*check
,
690 const char *name
, int namelen
, int *dtype
)
693 struct strbuf
*path
= &check
->path
;
696 * we allow the caller to pass namelen as an optimization; it
697 * must match the length of the name, as we eventually call
698 * is_excluded() on the whole name string.
701 namelen
= strlen(name
);
704 path
->len
<= namelen
&&
705 !memcmp(name
, path
->buf
, path
->len
) &&
706 (!name
[path
->len
] || name
[path
->len
] == '/'))
709 strbuf_setlen(path
, 0);
710 for (i
= 0; name
[i
]; i
++) {
715 if (is_excluded(check
->dir
, path
->buf
, &dt
))
718 strbuf_addch(path
, ch
);
721 /* An entry in the index; cannot be a directory with subentries */
722 strbuf_setlen(path
, 0);
724 return is_excluded(check
->dir
, name
, dtype
);
727 static struct dir_entry
*dir_entry_new(const char *pathname
, int len
)
729 struct dir_entry
*ent
;
731 ent
= xmalloc(sizeof(*ent
) + len
+ 1);
733 memcpy(ent
->name
, pathname
, len
);
738 static struct dir_entry
*dir_add_name(struct dir_struct
*dir
, const char *pathname
, int len
)
740 if (cache_name_exists(pathname
, len
, ignore_case
))
743 ALLOC_GROW(dir
->entries
, dir
->nr
+1, dir
->alloc
);
744 return dir
->entries
[dir
->nr
++] = dir_entry_new(pathname
, len
);
747 struct dir_entry
*dir_add_ignored(struct dir_struct
*dir
, const char *pathname
, int len
)
749 if (!cache_name_is_other(pathname
, len
))
752 ALLOC_GROW(dir
->ignored
, dir
->ignored_nr
+1, dir
->ignored_alloc
);
753 return dir
->ignored
[dir
->ignored_nr
++] = dir_entry_new(pathname
, len
);
757 index_nonexistent
= 0,
763 * Do not use the alphabetically stored index to look up
764 * the directory name; instead, use the case insensitive
767 static enum exist_status
directory_exists_in_index_icase(const char *dirname
, int len
)
769 struct cache_entry
*ce
= index_name_exists(&the_index
, dirname
, len
+ 1, ignore_case
);
770 unsigned char endchar
;
773 return index_nonexistent
;
774 endchar
= ce
->name
[len
];
777 * The cache_entry structure returned will contain this dirname
778 * and possibly additional path components.
781 return index_directory
;
784 * If there are no additional path components, then this cache_entry
785 * represents a submodule. Submodules, despite being directories,
786 * are stored in the cache without a closing slash.
788 if (!endchar
&& S_ISGITLINK(ce
->ce_mode
))
791 /* This should never be hit, but it exists just in case. */
792 return index_nonexistent
;
796 * The index sorts alphabetically by entry name, which
797 * means that a gitlink sorts as '\0' at the end, while
798 * a directory (which is defined not as an entry, but as
799 * the files it contains) will sort with the '/' at the
802 static enum exist_status
directory_exists_in_index(const char *dirname
, int len
)
807 return directory_exists_in_index_icase(dirname
, len
);
809 pos
= cache_name_pos(dirname
, len
);
812 while (pos
< active_nr
) {
813 struct cache_entry
*ce
= active_cache
[pos
++];
814 unsigned char endchar
;
816 if (strncmp(ce
->name
, dirname
, len
))
818 endchar
= ce
->name
[len
];
822 return index_directory
;
823 if (!endchar
&& S_ISGITLINK(ce
->ce_mode
))
826 return index_nonexistent
;
830 * When we find a directory when traversing the filesystem, we
831 * have three distinct cases:
834 * - see it as a directory
837 * and which one we choose depends on a combination of existing
838 * git index contents and the flags passed into the directory
841 * Case 1: If we *already* have entries in the index under that
842 * directory name, we always recurse into the directory to see
845 * Case 2: If we *already* have that directory name as a gitlink,
846 * we always continue to see it as a gitlink, regardless of whether
847 * there is an actual git directory there or not (it might not
848 * be checked out as a subproject!)
850 * Case 3: if we didn't have it in the index previously, we
851 * have a few sub-cases:
853 * (a) if "show_other_directories" is true, we show it as
854 * just a directory, unless "hide_empty_directories" is
855 * also true and the directory is empty, in which case
856 * we just ignore it entirely.
857 * (b) if it looks like a git directory, and we don't have
858 * 'no_gitlinks' set we treat it as a gitlink, and show it
860 * (c) otherwise, we recurse into it.
862 enum directory_treatment
{
865 recurse_into_directory
868 static enum directory_treatment
treat_directory(struct dir_struct
*dir
,
869 const char *dirname
, int len
,
870 const struct path_simplify
*simplify
)
872 /* The "len-1" is to strip the final '/' */
873 switch (directory_exists_in_index(dirname
, len
-1)) {
874 case index_directory
:
875 return recurse_into_directory
;
878 if (dir
->flags
& DIR_SHOW_OTHER_DIRECTORIES
)
879 return ignore_directory
;
880 return show_directory
;
882 case index_nonexistent
:
883 if (dir
->flags
& DIR_SHOW_OTHER_DIRECTORIES
)
885 if (!(dir
->flags
& DIR_NO_GITLINKS
)) {
886 unsigned char sha1
[20];
887 if (resolve_gitlink_ref(dirname
, "HEAD", sha1
) == 0)
888 return show_directory
;
890 return recurse_into_directory
;
893 /* This is the "show_other_directories" case */
894 if (!(dir
->flags
& DIR_HIDE_EMPTY_DIRECTORIES
))
895 return show_directory
;
896 if (!read_directory_recursive(dir
, dirname
, len
, 1, simplify
))
897 return ignore_directory
;
898 return show_directory
;
902 * This is an inexact early pruning of any recursive directory
903 * reading - if the path cannot possibly be in the pathspec,
904 * return true, and we'll skip it early.
906 static int simplify_away(const char *path
, int pathlen
, const struct path_simplify
*simplify
)
910 const char *match
= simplify
->path
;
911 int len
= simplify
->len
;
917 if (!memcmp(path
, match
, len
))
927 * This function tells us whether an excluded path matches a
928 * list of "interesting" pathspecs. That is, whether a path matched
929 * by any of the pathspecs could possibly be ignored by excluding
930 * the specified path. This can happen if:
932 * 1. the path is mentioned explicitly in the pathspec
934 * 2. the path is a directory prefix of some element in the
937 static int exclude_matches_pathspec(const char *path
, int len
,
938 const struct path_simplify
*simplify
)
941 for (; simplify
->path
; simplify
++) {
942 if (len
== simplify
->len
943 && !memcmp(path
, simplify
->path
, len
))
945 if (len
< simplify
->len
946 && simplify
->path
[len
] == '/'
947 && !memcmp(path
, simplify
->path
, len
))
954 static int get_index_dtype(const char *path
, int len
)
957 struct cache_entry
*ce
;
959 ce
= cache_name_exists(path
, len
, 0);
961 if (!ce_uptodate(ce
))
963 if (S_ISGITLINK(ce
->ce_mode
))
966 * Nobody actually cares about the
967 * difference between DT_LNK and DT_REG
972 /* Try to look it up as a directory */
973 pos
= cache_name_pos(path
, len
);
977 while (pos
< active_nr
) {
978 ce
= active_cache
[pos
++];
979 if (strncmp(ce
->name
, path
, len
))
981 if (ce
->name
[len
] > '/')
983 if (ce
->name
[len
] < '/')
985 if (!ce_uptodate(ce
))
986 break; /* continue? */
992 static int get_dtype(struct dirent
*de
, const char *path
, int len
)
994 int dtype
= de
? DTYPE(de
) : DT_UNKNOWN
;
997 if (dtype
!= DT_UNKNOWN
)
999 dtype
= get_index_dtype(path
, len
);
1000 if (dtype
!= DT_UNKNOWN
)
1002 if (lstat(path
, &st
))
1004 if (S_ISREG(st
.st_mode
))
1006 if (S_ISDIR(st
.st_mode
))
1008 if (S_ISLNK(st
.st_mode
))
1013 enum path_treatment
{
1019 static enum path_treatment
treat_one_path(struct dir_struct
*dir
,
1020 struct strbuf
*path
,
1021 const struct path_simplify
*simplify
,
1022 int dtype
, struct dirent
*de
)
1024 int exclude
= is_excluded(dir
, path
->buf
, &dtype
);
1025 if (exclude
&& (dir
->flags
& DIR_COLLECT_IGNORED
)
1026 && exclude_matches_pathspec(path
->buf
, path
->len
, simplify
))
1027 dir_add_ignored(dir
, path
->buf
, path
->len
);
1030 * Excluded? If we don't explicitly want to show
1031 * ignored files, ignore it
1033 if (exclude
&& !(dir
->flags
& DIR_SHOW_IGNORED
))
1034 return path_ignored
;
1036 if (dtype
== DT_UNKNOWN
)
1037 dtype
= get_dtype(de
, path
->buf
, path
->len
);
1040 * Do we want to see just the ignored files?
1041 * We still need to recurse into directories,
1042 * even if we don't ignore them, since the
1043 * directory may contain files that we do..
1045 if (!exclude
&& (dir
->flags
& DIR_SHOW_IGNORED
)) {
1046 if (dtype
!= DT_DIR
)
1047 return path_ignored
;
1052 return path_ignored
;
1054 strbuf_addch(path
, '/');
1055 switch (treat_directory(dir
, path
->buf
, path
->len
, simplify
)) {
1056 case show_directory
:
1057 if (exclude
!= !!(dir
->flags
1058 & DIR_SHOW_IGNORED
))
1059 return path_ignored
;
1061 case recurse_into_directory
:
1062 return path_recurse
;
1063 case ignore_directory
:
1064 return path_ignored
;
1071 return path_handled
;
1074 static enum path_treatment
treat_path(struct dir_struct
*dir
,
1076 struct strbuf
*path
,
1078 const struct path_simplify
*simplify
)
1082 if (is_dot_or_dotdot(de
->d_name
) || !strcmp(de
->d_name
, ".git"))
1083 return path_ignored
;
1084 strbuf_setlen(path
, baselen
);
1085 strbuf_addstr(path
, de
->d_name
);
1086 if (simplify_away(path
->buf
, path
->len
, simplify
))
1087 return path_ignored
;
1090 return treat_one_path(dir
, path
, simplify
, dtype
, de
);
1094 * Read a directory tree. We currently ignore anything but
1095 * directories, regular files and symlinks. That's because git
1096 * doesn't handle them at all yet. Maybe that will change some
1099 * Also, we ignore the name ".git" (even if it is not a directory).
1100 * That likely will not change.
1102 static int read_directory_recursive(struct dir_struct
*dir
,
1103 const char *base
, int baselen
,
1105 const struct path_simplify
*simplify
)
1110 struct strbuf path
= STRBUF_INIT
;
1112 strbuf_add(&path
, base
, baselen
);
1114 fdir
= opendir(path
.len
? path
.buf
: ".");
1118 while ((de
= readdir(fdir
)) != NULL
) {
1119 switch (treat_path(dir
, de
, &path
, baselen
, simplify
)) {
1121 contents
+= read_directory_recursive(dir
, path
.buf
,
1133 dir_add_name(dir
, path
.buf
, path
.len
);
1137 strbuf_release(&path
);
1142 static int cmp_name(const void *p1
, const void *p2
)
1144 const struct dir_entry
*e1
= *(const struct dir_entry
**)p1
;
1145 const struct dir_entry
*e2
= *(const struct dir_entry
**)p2
;
1147 return cache_name_compare(e1
->name
, e1
->len
,
1151 static struct path_simplify
*create_simplify(const char **pathspec
)
1154 struct path_simplify
*simplify
= NULL
;
1159 for (nr
= 0 ; ; nr
++) {
1162 alloc
= alloc_nr(alloc
);
1163 simplify
= xrealloc(simplify
, alloc
* sizeof(*simplify
));
1165 match
= *pathspec
++;
1168 simplify
[nr
].path
= match
;
1169 simplify
[nr
].len
= simple_length(match
);
1171 simplify
[nr
].path
= NULL
;
1172 simplify
[nr
].len
= 0;
1176 static void free_simplify(struct path_simplify
*simplify
)
1181 static int treat_leading_path(struct dir_struct
*dir
,
1182 const char *path
, int len
,
1183 const struct path_simplify
*simplify
)
1185 struct strbuf sb
= STRBUF_INIT
;
1186 int baselen
, rc
= 0;
1189 while (len
&& path
[len
- 1] == '/')
1195 cp
= path
+ baselen
+ !!baselen
;
1196 cp
= memchr(cp
, '/', path
+ len
- cp
);
1200 baselen
= cp
- path
;
1201 strbuf_setlen(&sb
, 0);
1202 strbuf_add(&sb
, path
, baselen
);
1203 if (!is_directory(sb
.buf
))
1205 if (simplify_away(sb
.buf
, sb
.len
, simplify
))
1207 if (treat_one_path(dir
, &sb
, simplify
,
1208 DT_DIR
, NULL
) == path_ignored
)
1209 break; /* do not recurse into it */
1210 if (len
<= baselen
) {
1212 break; /* finished checking */
1215 strbuf_release(&sb
);
1219 int read_directory(struct dir_struct
*dir
, const char *path
, int len
, const char **pathspec
)
1221 struct path_simplify
*simplify
;
1223 if (has_symlink_leading_path(path
, len
))
1226 simplify
= create_simplify(pathspec
);
1227 if (!len
|| treat_leading_path(dir
, path
, len
, simplify
))
1228 read_directory_recursive(dir
, path
, len
, 0, simplify
);
1229 free_simplify(simplify
);
1230 qsort(dir
->entries
, dir
->nr
, sizeof(struct dir_entry
*), cmp_name
);
1231 qsort(dir
->ignored
, dir
->ignored_nr
, sizeof(struct dir_entry
*), cmp_name
);
1235 int file_exists(const char *f
)
1238 return lstat(f
, &sb
) == 0;
1242 * Given two normalized paths (a trailing slash is ok), if subdir is
1243 * outside dir, return -1. Otherwise return the offset in subdir that
1244 * can be used as relative path to dir.
1246 int dir_inside_of(const char *subdir
, const char *dir
)
1250 assert(dir
&& subdir
&& *dir
&& *subdir
);
1252 while (*dir
&& *subdir
&& *dir
== *subdir
) {
1258 /* hel[p]/me vs hel[l]/yeah */
1259 if (*dir
&& *subdir
)
1263 return !*dir
? offset
: -1; /* same dir */
1265 /* foo/[b]ar vs foo/[] */
1266 if (is_dir_sep(dir
[-1]))
1267 return is_dir_sep(subdir
[-1]) ? offset
: -1;
1269 /* foo[/]bar vs foo[] */
1270 return is_dir_sep(*subdir
) ? offset
+ 1 : -1;
1273 int is_inside_dir(const char *dir
)
1278 if (!getcwd(cwd
, sizeof(cwd
)))
1279 die_errno("can't find the current directory");
1280 return dir_inside_of(cwd
, dir
) >= 0;
1283 int is_empty_dir(const char *path
)
1285 DIR *dir
= opendir(path
);
1292 while ((e
= readdir(dir
)) != NULL
)
1293 if (!is_dot_or_dotdot(e
->d_name
)) {
1302 static int remove_dir_recurse(struct strbuf
*path
, int flag
, int *kept_up
)
1306 int ret
= 0, original_len
= path
->len
, len
, kept_down
= 0;
1307 int only_empty
= (flag
& REMOVE_DIR_EMPTY_ONLY
);
1308 int keep_toplevel
= (flag
& REMOVE_DIR_KEEP_TOPLEVEL
);
1309 unsigned char submodule_head
[20];
1311 if ((flag
& REMOVE_DIR_KEEP_NESTED_GIT
) &&
1312 !resolve_gitlink_ref(path
->buf
, "HEAD", submodule_head
)) {
1313 /* Do not descend and nuke a nested git work tree. */
1319 flag
&= ~REMOVE_DIR_KEEP_TOPLEVEL
;
1320 dir
= opendir(path
->buf
);
1322 /* an empty dir could be removed even if it is unreadble */
1324 return rmdir(path
->buf
);
1328 if (path
->buf
[original_len
- 1] != '/')
1329 strbuf_addch(path
, '/');
1332 while ((e
= readdir(dir
)) != NULL
) {
1334 if (is_dot_or_dotdot(e
->d_name
))
1337 strbuf_setlen(path
, len
);
1338 strbuf_addstr(path
, e
->d_name
);
1339 if (lstat(path
->buf
, &st
))
1341 else if (S_ISDIR(st
.st_mode
)) {
1342 if (!remove_dir_recurse(path
, flag
, &kept_down
))
1343 continue; /* happy */
1344 } else if (!only_empty
&& !unlink(path
->buf
))
1345 continue; /* happy, too */
1347 /* path too long, stat fails, or non-directory still exists */
1353 strbuf_setlen(path
, original_len
);
1354 if (!ret
&& !keep_toplevel
&& !kept_down
)
1355 ret
= rmdir(path
->buf
);
1358 * report the uplevel that it is not an error that we
1359 * did not rmdir() our directory.
1365 int remove_dir_recursively(struct strbuf
*path
, int flag
)
1367 return remove_dir_recurse(path
, flag
, NULL
);
1370 void setup_standard_excludes(struct dir_struct
*dir
)
1374 dir
->exclude_per_dir
= ".gitignore";
1375 path
= git_path("info/exclude");
1376 if (!access(path
, R_OK
))
1377 add_excludes_from_file(dir
, path
);
1378 if (excludes_file
&& !access(excludes_file
, R_OK
))
1379 add_excludes_from_file(dir
, excludes_file
);
1382 int remove_path(const char *name
)
1386 if (unlink(name
) && errno
!= ENOENT
)
1389 slash
= strrchr(name
, '/');
1391 char *dirs
= xstrdup(name
);
1392 slash
= dirs
+ (slash
- name
);
1395 } while (rmdir(dirs
) == 0 && (slash
= strrchr(dirs
, '/')));
1401 static int pathspec_item_cmp(const void *a_
, const void *b_
)
1403 struct pathspec_item
*a
, *b
;
1405 a
= (struct pathspec_item
*)a_
;
1406 b
= (struct pathspec_item
*)b_
;
1407 return strcmp(a
->match
, b
->match
);
1410 int init_pathspec(struct pathspec
*pathspec
, const char **paths
)
1412 const char **p
= paths
;
1415 memset(pathspec
, 0, sizeof(*pathspec
));
1420 pathspec
->raw
= paths
;
1421 pathspec
->nr
= p
- paths
;
1425 pathspec
->items
= xmalloc(sizeof(struct pathspec_item
)*pathspec
->nr
);
1426 for (i
= 0; i
< pathspec
->nr
; i
++) {
1427 struct pathspec_item
*item
= pathspec
->items
+i
;
1428 const char *path
= paths
[i
];
1431 item
->len
= strlen(path
);
1432 item
->use_wildcard
= !no_wildcard(path
);
1433 if (item
->use_wildcard
)
1434 pathspec
->has_wildcard
= 1;
1437 qsort(pathspec
->items
, pathspec
->nr
,
1438 sizeof(struct pathspec_item
), pathspec_item_cmp
);
1443 void free_pathspec(struct pathspec
*pathspec
)
1445 free(pathspec
->items
);
1446 pathspec
->items
= NULL
;