1/* 2 * This handles recursive filename detection with exclude 3 * files, index knowledge etc.. 4 * 5 * See Documentation/technical/api-directory-listing.txt 6 * 7 * Copyright (C) Linus Torvalds, 2005-2006 8 * Junio Hamano, 2005-2006 9 */ 10#define NO_THE_INDEX_COMPATIBILITY_MACROS 11#include "cache.h" 12#include "config.h" 13#include "dir.h" 14#include "attr.h" 15#include "refs.h" 16#include "wildmatch.h" 17#include "pathspec.h" 18#include "utf8.h" 19#include "varint.h" 20#include "ewah/ewok.h" 21 22/* 23 * Tells read_directory_recursive how a file or directory should be treated. 24 * Values are ordered by significance, e.g. if a directory contains both 25 * excluded and untracked files, it is listed as untracked because 26 * path_untracked > path_excluded. 27 */ 28enum path_treatment { 29 path_none = 0, 30 path_recurse, 31 path_excluded, 32 path_untracked 33}; 34 35/* 36 * Support data structure for our opendir/readdir/closedir wrappers 37 */ 38struct cached_dir { 39 DIR *fdir; 40 struct untracked_cache_dir *untracked; 41 int nr_files; 42 int nr_dirs; 43 44 struct dirent *de; 45 const char *file; 46 struct untracked_cache_dir *ucd; 47}; 48 49static enum path_treatment read_directory_recursive(struct dir_struct *dir, 50 struct index_state *istate, const char *path, int len, 51 struct untracked_cache_dir *untracked, 52 int check_only, int stop_at_first_file, const struct pathspec *pathspec); 53static int get_dtype(struct dirent *de, struct index_state *istate, 54 const char *path, int len); 55 56int count_slashes(const char *s) 57{ 58 int cnt = 0; 59 while (*s) 60 if (*s++ == '/') 61 cnt++; 62 return cnt; 63} 64 65int fspathcmp(const char *a, const char *b) 66{ 67 return ignore_case ? strcasecmp(a, b) : strcmp(a, b); 68} 69 70int fspathncmp(const char *a, const char *b, size_t count) 71{ 72 return ignore_case ? strncasecmp(a, b, count) : strncmp(a, b, count); 73} 74 75int git_fnmatch(const struct pathspec_item *item, 76 const char *pattern, const char *string, 77 int prefix) 78{ 79 if (prefix > 0) { 80 if (ps_strncmp(item, pattern, string, prefix)) 81 return WM_NOMATCH; 82 pattern += prefix; 83 string += prefix; 84 } 85 if (item->flags & PATHSPEC_ONESTAR) { 86 int pattern_len = strlen(++pattern); 87 int string_len = strlen(string); 88 return string_len < pattern_len || 89 ps_strcmp(item, pattern, 90 string + string_len - pattern_len); 91 } 92 if (item->magic & PATHSPEC_GLOB) 93 return wildmatch(pattern, string, 94 WM_PATHNAME | 95 (item->magic & PATHSPEC_ICASE ? WM_CASEFOLD : 0)); 96 else 97 /* wildmatch has not learned no FNM_PATHNAME mode yet */ 98 return wildmatch(pattern, string, 99 item->magic & PATHSPEC_ICASE ? WM_CASEFOLD : 0); 100} 101 102static int fnmatch_icase_mem(const char *pattern, int patternlen, 103 const char *string, int stringlen, 104 int flags) 105{ 106 int match_status; 107 struct strbuf pat_buf = STRBUF_INIT; 108 struct strbuf str_buf = STRBUF_INIT; 109 const char *use_pat = pattern; 110 const char *use_str = string; 111 112 if (pattern[patternlen]) { 113 strbuf_add(&pat_buf, pattern, patternlen); 114 use_pat = pat_buf.buf; 115 } 116 if (string[stringlen]) { 117 strbuf_add(&str_buf, string, stringlen); 118 use_str = str_buf.buf; 119 } 120 121 if (ignore_case) 122 flags |= WM_CASEFOLD; 123 match_status = wildmatch(use_pat, use_str, flags); 124 125 strbuf_release(&pat_buf); 126 strbuf_release(&str_buf); 127 128 return match_status; 129} 130 131static size_t common_prefix_len(const struct pathspec *pathspec) 132{ 133 int n; 134 size_t max = 0; 135 136 /* 137 * ":(icase)path" is treated as a pathspec full of 138 * wildcard. In other words, only prefix is considered common 139 * prefix. If the pathspec is abc/foo abc/bar, running in 140 * subdir xyz, the common prefix is still xyz, not xuz/abc as 141 * in non-:(icase). 142 */ 143 GUARD_PATHSPEC(pathspec, 144 PATHSPEC_FROMTOP | 145 PATHSPEC_MAXDEPTH | 146 PATHSPEC_LITERAL | 147 PATHSPEC_GLOB | 148 PATHSPEC_ICASE | 149 PATHSPEC_EXCLUDE | 150 PATHSPEC_ATTR); 151 152 for (n = 0; n < pathspec->nr; n++) { 153 size_t i = 0, len = 0, item_len; 154 if (pathspec->items[n].magic & PATHSPEC_EXCLUDE) 155 continue; 156 if (pathspec->items[n].magic & PATHSPEC_ICASE) 157 item_len = pathspec->items[n].prefix; 158 else 159 item_len = pathspec->items[n].nowildcard_len; 160 while (i < item_len && (n == 0 || i < max)) { 161 char c = pathspec->items[n].match[i]; 162 if (c != pathspec->items[0].match[i]) 163 break; 164 if (c == '/') 165 len = i + 1; 166 i++; 167 } 168 if (n == 0 || len < max) { 169 max = len; 170 if (!max) 171 break; 172 } 173 } 174 return max; 175} 176 177/* 178 * Returns a copy of the longest leading path common among all 179 * pathspecs. 180 */ 181char *common_prefix(const struct pathspec *pathspec) 182{ 183 unsigned long len = common_prefix_len(pathspec); 184 185 return len ? xmemdupz(pathspec->items[0].match, len) : NULL; 186} 187 188int fill_directory(struct dir_struct *dir, 189 struct index_state *istate, 190 const struct pathspec *pathspec) 191{ 192 const char *prefix; 193 size_t prefix_len; 194 195 /* 196 * Calculate common prefix for the pathspec, and 197 * use that to optimize the directory walk 198 */ 199 prefix_len = common_prefix_len(pathspec); 200 prefix = prefix_len ? pathspec->items[0].match : ""; 201 202 /* Read the directory and prune it */ 203 read_directory(dir, istate, prefix, prefix_len, pathspec); 204 205 return prefix_len; 206} 207 208int within_depth(const char *name, int namelen, 209 int depth, int max_depth) 210{ 211 const char *cp = name, *cpe = name + namelen; 212 213 while (cp < cpe) { 214 if (*cp++ != '/') 215 continue; 216 depth++; 217 if (depth > max_depth) 218 return 0; 219 } 220 return 1; 221} 222 223#define DO_MATCH_EXCLUDE (1<<0) 224#define DO_MATCH_DIRECTORY (1<<1) 225#define DO_MATCH_SUBMODULE (1<<2) 226 227static int match_attrs(const char *name, int namelen, 228 const struct pathspec_item *item) 229{ 230 int i; 231 232 git_check_attr(name, item->attr_check); 233 for (i = 0; i < item->attr_match_nr; i++) { 234 const char *value; 235 int matched; 236 enum attr_match_mode match_mode; 237 238 value = item->attr_check->items[i].value; 239 match_mode = item->attr_match[i].match_mode; 240 241 if (ATTR_TRUE(value)) 242 matched = (match_mode == MATCH_SET); 243 else if (ATTR_FALSE(value)) 244 matched = (match_mode == MATCH_UNSET); 245 else if (ATTR_UNSET(value)) 246 matched = (match_mode == MATCH_UNSPECIFIED); 247 else 248 matched = (match_mode == MATCH_VALUE && 249 !strcmp(item->attr_match[i].value, value)); 250 if (!matched) 251 return 0; 252 } 253 254 return 1; 255} 256 257/* 258 * Does 'match' match the given name? 259 * A match is found if 260 * 261 * (1) the 'match' string is leading directory of 'name', or 262 * (2) the 'match' string is a wildcard and matches 'name', or 263 * (3) the 'match' string is exactly the same as 'name'. 264 * 265 * and the return value tells which case it was. 266 * 267 * It returns 0 when there is no match. 268 */ 269static int match_pathspec_item(const struct pathspec_item *item, int prefix, 270 const char *name, int namelen, unsigned flags) 271{ 272 /* name/namelen has prefix cut off by caller */ 273 const char *match = item->match + prefix; 274 int matchlen = item->len - prefix; 275 276 /* 277 * The normal call pattern is: 278 * 1. prefix = common_prefix_len(ps); 279 * 2. prune something, or fill_directory 280 * 3. match_pathspec() 281 * 282 * 'prefix' at #1 may be shorter than the command's prefix and 283 * it's ok for #2 to match extra files. Those extras will be 284 * trimmed at #3. 285 * 286 * Suppose the pathspec is 'foo' and '../bar' running from 287 * subdir 'xyz'. The common prefix at #1 will be empty, thanks 288 * to "../". We may have xyz/foo _and_ XYZ/foo after #2. The 289 * user does not want XYZ/foo, only the "foo" part should be 290 * case-insensitive. We need to filter out XYZ/foo here. In 291 * other words, we do not trust the caller on comparing the 292 * prefix part when :(icase) is involved. We do exact 293 * comparison ourselves. 294 * 295 * Normally the caller (common_prefix_len() in fact) does 296 * _exact_ matching on name[-prefix+1..-1] and we do not need 297 * to check that part. Be defensive and check it anyway, in 298 * case common_prefix_len is changed, or a new caller is 299 * introduced that does not use common_prefix_len. 300 * 301 * If the penalty turns out too high when prefix is really 302 * long, maybe change it to 303 * strncmp(match, name, item->prefix - prefix) 304 */ 305 if (item->prefix && (item->magic & PATHSPEC_ICASE) && 306 strncmp(item->match, name - prefix, item->prefix)) 307 return 0; 308 309 if (item->attr_match_nr && !match_attrs(name, namelen, item)) 310 return 0; 311 312 /* If the match was just the prefix, we matched */ 313 if (!*match) 314 return MATCHED_RECURSIVELY; 315 316 if (matchlen <= namelen && !ps_strncmp(item, match, name, matchlen)) { 317 if (matchlen == namelen) 318 return MATCHED_EXACTLY; 319 320 if (match[matchlen-1] == '/' || name[matchlen] == '/') 321 return MATCHED_RECURSIVELY; 322 } else if ((flags & DO_MATCH_DIRECTORY) && 323 match[matchlen - 1] == '/' && 324 namelen == matchlen - 1 && 325 !ps_strncmp(item, match, name, namelen)) 326 return MATCHED_EXACTLY; 327 328 if (item->nowildcard_len < item->len && 329 !git_fnmatch(item, match, name, 330 item->nowildcard_len - prefix)) 331 return MATCHED_FNMATCH; 332 333 /* Perform checks to see if "name" is a super set of the pathspec */ 334 if (flags & DO_MATCH_SUBMODULE) { 335 /* name is a literal prefix of the pathspec */ 336 if ((namelen < matchlen) && 337 (match[namelen] == '/') && 338 !ps_strncmp(item, match, name, namelen)) 339 return MATCHED_RECURSIVELY; 340 341 /* name" doesn't match up to the first wild character */ 342 if (item->nowildcard_len < item->len && 343 ps_strncmp(item, match, name, 344 item->nowildcard_len - prefix)) 345 return 0; 346 347 /* 348 * Here is where we would perform a wildmatch to check if 349 * "name" can be matched as a directory (or a prefix) against 350 * the pathspec. Since wildmatch doesn't have this capability 351 * at the present we have to punt and say that it is a match, 352 * potentially returning a false positive 353 * The submodules themselves will be able to perform more 354 * accurate matching to determine if the pathspec matches. 355 */ 356 return MATCHED_RECURSIVELY; 357 } 358 359 return 0; 360} 361 362/* 363 * Given a name and a list of pathspecs, returns the nature of the 364 * closest (i.e. most specific) match of the name to any of the 365 * pathspecs. 366 * 367 * The caller typically calls this multiple times with the same 368 * pathspec and seen[] array but with different name/namelen 369 * (e.g. entries from the index) and is interested in seeing if and 370 * how each pathspec matches all the names it calls this function 371 * with. A mark is left in the seen[] array for each pathspec element 372 * indicating the closest type of match that element achieved, so if 373 * seen[n] remains zero after multiple invocations, that means the nth 374 * pathspec did not match any names, which could indicate that the 375 * user mistyped the nth pathspec. 376 */ 377static int do_match_pathspec(const struct pathspec *ps, 378 const char *name, int namelen, 379 int prefix, char *seen, 380 unsigned flags) 381{ 382 int i, retval = 0, exclude = flags & DO_MATCH_EXCLUDE; 383 384 GUARD_PATHSPEC(ps, 385 PATHSPEC_FROMTOP | 386 PATHSPEC_MAXDEPTH | 387 PATHSPEC_LITERAL | 388 PATHSPEC_GLOB | 389 PATHSPEC_ICASE | 390 PATHSPEC_EXCLUDE | 391 PATHSPEC_ATTR); 392 393 if (!ps->nr) { 394 if (!ps->recursive || 395 !(ps->magic & PATHSPEC_MAXDEPTH) || 396 ps->max_depth == -1) 397 return MATCHED_RECURSIVELY; 398 399 if (within_depth(name, namelen, 0, ps->max_depth)) 400 return MATCHED_EXACTLY; 401 else 402 return 0; 403 } 404 405 name += prefix; 406 namelen -= prefix; 407 408 for (i = ps->nr - 1; i >= 0; i--) { 409 int how; 410 411 if ((!exclude && ps->items[i].magic & PATHSPEC_EXCLUDE) || 412 ( exclude && !(ps->items[i].magic & PATHSPEC_EXCLUDE))) 413 continue; 414 415 if (seen && seen[i] == MATCHED_EXACTLY) 416 continue; 417 /* 418 * Make exclude patterns optional and never report 419 * "pathspec ':(exclude)foo' matches no files" 420 */ 421 if (seen && ps->items[i].magic & PATHSPEC_EXCLUDE) 422 seen[i] = MATCHED_FNMATCH; 423 how = match_pathspec_item(ps->items+i, prefix, name, 424 namelen, flags); 425 if (ps->recursive && 426 (ps->magic & PATHSPEC_MAXDEPTH) && 427 ps->max_depth != -1 && 428 how && how != MATCHED_FNMATCH) { 429 int len = ps->items[i].len; 430 if (name[len] == '/') 431 len++; 432 if (within_depth(name+len, namelen-len, 0, ps->max_depth)) 433 how = MATCHED_EXACTLY; 434 else 435 how = 0; 436 } 437 if (how) { 438 if (retval < how) 439 retval = how; 440 if (seen && seen[i] < how) 441 seen[i] = how; 442 } 443 } 444 return retval; 445} 446 447int match_pathspec(const struct pathspec *ps, 448 const char *name, int namelen, 449 int prefix, char *seen, int is_dir) 450{ 451 int positive, negative; 452 unsigned flags = is_dir ? DO_MATCH_DIRECTORY : 0; 453 positive = do_match_pathspec(ps, name, namelen, 454 prefix, seen, flags); 455 if (!(ps->magic & PATHSPEC_EXCLUDE) || !positive) 456 return positive; 457 negative = do_match_pathspec(ps, name, namelen, 458 prefix, seen, 459 flags | DO_MATCH_EXCLUDE); 460 return negative ? 0 : positive; 461} 462 463/** 464 * Check if a submodule is a superset of the pathspec 465 */ 466int submodule_path_match(const struct pathspec *ps, 467 const char *submodule_name, 468 char *seen) 469{ 470 int matched = do_match_pathspec(ps, submodule_name, 471 strlen(submodule_name), 472 0, seen, 473 DO_MATCH_DIRECTORY | 474 DO_MATCH_SUBMODULE); 475 return matched; 476} 477 478int report_path_error(const char *ps_matched, 479 const struct pathspec *pathspec, 480 const char *prefix) 481{ 482 /* 483 * Make sure all pathspec matched; otherwise it is an error. 484 */ 485 int num, errors = 0; 486 for (num = 0; num < pathspec->nr; num++) { 487 int other, found_dup; 488 489 if (ps_matched[num]) 490 continue; 491 /* 492 * The caller might have fed identical pathspec 493 * twice. Do not barf on such a mistake. 494 * FIXME: parse_pathspec should have eliminated 495 * duplicate pathspec. 496 */ 497 for (found_dup = other = 0; 498 !found_dup && other < pathspec->nr; 499 other++) { 500 if (other == num || !ps_matched[other]) 501 continue; 502 if (!strcmp(pathspec->items[other].original, 503 pathspec->items[num].original)) 504 /* 505 * Ok, we have a match already. 506 */ 507 found_dup = 1; 508 } 509 if (found_dup) 510 continue; 511 512 error("pathspec '%s' did not match any file(s) known to git.", 513 pathspec->items[num].original); 514 errors++; 515 } 516 return errors; 517} 518 519/* 520 * Return the length of the "simple" part of a path match limiter. 521 */ 522int simple_length(const char *match) 523{ 524 int len = -1; 525 526 for (;;) { 527 unsigned char c = *match++; 528 len++; 529 if (c == '\0' || is_glob_special(c)) 530 return len; 531 } 532} 533 534int no_wildcard(const char *string) 535{ 536 return string[simple_length(string)] == '\0'; 537} 538 539void parse_exclude_pattern(const char **pattern, 540 int *patternlen, 541 unsigned *flags, 542 int *nowildcardlen) 543{ 544 const char *p = *pattern; 545 size_t i, len; 546 547 *flags = 0; 548 if (*p == '!') { 549 *flags |= EXC_FLAG_NEGATIVE; 550 p++; 551 } 552 len = strlen(p); 553 if (len && p[len - 1] == '/') { 554 len--; 555 *flags |= EXC_FLAG_MUSTBEDIR; 556 } 557 for (i = 0; i < len; i++) { 558 if (p[i] == '/') 559 break; 560 } 561 if (i == len) 562 *flags |= EXC_FLAG_NODIR; 563 *nowildcardlen = simple_length(p); 564 /* 565 * we should have excluded the trailing slash from 'p' too, 566 * but that's one more allocation. Instead just make sure 567 * nowildcardlen does not exceed real patternlen 568 */ 569 if (*nowildcardlen > len) 570 *nowildcardlen = len; 571 if (*p == '*' && no_wildcard(p + 1)) 572 *flags |= EXC_FLAG_ENDSWITH; 573 *pattern = p; 574 *patternlen = len; 575} 576 577void add_exclude(const char *string, const char *base, 578 int baselen, struct exclude_list *el, int srcpos) 579{ 580 struct exclude *x; 581 int patternlen; 582 unsigned flags; 583 int nowildcardlen; 584 585 parse_exclude_pattern(&string, &patternlen, &flags, &nowildcardlen); 586 if (flags & EXC_FLAG_MUSTBEDIR) { 587 FLEXPTR_ALLOC_MEM(x, pattern, string, patternlen); 588 } else { 589 x = xmalloc(sizeof(*x)); 590 x->pattern = string; 591 } 592 x->patternlen = patternlen; 593 x->nowildcardlen = nowildcardlen; 594 x->base = base; 595 x->baselen = baselen; 596 x->flags = flags; 597 x->srcpos = srcpos; 598 ALLOC_GROW(el->excludes, el->nr + 1, el->alloc); 599 el->excludes[el->nr++] = x; 600 x->el = el; 601} 602 603static void *read_skip_worktree_file_from_index(const struct index_state *istate, 604 const char *path, size_t *size, 605 struct sha1_stat *sha1_stat) 606{ 607 int pos, len; 608 unsigned long sz; 609 enum object_type type; 610 void *data; 611 612 len = strlen(path); 613 pos = index_name_pos(istate, path, len); 614 if (pos < 0) 615 return NULL; 616 if (!ce_skip_worktree(istate->cache[pos])) 617 return NULL; 618 data = read_sha1_file(istate->cache[pos]->oid.hash, &type, &sz); 619 if (!data || type != OBJ_BLOB) { 620 free(data); 621 return NULL; 622 } 623 *size = xsize_t(sz); 624 if (sha1_stat) { 625 memset(&sha1_stat->stat, 0, sizeof(sha1_stat->stat)); 626 hashcpy(sha1_stat->sha1, istate->cache[pos]->oid.hash); 627 } 628 return data; 629} 630 631/* 632 * Frees memory within el which was allocated for exclude patterns and 633 * the file buffer. Does not free el itself. 634 */ 635void clear_exclude_list(struct exclude_list *el) 636{ 637 int i; 638 639 for (i = 0; i < el->nr; i++) 640 free(el->excludes[i]); 641 free(el->excludes); 642 free(el->filebuf); 643 644 memset(el, 0, sizeof(*el)); 645} 646 647static void trim_trailing_spaces(char *buf) 648{ 649 char *p, *last_space = NULL; 650 651 for (p = buf; *p; p++) 652 switch (*p) { 653 case ' ': 654 if (!last_space) 655 last_space = p; 656 break; 657 case '\\': 658 p++; 659 if (!*p) 660 return; 661 /* fallthrough */ 662 default: 663 last_space = NULL; 664 } 665 666 if (last_space) 667 *last_space = '\0'; 668} 669 670/* 671 * Given a subdirectory name and "dir" of the current directory, 672 * search the subdir in "dir" and return it, or create a new one if it 673 * does not exist in "dir". 674 * 675 * If "name" has the trailing slash, it'll be excluded in the search. 676 */ 677static struct untracked_cache_dir *lookup_untracked(struct untracked_cache *uc, 678 struct untracked_cache_dir *dir, 679 const char *name, int len) 680{ 681 int first, last; 682 struct untracked_cache_dir *d; 683 if (!dir) 684 return NULL; 685 if (len && name[len - 1] == '/') 686 len--; 687 first = 0; 688 last = dir->dirs_nr; 689 while (last > first) { 690 int cmp, next = (last + first) >> 1; 691 d = dir->dirs[next]; 692 cmp = strncmp(name, d->name, len); 693 if (!cmp && strlen(d->name) > len) 694 cmp = -1; 695 if (!cmp) 696 return d; 697 if (cmp < 0) { 698 last = next; 699 continue; 700 } 701 first = next+1; 702 } 703 704 uc->dir_created++; 705 FLEX_ALLOC_MEM(d, name, name, len); 706 707 ALLOC_GROW(dir->dirs, dir->dirs_nr + 1, dir->dirs_alloc); 708 memmove(dir->dirs + first + 1, dir->dirs + first, 709 (dir->dirs_nr - first) * sizeof(*dir->dirs)); 710 dir->dirs_nr++; 711 dir->dirs[first] = d; 712 return d; 713} 714 715static void do_invalidate_gitignore(struct untracked_cache_dir *dir) 716{ 717 int i; 718 dir->valid = 0; 719 dir->untracked_nr = 0; 720 for (i = 0; i < dir->dirs_nr; i++) 721 do_invalidate_gitignore(dir->dirs[i]); 722} 723 724static void invalidate_gitignore(struct untracked_cache *uc, 725 struct untracked_cache_dir *dir) 726{ 727 uc->gitignore_invalidated++; 728 do_invalidate_gitignore(dir); 729} 730 731static void invalidate_directory(struct untracked_cache *uc, 732 struct untracked_cache_dir *dir) 733{ 734 int i; 735 uc->dir_invalidated++; 736 dir->valid = 0; 737 dir->untracked_nr = 0; 738 for (i = 0; i < dir->dirs_nr; i++) 739 dir->dirs[i]->recurse = 0; 740} 741 742/* 743 * Given a file with name "fname", read it (either from disk, or from 744 * an index if 'istate' is non-null), parse it and store the 745 * exclude rules in "el". 746 * 747 * If "ss" is not NULL, compute SHA-1 of the exclude file and fill 748 * stat data from disk (only valid if add_excludes returns zero). If 749 * ss_valid is non-zero, "ss" must contain good value as input. 750 */ 751static int add_excludes(const char *fname, const char *base, int baselen, 752 struct exclude_list *el, 753 struct index_state *istate, 754 struct sha1_stat *sha1_stat) 755{ 756 struct stat st; 757 int fd, i, lineno = 1; 758 size_t size = 0; 759 char *buf, *entry; 760 761 fd = open(fname, O_RDONLY); 762 if (fd < 0 || fstat(fd, &st) < 0) { 763 if (fd < 0) 764 warn_on_fopen_errors(fname); 765 else 766 close(fd); 767 if (!istate || 768 (buf = read_skip_worktree_file_from_index(istate, fname, &size, sha1_stat)) == NULL) 769 return -1; 770 if (size == 0) { 771 free(buf); 772 return 0; 773 } 774 if (buf[size-1] != '\n') { 775 buf = xrealloc(buf, st_add(size, 1)); 776 buf[size++] = '\n'; 777 } 778 } else { 779 size = xsize_t(st.st_size); 780 if (size == 0) { 781 if (sha1_stat) { 782 fill_stat_data(&sha1_stat->stat, &st); 783 hashcpy(sha1_stat->sha1, EMPTY_BLOB_SHA1_BIN); 784 sha1_stat->valid = 1; 785 } 786 close(fd); 787 return 0; 788 } 789 buf = xmallocz(size); 790 if (read_in_full(fd, buf, size) != size) { 791 free(buf); 792 close(fd); 793 return -1; 794 } 795 buf[size++] = '\n'; 796 close(fd); 797 if (sha1_stat) { 798 int pos; 799 if (sha1_stat->valid && 800 !match_stat_data_racy(istate, &sha1_stat->stat, &st)) 801 ; /* no content change, ss->sha1 still good */ 802 else if (istate && 803 (pos = index_name_pos(istate, fname, strlen(fname))) >= 0 && 804 !ce_stage(istate->cache[pos]) && 805 ce_uptodate(istate->cache[pos]) && 806 !would_convert_to_git(istate, fname)) 807 hashcpy(sha1_stat->sha1, 808 istate->cache[pos]->oid.hash); 809 else 810 hash_sha1_file(buf, size, "blob", sha1_stat->sha1); 811 fill_stat_data(&sha1_stat->stat, &st); 812 sha1_stat->valid = 1; 813 } 814 } 815 816 el->filebuf = buf; 817 818 if (skip_utf8_bom(&buf, size)) 819 size -= buf - el->filebuf; 820 821 entry = buf; 822 823 for (i = 0; i < size; i++) { 824 if (buf[i] == '\n') { 825 if (entry != buf + i && entry[0] != '#') { 826 buf[i - (i && buf[i-1] == '\r')] = 0; 827 trim_trailing_spaces(entry); 828 add_exclude(entry, base, baselen, el, lineno); 829 } 830 lineno++; 831 entry = buf + i + 1; 832 } 833 } 834 return 0; 835} 836 837int add_excludes_from_file_to_list(const char *fname, const char *base, 838 int baselen, struct exclude_list *el, 839 struct index_state *istate) 840{ 841 return add_excludes(fname, base, baselen, el, istate, NULL); 842} 843 844struct exclude_list *add_exclude_list(struct dir_struct *dir, 845 int group_type, const char *src) 846{ 847 struct exclude_list *el; 848 struct exclude_list_group *group; 849 850 group = &dir->exclude_list_group[group_type]; 851 ALLOC_GROW(group->el, group->nr + 1, group->alloc); 852 el = &group->el[group->nr++]; 853 memset(el, 0, sizeof(*el)); 854 el->src = src; 855 return el; 856} 857 858/* 859 * Used to set up core.excludesfile and .git/info/exclude lists. 860 */ 861static void add_excludes_from_file_1(struct dir_struct *dir, const char *fname, 862 struct sha1_stat *sha1_stat) 863{ 864 struct exclude_list *el; 865 /* 866 * catch setup_standard_excludes() that's called before 867 * dir->untracked is assigned. That function behaves 868 * differently when dir->untracked is non-NULL. 869 */ 870 if (!dir->untracked) 871 dir->unmanaged_exclude_files++; 872 el = add_exclude_list(dir, EXC_FILE, fname); 873 if (add_excludes(fname, "", 0, el, NULL, sha1_stat) < 0) 874 die("cannot use %s as an exclude file", fname); 875} 876 877void add_excludes_from_file(struct dir_struct *dir, const char *fname) 878{ 879 dir->unmanaged_exclude_files++; /* see validate_untracked_cache() */ 880 add_excludes_from_file_1(dir, fname, NULL); 881} 882 883int match_basename(const char *basename, int basenamelen, 884 const char *pattern, int prefix, int patternlen, 885 unsigned flags) 886{ 887 if (prefix == patternlen) { 888 if (patternlen == basenamelen && 889 !fspathncmp(pattern, basename, basenamelen)) 890 return 1; 891 } else if (flags & EXC_FLAG_ENDSWITH) { 892 /* "*literal" matching against "fooliteral" */ 893 if (patternlen - 1 <= basenamelen && 894 !fspathncmp(pattern + 1, 895 basename + basenamelen - (patternlen - 1), 896 patternlen - 1)) 897 return 1; 898 } else { 899 if (fnmatch_icase_mem(pattern, patternlen, 900 basename, basenamelen, 901 0) == 0) 902 return 1; 903 } 904 return 0; 905} 906 907int match_pathname(const char *pathname, int pathlen, 908 const char *base, int baselen, 909 const char *pattern, int prefix, int patternlen, 910 unsigned flags) 911{ 912 const char *name; 913 int namelen; 914 915 /* 916 * match with FNM_PATHNAME; the pattern has base implicitly 917 * in front of it. 918 */ 919 if (*pattern == '/') { 920 pattern++; 921 patternlen--; 922 prefix--; 923 } 924 925 /* 926 * baselen does not count the trailing slash. base[] may or 927 * may not end with a trailing slash though. 928 */ 929 if (pathlen < baselen + 1 || 930 (baselen && pathname[baselen] != '/') || 931 fspathncmp(pathname, base, baselen)) 932 return 0; 933 934 namelen = baselen ? pathlen - baselen - 1 : pathlen; 935 name = pathname + pathlen - namelen; 936 937 if (prefix) { 938 /* 939 * if the non-wildcard part is longer than the 940 * remaining pathname, surely it cannot match. 941 */ 942 if (prefix > namelen) 943 return 0; 944 945 if (fspathncmp(pattern, name, prefix)) 946 return 0; 947 pattern += prefix; 948 patternlen -= prefix; 949 name += prefix; 950 namelen -= prefix; 951 952 /* 953 * If the whole pattern did not have a wildcard, 954 * then our prefix match is all we need; we 955 * do not need to call fnmatch at all. 956 */ 957 if (!patternlen && !namelen) 958 return 1; 959 } 960 961 return fnmatch_icase_mem(pattern, patternlen, 962 name, namelen, 963 WM_PATHNAME) == 0; 964} 965 966/* 967 * Scan the given exclude list in reverse to see whether pathname 968 * should be ignored. The first match (i.e. the last on the list), if 969 * any, determines the fate. Returns the exclude_list element which 970 * matched, or NULL for undecided. 971 */ 972static struct exclude *last_exclude_matching_from_list(const char *pathname, 973 int pathlen, 974 const char *basename, 975 int *dtype, 976 struct exclude_list *el, 977 struct index_state *istate) 978{ 979 struct exclude *exc = NULL; /* undecided */ 980 int i; 981 982 if (!el->nr) 983 return NULL; /* undefined */ 984 985 for (i = el->nr - 1; 0 <= i; i--) { 986 struct exclude *x = el->excludes[i]; 987 const char *exclude = x->pattern; 988 int prefix = x->nowildcardlen; 989 990 if (x->flags & EXC_FLAG_MUSTBEDIR) { 991 if (*dtype == DT_UNKNOWN) 992 *dtype = get_dtype(NULL, istate, pathname, pathlen); 993 if (*dtype != DT_DIR) 994 continue; 995 } 996 997 if (x->flags & EXC_FLAG_NODIR) { 998 if (match_basename(basename, 999 pathlen - (basename - pathname),1000 exclude, prefix, x->patternlen,1001 x->flags)) {1002 exc = x;1003 break;1004 }1005 continue;1006 }10071008 assert(x->baselen == 0 || x->base[x->baselen - 1] == '/');1009 if (match_pathname(pathname, pathlen,1010 x->base, x->baselen ? x->baselen - 1 : 0,1011 exclude, prefix, x->patternlen, x->flags)) {1012 exc = x;1013 break;1014 }1015 }1016 return exc;1017}10181019/*1020 * Scan the list and let the last match determine the fate.1021 * Return 1 for exclude, 0 for include and -1 for undecided.1022 */1023int is_excluded_from_list(const char *pathname,1024 int pathlen, const char *basename, int *dtype,1025 struct exclude_list *el, struct index_state *istate)1026{1027 struct exclude *exclude;1028 exclude = last_exclude_matching_from_list(pathname, pathlen, basename,1029 dtype, el, istate);1030 if (exclude)1031 return exclude->flags & EXC_FLAG_NEGATIVE ? 0 : 1;1032 return -1; /* undecided */1033}10341035static struct exclude *last_exclude_matching_from_lists(struct dir_struct *dir,1036 struct index_state *istate,1037 const char *pathname, int pathlen, const char *basename,1038 int *dtype_p)1039{1040 int i, j;1041 struct exclude_list_group *group;1042 struct exclude *exclude;1043 for (i = EXC_CMDL; i <= EXC_FILE; i++) {1044 group = &dir->exclude_list_group[i];1045 for (j = group->nr - 1; j >= 0; j--) {1046 exclude = last_exclude_matching_from_list(1047 pathname, pathlen, basename, dtype_p,1048 &group->el[j], istate);1049 if (exclude)1050 return exclude;1051 }1052 }1053 return NULL;1054}10551056/*1057 * Loads the per-directory exclude list for the substring of base1058 * which has a char length of baselen.1059 */1060static void prep_exclude(struct dir_struct *dir,1061 struct index_state *istate,1062 const char *base, int baselen)1063{1064 struct exclude_list_group *group;1065 struct exclude_list *el;1066 struct exclude_stack *stk = NULL;1067 struct untracked_cache_dir *untracked;1068 int current;10691070 group = &dir->exclude_list_group[EXC_DIRS];10711072 /*1073 * Pop the exclude lists from the EXCL_DIRS exclude_list_group1074 * which originate from directories not in the prefix of the1075 * path being checked.1076 */1077 while ((stk = dir->exclude_stack) != NULL) {1078 if (stk->baselen <= baselen &&1079 !strncmp(dir->basebuf.buf, base, stk->baselen))1080 break;1081 el = &group->el[dir->exclude_stack->exclude_ix];1082 dir->exclude_stack = stk->prev;1083 dir->exclude = NULL;1084 free((char *)el->src); /* see strbuf_detach() below */1085 clear_exclude_list(el);1086 free(stk);1087 group->nr--;1088 }10891090 /* Skip traversing into sub directories if the parent is excluded */1091 if (dir->exclude)1092 return;10931094 /*1095 * Lazy initialization. All call sites currently just1096 * memset(dir, 0, sizeof(*dir)) before use. Changing all of1097 * them seems lots of work for little benefit.1098 */1099 if (!dir->basebuf.buf)1100 strbuf_init(&dir->basebuf, PATH_MAX);11011102 /* Read from the parent directories and push them down. */1103 current = stk ? stk->baselen : -1;1104 strbuf_setlen(&dir->basebuf, current < 0 ? 0 : current);1105 if (dir->untracked)1106 untracked = stk ? stk->ucd : dir->untracked->root;1107 else1108 untracked = NULL;11091110 while (current < baselen) {1111 const char *cp;1112 struct sha1_stat sha1_stat;11131114 stk = xcalloc(1, sizeof(*stk));1115 if (current < 0) {1116 cp = base;1117 current = 0;1118 } else {1119 cp = strchr(base + current + 1, '/');1120 if (!cp)1121 die("oops in prep_exclude");1122 cp++;1123 untracked =1124 lookup_untracked(dir->untracked, untracked,1125 base + current,1126 cp - base - current);1127 }1128 stk->prev = dir->exclude_stack;1129 stk->baselen = cp - base;1130 stk->exclude_ix = group->nr;1131 stk->ucd = untracked;1132 el = add_exclude_list(dir, EXC_DIRS, NULL);1133 strbuf_add(&dir->basebuf, base + current, stk->baselen - current);1134 assert(stk->baselen == dir->basebuf.len);11351136 /* Abort if the directory is excluded */1137 if (stk->baselen) {1138 int dt = DT_DIR;1139 dir->basebuf.buf[stk->baselen - 1] = 0;1140 dir->exclude = last_exclude_matching_from_lists(dir,1141 istate,1142 dir->basebuf.buf, stk->baselen - 1,1143 dir->basebuf.buf + current, &dt);1144 dir->basebuf.buf[stk->baselen - 1] = '/';1145 if (dir->exclude &&1146 dir->exclude->flags & EXC_FLAG_NEGATIVE)1147 dir->exclude = NULL;1148 if (dir->exclude) {1149 dir->exclude_stack = stk;1150 return;1151 }1152 }11531154 /* Try to read per-directory file */1155 hashclr(sha1_stat.sha1);1156 sha1_stat.valid = 0;1157 if (dir->exclude_per_dir &&1158 /*1159 * If we know that no files have been added in1160 * this directory (i.e. valid_cached_dir() has1161 * been executed and set untracked->valid) ..1162 */1163 (!untracked || !untracked->valid ||1164 /*1165 * .. and .gitignore does not exist before1166 * (i.e. null exclude_sha1). Then we can skip1167 * loading .gitignore, which would result in1168 * ENOENT anyway.1169 */1170 !is_null_sha1(untracked->exclude_sha1))) {1171 /*1172 * dir->basebuf gets reused by the traversal, but we1173 * need fname to remain unchanged to ensure the src1174 * member of each struct exclude correctly1175 * back-references its source file. Other invocations1176 * of add_exclude_list provide stable strings, so we1177 * strbuf_detach() and free() here in the caller.1178 */1179 struct strbuf sb = STRBUF_INIT;1180 strbuf_addbuf(&sb, &dir->basebuf);1181 strbuf_addstr(&sb, dir->exclude_per_dir);1182 el->src = strbuf_detach(&sb, NULL);1183 add_excludes(el->src, el->src, stk->baselen, el, istate,1184 untracked ? &sha1_stat : NULL);1185 }1186 /*1187 * NEEDSWORK: when untracked cache is enabled, prep_exclude()1188 * will first be called in valid_cached_dir() then maybe many1189 * times more in last_exclude_matching(). When the cache is1190 * used, last_exclude_matching() will not be called and1191 * reading .gitignore content will be a waste.1192 *1193 * So when it's called by valid_cached_dir() and we can get1194 * .gitignore SHA-1 from the index (i.e. .gitignore is not1195 * modified on work tree), we could delay reading the1196 * .gitignore content until we absolutely need it in1197 * last_exclude_matching(). Be careful about ignore rule1198 * order, though, if you do that.1199 */1200 if (untracked &&1201 hashcmp(sha1_stat.sha1, untracked->exclude_sha1)) {1202 invalidate_gitignore(dir->untracked, untracked);1203 hashcpy(untracked->exclude_sha1, sha1_stat.sha1);1204 }1205 dir->exclude_stack = stk;1206 current = stk->baselen;1207 }1208 strbuf_setlen(&dir->basebuf, baselen);1209}12101211/*1212 * Loads the exclude lists for the directory containing pathname, then1213 * scans all exclude lists to determine whether pathname is excluded.1214 * Returns the exclude_list element which matched, or NULL for1215 * undecided.1216 */1217struct exclude *last_exclude_matching(struct dir_struct *dir,1218 struct index_state *istate,1219 const char *pathname,1220 int *dtype_p)1221{1222 int pathlen = strlen(pathname);1223 const char *basename = strrchr(pathname, '/');1224 basename = (basename) ? basename+1 : pathname;12251226 prep_exclude(dir, istate, pathname, basename-pathname);12271228 if (dir->exclude)1229 return dir->exclude;12301231 return last_exclude_matching_from_lists(dir, istate, pathname, pathlen,1232 basename, dtype_p);1233}12341235/*1236 * Loads the exclude lists for the directory containing pathname, then1237 * scans all exclude lists to determine whether pathname is excluded.1238 * Returns 1 if true, otherwise 0.1239 */1240int is_excluded(struct dir_struct *dir, struct index_state *istate,1241 const char *pathname, int *dtype_p)1242{1243 struct exclude *exclude =1244 last_exclude_matching(dir, istate, pathname, dtype_p);1245 if (exclude)1246 return exclude->flags & EXC_FLAG_NEGATIVE ? 0 : 1;1247 return 0;1248}12491250static struct dir_entry *dir_entry_new(const char *pathname, int len)1251{1252 struct dir_entry *ent;12531254 FLEX_ALLOC_MEM(ent, name, pathname, len);1255 ent->len = len;1256 return ent;1257}12581259static struct dir_entry *dir_add_name(struct dir_struct *dir,1260 struct index_state *istate,1261 const char *pathname, int len)1262{1263 if (index_file_exists(istate, pathname, len, ignore_case))1264 return NULL;12651266 ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc);1267 return dir->entries[dir->nr++] = dir_entry_new(pathname, len);1268}12691270struct dir_entry *dir_add_ignored(struct dir_struct *dir,1271 struct index_state *istate,1272 const char *pathname, int len)1273{1274 if (!index_name_is_other(istate, pathname, len))1275 return NULL;12761277 ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc);1278 return dir->ignored[dir->ignored_nr++] = dir_entry_new(pathname, len);1279}12801281enum exist_status {1282 index_nonexistent = 0,1283 index_directory,1284 index_gitdir1285};12861287/*1288 * Do not use the alphabetically sorted index to look up1289 * the directory name; instead, use the case insensitive1290 * directory hash.1291 */1292static enum exist_status directory_exists_in_index_icase(struct index_state *istate,1293 const char *dirname, int len)1294{1295 struct cache_entry *ce;12961297 if (index_dir_exists(istate, dirname, len))1298 return index_directory;12991300 ce = index_file_exists(istate, dirname, len, ignore_case);1301 if (ce && S_ISGITLINK(ce->ce_mode))1302 return index_gitdir;13031304 return index_nonexistent;1305}13061307/*1308 * The index sorts alphabetically by entry name, which1309 * means that a gitlink sorts as '\0' at the end, while1310 * a directory (which is defined not as an entry, but as1311 * the files it contains) will sort with the '/' at the1312 * end.1313 */1314static enum exist_status directory_exists_in_index(struct index_state *istate,1315 const char *dirname, int len)1316{1317 int pos;13181319 if (ignore_case)1320 return directory_exists_in_index_icase(istate, dirname, len);13211322 pos = index_name_pos(istate, dirname, len);1323 if (pos < 0)1324 pos = -pos-1;1325 while (pos < istate->cache_nr) {1326 const struct cache_entry *ce = istate->cache[pos++];1327 unsigned char endchar;13281329 if (strncmp(ce->name, dirname, len))1330 break;1331 endchar = ce->name[len];1332 if (endchar > '/')1333 break;1334 if (endchar == '/')1335 return index_directory;1336 if (!endchar && S_ISGITLINK(ce->ce_mode))1337 return index_gitdir;1338 }1339 return index_nonexistent;1340}13411342/*1343 * When we find a directory when traversing the filesystem, we1344 * have three distinct cases:1345 *1346 * - ignore it1347 * - see it as a directory1348 * - recurse into it1349 *1350 * and which one we choose depends on a combination of existing1351 * git index contents and the flags passed into the directory1352 * traversal routine.1353 *1354 * Case 1: If we *already* have entries in the index under that1355 * directory name, we always recurse into the directory to see1356 * all the files.1357 *1358 * Case 2: If we *already* have that directory name as a gitlink,1359 * we always continue to see it as a gitlink, regardless of whether1360 * there is an actual git directory there or not (it might not1361 * be checked out as a subproject!)1362 *1363 * Case 3: if we didn't have it in the index previously, we1364 * have a few sub-cases:1365 *1366 * (a) if "show_other_directories" is true, we show it as1367 * just a directory, unless "hide_empty_directories" is1368 * also true, in which case we need to check if it contains any1369 * untracked and / or ignored files.1370 * (b) if it looks like a git directory, and we don't have1371 * 'no_gitlinks' set we treat it as a gitlink, and show it1372 * as a directory.1373 * (c) otherwise, we recurse into it.1374 */1375static enum path_treatment treat_directory(struct dir_struct *dir,1376 struct index_state *istate,1377 struct untracked_cache_dir *untracked,1378 const char *dirname, int len, int baselen, int exclude,1379 const struct pathspec *pathspec)1380{1381 /* The "len-1" is to strip the final '/' */1382 switch (directory_exists_in_index(istate, dirname, len-1)) {1383 case index_directory:1384 return path_recurse;13851386 case index_gitdir:1387 return path_none;13881389 case index_nonexistent:1390 if (dir->flags & DIR_SHOW_OTHER_DIRECTORIES)1391 break;1392 if (exclude &&1393 (dir->flags & DIR_SHOW_IGNORED_TOO) &&1394 (dir->flags & DIR_SHOW_IGNORED_TOO_MODE_MATCHING)) {13951396 /*1397 * This is an excluded directory and we are1398 * showing ignored paths that match an exclude1399 * pattern. (e.g. show directory as ignored1400 * only if it matches an exclude pattern).1401 * This path will either be 'path_excluded`1402 * (if we are showing empty directories or if1403 * the directory is not empty), or will be1404 * 'path_none' (empty directory, and we are1405 * not showing empty directories).1406 */1407 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))1408 return path_excluded;14091410 if (read_directory_recursive(dir, istate, dirname, len,1411 untracked, 1, 1, pathspec) == path_excluded)1412 return path_excluded;14131414 return path_none;1415 }1416 if (!(dir->flags & DIR_NO_GITLINKS)) {1417 unsigned char sha1[20];1418 if (resolve_gitlink_ref(dirname, "HEAD", sha1) == 0)1419 return path_untracked;1420 }1421 return path_recurse;1422 }14231424 /* This is the "show_other_directories" case */14251426 if (!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))1427 return exclude ? path_excluded : path_untracked;14281429 untracked = lookup_untracked(dir->untracked, untracked,1430 dirname + baselen, len - baselen);14311432 /*1433 * If this is an excluded directory, then we only need to check if1434 * the directory contains any files.1435 */1436 return read_directory_recursive(dir, istate, dirname, len,1437 untracked, 1, exclude, pathspec);1438}14391440/*1441 * This is an inexact early pruning of any recursive directory1442 * reading - if the path cannot possibly be in the pathspec,1443 * return true, and we'll skip it early.1444 */1445static int simplify_away(const char *path, int pathlen,1446 const struct pathspec *pathspec)1447{1448 int i;14491450 if (!pathspec || !pathspec->nr)1451 return 0;14521453 GUARD_PATHSPEC(pathspec,1454 PATHSPEC_FROMTOP |1455 PATHSPEC_MAXDEPTH |1456 PATHSPEC_LITERAL |1457 PATHSPEC_GLOB |1458 PATHSPEC_ICASE |1459 PATHSPEC_EXCLUDE |1460 PATHSPEC_ATTR);14611462 for (i = 0; i < pathspec->nr; i++) {1463 const struct pathspec_item *item = &pathspec->items[i];1464 int len = item->nowildcard_len;14651466 if (len > pathlen)1467 len = pathlen;1468 if (!ps_strncmp(item, item->match, path, len))1469 return 0;1470 }14711472 return 1;1473}14741475/*1476 * This function tells us whether an excluded path matches a1477 * list of "interesting" pathspecs. That is, whether a path matched1478 * by any of the pathspecs could possibly be ignored by excluding1479 * the specified path. This can happen if:1480 *1481 * 1. the path is mentioned explicitly in the pathspec1482 *1483 * 2. the path is a directory prefix of some element in the1484 * pathspec1485 */1486static int exclude_matches_pathspec(const char *path, int pathlen,1487 const struct pathspec *pathspec)1488{1489 int i;14901491 if (!pathspec || !pathspec->nr)1492 return 0;14931494 GUARD_PATHSPEC(pathspec,1495 PATHSPEC_FROMTOP |1496 PATHSPEC_MAXDEPTH |1497 PATHSPEC_LITERAL |1498 PATHSPEC_GLOB |1499 PATHSPEC_ICASE |1500 PATHSPEC_EXCLUDE);15011502 for (i = 0; i < pathspec->nr; i++) {1503 const struct pathspec_item *item = &pathspec->items[i];1504 int len = item->nowildcard_len;15051506 if (len == pathlen &&1507 !ps_strncmp(item, item->match, path, pathlen))1508 return 1;1509 if (len > pathlen &&1510 item->match[pathlen] == '/' &&1511 !ps_strncmp(item, item->match, path, pathlen))1512 return 1;1513 }1514 return 0;1515}15161517static int get_index_dtype(struct index_state *istate,1518 const char *path, int len)1519{1520 int pos;1521 const struct cache_entry *ce;15221523 ce = index_file_exists(istate, path, len, 0);1524 if (ce) {1525 if (!ce_uptodate(ce))1526 return DT_UNKNOWN;1527 if (S_ISGITLINK(ce->ce_mode))1528 return DT_DIR;1529 /*1530 * Nobody actually cares about the1531 * difference between DT_LNK and DT_REG1532 */1533 return DT_REG;1534 }15351536 /* Try to look it up as a directory */1537 pos = index_name_pos(istate, path, len);1538 if (pos >= 0)1539 return DT_UNKNOWN;1540 pos = -pos-1;1541 while (pos < istate->cache_nr) {1542 ce = istate->cache[pos++];1543 if (strncmp(ce->name, path, len))1544 break;1545 if (ce->name[len] > '/')1546 break;1547 if (ce->name[len] < '/')1548 continue;1549 if (!ce_uptodate(ce))1550 break; /* continue? */1551 return DT_DIR;1552 }1553 return DT_UNKNOWN;1554}15551556static int get_dtype(struct dirent *de, struct index_state *istate,1557 const char *path, int len)1558{1559 int dtype = de ? DTYPE(de) : DT_UNKNOWN;1560 struct stat st;15611562 if (dtype != DT_UNKNOWN)1563 return dtype;1564 dtype = get_index_dtype(istate, path, len);1565 if (dtype != DT_UNKNOWN)1566 return dtype;1567 if (lstat(path, &st))1568 return dtype;1569 if (S_ISREG(st.st_mode))1570 return DT_REG;1571 if (S_ISDIR(st.st_mode))1572 return DT_DIR;1573 if (S_ISLNK(st.st_mode))1574 return DT_LNK;1575 return dtype;1576}15771578static enum path_treatment treat_one_path(struct dir_struct *dir,1579 struct untracked_cache_dir *untracked,1580 struct index_state *istate,1581 struct strbuf *path,1582 int baselen,1583 const struct pathspec *pathspec,1584 int dtype, struct dirent *de)1585{1586 int exclude;1587 int has_path_in_index = !!index_file_exists(istate, path->buf, path->len, ignore_case);15881589 if (dtype == DT_UNKNOWN)1590 dtype = get_dtype(de, istate, path->buf, path->len);15911592 /* Always exclude indexed files */1593 if (dtype != DT_DIR && has_path_in_index)1594 return path_none;15951596 /*1597 * When we are looking at a directory P in the working tree,1598 * there are three cases:1599 *1600 * (1) P exists in the index. Everything inside the directory P in1601 * the working tree needs to go when P is checked out from the1602 * index.1603 *1604 * (2) P does not exist in the index, but there is P/Q in the index.1605 * We know P will stay a directory when we check out the contents1606 * of the index, but we do not know yet if there is a directory1607 * P/Q in the working tree to be killed, so we need to recurse.1608 *1609 * (3) P does not exist in the index, and there is no P/Q in the index1610 * to require P to be a directory, either. Only in this case, we1611 * know that everything inside P will not be killed without1612 * recursing.1613 */1614 if ((dir->flags & DIR_COLLECT_KILLED_ONLY) &&1615 (dtype == DT_DIR) &&1616 !has_path_in_index &&1617 (directory_exists_in_index(istate, path->buf, path->len) == index_nonexistent))1618 return path_none;16191620 exclude = is_excluded(dir, istate, path->buf, &dtype);16211622 /*1623 * Excluded? If we don't explicitly want to show1624 * ignored files, ignore it1625 */1626 if (exclude && !(dir->flags & (DIR_SHOW_IGNORED|DIR_SHOW_IGNORED_TOO)))1627 return path_excluded;16281629 switch (dtype) {1630 default:1631 return path_none;1632 case DT_DIR:1633 strbuf_addch(path, '/');1634 return treat_directory(dir, istate, untracked, path->buf, path->len,1635 baselen, exclude, pathspec);1636 case DT_REG:1637 case DT_LNK:1638 return exclude ? path_excluded : path_untracked;1639 }1640}16411642static enum path_treatment treat_path_fast(struct dir_struct *dir,1643 struct untracked_cache_dir *untracked,1644 struct cached_dir *cdir,1645 struct index_state *istate,1646 struct strbuf *path,1647 int baselen,1648 const struct pathspec *pathspec)1649{1650 strbuf_setlen(path, baselen);1651 if (!cdir->ucd) {1652 strbuf_addstr(path, cdir->file);1653 return path_untracked;1654 }1655 strbuf_addstr(path, cdir->ucd->name);1656 /* treat_one_path() does this before it calls treat_directory() */1657 strbuf_complete(path, '/');1658 if (cdir->ucd->check_only)1659 /*1660 * check_only is set as a result of treat_directory() getting1661 * to its bottom. Verify again the same set of directories1662 * with check_only set.1663 */1664 return read_directory_recursive(dir, istate, path->buf, path->len,1665 cdir->ucd, 1, 0, pathspec);1666 /*1667 * We get path_recurse in the first run when1668 * directory_exists_in_index() returns index_nonexistent. We1669 * are sure that new changes in the index does not impact the1670 * outcome. Return now.1671 */1672 return path_recurse;1673}16741675static enum path_treatment treat_path(struct dir_struct *dir,1676 struct untracked_cache_dir *untracked,1677 struct cached_dir *cdir,1678 struct index_state *istate,1679 struct strbuf *path,1680 int baselen,1681 const struct pathspec *pathspec)1682{1683 int dtype;1684 struct dirent *de = cdir->de;16851686 if (!de)1687 return treat_path_fast(dir, untracked, cdir, istate, path,1688 baselen, pathspec);1689 if (is_dot_or_dotdot(de->d_name) || !strcmp(de->d_name, ".git"))1690 return path_none;1691 strbuf_setlen(path, baselen);1692 strbuf_addstr(path, de->d_name);1693 if (simplify_away(path->buf, path->len, pathspec))1694 return path_none;16951696 dtype = DTYPE(de);1697 return treat_one_path(dir, untracked, istate, path, baselen, pathspec, dtype, de);1698}16991700static void add_untracked(struct untracked_cache_dir *dir, const char *name)1701{1702 if (!dir)1703 return;1704 ALLOC_GROW(dir->untracked, dir->untracked_nr + 1,1705 dir->untracked_alloc);1706 dir->untracked[dir->untracked_nr++] = xstrdup(name);1707}17081709static int valid_cached_dir(struct dir_struct *dir,1710 struct untracked_cache_dir *untracked,1711 struct index_state *istate,1712 struct strbuf *path,1713 int check_only)1714{1715 struct stat st;17161717 if (!untracked)1718 return 0;17191720 if (stat(path->len ? path->buf : ".", &st)) {1721 invalidate_directory(dir->untracked, untracked);1722 memset(&untracked->stat_data, 0, sizeof(untracked->stat_data));1723 return 0;1724 }1725 if (!untracked->valid ||1726 match_stat_data_racy(istate, &untracked->stat_data, &st)) {1727 if (untracked->valid)1728 invalidate_directory(dir->untracked, untracked);1729 fill_stat_data(&untracked->stat_data, &st);1730 return 0;1731 }17321733 if (untracked->check_only != !!check_only) {1734 invalidate_directory(dir->untracked, untracked);1735 return 0;1736 }17371738 /*1739 * prep_exclude will be called eventually on this directory,1740 * but it's called much later in last_exclude_matching(). We1741 * need it now to determine the validity of the cache for this1742 * path. The next calls will be nearly no-op, the way1743 * prep_exclude() is designed.1744 */1745 if (path->len && path->buf[path->len - 1] != '/') {1746 strbuf_addch(path, '/');1747 prep_exclude(dir, istate, path->buf, path->len);1748 strbuf_setlen(path, path->len - 1);1749 } else1750 prep_exclude(dir, istate, path->buf, path->len);17511752 /* hopefully prep_exclude() haven't invalidated this entry... */1753 return untracked->valid;1754}17551756static int open_cached_dir(struct cached_dir *cdir,1757 struct dir_struct *dir,1758 struct untracked_cache_dir *untracked,1759 struct index_state *istate,1760 struct strbuf *path,1761 int check_only)1762{1763 memset(cdir, 0, sizeof(*cdir));1764 cdir->untracked = untracked;1765 if (valid_cached_dir(dir, untracked, istate, path, check_only))1766 return 0;1767 cdir->fdir = opendir(path->len ? path->buf : ".");1768 if (dir->untracked)1769 dir->untracked->dir_opened++;1770 if (!cdir->fdir)1771 return -1;1772 return 0;1773}17741775static int read_cached_dir(struct cached_dir *cdir)1776{1777 if (cdir->fdir) {1778 cdir->de = readdir(cdir->fdir);1779 if (!cdir->de)1780 return -1;1781 return 0;1782 }1783 while (cdir->nr_dirs < cdir->untracked->dirs_nr) {1784 struct untracked_cache_dir *d = cdir->untracked->dirs[cdir->nr_dirs];1785 if (!d->recurse) {1786 cdir->nr_dirs++;1787 continue;1788 }1789 cdir->ucd = d;1790 cdir->nr_dirs++;1791 return 0;1792 }1793 cdir->ucd = NULL;1794 if (cdir->nr_files < cdir->untracked->untracked_nr) {1795 struct untracked_cache_dir *d = cdir->untracked;1796 cdir->file = d->untracked[cdir->nr_files++];1797 return 0;1798 }1799 return -1;1800}18011802static void close_cached_dir(struct cached_dir *cdir)1803{1804 if (cdir->fdir)1805 closedir(cdir->fdir);1806 /*1807 * We have gone through this directory and found no untracked1808 * entries. Mark it valid.1809 */1810 if (cdir->untracked) {1811 cdir->untracked->valid = 1;1812 cdir->untracked->recurse = 1;1813 }1814}18151816/*1817 * Read a directory tree. We currently ignore anything but1818 * directories, regular files and symlinks. That's because git1819 * doesn't handle them at all yet. Maybe that will change some1820 * day.1821 *1822 * Also, we ignore the name ".git" (even if it is not a directory).1823 * That likely will not change.1824 *1825 * If 'stop_at_first_file' is specified, 'path_excluded' is returned1826 * to signal that a file was found. This is the least significant value that1827 * indicates that a file was encountered that does not depend on the order of1828 * whether an untracked or exluded path was encountered first.1829 *1830 * Returns the most significant path_treatment value encountered in the scan.1831 * If 'stop_at_first_file' is specified, `path_excluded` is the most1832 * significant path_treatment value that will be returned.1833 */18341835static enum path_treatment read_directory_recursive(struct dir_struct *dir,1836 struct index_state *istate, const char *base, int baselen,1837 struct untracked_cache_dir *untracked, int check_only,1838 int stop_at_first_file, const struct pathspec *pathspec)1839{1840 struct cached_dir cdir;1841 enum path_treatment state, subdir_state, dir_state = path_none;1842 struct strbuf path = STRBUF_INIT;18431844 strbuf_add(&path, base, baselen);18451846 if (open_cached_dir(&cdir, dir, untracked, istate, &path, check_only))1847 goto out;18481849 if (untracked)1850 untracked->check_only = !!check_only;18511852 while (!read_cached_dir(&cdir)) {1853 /* check how the file or directory should be treated */1854 state = treat_path(dir, untracked, &cdir, istate, &path,1855 baselen, pathspec);18561857 if (state > dir_state)1858 dir_state = state;18591860 /* recurse into subdir if instructed by treat_path */1861 if ((state == path_recurse) ||1862 ((state == path_untracked) &&1863 (dir->flags & DIR_SHOW_IGNORED_TOO) &&1864 (get_dtype(cdir.de, istate, path.buf, path.len) == DT_DIR))) {1865 struct untracked_cache_dir *ud;1866 ud = lookup_untracked(dir->untracked, untracked,1867 path.buf + baselen,1868 path.len - baselen);1869 subdir_state =1870 read_directory_recursive(dir, istate, path.buf,1871 path.len, ud,1872 check_only, stop_at_first_file, pathspec);1873 if (subdir_state > dir_state)1874 dir_state = subdir_state;1875 }18761877 if (check_only) {1878 if (stop_at_first_file) {1879 /*1880 * If stopping at first file, then1881 * signal that a file was found by1882 * returning `path_excluded`. This is1883 * to return a consistent value1884 * regardless of whether an ignored or1885 * excluded file happened to be1886 * encountered 1st.1887 *1888 * In current usage, the1889 * `stop_at_first_file` is passed when1890 * an ancestor directory has matched1891 * an exclude pattern, so any found1892 * files will be excluded.1893 */1894 if (dir_state >= path_excluded) {1895 dir_state = path_excluded;1896 break;1897 }1898 }18991900 /* abort early if maximum state has been reached */1901 if (dir_state == path_untracked) {1902 if (cdir.fdir)1903 add_untracked(untracked, path.buf + baselen);1904 break;1905 }1906 /* skip the dir_add_* part */1907 continue;1908 }19091910 /* add the path to the appropriate result list */1911 switch (state) {1912 case path_excluded:1913 if (dir->flags & DIR_SHOW_IGNORED)1914 dir_add_name(dir, istate, path.buf, path.len);1915 else if ((dir->flags & DIR_SHOW_IGNORED_TOO) ||1916 ((dir->flags & DIR_COLLECT_IGNORED) &&1917 exclude_matches_pathspec(path.buf, path.len,1918 pathspec)))1919 dir_add_ignored(dir, istate, path.buf, path.len);1920 break;19211922 case path_untracked:1923 if (dir->flags & DIR_SHOW_IGNORED)1924 break;1925 dir_add_name(dir, istate, path.buf, path.len);1926 if (cdir.fdir)1927 add_untracked(untracked, path.buf + baselen);1928 break;19291930 default:1931 break;1932 }1933 }1934 close_cached_dir(&cdir);1935 out:1936 strbuf_release(&path);19371938 return dir_state;1939}19401941int cmp_dir_entry(const void *p1, const void *p2)1942{1943 const struct dir_entry *e1 = *(const struct dir_entry **)p1;1944 const struct dir_entry *e2 = *(const struct dir_entry **)p2;19451946 return name_compare(e1->name, e1->len, e2->name, e2->len);1947}19481949/* check if *out lexically strictly contains *in */1950int check_dir_entry_contains(const struct dir_entry *out, const struct dir_entry *in)1951{1952 return (out->len < in->len) &&1953 (out->name[out->len - 1] == '/') &&1954 !memcmp(out->name, in->name, out->len);1955}19561957static int treat_leading_path(struct dir_struct *dir,1958 struct index_state *istate,1959 const char *path, int len,1960 const struct pathspec *pathspec)1961{1962 struct strbuf sb = STRBUF_INIT;1963 int baselen, rc = 0;1964 const char *cp;1965 int old_flags = dir->flags;19661967 while (len && path[len - 1] == '/')1968 len--;1969 if (!len)1970 return 1;1971 baselen = 0;1972 dir->flags &= ~DIR_SHOW_OTHER_DIRECTORIES;1973 while (1) {1974 cp = path + baselen + !!baselen;1975 cp = memchr(cp, '/', path + len - cp);1976 if (!cp)1977 baselen = len;1978 else1979 baselen = cp - path;1980 strbuf_setlen(&sb, 0);1981 strbuf_add(&sb, path, baselen);1982 if (!is_directory(sb.buf))1983 break;1984 if (simplify_away(sb.buf, sb.len, pathspec))1985 break;1986 if (treat_one_path(dir, NULL, istate, &sb, baselen, pathspec,1987 DT_DIR, NULL) == path_none)1988 break; /* do not recurse into it */1989 if (len <= baselen) {1990 rc = 1;1991 break; /* finished checking */1992 }1993 }1994 strbuf_release(&sb);1995 dir->flags = old_flags;1996 return rc;1997}19981999static const char *get_ident_string(void)2000{2001 static struct strbuf sb = STRBUF_INIT;2002 struct utsname uts;20032004 if (sb.len)2005 return sb.buf;2006 if (uname(&uts) < 0)2007 die_errno(_("failed to get kernel name and information"));2008 strbuf_addf(&sb, "Location %s, system %s", get_git_work_tree(),2009 uts.sysname);2010 return sb.buf;2011}20122013static int ident_in_untracked(const struct untracked_cache *uc)2014{2015 /*2016 * Previous git versions may have saved many NUL separated2017 * strings in the "ident" field, but it is insane to manage2018 * many locations, so just take care of the first one.2019 */20202021 return !strcmp(uc->ident.buf, get_ident_string());2022}20232024static void set_untracked_ident(struct untracked_cache *uc)2025{2026 strbuf_reset(&uc->ident);2027 strbuf_addstr(&uc->ident, get_ident_string());20282029 /*2030 * This strbuf used to contain a list of NUL separated2031 * strings, so save NUL too for backward compatibility.2032 */2033 strbuf_addch(&uc->ident, 0);2034}20352036static void new_untracked_cache(struct index_state *istate)2037{2038 struct untracked_cache *uc = xcalloc(1, sizeof(*uc));2039 strbuf_init(&uc->ident, 100);2040 uc->exclude_per_dir = ".gitignore";2041 /* should be the same flags used by git-status */2042 uc->dir_flags = DIR_SHOW_OTHER_DIRECTORIES | DIR_HIDE_EMPTY_DIRECTORIES;2043 set_untracked_ident(uc);2044 istate->untracked = uc;2045 istate->cache_changed |= UNTRACKED_CHANGED;2046}20472048void add_untracked_cache(struct index_state *istate)2049{2050 if (!istate->untracked) {2051 new_untracked_cache(istate);2052 } else {2053 if (!ident_in_untracked(istate->untracked)) {2054 free_untracked_cache(istate->untracked);2055 new_untracked_cache(istate);2056 }2057 }2058}20592060void remove_untracked_cache(struct index_state *istate)2061{2062 if (istate->untracked) {2063 free_untracked_cache(istate->untracked);2064 istate->untracked = NULL;2065 istate->cache_changed |= UNTRACKED_CHANGED;2066 }2067}20682069static struct untracked_cache_dir *validate_untracked_cache(struct dir_struct *dir,2070 int base_len,2071 const struct pathspec *pathspec)2072{2073 struct untracked_cache_dir *root;20742075 if (!dir->untracked || getenv("GIT_DISABLE_UNTRACKED_CACHE"))2076 return NULL;20772078 /*2079 * We only support $GIT_DIR/info/exclude and core.excludesfile2080 * as the global ignore rule files. Any other additions2081 * (e.g. from command line) invalidate the cache. This2082 * condition also catches running setup_standard_excludes()2083 * before setting dir->untracked!2084 */2085 if (dir->unmanaged_exclude_files)2086 return NULL;20872088 /*2089 * Optimize for the main use case only: whole-tree git2090 * status. More work involved in treat_leading_path() if we2091 * use cache on just a subset of the worktree. pathspec2092 * support could make the matter even worse.2093 */2094 if (base_len || (pathspec && pathspec->nr))2095 return NULL;20962097 /* Different set of flags may produce different results */2098 if (dir->flags != dir->untracked->dir_flags ||2099 /*2100 * See treat_directory(), case index_nonexistent. Without2101 * this flag, we may need to also cache .git file content2102 * for the resolve_gitlink_ref() call, which we don't.2103 */2104 !(dir->flags & DIR_SHOW_OTHER_DIRECTORIES) ||2105 /* We don't support collecting ignore files */2106 (dir->flags & (DIR_SHOW_IGNORED | DIR_SHOW_IGNORED_TOO |2107 DIR_COLLECT_IGNORED)))2108 return NULL;21092110 /*2111 * If we use .gitignore in the cache and now you change it to2112 * .gitexclude, everything will go wrong.2113 */2114 if (dir->exclude_per_dir != dir->untracked->exclude_per_dir &&2115 strcmp(dir->exclude_per_dir, dir->untracked->exclude_per_dir))2116 return NULL;21172118 /*2119 * EXC_CMDL is not considered in the cache. If people set it,2120 * skip the cache.2121 */2122 if (dir->exclude_list_group[EXC_CMDL].nr)2123 return NULL;21242125 if (!ident_in_untracked(dir->untracked)) {2126 warning(_("Untracked cache is disabled on this system or location."));2127 return NULL;2128 }21292130 if (!dir->untracked->root) {2131 const int len = sizeof(*dir->untracked->root);2132 dir->untracked->root = xmalloc(len);2133 memset(dir->untracked->root, 0, len);2134 }21352136 /* Validate $GIT_DIR/info/exclude and core.excludesfile */2137 root = dir->untracked->root;2138 if (hashcmp(dir->ss_info_exclude.sha1,2139 dir->untracked->ss_info_exclude.sha1)) {2140 invalidate_gitignore(dir->untracked, root);2141 dir->untracked->ss_info_exclude = dir->ss_info_exclude;2142 }2143 if (hashcmp(dir->ss_excludes_file.sha1,2144 dir->untracked->ss_excludes_file.sha1)) {2145 invalidate_gitignore(dir->untracked, root);2146 dir->untracked->ss_excludes_file = dir->ss_excludes_file;2147 }21482149 /* Make sure this directory is not dropped out at saving phase */2150 root->recurse = 1;2151 return root;2152}21532154int read_directory(struct dir_struct *dir, struct index_state *istate,2155 const char *path, int len, const struct pathspec *pathspec)2156{2157 struct untracked_cache_dir *untracked;21582159 if (has_symlink_leading_path(path, len))2160 return dir->nr;21612162 untracked = validate_untracked_cache(dir, len, pathspec);2163 if (!untracked)2164 /*2165 * make sure untracked cache code path is disabled,2166 * e.g. prep_exclude()2167 */2168 dir->untracked = NULL;2169 if (!len || treat_leading_path(dir, istate, path, len, pathspec))2170 read_directory_recursive(dir, istate, path, len, untracked, 0, 0, pathspec);2171 QSORT(dir->entries, dir->nr, cmp_dir_entry);2172 QSORT(dir->ignored, dir->ignored_nr, cmp_dir_entry);21732174 /*2175 * If DIR_SHOW_IGNORED_TOO is set, read_directory_recursive() will2176 * also pick up untracked contents of untracked dirs; by default2177 * we discard these, but given DIR_KEEP_UNTRACKED_CONTENTS we do not.2178 */2179 if ((dir->flags & DIR_SHOW_IGNORED_TOO) &&2180 !(dir->flags & DIR_KEEP_UNTRACKED_CONTENTS)) {2181 int i, j;21822183 /* remove from dir->entries untracked contents of untracked dirs */2184 for (i = j = 0; j < dir->nr; j++) {2185 if (i &&2186 check_dir_entry_contains(dir->entries[i - 1], dir->entries[j])) {2187 FREE_AND_NULL(dir->entries[j]);2188 } else {2189 dir->entries[i++] = dir->entries[j];2190 }2191 }21922193 dir->nr = i;2194 }21952196 if (dir->untracked) {2197 static struct trace_key trace_untracked_stats = TRACE_KEY_INIT(UNTRACKED_STATS);2198 trace_printf_key(&trace_untracked_stats,2199 "node creation: %u\n"2200 "gitignore invalidation: %u\n"2201 "directory invalidation: %u\n"2202 "opendir: %u\n",2203 dir->untracked->dir_created,2204 dir->untracked->gitignore_invalidated,2205 dir->untracked->dir_invalidated,2206 dir->untracked->dir_opened);2207 if (dir->untracked == istate->untracked &&2208 (dir->untracked->dir_opened ||2209 dir->untracked->gitignore_invalidated ||2210 dir->untracked->dir_invalidated))2211 istate->cache_changed |= UNTRACKED_CHANGED;2212 if (dir->untracked != istate->untracked) {2213 FREE_AND_NULL(dir->untracked);2214 }2215 }2216 return dir->nr;2217}22182219int file_exists(const char *f)2220{2221 struct stat sb;2222 return lstat(f, &sb) == 0;2223}22242225static int cmp_icase(char a, char b)2226{2227 if (a == b)2228 return 0;2229 if (ignore_case)2230 return toupper(a) - toupper(b);2231 return a - b;2232}22332234/*2235 * Given two normalized paths (a trailing slash is ok), if subdir is2236 * outside dir, return -1. Otherwise return the offset in subdir that2237 * can be used as relative path to dir.2238 */2239int dir_inside_of(const char *subdir, const char *dir)2240{2241 int offset = 0;22422243 assert(dir && subdir && *dir && *subdir);22442245 while (*dir && *subdir && !cmp_icase(*dir, *subdir)) {2246 dir++;2247 subdir++;2248 offset++;2249 }22502251 /* hel[p]/me vs hel[l]/yeah */2252 if (*dir && *subdir)2253 return -1;22542255 if (!*subdir)2256 return !*dir ? offset : -1; /* same dir */22572258 /* foo/[b]ar vs foo/[] */2259 if (is_dir_sep(dir[-1]))2260 return is_dir_sep(subdir[-1]) ? offset : -1;22612262 /* foo[/]bar vs foo[] */2263 return is_dir_sep(*subdir) ? offset + 1 : -1;2264}22652266int is_inside_dir(const char *dir)2267{2268 char *cwd;2269 int rc;22702271 if (!dir)2272 return 0;22732274 cwd = xgetcwd();2275 rc = (dir_inside_of(cwd, dir) >= 0);2276 free(cwd);2277 return rc;2278}22792280int is_empty_dir(const char *path)2281{2282 DIR *dir = opendir(path);2283 struct dirent *e;2284 int ret = 1;22852286 if (!dir)2287 return 0;22882289 while ((e = readdir(dir)) != NULL)2290 if (!is_dot_or_dotdot(e->d_name)) {2291 ret = 0;2292 break;2293 }22942295 closedir(dir);2296 return ret;2297}22982299static int remove_dir_recurse(struct strbuf *path, int flag, int *kept_up)2300{2301 DIR *dir;2302 struct dirent *e;2303 int ret = 0, original_len = path->len, len, kept_down = 0;2304 int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY);2305 int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL);2306 unsigned char submodule_head[20];23072308 if ((flag & REMOVE_DIR_KEEP_NESTED_GIT) &&2309 !resolve_gitlink_ref(path->buf, "HEAD", submodule_head)) {2310 /* Do not descend and nuke a nested git work tree. */2311 if (kept_up)2312 *kept_up = 1;2313 return 0;2314 }23152316 flag &= ~REMOVE_DIR_KEEP_TOPLEVEL;2317 dir = opendir(path->buf);2318 if (!dir) {2319 if (errno == ENOENT)2320 return keep_toplevel ? -1 : 0;2321 else if (errno == EACCES && !keep_toplevel)2322 /*2323 * An empty dir could be removable even if it2324 * is unreadable:2325 */2326 return rmdir(path->buf);2327 else2328 return -1;2329 }2330 strbuf_complete(path, '/');23312332 len = path->len;2333 while ((e = readdir(dir)) != NULL) {2334 struct stat st;2335 if (is_dot_or_dotdot(e->d_name))2336 continue;23372338 strbuf_setlen(path, len);2339 strbuf_addstr(path, e->d_name);2340 if (lstat(path->buf, &st)) {2341 if (errno == ENOENT)2342 /*2343 * file disappeared, which is what we2344 * wanted anyway2345 */2346 continue;2347 /* fall thru */2348 } else if (S_ISDIR(st.st_mode)) {2349 if (!remove_dir_recurse(path, flag, &kept_down))2350 continue; /* happy */2351 } else if (!only_empty &&2352 (!unlink(path->buf) || errno == ENOENT)) {2353 continue; /* happy, too */2354 }23552356 /* path too long, stat fails, or non-directory still exists */2357 ret = -1;2358 break;2359 }2360 closedir(dir);23612362 strbuf_setlen(path, original_len);2363 if (!ret && !keep_toplevel && !kept_down)2364 ret = (!rmdir(path->buf) || errno == ENOENT) ? 0 : -1;2365 else if (kept_up)2366 /*2367 * report the uplevel that it is not an error that we2368 * did not rmdir() our directory.2369 */2370 *kept_up = !ret;2371 return ret;2372}23732374int remove_dir_recursively(struct strbuf *path, int flag)2375{2376 return remove_dir_recurse(path, flag, NULL);2377}23782379static GIT_PATH_FUNC(git_path_info_exclude, "info/exclude")23802381void setup_standard_excludes(struct dir_struct *dir)2382{2383 dir->exclude_per_dir = ".gitignore";23842385 /* core.excludefile defaulting to $XDG_HOME/git/ignore */2386 if (!excludes_file)2387 excludes_file = xdg_config_home("ignore");2388 if (excludes_file && !access_or_warn(excludes_file, R_OK, 0))2389 add_excludes_from_file_1(dir, excludes_file,2390 dir->untracked ? &dir->ss_excludes_file : NULL);23912392 /* per repository user preference */2393 if (startup_info->have_repository) {2394 const char *path = git_path_info_exclude();2395 if (!access_or_warn(path, R_OK, 0))2396 add_excludes_from_file_1(dir, path,2397 dir->untracked ? &dir->ss_info_exclude : NULL);2398 }2399}24002401int remove_path(const char *name)2402{2403 char *slash;24042405 if (unlink(name) && !is_missing_file_error(errno))2406 return -1;24072408 slash = strrchr(name, '/');2409 if (slash) {2410 char *dirs = xstrdup(name);2411 slash = dirs + (slash - name);2412 do {2413 *slash = '\0';2414 } while (rmdir(dirs) == 0 && (slash = strrchr(dirs, '/')));2415 free(dirs);2416 }2417 return 0;2418}24192420/*2421 * Frees memory within dir which was allocated for exclude lists and2422 * the exclude_stack. Does not free dir itself.2423 */2424void clear_directory(struct dir_struct *dir)2425{2426 int i, j;2427 struct exclude_list_group *group;2428 struct exclude_list *el;2429 struct exclude_stack *stk;24302431 for (i = EXC_CMDL; i <= EXC_FILE; i++) {2432 group = &dir->exclude_list_group[i];2433 for (j = 0; j < group->nr; j++) {2434 el = &group->el[j];2435 if (i == EXC_DIRS)2436 free((char *)el->src);2437 clear_exclude_list(el);2438 }2439 free(group->el);2440 }24412442 stk = dir->exclude_stack;2443 while (stk) {2444 struct exclude_stack *prev = stk->prev;2445 free(stk);2446 stk = prev;2447 }2448 strbuf_release(&dir->basebuf);2449}24502451struct ondisk_untracked_cache {2452 struct stat_data info_exclude_stat;2453 struct stat_data excludes_file_stat;2454 uint32_t dir_flags;2455 unsigned char info_exclude_sha1[20];2456 unsigned char excludes_file_sha1[20];2457 char exclude_per_dir[FLEX_ARRAY];2458};24592460#define ouc_offset(x) offsetof(struct ondisk_untracked_cache, x)2461#define ouc_size(len) (ouc_offset(exclude_per_dir) + len + 1)24622463struct write_data {2464 int index; /* number of written untracked_cache_dir */2465 struct ewah_bitmap *check_only; /* from untracked_cache_dir */2466 struct ewah_bitmap *valid; /* from untracked_cache_dir */2467 struct ewah_bitmap *sha1_valid; /* set if exclude_sha1 is not null */2468 struct strbuf out;2469 struct strbuf sb_stat;2470 struct strbuf sb_sha1;2471};24722473static void stat_data_to_disk(struct stat_data *to, const struct stat_data *from)2474{2475 to->sd_ctime.sec = htonl(from->sd_ctime.sec);2476 to->sd_ctime.nsec = htonl(from->sd_ctime.nsec);2477 to->sd_mtime.sec = htonl(from->sd_mtime.sec);2478 to->sd_mtime.nsec = htonl(from->sd_mtime.nsec);2479 to->sd_dev = htonl(from->sd_dev);2480 to->sd_ino = htonl(from->sd_ino);2481 to->sd_uid = htonl(from->sd_uid);2482 to->sd_gid = htonl(from->sd_gid);2483 to->sd_size = htonl(from->sd_size);2484}24852486static void write_one_dir(struct untracked_cache_dir *untracked,2487 struct write_data *wd)2488{2489 struct stat_data stat_data;2490 struct strbuf *out = &wd->out;2491 unsigned char intbuf[16];2492 unsigned int intlen, value;2493 int i = wd->index++;24942495 /*2496 * untracked_nr should be reset whenever valid is clear, but2497 * for safety..2498 */2499 if (!untracked->valid) {2500 untracked->untracked_nr = 0;2501 untracked->check_only = 0;2502 }25032504 if (untracked->check_only)2505 ewah_set(wd->check_only, i);2506 if (untracked->valid) {2507 ewah_set(wd->valid, i);2508 stat_data_to_disk(&stat_data, &untracked->stat_data);2509 strbuf_add(&wd->sb_stat, &stat_data, sizeof(stat_data));2510 }2511 if (!is_null_sha1(untracked->exclude_sha1)) {2512 ewah_set(wd->sha1_valid, i);2513 strbuf_add(&wd->sb_sha1, untracked->exclude_sha1, 20);2514 }25152516 intlen = encode_varint(untracked->untracked_nr, intbuf);2517 strbuf_add(out, intbuf, intlen);25182519 /* skip non-recurse directories */2520 for (i = 0, value = 0; i < untracked->dirs_nr; i++)2521 if (untracked->dirs[i]->recurse)2522 value++;2523 intlen = encode_varint(value, intbuf);2524 strbuf_add(out, intbuf, intlen);25252526 strbuf_add(out, untracked->name, strlen(untracked->name) + 1);25272528 for (i = 0; i < untracked->untracked_nr; i++)2529 strbuf_add(out, untracked->untracked[i],2530 strlen(untracked->untracked[i]) + 1);25312532 for (i = 0; i < untracked->dirs_nr; i++)2533 if (untracked->dirs[i]->recurse)2534 write_one_dir(untracked->dirs[i], wd);2535}25362537void write_untracked_extension(struct strbuf *out, struct untracked_cache *untracked)2538{2539 struct ondisk_untracked_cache *ouc;2540 struct write_data wd;2541 unsigned char varbuf[16];2542 int varint_len;2543 size_t len = strlen(untracked->exclude_per_dir);25442545 FLEX_ALLOC_MEM(ouc, exclude_per_dir, untracked->exclude_per_dir, len);2546 stat_data_to_disk(&ouc->info_exclude_stat, &untracked->ss_info_exclude.stat);2547 stat_data_to_disk(&ouc->excludes_file_stat, &untracked->ss_excludes_file.stat);2548 hashcpy(ouc->info_exclude_sha1, untracked->ss_info_exclude.sha1);2549 hashcpy(ouc->excludes_file_sha1, untracked->ss_excludes_file.sha1);2550 ouc->dir_flags = htonl(untracked->dir_flags);25512552 varint_len = encode_varint(untracked->ident.len, varbuf);2553 strbuf_add(out, varbuf, varint_len);2554 strbuf_addbuf(out, &untracked->ident);25552556 strbuf_add(out, ouc, ouc_size(len));2557 FREE_AND_NULL(ouc);25582559 if (!untracked->root) {2560 varint_len = encode_varint(0, varbuf);2561 strbuf_add(out, varbuf, varint_len);2562 return;2563 }25642565 wd.index = 0;2566 wd.check_only = ewah_new();2567 wd.valid = ewah_new();2568 wd.sha1_valid = ewah_new();2569 strbuf_init(&wd.out, 1024);2570 strbuf_init(&wd.sb_stat, 1024);2571 strbuf_init(&wd.sb_sha1, 1024);2572 write_one_dir(untracked->root, &wd);25732574 varint_len = encode_varint(wd.index, varbuf);2575 strbuf_add(out, varbuf, varint_len);2576 strbuf_addbuf(out, &wd.out);2577 ewah_serialize_strbuf(wd.valid, out);2578 ewah_serialize_strbuf(wd.check_only, out);2579 ewah_serialize_strbuf(wd.sha1_valid, out);2580 strbuf_addbuf(out, &wd.sb_stat);2581 strbuf_addbuf(out, &wd.sb_sha1);2582 strbuf_addch(out, '\0'); /* safe guard for string lists */25832584 ewah_free(wd.valid);2585 ewah_free(wd.check_only);2586 ewah_free(wd.sha1_valid);2587 strbuf_release(&wd.out);2588 strbuf_release(&wd.sb_stat);2589 strbuf_release(&wd.sb_sha1);2590}25912592static void free_untracked(struct untracked_cache_dir *ucd)2593{2594 int i;2595 if (!ucd)2596 return;2597 for (i = 0; i < ucd->dirs_nr; i++)2598 free_untracked(ucd->dirs[i]);2599 for (i = 0; i < ucd->untracked_nr; i++)2600 free(ucd->untracked[i]);2601 free(ucd->untracked);2602 free(ucd->dirs);2603 free(ucd);2604}26052606void free_untracked_cache(struct untracked_cache *uc)2607{2608 if (uc)2609 free_untracked(uc->root);2610 free(uc);2611}26122613struct read_data {2614 int index;2615 struct untracked_cache_dir **ucd;2616 struct ewah_bitmap *check_only;2617 struct ewah_bitmap *valid;2618 struct ewah_bitmap *sha1_valid;2619 const unsigned char *data;2620 const unsigned char *end;2621};26222623static void stat_data_from_disk(struct stat_data *to, const unsigned char *data)2624{2625 memcpy(to, data, sizeof(*to));2626 to->sd_ctime.sec = ntohl(to->sd_ctime.sec);2627 to->sd_ctime.nsec = ntohl(to->sd_ctime.nsec);2628 to->sd_mtime.sec = ntohl(to->sd_mtime.sec);2629 to->sd_mtime.nsec = ntohl(to->sd_mtime.nsec);2630 to->sd_dev = ntohl(to->sd_dev);2631 to->sd_ino = ntohl(to->sd_ino);2632 to->sd_uid = ntohl(to->sd_uid);2633 to->sd_gid = ntohl(to->sd_gid);2634 to->sd_size = ntohl(to->sd_size);2635}26362637static int read_one_dir(struct untracked_cache_dir **untracked_,2638 struct read_data *rd)2639{2640 struct untracked_cache_dir ud, *untracked;2641 const unsigned char *next, *data = rd->data, *end = rd->end;2642 unsigned int value;2643 int i, len;26442645 memset(&ud, 0, sizeof(ud));26462647 next = data;2648 value = decode_varint(&next);2649 if (next > end)2650 return -1;2651 ud.recurse = 1;2652 ud.untracked_alloc = value;2653 ud.untracked_nr = value;2654 if (ud.untracked_nr)2655 ALLOC_ARRAY(ud.untracked, ud.untracked_nr);2656 data = next;26572658 next = data;2659 ud.dirs_alloc = ud.dirs_nr = decode_varint(&next);2660 if (next > end)2661 return -1;2662 ALLOC_ARRAY(ud.dirs, ud.dirs_nr);2663 data = next;26642665 len = strlen((const char *)data);2666 next = data + len + 1;2667 if (next > rd->end)2668 return -1;2669 *untracked_ = untracked = xmalloc(st_add(sizeof(*untracked), len));2670 memcpy(untracked, &ud, sizeof(ud));2671 memcpy(untracked->name, data, len + 1);2672 data = next;26732674 for (i = 0; i < untracked->untracked_nr; i++) {2675 len = strlen((const char *)data);2676 next = data + len + 1;2677 if (next > rd->end)2678 return -1;2679 untracked->untracked[i] = xstrdup((const char*)data);2680 data = next;2681 }26822683 rd->ucd[rd->index++] = untracked;2684 rd->data = data;26852686 for (i = 0; i < untracked->dirs_nr; i++) {2687 len = read_one_dir(untracked->dirs + i, rd);2688 if (len < 0)2689 return -1;2690 }2691 return 0;2692}26932694static void set_check_only(size_t pos, void *cb)2695{2696 struct read_data *rd = cb;2697 struct untracked_cache_dir *ud = rd->ucd[pos];2698 ud->check_only = 1;2699}27002701static void read_stat(size_t pos, void *cb)2702{2703 struct read_data *rd = cb;2704 struct untracked_cache_dir *ud = rd->ucd[pos];2705 if (rd->data + sizeof(struct stat_data) > rd->end) {2706 rd->data = rd->end + 1;2707 return;2708 }2709 stat_data_from_disk(&ud->stat_data, rd->data);2710 rd->data += sizeof(struct stat_data);2711 ud->valid = 1;2712}27132714static void read_sha1(size_t pos, void *cb)2715{2716 struct read_data *rd = cb;2717 struct untracked_cache_dir *ud = rd->ucd[pos];2718 if (rd->data + 20 > rd->end) {2719 rd->data = rd->end + 1;2720 return;2721 }2722 hashcpy(ud->exclude_sha1, rd->data);2723 rd->data += 20;2724}27252726static void load_sha1_stat(struct sha1_stat *sha1_stat,2727 const unsigned char *data,2728 const unsigned char *sha1)2729{2730 stat_data_from_disk(&sha1_stat->stat, data);2731 hashcpy(sha1_stat->sha1, sha1);2732 sha1_stat->valid = 1;2733}27342735struct untracked_cache *read_untracked_extension(const void *data, unsigned long sz)2736{2737 struct untracked_cache *uc;2738 struct read_data rd;2739 const unsigned char *next = data, *end = (const unsigned char *)data + sz;2740 const char *ident;2741 int ident_len, len;2742 const char *exclude_per_dir;27432744 if (sz <= 1 || end[-1] != '\0')2745 return NULL;2746 end--;27472748 ident_len = decode_varint(&next);2749 if (next + ident_len > end)2750 return NULL;2751 ident = (const char *)next;2752 next += ident_len;27532754 if (next + ouc_size(0) > end)2755 return NULL;27562757 uc = xcalloc(1, sizeof(*uc));2758 strbuf_init(&uc->ident, ident_len);2759 strbuf_add(&uc->ident, ident, ident_len);2760 load_sha1_stat(&uc->ss_info_exclude,2761 next + ouc_offset(info_exclude_stat),2762 next + ouc_offset(info_exclude_sha1));2763 load_sha1_stat(&uc->ss_excludes_file,2764 next + ouc_offset(excludes_file_stat),2765 next + ouc_offset(excludes_file_sha1));2766 uc->dir_flags = get_be32(next + ouc_offset(dir_flags));2767 exclude_per_dir = (const char *)next + ouc_offset(exclude_per_dir);2768 uc->exclude_per_dir = xstrdup(exclude_per_dir);2769 /* NUL after exclude_per_dir is covered by sizeof(*ouc) */2770 next += ouc_size(strlen(exclude_per_dir));2771 if (next >= end)2772 goto done2;27732774 len = decode_varint(&next);2775 if (next > end || len == 0)2776 goto done2;27772778 rd.valid = ewah_new();2779 rd.check_only = ewah_new();2780 rd.sha1_valid = ewah_new();2781 rd.data = next;2782 rd.end = end;2783 rd.index = 0;2784 ALLOC_ARRAY(rd.ucd, len);27852786 if (read_one_dir(&uc->root, &rd) || rd.index != len)2787 goto done;27882789 next = rd.data;2790 len = ewah_read_mmap(rd.valid, next, end - next);2791 if (len < 0)2792 goto done;27932794 next += len;2795 len = ewah_read_mmap(rd.check_only, next, end - next);2796 if (len < 0)2797 goto done;27982799 next += len;2800 len = ewah_read_mmap(rd.sha1_valid, next, end - next);2801 if (len < 0)2802 goto done;28032804 ewah_each_bit(rd.check_only, set_check_only, &rd);2805 rd.data = next + len;2806 ewah_each_bit(rd.valid, read_stat, &rd);2807 ewah_each_bit(rd.sha1_valid, read_sha1, &rd);2808 next = rd.data;28092810done:2811 free(rd.ucd);2812 ewah_free(rd.valid);2813 ewah_free(rd.check_only);2814 ewah_free(rd.sha1_valid);2815done2:2816 if (next != end) {2817 free_untracked_cache(uc);2818 uc = NULL;2819 }2820 return uc;2821}28222823static void invalidate_one_directory(struct untracked_cache *uc,2824 struct untracked_cache_dir *ucd)2825{2826 uc->dir_invalidated++;2827 ucd->valid = 0;2828 ucd->untracked_nr = 0;2829}28302831/*2832 * Normally when an entry is added or removed from a directory,2833 * invalidating that directory is enough. No need to touch its2834 * ancestors. When a directory is shown as "foo/bar/" in git-status2835 * however, deleting or adding an entry may have cascading effect.2836 *2837 * Say the "foo/bar/file" has become untracked, we need to tell the2838 * untracked_cache_dir of "foo" that "bar/" is not an untracked2839 * directory any more (because "bar" is managed by foo as an untracked2840 * "file").2841 *2842 * Similarly, if "foo/bar/file" moves from untracked to tracked and it2843 * was the last untracked entry in the entire "foo", we should show2844 * "foo/" instead. Which means we have to invalidate past "bar" up to2845 * "foo".2846 *2847 * This function traverses all directories from root to leaf. If there2848 * is a chance of one of the above cases happening, we invalidate back2849 * to root. Otherwise we just invalidate the leaf. There may be a more2850 * sophisticated way than checking for SHOW_OTHER_DIRECTORIES to2851 * detect these cases and avoid unnecessary invalidation, for example,2852 * checking for the untracked entry named "bar/" in "foo", but for now2853 * stick to something safe and simple.2854 */2855static int invalidate_one_component(struct untracked_cache *uc,2856 struct untracked_cache_dir *dir,2857 const char *path, int len)2858{2859 const char *rest = strchr(path, '/');28602861 if (rest) {2862 int component_len = rest - path;2863 struct untracked_cache_dir *d =2864 lookup_untracked(uc, dir, path, component_len);2865 int ret =2866 invalidate_one_component(uc, d, rest + 1,2867 len - (component_len + 1));2868 if (ret)2869 invalidate_one_directory(uc, dir);2870 return ret;2871 }28722873 invalidate_one_directory(uc, dir);2874 return uc->dir_flags & DIR_SHOW_OTHER_DIRECTORIES;2875}28762877void untracked_cache_invalidate_path(struct index_state *istate,2878 const char *path)2879{2880 if (!istate->untracked || !istate->untracked->root)2881 return;2882 invalidate_one_component(istate->untracked, istate->untracked->root,2883 path, strlen(path));2884}28852886void untracked_cache_remove_from_index(struct index_state *istate,2887 const char *path)2888{2889 untracked_cache_invalidate_path(istate, path);2890}28912892void untracked_cache_add_to_index(struct index_state *istate,2893 const char *path)2894{2895 untracked_cache_invalidate_path(istate, path);2896}28972898/* Update gitfile and core.worktree setting to connect work tree and git dir */2899void connect_work_tree_and_git_dir(const char *work_tree_, const char *git_dir_)2900{2901 struct strbuf gitfile_sb = STRBUF_INIT;2902 struct strbuf cfg_sb = STRBUF_INIT;2903 struct strbuf rel_path = STRBUF_INIT;2904 char *git_dir, *work_tree;29052906 /* Prepare .git file */2907 strbuf_addf(&gitfile_sb, "%s/.git", work_tree_);2908 if (safe_create_leading_directories_const(gitfile_sb.buf))2909 die(_("could not create directories for %s"), gitfile_sb.buf);29102911 /* Prepare config file */2912 strbuf_addf(&cfg_sb, "%s/config", git_dir_);2913 if (safe_create_leading_directories_const(cfg_sb.buf))2914 die(_("could not create directories for %s"), cfg_sb.buf);29152916 git_dir = real_pathdup(git_dir_, 1);2917 work_tree = real_pathdup(work_tree_, 1);29182919 /* Write .git file */2920 write_file(gitfile_sb.buf, "gitdir: %s",2921 relative_path(git_dir, work_tree, &rel_path));2922 /* Update core.worktree setting */2923 git_config_set_in_file(cfg_sb.buf, "core.worktree",2924 relative_path(work_tree, git_dir, &rel_path));29252926 strbuf_release(&gitfile_sb);2927 strbuf_release(&cfg_sb);2928 strbuf_release(&rel_path);2929 free(work_tree);2930 free(git_dir);2931}29322933/*2934 * Migrate the git directory of the given path from old_git_dir to new_git_dir.2935 */2936void relocate_gitdir(const char *path, const char *old_git_dir, const char *new_git_dir)2937{2938 if (rename(old_git_dir, new_git_dir) < 0)2939 die_errno(_("could not migrate git directory from '%s' to '%s'"),2940 old_git_dir, new_git_dir);29412942 connect_work_tree_and_git_dir(path, new_git_dir);2943}