1/* 2 * This handles recursive filename detection with exclude 3 * files, index knowledge etc.. 4 * 5 * See Documentation/technical/api-directory-listing.txt 6 * 7 * Copyright (C) Linus Torvalds, 2005-2006 8 * Junio Hamano, 2005-2006 9 */ 10#include"cache.h" 11#include"dir.h" 12#include"refs.h" 13#include"wildmatch.h" 14#include"pathspec.h" 15#include"utf8.h" 16#include"varint.h" 17#include"ewah/ewok.h" 18 19struct path_simplify { 20int len; 21const char*path; 22}; 23 24/* 25 * Tells read_directory_recursive how a file or directory should be treated. 26 * Values are ordered by significance, e.g. if a directory contains both 27 * excluded and untracked files, it is listed as untracked because 28 * path_untracked > path_excluded. 29 */ 30enum path_treatment { 31 path_none =0, 32 path_recurse, 33 path_excluded, 34 path_untracked 35}; 36 37/* 38 * Support data structure for our opendir/readdir/closedir wrappers 39 */ 40struct cached_dir { 41DIR*fdir; 42struct untracked_cache_dir *untracked; 43int nr_files; 44int nr_dirs; 45 46struct dirent *de; 47const char*file; 48struct untracked_cache_dir *ucd; 49}; 50 51static enum path_treatment read_directory_recursive(struct dir_struct *dir, 52const char*path,int len,struct untracked_cache_dir *untracked, 53int check_only,const struct path_simplify *simplify); 54static intget_dtype(struct dirent *de,const char*path,int len); 55 56/* helper string functions with support for the ignore_case flag */ 57intstrcmp_icase(const char*a,const char*b) 58{ 59return ignore_case ?strcasecmp(a, b) :strcmp(a, b); 60} 61 62intstrncmp_icase(const char*a,const char*b,size_t count) 63{ 64return ignore_case ?strncasecmp(a, b, count) :strncmp(a, b, count); 65} 66 67intfnmatch_icase(const char*pattern,const char*string,int flags) 68{ 69returnwildmatch(pattern, string, 70 flags | (ignore_case ? WM_CASEFOLD :0), 71 NULL); 72} 73 74intgit_fnmatch(const struct pathspec_item *item, 75const char*pattern,const char*string, 76int prefix) 77{ 78if(prefix >0) { 79if(ps_strncmp(item, pattern, string, prefix)) 80return WM_NOMATCH; 81 pattern += prefix; 82 string += prefix; 83} 84if(item->flags & PATHSPEC_ONESTAR) { 85int pattern_len =strlen(++pattern); 86int string_len =strlen(string); 87return string_len < pattern_len || 88ps_strcmp(item, pattern, 89 string + string_len - pattern_len); 90} 91if(item->magic & PATHSPEC_GLOB) 92returnwildmatch(pattern, string, 93 WM_PATHNAME | 94(item->magic & PATHSPEC_ICASE ? WM_CASEFOLD :0), 95 NULL); 96else 97/* wildmatch has not learned no FNM_PATHNAME mode yet */ 98returnwildmatch(pattern, string, 99 item->magic & PATHSPEC_ICASE ? WM_CASEFOLD :0, 100 NULL); 101} 102 103static intfnmatch_icase_mem(const char*pattern,int patternlen, 104const char*string,int stringlen, 105int flags) 106{ 107int match_status; 108struct strbuf pat_buf = STRBUF_INIT; 109struct strbuf str_buf = STRBUF_INIT; 110const char*use_pat = pattern; 111const char*use_str = string; 112 113if(pattern[patternlen]) { 114strbuf_add(&pat_buf, pattern, patternlen); 115 use_pat = pat_buf.buf; 116} 117if(string[stringlen]) { 118strbuf_add(&str_buf, string, stringlen); 119 use_str = str_buf.buf; 120} 121 122if(ignore_case) 123 flags |= WM_CASEFOLD; 124 match_status =wildmatch(use_pat, use_str, flags, NULL); 125 126strbuf_release(&pat_buf); 127strbuf_release(&str_buf); 128 129return match_status; 130} 131 132static size_tcommon_prefix_len(const struct pathspec *pathspec) 133{ 134int n; 135size_t max =0; 136 137/* 138 * ":(icase)path" is treated as a pathspec full of 139 * wildcard. In other words, only prefix is considered common 140 * prefix. If the pathspec is abc/foo abc/bar, running in 141 * subdir xyz, the common prefix is still xyz, not xuz/abc as 142 * in non-:(icase). 143 */ 144GUARD_PATHSPEC(pathspec, 145 PATHSPEC_FROMTOP | 146 PATHSPEC_MAXDEPTH | 147 PATHSPEC_LITERAL | 148 PATHSPEC_GLOB | 149 PATHSPEC_ICASE | 150 PATHSPEC_EXCLUDE); 151 152for(n =0; n < pathspec->nr; n++) { 153size_t i =0, len =0, item_len; 154if(pathspec->items[n].magic & PATHSPEC_EXCLUDE) 155continue; 156if(pathspec->items[n].magic & PATHSPEC_ICASE) 157 item_len = pathspec->items[n].prefix; 158else 159 item_len = pathspec->items[n].nowildcard_len; 160while(i < item_len && (n ==0|| i < max)) { 161char c = pathspec->items[n].match[i]; 162if(c != pathspec->items[0].match[i]) 163break; 164if(c =='/') 165 len = i +1; 166 i++; 167} 168if(n ==0|| len < max) { 169 max = len; 170if(!max) 171break; 172} 173} 174return 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{ 183unsigned long len =common_prefix_len(pathspec); 184 185return len ?xmemdupz(pathspec->items[0].match, len) : NULL; 186} 187 188intfill_directory(struct dir_struct *dir,const struct pathspec *pathspec) 189{ 190size_t len; 191 192/* 193 * Calculate common prefix for the pathspec, and 194 * use that to optimize the directory walk 195 */ 196 len =common_prefix_len(pathspec); 197 198/* Read the directory and prune it */ 199read_directory(dir, pathspec->nr ? pathspec->_raw[0] :"", len, pathspec); 200return len; 201} 202 203intwithin_depth(const char*name,int namelen, 204int depth,int max_depth) 205{ 206const char*cp = name, *cpe = name + namelen; 207 208while(cp < cpe) { 209if(*cp++ !='/') 210continue; 211 depth++; 212if(depth > max_depth) 213return0; 214} 215return1; 216} 217 218#define DO_MATCH_EXCLUDE 1 219#define DO_MATCH_DIRECTORY 2 220 221/* 222 * Does 'match' match the given name? 223 * A match is found if 224 * 225 * (1) the 'match' string is leading directory of 'name', or 226 * (2) the 'match' string is a wildcard and matches 'name', or 227 * (3) the 'match' string is exactly the same as 'name'. 228 * 229 * and the return value tells which case it was. 230 * 231 * It returns 0 when there is no match. 232 */ 233static intmatch_pathspec_item(const struct pathspec_item *item,int prefix, 234const char*name,int namelen,unsigned flags) 235{ 236/* name/namelen has prefix cut off by caller */ 237const char*match = item->match + prefix; 238int matchlen = item->len - prefix; 239 240/* 241 * The normal call pattern is: 242 * 1. prefix = common_prefix_len(ps); 243 * 2. prune something, or fill_directory 244 * 3. match_pathspec() 245 * 246 * 'prefix' at #1 may be shorter than the command's prefix and 247 * it's ok for #2 to match extra files. Those extras will be 248 * trimmed at #3. 249 * 250 * Suppose the pathspec is 'foo' and '../bar' running from 251 * subdir 'xyz'. The common prefix at #1 will be empty, thanks 252 * to "../". We may have xyz/foo _and_ XYZ/foo after #2. The 253 * user does not want XYZ/foo, only the "foo" part should be 254 * case-insensitive. We need to filter out XYZ/foo here. In 255 * other words, we do not trust the caller on comparing the 256 * prefix part when :(icase) is involved. We do exact 257 * comparison ourselves. 258 * 259 * Normally the caller (common_prefix_len() in fact) does 260 * _exact_ matching on name[-prefix+1..-1] and we do not need 261 * to check that part. Be defensive and check it anyway, in 262 * case common_prefix_len is changed, or a new caller is 263 * introduced that does not use common_prefix_len. 264 * 265 * If the penalty turns out too high when prefix is really 266 * long, maybe change it to 267 * strncmp(match, name, item->prefix - prefix) 268 */ 269if(item->prefix && (item->magic & PATHSPEC_ICASE) && 270strncmp(item->match, name - prefix, item->prefix)) 271return0; 272 273/* If the match was just the prefix, we matched */ 274if(!*match) 275return MATCHED_RECURSIVELY; 276 277if(matchlen <= namelen && !ps_strncmp(item, match, name, matchlen)) { 278if(matchlen == namelen) 279return MATCHED_EXACTLY; 280 281if(match[matchlen-1] =='/'|| name[matchlen] =='/') 282return MATCHED_RECURSIVELY; 283}else if((flags & DO_MATCH_DIRECTORY) && 284 match[matchlen -1] =='/'&& 285 namelen == matchlen -1&& 286!ps_strncmp(item, match, name, namelen)) 287return MATCHED_EXACTLY; 288 289if(item->nowildcard_len < item->len && 290!git_fnmatch(item, match, name, 291 item->nowildcard_len - prefix)) 292return MATCHED_FNMATCH; 293 294return0; 295} 296 297/* 298 * Given a name and a list of pathspecs, returns the nature of the 299 * closest (i.e. most specific) match of the name to any of the 300 * pathspecs. 301 * 302 * The caller typically calls this multiple times with the same 303 * pathspec and seen[] array but with different name/namelen 304 * (e.g. entries from the index) and is interested in seeing if and 305 * how each pathspec matches all the names it calls this function 306 * with. A mark is left in the seen[] array for each pathspec element 307 * indicating the closest type of match that element achieved, so if 308 * seen[n] remains zero after multiple invocations, that means the nth 309 * pathspec did not match any names, which could indicate that the 310 * user mistyped the nth pathspec. 311 */ 312static intdo_match_pathspec(const struct pathspec *ps, 313const char*name,int namelen, 314int prefix,char*seen, 315unsigned flags) 316{ 317int i, retval =0, exclude = flags & DO_MATCH_EXCLUDE; 318 319GUARD_PATHSPEC(ps, 320 PATHSPEC_FROMTOP | 321 PATHSPEC_MAXDEPTH | 322 PATHSPEC_LITERAL | 323 PATHSPEC_GLOB | 324 PATHSPEC_ICASE | 325 PATHSPEC_EXCLUDE); 326 327if(!ps->nr) { 328if(!ps->recursive || 329!(ps->magic & PATHSPEC_MAXDEPTH) || 330 ps->max_depth == -1) 331return MATCHED_RECURSIVELY; 332 333if(within_depth(name, namelen,0, ps->max_depth)) 334return MATCHED_EXACTLY; 335else 336return0; 337} 338 339 name += prefix; 340 namelen -= prefix; 341 342for(i = ps->nr -1; i >=0; i--) { 343int how; 344 345if((!exclude && ps->items[i].magic & PATHSPEC_EXCLUDE) || 346( exclude && !(ps->items[i].magic & PATHSPEC_EXCLUDE))) 347continue; 348 349if(seen && seen[i] == MATCHED_EXACTLY) 350continue; 351/* 352 * Make exclude patterns optional and never report 353 * "pathspec ':(exclude)foo' matches no files" 354 */ 355if(seen && ps->items[i].magic & PATHSPEC_EXCLUDE) 356 seen[i] = MATCHED_FNMATCH; 357 how =match_pathspec_item(ps->items+i, prefix, name, 358 namelen, flags); 359if(ps->recursive && 360(ps->magic & PATHSPEC_MAXDEPTH) && 361 ps->max_depth != -1&& 362 how && how != MATCHED_FNMATCH) { 363int len = ps->items[i].len; 364if(name[len] =='/') 365 len++; 366if(within_depth(name+len, namelen-len,0, ps->max_depth)) 367 how = MATCHED_EXACTLY; 368else 369 how =0; 370} 371if(how) { 372if(retval < how) 373 retval = how; 374if(seen && seen[i] < how) 375 seen[i] = how; 376} 377} 378return retval; 379} 380 381intmatch_pathspec(const struct pathspec *ps, 382const char*name,int namelen, 383int prefix,char*seen,int is_dir) 384{ 385int positive, negative; 386unsigned flags = is_dir ? DO_MATCH_DIRECTORY :0; 387 positive =do_match_pathspec(ps, name, namelen, 388 prefix, seen, flags); 389if(!(ps->magic & PATHSPEC_EXCLUDE) || !positive) 390return positive; 391 negative =do_match_pathspec(ps, name, namelen, 392 prefix, seen, 393 flags | DO_MATCH_EXCLUDE); 394return negative ?0: positive; 395} 396 397intreport_path_error(const char*ps_matched, 398const struct pathspec *pathspec, 399const char*prefix) 400{ 401/* 402 * Make sure all pathspec matched; otherwise it is an error. 403 */ 404int num, errors =0; 405for(num =0; num < pathspec->nr; num++) { 406int other, found_dup; 407 408if(ps_matched[num]) 409continue; 410/* 411 * The caller might have fed identical pathspec 412 * twice. Do not barf on such a mistake. 413 * FIXME: parse_pathspec should have eliminated 414 * duplicate pathspec. 415 */ 416for(found_dup = other =0; 417!found_dup && other < pathspec->nr; 418 other++) { 419if(other == num || !ps_matched[other]) 420continue; 421if(!strcmp(pathspec->items[other].original, 422 pathspec->items[num].original)) 423/* 424 * Ok, we have a match already. 425 */ 426 found_dup =1; 427} 428if(found_dup) 429continue; 430 431error("pathspec '%s' did not match any file(s) known to git.", 432 pathspec->items[num].original); 433 errors++; 434} 435return errors; 436} 437 438/* 439 * Return the length of the "simple" part of a path match limiter. 440 */ 441intsimple_length(const char*match) 442{ 443int len = -1; 444 445for(;;) { 446unsigned char c = *match++; 447 len++; 448if(c =='\0'||is_glob_special(c)) 449return len; 450} 451} 452 453intno_wildcard(const char*string) 454{ 455return string[simple_length(string)] =='\0'; 456} 457 458voidparse_exclude_pattern(const char**pattern, 459int*patternlen, 460int*flags, 461int*nowildcardlen) 462{ 463const char*p = *pattern; 464size_t i, len; 465 466*flags =0; 467if(*p =='!') { 468*flags |= EXC_FLAG_NEGATIVE; 469 p++; 470} 471 len =strlen(p); 472if(len && p[len -1] =='/') { 473 len--; 474*flags |= EXC_FLAG_MUSTBEDIR; 475} 476for(i =0; i < len; i++) { 477if(p[i] =='/') 478break; 479} 480if(i == len) 481*flags |= EXC_FLAG_NODIR; 482*nowildcardlen =simple_length(p); 483/* 484 * we should have excluded the trailing slash from 'p' too, 485 * but that's one more allocation. Instead just make sure 486 * nowildcardlen does not exceed real patternlen 487 */ 488if(*nowildcardlen > len) 489*nowildcardlen = len; 490if(*p =='*'&&no_wildcard(p +1)) 491*flags |= EXC_FLAG_ENDSWITH; 492*pattern = p; 493*patternlen = len; 494} 495 496voidadd_exclude(const char*string,const char*base, 497int baselen,struct exclude_list *el,int srcpos) 498{ 499struct exclude *x; 500int patternlen; 501int flags; 502int nowildcardlen; 503 504parse_exclude_pattern(&string, &patternlen, &flags, &nowildcardlen); 505if(flags & EXC_FLAG_MUSTBEDIR) { 506char*s; 507 x =xmalloc(sizeof(*x) + patternlen +1); 508 s = (char*)(x+1); 509memcpy(s, string, patternlen); 510 s[patternlen] ='\0'; 511 x->pattern = s; 512}else{ 513 x =xmalloc(sizeof(*x)); 514 x->pattern = string; 515} 516 x->patternlen = patternlen; 517 x->nowildcardlen = nowildcardlen; 518 x->base = base; 519 x->baselen = baselen; 520 x->flags = flags; 521 x->srcpos = srcpos; 522ALLOC_GROW(el->excludes, el->nr +1, el->alloc); 523 el->excludes[el->nr++] = x; 524 x->el = el; 525} 526 527static void*read_skip_worktree_file_from_index(const char*path,size_t*size, 528struct sha1_stat *sha1_stat) 529{ 530int pos, len; 531unsigned long sz; 532enum object_type type; 533void*data; 534 535 len =strlen(path); 536 pos =cache_name_pos(path, len); 537if(pos <0) 538return NULL; 539if(!ce_skip_worktree(active_cache[pos])) 540return NULL; 541 data =read_sha1_file(active_cache[pos]->sha1, &type, &sz); 542if(!data || type != OBJ_BLOB) { 543free(data); 544return NULL; 545} 546*size =xsize_t(sz); 547if(sha1_stat) { 548memset(&sha1_stat->stat,0,sizeof(sha1_stat->stat)); 549hashcpy(sha1_stat->sha1, active_cache[pos]->sha1); 550} 551return data; 552} 553 554/* 555 * Frees memory within el which was allocated for exclude patterns and 556 * the file buffer. Does not free el itself. 557 */ 558voidclear_exclude_list(struct exclude_list *el) 559{ 560int i; 561 562for(i =0; i < el->nr; i++) 563free(el->excludes[i]); 564free(el->excludes); 565free(el->filebuf); 566 567 el->nr =0; 568 el->excludes = NULL; 569 el->filebuf = NULL; 570} 571 572static voidtrim_trailing_spaces(char*buf) 573{ 574char*p, *last_space = NULL; 575 576for(p = buf; *p; p++) 577switch(*p) { 578case' ': 579if(!last_space) 580 last_space = p; 581break; 582case'\\': 583 p++; 584if(!*p) 585return; 586/* fallthrough */ 587default: 588 last_space = NULL; 589} 590 591if(last_space) 592*last_space ='\0'; 593} 594 595/* 596 * Given a subdirectory name and "dir" of the current directory, 597 * search the subdir in "dir" and return it, or create a new one if it 598 * does not exist in "dir". 599 * 600 * If "name" has the trailing slash, it'll be excluded in the search. 601 */ 602static struct untracked_cache_dir *lookup_untracked(struct untracked_cache *uc, 603struct untracked_cache_dir *dir, 604const char*name,int len) 605{ 606int first, last; 607struct untracked_cache_dir *d; 608if(!dir) 609return NULL; 610if(len && name[len -1] =='/') 611 len--; 612 first =0; 613 last = dir->dirs_nr; 614while(last > first) { 615int cmp, next = (last + first) >>1; 616 d = dir->dirs[next]; 617 cmp =strncmp(name, d->name, len); 618if(!cmp &&strlen(d->name) > len) 619 cmp = -1; 620if(!cmp) 621return d; 622if(cmp <0) { 623 last = next; 624continue; 625} 626 first = next+1; 627} 628 629 uc->dir_created++; 630 d =xmalloc(sizeof(*d) + len +1); 631memset(d,0,sizeof(*d)); 632memcpy(d->name, name, len); 633 d->name[len] ='\0'; 634 635ALLOC_GROW(dir->dirs, dir->dirs_nr +1, dir->dirs_alloc); 636memmove(dir->dirs + first +1, dir->dirs + first, 637(dir->dirs_nr - first) *sizeof(*dir->dirs)); 638 dir->dirs_nr++; 639 dir->dirs[first] = d; 640return d; 641} 642 643static voiddo_invalidate_gitignore(struct untracked_cache_dir *dir) 644{ 645int i; 646 dir->valid =0; 647 dir->untracked_nr =0; 648for(i =0; i < dir->dirs_nr; i++) 649do_invalidate_gitignore(dir->dirs[i]); 650} 651 652static voidinvalidate_gitignore(struct untracked_cache *uc, 653struct untracked_cache_dir *dir) 654{ 655 uc->gitignore_invalidated++; 656do_invalidate_gitignore(dir); 657} 658 659static voidinvalidate_directory(struct untracked_cache *uc, 660struct untracked_cache_dir *dir) 661{ 662int i; 663 uc->dir_invalidated++; 664 dir->valid =0; 665 dir->untracked_nr =0; 666for(i =0; i < dir->dirs_nr; i++) 667 dir->dirs[i]->recurse =0; 668} 669 670/* 671 * Given a file with name "fname", read it (either from disk, or from 672 * the index if "check_index" is non-zero), parse it and store the 673 * exclude rules in "el". 674 * 675 * If "ss" is not NULL, compute SHA-1 of the exclude file and fill 676 * stat data from disk (only valid if add_excludes returns zero). If 677 * ss_valid is non-zero, "ss" must contain good value as input. 678 */ 679static intadd_excludes(const char*fname,const char*base,int baselen, 680struct exclude_list *el,int check_index, 681struct sha1_stat *sha1_stat) 682{ 683struct stat st; 684int fd, i, lineno =1; 685size_t size =0; 686char*buf, *entry; 687 688 fd =open(fname, O_RDONLY); 689if(fd <0||fstat(fd, &st) <0) { 690if(errno != ENOENT) 691warn_on_inaccessible(fname); 692if(0<= fd) 693close(fd); 694if(!check_index || 695(buf =read_skip_worktree_file_from_index(fname, &size, sha1_stat)) == NULL) 696return-1; 697if(size ==0) { 698free(buf); 699return0; 700} 701if(buf[size-1] !='\n') { 702 buf =xrealloc(buf, size+1); 703 buf[size++] ='\n'; 704} 705}else{ 706 size =xsize_t(st.st_size); 707if(size ==0) { 708if(sha1_stat) { 709fill_stat_data(&sha1_stat->stat, &st); 710hashcpy(sha1_stat->sha1, EMPTY_BLOB_SHA1_BIN); 711 sha1_stat->valid =1; 712} 713close(fd); 714return0; 715} 716 buf =xmalloc(size+1); 717if(read_in_full(fd, buf, size) != size) { 718free(buf); 719close(fd); 720return-1; 721} 722 buf[size++] ='\n'; 723close(fd); 724if(sha1_stat) { 725int pos; 726if(sha1_stat->valid && 727!match_stat_data_racy(&the_index, &sha1_stat->stat, &st)) 728;/* no content change, ss->sha1 still good */ 729else if(check_index && 730(pos =cache_name_pos(fname,strlen(fname))) >=0&& 731!ce_stage(active_cache[pos]) && 732ce_uptodate(active_cache[pos]) && 733!would_convert_to_git(fname)) 734hashcpy(sha1_stat->sha1, active_cache[pos]->sha1); 735else 736hash_sha1_file(buf, size,"blob", sha1_stat->sha1); 737fill_stat_data(&sha1_stat->stat, &st); 738 sha1_stat->valid =1; 739} 740} 741 742 el->filebuf = buf; 743 744if(skip_utf8_bom(&buf, size)) 745 size -= buf - el->filebuf; 746 747 entry = buf; 748 749for(i =0; i < size; i++) { 750if(buf[i] =='\n') { 751if(entry != buf + i && entry[0] !='#') { 752 buf[i - (i && buf[i-1] =='\r')] =0; 753trim_trailing_spaces(entry); 754add_exclude(entry, base, baselen, el, lineno); 755} 756 lineno++; 757 entry = buf + i +1; 758} 759} 760return0; 761} 762 763intadd_excludes_from_file_to_list(const char*fname,const char*base, 764int baselen,struct exclude_list *el, 765int check_index) 766{ 767returnadd_excludes(fname, base, baselen, el, check_index, NULL); 768} 769 770struct exclude_list *add_exclude_list(struct dir_struct *dir, 771int group_type,const char*src) 772{ 773struct exclude_list *el; 774struct exclude_list_group *group; 775 776 group = &dir->exclude_list_group[group_type]; 777ALLOC_GROW(group->el, group->nr +1, group->alloc); 778 el = &group->el[group->nr++]; 779memset(el,0,sizeof(*el)); 780 el->src = src; 781return el; 782} 783 784/* 785 * Used to set up core.excludesfile and .git/info/exclude lists. 786 */ 787static voidadd_excludes_from_file_1(struct dir_struct *dir,const char*fname, 788struct sha1_stat *sha1_stat) 789{ 790struct exclude_list *el; 791/* 792 * catch setup_standard_excludes() that's called before 793 * dir->untracked is assigned. That function behaves 794 * differently when dir->untracked is non-NULL. 795 */ 796if(!dir->untracked) 797 dir->unmanaged_exclude_files++; 798 el =add_exclude_list(dir, EXC_FILE, fname); 799if(add_excludes(fname,"",0, el,0, sha1_stat) <0) 800die("cannot use%sas an exclude file", fname); 801} 802 803voidadd_excludes_from_file(struct dir_struct *dir,const char*fname) 804{ 805 dir->unmanaged_exclude_files++;/* see validate_untracked_cache() */ 806add_excludes_from_file_1(dir, fname, NULL); 807} 808 809intmatch_basename(const char*basename,int basenamelen, 810const char*pattern,int prefix,int patternlen, 811int flags) 812{ 813if(prefix == patternlen) { 814if(patternlen == basenamelen && 815!strncmp_icase(pattern, basename, basenamelen)) 816return1; 817}else if(flags & EXC_FLAG_ENDSWITH) { 818/* "*literal" matching against "fooliteral" */ 819if(patternlen -1<= basenamelen && 820!strncmp_icase(pattern +1, 821 basename + basenamelen - (patternlen -1), 822 patternlen -1)) 823return1; 824}else{ 825if(fnmatch_icase_mem(pattern, patternlen, 826 basename, basenamelen, 8270) ==0) 828return1; 829} 830return0; 831} 832 833intmatch_pathname(const char*pathname,int pathlen, 834const char*base,int baselen, 835const char*pattern,int prefix,int patternlen, 836int flags) 837{ 838const char*name; 839int namelen; 840 841/* 842 * match with FNM_PATHNAME; the pattern has base implicitly 843 * in front of it. 844 */ 845if(*pattern =='/') { 846 pattern++; 847 patternlen--; 848 prefix--; 849} 850 851/* 852 * baselen does not count the trailing slash. base[] may or 853 * may not end with a trailing slash though. 854 */ 855if(pathlen < baselen +1|| 856(baselen && pathname[baselen] !='/') || 857strncmp_icase(pathname, base, baselen)) 858return0; 859 860 namelen = baselen ? pathlen - baselen -1: pathlen; 861 name = pathname + pathlen - namelen; 862 863if(prefix) { 864/* 865 * if the non-wildcard part is longer than the 866 * remaining pathname, surely it cannot match. 867 */ 868if(prefix > namelen) 869return0; 870 871if(strncmp_icase(pattern, name, prefix)) 872return0; 873 pattern += prefix; 874 patternlen -= prefix; 875 name += prefix; 876 namelen -= prefix; 877 878/* 879 * If the whole pattern did not have a wildcard, 880 * then our prefix match is all we need; we 881 * do not need to call fnmatch at all. 882 */ 883if(!patternlen && !namelen) 884return1; 885} 886 887returnfnmatch_icase_mem(pattern, patternlen, 888 name, namelen, 889 WM_PATHNAME) ==0; 890} 891 892/* 893 * Scan the given exclude list in reverse to see whether pathname 894 * should be ignored. The first match (i.e. the last on the list), if 895 * any, determines the fate. Returns the exclude_list element which 896 * matched, or NULL for undecided. 897 */ 898static struct exclude *last_exclude_matching_from_list(const char*pathname, 899int pathlen, 900const char*basename, 901int*dtype, 902struct exclude_list *el) 903{ 904int i; 905 906if(!el->nr) 907return NULL;/* undefined */ 908 909for(i = el->nr -1;0<= i; i--) { 910struct exclude *x = el->excludes[i]; 911const char*exclude = x->pattern; 912int prefix = x->nowildcardlen; 913 914if(x->flags & EXC_FLAG_MUSTBEDIR) { 915if(*dtype == DT_UNKNOWN) 916*dtype =get_dtype(NULL, pathname, pathlen); 917if(*dtype != DT_DIR) 918continue; 919} 920 921if(x->flags & EXC_FLAG_NODIR) { 922if(match_basename(basename, 923 pathlen - (basename - pathname), 924 exclude, prefix, x->patternlen, 925 x->flags)) 926return x; 927continue; 928} 929 930assert(x->baselen ==0|| x->base[x->baselen -1] =='/'); 931if(match_pathname(pathname, pathlen, 932 x->base, x->baselen ? x->baselen -1:0, 933 exclude, prefix, x->patternlen, x->flags)) 934return x; 935} 936return NULL;/* undecided */ 937} 938 939/* 940 * Scan the list and let the last match determine the fate. 941 * Return 1 for exclude, 0 for include and -1 for undecided. 942 */ 943intis_excluded_from_list(const char*pathname, 944int pathlen,const char*basename,int*dtype, 945struct exclude_list *el) 946{ 947struct exclude *exclude; 948 exclude =last_exclude_matching_from_list(pathname, pathlen, basename, dtype, el); 949if(exclude) 950return exclude->flags & EXC_FLAG_NEGATIVE ?0:1; 951return-1;/* undecided */ 952} 953 954static struct exclude *last_exclude_matching_from_lists(struct dir_struct *dir, 955const char*pathname,int pathlen,const char*basename, 956int*dtype_p) 957{ 958int i, j; 959struct exclude_list_group *group; 960struct exclude *exclude; 961for(i = EXC_CMDL; i <= EXC_FILE; i++) { 962 group = &dir->exclude_list_group[i]; 963for(j = group->nr -1; j >=0; j--) { 964 exclude =last_exclude_matching_from_list( 965 pathname, pathlen, basename, dtype_p, 966&group->el[j]); 967if(exclude) 968return exclude; 969} 970} 971return NULL; 972} 973 974/* 975 * Loads the per-directory exclude list for the substring of base 976 * which has a char length of baselen. 977 */ 978static voidprep_exclude(struct dir_struct *dir,const char*base,int baselen) 979{ 980struct exclude_list_group *group; 981struct exclude_list *el; 982struct exclude_stack *stk = NULL; 983struct untracked_cache_dir *untracked; 984int current; 985 986 group = &dir->exclude_list_group[EXC_DIRS]; 987 988/* 989 * Pop the exclude lists from the EXCL_DIRS exclude_list_group 990 * which originate from directories not in the prefix of the 991 * path being checked. 992 */ 993while((stk = dir->exclude_stack) != NULL) { 994if(stk->baselen <= baselen && 995!strncmp(dir->basebuf.buf, base, stk->baselen)) 996break; 997 el = &group->el[dir->exclude_stack->exclude_ix]; 998 dir->exclude_stack = stk->prev; 999 dir->exclude = NULL;1000free((char*)el->src);/* see strbuf_detach() below */1001clear_exclude_list(el);1002free(stk);1003 group->nr--;1004}10051006/* Skip traversing into sub directories if the parent is excluded */1007if(dir->exclude)1008return;10091010/*1011 * Lazy initialization. All call sites currently just1012 * memset(dir, 0, sizeof(*dir)) before use. Changing all of1013 * them seems lots of work for little benefit.1014 */1015if(!dir->basebuf.buf)1016strbuf_init(&dir->basebuf, PATH_MAX);10171018/* Read from the parent directories and push them down. */1019 current = stk ? stk->baselen : -1;1020strbuf_setlen(&dir->basebuf, current <0?0: current);1021if(dir->untracked)1022 untracked = stk ? stk->ucd : dir->untracked->root;1023else1024 untracked = NULL;10251026while(current < baselen) {1027const char*cp;1028struct sha1_stat sha1_stat;10291030 stk =xcalloc(1,sizeof(*stk));1031if(current <0) {1032 cp = base;1033 current =0;1034}else{1035 cp =strchr(base + current +1,'/');1036if(!cp)1037die("oops in prep_exclude");1038 cp++;1039 untracked =1040lookup_untracked(dir->untracked, untracked,1041 base + current,1042 cp - base - current);1043}1044 stk->prev = dir->exclude_stack;1045 stk->baselen = cp - base;1046 stk->exclude_ix = group->nr;1047 stk->ucd = untracked;1048 el =add_exclude_list(dir, EXC_DIRS, NULL);1049strbuf_add(&dir->basebuf, base + current, stk->baselen - current);1050assert(stk->baselen == dir->basebuf.len);10511052/* Abort if the directory is excluded */1053if(stk->baselen) {1054int dt = DT_DIR;1055 dir->basebuf.buf[stk->baselen -1] =0;1056 dir->exclude =last_exclude_matching_from_lists(dir,1057 dir->basebuf.buf, stk->baselen -1,1058 dir->basebuf.buf + current, &dt);1059 dir->basebuf.buf[stk->baselen -1] ='/';1060if(dir->exclude &&1061 dir->exclude->flags & EXC_FLAG_NEGATIVE)1062 dir->exclude = NULL;1063if(dir->exclude) {1064 dir->exclude_stack = stk;1065return;1066}1067}10681069/* Try to read per-directory file */1070hashclr(sha1_stat.sha1);1071 sha1_stat.valid =0;1072if(dir->exclude_per_dir &&1073/*1074 * If we know that no files have been added in1075 * this directory (i.e. valid_cached_dir() has1076 * been executed and set untracked->valid) ..1077 */1078(!untracked || !untracked->valid ||1079/*1080 * .. and .gitignore does not exist before1081 * (i.e. null exclude_sha1 and skip_worktree is1082 * not set). Then we can skip loading .gitignore,1083 * which would result in ENOENT anyway.1084 * skip_worktree is taken care in read_directory()1085 */1086!is_null_sha1(untracked->exclude_sha1))) {1087/*1088 * dir->basebuf gets reused by the traversal, but we1089 * need fname to remain unchanged to ensure the src1090 * member of each struct exclude correctly1091 * back-references its source file. Other invocations1092 * of add_exclude_list provide stable strings, so we1093 * strbuf_detach() and free() here in the caller.1094 */1095struct strbuf sb = STRBUF_INIT;1096strbuf_addbuf(&sb, &dir->basebuf);1097strbuf_addstr(&sb, dir->exclude_per_dir);1098 el->src =strbuf_detach(&sb, NULL);1099add_excludes(el->src, el->src, stk->baselen, el,1,1100 untracked ? &sha1_stat : NULL);1101}1102/*1103 * NEEDSWORK: when untracked cache is enabled, prep_exclude()1104 * will first be called in valid_cached_dir() then maybe many1105 * times more in last_exclude_matching(). When the cache is1106 * used, last_exclude_matching() will not be called and1107 * reading .gitignore content will be a waste.1108 *1109 * So when it's called by valid_cached_dir() and we can get1110 * .gitignore SHA-1 from the index (i.e. .gitignore is not1111 * modified on work tree), we could delay reading the1112 * .gitignore content until we absolutely need it in1113 * last_exclude_matching(). Be careful about ignore rule1114 * order, though, if you do that.1115 */1116if(untracked &&1117hashcmp(sha1_stat.sha1, untracked->exclude_sha1)) {1118invalidate_gitignore(dir->untracked, untracked);1119hashcpy(untracked->exclude_sha1, sha1_stat.sha1);1120}1121 dir->exclude_stack = stk;1122 current = stk->baselen;1123}1124strbuf_setlen(&dir->basebuf, baselen);1125}11261127/*1128 * Loads the exclude lists for the directory containing pathname, then1129 * scans all exclude lists to determine whether pathname is excluded.1130 * Returns the exclude_list element which matched, or NULL for1131 * undecided.1132 */1133struct exclude *last_exclude_matching(struct dir_struct *dir,1134const char*pathname,1135int*dtype_p)1136{1137int pathlen =strlen(pathname);1138const char*basename =strrchr(pathname,'/');1139 basename = (basename) ? basename+1: pathname;11401141prep_exclude(dir, pathname, basename-pathname);11421143if(dir->exclude)1144return dir->exclude;11451146returnlast_exclude_matching_from_lists(dir, pathname, pathlen,1147 basename, dtype_p);1148}11491150/*1151 * Loads the exclude lists for the directory containing pathname, then1152 * scans all exclude lists to determine whether pathname is excluded.1153 * Returns 1 if true, otherwise 0.1154 */1155intis_excluded(struct dir_struct *dir,const char*pathname,int*dtype_p)1156{1157struct exclude *exclude =1158last_exclude_matching(dir, pathname, dtype_p);1159if(exclude)1160return exclude->flags & EXC_FLAG_NEGATIVE ?0:1;1161return0;1162}11631164static struct dir_entry *dir_entry_new(const char*pathname,int len)1165{1166struct dir_entry *ent;11671168 ent =xmalloc(sizeof(*ent) + len +1);1169 ent->len = len;1170memcpy(ent->name, pathname, len);1171 ent->name[len] =0;1172return ent;1173}11741175static struct dir_entry *dir_add_name(struct dir_struct *dir,const char*pathname,int len)1176{1177if(cache_file_exists(pathname, len, ignore_case))1178return NULL;11791180ALLOC_GROW(dir->entries, dir->nr+1, dir->alloc);1181return dir->entries[dir->nr++] =dir_entry_new(pathname, len);1182}11831184struct dir_entry *dir_add_ignored(struct dir_struct *dir,const char*pathname,int len)1185{1186if(!cache_name_is_other(pathname, len))1187return NULL;11881189ALLOC_GROW(dir->ignored, dir->ignored_nr+1, dir->ignored_alloc);1190return dir->ignored[dir->ignored_nr++] =dir_entry_new(pathname, len);1191}11921193enum exist_status {1194 index_nonexistent =0,1195 index_directory,1196 index_gitdir1197};11981199/*1200 * Do not use the alphabetically sorted index to look up1201 * the directory name; instead, use the case insensitive1202 * directory hash.1203 */1204static enum exist_status directory_exists_in_index_icase(const char*dirname,int len)1205{1206const struct cache_entry *ce =cache_dir_exists(dirname, len);1207unsigned char endchar;12081209if(!ce)1210return index_nonexistent;1211 endchar = ce->name[len];12121213/*1214 * The cache_entry structure returned will contain this dirname1215 * and possibly additional path components.1216 */1217if(endchar =='/')1218return index_directory;12191220/*1221 * If there are no additional path components, then this cache_entry1222 * represents a submodule. Submodules, despite being directories,1223 * are stored in the cache without a closing slash.1224 */1225if(!endchar &&S_ISGITLINK(ce->ce_mode))1226return index_gitdir;12271228/* This should never be hit, but it exists just in case. */1229return index_nonexistent;1230}12311232/*1233 * The index sorts alphabetically by entry name, which1234 * means that a gitlink sorts as '\0' at the end, while1235 * a directory (which is defined not as an entry, but as1236 * the files it contains) will sort with the '/' at the1237 * end.1238 */1239static enum exist_status directory_exists_in_index(const char*dirname,int len)1240{1241int pos;12421243if(ignore_case)1244returndirectory_exists_in_index_icase(dirname, len);12451246 pos =cache_name_pos(dirname, len);1247if(pos <0)1248 pos = -pos-1;1249while(pos < active_nr) {1250const struct cache_entry *ce = active_cache[pos++];1251unsigned char endchar;12521253if(strncmp(ce->name, dirname, len))1254break;1255 endchar = ce->name[len];1256if(endchar >'/')1257break;1258if(endchar =='/')1259return index_directory;1260if(!endchar &&S_ISGITLINK(ce->ce_mode))1261return index_gitdir;1262}1263return index_nonexistent;1264}12651266/*1267 * When we find a directory when traversing the filesystem, we1268 * have three distinct cases:1269 *1270 * - ignore it1271 * - see it as a directory1272 * - recurse into it1273 *1274 * and which one we choose depends on a combination of existing1275 * git index contents and the flags passed into the directory1276 * traversal routine.1277 *1278 * Case 1: If we *already* have entries in the index under that1279 * directory name, we always recurse into the directory to see1280 * all the files.1281 *1282 * Case 2: If we *already* have that directory name as a gitlink,1283 * we always continue to see it as a gitlink, regardless of whether1284 * there is an actual git directory there or not (it might not1285 * be checked out as a subproject!)1286 *1287 * Case 3: if we didn't have it in the index previously, we1288 * have a few sub-cases:1289 *1290 * (a) if "show_other_directories" is true, we show it as1291 * just a directory, unless "hide_empty_directories" is1292 * also true, in which case we need to check if it contains any1293 * untracked and / or ignored files.1294 * (b) if it looks like a git directory, and we don't have1295 * 'no_gitlinks' set we treat it as a gitlink, and show it1296 * as a directory.1297 * (c) otherwise, we recurse into it.1298 */1299static enum path_treatment treat_directory(struct dir_struct *dir,1300struct untracked_cache_dir *untracked,1301const char*dirname,int len,int exclude,1302const struct path_simplify *simplify)1303{1304/* The "len-1" is to strip the final '/' */1305switch(directory_exists_in_index(dirname, len-1)) {1306case index_directory:1307return path_recurse;13081309case index_gitdir:1310return path_none;13111312case index_nonexistent:1313if(dir->flags & DIR_SHOW_OTHER_DIRECTORIES)1314break;1315if(!(dir->flags & DIR_NO_GITLINKS)) {1316unsigned char sha1[20];1317if(resolve_gitlink_ref(dirname,"HEAD", sha1) ==0)1318return path_untracked;1319}1320return path_recurse;1321}13221323/* This is the "show_other_directories" case */13241325if(!(dir->flags & DIR_HIDE_EMPTY_DIRECTORIES))1326return exclude ? path_excluded : path_untracked;13271328 untracked =lookup_untracked(dir->untracked, untracked, dirname, len);1329returnread_directory_recursive(dir, dirname, len,1330 untracked,1, simplify);1331}13321333/*1334 * This is an inexact early pruning of any recursive directory1335 * reading - if the path cannot possibly be in the pathspec,1336 * return true, and we'll skip it early.1337 */1338static intsimplify_away(const char*path,int pathlen,const struct path_simplify *simplify)1339{1340if(simplify) {1341for(;;) {1342const char*match = simplify->path;1343int len = simplify->len;13441345if(!match)1346break;1347if(len > pathlen)1348 len = pathlen;1349if(!memcmp(path, match, len))1350return0;1351 simplify++;1352}1353return1;1354}1355return0;1356}13571358/*1359 * This function tells us whether an excluded path matches a1360 * list of "interesting" pathspecs. That is, whether a path matched1361 * by any of the pathspecs could possibly be ignored by excluding1362 * the specified path. This can happen if:1363 *1364 * 1. the path is mentioned explicitly in the pathspec1365 *1366 * 2. the path is a directory prefix of some element in the1367 * pathspec1368 */1369static intexclude_matches_pathspec(const char*path,int len,1370const struct path_simplify *simplify)1371{1372if(simplify) {1373for(; simplify->path; simplify++) {1374if(len == simplify->len1375&& !memcmp(path, simplify->path, len))1376return1;1377if(len < simplify->len1378&& simplify->path[len] =='/'1379&& !memcmp(path, simplify->path, len))1380return1;1381}1382}1383return0;1384}13851386static intget_index_dtype(const char*path,int len)1387{1388int pos;1389const struct cache_entry *ce;13901391 ce =cache_file_exists(path, len,0);1392if(ce) {1393if(!ce_uptodate(ce))1394return DT_UNKNOWN;1395if(S_ISGITLINK(ce->ce_mode))1396return DT_DIR;1397/*1398 * Nobody actually cares about the1399 * difference between DT_LNK and DT_REG1400 */1401return DT_REG;1402}14031404/* Try to look it up as a directory */1405 pos =cache_name_pos(path, len);1406if(pos >=0)1407return DT_UNKNOWN;1408 pos = -pos-1;1409while(pos < active_nr) {1410 ce = active_cache[pos++];1411if(strncmp(ce->name, path, len))1412break;1413if(ce->name[len] >'/')1414break;1415if(ce->name[len] <'/')1416continue;1417if(!ce_uptodate(ce))1418break;/* continue? */1419return DT_DIR;1420}1421return DT_UNKNOWN;1422}14231424static intget_dtype(struct dirent *de,const char*path,int len)1425{1426int dtype = de ?DTYPE(de) : DT_UNKNOWN;1427struct stat st;14281429if(dtype != DT_UNKNOWN)1430return dtype;1431 dtype =get_index_dtype(path, len);1432if(dtype != DT_UNKNOWN)1433return dtype;1434if(lstat(path, &st))1435return dtype;1436if(S_ISREG(st.st_mode))1437return DT_REG;1438if(S_ISDIR(st.st_mode))1439return DT_DIR;1440if(S_ISLNK(st.st_mode))1441return DT_LNK;1442return dtype;1443}14441445static enum path_treatment treat_one_path(struct dir_struct *dir,1446struct untracked_cache_dir *untracked,1447struct strbuf *path,1448const struct path_simplify *simplify,1449int dtype,struct dirent *de)1450{1451int exclude;1452int has_path_in_index = !!cache_file_exists(path->buf, path->len, ignore_case);14531454if(dtype == DT_UNKNOWN)1455 dtype =get_dtype(de, path->buf, path->len);14561457/* Always exclude indexed files */1458if(dtype != DT_DIR && has_path_in_index)1459return path_none;14601461/*1462 * When we are looking at a directory P in the working tree,1463 * there are three cases:1464 *1465 * (1) P exists in the index. Everything inside the directory P in1466 * the working tree needs to go when P is checked out from the1467 * index.1468 *1469 * (2) P does not exist in the index, but there is P/Q in the index.1470 * We know P will stay a directory when we check out the contents1471 * of the index, but we do not know yet if there is a directory1472 * P/Q in the working tree to be killed, so we need to recurse.1473 *1474 * (3) P does not exist in the index, and there is no P/Q in the index1475 * to require P to be a directory, either. Only in this case, we1476 * know that everything inside P will not be killed without1477 * recursing.1478 */1479if((dir->flags & DIR_COLLECT_KILLED_ONLY) &&1480(dtype == DT_DIR) &&1481!has_path_in_index &&1482(directory_exists_in_index(path->buf, path->len) == index_nonexistent))1483return path_none;14841485 exclude =is_excluded(dir, path->buf, &dtype);14861487/*1488 * Excluded? If we don't explicitly want to show1489 * ignored files, ignore it1490 */1491if(exclude && !(dir->flags & (DIR_SHOW_IGNORED|DIR_SHOW_IGNORED_TOO)))1492return path_excluded;14931494switch(dtype) {1495default:1496return path_none;1497case DT_DIR:1498strbuf_addch(path,'/');1499returntreat_directory(dir, untracked, path->buf, path->len, exclude,1500 simplify);1501case DT_REG:1502case DT_LNK:1503return exclude ? path_excluded : path_untracked;1504}1505}15061507static enum path_treatment treat_path_fast(struct dir_struct *dir,1508struct untracked_cache_dir *untracked,1509struct cached_dir *cdir,1510struct strbuf *path,1511int baselen,1512const struct path_simplify *simplify)1513{1514strbuf_setlen(path, baselen);1515if(!cdir->ucd) {1516strbuf_addstr(path, cdir->file);1517return path_untracked;1518}1519strbuf_addstr(path, cdir->ucd->name);1520/* treat_one_path() does this before it calls treat_directory() */1521if(path->buf[path->len -1] !='/')1522strbuf_addch(path,'/');1523if(cdir->ucd->check_only)1524/*1525 * check_only is set as a result of treat_directory() getting1526 * to its bottom. Verify again the same set of directories1527 * with check_only set.1528 */1529returnread_directory_recursive(dir, path->buf, path->len,1530 cdir->ucd,1, simplify);1531/*1532 * We get path_recurse in the first run when1533 * directory_exists_in_index() returns index_nonexistent. We1534 * are sure that new changes in the index does not impact the1535 * outcome. Return now.1536 */1537return path_recurse;1538}15391540static enum path_treatment treat_path(struct dir_struct *dir,1541struct untracked_cache_dir *untracked,1542struct cached_dir *cdir,1543struct strbuf *path,1544int baselen,1545const struct path_simplify *simplify)1546{1547int dtype;1548struct dirent *de = cdir->de;15491550if(!de)1551returntreat_path_fast(dir, untracked, cdir, path,1552 baselen, simplify);1553if(is_dot_or_dotdot(de->d_name) || !strcmp(de->d_name,".git"))1554return path_none;1555strbuf_setlen(path, baselen);1556strbuf_addstr(path, de->d_name);1557if(simplify_away(path->buf, path->len, simplify))1558return path_none;15591560 dtype =DTYPE(de);1561returntreat_one_path(dir, untracked, path, simplify, dtype, de);1562}15631564static voidadd_untracked(struct untracked_cache_dir *dir,const char*name)1565{1566if(!dir)1567return;1568ALLOC_GROW(dir->untracked, dir->untracked_nr +1,1569 dir->untracked_alloc);1570 dir->untracked[dir->untracked_nr++] =xstrdup(name);1571}15721573static intvalid_cached_dir(struct dir_struct *dir,1574struct untracked_cache_dir *untracked,1575struct strbuf *path,1576int check_only)1577{1578struct stat st;15791580if(!untracked)1581return0;15821583if(stat(path->len ? path->buf :".", &st)) {1584invalidate_directory(dir->untracked, untracked);1585memset(&untracked->stat_data,0,sizeof(untracked->stat_data));1586return0;1587}1588if(!untracked->valid ||1589match_stat_data_racy(&the_index, &untracked->stat_data, &st)) {1590if(untracked->valid)1591invalidate_directory(dir->untracked, untracked);1592fill_stat_data(&untracked->stat_data, &st);1593return0;1594}15951596if(untracked->check_only != !!check_only) {1597invalidate_directory(dir->untracked, untracked);1598return0;1599}16001601/*1602 * prep_exclude will be called eventually on this directory,1603 * but it's called much later in last_exclude_matching(). We1604 * need it now to determine the validity of the cache for this1605 * path. The next calls will be nearly no-op, the way1606 * prep_exclude() is designed.1607 */1608if(path->len && path->buf[path->len -1] !='/') {1609strbuf_addch(path,'/');1610prep_exclude(dir, path->buf, path->len);1611strbuf_setlen(path, path->len -1);1612}else1613prep_exclude(dir, path->buf, path->len);16141615/* hopefully prep_exclude() haven't invalidated this entry... */1616return untracked->valid;1617}16181619static intopen_cached_dir(struct cached_dir *cdir,1620struct dir_struct *dir,1621struct untracked_cache_dir *untracked,1622struct strbuf *path,1623int check_only)1624{1625memset(cdir,0,sizeof(*cdir));1626 cdir->untracked = untracked;1627if(valid_cached_dir(dir, untracked, path, check_only))1628return0;1629 cdir->fdir =opendir(path->len ? path->buf :".");1630if(dir->untracked)1631 dir->untracked->dir_opened++;1632if(!cdir->fdir)1633return-1;1634return0;1635}16361637static intread_cached_dir(struct cached_dir *cdir)1638{1639if(cdir->fdir) {1640 cdir->de =readdir(cdir->fdir);1641if(!cdir->de)1642return-1;1643return0;1644}1645while(cdir->nr_dirs < cdir->untracked->dirs_nr) {1646struct untracked_cache_dir *d = cdir->untracked->dirs[cdir->nr_dirs];1647if(!d->recurse) {1648 cdir->nr_dirs++;1649continue;1650}1651 cdir->ucd = d;1652 cdir->nr_dirs++;1653return0;1654}1655 cdir->ucd = NULL;1656if(cdir->nr_files < cdir->untracked->untracked_nr) {1657struct untracked_cache_dir *d = cdir->untracked;1658 cdir->file = d->untracked[cdir->nr_files++];1659return0;1660}1661return-1;1662}16631664static voidclose_cached_dir(struct cached_dir *cdir)1665{1666if(cdir->fdir)1667closedir(cdir->fdir);1668/*1669 * We have gone through this directory and found no untracked1670 * entries. Mark it valid.1671 */1672if(cdir->untracked) {1673 cdir->untracked->valid =1;1674 cdir->untracked->recurse =1;1675}1676}16771678/*1679 * Read a directory tree. We currently ignore anything but1680 * directories, regular files and symlinks. That's because git1681 * doesn't handle them at all yet. Maybe that will change some1682 * day.1683 *1684 * Also, we ignore the name ".git" (even if it is not a directory).1685 * That likely will not change.1686 *1687 * Returns the most significant path_treatment value encountered in the scan.1688 */1689static enum path_treatment read_directory_recursive(struct dir_struct *dir,1690const char*base,int baselen,1691struct untracked_cache_dir *untracked,int check_only,1692const struct path_simplify *simplify)1693{1694struct cached_dir cdir;1695enum path_treatment state, subdir_state, dir_state = path_none;1696struct strbuf path = STRBUF_INIT;16971698strbuf_add(&path, base, baselen);16991700if(open_cached_dir(&cdir, dir, untracked, &path, check_only))1701goto out;17021703if(untracked)1704 untracked->check_only = !!check_only;17051706while(!read_cached_dir(&cdir)) {1707/* check how the file or directory should be treated */1708 state =treat_path(dir, untracked, &cdir, &path, baselen, simplify);17091710if(state > dir_state)1711 dir_state = state;17121713/* recurse into subdir if instructed by treat_path */1714if(state == path_recurse) {1715struct untracked_cache_dir *ud;1716 ud =lookup_untracked(dir->untracked, untracked,1717 path.buf + baselen,1718 path.len - baselen);1719 subdir_state =1720read_directory_recursive(dir, path.buf, path.len,1721 ud, check_only, simplify);1722if(subdir_state > dir_state)1723 dir_state = subdir_state;1724}17251726if(check_only) {1727/* abort early if maximum state has been reached */1728if(dir_state == path_untracked) {1729if(cdir.fdir)1730add_untracked(untracked, path.buf + baselen);1731break;1732}1733/* skip the dir_add_* part */1734continue;1735}17361737/* add the path to the appropriate result list */1738switch(state) {1739case path_excluded:1740if(dir->flags & DIR_SHOW_IGNORED)1741dir_add_name(dir, path.buf, path.len);1742else if((dir->flags & DIR_SHOW_IGNORED_TOO) ||1743((dir->flags & DIR_COLLECT_IGNORED) &&1744exclude_matches_pathspec(path.buf, path.len,1745 simplify)))1746dir_add_ignored(dir, path.buf, path.len);1747break;17481749case path_untracked:1750if(dir->flags & DIR_SHOW_IGNORED)1751break;1752dir_add_name(dir, path.buf, path.len);1753if(cdir.fdir)1754add_untracked(untracked, path.buf + baselen);1755break;17561757default:1758break;1759}1760}1761close_cached_dir(&cdir);1762 out:1763strbuf_release(&path);17641765return dir_state;1766}17671768static intcmp_name(const void*p1,const void*p2)1769{1770const struct dir_entry *e1 = *(const struct dir_entry **)p1;1771const struct dir_entry *e2 = *(const struct dir_entry **)p2;17721773returnname_compare(e1->name, e1->len, e2->name, e2->len);1774}17751776static struct path_simplify *create_simplify(const char**pathspec)1777{1778int nr, alloc =0;1779struct path_simplify *simplify = NULL;17801781if(!pathspec)1782return NULL;17831784for(nr =0; ; nr++) {1785const char*match;1786ALLOC_GROW(simplify, nr +1, alloc);1787 match = *pathspec++;1788if(!match)1789break;1790 simplify[nr].path = match;1791 simplify[nr].len =simple_length(match);1792}1793 simplify[nr].path = NULL;1794 simplify[nr].len =0;1795return simplify;1796}17971798static voidfree_simplify(struct path_simplify *simplify)1799{1800free(simplify);1801}18021803static inttreat_leading_path(struct dir_struct *dir,1804const char*path,int len,1805const struct path_simplify *simplify)1806{1807struct strbuf sb = STRBUF_INIT;1808int baselen, rc =0;1809const char*cp;1810int old_flags = dir->flags;18111812while(len && path[len -1] =='/')1813 len--;1814if(!len)1815return1;1816 baselen =0;1817 dir->flags &= ~DIR_SHOW_OTHER_DIRECTORIES;1818while(1) {1819 cp = path + baselen + !!baselen;1820 cp =memchr(cp,'/', path + len - cp);1821if(!cp)1822 baselen = len;1823else1824 baselen = cp - path;1825strbuf_setlen(&sb,0);1826strbuf_add(&sb, path, baselen);1827if(!is_directory(sb.buf))1828break;1829if(simplify_away(sb.buf, sb.len, simplify))1830break;1831if(treat_one_path(dir, NULL, &sb, simplify,1832 DT_DIR, NULL) == path_none)1833break;/* do not recurse into it */1834if(len <= baselen) {1835 rc =1;1836break;/* finished checking */1837}1838}1839strbuf_release(&sb);1840 dir->flags = old_flags;1841return rc;1842}18431844static const char*get_ident_string(void)1845{1846static struct strbuf sb = STRBUF_INIT;1847struct utsname uts;18481849if(sb.len)1850return sb.buf;1851if(uname(&uts))1852die_errno(_("failed to get kernel name and information"));1853strbuf_addf(&sb,"Location%s, system%s %s %s",get_git_work_tree(),1854 uts.sysname, uts.release, uts.version);1855return sb.buf;1856}18571858static intident_in_untracked(const struct untracked_cache *uc)1859{1860const char*end = uc->ident.buf + uc->ident.len;1861const char*p = uc->ident.buf;18621863for(p = uc->ident.buf; p < end; p +=strlen(p) +1)1864if(!strcmp(p,get_ident_string()))1865return1;1866return0;1867}18681869voidadd_untracked_ident(struct untracked_cache *uc)1870{1871if(ident_in_untracked(uc))1872return;1873strbuf_addstr(&uc->ident,get_ident_string());1874/* this strbuf contains a list of strings, save NUL too */1875strbuf_addch(&uc->ident,0);1876}18771878static struct untracked_cache_dir *validate_untracked_cache(struct dir_struct *dir,1879int base_len,1880const struct pathspec *pathspec)1881{1882struct untracked_cache_dir *root;1883int i;18841885if(!dir->untracked ||getenv("GIT_DISABLE_UNTRACKED_CACHE"))1886return NULL;18871888/*1889 * We only support $GIT_DIR/info/exclude and core.excludesfile1890 * as the global ignore rule files. Any other additions1891 * (e.g. from command line) invalidate the cache. This1892 * condition also catches running setup_standard_excludes()1893 * before setting dir->untracked!1894 */1895if(dir->unmanaged_exclude_files)1896return NULL;18971898/*1899 * Optimize for the main use case only: whole-tree git1900 * status. More work involved in treat_leading_path() if we1901 * use cache on just a subset of the worktree. pathspec1902 * support could make the matter even worse.1903 */1904if(base_len || (pathspec && pathspec->nr))1905return NULL;19061907/* Different set of flags may produce different results */1908if(dir->flags != dir->untracked->dir_flags ||1909/*1910 * See treat_directory(), case index_nonexistent. Without1911 * this flag, we may need to also cache .git file content1912 * for the resolve_gitlink_ref() call, which we don't.1913 */1914!(dir->flags & DIR_SHOW_OTHER_DIRECTORIES) ||1915/* We don't support collecting ignore files */1916(dir->flags & (DIR_SHOW_IGNORED | DIR_SHOW_IGNORED_TOO |1917 DIR_COLLECT_IGNORED)))1918return NULL;19191920/*1921 * If we use .gitignore in the cache and now you change it to1922 * .gitexclude, everything will go wrong.1923 */1924if(dir->exclude_per_dir != dir->untracked->exclude_per_dir &&1925strcmp(dir->exclude_per_dir, dir->untracked->exclude_per_dir))1926return NULL;19271928/*1929 * EXC_CMDL is not considered in the cache. If people set it,1930 * skip the cache.1931 */1932if(dir->exclude_list_group[EXC_CMDL].nr)1933return NULL;19341935/*1936 * An optimization in prep_exclude() does not play well with1937 * CE_SKIP_WORKTREE. It's a rare case anyway, if a single1938 * entry has that bit set, disable the whole untracked cache.1939 */1940for(i =0; i < active_nr; i++)1941if(ce_skip_worktree(active_cache[i]))1942return NULL;19431944if(!ident_in_untracked(dir->untracked)) {1945warning(_("Untracked cache is disabled on this system."));1946return NULL;1947}19481949if(!dir->untracked->root) {1950const int len =sizeof(*dir->untracked->root);1951 dir->untracked->root =xmalloc(len);1952memset(dir->untracked->root,0, len);1953}19541955/* Validate $GIT_DIR/info/exclude and core.excludesfile */1956 root = dir->untracked->root;1957if(hashcmp(dir->ss_info_exclude.sha1,1958 dir->untracked->ss_info_exclude.sha1)) {1959invalidate_gitignore(dir->untracked, root);1960 dir->untracked->ss_info_exclude = dir->ss_info_exclude;1961}1962if(hashcmp(dir->ss_excludes_file.sha1,1963 dir->untracked->ss_excludes_file.sha1)) {1964invalidate_gitignore(dir->untracked, root);1965 dir->untracked->ss_excludes_file = dir->ss_excludes_file;1966}19671968/* Make sure this directory is not dropped out at saving phase */1969 root->recurse =1;1970return root;1971}19721973intread_directory(struct dir_struct *dir,const char*path,int len,const struct pathspec *pathspec)1974{1975struct path_simplify *simplify;1976struct untracked_cache_dir *untracked;19771978/*1979 * Check out create_simplify()1980 */1981if(pathspec)1982GUARD_PATHSPEC(pathspec,1983 PATHSPEC_FROMTOP |1984 PATHSPEC_MAXDEPTH |1985 PATHSPEC_LITERAL |1986 PATHSPEC_GLOB |1987 PATHSPEC_ICASE |1988 PATHSPEC_EXCLUDE);19891990if(has_symlink_leading_path(path, len))1991return dir->nr;19921993/*1994 * exclude patterns are treated like positive ones in1995 * create_simplify. Usually exclude patterns should be a1996 * subset of positive ones, which has no impacts on1997 * create_simplify().1998 */1999 simplify =create_simplify(pathspec ? pathspec->_raw : NULL);2000 untracked =validate_untracked_cache(dir, len, pathspec);2001if(!untracked)2002/*2003 * make sure untracked cache code path is disabled,2004 * e.g. prep_exclude()2005 */2006 dir->untracked = NULL;2007if(!len ||treat_leading_path(dir, path, len, simplify))2008read_directory_recursive(dir, path, len, untracked,0, simplify);2009free_simplify(simplify);2010qsort(dir->entries, dir->nr,sizeof(struct dir_entry *), cmp_name);2011qsort(dir->ignored, dir->ignored_nr,sizeof(struct dir_entry *), cmp_name);2012if(dir->untracked) {2013static struct trace_key trace_untracked_stats =TRACE_KEY_INIT(UNTRACKED_STATS);2014trace_printf_key(&trace_untracked_stats,2015"node creation:%u\n"2016"gitignore invalidation:%u\n"2017"directory invalidation:%u\n"2018"opendir:%u\n",2019 dir->untracked->dir_created,2020 dir->untracked->gitignore_invalidated,2021 dir->untracked->dir_invalidated,2022 dir->untracked->dir_opened);2023if(dir->untracked == the_index.untracked &&2024(dir->untracked->dir_opened ||2025 dir->untracked->gitignore_invalidated ||2026 dir->untracked->dir_invalidated))2027 the_index.cache_changed |= UNTRACKED_CHANGED;2028if(dir->untracked != the_index.untracked) {2029free(dir->untracked);2030 dir->untracked = NULL;2031}2032}2033return dir->nr;2034}20352036intfile_exists(const char*f)2037{2038struct stat sb;2039returnlstat(f, &sb) ==0;2040}20412042/*2043 * Given two normalized paths (a trailing slash is ok), if subdir is2044 * outside dir, return -1. Otherwise return the offset in subdir that2045 * can be used as relative path to dir.2046 */2047intdir_inside_of(const char*subdir,const char*dir)2048{2049int offset =0;20502051assert(dir && subdir && *dir && *subdir);20522053while(*dir && *subdir && *dir == *subdir) {2054 dir++;2055 subdir++;2056 offset++;2057}20582059/* hel[p]/me vs hel[l]/yeah */2060if(*dir && *subdir)2061return-1;20622063if(!*subdir)2064return!*dir ? offset : -1;/* same dir */20652066/* foo/[b]ar vs foo/[] */2067if(is_dir_sep(dir[-1]))2068returnis_dir_sep(subdir[-1]) ? offset : -1;20692070/* foo[/]bar vs foo[] */2071returnis_dir_sep(*subdir) ? offset +1: -1;2072}20732074intis_inside_dir(const char*dir)2075{2076char*cwd;2077int rc;20782079if(!dir)2080return0;20812082 cwd =xgetcwd();2083 rc = (dir_inside_of(cwd, dir) >=0);2084free(cwd);2085return rc;2086}20872088intis_empty_dir(const char*path)2089{2090DIR*dir =opendir(path);2091struct dirent *e;2092int ret =1;20932094if(!dir)2095return0;20962097while((e =readdir(dir)) != NULL)2098if(!is_dot_or_dotdot(e->d_name)) {2099 ret =0;2100break;2101}21022103closedir(dir);2104return ret;2105}21062107static intremove_dir_recurse(struct strbuf *path,int flag,int*kept_up)2108{2109DIR*dir;2110struct dirent *e;2111int ret =0, original_len = path->len, len, kept_down =0;2112int only_empty = (flag & REMOVE_DIR_EMPTY_ONLY);2113int keep_toplevel = (flag & REMOVE_DIR_KEEP_TOPLEVEL);2114unsigned char submodule_head[20];21152116if((flag & REMOVE_DIR_KEEP_NESTED_GIT) &&2117!resolve_gitlink_ref(path->buf,"HEAD", submodule_head)) {2118/* Do not descend and nuke a nested git work tree. */2119if(kept_up)2120*kept_up =1;2121return0;2122}21232124 flag &= ~REMOVE_DIR_KEEP_TOPLEVEL;2125 dir =opendir(path->buf);2126if(!dir) {2127if(errno == ENOENT)2128return keep_toplevel ? -1:0;2129else if(errno == EACCES && !keep_toplevel)2130/*2131 * An empty dir could be removable even if it2132 * is unreadable:2133 */2134returnrmdir(path->buf);2135else2136return-1;2137}2138if(path->buf[original_len -1] !='/')2139strbuf_addch(path,'/');21402141 len = path->len;2142while((e =readdir(dir)) != NULL) {2143struct stat st;2144if(is_dot_or_dotdot(e->d_name))2145continue;21462147strbuf_setlen(path, len);2148strbuf_addstr(path, e->d_name);2149if(lstat(path->buf, &st)) {2150if(errno == ENOENT)2151/*2152 * file disappeared, which is what we2153 * wanted anyway2154 */2155continue;2156/* fall thru */2157}else if(S_ISDIR(st.st_mode)) {2158if(!remove_dir_recurse(path, flag, &kept_down))2159continue;/* happy */2160}else if(!only_empty &&2161(!unlink(path->buf) || errno == ENOENT)) {2162continue;/* happy, too */2163}21642165/* path too long, stat fails, or non-directory still exists */2166 ret = -1;2167break;2168}2169closedir(dir);21702171strbuf_setlen(path, original_len);2172if(!ret && !keep_toplevel && !kept_down)2173 ret = (!rmdir(path->buf) || errno == ENOENT) ?0: -1;2174else if(kept_up)2175/*2176 * report the uplevel that it is not an error that we2177 * did not rmdir() our directory.2178 */2179*kept_up = !ret;2180return ret;2181}21822183intremove_dir_recursively(struct strbuf *path,int flag)2184{2185returnremove_dir_recurse(path, flag, NULL);2186}21872188voidsetup_standard_excludes(struct dir_struct *dir)2189{2190const char*path;21912192 dir->exclude_per_dir =".gitignore";21932194/* core.excludefile defaulting to $XDG_HOME/git/ignore */2195if(!excludes_file)2196 excludes_file =xdg_config_home("ignore");2197if(excludes_file && !access_or_warn(excludes_file, R_OK,0))2198add_excludes_from_file_1(dir, excludes_file,2199 dir->untracked ? &dir->ss_excludes_file : NULL);22002201/* per repository user preference */2202 path =git_path("info/exclude");2203if(!access_or_warn(path, R_OK,0))2204add_excludes_from_file_1(dir, path,2205 dir->untracked ? &dir->ss_info_exclude : NULL);2206}22072208intremove_path(const char*name)2209{2210char*slash;22112212if(unlink(name) && errno != ENOENT && errno != ENOTDIR)2213return-1;22142215 slash =strrchr(name,'/');2216if(slash) {2217char*dirs =xstrdup(name);2218 slash = dirs + (slash - name);2219do{2220*slash ='\0';2221}while(rmdir(dirs) ==0&& (slash =strrchr(dirs,'/')));2222free(dirs);2223}2224return0;2225}22262227/*2228 * Frees memory within dir which was allocated for exclude lists and2229 * the exclude_stack. Does not free dir itself.2230 */2231voidclear_directory(struct dir_struct *dir)2232{2233int i, j;2234struct exclude_list_group *group;2235struct exclude_list *el;2236struct exclude_stack *stk;22372238for(i = EXC_CMDL; i <= EXC_FILE; i++) {2239 group = &dir->exclude_list_group[i];2240for(j =0; j < group->nr; j++) {2241 el = &group->el[j];2242if(i == EXC_DIRS)2243free((char*)el->src);2244clear_exclude_list(el);2245}2246free(group->el);2247}22482249 stk = dir->exclude_stack;2250while(stk) {2251struct exclude_stack *prev = stk->prev;2252free(stk);2253 stk = prev;2254}2255strbuf_release(&dir->basebuf);2256}22572258struct ondisk_untracked_cache {2259struct stat_data info_exclude_stat;2260struct stat_data excludes_file_stat;2261uint32_t dir_flags;2262unsigned char info_exclude_sha1[20];2263unsigned char excludes_file_sha1[20];2264char exclude_per_dir[FLEX_ARRAY];2265};22662267#define ouc_size(len) (offsetof(struct ondisk_untracked_cache, exclude_per_dir) + len + 1)22682269struct write_data {2270int index;/* number of written untracked_cache_dir */2271struct ewah_bitmap *check_only;/* from untracked_cache_dir */2272struct ewah_bitmap *valid;/* from untracked_cache_dir */2273struct ewah_bitmap *sha1_valid;/* set if exclude_sha1 is not null */2274struct strbuf out;2275struct strbuf sb_stat;2276struct strbuf sb_sha1;2277};22782279static voidstat_data_to_disk(struct stat_data *to,const struct stat_data *from)2280{2281 to->sd_ctime.sec =htonl(from->sd_ctime.sec);2282 to->sd_ctime.nsec =htonl(from->sd_ctime.nsec);2283 to->sd_mtime.sec =htonl(from->sd_mtime.sec);2284 to->sd_mtime.nsec =htonl(from->sd_mtime.nsec);2285 to->sd_dev =htonl(from->sd_dev);2286 to->sd_ino =htonl(from->sd_ino);2287 to->sd_uid =htonl(from->sd_uid);2288 to->sd_gid =htonl(from->sd_gid);2289 to->sd_size =htonl(from->sd_size);2290}22912292static voidwrite_one_dir(struct untracked_cache_dir *untracked,2293struct write_data *wd)2294{2295struct stat_data stat_data;2296struct strbuf *out = &wd->out;2297unsigned char intbuf[16];2298unsigned int intlen, value;2299int i = wd->index++;23002301/*2302 * untracked_nr should be reset whenever valid is clear, but2303 * for safety..2304 */2305if(!untracked->valid) {2306 untracked->untracked_nr =0;2307 untracked->check_only =0;2308}23092310if(untracked->check_only)2311ewah_set(wd->check_only, i);2312if(untracked->valid) {2313ewah_set(wd->valid, i);2314stat_data_to_disk(&stat_data, &untracked->stat_data);2315strbuf_add(&wd->sb_stat, &stat_data,sizeof(stat_data));2316}2317if(!is_null_sha1(untracked->exclude_sha1)) {2318ewah_set(wd->sha1_valid, i);2319strbuf_add(&wd->sb_sha1, untracked->exclude_sha1,20);2320}23212322 intlen =encode_varint(untracked->untracked_nr, intbuf);2323strbuf_add(out, intbuf, intlen);23242325/* skip non-recurse directories */2326for(i =0, value =0; i < untracked->dirs_nr; i++)2327if(untracked->dirs[i]->recurse)2328 value++;2329 intlen =encode_varint(value, intbuf);2330strbuf_add(out, intbuf, intlen);23312332strbuf_add(out, untracked->name,strlen(untracked->name) +1);23332334for(i =0; i < untracked->untracked_nr; i++)2335strbuf_add(out, untracked->untracked[i],2336strlen(untracked->untracked[i]) +1);23372338for(i =0; i < untracked->dirs_nr; i++)2339if(untracked->dirs[i]->recurse)2340write_one_dir(untracked->dirs[i], wd);2341}23422343voidwrite_untracked_extension(struct strbuf *out,struct untracked_cache *untracked)2344{2345struct ondisk_untracked_cache *ouc;2346struct write_data wd;2347unsigned char varbuf[16];2348int len =0, varint_len;2349if(untracked->exclude_per_dir)2350 len =strlen(untracked->exclude_per_dir);2351 ouc =xmalloc(sizeof(*ouc) + len +1);2352stat_data_to_disk(&ouc->info_exclude_stat, &untracked->ss_info_exclude.stat);2353stat_data_to_disk(&ouc->excludes_file_stat, &untracked->ss_excludes_file.stat);2354hashcpy(ouc->info_exclude_sha1, untracked->ss_info_exclude.sha1);2355hashcpy(ouc->excludes_file_sha1, untracked->ss_excludes_file.sha1);2356 ouc->dir_flags =htonl(untracked->dir_flags);2357memcpy(ouc->exclude_per_dir, untracked->exclude_per_dir, len +1);23582359 varint_len =encode_varint(untracked->ident.len, varbuf);2360strbuf_add(out, varbuf, varint_len);2361strbuf_add(out, untracked->ident.buf, untracked->ident.len);23622363strbuf_add(out, ouc,ouc_size(len));2364free(ouc);2365 ouc = NULL;23662367if(!untracked->root) {2368 varint_len =encode_varint(0, varbuf);2369strbuf_add(out, varbuf, varint_len);2370return;2371}23722373 wd.index =0;2374 wd.check_only =ewah_new();2375 wd.valid =ewah_new();2376 wd.sha1_valid =ewah_new();2377strbuf_init(&wd.out,1024);2378strbuf_init(&wd.sb_stat,1024);2379strbuf_init(&wd.sb_sha1,1024);2380write_one_dir(untracked->root, &wd);23812382 varint_len =encode_varint(wd.index, varbuf);2383strbuf_add(out, varbuf, varint_len);2384strbuf_addbuf(out, &wd.out);2385ewah_serialize_strbuf(wd.valid, out);2386ewah_serialize_strbuf(wd.check_only, out);2387ewah_serialize_strbuf(wd.sha1_valid, out);2388strbuf_addbuf(out, &wd.sb_stat);2389strbuf_addbuf(out, &wd.sb_sha1);2390strbuf_addch(out,'\0');/* safe guard for string lists */23912392ewah_free(wd.valid);2393ewah_free(wd.check_only);2394ewah_free(wd.sha1_valid);2395strbuf_release(&wd.out);2396strbuf_release(&wd.sb_stat);2397strbuf_release(&wd.sb_sha1);2398}23992400static voidfree_untracked(struct untracked_cache_dir *ucd)2401{2402int i;2403if(!ucd)2404return;2405for(i =0; i < ucd->dirs_nr; i++)2406free_untracked(ucd->dirs[i]);2407for(i =0; i < ucd->untracked_nr; i++)2408free(ucd->untracked[i]);2409free(ucd->untracked);2410free(ucd->dirs);2411free(ucd);2412}24132414voidfree_untracked_cache(struct untracked_cache *uc)2415{2416if(uc)2417free_untracked(uc->root);2418free(uc);2419}24202421struct read_data {2422int index;2423struct untracked_cache_dir **ucd;2424struct ewah_bitmap *check_only;2425struct ewah_bitmap *valid;2426struct ewah_bitmap *sha1_valid;2427const unsigned char*data;2428const unsigned char*end;2429};24302431static voidstat_data_from_disk(struct stat_data *to,const struct stat_data *from)2432{2433 to->sd_ctime.sec =get_be32(&from->sd_ctime.sec);2434 to->sd_ctime.nsec =get_be32(&from->sd_ctime.nsec);2435 to->sd_mtime.sec =get_be32(&from->sd_mtime.sec);2436 to->sd_mtime.nsec =get_be32(&from->sd_mtime.nsec);2437 to->sd_dev =get_be32(&from->sd_dev);2438 to->sd_ino =get_be32(&from->sd_ino);2439 to->sd_uid =get_be32(&from->sd_uid);2440 to->sd_gid =get_be32(&from->sd_gid);2441 to->sd_size =get_be32(&from->sd_size);2442}24432444static intread_one_dir(struct untracked_cache_dir **untracked_,2445struct read_data *rd)2446{2447struct untracked_cache_dir ud, *untracked;2448const unsigned char*next, *data = rd->data, *end = rd->end;2449unsigned int value;2450int i, len;24512452memset(&ud,0,sizeof(ud));24532454 next = data;2455 value =decode_varint(&next);2456if(next > end)2457return-1;2458 ud.recurse =1;2459 ud.untracked_alloc = value;2460 ud.untracked_nr = value;2461if(ud.untracked_nr)2462 ud.untracked =xmalloc(sizeof(*ud.untracked) * ud.untracked_nr);2463 data = next;24642465 next = data;2466 ud.dirs_alloc = ud.dirs_nr =decode_varint(&next);2467if(next > end)2468return-1;2469 ud.dirs =xmalloc(sizeof(*ud.dirs) * ud.dirs_nr);2470 data = next;24712472 len =strlen((const char*)data);2473 next = data + len +1;2474if(next > rd->end)2475return-1;2476*untracked_ = untracked =xmalloc(sizeof(*untracked) + len);2477memcpy(untracked, &ud,sizeof(ud));2478memcpy(untracked->name, data, len +1);2479 data = next;24802481for(i =0; i < untracked->untracked_nr; i++) {2482 len =strlen((const char*)data);2483 next = data + len +1;2484if(next > rd->end)2485return-1;2486 untracked->untracked[i] =xstrdup((const char*)data);2487 data = next;2488}24892490 rd->ucd[rd->index++] = untracked;2491 rd->data = data;24922493for(i =0; i < untracked->dirs_nr; i++) {2494 len =read_one_dir(untracked->dirs + i, rd);2495if(len <0)2496return-1;2497}2498return0;2499}25002501static voidset_check_only(size_t pos,void*cb)2502{2503struct read_data *rd = cb;2504struct untracked_cache_dir *ud = rd->ucd[pos];2505 ud->check_only =1;2506}25072508static voidread_stat(size_t pos,void*cb)2509{2510struct read_data *rd = cb;2511struct untracked_cache_dir *ud = rd->ucd[pos];2512if(rd->data +sizeof(struct stat_data) > rd->end) {2513 rd->data = rd->end +1;2514return;2515}2516stat_data_from_disk(&ud->stat_data, (struct stat_data *)rd->data);2517 rd->data +=sizeof(struct stat_data);2518 ud->valid =1;2519}25202521static voidread_sha1(size_t pos,void*cb)2522{2523struct read_data *rd = cb;2524struct untracked_cache_dir *ud = rd->ucd[pos];2525if(rd->data +20> rd->end) {2526 rd->data = rd->end +1;2527return;2528}2529hashcpy(ud->exclude_sha1, rd->data);2530 rd->data +=20;2531}25322533static voidload_sha1_stat(struct sha1_stat *sha1_stat,2534const struct stat_data *stat,2535const unsigned char*sha1)2536{2537stat_data_from_disk(&sha1_stat->stat, stat);2538hashcpy(sha1_stat->sha1, sha1);2539 sha1_stat->valid =1;2540}25412542struct untracked_cache *read_untracked_extension(const void*data,unsigned long sz)2543{2544const struct ondisk_untracked_cache *ouc;2545struct untracked_cache *uc;2546struct read_data rd;2547const unsigned char*next = data, *end = (const unsigned char*)data + sz;2548const char*ident;2549int ident_len, len;25502551if(sz <=1|| end[-1] !='\0')2552return NULL;2553 end--;25542555 ident_len =decode_varint(&next);2556if(next + ident_len > end)2557return NULL;2558 ident = (const char*)next;2559 next += ident_len;25602561 ouc = (const struct ondisk_untracked_cache *)next;2562if(next +ouc_size(0) > end)2563return NULL;25642565 uc =xcalloc(1,sizeof(*uc));2566strbuf_init(&uc->ident, ident_len);2567strbuf_add(&uc->ident, ident, ident_len);2568load_sha1_stat(&uc->ss_info_exclude, &ouc->info_exclude_stat,2569 ouc->info_exclude_sha1);2570load_sha1_stat(&uc->ss_excludes_file, &ouc->excludes_file_stat,2571 ouc->excludes_file_sha1);2572 uc->dir_flags =get_be32(&ouc->dir_flags);2573 uc->exclude_per_dir =xstrdup(ouc->exclude_per_dir);2574/* NUL after exclude_per_dir is covered by sizeof(*ouc) */2575 next +=ouc_size(strlen(ouc->exclude_per_dir));2576if(next >= end)2577goto done2;25782579 len =decode_varint(&next);2580if(next > end || len ==0)2581goto done2;25822583 rd.valid =ewah_new();2584 rd.check_only =ewah_new();2585 rd.sha1_valid =ewah_new();2586 rd.data = next;2587 rd.end = end;2588 rd.index =0;2589 rd.ucd =xmalloc(sizeof(*rd.ucd) * len);25902591if(read_one_dir(&uc->root, &rd) || rd.index != len)2592goto done;25932594 next = rd.data;2595 len =ewah_read_mmap(rd.valid, next, end - next);2596if(len <0)2597goto done;25982599 next += len;2600 len =ewah_read_mmap(rd.check_only, next, end - next);2601if(len <0)2602goto done;26032604 next += len;2605 len =ewah_read_mmap(rd.sha1_valid, next, end - next);2606if(len <0)2607goto done;26082609ewah_each_bit(rd.check_only, set_check_only, &rd);2610 rd.data = next + len;2611ewah_each_bit(rd.valid, read_stat, &rd);2612ewah_each_bit(rd.sha1_valid, read_sha1, &rd);2613 next = rd.data;26142615done:2616free(rd.ucd);2617ewah_free(rd.valid);2618ewah_free(rd.check_only);2619ewah_free(rd.sha1_valid);2620done2:2621if(next != end) {2622free_untracked_cache(uc);2623 uc = NULL;2624}2625return uc;2626}26272628voiduntracked_cache_invalidate_path(struct index_state *istate,2629const char*path)2630{2631const char*sep;2632struct untracked_cache_dir *d;2633if(!istate->untracked || !istate->untracked->root)2634return;2635 sep =strrchr(path,'/');2636if(sep)2637 d =lookup_untracked(istate->untracked,2638 istate->untracked->root,2639 path, sep - path);2640else2641 d = istate->untracked->root;2642 istate->untracked->dir_invalidated++;2643 d->valid =0;2644 d->untracked_nr =0;2645}26462647voiduntracked_cache_remove_from_index(struct index_state *istate,2648const char*path)2649{2650untracked_cache_invalidate_path(istate, path);2651}26522653voiduntracked_cache_add_to_index(struct index_state *istate,2654const char*path)2655{2656untracked_cache_invalidate_path(istate, path);2657}