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
)
81 * Calculate common prefix for the pathspec, and
82 * use that to optimize the directory walk
84 len
= common_prefix_len(pathspec
);
88 path
= xmemdupz(*pathspec
, len
);
90 /* Read the directory and prune it */
91 read_directory(dir
, path
, len
, pathspec
);
97 int within_depth(const char *name
, int namelen
,
98 int depth
, int max_depth
)
100 const char *cp
= name
, *cpe
= name
+ namelen
;
106 if (depth
> max_depth
)
113 * Does 'match' match the given name?
114 * A match is found if
116 * (1) the 'match' string is leading directory of 'name', or
117 * (2) the 'match' string is a wildcard and matches 'name', or
118 * (3) the 'match' string is exactly the same as 'name'.
120 * and the return value tells which case it was.
122 * It returns 0 when there is no match.
124 static int match_one(const char *match
, const char *name
, int namelen
)
128 /* If the match was just the prefix, we matched */
130 return MATCHED_RECURSIVELY
;
134 unsigned char c1
= tolower(*match
);
135 unsigned char c2
= tolower(*name
);
136 if (c1
== '\0' || is_glob_special(c1
))
146 unsigned char c1
= *match
;
147 unsigned char c2
= *name
;
148 if (c1
== '\0' || is_glob_special(c1
))
160 * If we don't match the matchstring exactly,
161 * we need to match by fnmatch
163 matchlen
= strlen(match
);
164 if (strncmp_icase(match
, name
, matchlen
))
165 return !fnmatch_icase(match
, name
, 0) ? MATCHED_FNMATCH
: 0;
167 if (namelen
== matchlen
)
168 return MATCHED_EXACTLY
;
169 if (match
[matchlen
-1] == '/' || name
[matchlen
] == '/')
170 return MATCHED_RECURSIVELY
;
175 * Given a name and a list of pathspecs, see if the name matches
176 * any of the pathspecs. The caller is also interested in seeing
177 * all pathspec matches some names it calls this function with
178 * (otherwise the user could have mistyped the unmatched pathspec),
179 * and a mark is left in seen[] array for pathspec element that
180 * actually matched anything.
182 int match_pathspec(const char **pathspec
, const char *name
, int namelen
,
183 int prefix
, char *seen
)
193 for (i
= 0; pathspec
[i
] != NULL
; i
++) {
195 const char *match
= pathspec
[i
] + prefix
;
196 if (seen
&& seen
[i
] == MATCHED_EXACTLY
)
198 how
= match_one(match
, name
, namelen
);
202 if (seen
&& seen
[i
] < how
)
210 * Does 'match' match the given name?
211 * A match is found if
213 * (1) the 'match' string is leading directory of 'name', or
214 * (2) the 'match' string is a wildcard and matches 'name', or
215 * (3) the 'match' string is exactly the same as 'name'.
217 * and the return value tells which case it was.
219 * It returns 0 when there is no match.
221 static int match_pathspec_item(const struct pathspec_item
*item
, int prefix
,
222 const char *name
, int namelen
)
224 /* name/namelen has prefix cut off by caller */
225 const char *match
= item
->match
+ prefix
;
226 int matchlen
= item
->len
- prefix
;
228 /* If the match was just the prefix, we matched */
230 return MATCHED_RECURSIVELY
;
232 if (matchlen
<= namelen
&& !strncmp(match
, name
, matchlen
)) {
233 if (matchlen
== namelen
)
234 return MATCHED_EXACTLY
;
236 if (match
[matchlen
-1] == '/' || name
[matchlen
] == '/')
237 return MATCHED_RECURSIVELY
;
240 if (item
->use_wildcard
&& !fnmatch(match
, name
, 0))
241 return MATCHED_FNMATCH
;
247 * Given a name and a list of pathspecs, see if the name matches
248 * any of the pathspecs. The caller is also interested in seeing
249 * all pathspec matches some names it calls this function with
250 * (otherwise the user could have mistyped the unmatched pathspec),
251 * and a mark is left in seen[] array for pathspec element that
252 * actually matched anything.
254 int match_pathspec_depth(const struct pathspec
*ps
,
255 const char *name
, int namelen
,
256 int prefix
, char *seen
)
261 if (!ps
->recursive
|| ps
->max_depth
== -1)
262 return MATCHED_RECURSIVELY
;
264 if (within_depth(name
, namelen
, 0, ps
->max_depth
))
265 return MATCHED_EXACTLY
;
273 for (i
= ps
->nr
- 1; i
>= 0; i
--) {
275 if (seen
&& seen
[i
] == MATCHED_EXACTLY
)
277 how
= match_pathspec_item(ps
->items
+i
, prefix
, name
, namelen
);
278 if (ps
->recursive
&& ps
->max_depth
!= -1 &&
279 how
&& how
!= MATCHED_FNMATCH
) {
280 int len
= ps
->items
[i
].len
;
281 if (name
[len
] == '/')
283 if (within_depth(name
+len
, namelen
-len
, 0, ps
->max_depth
))
284 how
= MATCHED_EXACTLY
;
291 if (seen
&& seen
[i
] < how
)
298 static int no_wildcard(const char *string
)
300 return string
[strcspn(string
, "*?[{\\")] == '\0';
303 void add_exclude(const char *string
, const char *base
,
304 int baselen
, struct exclude_list
*which
)
311 if (*string
== '!') {
315 len
= strlen(string
);
316 if (len
&& string
[len
- 1] == '/') {
318 x
= xmalloc(sizeof(*x
) + len
);
320 memcpy(s
, string
, len
- 1);
324 flags
= EXC_FLAG_MUSTBEDIR
;
326 x
= xmalloc(sizeof(*x
));
329 x
->to_exclude
= to_exclude
;
330 x
->patternlen
= strlen(string
);
332 x
->baselen
= baselen
;
334 if (!strchr(string
, '/'))
335 x
->flags
|= EXC_FLAG_NODIR
;
336 if (no_wildcard(string
))
337 x
->flags
|= EXC_FLAG_NOWILDCARD
;
338 if (*string
== '*' && no_wildcard(string
+1))
339 x
->flags
|= EXC_FLAG_ENDSWITH
;
340 ALLOC_GROW(which
->excludes
, which
->nr
+ 1, which
->alloc
);
341 which
->excludes
[which
->nr
++] = x
;
344 static void *read_skip_worktree_file_from_index(const char *path
, size_t *size
)
348 enum object_type type
;
350 struct index_state
*istate
= &the_index
;
353 pos
= index_name_pos(istate
, path
, len
);
356 if (!ce_skip_worktree(istate
->cache
[pos
]))
358 data
= read_sha1_file(istate
->cache
[pos
]->sha1
, &type
, &sz
);
359 if (!data
|| type
!= OBJ_BLOB
) {
367 void free_excludes(struct exclude_list
*el
)
371 for (i
= 0; i
< el
->nr
; i
++)
372 free(el
->excludes
[i
]);
379 int add_excludes_from_file_to_list(const char *fname
,
383 struct exclude_list
*which
,
391 fd
= open(fname
, O_RDONLY
);
392 if (fd
< 0 || fstat(fd
, &st
) < 0) {
396 (buf
= read_skip_worktree_file_from_index(fname
, &size
)) == NULL
)
402 if (buf
[size
-1] != '\n') {
403 buf
= xrealloc(buf
, size
+1);
408 size
= xsize_t(st
.st_size
);
413 buf
= xmalloc(size
+1);
414 if (read_in_full(fd
, buf
, size
) != size
) {
426 for (i
= 0; i
< size
; i
++) {
427 if (buf
[i
] == '\n') {
428 if (entry
!= buf
+ i
&& entry
[0] != '#') {
429 buf
[i
- (i
&& buf
[i
-1] == '\r')] = 0;
430 add_exclude(entry
, base
, baselen
, which
);
438 void add_excludes_from_file(struct dir_struct
*dir
, const char *fname
)
440 if (add_excludes_from_file_to_list(fname
, "", 0, NULL
,
441 &dir
->exclude_list
[EXC_FILE
], 0) < 0)
442 die("cannot use %s as an exclude file", fname
);
445 static void prep_exclude(struct dir_struct
*dir
, const char *base
, int baselen
)
447 struct exclude_list
*el
;
448 struct exclude_stack
*stk
= NULL
;
451 if ((!dir
->exclude_per_dir
) ||
452 (baselen
+ strlen(dir
->exclude_per_dir
) >= PATH_MAX
))
453 return; /* too long a path -- ignore */
455 /* Pop the ones that are not the prefix of the path being checked. */
456 el
= &dir
->exclude_list
[EXC_DIRS
];
457 while ((stk
= dir
->exclude_stack
) != NULL
) {
458 if (stk
->baselen
<= baselen
&&
459 !strncmp(dir
->basebuf
, base
, stk
->baselen
))
461 dir
->exclude_stack
= stk
->prev
;
462 while (stk
->exclude_ix
< el
->nr
)
463 free(el
->excludes
[--el
->nr
]);
468 /* Read from the parent directories and push them down. */
469 current
= stk
? stk
->baselen
: -1;
470 while (current
< baselen
) {
471 struct exclude_stack
*stk
= xcalloc(1, sizeof(*stk
));
479 cp
= strchr(base
+ current
+ 1, '/');
481 die("oops in prep_exclude");
484 stk
->prev
= dir
->exclude_stack
;
485 stk
->baselen
= cp
- base
;
486 stk
->exclude_ix
= el
->nr
;
487 memcpy(dir
->basebuf
+ current
, base
+ current
,
488 stk
->baselen
- current
);
489 strcpy(dir
->basebuf
+ stk
->baselen
, dir
->exclude_per_dir
);
490 add_excludes_from_file_to_list(dir
->basebuf
,
491 dir
->basebuf
, stk
->baselen
,
492 &stk
->filebuf
, el
, 1);
493 dir
->exclude_stack
= stk
;
494 current
= stk
->baselen
;
496 dir
->basebuf
[baselen
] = '\0';
499 /* Scan the list and let the last match determine the fate.
500 * Return 1 for exclude, 0 for include and -1 for undecided.
502 int excluded_from_list(const char *pathname
,
503 int pathlen
, const char *basename
, int *dtype
,
504 struct exclude_list
*el
)
509 for (i
= el
->nr
- 1; 0 <= i
; i
--) {
510 struct exclude
*x
= el
->excludes
[i
];
511 const char *exclude
= x
->pattern
;
512 int to_exclude
= x
->to_exclude
;
514 if (x
->flags
& EXC_FLAG_MUSTBEDIR
) {
515 if (*dtype
== DT_UNKNOWN
)
516 *dtype
= get_dtype(NULL
, pathname
, pathlen
);
517 if (*dtype
!= DT_DIR
)
521 if (x
->flags
& EXC_FLAG_NODIR
) {
523 if (x
->flags
& EXC_FLAG_NOWILDCARD
) {
524 if (!strcmp_icase(exclude
, basename
))
526 } else if (x
->flags
& EXC_FLAG_ENDSWITH
) {
527 if (x
->patternlen
- 1 <= pathlen
&&
528 !strcmp_icase(exclude
+ 1, pathname
+ pathlen
- x
->patternlen
+ 1))
531 if (fnmatch_icase(exclude
, basename
, 0) == 0)
536 /* match with FNM_PATHNAME:
537 * exclude has base (baselen long) implicitly
540 int baselen
= x
->baselen
;
544 if (pathlen
< baselen
||
545 (baselen
&& pathname
[baselen
-1] != '/') ||
546 strncmp_icase(pathname
, x
->base
, baselen
))
549 if (x
->flags
& EXC_FLAG_NOWILDCARD
) {
550 if (!strcmp_icase(exclude
, pathname
+ baselen
))
553 if (fnmatch_icase(exclude
, pathname
+baselen
,
560 return -1; /* undecided */
563 int excluded(struct dir_struct
*dir
, const char *pathname
, int *dtype_p
)
565 int pathlen
= strlen(pathname
);
567 const char *basename
= strrchr(pathname
, '/');
568 basename
= (basename
) ? basename
+1 : pathname
;
570 prep_exclude(dir
, pathname
, basename
-pathname
);
571 for (st
= EXC_CMDL
; st
<= EXC_FILE
; st
++) {
572 switch (excluded_from_list(pathname
, pathlen
, basename
,
573 dtype_p
, &dir
->exclude_list
[st
])) {
583 void path_exclude_check_init(struct path_exclude_check
*check
,
584 struct dir_struct
*dir
)
587 strbuf_init(&check
->path
, 256);
590 void path_exclude_check_clear(struct path_exclude_check
*check
)
592 strbuf_release(&check
->path
);
596 * Is the ce->name excluded? This is for a caller like show_files() that
597 * do not honor directory hierarchy and iterate through paths that are
598 * possibly in an ignored directory.
600 * A path to a directory known to be excluded is left in check->path to
601 * optimize for repeated checks for files in the same excluded directory.
603 int path_excluded(struct path_exclude_check
*check
, struct cache_entry
*ce
)
606 struct strbuf
*path
= &check
->path
;
609 path
->len
<= ce_namelen(ce
) &&
610 !memcmp(ce
->name
, path
->buf
, path
->len
) &&
611 (!ce
->name
[path
->len
] || ce
->name
[path
->len
] == '/'))
614 strbuf_setlen(path
, 0);
615 for (i
= 0; ce
->name
[i
]; i
++) {
616 int ch
= ce
->name
[i
];
620 if (excluded(check
->dir
, path
->buf
, &dtype
))
623 strbuf_addch(path
, ch
);
626 /* An entry in the index; cannot be a directory with subentries */
627 strbuf_setlen(path
, 0);
629 dtype
= ce_to_dtype(ce
);
630 return excluded(check
->dir
, ce
->name
, &dtype
);
633 static struct dir_entry
*dir_entry_new(const char *pathname
, int len
)
635 struct dir_entry
*ent
;
637 ent
= xmalloc(sizeof(*ent
) + len
+ 1);
639 memcpy(ent
->name
, pathname
, len
);
644 static struct dir_entry
*dir_add_name(struct dir_struct
*dir
, const char *pathname
, int len
)
646 if (cache_name_exists(pathname
, len
, ignore_case
))
649 ALLOC_GROW(dir
->entries
, dir
->nr
+1, dir
->alloc
);
650 return dir
->entries
[dir
->nr
++] = dir_entry_new(pathname
, len
);
653 struct dir_entry
*dir_add_ignored(struct dir_struct
*dir
, const char *pathname
, int len
)
655 if (!cache_name_is_other(pathname
, len
))
658 ALLOC_GROW(dir
->ignored
, dir
->ignored_nr
+1, dir
->ignored_alloc
);
659 return dir
->ignored
[dir
->ignored_nr
++] = dir_entry_new(pathname
, len
);
663 index_nonexistent
= 0,
669 * Do not use the alphabetically stored index to look up
670 * the directory name; instead, use the case insensitive
673 static enum exist_status
directory_exists_in_index_icase(const char *dirname
, int len
)
675 struct cache_entry
*ce
= index_name_exists(&the_index
, dirname
, len
+ 1, ignore_case
);
676 unsigned char endchar
;
679 return index_nonexistent
;
680 endchar
= ce
->name
[len
];
683 * The cache_entry structure returned will contain this dirname
684 * and possibly additional path components.
687 return index_directory
;
690 * If there are no additional path components, then this cache_entry
691 * represents a submodule. Submodules, despite being directories,
692 * are stored in the cache without a closing slash.
694 if (!endchar
&& S_ISGITLINK(ce
->ce_mode
))
697 /* This should never be hit, but it exists just in case. */
698 return index_nonexistent
;
702 * The index sorts alphabetically by entry name, which
703 * means that a gitlink sorts as '\0' at the end, while
704 * a directory (which is defined not as an entry, but as
705 * the files it contains) will sort with the '/' at the
708 static enum exist_status
directory_exists_in_index(const char *dirname
, int len
)
713 return directory_exists_in_index_icase(dirname
, len
);
715 pos
= cache_name_pos(dirname
, len
);
718 while (pos
< active_nr
) {
719 struct cache_entry
*ce
= active_cache
[pos
++];
720 unsigned char endchar
;
722 if (strncmp(ce
->name
, dirname
, len
))
724 endchar
= ce
->name
[len
];
728 return index_directory
;
729 if (!endchar
&& S_ISGITLINK(ce
->ce_mode
))
732 return index_nonexistent
;
736 * When we find a directory when traversing the filesystem, we
737 * have three distinct cases:
740 * - see it as a directory
743 * and which one we choose depends on a combination of existing
744 * git index contents and the flags passed into the directory
747 * Case 1: If we *already* have entries in the index under that
748 * directory name, we always recurse into the directory to see
751 * Case 2: If we *already* have that directory name as a gitlink,
752 * we always continue to see it as a gitlink, regardless of whether
753 * there is an actual git directory there or not (it might not
754 * be checked out as a subproject!)
756 * Case 3: if we didn't have it in the index previously, we
757 * have a few sub-cases:
759 * (a) if "show_other_directories" is true, we show it as
760 * just a directory, unless "hide_empty_directories" is
761 * also true and the directory is empty, in which case
762 * we just ignore it entirely.
763 * (b) if it looks like a git directory, and we don't have
764 * 'no_gitlinks' set we treat it as a gitlink, and show it
766 * (c) otherwise, we recurse into it.
768 enum directory_treatment
{
771 recurse_into_directory
774 static enum directory_treatment
treat_directory(struct dir_struct
*dir
,
775 const char *dirname
, int len
,
776 const struct path_simplify
*simplify
)
778 /* The "len-1" is to strip the final '/' */
779 switch (directory_exists_in_index(dirname
, len
-1)) {
780 case index_directory
:
781 return recurse_into_directory
;
784 if (dir
->flags
& DIR_SHOW_OTHER_DIRECTORIES
)
785 return ignore_directory
;
786 return show_directory
;
788 case index_nonexistent
:
789 if (dir
->flags
& DIR_SHOW_OTHER_DIRECTORIES
)
791 if (!(dir
->flags
& DIR_NO_GITLINKS
)) {
792 unsigned char sha1
[20];
793 if (resolve_gitlink_ref(dirname
, "HEAD", sha1
) == 0)
794 return show_directory
;
796 return recurse_into_directory
;
799 /* This is the "show_other_directories" case */
800 if (!(dir
->flags
& DIR_HIDE_EMPTY_DIRECTORIES
))
801 return show_directory
;
802 if (!read_directory_recursive(dir
, dirname
, len
, 1, simplify
))
803 return ignore_directory
;
804 return show_directory
;
808 * This is an inexact early pruning of any recursive directory
809 * reading - if the path cannot possibly be in the pathspec,
810 * return true, and we'll skip it early.
812 static int simplify_away(const char *path
, int pathlen
, const struct path_simplify
*simplify
)
816 const char *match
= simplify
->path
;
817 int len
= simplify
->len
;
823 if (!memcmp(path
, match
, len
))
833 * This function tells us whether an excluded path matches a
834 * list of "interesting" pathspecs. That is, whether a path matched
835 * by any of the pathspecs could possibly be ignored by excluding
836 * the specified path. This can happen if:
838 * 1. the path is mentioned explicitly in the pathspec
840 * 2. the path is a directory prefix of some element in the
843 static int exclude_matches_pathspec(const char *path
, int len
,
844 const struct path_simplify
*simplify
)
847 for (; simplify
->path
; simplify
++) {
848 if (len
== simplify
->len
849 && !memcmp(path
, simplify
->path
, len
))
851 if (len
< simplify
->len
852 && simplify
->path
[len
] == '/'
853 && !memcmp(path
, simplify
->path
, len
))
860 static int get_index_dtype(const char *path
, int len
)
863 struct cache_entry
*ce
;
865 ce
= cache_name_exists(path
, len
, 0);
867 if (!ce_uptodate(ce
))
869 if (S_ISGITLINK(ce
->ce_mode
))
872 * Nobody actually cares about the
873 * difference between DT_LNK and DT_REG
878 /* Try to look it up as a directory */
879 pos
= cache_name_pos(path
, len
);
883 while (pos
< active_nr
) {
884 ce
= active_cache
[pos
++];
885 if (strncmp(ce
->name
, path
, len
))
887 if (ce
->name
[len
] > '/')
889 if (ce
->name
[len
] < '/')
891 if (!ce_uptodate(ce
))
892 break; /* continue? */
898 static int get_dtype(struct dirent
*de
, const char *path
, int len
)
900 int dtype
= de
? DTYPE(de
) : DT_UNKNOWN
;
903 if (dtype
!= DT_UNKNOWN
)
905 dtype
= get_index_dtype(path
, len
);
906 if (dtype
!= DT_UNKNOWN
)
908 if (lstat(path
, &st
))
910 if (S_ISREG(st
.st_mode
))
912 if (S_ISDIR(st
.st_mode
))
914 if (S_ISLNK(st
.st_mode
))
919 enum path_treatment
{
925 static enum path_treatment
treat_one_path(struct dir_struct
*dir
,
926 char *path
, int *len
,
927 const struct path_simplify
*simplify
,
928 int dtype
, struct dirent
*de
)
930 int exclude
= excluded(dir
, path
, &dtype
);
931 if (exclude
&& (dir
->flags
& DIR_COLLECT_IGNORED
)
932 && exclude_matches_pathspec(path
, *len
, simplify
))
933 dir_add_ignored(dir
, path
, *len
);
936 * Excluded? If we don't explicitly want to show
937 * ignored files, ignore it
939 if (exclude
&& !(dir
->flags
& DIR_SHOW_IGNORED
))
942 if (dtype
== DT_UNKNOWN
)
943 dtype
= get_dtype(de
, path
, *len
);
946 * Do we want to see just the ignored files?
947 * We still need to recurse into directories,
948 * even if we don't ignore them, since the
949 * directory may contain files that we do..
951 if (!exclude
&& (dir
->flags
& DIR_SHOW_IGNORED
)) {
960 memcpy(path
+ *len
, "/", 2);
962 switch (treat_directory(dir
, path
, *len
, simplify
)) {
964 if (exclude
!= !!(dir
->flags
968 case recurse_into_directory
:
970 case ignore_directory
:
981 static enum path_treatment
treat_path(struct dir_struct
*dir
,
983 char *path
, int path_max
,
985 const struct path_simplify
*simplify
,
990 if (is_dot_or_dotdot(de
->d_name
) || !strcmp(de
->d_name
, ".git"))
992 *len
= strlen(de
->d_name
);
993 /* Ignore overly long pathnames! */
994 if (*len
+ baselen
+ 8 > path_max
)
996 memcpy(path
+ baselen
, de
->d_name
, *len
+ 1);
998 if (simplify_away(path
, *len
, simplify
))
1002 return treat_one_path(dir
, path
, len
, simplify
, dtype
, de
);
1006 * Read a directory tree. We currently ignore anything but
1007 * directories, regular files and symlinks. That's because git
1008 * doesn't handle them at all yet. Maybe that will change some
1011 * Also, we ignore the name ".git" (even if it is not a directory).
1012 * That likely will not change.
1014 static int read_directory_recursive(struct dir_struct
*dir
,
1015 const char *base
, int baselen
,
1017 const struct path_simplify
*simplify
)
1019 DIR *fdir
= opendir(*base
? base
: ".");
1022 char path
[PATH_MAX
+ 1];
1027 memcpy(path
, base
, baselen
);
1029 while ((de
= readdir(fdir
)) != NULL
) {
1031 switch (treat_path(dir
, de
, path
, sizeof(path
),
1032 baselen
, simplify
, &len
)) {
1034 contents
+= read_directory_recursive(dir
, path
, len
, 0, simplify
);
1045 dir_add_name(dir
, path
, len
);
1053 static int cmp_name(const void *p1
, const void *p2
)
1055 const struct dir_entry
*e1
= *(const struct dir_entry
**)p1
;
1056 const struct dir_entry
*e2
= *(const struct dir_entry
**)p2
;
1058 return cache_name_compare(e1
->name
, e1
->len
,
1063 * Return the length of the "simple" part of a path match limiter.
1065 static int simple_length(const char *match
)
1070 unsigned char c
= *match
++;
1072 if (c
== '\0' || is_glob_special(c
))
1077 static struct path_simplify
*create_simplify(const char **pathspec
)
1080 struct path_simplify
*simplify
= NULL
;
1085 for (nr
= 0 ; ; nr
++) {
1088 alloc
= alloc_nr(alloc
);
1089 simplify
= xrealloc(simplify
, alloc
* sizeof(*simplify
));
1091 match
= *pathspec
++;
1094 simplify
[nr
].path
= match
;
1095 simplify
[nr
].len
= simple_length(match
);
1097 simplify
[nr
].path
= NULL
;
1098 simplify
[nr
].len
= 0;
1102 static void free_simplify(struct path_simplify
*simplify
)
1107 static int treat_leading_path(struct dir_struct
*dir
,
1108 const char *path
, int len
,
1109 const struct path_simplify
*simplify
)
1111 char pathbuf
[PATH_MAX
];
1115 while (len
&& path
[len
- 1] == '/')
1121 cp
= path
+ baselen
+ !!baselen
;
1122 cp
= memchr(cp
, '/', path
+ len
- cp
);
1126 baselen
= cp
- path
;
1127 memcpy(pathbuf
, path
, baselen
);
1128 pathbuf
[baselen
] = '\0';
1129 if (!is_directory(pathbuf
))
1131 if (simplify_away(pathbuf
, baselen
, simplify
))
1134 if (treat_one_path(dir
, pathbuf
, &blen
, simplify
,
1135 DT_DIR
, NULL
) == path_ignored
)
1136 return 0; /* do not recurse into it */
1138 return 1; /* finished checking */
1142 int read_directory(struct dir_struct
*dir
, const char *path
, int len
, const char **pathspec
)
1144 struct path_simplify
*simplify
;
1146 if (has_symlink_leading_path(path
, len
))
1149 simplify
= create_simplify(pathspec
);
1150 if (!len
|| treat_leading_path(dir
, path
, len
, simplify
))
1151 read_directory_recursive(dir
, path
, len
, 0, simplify
);
1152 free_simplify(simplify
);
1153 qsort(dir
->entries
, dir
->nr
, sizeof(struct dir_entry
*), cmp_name
);
1154 qsort(dir
->ignored
, dir
->ignored_nr
, sizeof(struct dir_entry
*), cmp_name
);
1158 int file_exists(const char *f
)
1161 return lstat(f
, &sb
) == 0;
1165 * Given two normalized paths (a trailing slash is ok), if subdir is
1166 * outside dir, return -1. Otherwise return the offset in subdir that
1167 * can be used as relative path to dir.
1169 int dir_inside_of(const char *subdir
, const char *dir
)
1173 assert(dir
&& subdir
&& *dir
&& *subdir
);
1175 while (*dir
&& *subdir
&& *dir
== *subdir
) {
1181 /* hel[p]/me vs hel[l]/yeah */
1182 if (*dir
&& *subdir
)
1186 return !*dir
? offset
: -1; /* same dir */
1188 /* foo/[b]ar vs foo/[] */
1189 if (is_dir_sep(dir
[-1]))
1190 return is_dir_sep(subdir
[-1]) ? offset
: -1;
1192 /* foo[/]bar vs foo[] */
1193 return is_dir_sep(*subdir
) ? offset
+ 1 : -1;
1196 int is_inside_dir(const char *dir
)
1201 if (!getcwd(cwd
, sizeof(cwd
)))
1202 die_errno("can't find the current directory");
1203 return dir_inside_of(cwd
, dir
) >= 0;
1206 int is_empty_dir(const char *path
)
1208 DIR *dir
= opendir(path
);
1215 while ((e
= readdir(dir
)) != NULL
)
1216 if (!is_dot_or_dotdot(e
->d_name
)) {
1225 int remove_dir_recursively(struct strbuf
*path
, int flag
)
1229 int ret
= 0, original_len
= path
->len
, len
;
1230 int only_empty
= (flag
& REMOVE_DIR_EMPTY_ONLY
);
1231 unsigned char submodule_head
[20];
1233 if ((flag
& REMOVE_DIR_KEEP_NESTED_GIT
) &&
1234 !resolve_gitlink_ref(path
->buf
, "HEAD", submodule_head
))
1235 /* Do not descend and nuke a nested git work tree. */
1238 dir
= opendir(path
->buf
);
1240 return rmdir(path
->buf
);
1241 if (path
->buf
[original_len
- 1] != '/')
1242 strbuf_addch(path
, '/');
1245 while ((e
= readdir(dir
)) != NULL
) {
1247 if (is_dot_or_dotdot(e
->d_name
))
1250 strbuf_setlen(path
, len
);
1251 strbuf_addstr(path
, e
->d_name
);
1252 if (lstat(path
->buf
, &st
))
1254 else if (S_ISDIR(st
.st_mode
)) {
1255 if (!remove_dir_recursively(path
, only_empty
))
1256 continue; /* happy */
1257 } else if (!only_empty
&& !unlink(path
->buf
))
1258 continue; /* happy, too */
1260 /* path too long, stat fails, or non-directory still exists */
1266 strbuf_setlen(path
, original_len
);
1268 ret
= rmdir(path
->buf
);
1272 void setup_standard_excludes(struct dir_struct
*dir
)
1276 dir
->exclude_per_dir
= ".gitignore";
1277 path
= git_path("info/exclude");
1278 if (!access(path
, R_OK
))
1279 add_excludes_from_file(dir
, path
);
1280 if (excludes_file
&& !access(excludes_file
, R_OK
))
1281 add_excludes_from_file(dir
, excludes_file
);
1284 int remove_path(const char *name
)
1288 if (unlink(name
) && errno
!= ENOENT
)
1291 slash
= strrchr(name
, '/');
1293 char *dirs
= xstrdup(name
);
1294 slash
= dirs
+ (slash
- name
);
1297 } while (rmdir(dirs
) == 0 && (slash
= strrchr(dirs
, '/')));
1303 static int pathspec_item_cmp(const void *a_
, const void *b_
)
1305 struct pathspec_item
*a
, *b
;
1307 a
= (struct pathspec_item
*)a_
;
1308 b
= (struct pathspec_item
*)b_
;
1309 return strcmp(a
->match
, b
->match
);
1312 int init_pathspec(struct pathspec
*pathspec
, const char **paths
)
1314 const char **p
= paths
;
1317 memset(pathspec
, 0, sizeof(*pathspec
));
1322 pathspec
->raw
= paths
;
1323 pathspec
->nr
= p
- paths
;
1327 pathspec
->items
= xmalloc(sizeof(struct pathspec_item
)*pathspec
->nr
);
1328 for (i
= 0; i
< pathspec
->nr
; i
++) {
1329 struct pathspec_item
*item
= pathspec
->items
+i
;
1330 const char *path
= paths
[i
];
1333 item
->len
= strlen(path
);
1334 item
->use_wildcard
= !no_wildcard(path
);
1335 if (item
->use_wildcard
)
1336 pathspec
->has_wildcard
= 1;
1339 qsort(pathspec
->items
, pathspec
->nr
,
1340 sizeof(struct pathspec_item
), pathspec_item_cmp
);
1345 void free_pathspec(struct pathspec
*pathspec
)
1347 free(pathspec
->items
);
1348 pathspec
->items
= NULL
;