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