GIT 1.6.4
[git/git.git] / dir.c
CommitLineData
453ec4bd
LT
1/*
2 * This handles recursive filename detection with exclude
3 * files, index knowledge etc..
4 *
5 * Copyright (C) Linus Torvalds, 2005-2006
6 * Junio Hamano, 2005-2006
7 */
453ec4bd
LT
8#include "cache.h"
9#include "dir.h"
09595258 10#include "refs.h"
453ec4bd 11
9fc42d60
LT
12struct path_simplify {
13 int len;
14 const char *path;
15};
16
dba2e203 17static int read_directory_recursive(struct dir_struct *dir, const char *path, int len,
09595258 18 int check_only, const struct path_simplify *simplify);
caa6b782 19static int get_dtype(struct dirent *de, const char *path, int len);
09595258 20
1d8842d9 21static int common_prefix(const char **pathspec)
3c6a370b
LT
22{
23 const char *path, *slash, *next;
24 int prefix;
25
26 if (!pathspec)
27 return 0;
28
29 path = *pathspec;
30 slash = strrchr(path, '/');
31 if (!slash)
32 return 0;
33
34 prefix = slash - path + 1;
35 while ((next = *++pathspec) != NULL) {
36 int len = strlen(next);
c7f34c18 37 if (len >= prefix && !memcmp(path, next, prefix))
3c6a370b 38 continue;
c7f34c18 39 len = prefix - 1;
3c6a370b
LT
40 for (;;) {
41 if (!len)
42 return 0;
43 if (next[--len] != '/')
44 continue;
45 if (memcmp(path, next, len+1))
46 continue;
47 prefix = len + 1;
48 break;
49 }
50 }
51 return prefix;
52}
53
1d8842d9
LT
54int fill_directory(struct dir_struct *dir, const char **pathspec)
55{
dba2e203
LT
56 const char *path;
57 int len;
1d8842d9
LT
58
59 /*
60 * Calculate common prefix for the pathspec, and
61 * use that to optimize the directory walk
62 */
dba2e203 63 len = common_prefix(pathspec);
1d8842d9 64 path = "";
1d8842d9 65
dba2e203
LT
66 if (len)
67 path = xmemdupz(*pathspec, len);
1d8842d9
LT
68
69 /* Read the directory and prune it */
dba2e203
LT
70 read_directory(dir, path, len, pathspec);
71 return len;
1d8842d9
LT
72}
73
e813d50e 74/*
2c5b0115 75 * Does 'match' match the given name?
e813d50e
JH
76 * A match is found if
77 *
78 * (1) the 'match' string is leading directory of 'name', or
79 * (2) the 'match' string is a wildcard and matches 'name', or
80 * (3) the 'match' string is exactly the same as 'name'.
81 *
82 * and the return value tells which case it was.
83 *
84 * It returns 0 when there is no match.
85 */
3c6a370b
LT
86static int match_one(const char *match, const char *name, int namelen)
87{
88 int matchlen;
89
90 /* If the match was just the prefix, we matched */
88ea8112 91 if (!*match)
e813d50e 92 return MATCHED_RECURSIVELY;
3c6a370b 93
88ea8112
LT
94 for (;;) {
95 unsigned char c1 = *match;
96 unsigned char c2 = *name;
8cc32992 97 if (c1 == '\0' || is_glob_special(c1))
88ea8112
LT
98 break;
99 if (c1 != c2)
100 return 0;
101 match++;
102 name++;
103 namelen--;
104 }
105
106
3c6a370b
LT
107 /*
108 * If we don't match the matchstring exactly,
109 * we need to match by fnmatch
110 */
88ea8112 111 matchlen = strlen(match);
3c6a370b 112 if (strncmp(match, name, matchlen))
e813d50e 113 return !fnmatch(match, name, 0) ? MATCHED_FNMATCH : 0;
3c6a370b 114
f2d0df71 115 if (namelen == matchlen)
e813d50e
JH
116 return MATCHED_EXACTLY;
117 if (match[matchlen-1] == '/' || name[matchlen] == '/')
118 return MATCHED_RECURSIVELY;
119 return 0;
3c6a370b
LT
120}
121
e813d50e
JH
122/*
123 * Given a name and a list of pathspecs, see if the name matches
124 * any of the pathspecs. The caller is also interested in seeing
125 * all pathspec matches some names it calls this function with
126 * (otherwise the user could have mistyped the unmatched pathspec),
127 * and a mark is left in seen[] array for pathspec element that
128 * actually matched anything.
129 */
0b50922a
CB
130int match_pathspec(const char **pathspec, const char *name, int namelen,
131 int prefix, char *seen)
3c6a370b 132{
0b50922a
CB
133 int i, retval = 0;
134
135 if (!pathspec)
136 return 1;
3c6a370b
LT
137
138 name += prefix;
139 namelen -= prefix;
140
0b50922a 141 for (i = 0; pathspec[i] != NULL; i++) {
e813d50e 142 int how;
0b50922a
CB
143 const char *match = pathspec[i] + prefix;
144 if (seen && seen[i] == MATCHED_EXACTLY)
3c6a370b 145 continue;
e813d50e
JH
146 how = match_one(match, name, namelen);
147 if (how) {
148 if (retval < how)
149 retval = how;
0b50922a
CB
150 if (seen && seen[i] < how)
151 seen[i] = how;
3c6a370b
LT
152 }
153 }
154 return retval;
155}
156
68492fc7
LK
157static int no_wildcard(const char *string)
158{
dd482eea 159 return string[strcspn(string, "*?[{\\")] == '\0';
68492fc7
LK
160}
161
453ec4bd
LT
162void add_exclude(const char *string, const char *base,
163 int baselen, struct exclude_list *which)
164{
d6b8fc30
JH
165 struct exclude *x;
166 size_t len;
167 int to_exclude = 1;
168 int flags = 0;
453ec4bd 169
68492fc7 170 if (*string == '!') {
d6b8fc30 171 to_exclude = 0;
68492fc7
LK
172 string++;
173 }
d6b8fc30
JH
174 len = strlen(string);
175 if (len && string[len - 1] == '/') {
176 char *s;
177 x = xmalloc(sizeof(*x) + len);
4b25d091 178 s = (char *)(x+1);
d6b8fc30
JH
179 memcpy(s, string, len - 1);
180 s[len - 1] = '\0';
181 string = s;
182 x->pattern = s;
183 flags = EXC_FLAG_MUSTBEDIR;
184 } else {
185 x = xmalloc(sizeof(*x));
186 x->pattern = string;
187 }
188 x->to_exclude = to_exclude;
68492fc7 189 x->patternlen = strlen(string);
453ec4bd
LT
190 x->base = base;
191 x->baselen = baselen;
d6b8fc30 192 x->flags = flags;
68492fc7
LK
193 if (!strchr(string, '/'))
194 x->flags |= EXC_FLAG_NODIR;
195 if (no_wildcard(string))
196 x->flags |= EXC_FLAG_NOWILDCARD;
197 if (*string == '*' && no_wildcard(string+1))
198 x->flags |= EXC_FLAG_ENDSWITH;
686a4a06 199 ALLOC_GROW(which->excludes, which->nr + 1, which->alloc);
453ec4bd
LT
200 which->excludes[which->nr++] = x;
201}
202
203static int add_excludes_from_file_1(const char *fname,
204 const char *base,
205 int baselen,
63d285c8 206 char **buf_p,
453ec4bd
LT
207 struct exclude_list *which)
208{
c470701a 209 struct stat st;
453ec4bd 210 int fd, i;
dc49cd76 211 size_t size;
453ec4bd
LT
212 char *buf, *entry;
213
214 fd = open(fname, O_RDONLY);
c470701a 215 if (fd < 0 || fstat(fd, &st) < 0)
453ec4bd 216 goto err;
dc49cd76 217 size = xsize_t(st.st_size);
453ec4bd
LT
218 if (size == 0) {
219 close(fd);
220 return 0;
221 }
222 buf = xmalloc(size+1);
93d26e4c 223 if (read_in_full(fd, buf, size) != size)
6ba78238
LH
224 {
225 free(buf);
453ec4bd 226 goto err;
6ba78238 227 }
453ec4bd
LT
228 close(fd);
229
63d285c8
JH
230 if (buf_p)
231 *buf_p = buf;
453ec4bd
LT
232 buf[size++] = '\n';
233 entry = buf;
234 for (i = 0; i < size; i++) {
235 if (buf[i] == '\n') {
236 if (entry != buf + i && entry[0] != '#') {
237 buf[i - (i && buf[i-1] == '\r')] = 0;
238 add_exclude(entry, base, baselen, which);
239 }
240 entry = buf + i + 1;
241 }
242 }
243 return 0;
244
245 err:
246 if (0 <= fd)
247 close(fd);
248 return -1;
249}
250
251void add_excludes_from_file(struct dir_struct *dir, const char *fname)
252{
63d285c8 253 if (add_excludes_from_file_1(fname, "", 0, NULL,
453ec4bd
LT
254 &dir->exclude_list[EXC_FILE]) < 0)
255 die("cannot use %s as an exclude file", fname);
256}
257
63d285c8 258static void prep_exclude(struct dir_struct *dir, const char *base, int baselen)
453ec4bd 259{
63d285c8
JH
260 struct exclude_list *el;
261 struct exclude_stack *stk = NULL;
262 int current;
263
264 if ((!dir->exclude_per_dir) ||
265 (baselen + strlen(dir->exclude_per_dir) >= PATH_MAX))
266 return; /* too long a path -- ignore */
267
268 /* Pop the ones that are not the prefix of the path being checked. */
269 el = &dir->exclude_list[EXC_DIRS];
270 while ((stk = dir->exclude_stack) != NULL) {
271 if (stk->baselen <= baselen &&
272 !strncmp(dir->basebuf, base, stk->baselen))
273 break;
274 dir->exclude_stack = stk->prev;
275 while (stk->exclude_ix < el->nr)
276 free(el->excludes[--el->nr]);
277 free(stk->filebuf);
278 free(stk);
453ec4bd 279 }
453ec4bd 280
63d285c8
JH
281 /* Read from the parent directories and push them down. */
282 current = stk ? stk->baselen : -1;
283 while (current < baselen) {
284 struct exclude_stack *stk = xcalloc(1, sizeof(*stk));
285 const char *cp;
453ec4bd 286
63d285c8
JH
287 if (current < 0) {
288 cp = base;
289 current = 0;
290 }
291 else {
292 cp = strchr(base + current + 1, '/');
293 if (!cp)
294 die("oops in prep_exclude");
295 cp++;
296 }
297 stk->prev = dir->exclude_stack;
298 stk->baselen = cp - base;
299 stk->exclude_ix = el->nr;
300 memcpy(dir->basebuf + current, base + current,
301 stk->baselen - current);
302 strcpy(dir->basebuf + stk->baselen, dir->exclude_per_dir);
303 add_excludes_from_file_1(dir->basebuf,
304 dir->basebuf, stk->baselen,
305 &stk->filebuf, el);
306 dir->exclude_stack = stk;
307 current = stk->baselen;
308 }
309 dir->basebuf[baselen] = '\0';
453ec4bd
LT
310}
311
2c5b0115 312/* Scan the list and let the last match determine the fate.
453ec4bd
LT
313 * Return 1 for exclude, 0 for include and -1 for undecided.
314 */
315static int excluded_1(const char *pathname,
6831a88a 316 int pathlen, const char *basename, int *dtype,
453ec4bd
LT
317 struct exclude_list *el)
318{
319 int i;
320
321 if (el->nr) {
322 for (i = el->nr - 1; 0 <= i; i--) {
323 struct exclude *x = el->excludes[i];
324 const char *exclude = x->pattern;
68492fc7 325 int to_exclude = x->to_exclude;
453ec4bd 326
6831a88a
JH
327 if (x->flags & EXC_FLAG_MUSTBEDIR) {
328 if (*dtype == DT_UNKNOWN)
caa6b782 329 *dtype = get_dtype(NULL, pathname, pathlen);
6831a88a
JH
330 if (*dtype != DT_DIR)
331 continue;
332 }
d6b8fc30 333
68492fc7 334 if (x->flags & EXC_FLAG_NODIR) {
453ec4bd 335 /* match basename */
68492fc7
LK
336 if (x->flags & EXC_FLAG_NOWILDCARD) {
337 if (!strcmp(exclude, basename))
338 return to_exclude;
339 } else if (x->flags & EXC_FLAG_ENDSWITH) {
340 if (x->patternlen - 1 <= pathlen &&
341 !strcmp(exclude + 1, pathname + pathlen - x->patternlen + 1))
342 return to_exclude;
343 } else {
344 if (fnmatch(exclude, basename, 0) == 0)
345 return to_exclude;
346 }
453ec4bd
LT
347 }
348 else {
349 /* match with FNM_PATHNAME:
350 * exclude has base (baselen long) implicitly
351 * in front of it.
352 */
353 int baselen = x->baselen;
354 if (*exclude == '/')
355 exclude++;
356
357 if (pathlen < baselen ||
358 (baselen && pathname[baselen-1] != '/') ||
359 strncmp(pathname, x->base, baselen))
360 continue;
361
68492fc7
LK
362 if (x->flags & EXC_FLAG_NOWILDCARD) {
363 if (!strcmp(exclude, pathname + baselen))
364 return to_exclude;
365 } else {
366 if (fnmatch(exclude, pathname+baselen,
367 FNM_PATHNAME) == 0)
368 return to_exclude;
369 }
453ec4bd
LT
370 }
371 }
372 }
373 return -1; /* undecided */
374}
375
6831a88a 376int excluded(struct dir_struct *dir, const char *pathname, int *dtype_p)
453ec4bd
LT
377{
378 int pathlen = strlen(pathname);
379 int st;
68492fc7
LK
380 const char *basename = strrchr(pathname, '/');
381 basename = (basename) ? basename+1 : pathname;
453ec4bd 382
63d285c8 383 prep_exclude(dir, pathname, basename-pathname);
453ec4bd 384 for (st = EXC_CMDL; st <= EXC_FILE; st++) {
d6b8fc30 385 switch (excluded_1(pathname, pathlen, basename,
6831a88a 386 dtype_p, &dir->exclude_list[st])) {
453ec4bd
LT
387 case 0:
388 return 0;
389 case 1:
390 return 1;
391 }
392 }
393 return 0;
394}
395
f3fa1838
JH
396static struct dir_entry *dir_entry_new(const char *pathname, int len)
397{
453ec4bd
LT
398 struct dir_entry *ent;
399
453ec4bd
LT
400 ent = xmalloc(sizeof(*ent) + len + 1);
401 ent->len = len;
402 memcpy(ent->name, pathname, len);
403 ent->name[len] = 0;
4d06f8ac 404 return ent;
453ec4bd
LT
405}
406
159b3212 407static struct dir_entry *dir_add_name(struct dir_struct *dir, const char *pathname, int len)
6815e569 408{
0a9b88b7 409 if (cache_name_exists(pathname, len, ignore_case))
6815e569
JK
410 return NULL;
411
25fd2f7a 412 ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc);
6815e569
JK
413 return dir->entries[dir->nr++] = dir_entry_new(pathname, len);
414}
415
159b3212 416static struct dir_entry *dir_add_ignored(struct dir_struct *dir, const char *pathname, int len)
2abd31b0 417{
6e4f981f 418 if (!cache_name_is_other(pathname, len))
2abd31b0
JK
419 return NULL;
420
25fd2f7a 421 ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc);
2abd31b0
JK
422 return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);
423}
424
09595258
LT
425enum exist_status {
426 index_nonexistent = 0,
427 index_directory,
428 index_gitdir,
429};
430
431/*
432 * The index sorts alphabetically by entry name, which
433 * means that a gitlink sorts as '\0' at the end, while
434 * a directory (which is defined not as an entry, but as
435 * the files it contains) will sort with the '/' at the
436 * end.
437 */
438static enum exist_status directory_exists_in_index(const char *dirname, int len)
453ec4bd
LT
439{
440 int pos = cache_name_pos(dirname, len);
09595258
LT
441 if (pos < 0)
442 pos = -pos-1;
443 while (pos < active_nr) {
444 struct cache_entry *ce = active_cache[pos++];
445 unsigned char endchar;
446
447 if (strncmp(ce->name, dirname, len))
448 break;
449 endchar = ce->name[len];
450 if (endchar > '/')
451 break;
452 if (endchar == '/')
453 return index_directory;
7a51ed66 454 if (!endchar && S_ISGITLINK(ce->ce_mode))
09595258
LT
455 return index_gitdir;
456 }
457 return index_nonexistent;
458}
459
460/*
461 * When we find a directory when traversing the filesystem, we
462 * have three distinct cases:
463 *
464 * - ignore it
465 * - see it as a directory
466 * - recurse into it
467 *
468 * and which one we choose depends on a combination of existing
469 * git index contents and the flags passed into the directory
470 * traversal routine.
471 *
472 * Case 1: If we *already* have entries in the index under that
473 * directory name, we always recurse into the directory to see
474 * all the files.
475 *
476 * Case 2: If we *already* have that directory name as a gitlink,
477 * we always continue to see it as a gitlink, regardless of whether
478 * there is an actual git directory there or not (it might not
479 * be checked out as a subproject!)
480 *
481 * Case 3: if we didn't have it in the index previously, we
482 * have a few sub-cases:
483 *
484 * (a) if "show_other_directories" is true, we show it as
485 * just a directory, unless "hide_empty_directories" is
486 * also true and the directory is empty, in which case
487 * we just ignore it entirely.
488 * (b) if it looks like a git directory, and we don't have
302b9282 489 * 'no_gitlinks' set we treat it as a gitlink, and show it
09595258
LT
490 * as a directory.
491 * (c) otherwise, we recurse into it.
492 */
493enum directory_treatment {
494 show_directory,
495 ignore_directory,
496 recurse_into_directory,
497};
498
499static enum directory_treatment treat_directory(struct dir_struct *dir,
500 const char *dirname, int len,
501 const struct path_simplify *simplify)
502{
503 /* The "len-1" is to strip the final '/' */
504 switch (directory_exists_in_index(dirname, len-1)) {
505 case index_directory:
506 return recurse_into_directory;
507
508 case index_gitdir:
7c4c97c0 509 if (dir->flags & DIR_SHOW_OTHER_DIRECTORIES)
ab22aed3 510 return ignore_directory;
09595258
LT
511 return show_directory;
512
513 case index_nonexistent:
7c4c97c0 514 if (dir->flags & DIR_SHOW_OTHER_DIRECTORIES)
09595258 515 break;
7c4c97c0 516 if (!(dir->flags & DIR_NO_GITLINKS)) {
09595258
LT
517 unsigned char sha1[20];
518 if (resolve_gitlink_ref(dirname, "HEAD", sha1) == 0)
519 return show_directory;
520 }
521 return recurse_into_directory;
522 }
523
524 /* This is the "show_other_directories" case */
7c4c97c0 525 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))
09595258 526 return show_directory;
dba2e203 527 if (!read_directory_recursive(dir, dirname, len, 1, simplify))
09595258
LT
528 return ignore_directory;
529 return show_directory;
453ec4bd
LT
530}
531
9fc42d60
LT
532/*
533 * This is an inexact early pruning of any recursive directory
534 * reading - if the path cannot possibly be in the pathspec,
535 * return true, and we'll skip it early.
536 */
537static int simplify_away(const char *path, int pathlen, const struct path_simplify *simplify)
538{
539 if (simplify) {
540 for (;;) {
541 const char *match = simplify->path;
542 int len = simplify->len;
543
544 if (!match)
545 break;
546 if (len > pathlen)
547 len = pathlen;
548 if (!memcmp(path, match, len))
549 return 0;
550 simplify++;
551 }
552 return 1;
553 }
554 return 0;
555}
556
e96980ef
JK
557static int in_pathspec(const char *path, int len, const struct path_simplify *simplify)
558{
559 if (simplify) {
560 for (; simplify->path; simplify++) {
561 if (len == simplify->len
562 && !memcmp(path, simplify->path, len))
563 return 1;
564 }
565 }
566 return 0;
567}
568
443e061a
LT
569static int get_index_dtype(const char *path, int len)
570{
571 int pos;
572 struct cache_entry *ce;
573
574 ce = cache_name_exists(path, len, 0);
575 if (ce) {
576 if (!ce_uptodate(ce))
577 return DT_UNKNOWN;
578 if (S_ISGITLINK(ce->ce_mode))
579 return DT_DIR;
580 /*
581 * Nobody actually cares about the
582 * difference between DT_LNK and DT_REG
583 */
584 return DT_REG;
585 }
586
587 /* Try to look it up as a directory */
588 pos = cache_name_pos(path, len);
589 if (pos >= 0)
590 return DT_UNKNOWN;
591 pos = -pos-1;
592 while (pos < active_nr) {
593 ce = active_cache[pos++];
594 if (strncmp(ce->name, path, len))
595 break;
596 if (ce->name[len] > '/')
597 break;
598 if (ce->name[len] < '/')
599 continue;
600 if (!ce_uptodate(ce))
601 break; /* continue? */
602 return DT_DIR;
603 }
604 return DT_UNKNOWN;
605}
606
caa6b782 607static int get_dtype(struct dirent *de, const char *path, int len)
07134421 608{
6831a88a 609 int dtype = de ? DTYPE(de) : DT_UNKNOWN;
07134421
LT
610 struct stat st;
611
612 if (dtype != DT_UNKNOWN)
613 return dtype;
443e061a
LT
614 dtype = get_index_dtype(path, len);
615 if (dtype != DT_UNKNOWN)
616 return dtype;
617 if (lstat(path, &st))
07134421
LT
618 return dtype;
619 if (S_ISREG(st.st_mode))
620 return DT_REG;
621 if (S_ISDIR(st.st_mode))
622 return DT_DIR;
623 if (S_ISLNK(st.st_mode))
624 return DT_LNK;
625 return dtype;
626}
627
453ec4bd
LT
628/*
629 * Read a directory tree. We currently ignore anything but
630 * directories, regular files and symlinks. That's because git
631 * doesn't handle them at all yet. Maybe that will change some
632 * day.
633 *
634 * Also, we ignore the name ".git" (even if it is not a directory).
635 * That likely will not change.
636 */
dba2e203 637static int read_directory_recursive(struct dir_struct *dir, const char *base, int baselen, int check_only, const struct path_simplify *simplify)
453ec4bd 638{
dba2e203 639 DIR *fdir = opendir(*base ? base : ".");
453ec4bd
LT
640 int contents = 0;
641
642 if (fdir) {
453ec4bd 643 struct dirent *de;
dba2e203
LT
644 char path[PATH_MAX + 1];
645 memcpy(path, base, baselen);
453ec4bd 646
453ec4bd 647 while ((de = readdir(fdir)) != NULL) {
07134421 648 int len, dtype;
b9916256 649 int exclude;
453ec4bd 650
8ca12c0d
AP
651 if (is_dot_or_dotdot(de->d_name) ||
652 !strcmp(de->d_name, ".git"))
453ec4bd
LT
653 continue;
654 len = strlen(de->d_name);
5d5cea67 655 /* Ignore overly long pathnames! */
dba2e203 656 if (len + baselen + 8 > sizeof(path))
5d5cea67 657 continue;
dba2e203
LT
658 memcpy(path + baselen, de->d_name, len+1);
659 len = baselen + len;
660 if (simplify_away(path, len, simplify))
9fc42d60 661 continue;
b9916256 662
6831a88a 663 dtype = DTYPE(de);
dba2e203 664 exclude = excluded(dir, path, &dtype);
7c4c97c0 665 if (exclude && (dir->flags & DIR_COLLECT_IGNORED)
dba2e203
LT
666 && in_pathspec(path, len, simplify))
667 dir_add_ignored(dir, path,len);
07134421
LT
668
669 /*
670 * Excluded? If we don't explicitly want to show
671 * ignored files, ignore it
672 */
7c4c97c0 673 if (exclude && !(dir->flags & DIR_SHOW_IGNORED))
07134421
LT
674 continue;
675
6831a88a 676 if (dtype == DT_UNKNOWN)
caa6b782 677 dtype = get_dtype(de, path, len);
07134421
LT
678
679 /*
680 * Do we want to see just the ignored files?
681 * We still need to recurse into directories,
682 * even if we don't ignore them, since the
683 * directory may contain files that we do..
684 */
7c4c97c0 685 if (!exclude && (dir->flags & DIR_SHOW_IGNORED)) {
07134421 686 if (dtype != DT_DIR)
c889763b 687 continue;
c889763b 688 }
453ec4bd 689
07134421 690 switch (dtype) {
453ec4bd
LT
691 default:
692 continue;
453ec4bd 693 case DT_DIR:
dba2e203 694 memcpy(path + len, "/", 2);
453ec4bd 695 len++;
dba2e203 696 switch (treat_directory(dir, path, len, simplify)) {
09595258 697 case show_directory:
7c4c97c0
JS
698 if (exclude != !!(dir->flags
699 & DIR_SHOW_IGNORED))
b9916256 700 continue;
453ec4bd 701 break;
09595258
LT
702 case recurse_into_directory:
703 contents += read_directory_recursive(dir,
dba2e203 704 path, len, 0, simplify);
09595258
LT
705 continue;
706 case ignore_directory:
707 continue;
453ec4bd 708 }
09595258 709 break;
453ec4bd
LT
710 case DT_REG:
711 case DT_LNK:
712 break;
713 }
453ec4bd 714 contents++;
07ccbff8
JS
715 if (check_only)
716 goto exit_early;
717 else
dba2e203 718 dir_add_name(dir, path, len);
453ec4bd 719 }
07ccbff8 720exit_early:
453ec4bd 721 closedir(fdir);
453ec4bd
LT
722 }
723
724 return contents;
725}
726
727static int cmp_name(const void *p1, const void *p2)
728{
729 const struct dir_entry *e1 = *(const struct dir_entry **)p1;
730 const struct dir_entry *e2 = *(const struct dir_entry **)p2;
731
732 return cache_name_compare(e1->name, e1->len,
733 e2->name, e2->len);
734}
735
9fc42d60
LT
736/*
737 * Return the length of the "simple" part of a path match limiter.
738 */
739static int simple_length(const char *match)
453ec4bd 740{
9fc42d60
LT
741 int len = -1;
742
743 for (;;) {
744 unsigned char c = *match++;
745 len++;
8cc32992 746 if (c == '\0' || is_glob_special(c))
9fc42d60
LT
747 return len;
748 }
749}
750
751static struct path_simplify *create_simplify(const char **pathspec)
752{
753 int nr, alloc = 0;
754 struct path_simplify *simplify = NULL;
755
756 if (!pathspec)
757 return NULL;
758
759 for (nr = 0 ; ; nr++) {
760 const char *match;
761 if (nr >= alloc) {
762 alloc = alloc_nr(alloc);
763 simplify = xrealloc(simplify, alloc * sizeof(*simplify));
764 }
765 match = *pathspec++;
766 if (!match)
767 break;
768 simplify[nr].path = match;
769 simplify[nr].len = simple_length(match);
770 }
771 simplify[nr].path = NULL;
772 simplify[nr].len = 0;
773 return simplify;
774}
775
776static void free_simplify(struct path_simplify *simplify)
777{
8e0f7003 778 free(simplify);
9fc42d60
LT
779}
780
dba2e203 781int read_directory(struct dir_struct *dir, const char *path, int len, const char **pathspec)
9fc42d60 782{
725b0605 783 struct path_simplify *simplify;
b4189aa8 784
dba2e203 785 if (has_symlink_leading_path(path, len))
725b0605
JH
786 return dir->nr;
787
788 simplify = create_simplify(pathspec);
dba2e203 789 read_directory_recursive(dir, path, len, 0, simplify);
9fc42d60 790 free_simplify(simplify);
453ec4bd 791 qsort(dir->entries, dir->nr, sizeof(struct dir_entry *), cmp_name);
2abd31b0 792 qsort(dir->ignored, dir->ignored_nr, sizeof(struct dir_entry *), cmp_name);
453ec4bd
LT
793 return dir->nr;
794}
c91f0d92 795
686a4a06 796int file_exists(const char *f)
c91f0d92 797{
686a4a06 798 struct stat sb;
a50f9fc5 799 return lstat(f, &sb) == 0;
c91f0d92 800}
e6636747
JS
801
802/*
803 * get_relative_cwd() gets the prefix of the current working directory
804 * relative to 'dir'. If we are not inside 'dir', it returns NULL.
420acb31
JS
805 *
806 * As a convenience, it also returns NULL if 'dir' is already NULL. The
807 * reason for this behaviour is that it is natural for functions returning
808 * directory names to return NULL to say "this directory does not exist"
809 * or "this directory is invalid". These cases are usually handled the
810 * same as if the cwd is not inside 'dir' at all, so get_relative_cwd()
811 * returns NULL for both of them.
812 *
813 * Most notably, get_relative_cwd(buffer, size, get_git_work_tree())
814 * unifies the handling of "outside work tree" with "no work tree at all".
e6636747
JS
815 */
816char *get_relative_cwd(char *buffer, int size, const char *dir)
817{
818 char *cwd = buffer;
819
e6636747
JS
820 if (!dir)
821 return NULL;
822 if (!getcwd(buffer, size))
d824cbba 823 die_errno("can't find the current directory");
e6636747
JS
824
825 if (!is_absolute_path(dir))
826 dir = make_absolute_path(dir);
827
828 while (*dir && *dir == *cwd) {
829 dir++;
830 cwd++;
831 }
832 if (*dir)
833 return NULL;
834 if (*cwd == '/')
835 return cwd + 1;
836 return cwd;
837}
838
839int is_inside_dir(const char *dir)
840{
841 char buffer[PATH_MAX];
842 return get_relative_cwd(buffer, sizeof(buffer), dir) != NULL;
843}
7155b727 844
55892d23
AP
845int is_empty_dir(const char *path)
846{
847 DIR *dir = opendir(path);
848 struct dirent *e;
849 int ret = 1;
850
851 if (!dir)
852 return 0;
853
854 while ((e = readdir(dir)) != NULL)
855 if (!is_dot_or_dotdot(e->d_name)) {
856 ret = 0;
857 break;
858 }
859
860 closedir(dir);
861 return ret;
862}
863
7155b727
JS
864int remove_dir_recursively(struct strbuf *path, int only_empty)
865{
866 DIR *dir = opendir(path->buf);
867 struct dirent *e;
868 int ret = 0, original_len = path->len, len;
869
870 if (!dir)
871 return -1;
872 if (path->buf[original_len - 1] != '/')
873 strbuf_addch(path, '/');
874
875 len = path->len;
876 while ((e = readdir(dir)) != NULL) {
877 struct stat st;
8ca12c0d
AP
878 if (is_dot_or_dotdot(e->d_name))
879 continue;
7155b727
JS
880
881 strbuf_setlen(path, len);
882 strbuf_addstr(path, e->d_name);
883 if (lstat(path->buf, &st))
884 ; /* fall thru */
885 else if (S_ISDIR(st.st_mode)) {
886 if (!remove_dir_recursively(path, only_empty))
887 continue; /* happy */
888 } else if (!only_empty && !unlink(path->buf))
889 continue; /* happy, too */
890
891 /* path too long, stat fails, or non-directory still exists */
892 ret = -1;
893 break;
894 }
895 closedir(dir);
896
897 strbuf_setlen(path, original_len);
898 if (!ret)
899 ret = rmdir(path->buf);
900 return ret;
901}
039bc64e
JH
902
903void setup_standard_excludes(struct dir_struct *dir)
904{
905 const char *path;
906
907 dir->exclude_per_dir = ".gitignore";
908 path = git_path("info/exclude");
909 if (!access(path, R_OK))
910 add_excludes_from_file(dir, path);
911 if (excludes_file && !access(excludes_file, R_OK))
912 add_excludes_from_file(dir, excludes_file);
913}
4a92d1bf
AR
914
915int remove_path(const char *name)
916{
917 char *slash;
918
919 if (unlink(name) && errno != ENOENT)
920 return -1;
921
922 slash = strrchr(name, '/');
923 if (slash) {
924 char *dirs = xstrdup(name);
925 slash = dirs + (slash - name);
926 do {
927 *slash = '\0';
928 } while (rmdir(dirs) && (slash = strrchr(dirs, '/')));
929 free(dirs);
930 }
931 return 0;
932}
933