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