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 =git_open_cloexec(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 506intremove_index_entry_at(struct index_state *istate,int pos) 507{ 508struct cache_entry *ce = istate->cache[pos]; 509 510record_resolve_undo(istate, ce); 511remove_name_hash(istate, ce); 512save_or_free_index_entry(istate, ce); 513 istate->cache_changed |= CE_ENTRY_REMOVED; 514 istate->cache_nr--; 515if(pos >= istate->cache_nr) 516return0; 517memmove(istate->cache + pos, 518 istate->cache + pos +1, 519(istate->cache_nr - pos) *sizeof(struct cache_entry *)); 520return1; 521} 522 523/* 524 * Remove all cache entries marked for removal, that is where 525 * CE_REMOVE is set in ce_flags. This is much more effective than 526 * calling remove_index_entry_at() for each entry to be removed. 527 */ 528voidremove_marked_cache_entries(struct index_state *istate) 529{ 530struct cache_entry **ce_array = istate->cache; 531unsigned int i, j; 532 533for(i = j =0; i < istate->cache_nr; i++) { 534if(ce_array[i]->ce_flags & CE_REMOVE) { 535remove_name_hash(istate, ce_array[i]); 536save_or_free_index_entry(istate, ce_array[i]); 537} 538else 539 ce_array[j++] = ce_array[i]; 540} 541if(j == istate->cache_nr) 542return; 543 istate->cache_changed |= CE_ENTRY_REMOVED; 544 istate->cache_nr = j; 545} 546 547intremove_file_from_index(struct index_state *istate,const char*path) 548{ 549int pos =index_name_pos(istate, path,strlen(path)); 550if(pos <0) 551 pos = -pos-1; 552cache_tree_invalidate_path(istate, path); 553untracked_cache_remove_from_index(istate, path); 554while(pos < istate->cache_nr && !strcmp(istate->cache[pos]->name, path)) 555remove_index_entry_at(istate, pos); 556return0; 557} 558 559static intcompare_name(struct cache_entry *ce,const char*path,int namelen) 560{ 561return namelen !=ce_namelen(ce) ||memcmp(path, ce->name, namelen); 562} 563 564static intindex_name_pos_also_unmerged(struct index_state *istate, 565const char*path,int namelen) 566{ 567int pos =index_name_pos(istate, path, namelen); 568struct cache_entry *ce; 569 570if(pos >=0) 571return pos; 572 573/* maybe unmerged? */ 574 pos = -1- pos; 575if(pos >= istate->cache_nr || 576compare_name((ce = istate->cache[pos]), path, namelen)) 577return-1; 578 579/* order of preference: stage 2, 1, 3 */ 580if(ce_stage(ce) ==1&& pos +1< istate->cache_nr && 581ce_stage((ce = istate->cache[pos +1])) ==2&& 582!compare_name(ce, path, namelen)) 583 pos++; 584return pos; 585} 586 587static intdifferent_name(struct cache_entry *ce,struct cache_entry *alias) 588{ 589int len =ce_namelen(ce); 590returnce_namelen(alias) != len ||memcmp(ce->name, alias->name, len); 591} 592 593/* 594 * If we add a filename that aliases in the cache, we will use the 595 * name that we already have - but we don't want to update the same 596 * alias twice, because that implies that there were actually two 597 * different files with aliasing names! 598 * 599 * So we use the CE_ADDED flag to verify that the alias was an old 600 * one before we accept it as 601 */ 602static struct cache_entry *create_alias_ce(struct index_state *istate, 603struct cache_entry *ce, 604struct cache_entry *alias) 605{ 606int len; 607struct cache_entry *new; 608 609if(alias->ce_flags & CE_ADDED) 610die("Will not add file alias '%s' ('%s' already exists in index)", ce->name, alias->name); 611 612/* Ok, create the new entry using the name of the existing alias */ 613 len =ce_namelen(alias); 614new=xcalloc(1,cache_entry_size(len)); 615memcpy(new->name, alias->name, len); 616copy_cache_entry(new, ce); 617save_or_free_index_entry(istate, ce); 618return new; 619} 620 621voidset_object_name_for_intent_to_add_entry(struct cache_entry *ce) 622{ 623unsigned char sha1[20]; 624if(write_sha1_file("",0, blob_type, sha1)) 625die("cannot create an empty blob in the object database"); 626hashcpy(ce->oid.hash, sha1); 627} 628 629intadd_to_index(struct index_state *istate,const char*path,struct stat *st,int flags) 630{ 631int size, namelen, was_same; 632 mode_t st_mode = st->st_mode; 633struct cache_entry *ce, *alias; 634unsigned ce_option = CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE|CE_MATCH_RACY_IS_DIRTY; 635int verbose = flags & (ADD_CACHE_VERBOSE | ADD_CACHE_PRETEND); 636int pretend = flags & ADD_CACHE_PRETEND; 637int intent_only = flags & ADD_CACHE_INTENT; 638int add_option = (ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE| 639(intent_only ? ADD_CACHE_NEW_ONLY :0)); 640 641if(!S_ISREG(st_mode) && !S_ISLNK(st_mode) && !S_ISDIR(st_mode)) 642returnerror("%s: can only add regular files, symbolic links or git-directories", path); 643 644 namelen =strlen(path); 645if(S_ISDIR(st_mode)) { 646while(namelen && path[namelen-1] =='/') 647 namelen--; 648} 649 size =cache_entry_size(namelen); 650 ce =xcalloc(1, size); 651memcpy(ce->name, path, namelen); 652 ce->ce_namelen = namelen; 653if(!intent_only) 654fill_stat_cache_info(ce, st); 655else 656 ce->ce_flags |= CE_INTENT_TO_ADD; 657 658 659if(trust_executable_bit && has_symlinks) { 660 ce->ce_mode =create_ce_mode(st_mode); 661}else{ 662/* If there is an existing entry, pick the mode bits and type 663 * from it, otherwise assume unexecutable regular file. 664 */ 665struct cache_entry *ent; 666int pos =index_name_pos_also_unmerged(istate, path, namelen); 667 668 ent = (0<= pos) ? istate->cache[pos] : NULL; 669 ce->ce_mode =ce_mode_from_stat(ent, st_mode); 670} 671 672/* When core.ignorecase=true, determine if a directory of the same name but differing 673 * case already exists within the Git repository. If it does, ensure the directory 674 * case of the file being added to the repository matches (is folded into) the existing 675 * entry's directory case. 676 */ 677if(ignore_case) { 678adjust_dirname_case(istate, ce->name); 679} 680 681 alias =index_file_exists(istate, ce->name,ce_namelen(ce), ignore_case); 682if(alias && !ce_stage(alias) && !ie_match_stat(istate, alias, st, ce_option)) { 683/* Nothing changed, really */ 684if(!S_ISGITLINK(alias->ce_mode)) 685ce_mark_uptodate(alias); 686 alias->ce_flags |= CE_ADDED; 687 688free(ce); 689return0; 690} 691if(!intent_only) { 692if(index_path(ce->oid.hash, path, st, HASH_WRITE_OBJECT)) { 693free(ce); 694returnerror("unable to index file%s", path); 695} 696}else 697set_object_name_for_intent_to_add_entry(ce); 698 699if(ignore_case && alias &&different_name(ce, alias)) 700 ce =create_alias_ce(istate, ce, alias); 701 ce->ce_flags |= CE_ADDED; 702 703/* It was suspected to be racily clean, but it turns out to be Ok */ 704 was_same = (alias && 705!ce_stage(alias) && 706!oidcmp(&alias->oid, &ce->oid) && 707 ce->ce_mode == alias->ce_mode); 708 709if(pretend) 710free(ce); 711else if(add_index_entry(istate, ce, add_option)) { 712free(ce); 713returnerror("unable to add%sto index", path); 714} 715if(verbose && !was_same) 716printf("add '%s'\n", path); 717return0; 718} 719 720intadd_file_to_index(struct index_state *istate,const char*path,int flags) 721{ 722struct stat st; 723if(lstat(path, &st)) 724die_errno("unable to stat '%s'", path); 725returnadd_to_index(istate, path, &st, flags); 726} 727 728struct cache_entry *make_cache_entry(unsigned int mode, 729const unsigned char*sha1,const char*path,int stage, 730unsigned int refresh_options) 731{ 732int size, len; 733struct cache_entry *ce, *ret; 734 735if(!verify_path(path)) { 736error("Invalid path '%s'", path); 737return NULL; 738} 739 740 len =strlen(path); 741 size =cache_entry_size(len); 742 ce =xcalloc(1, size); 743 744hashcpy(ce->oid.hash, sha1); 745memcpy(ce->name, path, len); 746 ce->ce_flags =create_ce_flags(stage); 747 ce->ce_namelen = len; 748 ce->ce_mode =create_ce_mode(mode); 749 750 ret =refresh_cache_entry(ce, refresh_options); 751if(ret != ce) 752free(ce); 753return ret; 754} 755 756/* 757 * Chmod an index entry with either +x or -x. 758 * 759 * Returns -1 if the chmod for the particular cache entry failed (if it's 760 * not a regular file), -2 if an invalid flip argument is passed in, 0 761 * otherwise. 762 */ 763intchmod_index_entry(struct index_state *istate,struct cache_entry *ce, 764char flip) 765{ 766if(!S_ISREG(ce->ce_mode)) 767return-1; 768switch(flip) { 769case'+': 770 ce->ce_mode |=0111; 771break; 772case'-': 773 ce->ce_mode &= ~0111; 774break; 775default: 776return-2; 777} 778cache_tree_invalidate_path(istate, ce->name); 779 ce->ce_flags |= CE_UPDATE_IN_BASE; 780 istate->cache_changed |= CE_ENTRY_CHANGED; 781 782return0; 783} 784 785intce_same_name(const struct cache_entry *a,const struct cache_entry *b) 786{ 787int len =ce_namelen(a); 788returnce_namelen(b) == len && !memcmp(a->name, b->name, len); 789} 790 791/* 792 * We fundamentally don't like some paths: we don't want 793 * dot or dot-dot anywhere, and for obvious reasons don't 794 * want to recurse into ".git" either. 795 * 796 * Also, we don't want double slashes or slashes at the 797 * end that can make pathnames ambiguous. 798 */ 799static intverify_dotfile(const char*rest) 800{ 801/* 802 * The first character was '.', but that 803 * has already been discarded, we now test 804 * the rest. 805 */ 806 807/* "." is not allowed */ 808if(*rest =='\0'||is_dir_sep(*rest)) 809return0; 810 811switch(*rest) { 812/* 813 * ".git" followed by NUL or slash is bad. This 814 * shares the path end test with the ".." case. 815 */ 816case'g': 817case'G': 818if(rest[1] !='i'&& rest[1] !='I') 819break; 820if(rest[2] !='t'&& rest[2] !='T') 821break; 822 rest +=2; 823/* fallthrough */ 824case'.': 825if(rest[1] =='\0'||is_dir_sep(rest[1])) 826return0; 827} 828return1; 829} 830 831intverify_path(const char*path) 832{ 833char c; 834 835if(has_dos_drive_prefix(path)) 836return0; 837 838goto inside; 839for(;;) { 840if(!c) 841return1; 842if(is_dir_sep(c)) { 843inside: 844if(protect_hfs &&is_hfs_dotgit(path)) 845return0; 846if(protect_ntfs &&is_ntfs_dotgit(path)) 847return0; 848 c = *path++; 849if((c =='.'&& !verify_dotfile(path)) || 850is_dir_sep(c) || c =='\0') 851return0; 852} 853 c = *path++; 854} 855} 856 857/* 858 * Do we have another file that has the beginning components being a 859 * proper superset of the name we're trying to add? 860 */ 861static inthas_file_name(struct index_state *istate, 862const struct cache_entry *ce,int pos,int ok_to_replace) 863{ 864int retval =0; 865int len =ce_namelen(ce); 866int stage =ce_stage(ce); 867const char*name = ce->name; 868 869while(pos < istate->cache_nr) { 870struct cache_entry *p = istate->cache[pos++]; 871 872if(len >=ce_namelen(p)) 873break; 874if(memcmp(name, p->name, len)) 875break; 876if(ce_stage(p) != stage) 877continue; 878if(p->name[len] !='/') 879continue; 880if(p->ce_flags & CE_REMOVE) 881continue; 882 retval = -1; 883if(!ok_to_replace) 884break; 885remove_index_entry_at(istate, --pos); 886} 887return retval; 888} 889 890/* 891 * Do we have another file with a pathname that is a proper 892 * subset of the name we're trying to add? 893 */ 894static inthas_dir_name(struct index_state *istate, 895const struct cache_entry *ce,int pos,int ok_to_replace) 896{ 897int retval =0; 898int stage =ce_stage(ce); 899const char*name = ce->name; 900const char*slash = name +ce_namelen(ce); 901 902for(;;) { 903int len; 904 905for(;;) { 906if(*--slash =='/') 907break; 908if(slash <= ce->name) 909return retval; 910} 911 len = slash - name; 912 913 pos =index_name_stage_pos(istate, name, len, stage); 914if(pos >=0) { 915/* 916 * Found one, but not so fast. This could 917 * be a marker that says "I was here, but 918 * I am being removed". Such an entry is 919 * not a part of the resulting tree, and 920 * it is Ok to have a directory at the same 921 * path. 922 */ 923if(!(istate->cache[pos]->ce_flags & CE_REMOVE)) { 924 retval = -1; 925if(!ok_to_replace) 926break; 927remove_index_entry_at(istate, pos); 928continue; 929} 930} 931else 932 pos = -pos-1; 933 934/* 935 * Trivial optimization: if we find an entry that 936 * already matches the sub-directory, then we know 937 * we're ok, and we can exit. 938 */ 939while(pos < istate->cache_nr) { 940struct cache_entry *p = istate->cache[pos]; 941if((ce_namelen(p) <= len) || 942(p->name[len] !='/') || 943memcmp(p->name, name, len)) 944break;/* not our subdirectory */ 945if(ce_stage(p) == stage && !(p->ce_flags & CE_REMOVE)) 946/* 947 * p is at the same stage as our entry, and 948 * is a subdirectory of what we are looking 949 * at, so we cannot have conflicts at our 950 * level or anything shorter. 951 */ 952return retval; 953 pos++; 954} 955} 956return retval; 957} 958 959/* We may be in a situation where we already have path/file and path 960 * is being added, or we already have path and path/file is being 961 * added. Either one would result in a nonsense tree that has path 962 * twice when git-write-tree tries to write it out. Prevent it. 963 * 964 * If ok-to-replace is specified, we remove the conflicting entries 965 * from the cache so the caller should recompute the insert position. 966 * When this happens, we return non-zero. 967 */ 968static intcheck_file_directory_conflict(struct index_state *istate, 969const struct cache_entry *ce, 970int pos,int ok_to_replace) 971{ 972int retval; 973 974/* 975 * When ce is an "I am going away" entry, we allow it to be added 976 */ 977if(ce->ce_flags & CE_REMOVE) 978return0; 979 980/* 981 * We check if the path is a sub-path of a subsequent pathname 982 * first, since removing those will not change the position 983 * in the array. 984 */ 985 retval =has_file_name(istate, ce, pos, ok_to_replace); 986 987/* 988 * Then check if the path might have a clashing sub-directory 989 * before it. 990 */ 991return retval +has_dir_name(istate, ce, pos, ok_to_replace); 992} 993 994static intadd_index_entry_with_check(struct index_state *istate,struct cache_entry *ce,int option) 995{ 996int pos; 997int ok_to_add = option & ADD_CACHE_OK_TO_ADD; 998int ok_to_replace = option & ADD_CACHE_OK_TO_REPLACE; 999int skip_df_check = option & ADD_CACHE_SKIP_DFCHECK;1000int new_only = option & ADD_CACHE_NEW_ONLY;10011002if(!(option & ADD_CACHE_KEEP_CACHE_TREE))1003cache_tree_invalidate_path(istate, ce->name);1004 pos =index_name_stage_pos(istate, ce->name,ce_namelen(ce),ce_stage(ce));10051006/* existing match? Just replace it. */1007if(pos >=0) {1008if(!new_only)1009replace_index_entry(istate, pos, ce);1010return0;1011}1012 pos = -pos-1;10131014if(!(option & ADD_CACHE_KEEP_CACHE_TREE))1015untracked_cache_add_to_index(istate, ce->name);10161017/*1018 * Inserting a merged entry ("stage 0") into the index1019 * will always replace all non-merged entries..1020 */1021if(pos < istate->cache_nr &&ce_stage(ce) ==0) {1022while(ce_same_name(istate->cache[pos], ce)) {1023 ok_to_add =1;1024if(!remove_index_entry_at(istate, pos))1025break;1026}1027}10281029if(!ok_to_add)1030return-1;1031if(!verify_path(ce->name))1032returnerror("Invalid path '%s'", ce->name);10331034if(!skip_df_check &&1035check_file_directory_conflict(istate, ce, pos, ok_to_replace)) {1036if(!ok_to_replace)1037returnerror("'%s' appears as both a file and as a directory",1038 ce->name);1039 pos =index_name_stage_pos(istate, ce->name,ce_namelen(ce),ce_stage(ce));1040 pos = -pos-1;1041}1042return pos +1;1043}10441045intadd_index_entry(struct index_state *istate,struct cache_entry *ce,int option)1046{1047int pos;10481049if(option & ADD_CACHE_JUST_APPEND)1050 pos = istate->cache_nr;1051else{1052int ret;1053 ret =add_index_entry_with_check(istate, ce, option);1054if(ret <=0)1055return ret;1056 pos = ret -1;1057}10581059/* Make sure the array is big enough .. */1060ALLOC_GROW(istate->cache, istate->cache_nr +1, istate->cache_alloc);10611062/* Add it in.. */1063 istate->cache_nr++;1064if(istate->cache_nr > pos +1)1065memmove(istate->cache + pos +1,1066 istate->cache + pos,1067(istate->cache_nr - pos -1) *sizeof(ce));1068set_index_entry(istate, pos, ce);1069 istate->cache_changed |= CE_ENTRY_ADDED;1070return0;1071}10721073/*1074 * "refresh" does not calculate a new sha1 file or bring the1075 * cache up-to-date for mode/content changes. But what it1076 * _does_ do is to "re-match" the stat information of a file1077 * with the cache, so that you can refresh the cache for a1078 * file that hasn't been changed but where the stat entry is1079 * out of date.1080 *1081 * For example, you'd want to do this after doing a "git-read-tree",1082 * to link up the stat cache details with the proper files.1083 */1084static struct cache_entry *refresh_cache_ent(struct index_state *istate,1085struct cache_entry *ce,1086unsigned int options,int*err,1087int*changed_ret)1088{1089struct stat st;1090struct cache_entry *updated;1091int changed, size;1092int refresh = options & CE_MATCH_REFRESH;1093int ignore_valid = options & CE_MATCH_IGNORE_VALID;1094int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE;1095int ignore_missing = options & CE_MATCH_IGNORE_MISSING;10961097if(!refresh ||ce_uptodate(ce))1098return ce;10991100/*1101 * CE_VALID or CE_SKIP_WORKTREE means the user promised us1102 * that the change to the work tree does not matter and told1103 * us not to worry.1104 */1105if(!ignore_skip_worktree &&ce_skip_worktree(ce)) {1106ce_mark_uptodate(ce);1107return ce;1108}1109if(!ignore_valid && (ce->ce_flags & CE_VALID)) {1110ce_mark_uptodate(ce);1111return ce;1112}11131114if(has_symlink_leading_path(ce->name,ce_namelen(ce))) {1115if(ignore_missing)1116return ce;1117if(err)1118*err = ENOENT;1119return NULL;1120}11211122if(lstat(ce->name, &st) <0) {1123if(ignore_missing && errno == ENOENT)1124return ce;1125if(err)1126*err = errno;1127return NULL;1128}11291130 changed =ie_match_stat(istate, ce, &st, options);1131if(changed_ret)1132*changed_ret = changed;1133if(!changed) {1134/*1135 * The path is unchanged. If we were told to ignore1136 * valid bit, then we did the actual stat check and1137 * found that the entry is unmodified. If the entry1138 * is not marked VALID, this is the place to mark it1139 * valid again, under "assume unchanged" mode.1140 */1141if(ignore_valid && assume_unchanged &&1142!(ce->ce_flags & CE_VALID))1143;/* mark this one VALID again */1144else{1145/*1146 * We do not mark the index itself "modified"1147 * because CE_UPTODATE flag is in-core only;1148 * we are not going to write this change out.1149 */1150if(!S_ISGITLINK(ce->ce_mode))1151ce_mark_uptodate(ce);1152return ce;1153}1154}11551156if(ie_modified(istate, ce, &st, options)) {1157if(err)1158*err = EINVAL;1159return NULL;1160}11611162 size =ce_size(ce);1163 updated =xmalloc(size);1164memcpy(updated, ce, size);1165fill_stat_cache_info(updated, &st);1166/*1167 * If ignore_valid is not set, we should leave CE_VALID bit1168 * alone. Otherwise, paths marked with --no-assume-unchanged1169 * (i.e. things to be edited) will reacquire CE_VALID bit1170 * automatically, which is not really what we want.1171 */1172if(!ignore_valid && assume_unchanged &&1173!(ce->ce_flags & CE_VALID))1174 updated->ce_flags &= ~CE_VALID;11751176/* istate->cache_changed is updated in the caller */1177return updated;1178}11791180static voidshow_file(const char* fmt,const char* name,int in_porcelain,1181int* first,const char*header_msg)1182{1183if(in_porcelain && *first && header_msg) {1184printf("%s\n", header_msg);1185*first =0;1186}1187printf(fmt, name);1188}11891190intrefresh_index(struct index_state *istate,unsigned int flags,1191const struct pathspec *pathspec,1192char*seen,const char*header_msg)1193{1194int i;1195int has_errors =0;1196int really = (flags & REFRESH_REALLY) !=0;1197int allow_unmerged = (flags & REFRESH_UNMERGED) !=0;1198int quiet = (flags & REFRESH_QUIET) !=0;1199int not_new = (flags & REFRESH_IGNORE_MISSING) !=0;1200int ignore_submodules = (flags & REFRESH_IGNORE_SUBMODULES) !=0;1201int first =1;1202int in_porcelain = (flags & REFRESH_IN_PORCELAIN);1203unsigned int options = (CE_MATCH_REFRESH |1204(really ? CE_MATCH_IGNORE_VALID :0) |1205(not_new ? CE_MATCH_IGNORE_MISSING :0));1206const char*modified_fmt;1207const char*deleted_fmt;1208const char*typechange_fmt;1209const char*added_fmt;1210const char*unmerged_fmt;12111212 modified_fmt = (in_porcelain ?"M\t%s\n":"%s: needs update\n");1213 deleted_fmt = (in_porcelain ?"D\t%s\n":"%s: needs update\n");1214 typechange_fmt = (in_porcelain ?"T\t%s\n":"%sneeds update\n");1215 added_fmt = (in_porcelain ?"A\t%s\n":"%sneeds update\n");1216 unmerged_fmt = (in_porcelain ?"U\t%s\n":"%s: needs merge\n");1217for(i =0; i < istate->cache_nr; i++) {1218struct cache_entry *ce, *new;1219int cache_errno =0;1220int changed =0;1221int filtered =0;12221223 ce = istate->cache[i];1224if(ignore_submodules &&S_ISGITLINK(ce->ce_mode))1225continue;12261227if(pathspec && !ce_path_match(ce, pathspec, seen))1228 filtered =1;12291230if(ce_stage(ce)) {1231while((i < istate->cache_nr) &&1232!strcmp(istate->cache[i]->name, ce->name))1233 i++;1234 i--;1235if(allow_unmerged)1236continue;1237if(!filtered)1238show_file(unmerged_fmt, ce->name, in_porcelain,1239&first, header_msg);1240 has_errors =1;1241continue;1242}12431244if(filtered)1245continue;12461247new=refresh_cache_ent(istate, ce, options, &cache_errno, &changed);1248if(new== ce)1249continue;1250if(!new) {1251const char*fmt;12521253if(really && cache_errno == EINVAL) {1254/* If we are doing --really-refresh that1255 * means the index is not valid anymore.1256 */1257 ce->ce_flags &= ~CE_VALID;1258 ce->ce_flags |= CE_UPDATE_IN_BASE;1259 istate->cache_changed |= CE_ENTRY_CHANGED;1260}1261if(quiet)1262continue;12631264if(cache_errno == ENOENT)1265 fmt = deleted_fmt;1266else if(ce_intent_to_add(ce))1267 fmt = added_fmt;/* must be before other checks */1268else if(changed & TYPE_CHANGED)1269 fmt = typechange_fmt;1270else1271 fmt = modified_fmt;1272show_file(fmt,1273 ce->name, in_porcelain, &first, header_msg);1274 has_errors =1;1275continue;1276}12771278replace_index_entry(istate, i,new);1279}1280return has_errors;1281}12821283struct cache_entry *refresh_cache_entry(struct cache_entry *ce,1284unsigned int options)1285{1286returnrefresh_cache_ent(&the_index, ce, options, NULL, NULL);1287}128812891290/*****************************************************************1291 * Index File I/O1292 *****************************************************************/12931294#define INDEX_FORMAT_DEFAULT 312951296static unsigned intget_index_format_default(void)1297{1298char*envversion =getenv("GIT_INDEX_VERSION");1299char*endp;1300int value;1301unsigned int version = INDEX_FORMAT_DEFAULT;13021303if(!envversion) {1304if(!git_config_get_int("index.version", &value))1305 version = value;1306if(version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) {1307warning(_("index.version set, but the value is invalid.\n"1308"Using version%i"), INDEX_FORMAT_DEFAULT);1309return INDEX_FORMAT_DEFAULT;1310}1311return version;1312}13131314 version =strtoul(envversion, &endp,10);1315if(*endp ||1316 version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) {1317warning(_("GIT_INDEX_VERSION set, but the value is invalid.\n"1318"Using version%i"), INDEX_FORMAT_DEFAULT);1319 version = INDEX_FORMAT_DEFAULT;1320}1321return version;1322}13231324/*1325 * dev/ino/uid/gid/size are also just tracked to the low 32 bits1326 * Again - this is just a (very strong in practice) heuristic that1327 * the inode hasn't changed.1328 *1329 * We save the fields in big-endian order to allow using the1330 * index file over NFS transparently.1331 */1332struct ondisk_cache_entry {1333struct cache_time ctime;1334struct cache_time mtime;1335uint32_t dev;1336uint32_t ino;1337uint32_t mode;1338uint32_t uid;1339uint32_t gid;1340uint32_t size;1341unsigned char sha1[20];1342uint16_t flags;1343char name[FLEX_ARRAY];/* more */1344};13451346/*1347 * This struct is used when CE_EXTENDED bit is 11348 * The struct must match ondisk_cache_entry exactly from1349 * ctime till flags1350 */1351struct ondisk_cache_entry_extended {1352struct cache_time ctime;1353struct cache_time mtime;1354uint32_t dev;1355uint32_t ino;1356uint32_t mode;1357uint32_t uid;1358uint32_t gid;1359uint32_t size;1360unsigned char sha1[20];1361uint16_t flags;1362uint16_t flags2;1363char name[FLEX_ARRAY];/* more */1364};13651366/* These are only used for v3 or lower */1367#define align_flex_name(STRUCT,len) ((offsetof(struct STRUCT,name) + (len) + 8) & ~7)1368#define ondisk_cache_entry_size(len) align_flex_name(ondisk_cache_entry,len)1369#define ondisk_cache_entry_extended_size(len) align_flex_name(ondisk_cache_entry_extended,len)1370#define ondisk_ce_size(ce) (((ce)->ce_flags & CE_EXTENDED) ? \1371 ondisk_cache_entry_extended_size(ce_namelen(ce)) : \1372 ondisk_cache_entry_size(ce_namelen(ce)))13731374/* Allow fsck to force verification of the index checksum. */1375int verify_index_checksum;13761377static intverify_hdr(struct cache_header *hdr,unsigned long size)1378{1379 git_SHA_CTX c;1380unsigned char sha1[20];1381int hdr_version;13821383if(hdr->hdr_signature !=htonl(CACHE_SIGNATURE))1384returnerror("bad signature");1385 hdr_version =ntohl(hdr->hdr_version);1386if(hdr_version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < hdr_version)1387returnerror("bad index version%d", hdr_version);13881389if(!verify_index_checksum)1390return0;13911392git_SHA1_Init(&c);1393git_SHA1_Update(&c, hdr, size -20);1394git_SHA1_Final(sha1, &c);1395if(hashcmp(sha1, (unsigned char*)hdr + size -20))1396returnerror("bad index file sha1 signature");1397return0;1398}13991400static intread_index_extension(struct index_state *istate,1401const char*ext,void*data,unsigned long sz)1402{1403switch(CACHE_EXT(ext)) {1404case CACHE_EXT_TREE:1405 istate->cache_tree =cache_tree_read(data, sz);1406break;1407case CACHE_EXT_RESOLVE_UNDO:1408 istate->resolve_undo =resolve_undo_read(data, sz);1409break;1410case CACHE_EXT_LINK:1411if(read_link_extension(istate, data, sz))1412return-1;1413break;1414case CACHE_EXT_UNTRACKED:1415 istate->untracked =read_untracked_extension(data, sz);1416break;1417default:1418if(*ext <'A'||'Z'< *ext)1419returnerror("index uses %.4s extension, which we do not understand",1420 ext);1421fprintf(stderr,"ignoring %.4s extension\n", ext);1422break;1423}1424return0;1425}14261427inthold_locked_index(struct lock_file *lk,int lock_flags)1428{1429returnhold_lock_file_for_update(lk,get_index_file(), lock_flags);1430}14311432intread_index(struct index_state *istate)1433{1434returnread_index_from(istate,get_index_file());1435}14361437static struct cache_entry *cache_entry_from_ondisk(struct ondisk_cache_entry *ondisk,1438unsigned int flags,1439const char*name,1440size_t len)1441{1442struct cache_entry *ce =xmalloc(cache_entry_size(len));14431444 ce->ce_stat_data.sd_ctime.sec =get_be32(&ondisk->ctime.sec);1445 ce->ce_stat_data.sd_mtime.sec =get_be32(&ondisk->mtime.sec);1446 ce->ce_stat_data.sd_ctime.nsec =get_be32(&ondisk->ctime.nsec);1447 ce->ce_stat_data.sd_mtime.nsec =get_be32(&ondisk->mtime.nsec);1448 ce->ce_stat_data.sd_dev =get_be32(&ondisk->dev);1449 ce->ce_stat_data.sd_ino =get_be32(&ondisk->ino);1450 ce->ce_mode =get_be32(&ondisk->mode);1451 ce->ce_stat_data.sd_uid =get_be32(&ondisk->uid);1452 ce->ce_stat_data.sd_gid =get_be32(&ondisk->gid);1453 ce->ce_stat_data.sd_size =get_be32(&ondisk->size);1454 ce->ce_flags = flags & ~CE_NAMEMASK;1455 ce->ce_namelen = len;1456 ce->index =0;1457hashcpy(ce->oid.hash, ondisk->sha1);1458memcpy(ce->name, name, len);1459 ce->name[len] ='\0';1460return ce;1461}14621463/*1464 * Adjacent cache entries tend to share the leading paths, so it makes1465 * sense to only store the differences in later entries. In the v41466 * on-disk format of the index, each on-disk cache entry stores the1467 * number of bytes to be stripped from the end of the previous name,1468 * and the bytes to append to the result, to come up with its name.1469 */1470static unsigned longexpand_name_field(struct strbuf *name,const char*cp_)1471{1472const unsigned char*ep, *cp = (const unsigned char*)cp_;1473size_t len =decode_varint(&cp);14741475if(name->len < len)1476die("malformed name field in the index");1477strbuf_remove(name, name->len - len, len);1478for(ep = cp; *ep; ep++)1479;/* find the end */1480strbuf_add(name, cp, ep - cp);1481return(const char*)ep +1- cp_;1482}14831484static struct cache_entry *create_from_disk(struct ondisk_cache_entry *ondisk,1485unsigned long*ent_size,1486struct strbuf *previous_name)1487{1488struct cache_entry *ce;1489size_t len;1490const char*name;1491unsigned int flags;14921493/* On-disk flags are just 16 bits */1494 flags =get_be16(&ondisk->flags);1495 len = flags & CE_NAMEMASK;14961497if(flags & CE_EXTENDED) {1498struct ondisk_cache_entry_extended *ondisk2;1499int extended_flags;1500 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;1501 extended_flags =get_be16(&ondisk2->flags2) <<16;1502/* We do not yet understand any bit out of CE_EXTENDED_FLAGS */1503if(extended_flags & ~CE_EXTENDED_FLAGS)1504die("Unknown index entry format%08x", extended_flags);1505 flags |= extended_flags;1506 name = ondisk2->name;1507}1508else1509 name = ondisk->name;15101511if(!previous_name) {1512/* v3 and earlier */1513if(len == CE_NAMEMASK)1514 len =strlen(name);1515 ce =cache_entry_from_ondisk(ondisk, flags, name, len);15161517*ent_size =ondisk_ce_size(ce);1518}else{1519unsigned long consumed;1520 consumed =expand_name_field(previous_name, name);1521 ce =cache_entry_from_ondisk(ondisk, flags,1522 previous_name->buf,1523 previous_name->len);15241525*ent_size = (name - ((char*)ondisk)) + consumed;1526}1527return ce;1528}15291530static voidcheck_ce_order(struct index_state *istate)1531{1532unsigned int i;15331534for(i =1; i < istate->cache_nr; i++) {1535struct cache_entry *ce = istate->cache[i -1];1536struct cache_entry *next_ce = istate->cache[i];1537int name_compare =strcmp(ce->name, next_ce->name);15381539if(0< name_compare)1540die("unordered stage entries in index");1541if(!name_compare) {1542if(!ce_stage(ce))1543die("multiple stage entries for merged file '%s'",1544 ce->name);1545if(ce_stage(ce) >ce_stage(next_ce))1546die("unordered stage entries for '%s'",1547 ce->name);1548}1549}1550}15511552static voidtweak_untracked_cache(struct index_state *istate)1553{1554switch(git_config_get_untracked_cache()) {1555case-1:/* keep: do nothing */1556break;1557case0:/* false */1558remove_untracked_cache(istate);1559break;1560case1:/* true */1561add_untracked_cache(istate);1562break;1563default:/* unknown value: do nothing */1564break;1565}1566}15671568static voidtweak_split_index(struct index_state *istate)1569{1570switch(git_config_get_split_index()) {1571case-1:/* unset: do nothing */1572break;1573case0:/* false */1574remove_split_index(istate);1575break;1576case1:/* true */1577add_split_index(istate);1578break;1579default:/* unknown value: do nothing */1580break;1581}1582}15831584static voidpost_read_index_from(struct index_state *istate)1585{1586check_ce_order(istate);1587tweak_untracked_cache(istate);1588tweak_split_index(istate);1589}15901591/* remember to discard_cache() before reading a different cache! */1592intdo_read_index(struct index_state *istate,const char*path,int must_exist)1593{1594int fd, i;1595struct stat st;1596unsigned long src_offset;1597struct cache_header *hdr;1598void*mmap;1599size_t mmap_size;1600struct strbuf previous_name_buf = STRBUF_INIT, *previous_name;16011602if(istate->initialized)1603return istate->cache_nr;16041605 istate->timestamp.sec =0;1606 istate->timestamp.nsec =0;1607 fd =open(path, O_RDONLY);1608if(fd <0) {1609if(!must_exist && errno == ENOENT)1610return0;1611die_errno("%s: index file open failed", path);1612}16131614if(fstat(fd, &st))1615die_errno("cannot stat the open index");16161617 mmap_size =xsize_t(st.st_size);1618if(mmap_size <sizeof(struct cache_header) +20)1619die("index file smaller than expected");16201621 mmap =xmmap(NULL, mmap_size, PROT_READ, MAP_PRIVATE, fd,0);1622if(mmap == MAP_FAILED)1623die_errno("unable to map index file");1624close(fd);16251626 hdr = mmap;1627if(verify_hdr(hdr, mmap_size) <0)1628goto unmap;16291630hashcpy(istate->sha1, (const unsigned char*)hdr + mmap_size -20);1631 istate->version =ntohl(hdr->hdr_version);1632 istate->cache_nr =ntohl(hdr->hdr_entries);1633 istate->cache_alloc =alloc_nr(istate->cache_nr);1634 istate->cache =xcalloc(istate->cache_alloc,sizeof(*istate->cache));1635 istate->initialized =1;16361637if(istate->version ==4)1638 previous_name = &previous_name_buf;1639else1640 previous_name = NULL;16411642 src_offset =sizeof(*hdr);1643for(i =0; i < istate->cache_nr; i++) {1644struct ondisk_cache_entry *disk_ce;1645struct cache_entry *ce;1646unsigned long consumed;16471648 disk_ce = (struct ondisk_cache_entry *)((char*)mmap + src_offset);1649 ce =create_from_disk(disk_ce, &consumed, previous_name);1650set_index_entry(istate, i, ce);16511652 src_offset += consumed;1653}1654strbuf_release(&previous_name_buf);1655 istate->timestamp.sec = st.st_mtime;1656 istate->timestamp.nsec =ST_MTIME_NSEC(st);16571658while(src_offset <= mmap_size -20-8) {1659/* After an array of active_nr index entries,1660 * there can be arbitrary number of extended1661 * sections, each of which is prefixed with1662 * extension name (4-byte) and section length1663 * in 4-byte network byte order.1664 */1665uint32_t extsize;1666memcpy(&extsize, (char*)mmap + src_offset +4,4);1667 extsize =ntohl(extsize);1668if(read_index_extension(istate,1669(const char*) mmap + src_offset,1670(char*) mmap + src_offset +8,1671 extsize) <0)1672goto unmap;1673 src_offset +=8;1674 src_offset += extsize;1675}1676munmap(mmap, mmap_size);1677return istate->cache_nr;16781679unmap:1680munmap(mmap, mmap_size);1681die("index file corrupt");1682}16831684/*1685 * Signal that the shared index is used by updating its mtime.1686 *1687 * This way, shared index can be removed if they have not been used1688 * for some time.1689 */1690static voidfreshen_shared_index(char*base_sha1_hex,int warn)1691{1692const char*shared_index =git_path("sharedindex.%s", base_sha1_hex);1693if(!check_and_freshen_file(shared_index,1) && warn)1694warning("could not freshen shared index '%s'", shared_index);1695}16961697intread_index_from(struct index_state *istate,const char*path)1698{1699struct split_index *split_index;1700int ret;1701char*base_sha1_hex;1702const char*base_path;17031704/* istate->initialized covers both .git/index and .git/sharedindex.xxx */1705if(istate->initialized)1706return istate->cache_nr;17071708 ret =do_read_index(istate, path,0);17091710 split_index = istate->split_index;1711if(!split_index ||is_null_sha1(split_index->base_sha1)) {1712post_read_index_from(istate);1713return ret;1714}17151716if(split_index->base)1717discard_index(split_index->base);1718else1719 split_index->base =xcalloc(1,sizeof(*split_index->base));17201721 base_sha1_hex =sha1_to_hex(split_index->base_sha1);1722 base_path =git_path("sharedindex.%s", base_sha1_hex);1723 ret =do_read_index(split_index->base, base_path,1);1724if(hashcmp(split_index->base_sha1, split_index->base->sha1))1725die("broken index, expect%sin%s, got%s",1726 base_sha1_hex, base_path,1727sha1_to_hex(split_index->base->sha1));17281729freshen_shared_index(base_sha1_hex,0);1730merge_base_index(istate);1731post_read_index_from(istate);1732return ret;1733}17341735intis_index_unborn(struct index_state *istate)1736{1737return(!istate->cache_nr && !istate->timestamp.sec);1738}17391740intdiscard_index(struct index_state *istate)1741{1742int i;17431744for(i =0; i < istate->cache_nr; i++) {1745if(istate->cache[i]->index &&1746 istate->split_index &&1747 istate->split_index->base &&1748 istate->cache[i]->index <= istate->split_index->base->cache_nr &&1749 istate->cache[i] == istate->split_index->base->cache[istate->cache[i]->index -1])1750continue;1751free(istate->cache[i]);1752}1753resolve_undo_clear_index(istate);1754 istate->cache_nr =0;1755 istate->cache_changed =0;1756 istate->timestamp.sec =0;1757 istate->timestamp.nsec =0;1758free_name_hash(istate);1759cache_tree_free(&(istate->cache_tree));1760 istate->initialized =0;1761free(istate->cache);1762 istate->cache = NULL;1763 istate->cache_alloc =0;1764discard_split_index(istate);1765free_untracked_cache(istate->untracked);1766 istate->untracked = NULL;1767return0;1768}17691770intunmerged_index(const struct index_state *istate)1771{1772int i;1773for(i =0; i < istate->cache_nr; i++) {1774if(ce_stage(istate->cache[i]))1775return1;1776}1777return0;1778}17791780#define WRITE_BUFFER_SIZE 81921781static unsigned char write_buffer[WRITE_BUFFER_SIZE];1782static unsigned long write_buffer_len;17831784static intce_write_flush(git_SHA_CTX *context,int fd)1785{1786unsigned int buffered = write_buffer_len;1787if(buffered) {1788git_SHA1_Update(context, write_buffer, buffered);1789if(write_in_full(fd, write_buffer, buffered) != buffered)1790return-1;1791 write_buffer_len =0;1792}1793return0;1794}17951796static intce_write(git_SHA_CTX *context,int fd,void*data,unsigned int len)1797{1798while(len) {1799unsigned int buffered = write_buffer_len;1800unsigned int partial = WRITE_BUFFER_SIZE - buffered;1801if(partial > len)1802 partial = len;1803memcpy(write_buffer + buffered, data, partial);1804 buffered += partial;1805if(buffered == WRITE_BUFFER_SIZE) {1806 write_buffer_len = buffered;1807if(ce_write_flush(context, fd))1808return-1;1809 buffered =0;1810}1811 write_buffer_len = buffered;1812 len -= partial;1813 data = (char*) data + partial;1814}1815return0;1816}18171818static intwrite_index_ext_header(git_SHA_CTX *context,int fd,1819unsigned int ext,unsigned int sz)1820{1821 ext =htonl(ext);1822 sz =htonl(sz);1823return((ce_write(context, fd, &ext,4) <0) ||1824(ce_write(context, fd, &sz,4) <0)) ? -1:0;1825}18261827static intce_flush(git_SHA_CTX *context,int fd,unsigned char*sha1)1828{1829unsigned int left = write_buffer_len;18301831if(left) {1832 write_buffer_len =0;1833git_SHA1_Update(context, write_buffer, left);1834}18351836/* Flush first if not enough space for SHA1 signature */1837if(left +20> WRITE_BUFFER_SIZE) {1838if(write_in_full(fd, write_buffer, left) != left)1839return-1;1840 left =0;1841}18421843/* Append the SHA1 signature at the end */1844git_SHA1_Final(write_buffer + left, context);1845hashcpy(sha1, write_buffer + left);1846 left +=20;1847return(write_in_full(fd, write_buffer, left) != left) ? -1:0;1848}18491850static voidce_smudge_racily_clean_entry(struct cache_entry *ce)1851{1852/*1853 * The only thing we care about in this function is to smudge the1854 * falsely clean entry due to touch-update-touch race, so we leave1855 * everything else as they are. We are called for entries whose1856 * ce_stat_data.sd_mtime match the index file mtime.1857 *1858 * Note that this actually does not do much for gitlinks, for1859 * which ce_match_stat_basic() always goes to the actual1860 * contents. The caller checks with is_racy_timestamp() which1861 * always says "no" for gitlinks, so we are not called for them ;-)1862 */1863struct stat st;18641865if(lstat(ce->name, &st) <0)1866return;1867if(ce_match_stat_basic(ce, &st))1868return;1869if(ce_modified_check_fs(ce, &st)) {1870/* This is "racily clean"; smudge it. Note that this1871 * is a tricky code. At first glance, it may appear1872 * that it can break with this sequence:1873 *1874 * $ echo xyzzy >frotz1875 * $ git-update-index --add frotz1876 * $ : >frotz1877 * $ sleep 31878 * $ echo filfre >nitfol1879 * $ git-update-index --add nitfol1880 *1881 * but it does not. When the second update-index runs,1882 * it notices that the entry "frotz" has the same timestamp1883 * as index, and if we were to smudge it by resetting its1884 * size to zero here, then the object name recorded1885 * in index is the 6-byte file but the cached stat information1886 * becomes zero --- which would then match what we would1887 * obtain from the filesystem next time we stat("frotz").1888 *1889 * However, the second update-index, before calling1890 * this function, notices that the cached size is 61891 * bytes and what is on the filesystem is an empty1892 * file, and never calls us, so the cached size information1893 * for "frotz" stays 6 which does not match the filesystem.1894 */1895 ce->ce_stat_data.sd_size =0;1896}1897}18981899/* Copy miscellaneous fields but not the name */1900static char*copy_cache_entry_to_ondisk(struct ondisk_cache_entry *ondisk,1901struct cache_entry *ce)1902{1903short flags;19041905 ondisk->ctime.sec =htonl(ce->ce_stat_data.sd_ctime.sec);1906 ondisk->mtime.sec =htonl(ce->ce_stat_data.sd_mtime.sec);1907 ondisk->ctime.nsec =htonl(ce->ce_stat_data.sd_ctime.nsec);1908 ondisk->mtime.nsec =htonl(ce->ce_stat_data.sd_mtime.nsec);1909 ondisk->dev =htonl(ce->ce_stat_data.sd_dev);1910 ondisk->ino =htonl(ce->ce_stat_data.sd_ino);1911 ondisk->mode =htonl(ce->ce_mode);1912 ondisk->uid =htonl(ce->ce_stat_data.sd_uid);1913 ondisk->gid =htonl(ce->ce_stat_data.sd_gid);1914 ondisk->size =htonl(ce->ce_stat_data.sd_size);1915hashcpy(ondisk->sha1, ce->oid.hash);19161917 flags = ce->ce_flags & ~CE_NAMEMASK;1918 flags |= (ce_namelen(ce) >= CE_NAMEMASK ? CE_NAMEMASK :ce_namelen(ce));1919 ondisk->flags =htons(flags);1920if(ce->ce_flags & CE_EXTENDED) {1921struct ondisk_cache_entry_extended *ondisk2;1922 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;1923 ondisk2->flags2 =htons((ce->ce_flags & CE_EXTENDED_FLAGS) >>16);1924return ondisk2->name;1925}1926else{1927return ondisk->name;1928}1929}19301931static intce_write_entry(git_SHA_CTX *c,int fd,struct cache_entry *ce,1932struct strbuf *previous_name)1933{1934int size;1935struct ondisk_cache_entry *ondisk;1936int saved_namelen = saved_namelen;/* compiler workaround */1937char*name;1938int result;19391940if(ce->ce_flags & CE_STRIP_NAME) {1941 saved_namelen =ce_namelen(ce);1942 ce->ce_namelen =0;1943}19441945if(!previous_name) {1946 size =ondisk_ce_size(ce);1947 ondisk =xcalloc(1, size);1948 name =copy_cache_entry_to_ondisk(ondisk, ce);1949memcpy(name, ce->name,ce_namelen(ce));1950}else{1951int common, to_remove, prefix_size;1952unsigned char to_remove_vi[16];1953for(common =0;1954(ce->name[common] &&1955 common < previous_name->len &&1956 ce->name[common] == previous_name->buf[common]);1957 common++)1958;/* still matching */1959 to_remove = previous_name->len - common;1960 prefix_size =encode_varint(to_remove, to_remove_vi);19611962if(ce->ce_flags & CE_EXTENDED)1963 size =offsetof(struct ondisk_cache_entry_extended, name);1964else1965 size =offsetof(struct ondisk_cache_entry, name);1966 size += prefix_size + (ce_namelen(ce) - common +1);19671968 ondisk =xcalloc(1, size);1969 name =copy_cache_entry_to_ondisk(ondisk, ce);1970memcpy(name, to_remove_vi, prefix_size);1971memcpy(name + prefix_size, ce->name + common,ce_namelen(ce) - common);19721973strbuf_splice(previous_name, common, to_remove,1974 ce->name + common,ce_namelen(ce) - common);1975}1976if(ce->ce_flags & CE_STRIP_NAME) {1977 ce->ce_namelen = saved_namelen;1978 ce->ce_flags &= ~CE_STRIP_NAME;1979}19801981 result =ce_write(c, fd, ondisk, size);1982free(ondisk);1983return result;1984}19851986/*1987 * This function verifies if index_state has the correct sha1 of the1988 * index file. Don't die if we have any other failure, just return 0.1989 */1990static intverify_index_from(const struct index_state *istate,const char*path)1991{1992int fd;1993 ssize_t n;1994struct stat st;1995unsigned char sha1[20];19961997if(!istate->initialized)1998return0;19992000 fd =open(path, O_RDONLY);2001if(fd <0)2002return0;20032004if(fstat(fd, &st))2005goto out;20062007if(st.st_size <sizeof(struct cache_header) +20)2008goto out;20092010 n =pread_in_full(fd, sha1,20, st.st_size -20);2011if(n !=20)2012goto out;20132014if(hashcmp(istate->sha1, sha1))2015goto out;20162017close(fd);2018return1;20192020out:2021close(fd);2022return0;2023}20242025static intverify_index(const struct index_state *istate)2026{2027returnverify_index_from(istate,get_index_file());2028}20292030static inthas_racy_timestamp(struct index_state *istate)2031{2032int entries = istate->cache_nr;2033int i;20342035for(i =0; i < entries; i++) {2036struct cache_entry *ce = istate->cache[i];2037if(is_racy_timestamp(istate, ce))2038return1;2039}2040return0;2041}20422043/*2044 * Opportunistically update the index but do not complain if we can't2045 */2046voidupdate_index_if_able(struct index_state *istate,struct lock_file *lockfile)2047{2048if((istate->cache_changed ||has_racy_timestamp(istate)) &&2049verify_index(istate) &&2050write_locked_index(istate, lockfile, COMMIT_LOCK))2051rollback_lock_file(lockfile);2052}20532054static intdo_write_index(struct index_state *istate,int newfd,2055int strip_extensions)2056{2057 git_SHA_CTX c;2058struct cache_header hdr;2059int i, err, removed, extended, hdr_version;2060struct cache_entry **cache = istate->cache;2061int entries = istate->cache_nr;2062struct stat st;2063struct strbuf previous_name_buf = STRBUF_INIT, *previous_name;20642065for(i = removed = extended =0; i < entries; i++) {2066if(cache[i]->ce_flags & CE_REMOVE)2067 removed++;20682069/* reduce extended entries if possible */2070 cache[i]->ce_flags &= ~CE_EXTENDED;2071if(cache[i]->ce_flags & CE_EXTENDED_FLAGS) {2072 extended++;2073 cache[i]->ce_flags |= CE_EXTENDED;2074}2075}20762077if(!istate->version) {2078 istate->version =get_index_format_default();2079if(getenv("GIT_TEST_SPLIT_INDEX"))2080init_split_index(istate);2081}20822083/* demote version 3 to version 2 when the latter suffices */2084if(istate->version ==3|| istate->version ==2)2085 istate->version = extended ?3:2;20862087 hdr_version = istate->version;20882089 hdr.hdr_signature =htonl(CACHE_SIGNATURE);2090 hdr.hdr_version =htonl(hdr_version);2091 hdr.hdr_entries =htonl(entries - removed);20922093git_SHA1_Init(&c);2094if(ce_write(&c, newfd, &hdr,sizeof(hdr)) <0)2095return-1;20962097 previous_name = (hdr_version ==4) ? &previous_name_buf : NULL;2098for(i =0; i < entries; i++) {2099struct cache_entry *ce = cache[i];2100if(ce->ce_flags & CE_REMOVE)2101continue;2102if(!ce_uptodate(ce) &&is_racy_timestamp(istate, ce))2103ce_smudge_racily_clean_entry(ce);2104if(is_null_oid(&ce->oid)) {2105static const char msg[] ="cache entry has null sha1:%s";2106static int allow = -1;21072108if(allow <0)2109 allow =git_env_bool("GIT_ALLOW_NULL_SHA1",0);2110if(allow)2111warning(msg, ce->name);2112else2113returnerror(msg, ce->name);2114}2115if(ce_write_entry(&c, newfd, ce, previous_name) <0)2116return-1;2117}2118strbuf_release(&previous_name_buf);21192120/* Write extension data here */2121if(!strip_extensions && istate->split_index) {2122struct strbuf sb = STRBUF_INIT;21232124 err =write_link_extension(&sb, istate) <0||2125write_index_ext_header(&c, newfd, CACHE_EXT_LINK,2126 sb.len) <0||2127ce_write(&c, newfd, sb.buf, sb.len) <0;2128strbuf_release(&sb);2129if(err)2130return-1;2131}2132if(!strip_extensions && istate->cache_tree) {2133struct strbuf sb = STRBUF_INIT;21342135cache_tree_write(&sb, istate->cache_tree);2136 err =write_index_ext_header(&c, newfd, CACHE_EXT_TREE, sb.len) <02137||ce_write(&c, newfd, sb.buf, sb.len) <0;2138strbuf_release(&sb);2139if(err)2140return-1;2141}2142if(!strip_extensions && istate->resolve_undo) {2143struct strbuf sb = STRBUF_INIT;21442145resolve_undo_write(&sb, istate->resolve_undo);2146 err =write_index_ext_header(&c, newfd, CACHE_EXT_RESOLVE_UNDO,2147 sb.len) <02148||ce_write(&c, newfd, sb.buf, sb.len) <0;2149strbuf_release(&sb);2150if(err)2151return-1;2152}2153if(!strip_extensions && istate->untracked) {2154struct strbuf sb = STRBUF_INIT;21552156write_untracked_extension(&sb, istate->untracked);2157 err =write_index_ext_header(&c, newfd, CACHE_EXT_UNTRACKED,2158 sb.len) <0||2159ce_write(&c, newfd, sb.buf, sb.len) <0;2160strbuf_release(&sb);2161if(err)2162return-1;2163}21642165if(ce_flush(&c, newfd, istate->sha1) ||fstat(newfd, &st))2166return-1;2167 istate->timestamp.sec = (unsigned int)st.st_mtime;2168 istate->timestamp.nsec =ST_MTIME_NSEC(st);2169return0;2170}21712172voidset_alternate_index_output(const char*name)2173{2174 alternate_index_output = name;2175}21762177static intcommit_locked_index(struct lock_file *lk)2178{2179if(alternate_index_output)2180returncommit_lock_file_to(lk, alternate_index_output);2181else2182returncommit_lock_file(lk);2183}21842185static intdo_write_locked_index(struct index_state *istate,struct lock_file *lock,2186unsigned flags)2187{2188int ret =do_write_index(istate,get_lock_file_fd(lock),0);2189if(ret)2190return ret;2191assert((flags & (COMMIT_LOCK | CLOSE_LOCK)) !=2192(COMMIT_LOCK | CLOSE_LOCK));2193if(flags & COMMIT_LOCK)2194returncommit_locked_index(lock);2195else if(flags & CLOSE_LOCK)2196returnclose_lock_file(lock);2197else2198return ret;2199}22002201static intwrite_split_index(struct index_state *istate,2202struct lock_file *lock,2203unsigned flags)2204{2205int ret;2206prepare_to_write_split_index(istate);2207 ret =do_write_locked_index(istate, lock, flags);2208finish_writing_split_index(istate);2209return ret;2210}22112212static const char*shared_index_expire ="2.weeks.ago";22132214static unsigned longget_shared_index_expire_date(void)2215{2216static unsigned long shared_index_expire_date;2217static int shared_index_expire_date_prepared;22182219if(!shared_index_expire_date_prepared) {2220git_config_get_expiry("splitindex.sharedindexexpire",2221&shared_index_expire);2222 shared_index_expire_date =approxidate(shared_index_expire);2223 shared_index_expire_date_prepared =1;2224}22252226return shared_index_expire_date;2227}22282229static intshould_delete_shared_index(const char*shared_index_path)2230{2231struct stat st;2232unsigned long expiration;22332234/* Check timestamp */2235 expiration =get_shared_index_expire_date();2236if(!expiration)2237return0;2238if(stat(shared_index_path, &st))2239returnerror_errno(_("could not stat '%s"), shared_index_path);2240if(st.st_mtime > expiration)2241return0;22422243return1;2244}22452246static intclean_shared_index_files(const char*current_hex)2247{2248struct dirent *de;2249DIR*dir =opendir(get_git_dir());22502251if(!dir)2252returnerror_errno(_("unable to open git dir:%s"),get_git_dir());22532254while((de =readdir(dir)) != NULL) {2255const char*sha1_hex;2256const char*shared_index_path;2257if(!skip_prefix(de->d_name,"sharedindex.", &sha1_hex))2258continue;2259if(!strcmp(sha1_hex, current_hex))2260continue;2261 shared_index_path =git_path("%s", de->d_name);2262if(should_delete_shared_index(shared_index_path) >0&&2263unlink(shared_index_path))2264warning_errno(_("unable to unlink:%s"), shared_index_path);2265}2266closedir(dir);22672268return0;2269}22702271static struct tempfile temporary_sharedindex;22722273static intwrite_shared_index(struct index_state *istate,2274struct lock_file *lock,unsigned flags)2275{2276struct split_index *si = istate->split_index;2277int fd, ret;22782279 fd =mks_tempfile(&temporary_sharedindex,git_path("sharedindex_XXXXXX"));2280if(fd <0) {2281hashclr(si->base_sha1);2282returndo_write_locked_index(istate, lock, flags);2283}2284move_cache_to_base_index(istate);2285 ret =do_write_index(si->base, fd,1);2286if(ret) {2287delete_tempfile(&temporary_sharedindex);2288return ret;2289}2290 ret =rename_tempfile(&temporary_sharedindex,2291git_path("sharedindex.%s",sha1_to_hex(si->base->sha1)));2292if(!ret) {2293hashcpy(si->base_sha1, si->base->sha1);2294clean_shared_index_files(sha1_to_hex(si->base->sha1));2295}22962297return ret;2298}22992300static const int default_max_percent_split_change =20;23012302static inttoo_many_not_shared_entries(struct index_state *istate)2303{2304int i, not_shared =0;2305int max_split =git_config_get_max_percent_split_change();23062307switch(max_split) {2308case-1:2309/* not or badly configured: use the default value */2310 max_split = default_max_percent_split_change;2311break;2312case0:2313return1;/* 0% means always write a new shared index */2314case100:2315return0;/* 100% means never write a new shared index */2316default:2317break;/* just use the configured value */2318}23192320/* Count not shared entries */2321for(i =0; i < istate->cache_nr; i++) {2322struct cache_entry *ce = istate->cache[i];2323if(!ce->index)2324 not_shared++;2325}23262327return(int64_t)istate->cache_nr * max_split < (int64_t)not_shared *100;2328}23292330intwrite_locked_index(struct index_state *istate,struct lock_file *lock,2331unsigned flags)2332{2333int new_shared_index, ret;2334struct split_index *si = istate->split_index;23352336if(!si || alternate_index_output ||2337(istate->cache_changed & ~EXTMASK)) {2338if(si)2339hashclr(si->base_sha1);2340returndo_write_locked_index(istate, lock, flags);2341}23422343if(getenv("GIT_TEST_SPLIT_INDEX")) {2344int v = si->base_sha1[0];2345if((v &15) <6)2346 istate->cache_changed |= SPLIT_INDEX_ORDERED;2347}2348if(too_many_not_shared_entries(istate))2349 istate->cache_changed |= SPLIT_INDEX_ORDERED;23502351 new_shared_index = istate->cache_changed & SPLIT_INDEX_ORDERED;23522353if(new_shared_index) {2354 ret =write_shared_index(istate, lock, flags);2355if(ret)2356return ret;2357}23582359 ret =write_split_index(istate, lock, flags);23602361/* Freshen the shared index only if the split-index was written */2362if(!ret && !new_shared_index)2363freshen_shared_index(sha1_to_hex(si->base_sha1),1);23642365return ret;2366}23672368/*2369 * Read the index file that is potentially unmerged into given2370 * index_state, dropping any unmerged entries. Returns true if2371 * the index is unmerged. Callers who want to refuse to work2372 * from an unmerged state can call this and check its return value,2373 * instead of calling read_cache().2374 */2375intread_index_unmerged(struct index_state *istate)2376{2377int i;2378int unmerged =0;23792380read_index(istate);2381for(i =0; i < istate->cache_nr; i++) {2382struct cache_entry *ce = istate->cache[i];2383struct cache_entry *new_ce;2384int size, len;23852386if(!ce_stage(ce))2387continue;2388 unmerged =1;2389 len =ce_namelen(ce);2390 size =cache_entry_size(len);2391 new_ce =xcalloc(1, size);2392memcpy(new_ce->name, ce->name, len);2393 new_ce->ce_flags =create_ce_flags(0) | CE_CONFLICTED;2394 new_ce->ce_namelen = len;2395 new_ce->ce_mode = ce->ce_mode;2396if(add_index_entry(istate, new_ce,0))2397returnerror("%s: cannot drop to stage #0",2398 new_ce->name);2399}2400return unmerged;2401}24022403/*2404 * Returns 1 if the path is an "other" path with respect to2405 * the index; that is, the path is not mentioned in the index at all,2406 * either as a file, a directory with some files in the index,2407 * or as an unmerged entry.2408 *2409 * We helpfully remove a trailing "/" from directories so that2410 * the output of read_directory can be used as-is.2411 */2412intindex_name_is_other(const struct index_state *istate,const char*name,2413int namelen)2414{2415int pos;2416if(namelen && name[namelen -1] =='/')2417 namelen--;2418 pos =index_name_pos(istate, name, namelen);2419if(0<= pos)2420return0;/* exact match */2421 pos = -pos -1;2422if(pos < istate->cache_nr) {2423struct cache_entry *ce = istate->cache[pos];2424if(ce_namelen(ce) == namelen &&2425!memcmp(ce->name, name, namelen))2426return0;/* Yup, this one exists unmerged */2427}2428return1;2429}24302431void*read_blob_data_from_index(const struct index_state *istate,2432const char*path,unsigned long*size)2433{2434int pos, len;2435unsigned long sz;2436enum object_type type;2437void*data;24382439 len =strlen(path);2440 pos =index_name_pos(istate, path, len);2441if(pos <0) {2442/*2443 * We might be in the middle of a merge, in which2444 * case we would read stage #2 (ours).2445 */2446int i;2447for(i = -pos -1;2448(pos <0&& i < istate->cache_nr &&2449!strcmp(istate->cache[i]->name, path));2450 i++)2451if(ce_stage(istate->cache[i]) ==2)2452 pos = i;2453}2454if(pos <0)2455return NULL;2456 data =read_sha1_file(istate->cache[pos]->oid.hash, &type, &sz);2457if(!data || type != OBJ_BLOB) {2458free(data);2459return NULL;2460}2461if(size)2462*size = sz;2463return data;2464}24652466voidstat_validity_clear(struct stat_validity *sv)2467{2468free(sv->sd);2469 sv->sd = NULL;2470}24712472intstat_validity_check(struct stat_validity *sv,const char*path)2473{2474struct stat st;24752476if(stat(path, &st) <0)2477return sv->sd == NULL;2478if(!sv->sd)2479return0;2480returnS_ISREG(st.st_mode) && !match_stat_data(sv->sd, &st);2481}24822483voidstat_validity_update(struct stat_validity *sv,int fd)2484{2485struct stat st;24862487if(fstat(fd, &st) <0|| !S_ISREG(st.st_mode))2488stat_validity_clear(sv);2489else{2490if(!sv->sd)2491 sv->sd =xcalloc(1,sizeof(struct stat_data));2492fill_stat_data(sv->sd, &st);2493}2494}