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 if (no_wildcard(string
))
345 x
->flags
|= EXC_FLAG_NOWILDCARD
;
346 if (*string
== '*' && no_wildcard(string
+1))
347 x
->flags
|= EXC_FLAG_ENDSWITH
;
348 ALLOC_GROW(which
->excludes
, which
->nr
+ 1, which
->alloc
);
349 which
->excludes
[which
->nr
++] = x
;
352 static void *read_skip_worktree_file_from_index(const char *path
, size_t *size
)
356 enum object_type type
;
358 struct index_state
*istate
= &the_index
;
361 pos
= index_name_pos(istate
, path
, len
);
364 if (!ce_skip_worktree(istate
->cache
[pos
]))
366 data
= read_sha1_file(istate
->cache
[pos
]->sha1
, &type
, &sz
);
367 if (!data
|| type
!= OBJ_BLOB
) {
375 void free_excludes(struct exclude_list
*el
)
379 for (i
= 0; i
< el
->nr
; i
++)
380 free(el
->excludes
[i
]);
387 int add_excludes_from_file_to_list(const char *fname
,
391 struct exclude_list
*which
,
399 fd
= open(fname
, O_RDONLY
);
400 if (fd
< 0 || fstat(fd
, &st
) < 0) {
404 (buf
= read_skip_worktree_file_from_index(fname
, &size
)) == NULL
)
410 if (buf
[size
-1] != '\n') {
411 buf
= xrealloc(buf
, size
+1);
416 size
= xsize_t(st
.st_size
);
421 buf
= xmalloc(size
+1);
422 if (read_in_full(fd
, buf
, size
) != size
) {
434 for (i
= 0; i
< size
; i
++) {
435 if (buf
[i
] == '\n') {
436 if (entry
!= buf
+ i
&& entry
[0] != '#') {
437 buf
[i
- (i
&& buf
[i
-1] == '\r')] = 0;
438 add_exclude(entry
, base
, baselen
, which
);
446 void add_excludes_from_file(struct dir_struct
*dir
, const char *fname
)
448 if (add_excludes_from_file_to_list(fname
, "", 0, NULL
,
449 &dir
->exclude_list
[EXC_FILE
], 0) < 0)
450 die("cannot use %s as an exclude file", fname
);
453 static void prep_exclude(struct dir_struct
*dir
, const char *base
, int baselen
)
455 struct exclude_list
*el
;
456 struct exclude_stack
*stk
= NULL
;
459 if ((!dir
->exclude_per_dir
) ||
460 (baselen
+ strlen(dir
->exclude_per_dir
) >= PATH_MAX
))
461 return; /* too long a path -- ignore */
463 /* Pop the ones that are not the prefix of the path being checked. */
464 el
= &dir
->exclude_list
[EXC_DIRS
];
465 while ((stk
= dir
->exclude_stack
) != NULL
) {
466 if (stk
->baselen
<= baselen
&&
467 !strncmp(dir
->basebuf
, base
, stk
->baselen
))
469 dir
->exclude_stack
= stk
->prev
;
470 while (stk
->exclude_ix
< el
->nr
)
471 free(el
->excludes
[--el
->nr
]);
476 /* Read from the parent directories and push them down. */
477 current
= stk
? stk
->baselen
: -1;
478 while (current
< baselen
) {
479 struct exclude_stack
*stk
= xcalloc(1, sizeof(*stk
));
487 cp
= strchr(base
+ current
+ 1, '/');
489 die("oops in prep_exclude");
492 stk
->prev
= dir
->exclude_stack
;
493 stk
->baselen
= cp
- base
;
494 stk
->exclude_ix
= el
->nr
;
495 memcpy(dir
->basebuf
+ current
, base
+ current
,
496 stk
->baselen
- current
);
497 strcpy(dir
->basebuf
+ stk
->baselen
, dir
->exclude_per_dir
);
498 add_excludes_from_file_to_list(dir
->basebuf
,
499 dir
->basebuf
, stk
->baselen
,
500 &stk
->filebuf
, el
, 1);
501 dir
->exclude_stack
= stk
;
502 current
= stk
->baselen
;
504 dir
->basebuf
[baselen
] = '\0';
507 /* Scan the list and let the last match determine the fate.
508 * Return 1 for exclude, 0 for include and -1 for undecided.
510 int excluded_from_list(const char *pathname
,
511 int pathlen
, const char *basename
, int *dtype
,
512 struct exclude_list
*el
)
517 return -1; /* undefined */
519 for (i
= el
->nr
- 1; 0 <= i
; i
--) {
520 struct exclude
*x
= el
->excludes
[i
];
521 const char *exclude
= x
->pattern
;
522 int to_exclude
= x
->to_exclude
;
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 (x
->flags
& EXC_FLAG_NOWILDCARD
) {
534 if (!strcmp_icase(exclude
, basename
))
536 } else if (x
->flags
& EXC_FLAG_ENDSWITH
) {
537 if (x
->patternlen
- 1 <= pathlen
&&
538 !strcmp_icase(exclude
+ 1, pathname
+ pathlen
- x
->patternlen
+ 1))
541 if (fnmatch_icase(exclude
, basename
, 0) == 0)
548 /* match with FNM_PATHNAME:
549 * exclude has base (baselen long) implicitly in front of it.
554 if (pathlen
< x
->baselen
||
555 (x
->baselen
&& pathname
[x
->baselen
-1] != '/') ||
556 strncmp_icase(pathname
, x
->base
, x
->baselen
))
559 if (x
->flags
& EXC_FLAG_NOWILDCARD
) {
560 if (!strcmp_icase(exclude
, pathname
+ x
->baselen
))
563 if (fnmatch_icase(exclude
, pathname
+x
->baselen
,
568 return -1; /* undecided */
571 int excluded(struct dir_struct
*dir
, const char *pathname
, int *dtype_p
)
573 int pathlen
= strlen(pathname
);
575 const char *basename
= strrchr(pathname
, '/');
576 basename
= (basename
) ? basename
+1 : pathname
;
578 prep_exclude(dir
, pathname
, basename
-pathname
);
579 for (st
= EXC_CMDL
; st
<= EXC_FILE
; st
++) {
580 switch (excluded_from_list(pathname
, pathlen
, basename
,
581 dtype_p
, &dir
->exclude_list
[st
])) {
591 static struct dir_entry
*dir_entry_new(const char *pathname
, int len
)
593 struct dir_entry
*ent
;
595 ent
= xmalloc(sizeof(*ent
) + len
+ 1);
597 memcpy(ent
->name
, pathname
, len
);
602 static struct dir_entry
*dir_add_name(struct dir_struct
*dir
, const char *pathname
, int len
)
604 if (cache_name_exists(pathname
, len
, ignore_case
))
607 ALLOC_GROW(dir
->entries
, dir
->nr
+1, dir
->alloc
);
608 return dir
->entries
[dir
->nr
++] = dir_entry_new(pathname
, len
);
611 struct dir_entry
*dir_add_ignored(struct dir_struct
*dir
, const char *pathname
, int len
)
613 if (!cache_name_is_other(pathname
, len
))
616 ALLOC_GROW(dir
->ignored
, dir
->ignored_nr
+1, dir
->ignored_alloc
);
617 return dir
->ignored
[dir
->ignored_nr
++] = dir_entry_new(pathname
, len
);
621 index_nonexistent
= 0,
627 * Do not use the alphabetically stored index to look up
628 * the directory name; instead, use the case insensitive
631 static enum exist_status
directory_exists_in_index_icase(const char *dirname
, int len
)
633 struct cache_entry
*ce
= index_name_exists(&the_index
, dirname
, len
+ 1, ignore_case
);
634 unsigned char endchar
;
637 return index_nonexistent
;
638 endchar
= ce
->name
[len
];
641 * The cache_entry structure returned will contain this dirname
642 * and possibly additional path components.
645 return index_directory
;
648 * If there are no additional path components, then this cache_entry
649 * represents a submodule. Submodules, despite being directories,
650 * are stored in the cache without a closing slash.
652 if (!endchar
&& S_ISGITLINK(ce
->ce_mode
))
655 /* This should never be hit, but it exists just in case. */
656 return index_nonexistent
;
660 * The index sorts alphabetically by entry name, which
661 * means that a gitlink sorts as '\0' at the end, while
662 * a directory (which is defined not as an entry, but as
663 * the files it contains) will sort with the '/' at the
666 static enum exist_status
directory_exists_in_index(const char *dirname
, int len
)
671 return directory_exists_in_index_icase(dirname
, len
);
673 pos
= cache_name_pos(dirname
, len
);
676 while (pos
< active_nr
) {
677 struct cache_entry
*ce
= active_cache
[pos
++];
678 unsigned char endchar
;
680 if (strncmp(ce
->name
, dirname
, len
))
682 endchar
= ce
->name
[len
];
686 return index_directory
;
687 if (!endchar
&& S_ISGITLINK(ce
->ce_mode
))
690 return index_nonexistent
;
694 * When we find a directory when traversing the filesystem, we
695 * have three distinct cases:
698 * - see it as a directory
701 * and which one we choose depends on a combination of existing
702 * git index contents and the flags passed into the directory
705 * Case 1: If we *already* have entries in the index under that
706 * directory name, we always recurse into the directory to see
709 * Case 2: If we *already* have that directory name as a gitlink,
710 * we always continue to see it as a gitlink, regardless of whether
711 * there is an actual git directory there or not (it might not
712 * be checked out as a subproject!)
714 * Case 3: if we didn't have it in the index previously, we
715 * have a few sub-cases:
717 * (a) if "show_other_directories" is true, we show it as
718 * just a directory, unless "hide_empty_directories" is
719 * also true and the directory is empty, in which case
720 * we just ignore it entirely.
721 * (b) if it looks like a git directory, and we don't have
722 * 'no_gitlinks' set we treat it as a gitlink, and show it
724 * (c) otherwise, we recurse into it.
726 enum directory_treatment
{
729 recurse_into_directory
732 static enum directory_treatment
treat_directory(struct dir_struct
*dir
,
733 const char *dirname
, int len
,
734 const struct path_simplify
*simplify
)
736 /* The "len-1" is to strip the final '/' */
737 switch (directory_exists_in_index(dirname
, len
-1)) {
738 case index_directory
:
739 return recurse_into_directory
;
742 if (dir
->flags
& DIR_SHOW_OTHER_DIRECTORIES
)
743 return ignore_directory
;
744 return show_directory
;
746 case index_nonexistent
:
747 if (dir
->flags
& DIR_SHOW_OTHER_DIRECTORIES
)
749 if (!(dir
->flags
& DIR_NO_GITLINKS
)) {
750 unsigned char sha1
[20];
751 if (resolve_gitlink_ref(dirname
, "HEAD", sha1
) == 0)
752 return show_directory
;
754 return recurse_into_directory
;
757 /* This is the "show_other_directories" case */
758 if (!(dir
->flags
& DIR_HIDE_EMPTY_DIRECTORIES
))
759 return show_directory
;
760 if (!read_directory_recursive(dir
, dirname
, len
, 1, simplify
))
761 return ignore_directory
;
762 return show_directory
;
766 * This is an inexact early pruning of any recursive directory
767 * reading - if the path cannot possibly be in the pathspec,
768 * return true, and we'll skip it early.
770 static int simplify_away(const char *path
, int pathlen
, const struct path_simplify
*simplify
)
774 const char *match
= simplify
->path
;
775 int len
= simplify
->len
;
781 if (!memcmp(path
, match
, len
))
791 * This function tells us whether an excluded path matches a
792 * list of "interesting" pathspecs. That is, whether a path matched
793 * by any of the pathspecs could possibly be ignored by excluding
794 * the specified path. This can happen if:
796 * 1. the path is mentioned explicitly in the pathspec
798 * 2. the path is a directory prefix of some element in the
801 static int exclude_matches_pathspec(const char *path
, int len
,
802 const struct path_simplify
*simplify
)
805 for (; simplify
->path
; simplify
++) {
806 if (len
== simplify
->len
807 && !memcmp(path
, simplify
->path
, len
))
809 if (len
< simplify
->len
810 && simplify
->path
[len
] == '/'
811 && !memcmp(path
, simplify
->path
, len
))
818 static int get_index_dtype(const char *path
, int len
)
821 struct cache_entry
*ce
;
823 ce
= cache_name_exists(path
, len
, 0);
825 if (!ce_uptodate(ce
))
827 if (S_ISGITLINK(ce
->ce_mode
))
830 * Nobody actually cares about the
831 * difference between DT_LNK and DT_REG
836 /* Try to look it up as a directory */
837 pos
= cache_name_pos(path
, len
);
841 while (pos
< active_nr
) {
842 ce
= active_cache
[pos
++];
843 if (strncmp(ce
->name
, path
, len
))
845 if (ce
->name
[len
] > '/')
847 if (ce
->name
[len
] < '/')
849 if (!ce_uptodate(ce
))
850 break; /* continue? */
856 static int get_dtype(struct dirent
*de
, const char *path
, int len
)
858 int dtype
= de
? DTYPE(de
) : DT_UNKNOWN
;
861 if (dtype
!= DT_UNKNOWN
)
863 dtype
= get_index_dtype(path
, len
);
864 if (dtype
!= DT_UNKNOWN
)
866 if (lstat(path
, &st
))
868 if (S_ISREG(st
.st_mode
))
870 if (S_ISDIR(st
.st_mode
))
872 if (S_ISLNK(st
.st_mode
))
877 enum path_treatment
{
883 static enum path_treatment
treat_one_path(struct dir_struct
*dir
,
885 const struct path_simplify
*simplify
,
886 int dtype
, struct dirent
*de
)
888 int exclude
= excluded(dir
, path
->buf
, &dtype
);
889 if (exclude
&& (dir
->flags
& DIR_COLLECT_IGNORED
)
890 && exclude_matches_pathspec(path
->buf
, path
->len
, simplify
))
891 dir_add_ignored(dir
, path
->buf
, path
->len
);
894 * Excluded? If we don't explicitly want to show
895 * ignored files, ignore it
897 if (exclude
&& !(dir
->flags
& DIR_SHOW_IGNORED
))
900 if (dtype
== DT_UNKNOWN
)
901 dtype
= get_dtype(de
, path
->buf
, path
->len
);
904 * Do we want to see just the ignored files?
905 * We still need to recurse into directories,
906 * even if we don't ignore them, since the
907 * directory may contain files that we do..
909 if (!exclude
&& (dir
->flags
& DIR_SHOW_IGNORED
)) {
918 strbuf_addch(path
, '/');
919 switch (treat_directory(dir
, path
->buf
, path
->len
, simplify
)) {
921 if (exclude
!= !!(dir
->flags
925 case recurse_into_directory
:
927 case ignore_directory
:
938 static enum path_treatment
treat_path(struct dir_struct
*dir
,
942 const struct path_simplify
*simplify
)
946 if (is_dot_or_dotdot(de
->d_name
) || !strcmp(de
->d_name
, ".git"))
948 strbuf_setlen(path
, baselen
);
949 strbuf_addstr(path
, de
->d_name
);
950 if (simplify_away(path
->buf
, path
->len
, simplify
))
954 return treat_one_path(dir
, path
, simplify
, dtype
, de
);
958 * Read a directory tree. We currently ignore anything but
959 * directories, regular files and symlinks. That's because git
960 * doesn't handle them at all yet. Maybe that will change some
963 * Also, we ignore the name ".git" (even if it is not a directory).
964 * That likely will not change.
966 static int read_directory_recursive(struct dir_struct
*dir
,
967 const char *base
, int baselen
,
969 const struct path_simplify
*simplify
)
974 struct strbuf path
= STRBUF_INIT
;
976 strbuf_add(&path
, base
, baselen
);
978 fdir
= opendir(path
.len
? path
.buf
: ".");
982 while ((de
= readdir(fdir
)) != NULL
) {
983 switch (treat_path(dir
, de
, &path
, baselen
, simplify
)) {
985 contents
+= read_directory_recursive(dir
, path
.buf
,
997 dir_add_name(dir
, path
.buf
, path
.len
);
1001 strbuf_release(&path
);
1006 static int cmp_name(const void *p1
, const void *p2
)
1008 const struct dir_entry
*e1
= *(const struct dir_entry
**)p1
;
1009 const struct dir_entry
*e2
= *(const struct dir_entry
**)p2
;
1011 return cache_name_compare(e1
->name
, e1
->len
,
1015 static struct path_simplify
*create_simplify(const char **pathspec
)
1018 struct path_simplify
*simplify
= NULL
;
1023 for (nr
= 0 ; ; nr
++) {
1026 alloc
= alloc_nr(alloc
);
1027 simplify
= xrealloc(simplify
, alloc
* sizeof(*simplify
));
1029 match
= *pathspec
++;
1032 simplify
[nr
].path
= match
;
1033 simplify
[nr
].len
= simple_length(match
);
1035 simplify
[nr
].path
= NULL
;
1036 simplify
[nr
].len
= 0;
1040 static void free_simplify(struct path_simplify
*simplify
)
1045 static int treat_leading_path(struct dir_struct
*dir
,
1046 const char *path
, int len
,
1047 const struct path_simplify
*simplify
)
1049 struct strbuf sb
= STRBUF_INIT
;
1050 int baselen
, rc
= 0;
1053 while (len
&& path
[len
- 1] == '/')
1059 cp
= path
+ baselen
+ !!baselen
;
1060 cp
= memchr(cp
, '/', path
+ len
- cp
);
1064 baselen
= cp
- path
;
1065 strbuf_setlen(&sb
, 0);
1066 strbuf_add(&sb
, path
, baselen
);
1067 if (!is_directory(sb
.buf
))
1069 if (simplify_away(sb
.buf
, sb
.len
, simplify
))
1071 if (treat_one_path(dir
, &sb
, simplify
,
1072 DT_DIR
, NULL
) == path_ignored
)
1073 break; /* do not recurse into it */
1074 if (len
<= baselen
) {
1076 break; /* finished checking */
1079 strbuf_release(&sb
);
1083 int read_directory(struct dir_struct
*dir
, const char *path
, int len
, const char **pathspec
)
1085 struct path_simplify
*simplify
;
1087 if (has_symlink_leading_path(path
, len
))
1090 simplify
= create_simplify(pathspec
);
1091 if (!len
|| treat_leading_path(dir
, path
, len
, simplify
))
1092 read_directory_recursive(dir
, path
, len
, 0, simplify
);
1093 free_simplify(simplify
);
1094 qsort(dir
->entries
, dir
->nr
, sizeof(struct dir_entry
*), cmp_name
);
1095 qsort(dir
->ignored
, dir
->ignored_nr
, sizeof(struct dir_entry
*), cmp_name
);
1099 int file_exists(const char *f
)
1102 return lstat(f
, &sb
) == 0;
1106 * Given two normalized paths (a trailing slash is ok), if subdir is
1107 * outside dir, return -1. Otherwise return the offset in subdir that
1108 * can be used as relative path to dir.
1110 int dir_inside_of(const char *subdir
, const char *dir
)
1114 assert(dir
&& subdir
&& *dir
&& *subdir
);
1116 while (*dir
&& *subdir
&& *dir
== *subdir
) {
1122 /* hel[p]/me vs hel[l]/yeah */
1123 if (*dir
&& *subdir
)
1127 return !*dir
? offset
: -1; /* same dir */
1129 /* foo/[b]ar vs foo/[] */
1130 if (is_dir_sep(dir
[-1]))
1131 return is_dir_sep(subdir
[-1]) ? offset
: -1;
1133 /* foo[/]bar vs foo[] */
1134 return is_dir_sep(*subdir
) ? offset
+ 1 : -1;
1137 int is_inside_dir(const char *dir
)
1142 if (!getcwd(cwd
, sizeof(cwd
)))
1143 die_errno("can't find the current directory");
1144 return dir_inside_of(cwd
, dir
) >= 0;
1147 int is_empty_dir(const char *path
)
1149 DIR *dir
= opendir(path
);
1156 while ((e
= readdir(dir
)) != NULL
)
1157 if (!is_dot_or_dotdot(e
->d_name
)) {
1166 static int remove_dir_recurse(struct strbuf
*path
, int flag
, int *kept_up
)
1170 int ret
= 0, original_len
= path
->len
, len
, kept_down
= 0;
1171 int only_empty
= (flag
& REMOVE_DIR_EMPTY_ONLY
);
1172 int keep_toplevel
= (flag
& REMOVE_DIR_KEEP_TOPLEVEL
);
1173 unsigned char submodule_head
[20];
1175 if ((flag
& REMOVE_DIR_KEEP_NESTED_GIT
) &&
1176 !resolve_gitlink_ref(path
->buf
, "HEAD", submodule_head
)) {
1177 /* Do not descend and nuke a nested git work tree. */
1183 flag
&= ~REMOVE_DIR_KEEP_TOPLEVEL
;
1184 dir
= opendir(path
->buf
);
1186 /* an empty dir could be removed even if it is unreadble */
1188 return rmdir(path
->buf
);
1192 if (path
->buf
[original_len
- 1] != '/')
1193 strbuf_addch(path
, '/');
1196 while ((e
= readdir(dir
)) != NULL
) {
1198 if (is_dot_or_dotdot(e
->d_name
))
1201 strbuf_setlen(path
, len
);
1202 strbuf_addstr(path
, e
->d_name
);
1203 if (lstat(path
->buf
, &st
))
1205 else if (S_ISDIR(st
.st_mode
)) {
1206 if (!remove_dir_recurse(path
, flag
, &kept_down
))
1207 continue; /* happy */
1208 } else if (!only_empty
&& !unlink(path
->buf
))
1209 continue; /* happy, too */
1211 /* path too long, stat fails, or non-directory still exists */
1217 strbuf_setlen(path
, original_len
);
1218 if (!ret
&& !keep_toplevel
&& !kept_down
)
1219 ret
= rmdir(path
->buf
);
1222 * report the uplevel that it is not an error that we
1223 * did not rmdir() our directory.
1229 int remove_dir_recursively(struct strbuf
*path
, int flag
)
1231 return remove_dir_recurse(path
, flag
, NULL
);
1234 void setup_standard_excludes(struct dir_struct
*dir
)
1238 dir
->exclude_per_dir
= ".gitignore";
1239 path
= git_path("info/exclude");
1240 if (!access(path
, R_OK
))
1241 add_excludes_from_file(dir
, path
);
1242 if (excludes_file
&& !access(excludes_file
, R_OK
))
1243 add_excludes_from_file(dir
, excludes_file
);
1246 int remove_path(const char *name
)
1250 if (unlink(name
) && errno
!= ENOENT
)
1253 slash
= strrchr(name
, '/');
1255 char *dirs
= xstrdup(name
);
1256 slash
= dirs
+ (slash
- name
);
1259 } while (rmdir(dirs
) == 0 && (slash
= strrchr(dirs
, '/')));
1265 static int pathspec_item_cmp(const void *a_
, const void *b_
)
1267 struct pathspec_item
*a
, *b
;
1269 a
= (struct pathspec_item
*)a_
;
1270 b
= (struct pathspec_item
*)b_
;
1271 return strcmp(a
->match
, b
->match
);
1274 int init_pathspec(struct pathspec
*pathspec
, const char **paths
)
1276 const char **p
= paths
;
1279 memset(pathspec
, 0, sizeof(*pathspec
));
1284 pathspec
->raw
= paths
;
1285 pathspec
->nr
= p
- paths
;
1289 pathspec
->items
= xmalloc(sizeof(struct pathspec_item
)*pathspec
->nr
);
1290 for (i
= 0; i
< pathspec
->nr
; i
++) {
1291 struct pathspec_item
*item
= pathspec
->items
+i
;
1292 const char *path
= paths
[i
];
1295 item
->len
= strlen(path
);
1296 item
->use_wildcard
= !no_wildcard(path
);
1297 if (item
->use_wildcard
)
1298 pathspec
->has_wildcard
= 1;
1301 qsort(pathspec
->items
, pathspec
->nr
,
1302 sizeof(struct pathspec_item
), pathspec_item_cmp
);
1307 void free_pathspec(struct pathspec
*pathspec
)
1309 free(pathspec
->items
);
1310 pathspec
->items
= NULL
;