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