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