1/* 2 * GIT - The information manager from hell 3 * 4 * Copyright (C) Linus Torvalds, 2005 5 */ 6#define NO_THE_INDEX_COMPATIBILITY_MACROS 7#include"cache.h" 8#include"tempfile.h" 9#include"lockfile.h" 10#include"cache-tree.h" 11#include"refs.h" 12#include"dir.h" 13#include"tree.h" 14#include"commit.h" 15#include"blob.h" 16#include"resolve-undo.h" 17#include"strbuf.h" 18#include"varint.h" 19#include"split-index.h" 20#include"utf8.h" 21 22/* Mask for the name length in ce_flags in the on-disk index */ 23 24#define CE_NAMEMASK (0x0fff) 25 26/* Index extensions. 27 * 28 * The first letter should be 'A'..'Z' for extensions that are not 29 * necessary for a correct operation (i.e. optimization data). 30 * When new extensions are added that _needs_ to be understood in 31 * order to correctly interpret the index file, pick character that 32 * is outside the range, to cause the reader to abort. 33 */ 34 35#define CACHE_EXT(s) ( (s[0]<<24)|(s[1]<<16)|(s[2]<<8)|(s[3]) ) 36#define CACHE_EXT_TREE 0x54524545/* "TREE" */ 37#define CACHE_EXT_RESOLVE_UNDO 0x52455543/* "REUC" */ 38#define CACHE_EXT_LINK 0x6c696e6b/* "link" */ 39#define CACHE_EXT_UNTRACKED 0x554E5452/* "UNTR" */ 40 41/* changes that can be kept in $GIT_DIR/index (basically all extensions) */ 42#define EXTMASK (RESOLVE_UNDO_CHANGED | CACHE_TREE_CHANGED | \ 43 CE_ENTRY_ADDED | CE_ENTRY_REMOVED | CE_ENTRY_CHANGED | \ 44 SPLIT_INDEX_ORDERED | UNTRACKED_CHANGED) 45 46struct index_state the_index; 47static const char*alternate_index_output; 48 49static voidset_index_entry(struct index_state *istate,int nr,struct cache_entry *ce) 50{ 51 istate->cache[nr] = ce; 52add_name_hash(istate, ce); 53} 54 55static voidreplace_index_entry(struct index_state *istate,int nr,struct cache_entry *ce) 56{ 57struct cache_entry *old = istate->cache[nr]; 58 59replace_index_entry_in_base(istate, old, ce); 60remove_name_hash(istate, old); 61free(old); 62set_index_entry(istate, nr, ce); 63 ce->ce_flags |= CE_UPDATE_IN_BASE; 64 istate->cache_changed |= CE_ENTRY_CHANGED; 65} 66 67voidrename_index_entry_at(struct index_state *istate,int nr,const char*new_name) 68{ 69struct cache_entry *old = istate->cache[nr], *new; 70int namelen =strlen(new_name); 71 72new=xmalloc(cache_entry_size(namelen)); 73copy_cache_entry(new, old); 74new->ce_flags &= ~CE_HASHED; 75new->ce_namelen = namelen; 76new->index =0; 77memcpy(new->name, new_name, namelen +1); 78 79cache_tree_invalidate_path(istate, old->name); 80untracked_cache_remove_from_index(istate, old->name); 81remove_index_entry_at(istate, nr); 82add_index_entry(istate,new, ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE); 83} 84 85voidfill_stat_data(struct stat_data *sd,struct stat *st) 86{ 87 sd->sd_ctime.sec = (unsigned int)st->st_ctime; 88 sd->sd_mtime.sec = (unsigned int)st->st_mtime; 89 sd->sd_ctime.nsec =ST_CTIME_NSEC(*st); 90 sd->sd_mtime.nsec =ST_MTIME_NSEC(*st); 91 sd->sd_dev = st->st_dev; 92 sd->sd_ino = st->st_ino; 93 sd->sd_uid = st->st_uid; 94 sd->sd_gid = st->st_gid; 95 sd->sd_size = st->st_size; 96} 97 98intmatch_stat_data(const struct stat_data *sd,struct stat *st) 99{ 100int changed =0; 101 102if(sd->sd_mtime.sec != (unsigned int)st->st_mtime) 103 changed |= MTIME_CHANGED; 104if(trust_ctime && check_stat && 105 sd->sd_ctime.sec != (unsigned int)st->st_ctime) 106 changed |= CTIME_CHANGED; 107 108#ifdef USE_NSEC 109if(check_stat && sd->sd_mtime.nsec !=ST_MTIME_NSEC(*st)) 110 changed |= MTIME_CHANGED; 111if(trust_ctime && check_stat && 112 sd->sd_ctime.nsec !=ST_CTIME_NSEC(*st)) 113 changed |= CTIME_CHANGED; 114#endif 115 116if(check_stat) { 117if(sd->sd_uid != (unsigned int) st->st_uid || 118 sd->sd_gid != (unsigned int) st->st_gid) 119 changed |= OWNER_CHANGED; 120if(sd->sd_ino != (unsigned int) st->st_ino) 121 changed |= INODE_CHANGED; 122} 123 124#ifdef USE_STDEV 125/* 126 * st_dev breaks on network filesystems where different 127 * clients will have different views of what "device" 128 * the filesystem is on 129 */ 130if(check_stat && sd->sd_dev != (unsigned int) st->st_dev) 131 changed |= INODE_CHANGED; 132#endif 133 134if(sd->sd_size != (unsigned int) st->st_size) 135 changed |= DATA_CHANGED; 136 137return changed; 138} 139 140/* 141 * This only updates the "non-critical" parts of the directory 142 * cache, ie the parts that aren't tracked by GIT, and only used 143 * to validate the cache. 144 */ 145voidfill_stat_cache_info(struct cache_entry *ce,struct stat *st) 146{ 147fill_stat_data(&ce->ce_stat_data, st); 148 149if(assume_unchanged) 150 ce->ce_flags |= CE_VALID; 151 152if(S_ISREG(st->st_mode)) 153ce_mark_uptodate(ce); 154} 155 156static intce_compare_data(const struct cache_entry *ce,struct stat *st) 157{ 158int match = -1; 159int fd =open(ce->name, O_RDONLY); 160 161if(fd >=0) { 162unsigned char sha1[20]; 163if(!index_fd(sha1, fd, st, OBJ_BLOB, ce->name,0)) 164 match =hashcmp(sha1, ce->oid.hash); 165/* index_fd() closed the file descriptor already */ 166} 167return match; 168} 169 170static intce_compare_link(const struct cache_entry *ce,size_t expected_size) 171{ 172int match = -1; 173void*buffer; 174unsigned long size; 175enum object_type type; 176struct strbuf sb = STRBUF_INIT; 177 178if(strbuf_readlink(&sb, ce->name, expected_size)) 179return-1; 180 181 buffer =read_sha1_file(ce->oid.hash, &type, &size); 182if(buffer) { 183if(size == sb.len) 184 match =memcmp(buffer, sb.buf, size); 185free(buffer); 186} 187strbuf_release(&sb); 188return match; 189} 190 191static intce_compare_gitlink(const struct cache_entry *ce) 192{ 193unsigned char sha1[20]; 194 195/* 196 * We don't actually require that the .git directory 197 * under GITLINK directory be a valid git directory. It 198 * might even be missing (in case nobody populated that 199 * sub-project). 200 * 201 * If so, we consider it always to match. 202 */ 203if(resolve_gitlink_ref(ce->name,"HEAD", sha1) <0) 204return0; 205returnhashcmp(sha1, ce->oid.hash); 206} 207 208static intce_modified_check_fs(const struct cache_entry *ce,struct stat *st) 209{ 210switch(st->st_mode & S_IFMT) { 211case S_IFREG: 212if(ce_compare_data(ce, st)) 213return DATA_CHANGED; 214break; 215case S_IFLNK: 216if(ce_compare_link(ce,xsize_t(st->st_size))) 217return DATA_CHANGED; 218break; 219case S_IFDIR: 220if(S_ISGITLINK(ce->ce_mode)) 221returnce_compare_gitlink(ce) ? DATA_CHANGED :0; 222default: 223return TYPE_CHANGED; 224} 225return0; 226} 227 228static intce_match_stat_basic(const struct cache_entry *ce,struct stat *st) 229{ 230unsigned int changed =0; 231 232if(ce->ce_flags & CE_REMOVE) 233return MODE_CHANGED | DATA_CHANGED | TYPE_CHANGED; 234 235switch(ce->ce_mode & S_IFMT) { 236case S_IFREG: 237 changed |= !S_ISREG(st->st_mode) ? TYPE_CHANGED :0; 238/* We consider only the owner x bit to be relevant for 239 * "mode changes" 240 */ 241if(trust_executable_bit && 242(0100& (ce->ce_mode ^ st->st_mode))) 243 changed |= MODE_CHANGED; 244break; 245case S_IFLNK: 246if(!S_ISLNK(st->st_mode) && 247(has_symlinks || !S_ISREG(st->st_mode))) 248 changed |= TYPE_CHANGED; 249break; 250case S_IFGITLINK: 251/* We ignore most of the st_xxx fields for gitlinks */ 252if(!S_ISDIR(st->st_mode)) 253 changed |= TYPE_CHANGED; 254else if(ce_compare_gitlink(ce)) 255 changed |= DATA_CHANGED; 256return changed; 257default: 258die("internal error: ce_mode is%o", ce->ce_mode); 259} 260 261 changed |=match_stat_data(&ce->ce_stat_data, st); 262 263/* Racily smudged entry? */ 264if(!ce->ce_stat_data.sd_size) { 265if(!is_empty_blob_sha1(ce->oid.hash)) 266 changed |= DATA_CHANGED; 267} 268 269return changed; 270} 271 272static intis_racy_stat(const struct index_state *istate, 273const struct stat_data *sd) 274{ 275return(istate->timestamp.sec && 276#ifdef USE_NSEC 277/* nanosecond timestamped files can also be racy! */ 278(istate->timestamp.sec < sd->sd_mtime.sec || 279(istate->timestamp.sec == sd->sd_mtime.sec && 280 istate->timestamp.nsec <= sd->sd_mtime.nsec)) 281#else 282 istate->timestamp.sec <= sd->sd_mtime.sec 283#endif 284); 285} 286 287static intis_racy_timestamp(const struct index_state *istate, 288const struct cache_entry *ce) 289{ 290return(!S_ISGITLINK(ce->ce_mode) && 291is_racy_stat(istate, &ce->ce_stat_data)); 292} 293 294intmatch_stat_data_racy(const struct index_state *istate, 295const struct stat_data *sd,struct stat *st) 296{ 297if(is_racy_stat(istate, sd)) 298return MTIME_CHANGED; 299returnmatch_stat_data(sd, st); 300} 301 302intie_match_stat(const struct index_state *istate, 303const struct cache_entry *ce,struct stat *st, 304unsigned int options) 305{ 306unsigned int changed; 307int ignore_valid = options & CE_MATCH_IGNORE_VALID; 308int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE; 309int assume_racy_is_modified = options & CE_MATCH_RACY_IS_DIRTY; 310 311/* 312 * If it's marked as always valid in the index, it's 313 * valid whatever the checked-out copy says. 314 * 315 * skip-worktree has the same effect with higher precedence 316 */ 317if(!ignore_skip_worktree &&ce_skip_worktree(ce)) 318return0; 319if(!ignore_valid && (ce->ce_flags & CE_VALID)) 320return0; 321 322/* 323 * Intent-to-add entries have not been added, so the index entry 324 * by definition never matches what is in the work tree until it 325 * actually gets added. 326 */ 327if(ce_intent_to_add(ce)) 328return DATA_CHANGED | TYPE_CHANGED | MODE_CHANGED; 329 330 changed =ce_match_stat_basic(ce, st); 331 332/* 333 * Within 1 second of this sequence: 334 * echo xyzzy >file && git-update-index --add file 335 * running this command: 336 * echo frotz >file 337 * would give a falsely clean cache entry. The mtime and 338 * length match the cache, and other stat fields do not change. 339 * 340 * We could detect this at update-index time (the cache entry 341 * being registered/updated records the same time as "now") 342 * and delay the return from git-update-index, but that would 343 * effectively mean we can make at most one commit per second, 344 * which is not acceptable. Instead, we check cache entries 345 * whose mtime are the same as the index file timestamp more 346 * carefully than others. 347 */ 348if(!changed &&is_racy_timestamp(istate, ce)) { 349if(assume_racy_is_modified) 350 changed |= DATA_CHANGED; 351else 352 changed |=ce_modified_check_fs(ce, st); 353} 354 355return changed; 356} 357 358intie_modified(const struct index_state *istate, 359const struct cache_entry *ce, 360struct stat *st,unsigned int options) 361{ 362int changed, changed_fs; 363 364 changed =ie_match_stat(istate, ce, st, options); 365if(!changed) 366return0; 367/* 368 * If the mode or type has changed, there's no point in trying 369 * to refresh the entry - it's not going to match 370 */ 371if(changed & (MODE_CHANGED | TYPE_CHANGED)) 372return changed; 373 374/* 375 * Immediately after read-tree or update-index --cacheinfo, 376 * the length field is zero, as we have never even read the 377 * lstat(2) information once, and we cannot trust DATA_CHANGED 378 * returned by ie_match_stat() which in turn was returned by 379 * ce_match_stat_basic() to signal that the filesize of the 380 * blob changed. We have to actually go to the filesystem to 381 * see if the contents match, and if so, should answer "unchanged". 382 * 383 * The logic does not apply to gitlinks, as ce_match_stat_basic() 384 * already has checked the actual HEAD from the filesystem in the 385 * subproject. If ie_match_stat() already said it is different, 386 * then we know it is. 387 */ 388if((changed & DATA_CHANGED) && 389(S_ISGITLINK(ce->ce_mode) || ce->ce_stat_data.sd_size !=0)) 390return changed; 391 392 changed_fs =ce_modified_check_fs(ce, st); 393if(changed_fs) 394return changed | changed_fs; 395return0; 396} 397 398intbase_name_compare(const char*name1,int len1,int mode1, 399const char*name2,int len2,int mode2) 400{ 401unsigned char c1, c2; 402int len = len1 < len2 ? len1 : len2; 403int cmp; 404 405 cmp =memcmp(name1, name2, len); 406if(cmp) 407return cmp; 408 c1 = name1[len]; 409 c2 = name2[len]; 410if(!c1 &&S_ISDIR(mode1)) 411 c1 ='/'; 412if(!c2 &&S_ISDIR(mode2)) 413 c2 ='/'; 414return(c1 < c2) ? -1: (c1 > c2) ?1:0; 415} 416 417/* 418 * df_name_compare() is identical to base_name_compare(), except it 419 * compares conflicting directory/file entries as equal. Note that 420 * while a directory name compares as equal to a regular file, they 421 * then individually compare _differently_ to a filename that has 422 * a dot after the basename (because '\0' < '.' < '/'). 423 * 424 * This is used by routines that want to traverse the git namespace 425 * but then handle conflicting entries together when possible. 426 */ 427intdf_name_compare(const char*name1,int len1,int mode1, 428const char*name2,int len2,int mode2) 429{ 430int len = len1 < len2 ? len1 : len2, cmp; 431unsigned char c1, c2; 432 433 cmp =memcmp(name1, name2, len); 434if(cmp) 435return cmp; 436/* Directories and files compare equal (same length, same name) */ 437if(len1 == len2) 438return0; 439 c1 = name1[len]; 440if(!c1 &&S_ISDIR(mode1)) 441 c1 ='/'; 442 c2 = name2[len]; 443if(!c2 &&S_ISDIR(mode2)) 444 c2 ='/'; 445if(c1 =='/'&& !c2) 446return0; 447if(c2 =='/'&& !c1) 448return0; 449return c1 - c2; 450} 451 452intname_compare(const char*name1,size_t len1,const char*name2,size_t len2) 453{ 454size_t min_len = (len1 < len2) ? len1 : len2; 455int cmp =memcmp(name1, name2, min_len); 456if(cmp) 457return cmp; 458if(len1 < len2) 459return-1; 460if(len1 > len2) 461return1; 462return0; 463} 464 465intcache_name_stage_compare(const char*name1,int len1,int stage1,const char*name2,int len2,int stage2) 466{ 467int cmp; 468 469 cmp =name_compare(name1, len1, name2, len2); 470if(cmp) 471return cmp; 472 473if(stage1 < stage2) 474return-1; 475if(stage1 > stage2) 476return1; 477return0; 478} 479 480static intindex_name_stage_pos(const struct index_state *istate,const char*name,int namelen,int stage) 481{ 482int first, last; 483 484 first =0; 485 last = istate->cache_nr; 486while(last > first) { 487int next = (last + first) >>1; 488struct cache_entry *ce = istate->cache[next]; 489int cmp =cache_name_stage_compare(name, namelen, stage, ce->name,ce_namelen(ce),ce_stage(ce)); 490if(!cmp) 491return next; 492if(cmp <0) { 493 last = next; 494continue; 495} 496 first = next+1; 497} 498return-first-1; 499} 500 501intindex_name_pos(const struct index_state *istate,const char*name,int namelen) 502{ 503returnindex_name_stage_pos(istate, name, namelen,0); 504} 505 506/* Remove entry, return true if there are more entries to go.. */ 507intremove_index_entry_at(struct index_state *istate,int pos) 508{ 509struct cache_entry *ce = istate->cache[pos]; 510 511record_resolve_undo(istate, ce); 512remove_name_hash(istate, ce); 513save_or_free_index_entry(istate, ce); 514 istate->cache_changed |= CE_ENTRY_REMOVED; 515 istate->cache_nr--; 516if(pos >= istate->cache_nr) 517return0; 518memmove(istate->cache + pos, 519 istate->cache + pos +1, 520(istate->cache_nr - pos) *sizeof(struct cache_entry *)); 521return1; 522} 523 524/* 525 * Remove all cache entries marked for removal, that is where 526 * CE_REMOVE is set in ce_flags. This is much more effective than 527 * calling remove_index_entry_at() for each entry to be removed. 528 */ 529voidremove_marked_cache_entries(struct index_state *istate) 530{ 531struct cache_entry **ce_array = istate->cache; 532unsigned int i, j; 533 534for(i = j =0; i < istate->cache_nr; i++) { 535if(ce_array[i]->ce_flags & CE_REMOVE) { 536remove_name_hash(istate, ce_array[i]); 537save_or_free_index_entry(istate, ce_array[i]); 538} 539else 540 ce_array[j++] = ce_array[i]; 541} 542if(j == istate->cache_nr) 543return; 544 istate->cache_changed |= CE_ENTRY_REMOVED; 545 istate->cache_nr = j; 546} 547 548intremove_file_from_index(struct index_state *istate,const char*path) 549{ 550int pos =index_name_pos(istate, path,strlen(path)); 551if(pos <0) 552 pos = -pos-1; 553cache_tree_invalidate_path(istate, path); 554untracked_cache_remove_from_index(istate, path); 555while(pos < istate->cache_nr && !strcmp(istate->cache[pos]->name, path)) 556remove_index_entry_at(istate, pos); 557return0; 558} 559 560static intcompare_name(struct cache_entry *ce,const char*path,int namelen) 561{ 562return namelen !=ce_namelen(ce) ||memcmp(path, ce->name, namelen); 563} 564 565static intindex_name_pos_also_unmerged(struct index_state *istate, 566const char*path,int namelen) 567{ 568int pos =index_name_pos(istate, path, namelen); 569struct cache_entry *ce; 570 571if(pos >=0) 572return pos; 573 574/* maybe unmerged? */ 575 pos = -1- pos; 576if(pos >= istate->cache_nr || 577compare_name((ce = istate->cache[pos]), path, namelen)) 578return-1; 579 580/* order of preference: stage 2, 1, 3 */ 581if(ce_stage(ce) ==1&& pos +1< istate->cache_nr && 582ce_stage((ce = istate->cache[pos +1])) ==2&& 583!compare_name(ce, path, namelen)) 584 pos++; 585return pos; 586} 587 588static intdifferent_name(struct cache_entry *ce,struct cache_entry *alias) 589{ 590int len =ce_namelen(ce); 591returnce_namelen(alias) != len ||memcmp(ce->name, alias->name, len); 592} 593 594/* 595 * If we add a filename that aliases in the cache, we will use the 596 * name that we already have - but we don't want to update the same 597 * alias twice, because that implies that there were actually two 598 * different files with aliasing names! 599 * 600 * So we use the CE_ADDED flag to verify that the alias was an old 601 * one before we accept it as 602 */ 603static struct cache_entry *create_alias_ce(struct index_state *istate, 604struct cache_entry *ce, 605struct cache_entry *alias) 606{ 607int len; 608struct cache_entry *new; 609 610if(alias->ce_flags & CE_ADDED) 611die("Will not add file alias '%s' ('%s' already exists in index)", ce->name, alias->name); 612 613/* Ok, create the new entry using the name of the existing alias */ 614 len =ce_namelen(alias); 615new=xcalloc(1,cache_entry_size(len)); 616memcpy(new->name, alias->name, len); 617copy_cache_entry(new, ce); 618save_or_free_index_entry(istate, ce); 619return new; 620} 621 622voidset_object_name_for_intent_to_add_entry(struct cache_entry *ce) 623{ 624unsigned char sha1[20]; 625if(write_sha1_file("",0, blob_type, sha1)) 626die("cannot create an empty blob in the object database"); 627hashcpy(ce->oid.hash, sha1); 628} 629 630intadd_to_index(struct index_state *istate,const char*path,struct stat *st,int flags,int force_mode) 631{ 632int size, namelen, was_same; 633 mode_t st_mode = st->st_mode; 634struct cache_entry *ce, *alias; 635unsigned ce_option = CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE|CE_MATCH_RACY_IS_DIRTY; 636int verbose = flags & (ADD_CACHE_VERBOSE | ADD_CACHE_PRETEND); 637int pretend = flags & ADD_CACHE_PRETEND; 638int intent_only = flags & ADD_CACHE_INTENT; 639int add_option = (ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE| 640(intent_only ? ADD_CACHE_NEW_ONLY :0)); 641 642if(!S_ISREG(st_mode) && !S_ISLNK(st_mode) && !S_ISDIR(st_mode)) 643returnerror("%s: can only add regular files, symbolic links or git-directories", path); 644 645 namelen =strlen(path); 646if(S_ISDIR(st_mode)) { 647while(namelen && path[namelen-1] =='/') 648 namelen--; 649} 650 size =cache_entry_size(namelen); 651 ce =xcalloc(1, size); 652memcpy(ce->name, path, namelen); 653 ce->ce_namelen = namelen; 654if(!intent_only) 655fill_stat_cache_info(ce, st); 656else 657 ce->ce_flags |= CE_INTENT_TO_ADD; 658 659if(S_ISREG(st_mode) && force_mode) 660 ce->ce_mode =create_ce_mode(force_mode); 661else if(trust_executable_bit && has_symlinks) 662 ce->ce_mode =create_ce_mode(st_mode); 663else{ 664/* If there is an existing entry, pick the mode bits and type 665 * from it, otherwise assume unexecutable regular file. 666 */ 667struct cache_entry *ent; 668int pos =index_name_pos_also_unmerged(istate, path, namelen); 669 670 ent = (0<= pos) ? istate->cache[pos] : NULL; 671 ce->ce_mode =ce_mode_from_stat(ent, st_mode); 672} 673 674/* When core.ignorecase=true, determine if a directory of the same name but differing 675 * case already exists within the Git repository. If it does, ensure the directory 676 * case of the file being added to the repository matches (is folded into) the existing 677 * entry's directory case. 678 */ 679if(ignore_case) { 680adjust_dirname_case(istate, ce->name); 681} 682 683 alias =index_file_exists(istate, ce->name,ce_namelen(ce), ignore_case); 684if(alias && !ce_stage(alias) && !ie_match_stat(istate, alias, st, ce_option)) { 685/* Nothing changed, really */ 686if(!S_ISGITLINK(alias->ce_mode)) 687ce_mark_uptodate(alias); 688 alias->ce_flags |= CE_ADDED; 689 690free(ce); 691return0; 692} 693if(!intent_only) { 694if(index_path(ce->oid.hash, path, st, HASH_WRITE_OBJECT)) { 695free(ce); 696returnerror("unable to index file%s", path); 697} 698}else 699set_object_name_for_intent_to_add_entry(ce); 700 701if(ignore_case && alias &&different_name(ce, alias)) 702 ce =create_alias_ce(istate, ce, alias); 703 ce->ce_flags |= CE_ADDED; 704 705/* It was suspected to be racily clean, but it turns out to be Ok */ 706 was_same = (alias && 707!ce_stage(alias) && 708!oidcmp(&alias->oid, &ce->oid) && 709 ce->ce_mode == alias->ce_mode); 710 711if(pretend) 712free(ce); 713else if(add_index_entry(istate, ce, add_option)) { 714free(ce); 715returnerror("unable to add%sto index", path); 716} 717if(verbose && !was_same) 718printf("add '%s'\n", path); 719return0; 720} 721 722intadd_file_to_index(struct index_state *istate,const char*path, 723int flags,int force_mode) 724{ 725struct stat st; 726if(lstat(path, &st)) 727die_errno("unable to stat '%s'", path); 728returnadd_to_index(istate, path, &st, flags, force_mode); 729} 730 731struct cache_entry *make_cache_entry(unsigned int mode, 732const unsigned char*sha1,const char*path,int stage, 733unsigned int refresh_options) 734{ 735int size, len; 736struct cache_entry *ce, *ret; 737 738if(!verify_path(path)) { 739error("Invalid path '%s'", path); 740return NULL; 741} 742 743 len =strlen(path); 744 size =cache_entry_size(len); 745 ce =xcalloc(1, size); 746 747hashcpy(ce->oid.hash, sha1); 748memcpy(ce->name, path, len); 749 ce->ce_flags =create_ce_flags(stage); 750 ce->ce_namelen = len; 751 ce->ce_mode =create_ce_mode(mode); 752 753 ret =refresh_cache_entry(ce, refresh_options); 754if(ret != ce) 755free(ce); 756return ret; 757} 758 759intce_same_name(const struct cache_entry *a,const struct cache_entry *b) 760{ 761int len =ce_namelen(a); 762returnce_namelen(b) == len && !memcmp(a->name, b->name, len); 763} 764 765/* 766 * We fundamentally don't like some paths: we don't want 767 * dot or dot-dot anywhere, and for obvious reasons don't 768 * want to recurse into ".git" either. 769 * 770 * Also, we don't want double slashes or slashes at the 771 * end that can make pathnames ambiguous. 772 */ 773static intverify_dotfile(const char*rest) 774{ 775/* 776 * The first character was '.', but that 777 * has already been discarded, we now test 778 * the rest. 779 */ 780 781/* "." is not allowed */ 782if(*rest =='\0'||is_dir_sep(*rest)) 783return0; 784 785switch(*rest) { 786/* 787 * ".git" followed by NUL or slash is bad. This 788 * shares the path end test with the ".." case. 789 */ 790case'g': 791case'G': 792if(rest[1] !='i'&& rest[1] !='I') 793break; 794if(rest[2] !='t'&& rest[2] !='T') 795break; 796 rest +=2; 797/* fallthrough */ 798case'.': 799if(rest[1] =='\0'||is_dir_sep(rest[1])) 800return0; 801} 802return1; 803} 804 805intverify_path(const char*path) 806{ 807char c; 808 809if(has_dos_drive_prefix(path)) 810return0; 811 812goto inside; 813for(;;) { 814if(!c) 815return1; 816if(is_dir_sep(c)) { 817inside: 818if(protect_hfs &&is_hfs_dotgit(path)) 819return0; 820if(protect_ntfs &&is_ntfs_dotgit(path)) 821return0; 822 c = *path++; 823if((c =='.'&& !verify_dotfile(path)) || 824is_dir_sep(c) || c =='\0') 825return0; 826} 827 c = *path++; 828} 829} 830 831/* 832 * Do we have another file that has the beginning components being a 833 * proper superset of the name we're trying to add? 834 */ 835static inthas_file_name(struct index_state *istate, 836const struct cache_entry *ce,int pos,int ok_to_replace) 837{ 838int retval =0; 839int len =ce_namelen(ce); 840int stage =ce_stage(ce); 841const char*name = ce->name; 842 843while(pos < istate->cache_nr) { 844struct cache_entry *p = istate->cache[pos++]; 845 846if(len >=ce_namelen(p)) 847break; 848if(memcmp(name, p->name, len)) 849break; 850if(ce_stage(p) != stage) 851continue; 852if(p->name[len] !='/') 853continue; 854if(p->ce_flags & CE_REMOVE) 855continue; 856 retval = -1; 857if(!ok_to_replace) 858break; 859remove_index_entry_at(istate, --pos); 860} 861return retval; 862} 863 864/* 865 * Do we have another file with a pathname that is a proper 866 * subset of the name we're trying to add? 867 */ 868static inthas_dir_name(struct index_state *istate, 869const struct cache_entry *ce,int pos,int ok_to_replace) 870{ 871int retval =0; 872int stage =ce_stage(ce); 873const char*name = ce->name; 874const char*slash = name +ce_namelen(ce); 875 876for(;;) { 877int len; 878 879for(;;) { 880if(*--slash =='/') 881break; 882if(slash <= ce->name) 883return retval; 884} 885 len = slash - name; 886 887 pos =index_name_stage_pos(istate, name, len, stage); 888if(pos >=0) { 889/* 890 * Found one, but not so fast. This could 891 * be a marker that says "I was here, but 892 * I am being removed". Such an entry is 893 * not a part of the resulting tree, and 894 * it is Ok to have a directory at the same 895 * path. 896 */ 897if(!(istate->cache[pos]->ce_flags & CE_REMOVE)) { 898 retval = -1; 899if(!ok_to_replace) 900break; 901remove_index_entry_at(istate, pos); 902continue; 903} 904} 905else 906 pos = -pos-1; 907 908/* 909 * Trivial optimization: if we find an entry that 910 * already matches the sub-directory, then we know 911 * we're ok, and we can exit. 912 */ 913while(pos < istate->cache_nr) { 914struct cache_entry *p = istate->cache[pos]; 915if((ce_namelen(p) <= len) || 916(p->name[len] !='/') || 917memcmp(p->name, name, len)) 918break;/* not our subdirectory */ 919if(ce_stage(p) == stage && !(p->ce_flags & CE_REMOVE)) 920/* 921 * p is at the same stage as our entry, and 922 * is a subdirectory of what we are looking 923 * at, so we cannot have conflicts at our 924 * level or anything shorter. 925 */ 926return retval; 927 pos++; 928} 929} 930return retval; 931} 932 933/* We may be in a situation where we already have path/file and path 934 * is being added, or we already have path and path/file is being 935 * added. Either one would result in a nonsense tree that has path 936 * twice when git-write-tree tries to write it out. Prevent it. 937 * 938 * If ok-to-replace is specified, we remove the conflicting entries 939 * from the cache so the caller should recompute the insert position. 940 * When this happens, we return non-zero. 941 */ 942static intcheck_file_directory_conflict(struct index_state *istate, 943const struct cache_entry *ce, 944int pos,int ok_to_replace) 945{ 946int retval; 947 948/* 949 * When ce is an "I am going away" entry, we allow it to be added 950 */ 951if(ce->ce_flags & CE_REMOVE) 952return0; 953 954/* 955 * We check if the path is a sub-path of a subsequent pathname 956 * first, since removing those will not change the position 957 * in the array. 958 */ 959 retval =has_file_name(istate, ce, pos, ok_to_replace); 960 961/* 962 * Then check if the path might have a clashing sub-directory 963 * before it. 964 */ 965return retval +has_dir_name(istate, ce, pos, ok_to_replace); 966} 967 968static intadd_index_entry_with_check(struct index_state *istate,struct cache_entry *ce,int option) 969{ 970int pos; 971int ok_to_add = option & ADD_CACHE_OK_TO_ADD; 972int ok_to_replace = option & ADD_CACHE_OK_TO_REPLACE; 973int skip_df_check = option & ADD_CACHE_SKIP_DFCHECK; 974int new_only = option & ADD_CACHE_NEW_ONLY; 975 976if(!(option & ADD_CACHE_KEEP_CACHE_TREE)) 977cache_tree_invalidate_path(istate, ce->name); 978 pos =index_name_stage_pos(istate, ce->name,ce_namelen(ce),ce_stage(ce)); 979 980/* existing match? Just replace it. */ 981if(pos >=0) { 982if(!new_only) 983replace_index_entry(istate, pos, ce); 984return0; 985} 986 pos = -pos-1; 987 988if(!(option & ADD_CACHE_KEEP_CACHE_TREE)) 989untracked_cache_add_to_index(istate, ce->name); 990 991/* 992 * Inserting a merged entry ("stage 0") into the index 993 * will always replace all non-merged entries.. 994 */ 995if(pos < istate->cache_nr &&ce_stage(ce) ==0) { 996while(ce_same_name(istate->cache[pos], ce)) { 997 ok_to_add =1; 998if(!remove_index_entry_at(istate, pos)) 999break;1000}1001}10021003if(!ok_to_add)1004return-1;1005if(!verify_path(ce->name))1006returnerror("Invalid path '%s'", ce->name);10071008if(!skip_df_check &&1009check_file_directory_conflict(istate, ce, pos, ok_to_replace)) {1010if(!ok_to_replace)1011returnerror("'%s' appears as both a file and as a directory",1012 ce->name);1013 pos =index_name_stage_pos(istate, ce->name,ce_namelen(ce),ce_stage(ce));1014 pos = -pos-1;1015}1016return pos +1;1017}10181019intadd_index_entry(struct index_state *istate,struct cache_entry *ce,int option)1020{1021int pos;10221023if(option & ADD_CACHE_JUST_APPEND)1024 pos = istate->cache_nr;1025else{1026int ret;1027 ret =add_index_entry_with_check(istate, ce, option);1028if(ret <=0)1029return ret;1030 pos = ret -1;1031}10321033/* Make sure the array is big enough .. */1034ALLOC_GROW(istate->cache, istate->cache_nr +1, istate->cache_alloc);10351036/* Add it in.. */1037 istate->cache_nr++;1038if(istate->cache_nr > pos +1)1039memmove(istate->cache + pos +1,1040 istate->cache + pos,1041(istate->cache_nr - pos -1) *sizeof(ce));1042set_index_entry(istate, pos, ce);1043 istate->cache_changed |= CE_ENTRY_ADDED;1044return0;1045}10461047/*1048 * "refresh" does not calculate a new sha1 file or bring the1049 * cache up-to-date for mode/content changes. But what it1050 * _does_ do is to "re-match" the stat information of a file1051 * with the cache, so that you can refresh the cache for a1052 * file that hasn't been changed but where the stat entry is1053 * out of date.1054 *1055 * For example, you'd want to do this after doing a "git-read-tree",1056 * to link up the stat cache details with the proper files.1057 */1058static struct cache_entry *refresh_cache_ent(struct index_state *istate,1059struct cache_entry *ce,1060unsigned int options,int*err,1061int*changed_ret)1062{1063struct stat st;1064struct cache_entry *updated;1065int changed, size;1066int refresh = options & CE_MATCH_REFRESH;1067int ignore_valid = options & CE_MATCH_IGNORE_VALID;1068int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE;1069int ignore_missing = options & CE_MATCH_IGNORE_MISSING;10701071if(!refresh ||ce_uptodate(ce))1072return ce;10731074/*1075 * CE_VALID or CE_SKIP_WORKTREE means the user promised us1076 * that the change to the work tree does not matter and told1077 * us not to worry.1078 */1079if(!ignore_skip_worktree &&ce_skip_worktree(ce)) {1080ce_mark_uptodate(ce);1081return ce;1082}1083if(!ignore_valid && (ce->ce_flags & CE_VALID)) {1084ce_mark_uptodate(ce);1085return ce;1086}10871088if(has_symlink_leading_path(ce->name,ce_namelen(ce))) {1089if(ignore_missing)1090return ce;1091if(err)1092*err = ENOENT;1093return NULL;1094}10951096if(lstat(ce->name, &st) <0) {1097if(ignore_missing && errno == ENOENT)1098return ce;1099if(err)1100*err = errno;1101return NULL;1102}11031104 changed =ie_match_stat(istate, ce, &st, options);1105if(changed_ret)1106*changed_ret = changed;1107if(!changed) {1108/*1109 * The path is unchanged. If we were told to ignore1110 * valid bit, then we did the actual stat check and1111 * found that the entry is unmodified. If the entry1112 * is not marked VALID, this is the place to mark it1113 * valid again, under "assume unchanged" mode.1114 */1115if(ignore_valid && assume_unchanged &&1116!(ce->ce_flags & CE_VALID))1117;/* mark this one VALID again */1118else{1119/*1120 * We do not mark the index itself "modified"1121 * because CE_UPTODATE flag is in-core only;1122 * we are not going to write this change out.1123 */1124if(!S_ISGITLINK(ce->ce_mode))1125ce_mark_uptodate(ce);1126return ce;1127}1128}11291130if(ie_modified(istate, ce, &st, options)) {1131if(err)1132*err = EINVAL;1133return NULL;1134}11351136 size =ce_size(ce);1137 updated =xmalloc(size);1138memcpy(updated, ce, size);1139fill_stat_cache_info(updated, &st);1140/*1141 * If ignore_valid is not set, we should leave CE_VALID bit1142 * alone. Otherwise, paths marked with --no-assume-unchanged1143 * (i.e. things to be edited) will reacquire CE_VALID bit1144 * automatically, which is not really what we want.1145 */1146if(!ignore_valid && assume_unchanged &&1147!(ce->ce_flags & CE_VALID))1148 updated->ce_flags &= ~CE_VALID;11491150/* istate->cache_changed is updated in the caller */1151return updated;1152}11531154static voidshow_file(const char* fmt,const char* name,int in_porcelain,1155int* first,const char*header_msg)1156{1157if(in_porcelain && *first && header_msg) {1158printf("%s\n", header_msg);1159*first =0;1160}1161printf(fmt, name);1162}11631164intrefresh_index(struct index_state *istate,unsigned int flags,1165const struct pathspec *pathspec,1166char*seen,const char*header_msg)1167{1168int i;1169int has_errors =0;1170int really = (flags & REFRESH_REALLY) !=0;1171int allow_unmerged = (flags & REFRESH_UNMERGED) !=0;1172int quiet = (flags & REFRESH_QUIET) !=0;1173int not_new = (flags & REFRESH_IGNORE_MISSING) !=0;1174int ignore_submodules = (flags & REFRESH_IGNORE_SUBMODULES) !=0;1175int first =1;1176int in_porcelain = (flags & REFRESH_IN_PORCELAIN);1177unsigned int options = (CE_MATCH_REFRESH |1178(really ? CE_MATCH_IGNORE_VALID :0) |1179(not_new ? CE_MATCH_IGNORE_MISSING :0));1180const char*modified_fmt;1181const char*deleted_fmt;1182const char*typechange_fmt;1183const char*added_fmt;1184const char*unmerged_fmt;11851186 modified_fmt = (in_porcelain ?"M\t%s\n":"%s: needs update\n");1187 deleted_fmt = (in_porcelain ?"D\t%s\n":"%s: needs update\n");1188 typechange_fmt = (in_porcelain ?"T\t%s\n":"%sneeds update\n");1189 added_fmt = (in_porcelain ?"A\t%s\n":"%sneeds update\n");1190 unmerged_fmt = (in_porcelain ?"U\t%s\n":"%s: needs merge\n");1191for(i =0; i < istate->cache_nr; i++) {1192struct cache_entry *ce, *new;1193int cache_errno =0;1194int changed =0;1195int filtered =0;11961197 ce = istate->cache[i];1198if(ignore_submodules &&S_ISGITLINK(ce->ce_mode))1199continue;12001201if(pathspec && !ce_path_match(ce, pathspec, seen))1202 filtered =1;12031204if(ce_stage(ce)) {1205while((i < istate->cache_nr) &&1206!strcmp(istate->cache[i]->name, ce->name))1207 i++;1208 i--;1209if(allow_unmerged)1210continue;1211if(!filtered)1212show_file(unmerged_fmt, ce->name, in_porcelain,1213&first, header_msg);1214 has_errors =1;1215continue;1216}12171218if(filtered)1219continue;12201221new=refresh_cache_ent(istate, ce, options, &cache_errno, &changed);1222if(new== ce)1223continue;1224if(!new) {1225const char*fmt;12261227if(really && cache_errno == EINVAL) {1228/* If we are doing --really-refresh that1229 * means the index is not valid anymore.1230 */1231 ce->ce_flags &= ~CE_VALID;1232 ce->ce_flags |= CE_UPDATE_IN_BASE;1233 istate->cache_changed |= CE_ENTRY_CHANGED;1234}1235if(quiet)1236continue;12371238if(cache_errno == ENOENT)1239 fmt = deleted_fmt;1240else if(ce_intent_to_add(ce))1241 fmt = added_fmt;/* must be before other checks */1242else if(changed & TYPE_CHANGED)1243 fmt = typechange_fmt;1244else1245 fmt = modified_fmt;1246show_file(fmt,1247 ce->name, in_porcelain, &first, header_msg);1248 has_errors =1;1249continue;1250}12511252replace_index_entry(istate, i,new);1253}1254return has_errors;1255}12561257struct cache_entry *refresh_cache_entry(struct cache_entry *ce,1258unsigned int options)1259{1260returnrefresh_cache_ent(&the_index, ce, options, NULL, NULL);1261}126212631264/*****************************************************************1265 * Index File I/O1266 *****************************************************************/12671268#define INDEX_FORMAT_DEFAULT 312691270static unsigned intget_index_format_default(void)1271{1272char*envversion =getenv("GIT_INDEX_VERSION");1273char*endp;1274int value;1275unsigned int version = INDEX_FORMAT_DEFAULT;12761277if(!envversion) {1278if(!git_config_get_int("index.version", &value))1279 version = value;1280if(version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) {1281warning(_("index.version set, but the value is invalid.\n"1282"Using version%i"), INDEX_FORMAT_DEFAULT);1283return INDEX_FORMAT_DEFAULT;1284}1285return version;1286}12871288 version =strtoul(envversion, &endp,10);1289if(*endp ||1290 version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) {1291warning(_("GIT_INDEX_VERSION set, but the value is invalid.\n"1292"Using version%i"), INDEX_FORMAT_DEFAULT);1293 version = INDEX_FORMAT_DEFAULT;1294}1295return version;1296}12971298/*1299 * dev/ino/uid/gid/size are also just tracked to the low 32 bits1300 * Again - this is just a (very strong in practice) heuristic that1301 * the inode hasn't changed.1302 *1303 * We save the fields in big-endian order to allow using the1304 * index file over NFS transparently.1305 */1306struct ondisk_cache_entry {1307struct cache_time ctime;1308struct cache_time mtime;1309uint32_t dev;1310uint32_t ino;1311uint32_t mode;1312uint32_t uid;1313uint32_t gid;1314uint32_t size;1315unsigned char sha1[20];1316uint16_t flags;1317char name[FLEX_ARRAY];/* more */1318};13191320/*1321 * This struct is used when CE_EXTENDED bit is 11322 * The struct must match ondisk_cache_entry exactly from1323 * ctime till flags1324 */1325struct ondisk_cache_entry_extended {1326struct cache_time ctime;1327struct cache_time mtime;1328uint32_t dev;1329uint32_t ino;1330uint32_t mode;1331uint32_t uid;1332uint32_t gid;1333uint32_t size;1334unsigned char sha1[20];1335uint16_t flags;1336uint16_t flags2;1337char name[FLEX_ARRAY];/* more */1338};13391340/* These are only used for v3 or lower */1341#define align_flex_name(STRUCT,len) ((offsetof(struct STRUCT,name) + (len) + 8) & ~7)1342#define ondisk_cache_entry_size(len) align_flex_name(ondisk_cache_entry,len)1343#define ondisk_cache_entry_extended_size(len) align_flex_name(ondisk_cache_entry_extended,len)1344#define ondisk_ce_size(ce) (((ce)->ce_flags & CE_EXTENDED) ? \1345 ondisk_cache_entry_extended_size(ce_namelen(ce)) : \1346 ondisk_cache_entry_size(ce_namelen(ce)))13471348static intverify_hdr(struct cache_header *hdr,unsigned long size)1349{1350 git_SHA_CTX c;1351unsigned char sha1[20];1352int hdr_version;13531354if(hdr->hdr_signature !=htonl(CACHE_SIGNATURE))1355returnerror("bad signature");1356 hdr_version =ntohl(hdr->hdr_version);1357if(hdr_version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < hdr_version)1358returnerror("bad index version%d", hdr_version);1359git_SHA1_Init(&c);1360git_SHA1_Update(&c, hdr, size -20);1361git_SHA1_Final(sha1, &c);1362if(hashcmp(sha1, (unsigned char*)hdr + size -20))1363returnerror("bad index file sha1 signature");1364return0;1365}13661367static intread_index_extension(struct index_state *istate,1368const char*ext,void*data,unsigned long sz)1369{1370switch(CACHE_EXT(ext)) {1371case CACHE_EXT_TREE:1372 istate->cache_tree =cache_tree_read(data, sz);1373break;1374case CACHE_EXT_RESOLVE_UNDO:1375 istate->resolve_undo =resolve_undo_read(data, sz);1376break;1377case CACHE_EXT_LINK:1378if(read_link_extension(istate, data, sz))1379return-1;1380break;1381case CACHE_EXT_UNTRACKED:1382 istate->untracked =read_untracked_extension(data, sz);1383break;1384default:1385if(*ext <'A'||'Z'< *ext)1386returnerror("index uses %.4s extension, which we do not understand",1387 ext);1388fprintf(stderr,"ignoring %.4s extension\n", ext);1389break;1390}1391return0;1392}13931394inthold_locked_index(struct lock_file *lk,int die_on_error)1395{1396returnhold_lock_file_for_update(lk,get_index_file(),1397 die_on_error1398? LOCK_DIE_ON_ERROR1399:0);1400}14011402intread_index(struct index_state *istate)1403{1404returnread_index_from(istate,get_index_file());1405}14061407static struct cache_entry *cache_entry_from_ondisk(struct ondisk_cache_entry *ondisk,1408unsigned int flags,1409const char*name,1410size_t len)1411{1412struct cache_entry *ce =xmalloc(cache_entry_size(len));14131414 ce->ce_stat_data.sd_ctime.sec =get_be32(&ondisk->ctime.sec);1415 ce->ce_stat_data.sd_mtime.sec =get_be32(&ondisk->mtime.sec);1416 ce->ce_stat_data.sd_ctime.nsec =get_be32(&ondisk->ctime.nsec);1417 ce->ce_stat_data.sd_mtime.nsec =get_be32(&ondisk->mtime.nsec);1418 ce->ce_stat_data.sd_dev =get_be32(&ondisk->dev);1419 ce->ce_stat_data.sd_ino =get_be32(&ondisk->ino);1420 ce->ce_mode =get_be32(&ondisk->mode);1421 ce->ce_stat_data.sd_uid =get_be32(&ondisk->uid);1422 ce->ce_stat_data.sd_gid =get_be32(&ondisk->gid);1423 ce->ce_stat_data.sd_size =get_be32(&ondisk->size);1424 ce->ce_flags = flags & ~CE_NAMEMASK;1425 ce->ce_namelen = len;1426 ce->index =0;1427hashcpy(ce->oid.hash, ondisk->sha1);1428memcpy(ce->name, name, len);1429 ce->name[len] ='\0';1430return ce;1431}14321433/*1434 * Adjacent cache entries tend to share the leading paths, so it makes1435 * sense to only store the differences in later entries. In the v41436 * on-disk format of the index, each on-disk cache entry stores the1437 * number of bytes to be stripped from the end of the previous name,1438 * and the bytes to append to the result, to come up with its name.1439 */1440static unsigned longexpand_name_field(struct strbuf *name,const char*cp_)1441{1442const unsigned char*ep, *cp = (const unsigned char*)cp_;1443size_t len =decode_varint(&cp);14441445if(name->len < len)1446die("malformed name field in the index");1447strbuf_remove(name, name->len - len, len);1448for(ep = cp; *ep; ep++)1449;/* find the end */1450strbuf_add(name, cp, ep - cp);1451return(const char*)ep +1- cp_;1452}14531454static struct cache_entry *create_from_disk(struct ondisk_cache_entry *ondisk,1455unsigned long*ent_size,1456struct strbuf *previous_name)1457{1458struct cache_entry *ce;1459size_t len;1460const char*name;1461unsigned int flags;14621463/* On-disk flags are just 16 bits */1464 flags =get_be16(&ondisk->flags);1465 len = flags & CE_NAMEMASK;14661467if(flags & CE_EXTENDED) {1468struct ondisk_cache_entry_extended *ondisk2;1469int extended_flags;1470 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;1471 extended_flags =get_be16(&ondisk2->flags2) <<16;1472/* We do not yet understand any bit out of CE_EXTENDED_FLAGS */1473if(extended_flags & ~CE_EXTENDED_FLAGS)1474die("Unknown index entry format%08x", extended_flags);1475 flags |= extended_flags;1476 name = ondisk2->name;1477}1478else1479 name = ondisk->name;14801481if(!previous_name) {1482/* v3 and earlier */1483if(len == CE_NAMEMASK)1484 len =strlen(name);1485 ce =cache_entry_from_ondisk(ondisk, flags, name, len);14861487*ent_size =ondisk_ce_size(ce);1488}else{1489unsigned long consumed;1490 consumed =expand_name_field(previous_name, name);1491 ce =cache_entry_from_ondisk(ondisk, flags,1492 previous_name->buf,1493 previous_name->len);14941495*ent_size = (name - ((char*)ondisk)) + consumed;1496}1497return ce;1498}14991500static voidcheck_ce_order(struct index_state *istate)1501{1502unsigned int i;15031504for(i =1; i < istate->cache_nr; i++) {1505struct cache_entry *ce = istate->cache[i -1];1506struct cache_entry *next_ce = istate->cache[i];1507int name_compare =strcmp(ce->name, next_ce->name);15081509if(0< name_compare)1510die("unordered stage entries in index");1511if(!name_compare) {1512if(!ce_stage(ce))1513die("multiple stage entries for merged file '%s'",1514 ce->name);1515if(ce_stage(ce) >ce_stage(next_ce))1516die("unordered stage entries for '%s'",1517 ce->name);1518}1519}1520}15211522static voidtweak_untracked_cache(struct index_state *istate)1523{1524switch(git_config_get_untracked_cache()) {1525case-1:/* keep: do nothing */1526break;1527case0:/* false */1528remove_untracked_cache(istate);1529break;1530case1:/* true */1531add_untracked_cache(istate);1532break;1533default:/* unknown value: do nothing */1534break;1535}1536}15371538static voidpost_read_index_from(struct index_state *istate)1539{1540check_ce_order(istate);1541tweak_untracked_cache(istate);1542}15431544/* remember to discard_cache() before reading a different cache! */1545intdo_read_index(struct index_state *istate,const char*path,int must_exist)1546{1547int fd, i;1548struct stat st;1549unsigned long src_offset;1550struct cache_header *hdr;1551void*mmap;1552size_t mmap_size;1553struct strbuf previous_name_buf = STRBUF_INIT, *previous_name;15541555if(istate->initialized)1556return istate->cache_nr;15571558 istate->timestamp.sec =0;1559 istate->timestamp.nsec =0;1560 fd =open(path, O_RDONLY);1561if(fd <0) {1562if(!must_exist && errno == ENOENT)1563return0;1564die_errno("%s: index file open failed", path);1565}15661567if(fstat(fd, &st))1568die_errno("cannot stat the open index");15691570 mmap_size =xsize_t(st.st_size);1571if(mmap_size <sizeof(struct cache_header) +20)1572die("index file smaller than expected");15731574 mmap =xmmap(NULL, mmap_size, PROT_READ, MAP_PRIVATE, fd,0);1575if(mmap == MAP_FAILED)1576die_errno("unable to map index file");1577close(fd);15781579 hdr = mmap;1580if(verify_hdr(hdr, mmap_size) <0)1581goto unmap;15821583hashcpy(istate->sha1, (const unsigned char*)hdr + mmap_size -20);1584 istate->version =ntohl(hdr->hdr_version);1585 istate->cache_nr =ntohl(hdr->hdr_entries);1586 istate->cache_alloc =alloc_nr(istate->cache_nr);1587 istate->cache =xcalloc(istate->cache_alloc,sizeof(*istate->cache));1588 istate->initialized =1;15891590if(istate->version ==4)1591 previous_name = &previous_name_buf;1592else1593 previous_name = NULL;15941595 src_offset =sizeof(*hdr);1596for(i =0; i < istate->cache_nr; i++) {1597struct ondisk_cache_entry *disk_ce;1598struct cache_entry *ce;1599unsigned long consumed;16001601 disk_ce = (struct ondisk_cache_entry *)((char*)mmap + src_offset);1602 ce =create_from_disk(disk_ce, &consumed, previous_name);1603set_index_entry(istate, i, ce);16041605 src_offset += consumed;1606}1607strbuf_release(&previous_name_buf);1608 istate->timestamp.sec = st.st_mtime;1609 istate->timestamp.nsec =ST_MTIME_NSEC(st);16101611while(src_offset <= mmap_size -20-8) {1612/* After an array of active_nr index entries,1613 * there can be arbitrary number of extended1614 * sections, each of which is prefixed with1615 * extension name (4-byte) and section length1616 * in 4-byte network byte order.1617 */1618uint32_t extsize;1619memcpy(&extsize, (char*)mmap + src_offset +4,4);1620 extsize =ntohl(extsize);1621if(read_index_extension(istate,1622(const char*) mmap + src_offset,1623(char*) mmap + src_offset +8,1624 extsize) <0)1625goto unmap;1626 src_offset +=8;1627 src_offset += extsize;1628}1629munmap(mmap, mmap_size);1630return istate->cache_nr;16311632unmap:1633munmap(mmap, mmap_size);1634die("index file corrupt");1635}16361637intread_index_from(struct index_state *istate,const char*path)1638{1639struct split_index *split_index;1640int ret;16411642/* istate->initialized covers both .git/index and .git/sharedindex.xxx */1643if(istate->initialized)1644return istate->cache_nr;16451646 ret =do_read_index(istate, path,0);16471648 split_index = istate->split_index;1649if(!split_index ||is_null_sha1(split_index->base_sha1)) {1650post_read_index_from(istate);1651return ret;1652}16531654if(split_index->base)1655discard_index(split_index->base);1656else1657 split_index->base =xcalloc(1,sizeof(*split_index->base));1658 ret =do_read_index(split_index->base,1659git_path("sharedindex.%s",1660sha1_to_hex(split_index->base_sha1)),1);1661if(hashcmp(split_index->base_sha1, split_index->base->sha1))1662die("broken index, expect%sin%s, got%s",1663sha1_to_hex(split_index->base_sha1),1664git_path("sharedindex.%s",1665sha1_to_hex(split_index->base_sha1)),1666sha1_to_hex(split_index->base->sha1));1667merge_base_index(istate);1668post_read_index_from(istate);1669return ret;1670}16711672intis_index_unborn(struct index_state *istate)1673{1674return(!istate->cache_nr && !istate->timestamp.sec);1675}16761677intdiscard_index(struct index_state *istate)1678{1679int i;16801681for(i =0; i < istate->cache_nr; i++) {1682if(istate->cache[i]->index &&1683 istate->split_index &&1684 istate->split_index->base &&1685 istate->cache[i]->index <= istate->split_index->base->cache_nr &&1686 istate->cache[i] == istate->split_index->base->cache[istate->cache[i]->index -1])1687continue;1688free(istate->cache[i]);1689}1690resolve_undo_clear_index(istate);1691 istate->cache_nr =0;1692 istate->cache_changed =0;1693 istate->timestamp.sec =0;1694 istate->timestamp.nsec =0;1695free_name_hash(istate);1696cache_tree_free(&(istate->cache_tree));1697 istate->initialized =0;1698free(istate->cache);1699 istate->cache = NULL;1700 istate->cache_alloc =0;1701discard_split_index(istate);1702free_untracked_cache(istate->untracked);1703 istate->untracked = NULL;1704return0;1705}17061707intunmerged_index(const struct index_state *istate)1708{1709int i;1710for(i =0; i < istate->cache_nr; i++) {1711if(ce_stage(istate->cache[i]))1712return1;1713}1714return0;1715}17161717#define WRITE_BUFFER_SIZE 81921718static unsigned char write_buffer[WRITE_BUFFER_SIZE];1719static unsigned long write_buffer_len;17201721static intce_write_flush(git_SHA_CTX *context,int fd)1722{1723unsigned int buffered = write_buffer_len;1724if(buffered) {1725git_SHA1_Update(context, write_buffer, buffered);1726if(write_in_full(fd, write_buffer, buffered) != buffered)1727return-1;1728 write_buffer_len =0;1729}1730return0;1731}17321733static intce_write(git_SHA_CTX *context,int fd,void*data,unsigned int len)1734{1735while(len) {1736unsigned int buffered = write_buffer_len;1737unsigned int partial = WRITE_BUFFER_SIZE - buffered;1738if(partial > len)1739 partial = len;1740memcpy(write_buffer + buffered, data, partial);1741 buffered += partial;1742if(buffered == WRITE_BUFFER_SIZE) {1743 write_buffer_len = buffered;1744if(ce_write_flush(context, fd))1745return-1;1746 buffered =0;1747}1748 write_buffer_len = buffered;1749 len -= partial;1750 data = (char*) data + partial;1751}1752return0;1753}17541755static intwrite_index_ext_header(git_SHA_CTX *context,int fd,1756unsigned int ext,unsigned int sz)1757{1758 ext =htonl(ext);1759 sz =htonl(sz);1760return((ce_write(context, fd, &ext,4) <0) ||1761(ce_write(context, fd, &sz,4) <0)) ? -1:0;1762}17631764static intce_flush(git_SHA_CTX *context,int fd,unsigned char*sha1)1765{1766unsigned int left = write_buffer_len;17671768if(left) {1769 write_buffer_len =0;1770git_SHA1_Update(context, write_buffer, left);1771}17721773/* Flush first if not enough space for SHA1 signature */1774if(left +20> WRITE_BUFFER_SIZE) {1775if(write_in_full(fd, write_buffer, left) != left)1776return-1;1777 left =0;1778}17791780/* Append the SHA1 signature at the end */1781git_SHA1_Final(write_buffer + left, context);1782hashcpy(sha1, write_buffer + left);1783 left +=20;1784return(write_in_full(fd, write_buffer, left) != left) ? -1:0;1785}17861787static voidce_smudge_racily_clean_entry(struct cache_entry *ce)1788{1789/*1790 * The only thing we care about in this function is to smudge the1791 * falsely clean entry due to touch-update-touch race, so we leave1792 * everything else as they are. We are called for entries whose1793 * ce_stat_data.sd_mtime match the index file mtime.1794 *1795 * Note that this actually does not do much for gitlinks, for1796 * which ce_match_stat_basic() always goes to the actual1797 * contents. The caller checks with is_racy_timestamp() which1798 * always says "no" for gitlinks, so we are not called for them ;-)1799 */1800struct stat st;18011802if(lstat(ce->name, &st) <0)1803return;1804if(ce_match_stat_basic(ce, &st))1805return;1806if(ce_modified_check_fs(ce, &st)) {1807/* This is "racily clean"; smudge it. Note that this1808 * is a tricky code. At first glance, it may appear1809 * that it can break with this sequence:1810 *1811 * $ echo xyzzy >frotz1812 * $ git-update-index --add frotz1813 * $ : >frotz1814 * $ sleep 31815 * $ echo filfre >nitfol1816 * $ git-update-index --add nitfol1817 *1818 * but it does not. When the second update-index runs,1819 * it notices that the entry "frotz" has the same timestamp1820 * as index, and if we were to smudge it by resetting its1821 * size to zero here, then the object name recorded1822 * in index is the 6-byte file but the cached stat information1823 * becomes zero --- which would then match what we would1824 * obtain from the filesystem next time we stat("frotz").1825 *1826 * However, the second update-index, before calling1827 * this function, notices that the cached size is 61828 * bytes and what is on the filesystem is an empty1829 * file, and never calls us, so the cached size information1830 * for "frotz" stays 6 which does not match the filesystem.1831 */1832 ce->ce_stat_data.sd_size =0;1833}1834}18351836/* Copy miscellaneous fields but not the name */1837static char*copy_cache_entry_to_ondisk(struct ondisk_cache_entry *ondisk,1838struct cache_entry *ce)1839{1840short flags;18411842 ondisk->ctime.sec =htonl(ce->ce_stat_data.sd_ctime.sec);1843 ondisk->mtime.sec =htonl(ce->ce_stat_data.sd_mtime.sec);1844 ondisk->ctime.nsec =htonl(ce->ce_stat_data.sd_ctime.nsec);1845 ondisk->mtime.nsec =htonl(ce->ce_stat_data.sd_mtime.nsec);1846 ondisk->dev =htonl(ce->ce_stat_data.sd_dev);1847 ondisk->ino =htonl(ce->ce_stat_data.sd_ino);1848 ondisk->mode =htonl(ce->ce_mode);1849 ondisk->uid =htonl(ce->ce_stat_data.sd_uid);1850 ondisk->gid =htonl(ce->ce_stat_data.sd_gid);1851 ondisk->size =htonl(ce->ce_stat_data.sd_size);1852hashcpy(ondisk->sha1, ce->oid.hash);18531854 flags = ce->ce_flags & ~CE_NAMEMASK;1855 flags |= (ce_namelen(ce) >= CE_NAMEMASK ? CE_NAMEMASK :ce_namelen(ce));1856 ondisk->flags =htons(flags);1857if(ce->ce_flags & CE_EXTENDED) {1858struct ondisk_cache_entry_extended *ondisk2;1859 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;1860 ondisk2->flags2 =htons((ce->ce_flags & CE_EXTENDED_FLAGS) >>16);1861return ondisk2->name;1862}1863else{1864return ondisk->name;1865}1866}18671868static intce_write_entry(git_SHA_CTX *c,int fd,struct cache_entry *ce,1869struct strbuf *previous_name)1870{1871int size;1872struct ondisk_cache_entry *ondisk;1873int saved_namelen = saved_namelen;/* compiler workaround */1874char*name;1875int result;18761877if(ce->ce_flags & CE_STRIP_NAME) {1878 saved_namelen =ce_namelen(ce);1879 ce->ce_namelen =0;1880}18811882if(!previous_name) {1883 size =ondisk_ce_size(ce);1884 ondisk =xcalloc(1, size);1885 name =copy_cache_entry_to_ondisk(ondisk, ce);1886memcpy(name, ce->name,ce_namelen(ce));1887}else{1888int common, to_remove, prefix_size;1889unsigned char to_remove_vi[16];1890for(common =0;1891(ce->name[common] &&1892 common < previous_name->len &&1893 ce->name[common] == previous_name->buf[common]);1894 common++)1895;/* still matching */1896 to_remove = previous_name->len - common;1897 prefix_size =encode_varint(to_remove, to_remove_vi);18981899if(ce->ce_flags & CE_EXTENDED)1900 size =offsetof(struct ondisk_cache_entry_extended, name);1901else1902 size =offsetof(struct ondisk_cache_entry, name);1903 size += prefix_size + (ce_namelen(ce) - common +1);19041905 ondisk =xcalloc(1, size);1906 name =copy_cache_entry_to_ondisk(ondisk, ce);1907memcpy(name, to_remove_vi, prefix_size);1908memcpy(name + prefix_size, ce->name + common,ce_namelen(ce) - common);19091910strbuf_splice(previous_name, common, to_remove,1911 ce->name + common,ce_namelen(ce) - common);1912}1913if(ce->ce_flags & CE_STRIP_NAME) {1914 ce->ce_namelen = saved_namelen;1915 ce->ce_flags &= ~CE_STRIP_NAME;1916}19171918 result =ce_write(c, fd, ondisk, size);1919free(ondisk);1920return result;1921}19221923/*1924 * This function verifies if index_state has the correct sha1 of the1925 * index file. Don't die if we have any other failure, just return 0.1926 */1927static intverify_index_from(const struct index_state *istate,const char*path)1928{1929int fd;1930 ssize_t n;1931struct stat st;1932unsigned char sha1[20];19331934if(!istate->initialized)1935return0;19361937 fd =open(path, O_RDONLY);1938if(fd <0)1939return0;19401941if(fstat(fd, &st))1942goto out;19431944if(st.st_size <sizeof(struct cache_header) +20)1945goto out;19461947 n =pread_in_full(fd, sha1,20, st.st_size -20);1948if(n !=20)1949goto out;19501951if(hashcmp(istate->sha1, sha1))1952goto out;19531954close(fd);1955return1;19561957out:1958close(fd);1959return0;1960}19611962static intverify_index(const struct index_state *istate)1963{1964returnverify_index_from(istate,get_index_file());1965}19661967static inthas_racy_timestamp(struct index_state *istate)1968{1969int entries = istate->cache_nr;1970int i;19711972for(i =0; i < entries; i++) {1973struct cache_entry *ce = istate->cache[i];1974if(is_racy_timestamp(istate, ce))1975return1;1976}1977return0;1978}19791980/*1981 * Opportunistically update the index but do not complain if we can't1982 */1983voidupdate_index_if_able(struct index_state *istate,struct lock_file *lockfile)1984{1985if((istate->cache_changed ||has_racy_timestamp(istate)) &&1986verify_index(istate) &&1987write_locked_index(istate, lockfile, COMMIT_LOCK))1988rollback_lock_file(lockfile);1989}19901991static intdo_write_index(struct index_state *istate,int newfd,1992int strip_extensions)1993{1994 git_SHA_CTX c;1995struct cache_header hdr;1996int i, err, removed, extended, hdr_version;1997struct cache_entry **cache = istate->cache;1998int entries = istate->cache_nr;1999struct stat st;2000struct strbuf previous_name_buf = STRBUF_INIT, *previous_name;20012002for(i = removed = extended =0; i < entries; i++) {2003if(cache[i]->ce_flags & CE_REMOVE)2004 removed++;20052006/* reduce extended entries if possible */2007 cache[i]->ce_flags &= ~CE_EXTENDED;2008if(cache[i]->ce_flags & CE_EXTENDED_FLAGS) {2009 extended++;2010 cache[i]->ce_flags |= CE_EXTENDED;2011}2012}20132014if(!istate->version) {2015 istate->version =get_index_format_default();2016if(getenv("GIT_TEST_SPLIT_INDEX"))2017init_split_index(istate);2018}20192020/* demote version 3 to version 2 when the latter suffices */2021if(istate->version ==3|| istate->version ==2)2022 istate->version = extended ?3:2;20232024 hdr_version = istate->version;20252026 hdr.hdr_signature =htonl(CACHE_SIGNATURE);2027 hdr.hdr_version =htonl(hdr_version);2028 hdr.hdr_entries =htonl(entries - removed);20292030git_SHA1_Init(&c);2031if(ce_write(&c, newfd, &hdr,sizeof(hdr)) <0)2032return-1;20332034 previous_name = (hdr_version ==4) ? &previous_name_buf : NULL;2035for(i =0; i < entries; i++) {2036struct cache_entry *ce = cache[i];2037if(ce->ce_flags & CE_REMOVE)2038continue;2039if(!ce_uptodate(ce) &&is_racy_timestamp(istate, ce))2040ce_smudge_racily_clean_entry(ce);2041if(is_null_oid(&ce->oid)) {2042static const char msg[] ="cache entry has null sha1:%s";2043static int allow = -1;20442045if(allow <0)2046 allow =git_env_bool("GIT_ALLOW_NULL_SHA1",0);2047if(allow)2048warning(msg, ce->name);2049else2050returnerror(msg, ce->name);2051}2052if(ce_write_entry(&c, newfd, ce, previous_name) <0)2053return-1;2054}2055strbuf_release(&previous_name_buf);20562057/* Write extension data here */2058if(!strip_extensions && istate->split_index) {2059struct strbuf sb = STRBUF_INIT;20602061 err =write_link_extension(&sb, istate) <0||2062write_index_ext_header(&c, newfd, CACHE_EXT_LINK,2063 sb.len) <0||2064ce_write(&c, newfd, sb.buf, sb.len) <0;2065strbuf_release(&sb);2066if(err)2067return-1;2068}2069if(!strip_extensions && istate->cache_tree) {2070struct strbuf sb = STRBUF_INIT;20712072cache_tree_write(&sb, istate->cache_tree);2073 err =write_index_ext_header(&c, newfd, CACHE_EXT_TREE, sb.len) <02074||ce_write(&c, newfd, sb.buf, sb.len) <0;2075strbuf_release(&sb);2076if(err)2077return-1;2078}2079if(!strip_extensions && istate->resolve_undo) {2080struct strbuf sb = STRBUF_INIT;20812082resolve_undo_write(&sb, istate->resolve_undo);2083 err =write_index_ext_header(&c, newfd, CACHE_EXT_RESOLVE_UNDO,2084 sb.len) <02085||ce_write(&c, newfd, sb.buf, sb.len) <0;2086strbuf_release(&sb);2087if(err)2088return-1;2089}2090if(!strip_extensions && istate->untracked) {2091struct strbuf sb = STRBUF_INIT;20922093write_untracked_extension(&sb, istate->untracked);2094 err =write_index_ext_header(&c, newfd, CACHE_EXT_UNTRACKED,2095 sb.len) <0||2096ce_write(&c, newfd, sb.buf, sb.len) <0;2097strbuf_release(&sb);2098if(err)2099return-1;2100}21012102if(ce_flush(&c, newfd, istate->sha1) ||fstat(newfd, &st))2103return-1;2104 istate->timestamp.sec = (unsigned int)st.st_mtime;2105 istate->timestamp.nsec =ST_MTIME_NSEC(st);2106return0;2107}21082109voidset_alternate_index_output(const char*name)2110{2111 alternate_index_output = name;2112}21132114static intcommit_locked_index(struct lock_file *lk)2115{2116if(alternate_index_output)2117returncommit_lock_file_to(lk, alternate_index_output);2118else2119returncommit_lock_file(lk);2120}21212122static intdo_write_locked_index(struct index_state *istate,struct lock_file *lock,2123unsigned flags)2124{2125int ret =do_write_index(istate,get_lock_file_fd(lock),0);2126if(ret)2127return ret;2128assert((flags & (COMMIT_LOCK | CLOSE_LOCK)) !=2129(COMMIT_LOCK | CLOSE_LOCK));2130if(flags & COMMIT_LOCK)2131returncommit_locked_index(lock);2132else if(flags & CLOSE_LOCK)2133returnclose_lock_file(lock);2134else2135return ret;2136}21372138static intwrite_split_index(struct index_state *istate,2139struct lock_file *lock,2140unsigned flags)2141{2142int ret;2143prepare_to_write_split_index(istate);2144 ret =do_write_locked_index(istate, lock, flags);2145finish_writing_split_index(istate);2146return ret;2147}21482149static struct tempfile temporary_sharedindex;21502151static intwrite_shared_index(struct index_state *istate,2152struct lock_file *lock,unsigned flags)2153{2154struct split_index *si = istate->split_index;2155int fd, ret;21562157 fd =mks_tempfile(&temporary_sharedindex,git_path("sharedindex_XXXXXX"));2158if(fd <0) {2159hashclr(si->base_sha1);2160returndo_write_locked_index(istate, lock, flags);2161}2162move_cache_to_base_index(istate);2163 ret =do_write_index(si->base, fd,1);2164if(ret) {2165delete_tempfile(&temporary_sharedindex);2166return ret;2167}2168 ret =rename_tempfile(&temporary_sharedindex,2169git_path("sharedindex.%s",sha1_to_hex(si->base->sha1)));2170if(!ret)2171hashcpy(si->base_sha1, si->base->sha1);2172return ret;2173}21742175intwrite_locked_index(struct index_state *istate,struct lock_file *lock,2176unsigned flags)2177{2178struct split_index *si = istate->split_index;21792180if(!si || alternate_index_output ||2181(istate->cache_changed & ~EXTMASK)) {2182if(si)2183hashclr(si->base_sha1);2184returndo_write_locked_index(istate, lock, flags);2185}21862187if(getenv("GIT_TEST_SPLIT_INDEX")) {2188int v = si->base_sha1[0];2189if((v &15) <6)2190 istate->cache_changed |= SPLIT_INDEX_ORDERED;2191}2192if(istate->cache_changed & SPLIT_INDEX_ORDERED) {2193int ret =write_shared_index(istate, lock, flags);2194if(ret)2195return ret;2196}21972198returnwrite_split_index(istate, lock, flags);2199}22002201/*2202 * Read the index file that is potentially unmerged into given2203 * index_state, dropping any unmerged entries. Returns true if2204 * the index is unmerged. Callers who want to refuse to work2205 * from an unmerged state can call this and check its return value,2206 * instead of calling read_cache().2207 */2208intread_index_unmerged(struct index_state *istate)2209{2210int i;2211int unmerged =0;22122213read_index(istate);2214for(i =0; i < istate->cache_nr; i++) {2215struct cache_entry *ce = istate->cache[i];2216struct cache_entry *new_ce;2217int size, len;22182219if(!ce_stage(ce))2220continue;2221 unmerged =1;2222 len =ce_namelen(ce);2223 size =cache_entry_size(len);2224 new_ce =xcalloc(1, size);2225memcpy(new_ce->name, ce->name, len);2226 new_ce->ce_flags =create_ce_flags(0) | CE_CONFLICTED;2227 new_ce->ce_namelen = len;2228 new_ce->ce_mode = ce->ce_mode;2229if(add_index_entry(istate, new_ce,0))2230returnerror("%s: cannot drop to stage #0",2231 new_ce->name);2232}2233return unmerged;2234}22352236/*2237 * Returns 1 if the path is an "other" path with respect to2238 * the index; that is, the path is not mentioned in the index at all,2239 * either as a file, a directory with some files in the index,2240 * or as an unmerged entry.2241 *2242 * We helpfully remove a trailing "/" from directories so that2243 * the output of read_directory can be used as-is.2244 */2245intindex_name_is_other(const struct index_state *istate,const char*name,2246int namelen)2247{2248int pos;2249if(namelen && name[namelen -1] =='/')2250 namelen--;2251 pos =index_name_pos(istate, name, namelen);2252if(0<= pos)2253return0;/* exact match */2254 pos = -pos -1;2255if(pos < istate->cache_nr) {2256struct cache_entry *ce = istate->cache[pos];2257if(ce_namelen(ce) == namelen &&2258!memcmp(ce->name, name, namelen))2259return0;/* Yup, this one exists unmerged */2260}2261return1;2262}22632264void*read_blob_data_from_index(struct index_state *istate,const char*path,unsigned long*size)2265{2266int pos, len;2267unsigned long sz;2268enum object_type type;2269void*data;22702271 len =strlen(path);2272 pos =index_name_pos(istate, path, len);2273if(pos <0) {2274/*2275 * We might be in the middle of a merge, in which2276 * case we would read stage #2 (ours).2277 */2278int i;2279for(i = -pos -1;2280(pos <0&& i < istate->cache_nr &&2281!strcmp(istate->cache[i]->name, path));2282 i++)2283if(ce_stage(istate->cache[i]) ==2)2284 pos = i;2285}2286if(pos <0)2287return NULL;2288 data =read_sha1_file(istate->cache[pos]->oid.hash, &type, &sz);2289if(!data || type != OBJ_BLOB) {2290free(data);2291return NULL;2292}2293if(size)2294*size = sz;2295return data;2296}22972298voidstat_validity_clear(struct stat_validity *sv)2299{2300free(sv->sd);2301 sv->sd = NULL;2302}23032304intstat_validity_check(struct stat_validity *sv,const char*path)2305{2306struct stat st;23072308if(stat(path, &st) <0)2309return sv->sd == NULL;2310if(!sv->sd)2311return0;2312returnS_ISREG(st.st_mode) && !match_stat_data(sv->sd, &st);2313}23142315voidstat_validity_update(struct stat_validity *sv,int fd)2316{2317struct stat st;23182319if(fstat(fd, &st) <0|| !S_ISREG(st.st_mode))2320stat_validity_clear(sv);2321else{2322if(!sv->sd)2323 sv->sd =xcalloc(1,sizeof(struct stat_data));2324fill_stat_data(sv->sd, &st);2325}2326}