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
,
18 const char *path
, const char *base
, int baselen
,
19 int check_only
, const struct path_simplify
*simplify
);
21 int common_prefix(const char **pathspec
)
23 const char *path
, *slash
, *next
;
30 slash
= strrchr(path
, '/');
34 prefix
= slash
- path
+ 1;
35 while ((next
= *++pathspec
) != NULL
) {
36 int len
= strlen(next
);
37 if (len
>= prefix
&& !memcmp(path
, next
, len
))
42 if (next
[--len
] != '/')
44 if (memcmp(path
, next
, len
+1))
54 * Does 'match' matches the given name?
57 * (1) the 'match' string is leading directory of 'name', or
58 * (2) the 'match' string is a wildcard and matches 'name', or
59 * (3) the 'match' string is exactly the same as 'name'.
61 * and the return value tells which case it was.
63 * It returns 0 when there is no match.
65 static int match_one(const char *match
, const char *name
, int namelen
)
69 /* If the match was just the prefix, we matched */
70 matchlen
= strlen(match
);
72 return MATCHED_RECURSIVELY
;
75 * If we don't match the matchstring exactly,
76 * we need to match by fnmatch
78 if (strncmp(match
, name
, matchlen
))
79 return !fnmatch(match
, name
, 0) ? MATCHED_FNMATCH
: 0;
82 return MATCHED_EXACTLY
;
83 if (match
[matchlen
-1] == '/' || name
[matchlen
] == '/')
84 return MATCHED_RECURSIVELY
;
89 * Given a name and a list of pathspecs, see if the name matches
90 * any of the pathspecs. The caller is also interested in seeing
91 * all pathspec matches some names it calls this function with
92 * (otherwise the user could have mistyped the unmatched pathspec),
93 * and a mark is left in seen[] array for pathspec element that
94 * actually matched anything.
96 int match_pathspec(const char **pathspec
, const char *name
, int namelen
, int prefix
, char *seen
)
104 for (retval
= 0; (match
= *pathspec
++) != NULL
; seen
++) {
106 if (retval
&& *seen
== MATCHED_EXACTLY
)
109 how
= match_one(match
, name
, namelen
);
120 void add_exclude(const char *string
, const char *base
,
121 int baselen
, struct exclude_list
*which
)
123 struct exclude
*x
= xmalloc(sizeof (*x
));
127 x
->baselen
= baselen
;
128 if (which
->nr
== which
->alloc
) {
129 which
->alloc
= alloc_nr(which
->alloc
);
130 which
->excludes
= xrealloc(which
->excludes
,
131 which
->alloc
* sizeof(x
));
133 which
->excludes
[which
->nr
++] = x
;
136 static int add_excludes_from_file_1(const char *fname
,
139 struct exclude_list
*which
)
146 fd
= open(fname
, O_RDONLY
);
147 if (fd
< 0 || fstat(fd
, &st
) < 0)
149 size
= xsize_t(st
.st_size
);
154 buf
= xmalloc(size
+1);
155 if (read_in_full(fd
, buf
, size
) != size
)
161 for (i
= 0; i
< size
; i
++) {
162 if (buf
[i
] == '\n') {
163 if (entry
!= buf
+ i
&& entry
[0] != '#') {
164 buf
[i
- (i
&& buf
[i
-1] == '\r')] = 0;
165 add_exclude(entry
, base
, baselen
, which
);
178 void add_excludes_from_file(struct dir_struct
*dir
, const char *fname
)
180 if (add_excludes_from_file_1(fname
, "", 0,
181 &dir
->exclude_list
[EXC_FILE
]) < 0)
182 die("cannot use %s as an exclude file", fname
);
185 int push_exclude_per_directory(struct dir_struct
*dir
, const char *base
, int baselen
)
187 char exclude_file
[PATH_MAX
];
188 struct exclude_list
*el
= &dir
->exclude_list
[EXC_DIRS
];
189 int current_nr
= el
->nr
;
191 if (dir
->exclude_per_dir
) {
192 memcpy(exclude_file
, base
, baselen
);
193 strcpy(exclude_file
+ baselen
, dir
->exclude_per_dir
);
194 add_excludes_from_file_1(exclude_file
, base
, baselen
, el
);
199 void pop_exclude_per_directory(struct dir_struct
*dir
, int stk
)
201 struct exclude_list
*el
= &dir
->exclude_list
[EXC_DIRS
];
204 free(el
->excludes
[--el
->nr
]);
207 /* Scan the list and let the last match determines the fate.
208 * Return 1 for exclude, 0 for include and -1 for undecided.
210 static int excluded_1(const char *pathname
,
212 struct exclude_list
*el
)
217 for (i
= el
->nr
- 1; 0 <= i
; i
--) {
218 struct exclude
*x
= el
->excludes
[i
];
219 const char *exclude
= x
->pattern
;
222 if (*exclude
== '!') {
227 if (!strchr(exclude
, '/')) {
229 const char *basename
= strrchr(pathname
, '/');
230 basename
= (basename
) ? basename
+1 : pathname
;
231 if (fnmatch(exclude
, basename
, 0) == 0)
235 /* match with FNM_PATHNAME:
236 * exclude has base (baselen long) implicitly
239 int baselen
= x
->baselen
;
243 if (pathlen
< baselen
||
244 (baselen
&& pathname
[baselen
-1] != '/') ||
245 strncmp(pathname
, x
->base
, baselen
))
248 if (fnmatch(exclude
, pathname
+baselen
,
254 return -1; /* undecided */
257 int excluded(struct dir_struct
*dir
, const char *pathname
)
259 int pathlen
= strlen(pathname
);
262 for (st
= EXC_CMDL
; st
<= EXC_FILE
; st
++) {
263 switch (excluded_1(pathname
, pathlen
, &dir
->exclude_list
[st
])) {
273 struct dir_entry
*dir_add_name(struct dir_struct
*dir
, const char *pathname
, int len
)
275 struct dir_entry
*ent
;
277 if (cache_name_pos(pathname
, len
) >= 0)
280 if (dir
->nr
== dir
->alloc
) {
281 int alloc
= alloc_nr(dir
->alloc
);
283 dir
->entries
= xrealloc(dir
->entries
, alloc
*sizeof(ent
));
285 ent
= xmalloc(sizeof(*ent
) + len
+ 1);
286 ent
->ignored
= ent
->ignored_dir
= 0;
288 memcpy(ent
->name
, pathname
, len
);
290 dir
->entries
[dir
->nr
++] = ent
;
295 index_nonexistent
= 0,
301 * The index sorts alphabetically by entry name, which
302 * means that a gitlink sorts as '\0' at the end, while
303 * a directory (which is defined not as an entry, but as
304 * the files it contains) will sort with the '/' at the
307 static enum exist_status
directory_exists_in_index(const char *dirname
, int len
)
309 int pos
= cache_name_pos(dirname
, len
);
312 while (pos
< active_nr
) {
313 struct cache_entry
*ce
= active_cache
[pos
++];
314 unsigned char endchar
;
316 if (strncmp(ce
->name
, dirname
, len
))
318 endchar
= ce
->name
[len
];
322 return index_directory
;
323 if (!endchar
&& S_ISDIRLNK(ntohl(ce
->ce_mode
)))
326 return index_nonexistent
;
330 * When we find a directory when traversing the filesystem, we
331 * have three distinct cases:
334 * - see it as a directory
337 * and which one we choose depends on a combination of existing
338 * git index contents and the flags passed into the directory
341 * Case 1: If we *already* have entries in the index under that
342 * directory name, we always recurse into the directory to see
345 * Case 2: If we *already* have that directory name as a gitlink,
346 * we always continue to see it as a gitlink, regardless of whether
347 * there is an actual git directory there or not (it might not
348 * be checked out as a subproject!)
350 * Case 3: if we didn't have it in the index previously, we
351 * have a few sub-cases:
353 * (a) if "show_other_directories" is true, we show it as
354 * just a directory, unless "hide_empty_directories" is
355 * also true and the directory is empty, in which case
356 * we just ignore it entirely.
357 * (b) if it looks like a git directory, and we don't have
358 * 'no_dirlinks' set we treat it as a gitlink, and show it
360 * (c) otherwise, we recurse into it.
362 enum directory_treatment
{
365 recurse_into_directory
,
368 static enum directory_treatment
treat_directory(struct dir_struct
*dir
,
369 const char *dirname
, int len
,
370 const struct path_simplify
*simplify
)
372 /* The "len-1" is to strip the final '/' */
373 switch (directory_exists_in_index(dirname
, len
-1)) {
374 case index_directory
:
375 return recurse_into_directory
;
378 if (dir
->show_other_directories
)
379 return ignore_directory
;
380 return show_directory
;
382 case index_nonexistent
:
383 if (dir
->show_other_directories
)
385 if (!dir
->no_dirlinks
) {
386 unsigned char sha1
[20];
387 if (resolve_gitlink_ref(dirname
, "HEAD", sha1
) == 0)
388 return show_directory
;
390 return recurse_into_directory
;
393 /* This is the "show_other_directories" case */
394 if (!dir
->hide_empty_directories
)
395 return show_directory
;
396 if (!read_directory_recursive(dir
, dirname
, dirname
, len
, 1, simplify
))
397 return ignore_directory
;
398 return show_directory
;
402 * This is an inexact early pruning of any recursive directory
403 * reading - if the path cannot possibly be in the pathspec,
404 * return true, and we'll skip it early.
406 static int simplify_away(const char *path
, int pathlen
, const struct path_simplify
*simplify
)
410 const char *match
= simplify
->path
;
411 int len
= simplify
->len
;
417 if (!memcmp(path
, match
, len
))
427 * Read a directory tree. We currently ignore anything but
428 * directories, regular files and symlinks. That's because git
429 * doesn't handle them at all yet. Maybe that will change some
432 * Also, we ignore the name ".git" (even if it is not a directory).
433 * That likely will not change.
435 static int read_directory_recursive(struct dir_struct
*dir
, const char *path
, const char *base
, int baselen
, int check_only
, const struct path_simplify
*simplify
)
437 DIR *fdir
= opendir(path
);
443 char fullname
[PATH_MAX
+ 1];
444 memcpy(fullname
, base
, baselen
);
446 exclude_stk
= push_exclude_per_directory(dir
, base
, baselen
);
448 while ((de
= readdir(fdir
)) != NULL
) {
451 if ((de
->d_name
[0] == '.') &&
452 (de
->d_name
[1] == 0 ||
453 !strcmp(de
->d_name
+ 1, ".") ||
454 !strcmp(de
->d_name
+ 1, "git")))
456 len
= strlen(de
->d_name
);
457 /* Ignore overly long pathnames! */
458 if (len
+ baselen
+ 8 > sizeof(fullname
))
460 memcpy(fullname
+ baselen
, de
->d_name
, len
+1);
461 if (simplify_away(fullname
, baselen
+ len
, simplify
))
463 if (excluded(dir
, fullname
) != dir
->show_ignored
) {
464 if (!dir
->show_ignored
|| DTYPE(de
) != DT_DIR
) {
474 if (lstat(fullname
, &st
))
476 if (S_ISREG(st
.st_mode
) || S_ISLNK(st
.st_mode
))
478 if (!S_ISDIR(st
.st_mode
))
482 memcpy(fullname
+ baselen
+ len
, "/", 2);
484 switch (treat_directory(dir
, fullname
, baselen
+ len
, simplify
)) {
487 case recurse_into_directory
:
488 contents
+= read_directory_recursive(dir
,
489 fullname
, fullname
, baselen
+ len
, 0, simplify
);
491 case ignore_directory
:
503 dir_add_name(dir
, fullname
, baselen
+ len
);
508 pop_exclude_per_directory(dir
, exclude_stk
);
514 static int cmp_name(const void *p1
, const void *p2
)
516 const struct dir_entry
*e1
= *(const struct dir_entry
**)p1
;
517 const struct dir_entry
*e2
= *(const struct dir_entry
**)p2
;
519 return cache_name_compare(e1
->name
, e1
->len
,
524 * Return the length of the "simple" part of a path match limiter.
526 static int simple_length(const char *match
)
528 const char special
[256] = {
530 ['\\'] = 1, ['*'] = 1,
536 unsigned char c
= *match
++;
543 static struct path_simplify
*create_simplify(const char **pathspec
)
546 struct path_simplify
*simplify
= NULL
;
551 for (nr
= 0 ; ; nr
++) {
554 alloc
= alloc_nr(alloc
);
555 simplify
= xrealloc(simplify
, alloc
* sizeof(*simplify
));
560 simplify
[nr
].path
= match
;
561 simplify
[nr
].len
= simple_length(match
);
563 simplify
[nr
].path
= NULL
;
564 simplify
[nr
].len
= 0;
568 static void free_simplify(struct path_simplify
*simplify
)
574 int read_directory(struct dir_struct
*dir
, const char *path
, const char *base
, int baselen
, const char **pathspec
)
576 struct path_simplify
*simplify
= create_simplify(pathspec
);
579 * Make sure to do the per-directory exclude for all the
580 * directories leading up to our base.
583 if (dir
->exclude_per_dir
) {
584 char *p
, *pp
= xmalloc(baselen
+1);
585 memcpy(pp
, base
, baselen
+1);
590 push_exclude_per_directory(dir
, pp
, p
-pp
);
604 read_directory_recursive(dir
, path
, base
, baselen
, 0, simplify
);
605 free_simplify(simplify
);
606 qsort(dir
->entries
, dir
->nr
, sizeof(struct dir_entry
*), cmp_name
);
611 file_exists(const char *f
)
614 return stat(f
, &sb
) == 0;