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 int common_prefix(const char **pathspec
)
39 const char *path
, *slash
, *next
;
46 slash
= strrchr(path
, '/');
51 * The first 'prefix' characters of 'path' are common leading
52 * path components among the pathspecs we have seen so far,
53 * including the trailing slash.
55 prefix
= slash
- path
+ 1;
56 while ((next
= *++pathspec
) != NULL
) {
57 int len
, last_matching_slash
= -1;
58 for (len
= 0; len
< prefix
&& next
[len
] == path
[len
]; len
++)
60 last_matching_slash
= len
;
63 if (last_matching_slash
< 0)
65 prefix
= last_matching_slash
+ 1;
70 int fill_directory(struct dir_struct
*dir
, const char **pathspec
)
76 * Calculate common prefix for the pathspec, and
77 * use that to optimize the directory walk
79 len
= common_prefix(pathspec
);
83 path
= xmemdupz(*pathspec
, len
);
85 /* Read the directory and prune it */
86 read_directory(dir
, path
, 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
)
291 static int no_wildcard(const char *string
)
293 return string
[strcspn(string
, "*?[{\\")] == '\0';
296 void add_exclude(const char *string
, const char *base
,
297 int baselen
, struct exclude_list
*which
)
304 if (*string
== '!') {
308 len
= strlen(string
);
309 if (len
&& string
[len
- 1] == '/') {
311 x
= xmalloc(sizeof(*x
) + len
);
313 memcpy(s
, string
, len
- 1);
317 flags
= EXC_FLAG_MUSTBEDIR
;
319 x
= xmalloc(sizeof(*x
));
322 x
->to_exclude
= to_exclude
;
323 x
->patternlen
= strlen(string
);
325 x
->baselen
= baselen
;
327 if (!strchr(string
, '/'))
328 x
->flags
|= EXC_FLAG_NODIR
;
329 if (no_wildcard(string
))
330 x
->flags
|= EXC_FLAG_NOWILDCARD
;
331 if (*string
== '*' && no_wildcard(string
+1))
332 x
->flags
|= EXC_FLAG_ENDSWITH
;
333 ALLOC_GROW(which
->excludes
, which
->nr
+ 1, which
->alloc
);
334 which
->excludes
[which
->nr
++] = x
;
337 static void *read_skip_worktree_file_from_index(const char *path
, size_t *size
)
341 enum object_type type
;
343 struct index_state
*istate
= &the_index
;
346 pos
= index_name_pos(istate
, path
, len
);
349 if (!ce_skip_worktree(istate
->cache
[pos
]))
351 data
= read_sha1_file(istate
->cache
[pos
]->sha1
, &type
, &sz
);
352 if (!data
|| type
!= OBJ_BLOB
) {
360 void free_excludes(struct exclude_list
*el
)
364 for (i
= 0; i
< el
->nr
; i
++)
365 free(el
->excludes
[i
]);
372 int add_excludes_from_file_to_list(const char *fname
,
376 struct exclude_list
*which
,
384 fd
= open(fname
, O_RDONLY
);
385 if (fd
< 0 || fstat(fd
, &st
) < 0) {
389 (buf
= read_skip_worktree_file_from_index(fname
, &size
)) == NULL
)
395 if (buf
[size
-1] != '\n') {
396 buf
= xrealloc(buf
, size
+1);
401 size
= xsize_t(st
.st_size
);
406 buf
= xmalloc(size
+1);
407 if (read_in_full(fd
, buf
, size
) != size
) {
419 for (i
= 0; i
< size
; i
++) {
420 if (buf
[i
] == '\n') {
421 if (entry
!= buf
+ i
&& entry
[0] != '#') {
422 buf
[i
- (i
&& buf
[i
-1] == '\r')] = 0;
423 add_exclude(entry
, base
, baselen
, which
);
431 void add_excludes_from_file(struct dir_struct
*dir
, const char *fname
)
433 if (add_excludes_from_file_to_list(fname
, "", 0, NULL
,
434 &dir
->exclude_list
[EXC_FILE
], 0) < 0)
435 die("cannot use %s as an exclude file", fname
);
438 static void prep_exclude(struct dir_struct
*dir
, const char *base
, int baselen
)
440 struct exclude_list
*el
;
441 struct exclude_stack
*stk
= NULL
;
444 if ((!dir
->exclude_per_dir
) ||
445 (baselen
+ strlen(dir
->exclude_per_dir
) >= PATH_MAX
))
446 return; /* too long a path -- ignore */
448 /* Pop the ones that are not the prefix of the path being checked. */
449 el
= &dir
->exclude_list
[EXC_DIRS
];
450 while ((stk
= dir
->exclude_stack
) != NULL
) {
451 if (stk
->baselen
<= baselen
&&
452 !strncmp(dir
->basebuf
, base
, stk
->baselen
))
454 dir
->exclude_stack
= stk
->prev
;
455 while (stk
->exclude_ix
< el
->nr
)
456 free(el
->excludes
[--el
->nr
]);
461 /* Read from the parent directories and push them down. */
462 current
= stk
? stk
->baselen
: -1;
463 while (current
< baselen
) {
464 struct exclude_stack
*stk
= xcalloc(1, sizeof(*stk
));
472 cp
= strchr(base
+ current
+ 1, '/');
474 die("oops in prep_exclude");
477 stk
->prev
= dir
->exclude_stack
;
478 stk
->baselen
= cp
- base
;
479 stk
->exclude_ix
= el
->nr
;
480 memcpy(dir
->basebuf
+ current
, base
+ current
,
481 stk
->baselen
- current
);
482 strcpy(dir
->basebuf
+ stk
->baselen
, dir
->exclude_per_dir
);
483 add_excludes_from_file_to_list(dir
->basebuf
,
484 dir
->basebuf
, stk
->baselen
,
485 &stk
->filebuf
, el
, 1);
486 dir
->exclude_stack
= stk
;
487 current
= stk
->baselen
;
489 dir
->basebuf
[baselen
] = '\0';
492 /* Scan the list and let the last match determine the fate.
493 * Return 1 for exclude, 0 for include and -1 for undecided.
495 int excluded_from_list(const char *pathname
,
496 int pathlen
, const char *basename
, int *dtype
,
497 struct exclude_list
*el
)
502 for (i
= el
->nr
- 1; 0 <= i
; i
--) {
503 struct exclude
*x
= el
->excludes
[i
];
504 const char *exclude
= x
->pattern
;
505 int to_exclude
= x
->to_exclude
;
507 if (x
->flags
& EXC_FLAG_MUSTBEDIR
) {
508 if (*dtype
== DT_UNKNOWN
)
509 *dtype
= get_dtype(NULL
, pathname
, pathlen
);
510 if (*dtype
!= DT_DIR
)
514 if (x
->flags
& EXC_FLAG_NODIR
) {
516 if (x
->flags
& EXC_FLAG_NOWILDCARD
) {
517 if (!strcmp_icase(exclude
, basename
))
519 } else if (x
->flags
& EXC_FLAG_ENDSWITH
) {
520 if (x
->patternlen
- 1 <= pathlen
&&
521 !strcmp_icase(exclude
+ 1, pathname
+ pathlen
- x
->patternlen
+ 1))
524 if (fnmatch_icase(exclude
, basename
, 0) == 0)
529 /* match with FNM_PATHNAME:
530 * exclude has base (baselen long) implicitly
533 int baselen
= x
->baselen
;
537 if (pathlen
< baselen
||
538 (baselen
&& pathname
[baselen
-1] != '/') ||
539 strncmp_icase(pathname
, x
->base
, baselen
))
542 if (x
->flags
& EXC_FLAG_NOWILDCARD
) {
543 if (!strcmp_icase(exclude
, pathname
+ baselen
))
546 if (fnmatch_icase(exclude
, pathname
+baselen
,
553 return -1; /* undecided */
556 int excluded(struct dir_struct
*dir
, const char *pathname
, int *dtype_p
)
558 int pathlen
= strlen(pathname
);
560 const char *basename
= strrchr(pathname
, '/');
561 basename
= (basename
) ? basename
+1 : pathname
;
563 prep_exclude(dir
, pathname
, basename
-pathname
);
564 for (st
= EXC_CMDL
; st
<= EXC_FILE
; st
++) {
565 switch (excluded_from_list(pathname
, pathlen
, basename
,
566 dtype_p
, &dir
->exclude_list
[st
])) {
576 static struct dir_entry
*dir_entry_new(const char *pathname
, int len
)
578 struct dir_entry
*ent
;
580 ent
= xmalloc(sizeof(*ent
) + len
+ 1);
582 memcpy(ent
->name
, pathname
, len
);
587 static struct dir_entry
*dir_add_name(struct dir_struct
*dir
, const char *pathname
, int len
)
589 if (cache_name_exists(pathname
, len
, ignore_case
))
592 ALLOC_GROW(dir
->entries
, dir
->nr
+1, dir
->alloc
);
593 return dir
->entries
[dir
->nr
++] = dir_entry_new(pathname
, len
);
596 struct dir_entry
*dir_add_ignored(struct dir_struct
*dir
, const char *pathname
, int len
)
598 if (!cache_name_is_other(pathname
, len
))
601 ALLOC_GROW(dir
->ignored
, dir
->ignored_nr
+1, dir
->ignored_alloc
);
602 return dir
->ignored
[dir
->ignored_nr
++] = dir_entry_new(pathname
, len
);
606 index_nonexistent
= 0,
612 * Do not use the alphabetically stored index to look up
613 * the directory name; instead, use the case insensitive
616 static enum exist_status
directory_exists_in_index_icase(const char *dirname
, int len
)
618 struct cache_entry
*ce
= index_name_exists(&the_index
, dirname
, len
+ 1, ignore_case
);
619 unsigned char endchar
;
622 return index_nonexistent
;
623 endchar
= ce
->name
[len
];
626 * The cache_entry structure returned will contain this dirname
627 * and possibly additional path components.
630 return index_directory
;
633 * If there are no additional path components, then this cache_entry
634 * represents a submodule. Submodules, despite being directories,
635 * are stored in the cache without a closing slash.
637 if (!endchar
&& S_ISGITLINK(ce
->ce_mode
))
640 /* This should never be hit, but it exists just in case. */
641 return index_nonexistent
;
645 * The index sorts alphabetically by entry name, which
646 * means that a gitlink sorts as '\0' at the end, while
647 * a directory (which is defined not as an entry, but as
648 * the files it contains) will sort with the '/' at the
651 static enum exist_status
directory_exists_in_index(const char *dirname
, int len
)
656 return directory_exists_in_index_icase(dirname
, len
);
658 pos
= cache_name_pos(dirname
, len
);
661 while (pos
< active_nr
) {
662 struct cache_entry
*ce
= active_cache
[pos
++];
663 unsigned char endchar
;
665 if (strncmp(ce
->name
, dirname
, len
))
667 endchar
= ce
->name
[len
];
671 return index_directory
;
672 if (!endchar
&& S_ISGITLINK(ce
->ce_mode
))
675 return index_nonexistent
;
679 * When we find a directory when traversing the filesystem, we
680 * have three distinct cases:
683 * - see it as a directory
686 * and which one we choose depends on a combination of existing
687 * git index contents and the flags passed into the directory
690 * Case 1: If we *already* have entries in the index under that
691 * directory name, we always recurse into the directory to see
694 * Case 2: If we *already* have that directory name as a gitlink,
695 * we always continue to see it as a gitlink, regardless of whether
696 * there is an actual git directory there or not (it might not
697 * be checked out as a subproject!)
699 * Case 3: if we didn't have it in the index previously, we
700 * have a few sub-cases:
702 * (a) if "show_other_directories" is true, we show it as
703 * just a directory, unless "hide_empty_directories" is
704 * also true and the directory is empty, in which case
705 * we just ignore it entirely.
706 * (b) if it looks like a git directory, and we don't have
707 * 'no_gitlinks' set we treat it as a gitlink, and show it
709 * (c) otherwise, we recurse into it.
711 enum directory_treatment
{
714 recurse_into_directory
717 static enum directory_treatment
treat_directory(struct dir_struct
*dir
,
718 const char *dirname
, int len
,
719 const struct path_simplify
*simplify
)
721 /* The "len-1" is to strip the final '/' */
722 switch (directory_exists_in_index(dirname
, len
-1)) {
723 case index_directory
:
724 return recurse_into_directory
;
727 if (dir
->flags
& DIR_SHOW_OTHER_DIRECTORIES
)
728 return ignore_directory
;
729 return show_directory
;
731 case index_nonexistent
:
732 if (dir
->flags
& DIR_SHOW_OTHER_DIRECTORIES
)
734 if (!(dir
->flags
& DIR_NO_GITLINKS
)) {
735 unsigned char sha1
[20];
736 if (resolve_gitlink_ref(dirname
, "HEAD", sha1
) == 0)
737 return show_directory
;
739 return recurse_into_directory
;
742 /* This is the "show_other_directories" case */
743 if (!(dir
->flags
& DIR_HIDE_EMPTY_DIRECTORIES
))
744 return show_directory
;
745 if (!read_directory_recursive(dir
, dirname
, len
, 1, simplify
))
746 return ignore_directory
;
747 return show_directory
;
751 * This is an inexact early pruning of any recursive directory
752 * reading - if the path cannot possibly be in the pathspec,
753 * return true, and we'll skip it early.
755 static int simplify_away(const char *path
, int pathlen
, const struct path_simplify
*simplify
)
759 const char *match
= simplify
->path
;
760 int len
= simplify
->len
;
766 if (!memcmp(path
, match
, len
))
776 * This function tells us whether an excluded path matches a
777 * list of "interesting" pathspecs. That is, whether a path matched
778 * by any of the pathspecs could possibly be ignored by excluding
779 * the specified path. This can happen if:
781 * 1. the path is mentioned explicitly in the pathspec
783 * 2. the path is a directory prefix of some element in the
786 static int exclude_matches_pathspec(const char *path
, int len
,
787 const struct path_simplify
*simplify
)
790 for (; simplify
->path
; simplify
++) {
791 if (len
== simplify
->len
792 && !memcmp(path
, simplify
->path
, len
))
794 if (len
< simplify
->len
795 && simplify
->path
[len
] == '/'
796 && !memcmp(path
, simplify
->path
, len
))
803 static int get_index_dtype(const char *path
, int len
)
806 struct cache_entry
*ce
;
808 ce
= cache_name_exists(path
, len
, 0);
810 if (!ce_uptodate(ce
))
812 if (S_ISGITLINK(ce
->ce_mode
))
815 * Nobody actually cares about the
816 * difference between DT_LNK and DT_REG
821 /* Try to look it up as a directory */
822 pos
= cache_name_pos(path
, len
);
826 while (pos
< active_nr
) {
827 ce
= active_cache
[pos
++];
828 if (strncmp(ce
->name
, path
, len
))
830 if (ce
->name
[len
] > '/')
832 if (ce
->name
[len
] < '/')
834 if (!ce_uptodate(ce
))
835 break; /* continue? */
841 static int get_dtype(struct dirent
*de
, const char *path
, int len
)
843 int dtype
= de
? DTYPE(de
) : DT_UNKNOWN
;
846 if (dtype
!= DT_UNKNOWN
)
848 dtype
= get_index_dtype(path
, len
);
849 if (dtype
!= DT_UNKNOWN
)
851 if (lstat(path
, &st
))
853 if (S_ISREG(st
.st_mode
))
855 if (S_ISDIR(st
.st_mode
))
857 if (S_ISLNK(st
.st_mode
))
862 enum path_treatment
{
868 static enum path_treatment
treat_one_path(struct dir_struct
*dir
,
869 char *path
, int *len
,
870 const struct path_simplify
*simplify
,
871 int dtype
, struct dirent
*de
)
873 int exclude
= excluded(dir
, path
, &dtype
);
874 if (exclude
&& (dir
->flags
& DIR_COLLECT_IGNORED
)
875 && exclude_matches_pathspec(path
, *len
, simplify
))
876 dir_add_ignored(dir
, path
, *len
);
879 * Excluded? If we don't explicitly want to show
880 * ignored files, ignore it
882 if (exclude
&& !(dir
->flags
& DIR_SHOW_IGNORED
))
885 if (dtype
== DT_UNKNOWN
)
886 dtype
= get_dtype(de
, path
, *len
);
889 * Do we want to see just the ignored files?
890 * We still need to recurse into directories,
891 * even if we don't ignore them, since the
892 * directory may contain files that we do..
894 if (!exclude
&& (dir
->flags
& DIR_SHOW_IGNORED
)) {
903 memcpy(path
+ *len
, "/", 2);
905 switch (treat_directory(dir
, path
, *len
, simplify
)) {
907 if (exclude
!= !!(dir
->flags
911 case recurse_into_directory
:
913 case ignore_directory
:
924 static enum path_treatment
treat_path(struct dir_struct
*dir
,
926 char *path
, int path_max
,
928 const struct path_simplify
*simplify
,
933 if (is_dot_or_dotdot(de
->d_name
) || !strcmp(de
->d_name
, ".git"))
935 *len
= strlen(de
->d_name
);
936 /* Ignore overly long pathnames! */
937 if (*len
+ baselen
+ 8 > path_max
)
939 memcpy(path
+ baselen
, de
->d_name
, *len
+ 1);
941 if (simplify_away(path
, *len
, simplify
))
945 return treat_one_path(dir
, path
, len
, simplify
, dtype
, de
);
949 * Read a directory tree. We currently ignore anything but
950 * directories, regular files and symlinks. That's because git
951 * doesn't handle them at all yet. Maybe that will change some
954 * Also, we ignore the name ".git" (even if it is not a directory).
955 * That likely will not change.
957 static int read_directory_recursive(struct dir_struct
*dir
,
958 const char *base
, int baselen
,
960 const struct path_simplify
*simplify
)
962 DIR *fdir
= opendir(*base
? base
: ".");
967 char path
[PATH_MAX
+ 1];
968 memcpy(path
, base
, baselen
);
970 while ((de
= readdir(fdir
)) != NULL
) {
972 switch (treat_path(dir
, de
, path
, sizeof(path
),
973 baselen
, simplify
, &len
)) {
975 contents
+= read_directory_recursive
976 (dir
, path
, len
, 0, simplify
);
987 dir_add_name(dir
, path
, len
);
996 static int cmp_name(const void *p1
, const void *p2
)
998 const struct dir_entry
*e1
= *(const struct dir_entry
**)p1
;
999 const struct dir_entry
*e2
= *(const struct dir_entry
**)p2
;
1001 return cache_name_compare(e1
->name
, e1
->len
,
1006 * Return the length of the "simple" part of a path match limiter.
1008 static int simple_length(const char *match
)
1013 unsigned char c
= *match
++;
1015 if (c
== '\0' || is_glob_special(c
))
1020 static struct path_simplify
*create_simplify(const char **pathspec
)
1023 struct path_simplify
*simplify
= NULL
;
1028 for (nr
= 0 ; ; nr
++) {
1031 alloc
= alloc_nr(alloc
);
1032 simplify
= xrealloc(simplify
, alloc
* sizeof(*simplify
));
1034 match
= *pathspec
++;
1037 simplify
[nr
].path
= match
;
1038 simplify
[nr
].len
= simple_length(match
);
1040 simplify
[nr
].path
= NULL
;
1041 simplify
[nr
].len
= 0;
1045 static void free_simplify(struct path_simplify
*simplify
)
1050 static int treat_leading_path(struct dir_struct
*dir
,
1051 const char *path
, int len
,
1052 const struct path_simplify
*simplify
)
1054 char pathbuf
[PATH_MAX
];
1058 while (len
&& path
[len
- 1] == '/')
1064 cp
= path
+ baselen
+ !!baselen
;
1065 cp
= memchr(cp
, '/', path
+ len
- cp
);
1069 baselen
= cp
- path
;
1070 memcpy(pathbuf
, path
, baselen
);
1071 pathbuf
[baselen
] = '\0';
1072 if (!is_directory(pathbuf
))
1074 if (simplify_away(pathbuf
, baselen
, simplify
))
1077 if (treat_one_path(dir
, pathbuf
, &blen
, simplify
,
1078 DT_DIR
, NULL
) == path_ignored
)
1079 return 0; /* do not recurse into it */
1081 return 1; /* finished checking */
1085 int read_directory(struct dir_struct
*dir
, const char *path
, int len
, const char **pathspec
)
1087 struct path_simplify
*simplify
;
1089 if (has_symlink_leading_path(path
, len
))
1092 simplify
= create_simplify(pathspec
);
1093 if (!len
|| treat_leading_path(dir
, path
, len
, simplify
))
1094 read_directory_recursive(dir
, path
, len
, 0, simplify
);
1095 free_simplify(simplify
);
1096 qsort(dir
->entries
, dir
->nr
, sizeof(struct dir_entry
*), cmp_name
);
1097 qsort(dir
->ignored
, dir
->ignored_nr
, sizeof(struct dir_entry
*), cmp_name
);
1101 int file_exists(const char *f
)
1104 return lstat(f
, &sb
) == 0;
1108 * Given two normalized paths (a trailing slash is ok), if subdir is
1109 * outside dir, return -1. Otherwise return the offset in subdir that
1110 * can be used as relative path to dir.
1112 int dir_inside_of(const char *subdir
, const char *dir
)
1116 assert(dir
&& subdir
&& *dir
&& *subdir
);
1118 while (*dir
&& *subdir
&& *dir
== *subdir
) {
1124 /* hel[p]/me vs hel[l]/yeah */
1125 if (*dir
&& *subdir
)
1129 return !*dir
? offset
: -1; /* same dir */
1131 /* foo/[b]ar vs foo/[] */
1132 if (is_dir_sep(dir
[-1]))
1133 return is_dir_sep(subdir
[-1]) ? offset
: -1;
1135 /* foo[/]bar vs foo[] */
1136 return is_dir_sep(*subdir
) ? offset
+ 1 : -1;
1139 int is_inside_dir(const char *dir
)
1144 if (!getcwd(cwd
, sizeof(cwd
)))
1145 die_errno("can't find the current directory");
1146 return dir_inside_of(cwd
, dir
) >= 0;
1149 int is_empty_dir(const char *path
)
1151 DIR *dir
= opendir(path
);
1158 while ((e
= readdir(dir
)) != NULL
)
1159 if (!is_dot_or_dotdot(e
->d_name
)) {
1168 int remove_dir_recursively(struct strbuf
*path
, int flag
)
1172 int ret
= 0, original_len
= path
->len
, len
;
1173 int only_empty
= (flag
& REMOVE_DIR_EMPTY_ONLY
);
1174 unsigned char submodule_head
[20];
1176 if ((flag
& REMOVE_DIR_KEEP_NESTED_GIT
) &&
1177 !resolve_gitlink_ref(path
->buf
, "HEAD", submodule_head
))
1178 /* Do not descend and nuke a nested git work tree. */
1181 dir
= opendir(path
->buf
);
1183 return rmdir(path
->buf
);
1184 if (path
->buf
[original_len
- 1] != '/')
1185 strbuf_addch(path
, '/');
1188 while ((e
= readdir(dir
)) != NULL
) {
1190 if (is_dot_or_dotdot(e
->d_name
))
1193 strbuf_setlen(path
, len
);
1194 strbuf_addstr(path
, e
->d_name
);
1195 if (lstat(path
->buf
, &st
))
1197 else if (S_ISDIR(st
.st_mode
)) {
1198 if (!remove_dir_recursively(path
, only_empty
))
1199 continue; /* happy */
1200 } else if (!only_empty
&& !unlink(path
->buf
))
1201 continue; /* happy, too */
1203 /* path too long, stat fails, or non-directory still exists */
1209 strbuf_setlen(path
, original_len
);
1211 ret
= rmdir(path
->buf
);
1215 void setup_standard_excludes(struct dir_struct
*dir
)
1219 dir
->exclude_per_dir
= ".gitignore";
1220 path
= git_path("info/exclude");
1221 if (!access(path
, R_OK
))
1222 add_excludes_from_file(dir
, path
);
1223 if (excludes_file
&& !access(excludes_file
, R_OK
))
1224 add_excludes_from_file(dir
, excludes_file
);
1227 int remove_path(const char *name
)
1231 if (unlink(name
) && errno
!= ENOENT
)
1234 slash
= strrchr(name
, '/');
1236 char *dirs
= xstrdup(name
);
1237 slash
= dirs
+ (slash
- name
);
1240 } while (rmdir(dirs
) == 0 && (slash
= strrchr(dirs
, '/')));
1246 static int pathspec_item_cmp(const void *a_
, const void *b_
)
1248 struct pathspec_item
*a
, *b
;
1250 a
= (struct pathspec_item
*)a_
;
1251 b
= (struct pathspec_item
*)b_
;
1252 return strcmp(a
->match
, b
->match
);
1255 int init_pathspec(struct pathspec
*pathspec
, const char **paths
)
1257 const char **p
= paths
;
1260 memset(pathspec
, 0, sizeof(*pathspec
));
1265 pathspec
->raw
= paths
;
1266 pathspec
->nr
= p
- paths
;
1270 pathspec
->items
= xmalloc(sizeof(struct pathspec_item
)*pathspec
->nr
);
1271 for (i
= 0; i
< pathspec
->nr
; i
++) {
1272 struct pathspec_item
*item
= pathspec
->items
+i
;
1273 const char *path
= paths
[i
];
1276 item
->len
= strlen(path
);
1277 item
->use_wildcard
= !no_wildcard(path
);
1278 if (item
->use_wildcard
)
1279 pathspec
->has_wildcard
= 1;
1282 qsort(pathspec
->items
, pathspec
->nr
,
1283 sizeof(struct pathspec_item
), pathspec_item_cmp
);
1288 void free_pathspec(struct pathspec
*pathspec
)
1290 free(pathspec
->items
);
1291 pathspec
->items
= NULL
;