]>
Commit | Line | Data |
---|---|---|
453ec4bd LT |
1 | /* |
2 | * This handles recursive filename detection with exclude | |
3 | * files, index knowledge etc.. | |
4 | * | |
95a68344 AS |
5 | * See Documentation/technical/api-directory-listing.txt |
6 | * | |
453ec4bd LT |
7 | * Copyright (C) Linus Torvalds, 2005-2006 |
8 | * Junio Hamano, 2005-2006 | |
9 | */ | |
453ec4bd LT |
10 | #include "cache.h" |
11 | #include "dir.h" | |
09595258 | 12 | #include "refs.h" |
453ec4bd | 13 | |
9fc42d60 LT |
14 | struct path_simplify { |
15 | int len; | |
16 | const char *path; | |
17 | }; | |
18 | ||
dba2e203 | 19 | static int read_directory_recursive(struct dir_struct *dir, const char *path, int len, |
09595258 | 20 | int check_only, const struct path_simplify *simplify); |
caa6b782 | 21 | static int get_dtype(struct dirent *de, const char *path, int len); |
09595258 | 22 | |
8cf2a84e JJ |
23 | /* helper string functions with support for the ignore_case flag */ |
24 | int strcmp_icase(const char *a, const char *b) | |
25 | { | |
26 | return ignore_case ? strcasecmp(a, b) : strcmp(a, b); | |
27 | } | |
28 | ||
29 | int strncmp_icase(const char *a, const char *b, size_t count) | |
30 | { | |
31 | return ignore_case ? strncasecmp(a, b, count) : strncmp(a, b, count); | |
32 | } | |
33 | ||
34 | int fnmatch_icase(const char *pattern, const char *string, int flags) | |
35 | { | |
36 | return fnmatch(pattern, string, flags | (ignore_case ? FNM_CASEFOLD : 0)); | |
37 | } | |
38 | ||
f950eb95 | 39 | static size_t common_prefix_len(const char **pathspec) |
3c6a370b | 40 | { |
4a085b16 JH |
41 | const char *n, *first; |
42 | size_t max = 0; | |
3c6a370b LT |
43 | |
44 | if (!pathspec) | |
4a085b16 JH |
45 | return max; |
46 | ||
47 | first = *pathspec; | |
48 | while ((n = *pathspec++)) { | |
49 | size_t i, len = 0; | |
50 | for (i = 0; first == n || i < max; i++) { | |
51 | char c = n[i]; | |
52 | if (!c || c != first[i] || is_glob_special(c)) | |
53 | break; | |
54 | if (c == '/') | |
55 | len = i + 1; | |
56 | } | |
57 | if (first == n || len < max) { | |
58 | max = len; | |
59 | if (!max) | |
60 | break; | |
61 | } | |
3c6a370b | 62 | } |
4a085b16 | 63 | return max; |
3c6a370b LT |
64 | } |
65 | ||
f950eb95 CB |
66 | /* |
67 | * Returns a copy of the longest leading path common among all | |
68 | * pathspecs. | |
69 | */ | |
70 | char *common_prefix(const char **pathspec) | |
71 | { | |
72 | unsigned long len = common_prefix_len(pathspec); | |
73 | ||
74 | return len ? xmemdupz(*pathspec, len) : NULL; | |
75 | } | |
76 | ||
1d8842d9 LT |
77 | int fill_directory(struct dir_struct *dir, const char **pathspec) |
78 | { | |
4a085b16 | 79 | size_t len; |
1d8842d9 LT |
80 | |
81 | /* | |
82 | * Calculate common prefix for the pathspec, and | |
83 | * use that to optimize the directory walk | |
84 | */ | |
4a085b16 | 85 | len = common_prefix_len(pathspec); |
1d8842d9 LT |
86 | |
87 | /* Read the directory and prune it */ | |
2b189435 | 88 | read_directory(dir, pathspec ? *pathspec : "", len, pathspec); |
dba2e203 | 89 | return len; |
1d8842d9 LT |
90 | } |
91 | ||
bc96cc87 NTND |
92 | int within_depth(const char *name, int namelen, |
93 | int depth, int max_depth) | |
94 | { | |
95 | const char *cp = name, *cpe = name + namelen; | |
96 | ||
97 | while (cp < cpe) { | |
98 | if (*cp++ != '/') | |
99 | continue; | |
100 | depth++; | |
101 | if (depth > max_depth) | |
102 | return 0; | |
103 | } | |
104 | return 1; | |
105 | } | |
106 | ||
e813d50e | 107 | /* |
2c5b0115 | 108 | * Does 'match' match the given name? |
e813d50e JH |
109 | * A match is found if |
110 | * | |
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'. | |
114 | * | |
115 | * and the return value tells which case it was. | |
116 | * | |
117 | * It returns 0 when there is no match. | |
118 | */ | |
3c6a370b LT |
119 | static int match_one(const char *match, const char *name, int namelen) |
120 | { | |
121 | int matchlen; | |
122 | ||
123 | /* If the match was just the prefix, we matched */ | |
88ea8112 | 124 | if (!*match) |
e813d50e | 125 | return MATCHED_RECURSIVELY; |
3c6a370b | 126 | |
21444f18 JJ |
127 | if (ignore_case) { |
128 | for (;;) { | |
129 | unsigned char c1 = tolower(*match); | |
130 | unsigned char c2 = tolower(*name); | |
131 | if (c1 == '\0' || is_glob_special(c1)) | |
132 | break; | |
133 | if (c1 != c2) | |
134 | return 0; | |
135 | match++; | |
136 | name++; | |
137 | namelen--; | |
138 | } | |
139 | } else { | |
140 | for (;;) { | |
141 | unsigned char c1 = *match; | |
142 | unsigned char c2 = *name; | |
143 | if (c1 == '\0' || is_glob_special(c1)) | |
144 | break; | |
145 | if (c1 != c2) | |
146 | return 0; | |
147 | match++; | |
148 | name++; | |
149 | namelen--; | |
150 | } | |
88ea8112 LT |
151 | } |
152 | ||
153 | ||
3c6a370b LT |
154 | /* |
155 | * If we don't match the matchstring exactly, | |
156 | * we need to match by fnmatch | |
157 | */ | |
88ea8112 | 158 | matchlen = strlen(match); |
21444f18 JJ |
159 | if (strncmp_icase(match, name, matchlen)) |
160 | return !fnmatch_icase(match, name, 0) ? MATCHED_FNMATCH : 0; | |
3c6a370b | 161 | |
f2d0df71 | 162 | if (namelen == matchlen) |
e813d50e JH |
163 | return MATCHED_EXACTLY; |
164 | if (match[matchlen-1] == '/' || name[matchlen] == '/') | |
165 | return MATCHED_RECURSIVELY; | |
166 | return 0; | |
3c6a370b LT |
167 | } |
168 | ||
e813d50e JH |
169 | /* |
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. | |
176 | */ | |
0b50922a CB |
177 | int match_pathspec(const char **pathspec, const char *name, int namelen, |
178 | int prefix, char *seen) | |
3c6a370b | 179 | { |
0b50922a CB |
180 | int i, retval = 0; |
181 | ||
182 | if (!pathspec) | |
183 | return 1; | |
3c6a370b LT |
184 | |
185 | name += prefix; | |
186 | namelen -= prefix; | |
187 | ||
0b50922a | 188 | for (i = 0; pathspec[i] != NULL; i++) { |
e813d50e | 189 | int how; |
0b50922a CB |
190 | const char *match = pathspec[i] + prefix; |
191 | if (seen && seen[i] == MATCHED_EXACTLY) | |
3c6a370b | 192 | continue; |
e813d50e JH |
193 | how = match_one(match, name, namelen); |
194 | if (how) { | |
195 | if (retval < how) | |
196 | retval = how; | |
0b50922a CB |
197 | if (seen && seen[i] < how) |
198 | seen[i] = how; | |
3c6a370b LT |
199 | } |
200 | } | |
201 | return retval; | |
202 | } | |
203 | ||
61cf2820 NTND |
204 | /* |
205 | * Does 'match' match the given name? | |
206 | * A match is found if | |
207 | * | |
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'. | |
211 | * | |
212 | * and the return value tells which case it was. | |
213 | * | |
214 | * It returns 0 when there is no match. | |
215 | */ | |
216 | static int match_pathspec_item(const struct pathspec_item *item, int prefix, | |
217 | const char *name, int namelen) | |
218 | { | |
219 | /* name/namelen has prefix cut off by caller */ | |
220 | const char *match = item->match + prefix; | |
221 | int matchlen = item->len - prefix; | |
222 | ||
223 | /* If the match was just the prefix, we matched */ | |
224 | if (!*match) | |
225 | return MATCHED_RECURSIVELY; | |
226 | ||
227 | if (matchlen <= namelen && !strncmp(match, name, matchlen)) { | |
228 | if (matchlen == namelen) | |
229 | return MATCHED_EXACTLY; | |
230 | ||
231 | if (match[matchlen-1] == '/' || name[matchlen] == '/') | |
232 | return MATCHED_RECURSIVELY; | |
233 | } | |
234 | ||
33e0f62b | 235 | if (item->use_wildcard && !fnmatch(match, name, 0)) |
61cf2820 NTND |
236 | return MATCHED_FNMATCH; |
237 | ||
238 | return 0; | |
239 | } | |
240 | ||
241 | /* | |
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. | |
248 | */ | |
249 | int match_pathspec_depth(const struct pathspec *ps, | |
250 | const char *name, int namelen, | |
251 | int prefix, char *seen) | |
252 | { | |
253 | int i, retval = 0; | |
254 | ||
255 | if (!ps->nr) { | |
256 | if (!ps->recursive || ps->max_depth == -1) | |
257 | return MATCHED_RECURSIVELY; | |
258 | ||
259 | if (within_depth(name, namelen, 0, ps->max_depth)) | |
260 | return MATCHED_EXACTLY; | |
261 | else | |
262 | return 0; | |
263 | } | |
264 | ||
265 | name += prefix; | |
266 | namelen -= prefix; | |
267 | ||
268 | for (i = ps->nr - 1; i >= 0; i--) { | |
269 | int how; | |
270 | if (seen && seen[i] == MATCHED_EXACTLY) | |
271 | continue; | |
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] == '/') | |
277 | len++; | |
278 | if (within_depth(name+len, namelen-len, 0, ps->max_depth)) | |
279 | how = MATCHED_EXACTLY; | |
280 | else | |
281 | how = 0; | |
282 | } | |
283 | if (how) { | |
284 | if (retval < how) | |
285 | retval = how; | |
286 | if (seen && seen[i] < how) | |
287 | seen[i] = how; | |
288 | } | |
289 | } | |
290 | return retval; | |
291 | } | |
292 | ||
fcd631ed NTND |
293 | /* |
294 | * Return the length of the "simple" part of a path match limiter. | |
295 | */ | |
296 | static int simple_length(const char *match) | |
297 | { | |
298 | int len = -1; | |
299 | ||
300 | for (;;) { | |
301 | unsigned char c = *match++; | |
302 | len++; | |
303 | if (c == '\0' || is_glob_special(c)) | |
304 | return len; | |
305 | } | |
306 | } | |
307 | ||
68492fc7 LK |
308 | static int no_wildcard(const char *string) |
309 | { | |
fcd631ed | 310 | return string[simple_length(string)] == '\0'; |
68492fc7 LK |
311 | } |
312 | ||
82dce998 NTND |
313 | void parse_exclude_pattern(const char **pattern, |
314 | int *patternlen, | |
315 | int *flags, | |
316 | int *nowildcardlen) | |
84460eec NTND |
317 | { |
318 | const char *p = *pattern; | |
319 | size_t i, len; | |
320 | ||
321 | *flags = 0; | |
322 | if (*p == '!') { | |
323 | *flags |= EXC_FLAG_NEGATIVE; | |
324 | p++; | |
325 | } | |
326 | len = strlen(p); | |
327 | if (len && p[len - 1] == '/') { | |
328 | len--; | |
329 | *flags |= EXC_FLAG_MUSTBEDIR; | |
330 | } | |
331 | for (i = 0; i < len; i++) { | |
332 | if (p[i] == '/') | |
333 | break; | |
334 | } | |
335 | if (i == len) | |
336 | *flags |= EXC_FLAG_NODIR; | |
337 | *nowildcardlen = simple_length(p); | |
338 | /* | |
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 | |
342 | */ | |
343 | if (*nowildcardlen > len) | |
344 | *nowildcardlen = len; | |
345 | if (*p == '*' && no_wildcard(p + 1)) | |
346 | *flags |= EXC_FLAG_ENDSWITH; | |
347 | *pattern = p; | |
348 | *patternlen = len; | |
349 | } | |
350 | ||
453ec4bd | 351 | void add_exclude(const char *string, const char *base, |
840fc334 | 352 | int baselen, struct exclude_list *el) |
453ec4bd | 353 | { |
d6b8fc30 | 354 | struct exclude *x; |
84460eec NTND |
355 | int patternlen; |
356 | int flags; | |
357 | int nowildcardlen; | |
453ec4bd | 358 | |
84460eec NTND |
359 | parse_exclude_pattern(&string, &patternlen, &flags, &nowildcardlen); |
360 | if (flags & EXC_FLAG_MUSTBEDIR) { | |
d6b8fc30 | 361 | char *s; |
84460eec | 362 | x = xmalloc(sizeof(*x) + patternlen + 1); |
4b25d091 | 363 | s = (char *)(x+1); |
84460eec NTND |
364 | memcpy(s, string, patternlen); |
365 | s[patternlen] = '\0'; | |
d6b8fc30 | 366 | x->pattern = s; |
d6b8fc30 JH |
367 | } else { |
368 | x = xmalloc(sizeof(*x)); | |
369 | x->pattern = string; | |
370 | } | |
84460eec NTND |
371 | x->patternlen = patternlen; |
372 | x->nowildcardlen = nowildcardlen; | |
453ec4bd LT |
373 | x->base = base; |
374 | x->baselen = baselen; | |
d6b8fc30 | 375 | x->flags = flags; |
840fc334 AS |
376 | ALLOC_GROW(el->excludes, el->nr + 1, el->alloc); |
377 | el->excludes[el->nr++] = x; | |
453ec4bd LT |
378 | } |
379 | ||
c28b3d6e NTND |
380 | static void *read_skip_worktree_file_from_index(const char *path, size_t *size) |
381 | { | |
382 | int pos, len; | |
383 | unsigned long sz; | |
384 | enum object_type type; | |
385 | void *data; | |
386 | struct index_state *istate = &the_index; | |
387 | ||
388 | len = strlen(path); | |
389 | pos = index_name_pos(istate, path, len); | |
390 | if (pos < 0) | |
391 | return NULL; | |
392 | if (!ce_skip_worktree(istate->cache[pos])) | |
393 | return NULL; | |
394 | data = read_sha1_file(istate->cache[pos]->sha1, &type, &sz); | |
395 | if (!data || type != OBJ_BLOB) { | |
396 | free(data); | |
397 | return NULL; | |
398 | } | |
399 | *size = xsize_t(sz); | |
400 | return data; | |
401 | } | |
402 | ||
0fd0e241 NTND |
403 | void free_excludes(struct exclude_list *el) |
404 | { | |
405 | int i; | |
406 | ||
407 | for (i = 0; i < el->nr; i++) | |
408 | free(el->excludes[i]); | |
409 | free(el->excludes); | |
410 | ||
411 | el->nr = 0; | |
412 | el->excludes = NULL; | |
413 | } | |
414 | ||
cb097534 NTND |
415 | int add_excludes_from_file_to_list(const char *fname, |
416 | const char *base, | |
417 | int baselen, | |
418 | char **buf_p, | |
840fc334 | 419 | struct exclude_list *el, |
cb097534 | 420 | int check_index) |
453ec4bd | 421 | { |
c470701a | 422 | struct stat st; |
453ec4bd | 423 | int fd, i; |
9d14017a | 424 | size_t size = 0; |
453ec4bd LT |
425 | char *buf, *entry; |
426 | ||
427 | fd = open(fname, O_RDONLY); | |
c28b3d6e NTND |
428 | if (fd < 0 || fstat(fd, &st) < 0) { |
429 | if (0 <= fd) | |
430 | close(fd); | |
431 | if (!check_index || | |
432 | (buf = read_skip_worktree_file_from_index(fname, &size)) == NULL) | |
433 | return -1; | |
45d76f17 NTND |
434 | if (size == 0) { |
435 | free(buf); | |
436 | return 0; | |
437 | } | |
438 | if (buf[size-1] != '\n') { | |
439 | buf = xrealloc(buf, size+1); | |
440 | buf[size++] = '\n'; | |
441 | } | |
453ec4bd | 442 | } |
c28b3d6e NTND |
443 | else { |
444 | size = xsize_t(st.st_size); | |
445 | if (size == 0) { | |
446 | close(fd); | |
447 | return 0; | |
448 | } | |
45d76f17 | 449 | buf = xmalloc(size+1); |
c28b3d6e | 450 | if (read_in_full(fd, buf, size) != size) { |
45d76f17 | 451 | free(buf); |
c28b3d6e NTND |
452 | close(fd); |
453 | return -1; | |
454 | } | |
45d76f17 | 455 | buf[size++] = '\n'; |
c28b3d6e | 456 | close(fd); |
6ba78238 | 457 | } |
453ec4bd | 458 | |
63d285c8 JH |
459 | if (buf_p) |
460 | *buf_p = buf; | |
453ec4bd | 461 | entry = buf; |
45d76f17 NTND |
462 | for (i = 0; i < size; i++) { |
463 | if (buf[i] == '\n') { | |
453ec4bd LT |
464 | if (entry != buf + i && entry[0] != '#') { |
465 | buf[i - (i && buf[i-1] == '\r')] = 0; | |
840fc334 | 466 | add_exclude(entry, base, baselen, el); |
453ec4bd LT |
467 | } |
468 | entry = buf + i + 1; | |
469 | } | |
470 | } | |
471 | return 0; | |
453ec4bd LT |
472 | } |
473 | ||
474 | void add_excludes_from_file(struct dir_struct *dir, const char *fname) | |
475 | { | |
cb097534 NTND |
476 | if (add_excludes_from_file_to_list(fname, "", 0, NULL, |
477 | &dir->exclude_list[EXC_FILE], 0) < 0) | |
453ec4bd LT |
478 | die("cannot use %s as an exclude file", fname); |
479 | } | |
480 | ||
95a68344 AS |
481 | /* |
482 | * Loads the per-directory exclude list for the substring of base | |
483 | * which has a char length of baselen. | |
484 | */ | |
63d285c8 | 485 | static void prep_exclude(struct dir_struct *dir, const char *base, int baselen) |
453ec4bd | 486 | { |
63d285c8 JH |
487 | struct exclude_list *el; |
488 | struct exclude_stack *stk = NULL; | |
489 | int current; | |
490 | ||
491 | if ((!dir->exclude_per_dir) || | |
492 | (baselen + strlen(dir->exclude_per_dir) >= PATH_MAX)) | |
493 | return; /* too long a path -- ignore */ | |
494 | ||
95a68344 | 495 | /* Pop the directories that are not the prefix of the path being checked. */ |
63d285c8 JH |
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)) | |
500 | break; | |
501 | dir->exclude_stack = stk->prev; | |
502 | while (stk->exclude_ix < el->nr) | |
503 | free(el->excludes[--el->nr]); | |
504 | free(stk->filebuf); | |
505 | free(stk); | |
453ec4bd | 506 | } |
453ec4bd | 507 | |
63d285c8 JH |
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)); | |
512 | const char *cp; | |
453ec4bd | 513 | |
63d285c8 JH |
514 | if (current < 0) { |
515 | cp = base; | |
516 | current = 0; | |
517 | } | |
518 | else { | |
519 | cp = strchr(base + current + 1, '/'); | |
520 | if (!cp) | |
521 | die("oops in prep_exclude"); | |
522 | cp++; | |
523 | } | |
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); | |
cb097534 NTND |
530 | add_excludes_from_file_to_list(dir->basebuf, |
531 | dir->basebuf, stk->baselen, | |
532 | &stk->filebuf, el, 1); | |
63d285c8 JH |
533 | dir->exclude_stack = stk; |
534 | current = stk->baselen; | |
535 | } | |
536 | dir->basebuf[baselen] = '\0'; | |
453ec4bd LT |
537 | } |
538 | ||
82dce998 NTND |
539 | int match_basename(const char *basename, int basenamelen, |
540 | const char *pattern, int prefix, int patternlen, | |
541 | int flags) | |
593cb880 NTND |
542 | { |
543 | if (prefix == patternlen) { | |
544 | if (!strcmp_icase(pattern, basename)) | |
545 | return 1; | |
546 | } else if (flags & EXC_FLAG_ENDSWITH) { | |
547 | if (patternlen - 1 <= basenamelen && | |
548 | !strcmp_icase(pattern + 1, | |
549 | basename + basenamelen - patternlen + 1)) | |
550 | return 1; | |
551 | } else { | |
552 | if (fnmatch_icase(pattern, basename, 0) == 0) | |
553 | return 1; | |
554 | } | |
555 | return 0; | |
556 | } | |
557 | ||
82dce998 NTND |
558 | int match_pathname(const char *pathname, int pathlen, |
559 | const char *base, int baselen, | |
560 | const char *pattern, int prefix, int patternlen, | |
561 | int flags) | |
b5592632 NTND |
562 | { |
563 | const char *name; | |
564 | int namelen; | |
565 | ||
566 | /* | |
567 | * match with FNM_PATHNAME; the pattern has base implicitly | |
568 | * in front of it. | |
569 | */ | |
570 | if (*pattern == '/') { | |
571 | pattern++; | |
572 | prefix--; | |
573 | } | |
574 | ||
575 | /* | |
576 | * baselen does not count the trailing slash. base[] may or | |
577 | * may not end with a trailing slash though. | |
578 | */ | |
579 | if (pathlen < baselen + 1 || | |
580 | (baselen && pathname[baselen] != '/') || | |
581 | strncmp_icase(pathname, base, baselen)) | |
582 | return 0; | |
583 | ||
584 | namelen = baselen ? pathlen - baselen - 1 : pathlen; | |
585 | name = pathname + pathlen - namelen; | |
586 | ||
587 | if (prefix) { | |
588 | /* | |
589 | * if the non-wildcard part is longer than the | |
590 | * remaining pathname, surely it cannot match. | |
591 | */ | |
592 | if (prefix > namelen) | |
593 | return 0; | |
594 | ||
595 | if (strncmp_icase(pattern, name, prefix)) | |
596 | return 0; | |
597 | pattern += prefix; | |
598 | name += prefix; | |
599 | namelen -= prefix; | |
600 | } | |
601 | ||
602 | return fnmatch_icase(pattern, name, FNM_PATHNAME) == 0; | |
603 | } | |
604 | ||
2c5b0115 | 605 | /* Scan the list and let the last match determine the fate. |
453ec4bd LT |
606 | * Return 1 for exclude, 0 for include and -1 for undecided. |
607 | */ | |
07958050 AS |
608 | int is_excluded_from_list(const char *pathname, |
609 | int pathlen, const char *basename, int *dtype, | |
610 | struct exclude_list *el) | |
453ec4bd LT |
611 | { |
612 | int i; | |
613 | ||
35a94d44 NTND |
614 | if (!el->nr) |
615 | return -1; /* undefined */ | |
d6b8fc30 | 616 | |
35a94d44 NTND |
617 | for (i = el->nr - 1; 0 <= i; i--) { |
618 | struct exclude *x = el->excludes[i]; | |
b5592632 | 619 | const char *exclude = x->pattern; |
84460eec | 620 | int to_exclude = x->flags & EXC_FLAG_NEGATIVE ? 0 : 1; |
b5592632 | 621 | int prefix = x->nowildcardlen; |
35a94d44 NTND |
622 | |
623 | if (x->flags & EXC_FLAG_MUSTBEDIR) { | |
624 | if (*dtype == DT_UNKNOWN) | |
625 | *dtype = get_dtype(NULL, pathname, pathlen); | |
626 | if (*dtype != DT_DIR) | |
627 | continue; | |
628 | } | |
d6b8fc30 | 629 | |
35a94d44 | 630 | if (x->flags & EXC_FLAG_NODIR) { |
593cb880 NTND |
631 | if (match_basename(basename, |
632 | pathlen - (basename - pathname), | |
633 | exclude, prefix, x->patternlen, | |
634 | x->flags)) | |
635 | return to_exclude; | |
35a94d44 NTND |
636 | continue; |
637 | } | |
638 | ||
b5592632 NTND |
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)) | |
f9f6e2ce | 643 | return to_exclude; |
453ec4bd LT |
644 | } |
645 | return -1; /* undecided */ | |
646 | } | |
647 | ||
6d24e7a8 | 648 | static int is_excluded(struct dir_struct *dir, const char *pathname, int *dtype_p) |
453ec4bd LT |
649 | { |
650 | int pathlen = strlen(pathname); | |
651 | int st; | |
68492fc7 LK |
652 | const char *basename = strrchr(pathname, '/'); |
653 | basename = (basename) ? basename+1 : pathname; | |
453ec4bd | 654 | |
63d285c8 | 655 | prep_exclude(dir, pathname, basename-pathname); |
453ec4bd | 656 | for (st = EXC_CMDL; st <= EXC_FILE; st++) { |
07958050 AS |
657 | switch (is_excluded_from_list(pathname, pathlen, |
658 | basename, dtype_p, | |
659 | &dir->exclude_list[st])) { | |
453ec4bd LT |
660 | case 0: |
661 | return 0; | |
662 | case 1: | |
663 | return 1; | |
664 | } | |
665 | } | |
666 | return 0; | |
667 | } | |
668 | ||
eb41775e JH |
669 | void path_exclude_check_init(struct path_exclude_check *check, |
670 | struct dir_struct *dir) | |
671 | { | |
672 | check->dir = dir; | |
673 | strbuf_init(&check->path, 256); | |
674 | } | |
675 | ||
676 | void path_exclude_check_clear(struct path_exclude_check *check) | |
677 | { | |
678 | strbuf_release(&check->path); | |
679 | } | |
680 | ||
93921b07 | 681 | /* |
782cd4c0 | 682 | * Is this name excluded? This is for a caller like show_files() that |
93921b07 JH |
683 | * do not honor directory hierarchy and iterate through paths that are |
684 | * possibly in an ignored directory. | |
685 | * | |
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. | |
688 | */ | |
9013089c AS |
689 | int is_path_excluded(struct path_exclude_check *check, |
690 | const char *name, int namelen, int *dtype) | |
eb41775e | 691 | { |
782cd4c0 | 692 | int i; |
eb41775e JH |
693 | struct strbuf *path = &check->path; |
694 | ||
782cd4c0 JH |
695 | /* |
696 | * we allow the caller to pass namelen as an optimization; it | |
697 | * must match the length of the name, as we eventually call | |
6d24e7a8 | 698 | * is_excluded() on the whole name string. |
782cd4c0 JH |
699 | */ |
700 | if (namelen < 0) | |
701 | namelen = strlen(name); | |
702 | ||
93921b07 | 703 | if (path->len && |
782cd4c0 JH |
704 | path->len <= namelen && |
705 | !memcmp(name, path->buf, path->len) && | |
706 | (!name[path->len] || name[path->len] == '/')) | |
93921b07 JH |
707 | return 1; |
708 | ||
eb41775e | 709 | strbuf_setlen(path, 0); |
782cd4c0 JH |
710 | for (i = 0; name[i]; i++) { |
711 | int ch = name[i]; | |
eb41775e JH |
712 | |
713 | if (ch == '/') { | |
782cd4c0 | 714 | int dt = DT_DIR; |
6d24e7a8 | 715 | if (is_excluded(check->dir, path->buf, &dt)) |
eb41775e JH |
716 | return 1; |
717 | } | |
718 | strbuf_addch(path, ch); | |
719 | } | |
93921b07 JH |
720 | |
721 | /* An entry in the index; cannot be a directory with subentries */ | |
722 | strbuf_setlen(path, 0); | |
723 | ||
6d24e7a8 | 724 | return is_excluded(check->dir, name, dtype); |
eb41775e JH |
725 | } |
726 | ||
f3fa1838 JH |
727 | static struct dir_entry *dir_entry_new(const char *pathname, int len) |
728 | { | |
453ec4bd LT |
729 | struct dir_entry *ent; |
730 | ||
453ec4bd LT |
731 | ent = xmalloc(sizeof(*ent) + len + 1); |
732 | ent->len = len; | |
733 | memcpy(ent->name, pathname, len); | |
734 | ent->name[len] = 0; | |
4d06f8ac | 735 | return ent; |
453ec4bd LT |
736 | } |
737 | ||
159b3212 | 738 | static struct dir_entry *dir_add_name(struct dir_struct *dir, const char *pathname, int len) |
6815e569 | 739 | { |
0a9b88b7 | 740 | if (cache_name_exists(pathname, len, ignore_case)) |
6815e569 JK |
741 | return NULL; |
742 | ||
25fd2f7a | 743 | ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc); |
6815e569 JK |
744 | return dir->entries[dir->nr++] = dir_entry_new(pathname, len); |
745 | } | |
746 | ||
108da0db | 747 | struct dir_entry *dir_add_ignored(struct dir_struct *dir, const char *pathname, int len) |
2abd31b0 | 748 | { |
6e4f981f | 749 | if (!cache_name_is_other(pathname, len)) |
2abd31b0 JK |
750 | return NULL; |
751 | ||
25fd2f7a | 752 | ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc); |
2abd31b0 JK |
753 | return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len); |
754 | } | |
755 | ||
09595258 LT |
756 | enum exist_status { |
757 | index_nonexistent = 0, | |
758 | index_directory, | |
4b05548f | 759 | index_gitdir |
09595258 LT |
760 | }; |
761 | ||
5102c617 JJ |
762 | /* |
763 | * Do not use the alphabetically stored index to look up | |
764 | * the directory name; instead, use the case insensitive | |
765 | * name hash. | |
766 | */ | |
767 | static enum exist_status directory_exists_in_index_icase(const char *dirname, int len) | |
768 | { | |
769 | struct cache_entry *ce = index_name_exists(&the_index, dirname, len + 1, ignore_case); | |
770 | unsigned char endchar; | |
771 | ||
772 | if (!ce) | |
773 | return index_nonexistent; | |
774 | endchar = ce->name[len]; | |
775 | ||
776 | /* | |
777 | * The cache_entry structure returned will contain this dirname | |
778 | * and possibly additional path components. | |
779 | */ | |
780 | if (endchar == '/') | |
781 | return index_directory; | |
782 | ||
783 | /* | |
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. | |
787 | */ | |
788 | if (!endchar && S_ISGITLINK(ce->ce_mode)) | |
789 | return index_gitdir; | |
790 | ||
791 | /* This should never be hit, but it exists just in case. */ | |
792 | return index_nonexistent; | |
793 | } | |
794 | ||
09595258 LT |
795 | /* |
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 | |
800 | * end. | |
801 | */ | |
802 | static enum exist_status directory_exists_in_index(const char *dirname, int len) | |
453ec4bd | 803 | { |
5102c617 JJ |
804 | int pos; |
805 | ||
806 | if (ignore_case) | |
807 | return directory_exists_in_index_icase(dirname, len); | |
808 | ||
809 | pos = cache_name_pos(dirname, len); | |
09595258 LT |
810 | if (pos < 0) |
811 | pos = -pos-1; | |
812 | while (pos < active_nr) { | |
813 | struct cache_entry *ce = active_cache[pos++]; | |
814 | unsigned char endchar; | |
815 | ||
816 | if (strncmp(ce->name, dirname, len)) | |
817 | break; | |
818 | endchar = ce->name[len]; | |
819 | if (endchar > '/') | |
820 | break; | |
821 | if (endchar == '/') | |
822 | return index_directory; | |
7a51ed66 | 823 | if (!endchar && S_ISGITLINK(ce->ce_mode)) |
09595258 LT |
824 | return index_gitdir; |
825 | } | |
826 | return index_nonexistent; | |
827 | } | |
828 | ||
829 | /* | |
830 | * When we find a directory when traversing the filesystem, we | |
831 | * have three distinct cases: | |
832 | * | |
833 | * - ignore it | |
834 | * - see it as a directory | |
835 | * - recurse into it | |
836 | * | |
837 | * and which one we choose depends on a combination of existing | |
838 | * git index contents and the flags passed into the directory | |
839 | * traversal routine. | |
840 | * | |
841 | * Case 1: If we *already* have entries in the index under that | |
842 | * directory name, we always recurse into the directory to see | |
843 | * all the files. | |
844 | * | |
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!) | |
849 | * | |
850 | * Case 3: if we didn't have it in the index previously, we | |
851 | * have a few sub-cases: | |
852 | * | |
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 | |
302b9282 | 858 | * 'no_gitlinks' set we treat it as a gitlink, and show it |
09595258 LT |
859 | * as a directory. |
860 | * (c) otherwise, we recurse into it. | |
861 | */ | |
862 | enum directory_treatment { | |
863 | show_directory, | |
864 | ignore_directory, | |
4b05548f | 865 | recurse_into_directory |
09595258 LT |
866 | }; |
867 | ||
868 | static enum directory_treatment treat_directory(struct dir_struct *dir, | |
869 | const char *dirname, int len, | |
870 | const struct path_simplify *simplify) | |
871 | { | |
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; | |
876 | ||
877 | case index_gitdir: | |
7c4c97c0 | 878 | if (dir->flags & DIR_SHOW_OTHER_DIRECTORIES) |
ab22aed3 | 879 | return ignore_directory; |
09595258 LT |
880 | return show_directory; |
881 | ||
882 | case index_nonexistent: | |
7c4c97c0 | 883 | if (dir->flags & DIR_SHOW_OTHER_DIRECTORIES) |
09595258 | 884 | break; |
7c4c97c0 | 885 | if (!(dir->flags & DIR_NO_GITLINKS)) { |
09595258 LT |
886 | unsigned char sha1[20]; |
887 | if (resolve_gitlink_ref(dirname, "HEAD", sha1) == 0) | |
888 | return show_directory; | |
889 | } | |
890 | return recurse_into_directory; | |
891 | } | |
892 | ||
893 | /* This is the "show_other_directories" case */ | |
7c4c97c0 | 894 | if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES)) |
09595258 | 895 | return show_directory; |
dba2e203 | 896 | if (!read_directory_recursive(dir, dirname, len, 1, simplify)) |
09595258 LT |
897 | return ignore_directory; |
898 | return show_directory; | |
453ec4bd LT |
899 | } |
900 | ||
9fc42d60 LT |
901 | /* |
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. | |
905 | */ | |
906 | static int simplify_away(const char *path, int pathlen, const struct path_simplify *simplify) | |
907 | { | |
908 | if (simplify) { | |
909 | for (;;) { | |
910 | const char *match = simplify->path; | |
911 | int len = simplify->len; | |
912 | ||
913 | if (!match) | |
914 | break; | |
915 | if (len > pathlen) | |
916 | len = pathlen; | |
917 | if (!memcmp(path, match, len)) | |
918 | return 0; | |
919 | simplify++; | |
920 | } | |
921 | return 1; | |
922 | } | |
923 | return 0; | |
924 | } | |
925 | ||
29209cbe JK |
926 | /* |
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: | |
931 | * | |
932 | * 1. the path is mentioned explicitly in the pathspec | |
933 | * | |
934 | * 2. the path is a directory prefix of some element in the | |
935 | * pathspec | |
936 | */ | |
937 | static int exclude_matches_pathspec(const char *path, int len, | |
938 | const struct path_simplify *simplify) | |
e96980ef JK |
939 | { |
940 | if (simplify) { | |
941 | for (; simplify->path; simplify++) { | |
942 | if (len == simplify->len | |
943 | && !memcmp(path, simplify->path, len)) | |
944 | return 1; | |
29209cbe JK |
945 | if (len < simplify->len |
946 | && simplify->path[len] == '/' | |
947 | && !memcmp(path, simplify->path, len)) | |
948 | return 1; | |
e96980ef JK |
949 | } |
950 | } | |
951 | return 0; | |
952 | } | |
953 | ||
443e061a LT |
954 | static int get_index_dtype(const char *path, int len) |
955 | { | |
956 | int pos; | |
957 | struct cache_entry *ce; | |
958 | ||
959 | ce = cache_name_exists(path, len, 0); | |
960 | if (ce) { | |
961 | if (!ce_uptodate(ce)) | |
962 | return DT_UNKNOWN; | |
963 | if (S_ISGITLINK(ce->ce_mode)) | |
964 | return DT_DIR; | |
965 | /* | |
966 | * Nobody actually cares about the | |
967 | * difference between DT_LNK and DT_REG | |
968 | */ | |
969 | return DT_REG; | |
970 | } | |
971 | ||
972 | /* Try to look it up as a directory */ | |
973 | pos = cache_name_pos(path, len); | |
974 | if (pos >= 0) | |
975 | return DT_UNKNOWN; | |
976 | pos = -pos-1; | |
977 | while (pos < active_nr) { | |
978 | ce = active_cache[pos++]; | |
979 | if (strncmp(ce->name, path, len)) | |
980 | break; | |
981 | if (ce->name[len] > '/') | |
982 | break; | |
983 | if (ce->name[len] < '/') | |
984 | continue; | |
985 | if (!ce_uptodate(ce)) | |
986 | break; /* continue? */ | |
987 | return DT_DIR; | |
988 | } | |
989 | return DT_UNKNOWN; | |
990 | } | |
991 | ||
caa6b782 | 992 | static int get_dtype(struct dirent *de, const char *path, int len) |
07134421 | 993 | { |
6831a88a | 994 | int dtype = de ? DTYPE(de) : DT_UNKNOWN; |
07134421 LT |
995 | struct stat st; |
996 | ||
997 | if (dtype != DT_UNKNOWN) | |
998 | return dtype; | |
443e061a LT |
999 | dtype = get_index_dtype(path, len); |
1000 | if (dtype != DT_UNKNOWN) | |
1001 | return dtype; | |
1002 | if (lstat(path, &st)) | |
07134421 LT |
1003 | return dtype; |
1004 | if (S_ISREG(st.st_mode)) | |
1005 | return DT_REG; | |
1006 | if (S_ISDIR(st.st_mode)) | |
1007 | return DT_DIR; | |
1008 | if (S_ISLNK(st.st_mode)) | |
1009 | return DT_LNK; | |
1010 | return dtype; | |
1011 | } | |
1012 | ||
53cc5356 JH |
1013 | enum path_treatment { |
1014 | path_ignored, | |
1015 | path_handled, | |
4b05548f | 1016 | path_recurse |
53cc5356 JH |
1017 | }; |
1018 | ||
16e2cfa9 | 1019 | static enum path_treatment treat_one_path(struct dir_struct *dir, |
49dc2cc2 | 1020 | struct strbuf *path, |
16e2cfa9 JH |
1021 | const struct path_simplify *simplify, |
1022 | int dtype, struct dirent *de) | |
53cc5356 | 1023 | { |
6d24e7a8 | 1024 | int exclude = is_excluded(dir, path->buf, &dtype); |
53cc5356 | 1025 | if (exclude && (dir->flags & DIR_COLLECT_IGNORED) |
49dc2cc2 RS |
1026 | && exclude_matches_pathspec(path->buf, path->len, simplify)) |
1027 | dir_add_ignored(dir, path->buf, path->len); | |
53cc5356 JH |
1028 | |
1029 | /* | |
1030 | * Excluded? If we don't explicitly want to show | |
1031 | * ignored files, ignore it | |
1032 | */ | |
1033 | if (exclude && !(dir->flags & DIR_SHOW_IGNORED)) | |
1034 | return path_ignored; | |
1035 | ||
1036 | if (dtype == DT_UNKNOWN) | |
49dc2cc2 | 1037 | dtype = get_dtype(de, path->buf, path->len); |
53cc5356 JH |
1038 | |
1039 | /* | |
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.. | |
1044 | */ | |
1045 | if (!exclude && (dir->flags & DIR_SHOW_IGNORED)) { | |
1046 | if (dtype != DT_DIR) | |
1047 | return path_ignored; | |
1048 | } | |
1049 | ||
1050 | switch (dtype) { | |
1051 | default: | |
1052 | return path_ignored; | |
1053 | case DT_DIR: | |
49dc2cc2 RS |
1054 | strbuf_addch(path, '/'); |
1055 | switch (treat_directory(dir, path->buf, path->len, simplify)) { | |
53cc5356 JH |
1056 | case show_directory: |
1057 | if (exclude != !!(dir->flags | |
1058 | & DIR_SHOW_IGNORED)) | |
1059 | return path_ignored; | |
1060 | break; | |
1061 | case recurse_into_directory: | |
1062 | return path_recurse; | |
1063 | case ignore_directory: | |
1064 | return path_ignored; | |
1065 | } | |
1066 | break; | |
1067 | case DT_REG: | |
1068 | case DT_LNK: | |
1069 | break; | |
1070 | } | |
1071 | return path_handled; | |
1072 | } | |
1073 | ||
16e2cfa9 JH |
1074 | static enum path_treatment treat_path(struct dir_struct *dir, |
1075 | struct dirent *de, | |
49dc2cc2 | 1076 | struct strbuf *path, |
16e2cfa9 | 1077 | int baselen, |
49dc2cc2 | 1078 | const struct path_simplify *simplify) |
16e2cfa9 JH |
1079 | { |
1080 | int dtype; | |
1081 | ||
1082 | if (is_dot_or_dotdot(de->d_name) || !strcmp(de->d_name, ".git")) | |
1083 | return path_ignored; | |
49dc2cc2 RS |
1084 | strbuf_setlen(path, baselen); |
1085 | strbuf_addstr(path, de->d_name); | |
1086 | if (simplify_away(path->buf, path->len, simplify)) | |
16e2cfa9 JH |
1087 | return path_ignored; |
1088 | ||
1089 | dtype = DTYPE(de); | |
49dc2cc2 | 1090 | return treat_one_path(dir, path, simplify, dtype, de); |
16e2cfa9 JH |
1091 | } |
1092 | ||
453ec4bd LT |
1093 | /* |
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 | |
1097 | * day. | |
1098 | * | |
1099 | * Also, we ignore the name ".git" (even if it is not a directory). | |
1100 | * That likely will not change. | |
1101 | */ | |
53cc5356 JH |
1102 | static int read_directory_recursive(struct dir_struct *dir, |
1103 | const char *base, int baselen, | |
1104 | int check_only, | |
1105 | const struct path_simplify *simplify) | |
453ec4bd | 1106 | { |
1528d247 | 1107 | DIR *fdir; |
453ec4bd | 1108 | int contents = 0; |
02cb6753 | 1109 | struct dirent *de; |
bef36921 | 1110 | struct strbuf path = STRBUF_INIT; |
453ec4bd | 1111 | |
bef36921 | 1112 | strbuf_add(&path, base, baselen); |
02cb6753 | 1113 | |
1528d247 RS |
1114 | fdir = opendir(path.len ? path.buf : "."); |
1115 | if (!fdir) | |
1116 | goto out; | |
1117 | ||
02cb6753 | 1118 | while ((de = readdir(fdir)) != NULL) { |
bef36921 | 1119 | switch (treat_path(dir, de, &path, baselen, simplify)) { |
02cb6753 | 1120 | case path_recurse: |
bef36921 JH |
1121 | contents += read_directory_recursive(dir, path.buf, |
1122 | path.len, 0, | |
1123 | simplify); | |
02cb6753 NTND |
1124 | continue; |
1125 | case path_ignored: | |
1126 | continue; | |
1127 | case path_handled: | |
1128 | break; | |
453ec4bd | 1129 | } |
02cb6753 NTND |
1130 | contents++; |
1131 | if (check_only) | |
1528d247 RS |
1132 | break; |
1133 | dir_add_name(dir, path.buf, path.len); | |
453ec4bd | 1134 | } |
02cb6753 | 1135 | closedir(fdir); |
1528d247 | 1136 | out: |
bef36921 | 1137 | strbuf_release(&path); |
453ec4bd LT |
1138 | |
1139 | return contents; | |
1140 | } | |
1141 | ||
1142 | static int cmp_name(const void *p1, const void *p2) | |
1143 | { | |
1144 | const struct dir_entry *e1 = *(const struct dir_entry **)p1; | |
1145 | const struct dir_entry *e2 = *(const struct dir_entry **)p2; | |
1146 | ||
1147 | return cache_name_compare(e1->name, e1->len, | |
1148 | e2->name, e2->len); | |
1149 | } | |
1150 | ||
9fc42d60 LT |
1151 | static struct path_simplify *create_simplify(const char **pathspec) |
1152 | { | |
1153 | int nr, alloc = 0; | |
1154 | struct path_simplify *simplify = NULL; | |
1155 | ||
1156 | if (!pathspec) | |
1157 | return NULL; | |
1158 | ||
1159 | for (nr = 0 ; ; nr++) { | |
1160 | const char *match; | |
1161 | if (nr >= alloc) { | |
1162 | alloc = alloc_nr(alloc); | |
1163 | simplify = xrealloc(simplify, alloc * sizeof(*simplify)); | |
1164 | } | |
1165 | match = *pathspec++; | |
1166 | if (!match) | |
1167 | break; | |
1168 | simplify[nr].path = match; | |
1169 | simplify[nr].len = simple_length(match); | |
1170 | } | |
1171 | simplify[nr].path = NULL; | |
1172 | simplify[nr].len = 0; | |
1173 | return simplify; | |
1174 | } | |
1175 | ||
1176 | static void free_simplify(struct path_simplify *simplify) | |
1177 | { | |
8e0f7003 | 1178 | free(simplify); |
9fc42d60 LT |
1179 | } |
1180 | ||
48ffef96 JH |
1181 | static int treat_leading_path(struct dir_struct *dir, |
1182 | const char *path, int len, | |
1183 | const struct path_simplify *simplify) | |
1184 | { | |
49dc2cc2 RS |
1185 | struct strbuf sb = STRBUF_INIT; |
1186 | int baselen, rc = 0; | |
48ffef96 JH |
1187 | const char *cp; |
1188 | ||
1189 | while (len && path[len - 1] == '/') | |
1190 | len--; | |
1191 | if (!len) | |
1192 | return 1; | |
1193 | baselen = 0; | |
1194 | while (1) { | |
1195 | cp = path + baselen + !!baselen; | |
1196 | cp = memchr(cp, '/', path + len - cp); | |
1197 | if (!cp) | |
1198 | baselen = len; | |
1199 | else | |
1200 | baselen = cp - path; | |
49dc2cc2 RS |
1201 | strbuf_setlen(&sb, 0); |
1202 | strbuf_add(&sb, path, baselen); | |
1203 | if (!is_directory(sb.buf)) | |
1204 | break; | |
1205 | if (simplify_away(sb.buf, sb.len, simplify)) | |
1206 | break; | |
1207 | if (treat_one_path(dir, &sb, simplify, | |
48ffef96 | 1208 | DT_DIR, NULL) == path_ignored) |
49dc2cc2 RS |
1209 | break; /* do not recurse into it */ |
1210 | if (len <= baselen) { | |
1211 | rc = 1; | |
1212 | break; /* finished checking */ | |
1213 | } | |
48ffef96 | 1214 | } |
49dc2cc2 RS |
1215 | strbuf_release(&sb); |
1216 | return rc; | |
48ffef96 JH |
1217 | } |
1218 | ||
dba2e203 | 1219 | int read_directory(struct dir_struct *dir, const char *path, int len, const char **pathspec) |
9fc42d60 | 1220 | { |
725b0605 | 1221 | struct path_simplify *simplify; |
b4189aa8 | 1222 | |
dba2e203 | 1223 | if (has_symlink_leading_path(path, len)) |
725b0605 JH |
1224 | return dir->nr; |
1225 | ||
1226 | simplify = create_simplify(pathspec); | |
48ffef96 JH |
1227 | if (!len || treat_leading_path(dir, path, len, simplify)) |
1228 | read_directory_recursive(dir, path, len, 0, simplify); | |
9fc42d60 | 1229 | free_simplify(simplify); |
453ec4bd | 1230 | qsort(dir->entries, dir->nr, sizeof(struct dir_entry *), cmp_name); |
2abd31b0 | 1231 | qsort(dir->ignored, dir->ignored_nr, sizeof(struct dir_entry *), cmp_name); |
453ec4bd LT |
1232 | return dir->nr; |
1233 | } | |
c91f0d92 | 1234 | |
686a4a06 | 1235 | int file_exists(const char *f) |
c91f0d92 | 1236 | { |
686a4a06 | 1237 | struct stat sb; |
a50f9fc5 | 1238 | return lstat(f, &sb) == 0; |
c91f0d92 | 1239 | } |
e6636747 JS |
1240 | |
1241 | /* | |
9b125da4 NTND |
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. | |
e6636747 | 1245 | */ |
9b125da4 | 1246 | int dir_inside_of(const char *subdir, const char *dir) |
e6636747 | 1247 | { |
9b125da4 | 1248 | int offset = 0; |
e6636747 | 1249 | |
9b125da4 | 1250 | assert(dir && subdir && *dir && *subdir); |
e6636747 | 1251 | |
9b125da4 | 1252 | while (*dir && *subdir && *dir == *subdir) { |
e6636747 | 1253 | dir++; |
9b125da4 NTND |
1254 | subdir++; |
1255 | offset++; | |
490544b1 | 1256 | } |
9b125da4 NTND |
1257 | |
1258 | /* hel[p]/me vs hel[l]/yeah */ | |
1259 | if (*dir && *subdir) | |
1260 | return -1; | |
1261 | ||
1262 | if (!*subdir) | |
1263 | return !*dir ? offset : -1; /* same dir */ | |
1264 | ||
1265 | /* foo/[b]ar vs foo/[] */ | |
1266 | if (is_dir_sep(dir[-1])) | |
1267 | return is_dir_sep(subdir[-1]) ? offset : -1; | |
1268 | ||
1269 | /* foo[/]bar vs foo[] */ | |
1270 | return is_dir_sep(*subdir) ? offset + 1 : -1; | |
e6636747 JS |
1271 | } |
1272 | ||
1273 | int is_inside_dir(const char *dir) | |
1274 | { | |
b892913d NTND |
1275 | char cwd[PATH_MAX]; |
1276 | if (!dir) | |
1277 | return 0; | |
1278 | if (!getcwd(cwd, sizeof(cwd))) | |
1279 | die_errno("can't find the current directory"); | |
1280 | return dir_inside_of(cwd, dir) >= 0; | |
e6636747 | 1281 | } |
7155b727 | 1282 | |
55892d23 AP |
1283 | int is_empty_dir(const char *path) |
1284 | { | |
1285 | DIR *dir = opendir(path); | |
1286 | struct dirent *e; | |
1287 | int ret = 1; | |
1288 | ||
1289 | if (!dir) | |
1290 | return 0; | |
1291 | ||
1292 | while ((e = readdir(dir)) != NULL) | |
1293 | if (!is_dot_or_dotdot(e->d_name)) { | |
1294 | ret = 0; | |
1295 | break; | |
1296 | } | |
1297 | ||
1298 | closedir(dir); | |
1299 | return ret; | |
1300 | } | |
1301 | ||
ae2f203e | 1302 | static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up) |
7155b727 | 1303 | { |
a0f4afbe | 1304 | DIR *dir; |
7155b727 | 1305 | struct dirent *e; |
ae2f203e | 1306 | int ret = 0, original_len = path->len, len, kept_down = 0; |
a0f4afbe | 1307 | int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY); |
c844a803 | 1308 | int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL); |
a0f4afbe | 1309 | unsigned char submodule_head[20]; |
7155b727 | 1310 | |
a0f4afbe | 1311 | if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) && |
ae2f203e | 1312 | !resolve_gitlink_ref(path->buf, "HEAD", submodule_head)) { |
a0f4afbe | 1313 | /* Do not descend and nuke a nested git work tree. */ |
ae2f203e JH |
1314 | if (kept_up) |
1315 | *kept_up = 1; | |
a0f4afbe | 1316 | return 0; |
ae2f203e | 1317 | } |
a0f4afbe | 1318 | |
ae2f203e | 1319 | flag &= ~REMOVE_DIR_KEEP_TOPLEVEL; |
a0f4afbe | 1320 | dir = opendir(path->buf); |
c844a803 | 1321 | if (!dir) { |
ae2f203e | 1322 | /* an empty dir could be removed even if it is unreadble */ |
c844a803 JH |
1323 | if (!keep_toplevel) |
1324 | return rmdir(path->buf); | |
1325 | else | |
1326 | return -1; | |
1327 | } | |
7155b727 JS |
1328 | if (path->buf[original_len - 1] != '/') |
1329 | strbuf_addch(path, '/'); | |
1330 | ||
1331 | len = path->len; | |
1332 | while ((e = readdir(dir)) != NULL) { | |
1333 | struct stat st; | |
8ca12c0d AP |
1334 | if (is_dot_or_dotdot(e->d_name)) |
1335 | continue; | |
7155b727 JS |
1336 | |
1337 | strbuf_setlen(path, len); | |
1338 | strbuf_addstr(path, e->d_name); | |
1339 | if (lstat(path->buf, &st)) | |
1340 | ; /* fall thru */ | |
1341 | else if (S_ISDIR(st.st_mode)) { | |
ae2f203e | 1342 | if (!remove_dir_recurse(path, flag, &kept_down)) |
7155b727 JS |
1343 | continue; /* happy */ |
1344 | } else if (!only_empty && !unlink(path->buf)) | |
1345 | continue; /* happy, too */ | |
1346 | ||
1347 | /* path too long, stat fails, or non-directory still exists */ | |
1348 | ret = -1; | |
1349 | break; | |
1350 | } | |
1351 | closedir(dir); | |
1352 | ||
1353 | strbuf_setlen(path, original_len); | |
ae2f203e | 1354 | if (!ret && !keep_toplevel && !kept_down) |
7155b727 | 1355 | ret = rmdir(path->buf); |
ae2f203e JH |
1356 | else if (kept_up) |
1357 | /* | |
1358 | * report the uplevel that it is not an error that we | |
1359 | * did not rmdir() our directory. | |
1360 | */ | |
1361 | *kept_up = !ret; | |
7155b727 JS |
1362 | return ret; |
1363 | } | |
039bc64e | 1364 | |
ae2f203e JH |
1365 | int remove_dir_recursively(struct strbuf *path, int flag) |
1366 | { | |
1367 | return remove_dir_recurse(path, flag, NULL); | |
1368 | } | |
1369 | ||
039bc64e JH |
1370 | void setup_standard_excludes(struct dir_struct *dir) |
1371 | { | |
1372 | const char *path; | |
1373 | ||
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); | |
1380 | } | |
4a92d1bf AR |
1381 | |
1382 | int remove_path(const char *name) | |
1383 | { | |
1384 | char *slash; | |
1385 | ||
1386 | if (unlink(name) && errno != ENOENT) | |
1387 | return -1; | |
1388 | ||
1389 | slash = strrchr(name, '/'); | |
1390 | if (slash) { | |
1391 | char *dirs = xstrdup(name); | |
1392 | slash = dirs + (slash - name); | |
1393 | do { | |
1394 | *slash = '\0'; | |
3fc0d131 | 1395 | } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/'))); |
4a92d1bf AR |
1396 | free(dirs); |
1397 | } | |
1398 | return 0; | |
1399 | } | |
1400 | ||
86e4ca69 NTND |
1401 | static int pathspec_item_cmp(const void *a_, const void *b_) |
1402 | { | |
1403 | struct pathspec_item *a, *b; | |
1404 | ||
1405 | a = (struct pathspec_item *)a_; | |
1406 | b = (struct pathspec_item *)b_; | |
1407 | return strcmp(a->match, b->match); | |
1408 | } | |
1409 | ||
0602f3e9 NTND |
1410 | int init_pathspec(struct pathspec *pathspec, const char **paths) |
1411 | { | |
1412 | const char **p = paths; | |
1413 | int i; | |
1414 | ||
1415 | memset(pathspec, 0, sizeof(*pathspec)); | |
1416 | if (!p) | |
1417 | return 0; | |
1418 | while (*p) | |
1419 | p++; | |
1420 | pathspec->raw = paths; | |
1421 | pathspec->nr = p - paths; | |
1422 | if (!pathspec->nr) | |
1423 | return 0; | |
1424 | ||
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]; | |
1429 | ||
1430 | item->match = path; | |
1431 | item->len = strlen(path); | |
33e0f62b JH |
1432 | item->use_wildcard = !no_wildcard(path); |
1433 | if (item->use_wildcard) | |
d38f2809 | 1434 | pathspec->has_wildcard = 1; |
0602f3e9 | 1435 | } |
86e4ca69 NTND |
1436 | |
1437 | qsort(pathspec->items, pathspec->nr, | |
1438 | sizeof(struct pathspec_item), pathspec_item_cmp); | |
1439 | ||
0602f3e9 NTND |
1440 | return 0; |
1441 | } | |
1442 | ||
1443 | void free_pathspec(struct pathspec *pathspec) | |
1444 | { | |
1445 | free(pathspec->items); | |
1446 | pathspec->items = NULL; | |
1447 | } |