dir.c 20.1 KB
Newer Older
1 2 3 4 5 6 7 8 9
/*
 * This handles recursive filename detection with exclude
 * files, index knowledge etc..
 *
 * Copyright (C) Linus Torvalds, 2005-2006
 *		 Junio Hamano, 2005-2006
 */
#include "cache.h"
#include "dir.h"
10
#include "refs.h"
11

12 13 14 15 16
struct path_simplify {
	int len;
	const char *path;
};

17 18 19
static int read_directory_recursive(struct dir_struct *dir,
	const char *path, const char *base, int baselen,
	int check_only, const struct path_simplify *simplify);
J
Junio C Hamano 已提交
20
static int get_dtype(struct dirent *de, const char *path);
21

22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37
int common_prefix(const char **pathspec)
{
	const char *path, *slash, *next;
	int prefix;

	if (!pathspec)
		return 0;

	path = *pathspec;
	slash = strrchr(path, '/');
	if (!slash)
		return 0;

	prefix = slash - path + 1;
	while ((next = *++pathspec) != NULL) {
		int len = strlen(next);
38
		if (len >= prefix && !memcmp(path, next, prefix))
39
			continue;
40
		len = prefix - 1;
41 42 43 44 45 46 47 48 49 50 51 52 53 54
		for (;;) {
			if (!len)
				return 0;
			if (next[--len] != '/')
				continue;
			if (memcmp(path, next, len+1))
				continue;
			prefix = len + 1;
			break;
		}
	}
	return prefix;
}

55 56 57 58 59 60 61 62 63 64 65 66
/*
 * Does 'match' matches the given name?
 * A match is found if
 *
 * (1) the 'match' string is leading directory of 'name', or
 * (2) the 'match' string is a wildcard and matches 'name', or
 * (3) the 'match' string is exactly the same as 'name'.
 *
 * and the return value tells which case it was.
 *
 * It returns 0 when there is no match.
 */
67 68 69 70 71
static int match_one(const char *match, const char *name, int namelen)
{
	int matchlen;

	/* If the match was just the prefix, we matched */
72
	if (!*match)
73
		return MATCHED_RECURSIVELY;
74

75 76 77
	for (;;) {
		unsigned char c1 = *match;
		unsigned char c2 = *name;
78
		if (isspecial(c1))
79 80 81 82 83 84 85 86 87
			break;
		if (c1 != c2)
			return 0;
		match++;
		name++;
		namelen--;
	}


88 89 90 91
	/*
	 * If we don't match the matchstring exactly,
	 * we need to match by fnmatch
	 */
92
	matchlen = strlen(match);
93
	if (strncmp(match, name, matchlen))
94
		return !fnmatch(match, name, 0) ? MATCHED_FNMATCH : 0;
95

96
	if (namelen == matchlen)
97 98 99 100
		return MATCHED_EXACTLY;
	if (match[matchlen-1] == '/' || name[matchlen] == '/')
		return MATCHED_RECURSIVELY;
	return 0;
101 102
}

103 104 105 106 107 108 109 110
/*
 * Given a name and a list of pathspecs, see if the name matches
 * any of the pathspecs.  The caller is also interested in seeing
 * all pathspec matches some names it calls this function with
 * (otherwise the user could have mistyped the unmatched pathspec),
 * and a mark is left in seen[] array for pathspec element that
 * actually matched anything.
 */
111 112 113 114 115 116 117 118 119
int match_pathspec(const char **pathspec, const char *name, int namelen, int prefix, char *seen)
{
	int retval;
	const char *match;

	name += prefix;
	namelen -= prefix;

	for (retval = 0; (match = *pathspec++) != NULL; seen++) {
120
		int how;
C
Clemens Buchacher 已提交
121
		if (*seen == MATCHED_EXACTLY)
122 123
			continue;
		match += prefix;
124 125 126 127 128 129
		how = match_one(match, name, namelen);
		if (how) {
			if (retval < how)
				retval = how;
			if (*seen < how)
				*seen = how;
130 131 132 133 134
		}
	}
	return retval;
}

L
Lars Knoll 已提交
135 136 137 138 139
static int no_wildcard(const char *string)
{
	return string[strcspn(string, "*?[{")] == '\0';
}

140 141 142
void add_exclude(const char *string, const char *base,
		 int baselen, struct exclude_list *which)
{
143 144 145 146
	struct exclude *x;
	size_t len;
	int to_exclude = 1;
	int flags = 0;
147

L
Lars Knoll 已提交
148
	if (*string == '!') {
149
		to_exclude = 0;
L
Lars Knoll 已提交
150 151
		string++;
	}
152 153 154 155 156 157 158 159 160 161 162 163 164 165 166
	len = strlen(string);
	if (len && string[len - 1] == '/') {
		char *s;
		x = xmalloc(sizeof(*x) + len);
		s = (char*)(x+1);
		memcpy(s, string, len - 1);
		s[len - 1] = '\0';
		string = s;
		x->pattern = s;
		flags = EXC_FLAG_MUSTBEDIR;
	} else {
		x = xmalloc(sizeof(*x));
		x->pattern = string;
	}
	x->to_exclude = to_exclude;
L
Lars Knoll 已提交
167
	x->patternlen = strlen(string);
168 169
	x->base = base;
	x->baselen = baselen;
170
	x->flags = flags;
L
Lars Knoll 已提交
171 172 173 174 175 176
	if (!strchr(string, '/'))
		x->flags |= EXC_FLAG_NODIR;
	if (no_wildcard(string))
		x->flags |= EXC_FLAG_NOWILDCARD;
	if (*string == '*' && no_wildcard(string+1))
		x->flags |= EXC_FLAG_ENDSWITH;
J
Junio C Hamano 已提交
177
	ALLOC_GROW(which->excludes, which->nr + 1, which->alloc);
178 179 180 181 182 183
	which->excludes[which->nr++] = x;
}

static int add_excludes_from_file_1(const char *fname,
				    const char *base,
				    int baselen,
184
				    char **buf_p,
185 186
				    struct exclude_list *which)
{
J
Jonas Fonseca 已提交
187
	struct stat st;
188
	int fd, i;
189
	size_t size;
190 191 192
	char *buf, *entry;

	fd = open(fname, O_RDONLY);
J
Jonas Fonseca 已提交
193
	if (fd < 0 || fstat(fd, &st) < 0)
194
		goto err;
195
	size = xsize_t(st.st_size);
196 197 198 199 200
	if (size == 0) {
		close(fd);
		return 0;
	}
	buf = xmalloc(size+1);
201
	if (read_in_full(fd, buf, size) != size)
李鸿 已提交
202 203
	{
		free(buf);
204
		goto err;
李鸿 已提交
205
	}
206 207
	close(fd);

208 209
	if (buf_p)
		*buf_p = buf;
210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230
	buf[size++] = '\n';
	entry = buf;
	for (i = 0; i < size; i++) {
		if (buf[i] == '\n') {
			if (entry != buf + i && entry[0] != '#') {
				buf[i - (i && buf[i-1] == '\r')] = 0;
				add_exclude(entry, base, baselen, which);
			}
			entry = buf + i + 1;
		}
	}
	return 0;

 err:
	if (0 <= fd)
		close(fd);
	return -1;
}

void add_excludes_from_file(struct dir_struct *dir, const char *fname)
{
231
	if (add_excludes_from_file_1(fname, "", 0, NULL,
232 233 234 235
				     &dir->exclude_list[EXC_FILE]) < 0)
		die("cannot use %s as an exclude file", fname);
}

236
static void prep_exclude(struct dir_struct *dir, const char *base, int baselen)
237
{
238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256
	struct exclude_list *el;
	struct exclude_stack *stk = NULL;
	int current;

	if ((!dir->exclude_per_dir) ||
	    (baselen + strlen(dir->exclude_per_dir) >= PATH_MAX))
		return; /* too long a path -- ignore */

	/* Pop the ones that are not the prefix of the path being checked. */
	el = &dir->exclude_list[EXC_DIRS];
	while ((stk = dir->exclude_stack) != NULL) {
		if (stk->baselen <= baselen &&
		    !strncmp(dir->basebuf, base, stk->baselen))
			break;
		dir->exclude_stack = stk->prev;
		while (stk->exclude_ix < el->nr)
			free(el->excludes[--el->nr]);
		free(stk->filebuf);
		free(stk);
257 258
	}

259 260 261 262 263
	/* Read from the parent directories and push them down. */
	current = stk ? stk->baselen : -1;
	while (current < baselen) {
		struct exclude_stack *stk = xcalloc(1, sizeof(*stk));
		const char *cp;
264

265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287
		if (current < 0) {
			cp = base;
			current = 0;
		}
		else {
			cp = strchr(base + current + 1, '/');
			if (!cp)
				die("oops in prep_exclude");
			cp++;
		}
		stk->prev = dir->exclude_stack;
		stk->baselen = cp - base;
		stk->exclude_ix = el->nr;
		memcpy(dir->basebuf + current, base + current,
		       stk->baselen - current);
		strcpy(dir->basebuf + stk->baselen, dir->exclude_per_dir);
		add_excludes_from_file_1(dir->basebuf,
					 dir->basebuf, stk->baselen,
					 &stk->filebuf, el);
		dir->exclude_stack = stk;
		current = stk->baselen;
	}
	dir->basebuf[baselen] = '\0';
288 289 290 291 292 293
}

/* Scan the list and let the last match determines the fate.
 * Return 1 for exclude, 0 for include and -1 for undecided.
 */
static int excluded_1(const char *pathname,
J
Junio C Hamano 已提交
294
		      int pathlen, const char *basename, int *dtype,
295 296 297 298 299 300 301 302
		      struct exclude_list *el)
{
	int i;

	if (el->nr) {
		for (i = el->nr - 1; 0 <= i; i--) {
			struct exclude *x = el->excludes[i];
			const char *exclude = x->pattern;
L
Lars Knoll 已提交
303
			int to_exclude = x->to_exclude;
304

J
Junio C Hamano 已提交
305 306 307 308 309 310
			if (x->flags & EXC_FLAG_MUSTBEDIR) {
				if (*dtype == DT_UNKNOWN)
					*dtype = get_dtype(NULL, pathname);
				if (*dtype != DT_DIR)
					continue;
			}
311

L
Lars Knoll 已提交
312
			if (x->flags & EXC_FLAG_NODIR) {
313
				/* match basename */
L
Lars Knoll 已提交
314 315 316 317 318 319 320 321 322 323 324
				if (x->flags & EXC_FLAG_NOWILDCARD) {
					if (!strcmp(exclude, basename))
						return to_exclude;
				} else if (x->flags & EXC_FLAG_ENDSWITH) {
					if (x->patternlen - 1 <= pathlen &&
					    !strcmp(exclude + 1, pathname + pathlen - x->patternlen + 1))
						return to_exclude;
				} else {
					if (fnmatch(exclude, basename, 0) == 0)
						return to_exclude;
				}
325 326 327 328 329 330 331 332 333 334 335 336 337 338 339
			}
			else {
				/* match with FNM_PATHNAME:
				 * exclude has base (baselen long) implicitly
				 * in front of it.
				 */
				int baselen = x->baselen;
				if (*exclude == '/')
					exclude++;

				if (pathlen < baselen ||
				    (baselen && pathname[baselen-1] != '/') ||
				    strncmp(pathname, x->base, baselen))
				    continue;

L
Lars Knoll 已提交
340 341 342 343 344 345 346 347
				if (x->flags & EXC_FLAG_NOWILDCARD) {
					if (!strcmp(exclude, pathname + baselen))
						return to_exclude;
				} else {
					if (fnmatch(exclude, pathname+baselen,
						    FNM_PATHNAME) == 0)
					    return to_exclude;
				}
348 349 350 351 352 353
			}
		}
	}
	return -1; /* undecided */
}

J
Junio C Hamano 已提交
354
int excluded(struct dir_struct *dir, const char *pathname, int *dtype_p)
355 356 357
{
	int pathlen = strlen(pathname);
	int st;
L
Lars Knoll 已提交
358 359
	const char *basename = strrchr(pathname, '/');
	basename = (basename) ? basename+1 : pathname;
360

361
	prep_exclude(dir, pathname, basename-pathname);
362
	for (st = EXC_CMDL; st <= EXC_FILE; st++) {
363
		switch (excluded_1(pathname, pathlen, basename,
J
Junio C Hamano 已提交
364
				   dtype_p, &dir->exclude_list[st])) {
365 366 367 368 369 370 371 372 373
		case 0:
			return 0;
		case 1:
			return 1;
		}
	}
	return 0;
}

374 375
static struct dir_entry *dir_entry_new(const char *pathname, int len)
{
376 377 378 379 380 381
	struct dir_entry *ent;

	ent = xmalloc(sizeof(*ent) + len + 1);
	ent->len = len;
	memcpy(ent->name, pathname, len);
	ent->name[len] = 0;
J
Junio C Hamano 已提交
382
	return ent;
383 384
}

385
static struct dir_entry *dir_add_name(struct dir_struct *dir, const char *pathname, int len)
J
Jeff King 已提交
386
{
L
Linus Torvalds 已提交
387
	if (cache_name_exists(pathname, len, ignore_case))
J
Jeff King 已提交
388 389
		return NULL;

390
	ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc);
J
Jeff King 已提交
391 392 393
	return dir->entries[dir->nr++] = dir_entry_new(pathname, len);
}

394
static struct dir_entry *dir_add_ignored(struct dir_struct *dir, const char *pathname, int len)
395 396 397 398
{
	if (cache_name_pos(pathname, len) >= 0)
		return NULL;

399
	ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc);
400 401 402
	return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);
}

403 404 405 406 407 408 409 410 411 412 413 414 415 416
enum exist_status {
	index_nonexistent = 0,
	index_directory,
	index_gitdir,
};

/*
 * The index sorts alphabetically by entry name, which
 * means that a gitlink sorts as '\0' at the end, while
 * a directory (which is defined not as an entry, but as
 * the files it contains) will sort with the '/' at the
 * end.
 */
static enum exist_status directory_exists_in_index(const char *dirname, int len)
417 418
{
	int pos = cache_name_pos(dirname, len);
419 420 421 422 423 424 425 426 427 428 429 430 431
	if (pos < 0)
		pos = -pos-1;
	while (pos < active_nr) {
		struct cache_entry *ce = active_cache[pos++];
		unsigned char endchar;

		if (strncmp(ce->name, dirname, len))
			break;
		endchar = ce->name[len];
		if (endchar > '/')
			break;
		if (endchar == '/')
			return index_directory;
432
		if (!endchar && S_ISGITLINK(ce->ce_mode))
433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466
			return index_gitdir;
	}
	return index_nonexistent;
}

/*
 * When we find a directory when traversing the filesystem, we
 * have three distinct cases:
 *
 *  - ignore it
 *  - see it as a directory
 *  - recurse into it
 *
 * and which one we choose depends on a combination of existing
 * git index contents and the flags passed into the directory
 * traversal routine.
 *
 * Case 1: If we *already* have entries in the index under that
 * directory name, we always recurse into the directory to see
 * all the files.
 *
 * Case 2: If we *already* have that directory name as a gitlink,
 * we always continue to see it as a gitlink, regardless of whether
 * there is an actual git directory there or not (it might not
 * be checked out as a subproject!)
 *
 * Case 3: if we didn't have it in the index previously, we
 * have a few sub-cases:
 *
 *  (a) if "show_other_directories" is true, we show it as
 *      just a directory, unless "hide_empty_directories" is
 *      also true and the directory is empty, in which case
 *      we just ignore it entirely.
 *  (b) if it looks like a git directory, and we don't have
M
Martin Waitz 已提交
467
 *      'no_gitlinks' set we treat it as a gitlink, and show it
468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486
 *      as a directory.
 *  (c) otherwise, we recurse into it.
 */
enum directory_treatment {
	show_directory,
	ignore_directory,
	recurse_into_directory,
};

static enum directory_treatment treat_directory(struct dir_struct *dir,
	const char *dirname, int len,
	const struct path_simplify *simplify)
{
	/* The "len-1" is to strip the final '/' */
	switch (directory_exists_in_index(dirname, len-1)) {
	case index_directory:
		return recurse_into_directory;

	case index_gitdir:
487 488
		if (dir->show_other_directories)
			return ignore_directory;
489 490 491 492 493
		return show_directory;

	case index_nonexistent:
		if (dir->show_other_directories)
			break;
M
Martin Waitz 已提交
494
		if (!dir->no_gitlinks) {
495 496 497 498 499 500 501 502 503 504 505 506 507
			unsigned char sha1[20];
			if (resolve_gitlink_ref(dirname, "HEAD", sha1) == 0)
				return show_directory;
		}
		return recurse_into_directory;
	}

	/* This is the "show_other_directories" case */
	if (!dir->hide_empty_directories)
		return show_directory;
	if (!read_directory_recursive(dir, dirname, dirname, len, 1, simplify))
		return ignore_directory;
	return show_directory;
508 509
}

510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534
/*
 * This is an inexact early pruning of any recursive directory
 * reading - if the path cannot possibly be in the pathspec,
 * return true, and we'll skip it early.
 */
static int simplify_away(const char *path, int pathlen, const struct path_simplify *simplify)
{
	if (simplify) {
		for (;;) {
			const char *match = simplify->path;
			int len = simplify->len;

			if (!match)
				break;
			if (len > pathlen)
				len = pathlen;
			if (!memcmp(path, match, len))
				return 0;
			simplify++;
		}
		return 1;
	}
	return 0;
}

535 536 537 538 539 540 541 542 543 544 545 546
static int in_pathspec(const char *path, int len, const struct path_simplify *simplify)
{
	if (simplify) {
		for (; simplify->path; simplify++) {
			if (len == simplify->len
			    && !memcmp(path, simplify->path, len))
				return 1;
		}
	}
	return 0;
}

547 548
static int get_dtype(struct dirent *de, const char *path)
{
J
Junio C Hamano 已提交
549
	int dtype = de ? DTYPE(de) : DT_UNKNOWN;
550 551 552 553 554 555 556 557 558 559 560 561 562 563 564
	struct stat st;

	if (dtype != DT_UNKNOWN)
		return dtype;
	if (lstat(path, &st))
		return dtype;
	if (S_ISREG(st.st_mode))
		return DT_REG;
	if (S_ISDIR(st.st_mode))
		return DT_DIR;
	if (S_ISLNK(st.st_mode))
		return DT_LNK;
	return dtype;
}

565 566 567 568 569 570 571 572 573
/*
 * Read a directory tree. We currently ignore anything but
 * directories, regular files and symlinks. That's because git
 * doesn't handle them at all yet. Maybe that will change some
 * day.
 *
 * Also, we ignore the name ".git" (even if it is not a directory).
 * That likely will not change.
 */
574
static int read_directory_recursive(struct dir_struct *dir, const char *path, const char *base, int baselen, int check_only, const struct path_simplify *simplify)
575 576 577 578 579 580
{
	DIR *fdir = opendir(path);
	int contents = 0;

	if (fdir) {
		struct dirent *de;
581
		char fullname[PATH_MAX + 1];
582 583 584
		memcpy(fullname, base, baselen);

		while ((de = readdir(fdir)) != NULL) {
585
			int len, dtype;
586
			int exclude;
587 588 589 590 591 592 593

			if ((de->d_name[0] == '.') &&
			    (de->d_name[1] == 0 ||
			     !strcmp(de->d_name + 1, ".") ||
			     !strcmp(de->d_name + 1, "git")))
				continue;
			len = strlen(de->d_name);
594 595 596
			/* Ignore overly long pathnames! */
			if (len + baselen + 8 > sizeof(fullname))
				continue;
597
			memcpy(fullname + baselen, de->d_name, len+1);
598 599
			if (simplify_away(fullname, baselen + len, simplify))
				continue;
600

J
Junio C Hamano 已提交
601 602
			dtype = DTYPE(de);
			exclude = excluded(dir, fullname, &dtype);
603 604
			if (exclude && dir->collect_ignored
			    && in_pathspec(fullname, baselen + len, simplify))
605
				dir_add_ignored(dir, fullname, baselen + len);
606 607 608 609 610 611 612 613

			/*
			 * Excluded? If we don't explicitly want to show
			 * ignored files, ignore it
			 */
			if (exclude && !dir->show_ignored)
				continue;

J
Junio C Hamano 已提交
614 615
			if (dtype == DT_UNKNOWN)
				dtype = get_dtype(de, fullname);
616 617 618 619 620 621 622 623 624

			/*
			 * Do we want to see just the ignored files?
			 * We still need to recurse into directories,
			 * even if we don't ignore them, since the
			 * directory may contain files that we do..
			 */
			if (!exclude && dir->show_ignored) {
				if (dtype != DT_DIR)
625 626
					continue;
			}
627

628
			switch (dtype) {
629 630 631 632 633
			default:
				continue;
			case DT_DIR:
				memcpy(fullname + baselen + len, "/", 2);
				len++;
634 635
				switch (treat_directory(dir, fullname, baselen + len, simplify)) {
				case show_directory:
636 637
					if (exclude != dir->show_ignored)
						continue;
638
					break;
639 640 641 642 643 644
				case recurse_into_directory:
					contents += read_directory_recursive(dir,
						fullname, fullname, baselen + len, 0, simplify);
					continue;
				case ignore_directory:
					continue;
645
				}
646
				break;
647 648 649 650 651
			case DT_REG:
			case DT_LNK:
				break;
			}
			contents++;
652 653 654
			if (check_only)
				goto exit_early;
			else
J
Junio C Hamano 已提交
655
				dir_add_name(dir, fullname, baselen + len);
656
		}
657
exit_early:
658 659 660 661 662 663 664 665 666 667 668 669 670 671 672
		closedir(fdir);
	}

	return contents;
}

static int cmp_name(const void *p1, const void *p2)
{
	const struct dir_entry *e1 = *(const struct dir_entry **)p1;
	const struct dir_entry *e2 = *(const struct dir_entry **)p2;

	return cache_name_compare(e1->name, e1->len,
				  e2->name, e2->len);
}

673 674 675 676
/*
 * Return the length of the "simple" part of a path match limiter.
 */
static int simple_length(const char *match)
677
{
678 679 680 681 682
	int len = -1;

	for (;;) {
		unsigned char c = *match++;
		len++;
683
		if (isspecial(c))
684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714
			return len;
	}
}

static struct path_simplify *create_simplify(const char **pathspec)
{
	int nr, alloc = 0;
	struct path_simplify *simplify = NULL;

	if (!pathspec)
		return NULL;

	for (nr = 0 ; ; nr++) {
		const char *match;
		if (nr >= alloc) {
			alloc = alloc_nr(alloc);
			simplify = xrealloc(simplify, alloc * sizeof(*simplify));
		}
		match = *pathspec++;
		if (!match)
			break;
		simplify[nr].path = match;
		simplify[nr].len = simple_length(match);
	}
	simplify[nr].path = NULL;
	simplify[nr].len = 0;
	return simplify;
}

static void free_simplify(struct path_simplify *simplify)
{
715
	free(simplify);
716 717 718 719
}

int read_directory(struct dir_struct *dir, const char *path, const char *base, int baselen, const char **pathspec)
{
720
	struct path_simplify *simplify;
721

722 723 724 725
	if (has_symlink_leading_path(strlen(path), path))
		return dir->nr;

	simplify = create_simplify(pathspec);
726 727
	read_directory_recursive(dir, path, base, baselen, 0, simplify);
	free_simplify(simplify);
728
	qsort(dir->entries, dir->nr, sizeof(struct dir_entry *), cmp_name);
729
	qsort(dir->ignored, dir->ignored_nr, sizeof(struct dir_entry *), cmp_name);
730 731
	return dir->nr;
}
732

J
Junio C Hamano 已提交
733
int file_exists(const char *f)
734
{
J
Junio C Hamano 已提交
735
	struct stat sb;
736
	return lstat(f, &sb) == 0;
737
}
738 739 740 741

/*
 * get_relative_cwd() gets the prefix of the current working directory
 * relative to 'dir'.  If we are not inside 'dir', it returns NULL.
742 743 744 745 746 747 748 749 750 751
 *
 * As a convenience, it also returns NULL if 'dir' is already NULL.  The
 * reason for this behaviour is that it is natural for functions returning
 * directory names to return NULL to say "this directory does not exist"
 * or "this directory is invalid".  These cases are usually handled the
 * same as if the cwd is not inside 'dir' at all, so get_relative_cwd()
 * returns NULL for both of them.
 *
 * Most notably, get_relative_cwd(buffer, size, get_git_work_tree())
 * unifies the handling of "outside work tree" with "no work tree at all".
752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780
 */
char *get_relative_cwd(char *buffer, int size, const char *dir)
{
	char *cwd = buffer;

	if (!dir)
		return NULL;
	if (!getcwd(buffer, size))
		die("can't find the current directory: %s", strerror(errno));

	if (!is_absolute_path(dir))
		dir = make_absolute_path(dir);

	while (*dir && *dir == *cwd) {
		dir++;
		cwd++;
	}
	if (*dir)
		return NULL;
	if (*cwd == '/')
		return cwd + 1;
	return cwd;
}

int is_inside_dir(const char *dir)
{
	char buffer[PATH_MAX];
	return get_relative_cwd(buffer, sizeof(buffer), dir) != NULL;
}
781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821

int remove_dir_recursively(struct strbuf *path, int only_empty)
{
	DIR *dir = opendir(path->buf);
	struct dirent *e;
	int ret = 0, original_len = path->len, len;

	if (!dir)
		return -1;
	if (path->buf[original_len - 1] != '/')
		strbuf_addch(path, '/');

	len = path->len;
	while ((e = readdir(dir)) != NULL) {
		struct stat st;
		if ((e->d_name[0] == '.') &&
		    ((e->d_name[1] == 0) ||
		     ((e->d_name[1] == '.') && e->d_name[2] == 0)))
			continue; /* "." and ".." */

		strbuf_setlen(path, len);
		strbuf_addstr(path, e->d_name);
		if (lstat(path->buf, &st))
			; /* fall thru */
		else if (S_ISDIR(st.st_mode)) {
			if (!remove_dir_recursively(path, only_empty))
				continue; /* happy */
		} else if (!only_empty && !unlink(path->buf))
			continue; /* happy, too */

		/* path too long, stat fails, or non-directory still exists */
		ret = -1;
		break;
	}
	closedir(dir);

	strbuf_setlen(path, original_len);
	if (!ret)
		ret = rmdir(path->buf);
	return ret;
}
J
Junio C Hamano 已提交
822 823 824 825 826 827 828 829 830 831 832 833

void setup_standard_excludes(struct dir_struct *dir)
{
	const char *path;

	dir->exclude_per_dir = ".gitignore";
	path = git_path("info/exclude");
	if (!access(path, R_OK))
		add_excludes_from_file(dir, path);
	if (excludes_file && !access(excludes_file, R_OK))
		add_excludes_from_file(dir, excludes_file);
}
834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853

int remove_path(const char *name)
{
	char *slash;

	if (unlink(name) && errno != ENOENT)
		return -1;

	slash = strrchr(name, '/');
	if (slash) {
		char *dirs = xstrdup(name);
		slash = dirs + (slash - name);
		do {
			*slash = '\0';
		} while (rmdir(dirs) && (slash = strrchr(dirs, '/')));
		free(dirs);
	}
	return 0;
}