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"lockfile.h" 9#include"cache-tree.h" 10#include"refs.h" 11#include"dir.h" 12#include"tree.h" 13#include"commit.h" 14#include"blob.h" 15#include"resolve-undo.h" 16#include"strbuf.h" 17#include"varint.h" 18#include"split-index.h" 19#include"sigchain.h" 20#include"utf8.h" 21 22static struct cache_entry *refresh_cache_entry(struct cache_entry *ce, 23unsigned int options); 24 25/* Mask for the name length in ce_flags in the on-disk index */ 26 27#define CE_NAMEMASK (0x0fff) 28 29/* Index extensions. 30 * 31 * The first letter should be 'A'..'Z' for extensions that are not 32 * necessary for a correct operation (i.e. optimization data). 33 * When new extensions are added that _needs_ to be understood in 34 * order to correctly interpret the index file, pick character that 35 * is outside the range, to cause the reader to abort. 36 */ 37 38#define CACHE_EXT(s) ( (s[0]<<24)|(s[1]<<16)|(s[2]<<8)|(s[3]) ) 39#define CACHE_EXT_TREE 0x54524545/* "TREE" */ 40#define CACHE_EXT_RESOLVE_UNDO 0x52455543/* "REUC" */ 41#define CACHE_EXT_LINK 0x6c696e6b/* "link" */ 42 43/* changes that can be kept in $GIT_DIR/index (basically all extensions) */ 44#define EXTMASK (RESOLVE_UNDO_CHANGED | CACHE_TREE_CHANGED | \ 45 CE_ENTRY_ADDED | CE_ENTRY_REMOVED | CE_ENTRY_CHANGED | \ 46 SPLIT_INDEX_ORDERED) 47 48struct index_state the_index; 49static const char*alternate_index_output; 50 51static voidset_index_entry(struct index_state *istate,int nr,struct cache_entry *ce) 52{ 53 istate->cache[nr] = ce; 54add_name_hash(istate, ce); 55} 56 57static voidreplace_index_entry(struct index_state *istate,int nr,struct cache_entry *ce) 58{ 59struct cache_entry *old = istate->cache[nr]; 60 61replace_index_entry_in_base(istate, old, ce); 62remove_name_hash(istate, old); 63free(old); 64set_index_entry(istate, nr, ce); 65 ce->ce_flags |= CE_UPDATE_IN_BASE; 66 istate->cache_changed |= CE_ENTRY_CHANGED; 67} 68 69voidrename_index_entry_at(struct index_state *istate,int nr,const char*new_name) 70{ 71struct cache_entry *old = istate->cache[nr], *new; 72int namelen =strlen(new_name); 73 74new=xmalloc(cache_entry_size(namelen)); 75copy_cache_entry(new, old); 76new->ce_flags &= ~CE_HASHED; 77new->ce_namelen = namelen; 78new->index =0; 79memcpy(new->name, new_name, namelen +1); 80 81cache_tree_invalidate_path(istate, old->name); 82remove_index_entry_at(istate, nr); 83add_index_entry(istate,new, ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE); 84} 85 86voidfill_stat_data(struct stat_data *sd,struct stat *st) 87{ 88 sd->sd_ctime.sec = (unsigned int)st->st_ctime; 89 sd->sd_mtime.sec = (unsigned int)st->st_mtime; 90 sd->sd_ctime.nsec =ST_CTIME_NSEC(*st); 91 sd->sd_mtime.nsec =ST_MTIME_NSEC(*st); 92 sd->sd_dev = st->st_dev; 93 sd->sd_ino = st->st_ino; 94 sd->sd_uid = st->st_uid; 95 sd->sd_gid = st->st_gid; 96 sd->sd_size = st->st_size; 97} 98 99intmatch_stat_data(const struct stat_data *sd,struct stat *st) 100{ 101int changed =0; 102 103if(sd->sd_mtime.sec != (unsigned int)st->st_mtime) 104 changed |= MTIME_CHANGED; 105if(trust_ctime && check_stat && 106 sd->sd_ctime.sec != (unsigned int)st->st_ctime) 107 changed |= CTIME_CHANGED; 108 109#ifdef USE_NSEC 110if(check_stat && sd->sd_mtime.nsec !=ST_MTIME_NSEC(*st)) 111 changed |= MTIME_CHANGED; 112if(trust_ctime && check_stat && 113 sd->sd_ctime.nsec !=ST_CTIME_NSEC(*st)) 114 changed |= CTIME_CHANGED; 115#endif 116 117if(check_stat) { 118if(sd->sd_uid != (unsigned int) st->st_uid || 119 sd->sd_gid != (unsigned int) st->st_gid) 120 changed |= OWNER_CHANGED; 121if(sd->sd_ino != (unsigned int) st->st_ino) 122 changed |= INODE_CHANGED; 123} 124 125#ifdef USE_STDEV 126/* 127 * st_dev breaks on network filesystems where different 128 * clients will have different views of what "device" 129 * the filesystem is on 130 */ 131if(check_stat && sd->sd_dev != (unsigned int) st->st_dev) 132 changed |= INODE_CHANGED; 133#endif 134 135if(sd->sd_size != (unsigned int) st->st_size) 136 changed |= DATA_CHANGED; 137 138return changed; 139} 140 141/* 142 * This only updates the "non-critical" parts of the directory 143 * cache, ie the parts that aren't tracked by GIT, and only used 144 * to validate the cache. 145 */ 146voidfill_stat_cache_info(struct cache_entry *ce,struct stat *st) 147{ 148fill_stat_data(&ce->ce_stat_data, st); 149 150if(assume_unchanged) 151 ce->ce_flags |= CE_VALID; 152 153if(S_ISREG(st->st_mode)) 154ce_mark_uptodate(ce); 155} 156 157static intce_compare_data(const struct cache_entry *ce,struct stat *st) 158{ 159int match = -1; 160int fd =open(ce->name, O_RDONLY); 161 162if(fd >=0) { 163unsigned char sha1[20]; 164if(!index_fd(sha1, fd, st, OBJ_BLOB, ce->name,0)) 165 match =hashcmp(sha1, ce->sha1); 166/* index_fd() closed the file descriptor already */ 167} 168return match; 169} 170 171static intce_compare_link(const struct cache_entry *ce,size_t expected_size) 172{ 173int match = -1; 174void*buffer; 175unsigned long size; 176enum object_type type; 177struct strbuf sb = STRBUF_INIT; 178 179if(strbuf_readlink(&sb, ce->name, expected_size)) 180return-1; 181 182 buffer =read_sha1_file(ce->sha1, &type, &size); 183if(buffer) { 184if(size == sb.len) 185 match =memcmp(buffer, sb.buf, size); 186free(buffer); 187} 188strbuf_release(&sb); 189return match; 190} 191 192static intce_compare_gitlink(const struct cache_entry *ce) 193{ 194unsigned char sha1[20]; 195 196/* 197 * We don't actually require that the .git directory 198 * under GITLINK directory be a valid git directory. It 199 * might even be missing (in case nobody populated that 200 * sub-project). 201 * 202 * If so, we consider it always to match. 203 */ 204if(resolve_gitlink_ref(ce->name,"HEAD", sha1) <0) 205return0; 206returnhashcmp(sha1, ce->sha1); 207} 208 209static intce_modified_check_fs(const struct cache_entry *ce,struct stat *st) 210{ 211switch(st->st_mode & S_IFMT) { 212case S_IFREG: 213if(ce_compare_data(ce, st)) 214return DATA_CHANGED; 215break; 216case S_IFLNK: 217if(ce_compare_link(ce,xsize_t(st->st_size))) 218return DATA_CHANGED; 219break; 220case S_IFDIR: 221if(S_ISGITLINK(ce->ce_mode)) 222returnce_compare_gitlink(ce) ? DATA_CHANGED :0; 223default: 224return TYPE_CHANGED; 225} 226return0; 227} 228 229static intce_match_stat_basic(const struct cache_entry *ce,struct stat *st) 230{ 231unsigned int changed =0; 232 233if(ce->ce_flags & CE_REMOVE) 234return MODE_CHANGED | DATA_CHANGED | TYPE_CHANGED; 235 236switch(ce->ce_mode & S_IFMT) { 237case S_IFREG: 238 changed |= !S_ISREG(st->st_mode) ? TYPE_CHANGED :0; 239/* We consider only the owner x bit to be relevant for 240 * "mode changes" 241 */ 242if(trust_executable_bit && 243(0100& (ce->ce_mode ^ st->st_mode))) 244 changed |= MODE_CHANGED; 245break; 246case S_IFLNK: 247if(!S_ISLNK(st->st_mode) && 248(has_symlinks || !S_ISREG(st->st_mode))) 249 changed |= TYPE_CHANGED; 250break; 251case S_IFGITLINK: 252/* We ignore most of the st_xxx fields for gitlinks */ 253if(!S_ISDIR(st->st_mode)) 254 changed |= TYPE_CHANGED; 255else if(ce_compare_gitlink(ce)) 256 changed |= DATA_CHANGED; 257return changed; 258default: 259die("internal error: ce_mode is%o", ce->ce_mode); 260} 261 262 changed |=match_stat_data(&ce->ce_stat_data, st); 263 264/* Racily smudged entry? */ 265if(!ce->ce_stat_data.sd_size) { 266if(!is_empty_blob_sha1(ce->sha1)) 267 changed |= DATA_CHANGED; 268} 269 270return changed; 271} 272 273static intis_racy_timestamp(const struct index_state *istate, 274const struct cache_entry *ce) 275{ 276return(!S_ISGITLINK(ce->ce_mode) && 277 istate->timestamp.sec && 278#ifdef USE_NSEC 279/* nanosecond timestamped files can also be racy! */ 280(istate->timestamp.sec < ce->ce_stat_data.sd_mtime.sec || 281(istate->timestamp.sec == ce->ce_stat_data.sd_mtime.sec && 282 istate->timestamp.nsec <= ce->ce_stat_data.sd_mtime.nsec)) 283#else 284 istate->timestamp.sec <= ce->ce_stat_data.sd_mtime.sec 285#endif 286); 287} 288 289intie_match_stat(const struct index_state *istate, 290const struct cache_entry *ce,struct stat *st, 291unsigned int options) 292{ 293unsigned int changed; 294int ignore_valid = options & CE_MATCH_IGNORE_VALID; 295int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE; 296int assume_racy_is_modified = options & CE_MATCH_RACY_IS_DIRTY; 297 298/* 299 * If it's marked as always valid in the index, it's 300 * valid whatever the checked-out copy says. 301 * 302 * skip-worktree has the same effect with higher precedence 303 */ 304if(!ignore_skip_worktree &&ce_skip_worktree(ce)) 305return0; 306if(!ignore_valid && (ce->ce_flags & CE_VALID)) 307return0; 308 309/* 310 * Intent-to-add entries have not been added, so the index entry 311 * by definition never matches what is in the work tree until it 312 * actually gets added. 313 */ 314if(ce->ce_flags & CE_INTENT_TO_ADD) 315return DATA_CHANGED | TYPE_CHANGED | MODE_CHANGED; 316 317 changed =ce_match_stat_basic(ce, st); 318 319/* 320 * Within 1 second of this sequence: 321 * echo xyzzy >file && git-update-index --add file 322 * running this command: 323 * echo frotz >file 324 * would give a falsely clean cache entry. The mtime and 325 * length match the cache, and other stat fields do not change. 326 * 327 * We could detect this at update-index time (the cache entry 328 * being registered/updated records the same time as "now") 329 * and delay the return from git-update-index, but that would 330 * effectively mean we can make at most one commit per second, 331 * which is not acceptable. Instead, we check cache entries 332 * whose mtime are the same as the index file timestamp more 333 * carefully than others. 334 */ 335if(!changed &&is_racy_timestamp(istate, ce)) { 336if(assume_racy_is_modified) 337 changed |= DATA_CHANGED; 338else 339 changed |=ce_modified_check_fs(ce, st); 340} 341 342return changed; 343} 344 345intie_modified(const struct index_state *istate, 346const struct cache_entry *ce, 347struct stat *st,unsigned int options) 348{ 349int changed, changed_fs; 350 351 changed =ie_match_stat(istate, ce, st, options); 352if(!changed) 353return0; 354/* 355 * If the mode or type has changed, there's no point in trying 356 * to refresh the entry - it's not going to match 357 */ 358if(changed & (MODE_CHANGED | TYPE_CHANGED)) 359return changed; 360 361/* 362 * Immediately after read-tree or update-index --cacheinfo, 363 * the length field is zero, as we have never even read the 364 * lstat(2) information once, and we cannot trust DATA_CHANGED 365 * returned by ie_match_stat() which in turn was returned by 366 * ce_match_stat_basic() to signal that the filesize of the 367 * blob changed. We have to actually go to the filesystem to 368 * see if the contents match, and if so, should answer "unchanged". 369 * 370 * The logic does not apply to gitlinks, as ce_match_stat_basic() 371 * already has checked the actual HEAD from the filesystem in the 372 * subproject. If ie_match_stat() already said it is different, 373 * then we know it is. 374 */ 375if((changed & DATA_CHANGED) && 376(S_ISGITLINK(ce->ce_mode) || ce->ce_stat_data.sd_size !=0)) 377return changed; 378 379 changed_fs =ce_modified_check_fs(ce, st); 380if(changed_fs) 381return changed | changed_fs; 382return0; 383} 384 385intbase_name_compare(const char*name1,int len1,int mode1, 386const char*name2,int len2,int mode2) 387{ 388unsigned char c1, c2; 389int len = len1 < len2 ? len1 : len2; 390int cmp; 391 392 cmp =memcmp(name1, name2, len); 393if(cmp) 394return cmp; 395 c1 = name1[len]; 396 c2 = name2[len]; 397if(!c1 &&S_ISDIR(mode1)) 398 c1 ='/'; 399if(!c2 &&S_ISDIR(mode2)) 400 c2 ='/'; 401return(c1 < c2) ? -1: (c1 > c2) ?1:0; 402} 403 404/* 405 * df_name_compare() is identical to base_name_compare(), except it 406 * compares conflicting directory/file entries as equal. Note that 407 * while a directory name compares as equal to a regular file, they 408 * then individually compare _differently_ to a filename that has 409 * a dot after the basename (because '\0' < '.' < '/'). 410 * 411 * This is used by routines that want to traverse the git namespace 412 * but then handle conflicting entries together when possible. 413 */ 414intdf_name_compare(const char*name1,int len1,int mode1, 415const char*name2,int len2,int mode2) 416{ 417int len = len1 < len2 ? len1 : len2, cmp; 418unsigned char c1, c2; 419 420 cmp =memcmp(name1, name2, len); 421if(cmp) 422return cmp; 423/* Directories and files compare equal (same length, same name) */ 424if(len1 == len2) 425return0; 426 c1 = name1[len]; 427if(!c1 &&S_ISDIR(mode1)) 428 c1 ='/'; 429 c2 = name2[len]; 430if(!c2 &&S_ISDIR(mode2)) 431 c2 ='/'; 432if(c1 =='/'&& !c2) 433return0; 434if(c2 =='/'&& !c1) 435return0; 436return c1 - c2; 437} 438 439intname_compare(const char*name1,size_t len1,const char*name2,size_t len2) 440{ 441size_t min_len = (len1 < len2) ? len1 : len2; 442int cmp =memcmp(name1, name2, min_len); 443if(cmp) 444return cmp; 445if(len1 < len2) 446return-1; 447if(len1 > len2) 448return1; 449return0; 450} 451 452intcache_name_stage_compare(const char*name1,int len1,int stage1,const char*name2,int len2,int stage2) 453{ 454int cmp; 455 456 cmp =name_compare(name1, len1, name2, len2); 457if(cmp) 458return cmp; 459 460if(stage1 < stage2) 461return-1; 462if(stage1 > stage2) 463return1; 464return0; 465} 466 467static intindex_name_stage_pos(const struct index_state *istate,const char*name,int namelen,int stage) 468{ 469int first, last; 470 471 first =0; 472 last = istate->cache_nr; 473while(last > first) { 474int next = (last + first) >>1; 475struct cache_entry *ce = istate->cache[next]; 476int cmp =cache_name_stage_compare(name, namelen, stage, ce->name,ce_namelen(ce),ce_stage(ce)); 477if(!cmp) 478return next; 479if(cmp <0) { 480 last = next; 481continue; 482} 483 first = next+1; 484} 485return-first-1; 486} 487 488intindex_name_pos(const struct index_state *istate,const char*name,int namelen) 489{ 490returnindex_name_stage_pos(istate, name, namelen,0); 491} 492 493/* Remove entry, return true if there are more entries to go.. */ 494intremove_index_entry_at(struct index_state *istate,int pos) 495{ 496struct cache_entry *ce = istate->cache[pos]; 497 498record_resolve_undo(istate, ce); 499remove_name_hash(istate, ce); 500save_or_free_index_entry(istate, ce); 501 istate->cache_changed |= CE_ENTRY_REMOVED; 502 istate->cache_nr--; 503if(pos >= istate->cache_nr) 504return0; 505memmove(istate->cache + pos, 506 istate->cache + pos +1, 507(istate->cache_nr - pos) *sizeof(struct cache_entry *)); 508return1; 509} 510 511/* 512 * Remove all cache entries marked for removal, that is where 513 * CE_REMOVE is set in ce_flags. This is much more effective than 514 * calling remove_index_entry_at() for each entry to be removed. 515 */ 516voidremove_marked_cache_entries(struct index_state *istate) 517{ 518struct cache_entry **ce_array = istate->cache; 519unsigned int i, j; 520 521for(i = j =0; i < istate->cache_nr; i++) { 522if(ce_array[i]->ce_flags & CE_REMOVE) { 523remove_name_hash(istate, ce_array[i]); 524save_or_free_index_entry(istate, ce_array[i]); 525} 526else 527 ce_array[j++] = ce_array[i]; 528} 529if(j == istate->cache_nr) 530return; 531 istate->cache_changed |= CE_ENTRY_REMOVED; 532 istate->cache_nr = j; 533} 534 535intremove_file_from_index(struct index_state *istate,const char*path) 536{ 537int pos =index_name_pos(istate, path,strlen(path)); 538if(pos <0) 539 pos = -pos-1; 540cache_tree_invalidate_path(istate, path); 541while(pos < istate->cache_nr && !strcmp(istate->cache[pos]->name, path)) 542remove_index_entry_at(istate, pos); 543return0; 544} 545 546static intcompare_name(struct cache_entry *ce,const char*path,int namelen) 547{ 548return namelen !=ce_namelen(ce) ||memcmp(path, ce->name, namelen); 549} 550 551static intindex_name_pos_also_unmerged(struct index_state *istate, 552const char*path,int namelen) 553{ 554int pos =index_name_pos(istate, path, namelen); 555struct cache_entry *ce; 556 557if(pos >=0) 558return pos; 559 560/* maybe unmerged? */ 561 pos = -1- pos; 562if(pos >= istate->cache_nr || 563compare_name((ce = istate->cache[pos]), path, namelen)) 564return-1; 565 566/* order of preference: stage 2, 1, 3 */ 567if(ce_stage(ce) ==1&& pos +1< istate->cache_nr && 568ce_stage((ce = istate->cache[pos +1])) ==2&& 569!compare_name(ce, path, namelen)) 570 pos++; 571return pos; 572} 573 574static intdifferent_name(struct cache_entry *ce,struct cache_entry *alias) 575{ 576int len =ce_namelen(ce); 577returnce_namelen(alias) != len ||memcmp(ce->name, alias->name, len); 578} 579 580/* 581 * If we add a filename that aliases in the cache, we will use the 582 * name that we already have - but we don't want to update the same 583 * alias twice, because that implies that there were actually two 584 * different files with aliasing names! 585 * 586 * So we use the CE_ADDED flag to verify that the alias was an old 587 * one before we accept it as 588 */ 589static struct cache_entry *create_alias_ce(struct index_state *istate, 590struct cache_entry *ce, 591struct cache_entry *alias) 592{ 593int len; 594struct cache_entry *new; 595 596if(alias->ce_flags & CE_ADDED) 597die("Will not add file alias '%s' ('%s' already exists in index)", ce->name, alias->name); 598 599/* Ok, create the new entry using the name of the existing alias */ 600 len =ce_namelen(alias); 601new=xcalloc(1,cache_entry_size(len)); 602memcpy(new->name, alias->name, len); 603copy_cache_entry(new, ce); 604save_or_free_index_entry(istate, ce); 605return new; 606} 607 608voidset_object_name_for_intent_to_add_entry(struct cache_entry *ce) 609{ 610unsigned char sha1[20]; 611if(write_sha1_file("",0, blob_type, sha1)) 612die("cannot create an empty blob in the object database"); 613hashcpy(ce->sha1, sha1); 614} 615 616intadd_to_index(struct index_state *istate,const char*path,struct stat *st,int flags) 617{ 618int size, namelen, was_same; 619 mode_t st_mode = st->st_mode; 620struct cache_entry *ce, *alias; 621unsigned ce_option = CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE|CE_MATCH_RACY_IS_DIRTY; 622int verbose = flags & (ADD_CACHE_VERBOSE | ADD_CACHE_PRETEND); 623int pretend = flags & ADD_CACHE_PRETEND; 624int intent_only = flags & ADD_CACHE_INTENT; 625int add_option = (ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE| 626(intent_only ? ADD_CACHE_NEW_ONLY :0)); 627 628if(!S_ISREG(st_mode) && !S_ISLNK(st_mode) && !S_ISDIR(st_mode)) 629returnerror("%s: can only add regular files, symbolic links or git-directories", path); 630 631 namelen =strlen(path); 632if(S_ISDIR(st_mode)) { 633while(namelen && path[namelen-1] =='/') 634 namelen--; 635} 636 size =cache_entry_size(namelen); 637 ce =xcalloc(1, size); 638memcpy(ce->name, path, namelen); 639 ce->ce_namelen = namelen; 640if(!intent_only) 641fill_stat_cache_info(ce, st); 642else 643 ce->ce_flags |= CE_INTENT_TO_ADD; 644 645if(trust_executable_bit && has_symlinks) 646 ce->ce_mode =create_ce_mode(st_mode); 647else{ 648/* If there is an existing entry, pick the mode bits and type 649 * from it, otherwise assume unexecutable regular file. 650 */ 651struct cache_entry *ent; 652int pos =index_name_pos_also_unmerged(istate, path, namelen); 653 654 ent = (0<= pos) ? istate->cache[pos] : NULL; 655 ce->ce_mode =ce_mode_from_stat(ent, st_mode); 656} 657 658/* When core.ignorecase=true, determine if a directory of the same name but differing 659 * case already exists within the Git repository. If it does, ensure the directory 660 * case of the file being added to the repository matches (is folded into) the existing 661 * entry's directory case. 662 */ 663if(ignore_case) { 664const char*startPtr = ce->name; 665const char*ptr = startPtr; 666while(*ptr) { 667while(*ptr && *ptr !='/') 668++ptr; 669if(*ptr =='/') { 670struct cache_entry *foundce; 671++ptr; 672 foundce =index_dir_exists(istate, ce->name, ptr - ce->name -1); 673if(foundce) { 674memcpy((void*)startPtr, foundce->name + (startPtr - ce->name), ptr - startPtr); 675 startPtr = ptr; 676} 677} 678} 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->sha1, 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!hashcmp(alias->sha1, ce->sha1) && 707 ce->ce_mode == alias->ce_mode); 708 709if(pretend) 710; 711else if(add_index_entry(istate, ce, add_option)) 712returnerror("unable to add%sto index",path); 713if(verbose && !was_same) 714printf("add '%s'\n", path); 715return0; 716} 717 718intadd_file_to_index(struct index_state *istate,const char*path,int flags) 719{ 720struct stat st; 721if(lstat(path, &st)) 722die_errno("unable to stat '%s'", path); 723returnadd_to_index(istate, path, &st, flags); 724} 725 726struct cache_entry *make_cache_entry(unsigned int mode, 727const unsigned char*sha1,const char*path,int stage, 728unsigned int refresh_options) 729{ 730int size, len; 731struct cache_entry *ce, *ret; 732 733if(!verify_path(path)) { 734error("Invalid path '%s'", path); 735return NULL; 736} 737 738 len =strlen(path); 739 size =cache_entry_size(len); 740 ce =xcalloc(1, size); 741 742hashcpy(ce->sha1, sha1); 743memcpy(ce->name, path, len); 744 ce->ce_flags =create_ce_flags(stage); 745 ce->ce_namelen = len; 746 ce->ce_mode =create_ce_mode(mode); 747 748 ret =refresh_cache_entry(ce, refresh_options); 749if(!ret) { 750free(ce); 751return NULL; 752}else{ 753return ret; 754} 755} 756 757intce_same_name(const struct cache_entry *a,const struct cache_entry *b) 758{ 759int len =ce_namelen(a); 760returnce_namelen(b) == len && !memcmp(a->name, b->name, len); 761} 762 763/* 764 * We fundamentally don't like some paths: we don't want 765 * dot or dot-dot anywhere, and for obvious reasons don't 766 * want to recurse into ".git" either. 767 * 768 * Also, we don't want double slashes or slashes at the 769 * end that can make pathnames ambiguous. 770 */ 771static intverify_dotfile(const char*rest) 772{ 773/* 774 * The first character was '.', but that 775 * has already been discarded, we now test 776 * the rest. 777 */ 778 779/* "." is not allowed */ 780if(*rest =='\0'||is_dir_sep(*rest)) 781return0; 782 783switch(*rest) { 784/* 785 * ".git" followed by NUL or slash is bad. This 786 * shares the path end test with the ".." case. 787 */ 788case'g': 789case'G': 790if(rest[1] !='i'&& rest[1] !='I') 791break; 792if(rest[2] !='t'&& rest[2] !='T') 793break; 794 rest +=2; 795/* fallthrough */ 796case'.': 797if(rest[1] =='\0'||is_dir_sep(rest[1])) 798return0; 799} 800return1; 801} 802 803intverify_path(const char*path) 804{ 805char c; 806 807if(has_dos_drive_prefix(path)) 808return0; 809 810goto inside; 811for(;;) { 812if(!c) 813return1; 814if(is_dir_sep(c)) { 815inside: 816if(protect_hfs &&is_hfs_dotgit(path)) 817return0; 818if(protect_ntfs &&is_ntfs_dotgit(path)) 819return0; 820 c = *path++; 821if((c =='.'&& !verify_dotfile(path)) || 822is_dir_sep(c) || c =='\0') 823return0; 824} 825 c = *path++; 826} 827} 828 829/* 830 * Do we have another file that has the beginning components being a 831 * proper superset of the name we're trying to add? 832 */ 833static inthas_file_name(struct index_state *istate, 834const struct cache_entry *ce,int pos,int ok_to_replace) 835{ 836int retval =0; 837int len =ce_namelen(ce); 838int stage =ce_stage(ce); 839const char*name = ce->name; 840 841while(pos < istate->cache_nr) { 842struct cache_entry *p = istate->cache[pos++]; 843 844if(len >=ce_namelen(p)) 845break; 846if(memcmp(name, p->name, len)) 847break; 848if(ce_stage(p) != stage) 849continue; 850if(p->name[len] !='/') 851continue; 852if(p->ce_flags & CE_REMOVE) 853continue; 854 retval = -1; 855if(!ok_to_replace) 856break; 857remove_index_entry_at(istate, --pos); 858} 859return retval; 860} 861 862/* 863 * Do we have another file with a pathname that is a proper 864 * subset of the name we're trying to add? 865 */ 866static inthas_dir_name(struct index_state *istate, 867const struct cache_entry *ce,int pos,int ok_to_replace) 868{ 869int retval =0; 870int stage =ce_stage(ce); 871const char*name = ce->name; 872const char*slash = name +ce_namelen(ce); 873 874for(;;) { 875int len; 876 877for(;;) { 878if(*--slash =='/') 879break; 880if(slash <= ce->name) 881return retval; 882} 883 len = slash - name; 884 885 pos =index_name_stage_pos(istate, name, len, stage); 886if(pos >=0) { 887/* 888 * Found one, but not so fast. This could 889 * be a marker that says "I was here, but 890 * I am being removed". Such an entry is 891 * not a part of the resulting tree, and 892 * it is Ok to have a directory at the same 893 * path. 894 */ 895if(!(istate->cache[pos]->ce_flags & CE_REMOVE)) { 896 retval = -1; 897if(!ok_to_replace) 898break; 899remove_index_entry_at(istate, pos); 900continue; 901} 902} 903else 904 pos = -pos-1; 905 906/* 907 * Trivial optimization: if we find an entry that 908 * already matches the sub-directory, then we know 909 * we're ok, and we can exit. 910 */ 911while(pos < istate->cache_nr) { 912struct cache_entry *p = istate->cache[pos]; 913if((ce_namelen(p) <= len) || 914(p->name[len] !='/') || 915memcmp(p->name, name, len)) 916break;/* not our subdirectory */ 917if(ce_stage(p) == stage && !(p->ce_flags & CE_REMOVE)) 918/* 919 * p is at the same stage as our entry, and 920 * is a subdirectory of what we are looking 921 * at, so we cannot have conflicts at our 922 * level or anything shorter. 923 */ 924return retval; 925 pos++; 926} 927} 928return retval; 929} 930 931/* We may be in a situation where we already have path/file and path 932 * is being added, or we already have path and path/file is being 933 * added. Either one would result in a nonsense tree that has path 934 * twice when git-write-tree tries to write it out. Prevent it. 935 * 936 * If ok-to-replace is specified, we remove the conflicting entries 937 * from the cache so the caller should recompute the insert position. 938 * When this happens, we return non-zero. 939 */ 940static intcheck_file_directory_conflict(struct index_state *istate, 941const struct cache_entry *ce, 942int pos,int ok_to_replace) 943{ 944int retval; 945 946/* 947 * When ce is an "I am going away" entry, we allow it to be added 948 */ 949if(ce->ce_flags & CE_REMOVE) 950return0; 951 952/* 953 * We check if the path is a sub-path of a subsequent pathname 954 * first, since removing those will not change the position 955 * in the array. 956 */ 957 retval =has_file_name(istate, ce, pos, ok_to_replace); 958 959/* 960 * Then check if the path might have a clashing sub-directory 961 * before it. 962 */ 963return retval +has_dir_name(istate, ce, pos, ok_to_replace); 964} 965 966static intadd_index_entry_with_check(struct index_state *istate,struct cache_entry *ce,int option) 967{ 968int pos; 969int ok_to_add = option & ADD_CACHE_OK_TO_ADD; 970int ok_to_replace = option & ADD_CACHE_OK_TO_REPLACE; 971int skip_df_check = option & ADD_CACHE_SKIP_DFCHECK; 972int new_only = option & ADD_CACHE_NEW_ONLY; 973 974if(!(option & ADD_CACHE_KEEP_CACHE_TREE)) 975cache_tree_invalidate_path(istate, ce->name); 976 pos =index_name_stage_pos(istate, ce->name,ce_namelen(ce),ce_stage(ce)); 977 978/* existing match? Just replace it. */ 979if(pos >=0) { 980if(!new_only) 981replace_index_entry(istate, pos, ce); 982return0; 983} 984 pos = -pos-1; 985 986/* 987 * Inserting a merged entry ("stage 0") into the index 988 * will always replace all non-merged entries.. 989 */ 990if(pos < istate->cache_nr &&ce_stage(ce) ==0) { 991while(ce_same_name(istate->cache[pos], ce)) { 992 ok_to_add =1; 993if(!remove_index_entry_at(istate, pos)) 994break; 995} 996} 997 998if(!ok_to_add) 999return-1;1000if(!verify_path(ce->name))1001returnerror("Invalid path '%s'", ce->name);10021003if(!skip_df_check &&1004check_file_directory_conflict(istate, ce, pos, ok_to_replace)) {1005if(!ok_to_replace)1006returnerror("'%s' appears as both a file and as a directory",1007 ce->name);1008 pos =index_name_stage_pos(istate, ce->name,ce_namelen(ce),ce_stage(ce));1009 pos = -pos-1;1010}1011return pos +1;1012}10131014intadd_index_entry(struct index_state *istate,struct cache_entry *ce,int option)1015{1016int pos;10171018if(option & ADD_CACHE_JUST_APPEND)1019 pos = istate->cache_nr;1020else{1021int ret;1022 ret =add_index_entry_with_check(istate, ce, option);1023if(ret <=0)1024return ret;1025 pos = ret -1;1026}10271028/* Make sure the array is big enough .. */1029ALLOC_GROW(istate->cache, istate->cache_nr +1, istate->cache_alloc);10301031/* Add it in.. */1032 istate->cache_nr++;1033if(istate->cache_nr > pos +1)1034memmove(istate->cache + pos +1,1035 istate->cache + pos,1036(istate->cache_nr - pos -1) *sizeof(ce));1037set_index_entry(istate, pos, ce);1038 istate->cache_changed |= CE_ENTRY_ADDED;1039return0;1040}10411042/*1043 * "refresh" does not calculate a new sha1 file or bring the1044 * cache up-to-date for mode/content changes. But what it1045 * _does_ do is to "re-match" the stat information of a file1046 * with the cache, so that you can refresh the cache for a1047 * file that hasn't been changed but where the stat entry is1048 * out of date.1049 *1050 * For example, you'd want to do this after doing a "git-read-tree",1051 * to link up the stat cache details with the proper files.1052 */1053static struct cache_entry *refresh_cache_ent(struct index_state *istate,1054struct cache_entry *ce,1055unsigned int options,int*err,1056int*changed_ret)1057{1058struct stat st;1059struct cache_entry *updated;1060int changed, size;1061int refresh = options & CE_MATCH_REFRESH;1062int ignore_valid = options & CE_MATCH_IGNORE_VALID;1063int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE;1064int ignore_missing = options & CE_MATCH_IGNORE_MISSING;10651066if(!refresh ||ce_uptodate(ce))1067return ce;10681069/*1070 * CE_VALID or CE_SKIP_WORKTREE means the user promised us1071 * that the change to the work tree does not matter and told1072 * us not to worry.1073 */1074if(!ignore_skip_worktree &&ce_skip_worktree(ce)) {1075ce_mark_uptodate(ce);1076return ce;1077}1078if(!ignore_valid && (ce->ce_flags & CE_VALID)) {1079ce_mark_uptodate(ce);1080return ce;1081}10821083if(has_symlink_leading_path(ce->name,ce_namelen(ce))) {1084if(ignore_missing)1085return ce;1086if(err)1087*err = ENOENT;1088return NULL;1089}10901091if(lstat(ce->name, &st) <0) {1092if(ignore_missing && errno == ENOENT)1093return ce;1094if(err)1095*err = errno;1096return NULL;1097}10981099 changed =ie_match_stat(istate, ce, &st, options);1100if(changed_ret)1101*changed_ret = changed;1102if(!changed) {1103/*1104 * The path is unchanged. If we were told to ignore1105 * valid bit, then we did the actual stat check and1106 * found that the entry is unmodified. If the entry1107 * is not marked VALID, this is the place to mark it1108 * valid again, under "assume unchanged" mode.1109 */1110if(ignore_valid && assume_unchanged &&1111!(ce->ce_flags & CE_VALID))1112;/* mark this one VALID again */1113else{1114/*1115 * We do not mark the index itself "modified"1116 * because CE_UPTODATE flag is in-core only;1117 * we are not going to write this change out.1118 */1119if(!S_ISGITLINK(ce->ce_mode))1120ce_mark_uptodate(ce);1121return ce;1122}1123}11241125if(ie_modified(istate, ce, &st, options)) {1126if(err)1127*err = EINVAL;1128return NULL;1129}11301131 size =ce_size(ce);1132 updated =xmalloc(size);1133memcpy(updated, ce, size);1134fill_stat_cache_info(updated, &st);1135/*1136 * If ignore_valid is not set, we should leave CE_VALID bit1137 * alone. Otherwise, paths marked with --no-assume-unchanged1138 * (i.e. things to be edited) will reacquire CE_VALID bit1139 * automatically, which is not really what we want.1140 */1141if(!ignore_valid && assume_unchanged &&1142!(ce->ce_flags & CE_VALID))1143 updated->ce_flags &= ~CE_VALID;11441145/* istate->cache_changed is updated in the caller */1146return updated;1147}11481149static voidshow_file(const char* fmt,const char* name,int in_porcelain,1150int* first,const char*header_msg)1151{1152if(in_porcelain && *first && header_msg) {1153printf("%s\n", header_msg);1154*first =0;1155}1156printf(fmt, name);1157}11581159intrefresh_index(struct index_state *istate,unsigned int flags,1160const struct pathspec *pathspec,1161char*seen,const char*header_msg)1162{1163int i;1164int has_errors =0;1165int really = (flags & REFRESH_REALLY) !=0;1166int allow_unmerged = (flags & REFRESH_UNMERGED) !=0;1167int quiet = (flags & REFRESH_QUIET) !=0;1168int not_new = (flags & REFRESH_IGNORE_MISSING) !=0;1169int ignore_submodules = (flags & REFRESH_IGNORE_SUBMODULES) !=0;1170int first =1;1171int in_porcelain = (flags & REFRESH_IN_PORCELAIN);1172unsigned int options = (CE_MATCH_REFRESH |1173(really ? CE_MATCH_IGNORE_VALID :0) |1174(not_new ? CE_MATCH_IGNORE_MISSING :0));1175const char*modified_fmt;1176const char*deleted_fmt;1177const char*typechange_fmt;1178const char*added_fmt;1179const char*unmerged_fmt;11801181 modified_fmt = (in_porcelain ?"M\t%s\n":"%s: needs update\n");1182 deleted_fmt = (in_porcelain ?"D\t%s\n":"%s: needs update\n");1183 typechange_fmt = (in_porcelain ?"T\t%s\n":"%sneeds update\n");1184 added_fmt = (in_porcelain ?"A\t%s\n":"%sneeds update\n");1185 unmerged_fmt = (in_porcelain ?"U\t%s\n":"%s: needs merge\n");1186for(i =0; i < istate->cache_nr; i++) {1187struct cache_entry *ce, *new;1188int cache_errno =0;1189int changed =0;1190int filtered =0;11911192 ce = istate->cache[i];1193if(ignore_submodules &&S_ISGITLINK(ce->ce_mode))1194continue;11951196if(pathspec && !ce_path_match(ce, pathspec, seen))1197 filtered =1;11981199if(ce_stage(ce)) {1200while((i < istate->cache_nr) &&1201!strcmp(istate->cache[i]->name, ce->name))1202 i++;1203 i--;1204if(allow_unmerged)1205continue;1206if(!filtered)1207show_file(unmerged_fmt, ce->name, in_porcelain,1208&first, header_msg);1209 has_errors =1;1210continue;1211}12121213if(filtered)1214continue;12151216new=refresh_cache_ent(istate, ce, options, &cache_errno, &changed);1217if(new== ce)1218continue;1219if(!new) {1220const char*fmt;12211222if(really && cache_errno == EINVAL) {1223/* If we are doing --really-refresh that1224 * means the index is not valid anymore.1225 */1226 ce->ce_flags &= ~CE_VALID;1227 ce->ce_flags |= CE_UPDATE_IN_BASE;1228 istate->cache_changed |= CE_ENTRY_CHANGED;1229}1230if(quiet)1231continue;12321233if(cache_errno == ENOENT)1234 fmt = deleted_fmt;1235else if(ce->ce_flags & CE_INTENT_TO_ADD)1236 fmt = added_fmt;/* must be before other checks */1237else if(changed & TYPE_CHANGED)1238 fmt = typechange_fmt;1239else1240 fmt = modified_fmt;1241show_file(fmt,1242 ce->name, in_porcelain, &first, header_msg);1243 has_errors =1;1244continue;1245}12461247replace_index_entry(istate, i,new);1248}1249return has_errors;1250}12511252static struct cache_entry *refresh_cache_entry(struct cache_entry *ce,1253unsigned int options)1254{1255returnrefresh_cache_ent(&the_index, ce, options, NULL, NULL);1256}125712581259/*****************************************************************1260 * Index File I/O1261 *****************************************************************/12621263#define INDEX_FORMAT_DEFAULT 312641265static unsigned intget_index_format_default(void)1266{1267char*envversion =getenv("GIT_INDEX_VERSION");1268char*endp;1269int value;1270unsigned int version = INDEX_FORMAT_DEFAULT;12711272if(!envversion) {1273if(!git_config_get_int("index.version", &value))1274 version = value;1275if(version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) {1276warning(_("index.version set, but the value is invalid.\n"1277"Using version%i"), INDEX_FORMAT_DEFAULT);1278return INDEX_FORMAT_DEFAULT;1279}1280return version;1281}12821283 version =strtoul(envversion, &endp,10);1284if(*endp ||1285 version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) {1286warning(_("GIT_INDEX_VERSION set, but the value is invalid.\n"1287"Using version%i"), INDEX_FORMAT_DEFAULT);1288 version = INDEX_FORMAT_DEFAULT;1289}1290return version;1291}12921293/*1294 * dev/ino/uid/gid/size are also just tracked to the low 32 bits1295 * Again - this is just a (very strong in practice) heuristic that1296 * the inode hasn't changed.1297 *1298 * We save the fields in big-endian order to allow using the1299 * index file over NFS transparently.1300 */1301struct ondisk_cache_entry {1302struct cache_time ctime;1303struct cache_time mtime;1304uint32_t dev;1305uint32_t ino;1306uint32_t mode;1307uint32_t uid;1308uint32_t gid;1309uint32_t size;1310unsigned char sha1[20];1311uint16_t flags;1312char name[FLEX_ARRAY];/* more */1313};13141315/*1316 * This struct is used when CE_EXTENDED bit is 11317 * The struct must match ondisk_cache_entry exactly from1318 * ctime till flags1319 */1320struct ondisk_cache_entry_extended {1321struct cache_time ctime;1322struct cache_time mtime;1323uint32_t dev;1324uint32_t ino;1325uint32_t mode;1326uint32_t uid;1327uint32_t gid;1328uint32_t size;1329unsigned char sha1[20];1330uint16_t flags;1331uint16_t flags2;1332char name[FLEX_ARRAY];/* more */1333};13341335/* These are only used for v3 or lower */1336#define align_flex_name(STRUCT,len) ((offsetof(struct STRUCT,name) + (len) + 8) & ~7)1337#define ondisk_cache_entry_size(len) align_flex_name(ondisk_cache_entry,len)1338#define ondisk_cache_entry_extended_size(len) align_flex_name(ondisk_cache_entry_extended,len)1339#define ondisk_ce_size(ce) (((ce)->ce_flags & CE_EXTENDED) ? \1340 ondisk_cache_entry_extended_size(ce_namelen(ce)) : \1341 ondisk_cache_entry_size(ce_namelen(ce)))13421343static intverify_hdr(struct cache_header *hdr,unsigned long size)1344{1345 git_SHA_CTX c;1346unsigned char sha1[20];1347int hdr_version;13481349if(hdr->hdr_signature !=htonl(CACHE_SIGNATURE))1350returnerror("bad signature");1351 hdr_version =ntohl(hdr->hdr_version);1352if(hdr_version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < hdr_version)1353returnerror("bad index version%d", hdr_version);1354git_SHA1_Init(&c);1355git_SHA1_Update(&c, hdr, size -20);1356git_SHA1_Final(sha1, &c);1357if(hashcmp(sha1, (unsigned char*)hdr + size -20))1358returnerror("bad index file sha1 signature");1359return0;1360}13611362static intread_index_extension(struct index_state *istate,1363const char*ext,void*data,unsigned long sz)1364{1365switch(CACHE_EXT(ext)) {1366case CACHE_EXT_TREE:1367 istate->cache_tree =cache_tree_read(data, sz);1368break;1369case CACHE_EXT_RESOLVE_UNDO:1370 istate->resolve_undo =resolve_undo_read(data, sz);1371break;1372case CACHE_EXT_LINK:1373if(read_link_extension(istate, data, sz))1374return-1;1375break;1376default:1377if(*ext <'A'||'Z'< *ext)1378returnerror("index uses %.4s extension, which we do not understand",1379 ext);1380fprintf(stderr,"ignoring %.4s extension\n", ext);1381break;1382}1383return0;1384}13851386inthold_locked_index(struct lock_file *lk,int die_on_error)1387{1388returnhold_lock_file_for_update(lk,get_index_file(),1389 die_on_error1390? LOCK_DIE_ON_ERROR1391:0);1392}13931394intread_index(struct index_state *istate)1395{1396returnread_index_from(istate,get_index_file());1397}13981399static struct cache_entry *cache_entry_from_ondisk(struct ondisk_cache_entry *ondisk,1400unsigned int flags,1401const char*name,1402size_t len)1403{1404struct cache_entry *ce =xmalloc(cache_entry_size(len));14051406 ce->ce_stat_data.sd_ctime.sec =get_be32(&ondisk->ctime.sec);1407 ce->ce_stat_data.sd_mtime.sec =get_be32(&ondisk->mtime.sec);1408 ce->ce_stat_data.sd_ctime.nsec =get_be32(&ondisk->ctime.nsec);1409 ce->ce_stat_data.sd_mtime.nsec =get_be32(&ondisk->mtime.nsec);1410 ce->ce_stat_data.sd_dev =get_be32(&ondisk->dev);1411 ce->ce_stat_data.sd_ino =get_be32(&ondisk->ino);1412 ce->ce_mode =get_be32(&ondisk->mode);1413 ce->ce_stat_data.sd_uid =get_be32(&ondisk->uid);1414 ce->ce_stat_data.sd_gid =get_be32(&ondisk->gid);1415 ce->ce_stat_data.sd_size =get_be32(&ondisk->size);1416 ce->ce_flags = flags & ~CE_NAMEMASK;1417 ce->ce_namelen = len;1418 ce->index =0;1419hashcpy(ce->sha1, ondisk->sha1);1420memcpy(ce->name, name, len);1421 ce->name[len] ='\0';1422return ce;1423}14241425/*1426 * Adjacent cache entries tend to share the leading paths, so it makes1427 * sense to only store the differences in later entries. In the v41428 * on-disk format of the index, each on-disk cache entry stores the1429 * number of bytes to be stripped from the end of the previous name,1430 * and the bytes to append to the result, to come up with its name.1431 */1432static unsigned longexpand_name_field(struct strbuf *name,const char*cp_)1433{1434const unsigned char*ep, *cp = (const unsigned char*)cp_;1435size_t len =decode_varint(&cp);14361437if(name->len < len)1438die("malformed name field in the index");1439strbuf_remove(name, name->len - len, len);1440for(ep = cp; *ep; ep++)1441;/* find the end */1442strbuf_add(name, cp, ep - cp);1443return(const char*)ep +1- cp_;1444}14451446static struct cache_entry *create_from_disk(struct ondisk_cache_entry *ondisk,1447unsigned long*ent_size,1448struct strbuf *previous_name)1449{1450struct cache_entry *ce;1451size_t len;1452const char*name;1453unsigned int flags;14541455/* On-disk flags are just 16 bits */1456 flags =get_be16(&ondisk->flags);1457 len = flags & CE_NAMEMASK;14581459if(flags & CE_EXTENDED) {1460struct ondisk_cache_entry_extended *ondisk2;1461int extended_flags;1462 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;1463 extended_flags =get_be16(&ondisk2->flags2) <<16;1464/* We do not yet understand any bit out of CE_EXTENDED_FLAGS */1465if(extended_flags & ~CE_EXTENDED_FLAGS)1466die("Unknown index entry format%08x", extended_flags);1467 flags |= extended_flags;1468 name = ondisk2->name;1469}1470else1471 name = ondisk->name;14721473if(!previous_name) {1474/* v3 and earlier */1475if(len == CE_NAMEMASK)1476 len =strlen(name);1477 ce =cache_entry_from_ondisk(ondisk, flags, name, len);14781479*ent_size =ondisk_ce_size(ce);1480}else{1481unsigned long consumed;1482 consumed =expand_name_field(previous_name, name);1483 ce =cache_entry_from_ondisk(ondisk, flags,1484 previous_name->buf,1485 previous_name->len);14861487*ent_size = (name - ((char*)ondisk)) + consumed;1488}1489return ce;1490}14911492static voidcheck_ce_order(struct cache_entry *ce,struct cache_entry *next_ce)1493{1494int name_compare =strcmp(ce->name, next_ce->name);1495if(0< name_compare)1496die("unordered stage entries in index");1497if(!name_compare) {1498if(!ce_stage(ce))1499die("multiple stage entries for merged file '%s'",1500 ce->name);1501if(ce_stage(ce) >ce_stage(next_ce))1502die("unordered stage entries for '%s'",1503 ce->name);1504}1505}15061507/* remember to discard_cache() before reading a different cache! */1508intdo_read_index(struct index_state *istate,const char*path,int must_exist)1509{1510int fd, i;1511struct stat st;1512unsigned long src_offset;1513struct cache_header *hdr;1514void*mmap;1515size_t mmap_size;1516struct strbuf previous_name_buf = STRBUF_INIT, *previous_name;15171518if(istate->initialized)1519return istate->cache_nr;15201521 istate->timestamp.sec =0;1522 istate->timestamp.nsec =0;1523 fd =open(path, O_RDONLY);1524if(fd <0) {1525if(!must_exist && errno == ENOENT)1526return0;1527die_errno("%s: index file open failed", path);1528}15291530if(fstat(fd, &st))1531die_errno("cannot stat the open index");15321533 mmap_size =xsize_t(st.st_size);1534if(mmap_size <sizeof(struct cache_header) +20)1535die("index file smaller than expected");15361537 mmap =xmmap(NULL, mmap_size, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd,0);1538if(mmap == MAP_FAILED)1539die_errno("unable to map index file");1540close(fd);15411542 hdr = mmap;1543if(verify_hdr(hdr, mmap_size) <0)1544goto unmap;15451546hashcpy(istate->sha1, (const unsigned char*)hdr + mmap_size -20);1547 istate->version =ntohl(hdr->hdr_version);1548 istate->cache_nr =ntohl(hdr->hdr_entries);1549 istate->cache_alloc =alloc_nr(istate->cache_nr);1550 istate->cache =xcalloc(istate->cache_alloc,sizeof(*istate->cache));1551 istate->initialized =1;15521553if(istate->version ==4)1554 previous_name = &previous_name_buf;1555else1556 previous_name = NULL;15571558 src_offset =sizeof(*hdr);1559for(i =0; i < istate->cache_nr; i++) {1560struct ondisk_cache_entry *disk_ce;1561struct cache_entry *ce;1562unsigned long consumed;15631564 disk_ce = (struct ondisk_cache_entry *)((char*)mmap + src_offset);1565 ce =create_from_disk(disk_ce, &consumed, previous_name);1566set_index_entry(istate, i, ce);15671568if(i >0)1569check_ce_order(istate->cache[i -1], ce);15701571 src_offset += consumed;1572}1573strbuf_release(&previous_name_buf);1574 istate->timestamp.sec = st.st_mtime;1575 istate->timestamp.nsec =ST_MTIME_NSEC(st);15761577while(src_offset <= mmap_size -20-8) {1578/* After an array of active_nr index entries,1579 * there can be arbitrary number of extended1580 * sections, each of which is prefixed with1581 * extension name (4-byte) and section length1582 * in 4-byte network byte order.1583 */1584uint32_t extsize;1585memcpy(&extsize, (char*)mmap + src_offset +4,4);1586 extsize =ntohl(extsize);1587if(read_index_extension(istate,1588(const char*) mmap + src_offset,1589(char*) mmap + src_offset +8,1590 extsize) <0)1591goto unmap;1592 src_offset +=8;1593 src_offset += extsize;1594}1595munmap(mmap, mmap_size);1596return istate->cache_nr;15971598unmap:1599munmap(mmap, mmap_size);1600die("index file corrupt");1601}16021603intread_index_from(struct index_state *istate,const char*path)1604{1605struct split_index *split_index;1606int ret;16071608/* istate->initialized covers both .git/index and .git/sharedindex.xxx */1609if(istate->initialized)1610return istate->cache_nr;16111612 ret =do_read_index(istate, path,0);1613 split_index = istate->split_index;1614if(!split_index)1615return ret;16161617if(is_null_sha1(split_index->base_sha1))1618return ret;16191620if(split_index->base)1621discard_index(split_index->base);1622else1623 split_index->base =xcalloc(1,sizeof(*split_index->base));1624 ret =do_read_index(split_index->base,1625git_path("sharedindex.%s",1626sha1_to_hex(split_index->base_sha1)),1);1627if(hashcmp(split_index->base_sha1, split_index->base->sha1))1628die("broken index, expect%sin%s, got%s",1629sha1_to_hex(split_index->base_sha1),1630git_path("sharedindex.%s",1631sha1_to_hex(split_index->base_sha1)),1632sha1_to_hex(split_index->base->sha1));1633merge_base_index(istate);1634return ret;1635}16361637intis_index_unborn(struct index_state *istate)1638{1639return(!istate->cache_nr && !istate->timestamp.sec);1640}16411642intdiscard_index(struct index_state *istate)1643{1644int i;16451646for(i =0; i < istate->cache_nr; i++) {1647if(istate->cache[i]->index &&1648 istate->split_index &&1649 istate->split_index->base &&1650 istate->cache[i]->index <= istate->split_index->base->cache_nr &&1651 istate->cache[i] == istate->split_index->base->cache[istate->cache[i]->index -1])1652continue;1653free(istate->cache[i]);1654}1655resolve_undo_clear_index(istate);1656 istate->cache_nr =0;1657 istate->cache_changed =0;1658 istate->timestamp.sec =0;1659 istate->timestamp.nsec =0;1660free_name_hash(istate);1661cache_tree_free(&(istate->cache_tree));1662 istate->initialized =0;1663free(istate->cache);1664 istate->cache = NULL;1665 istate->cache_alloc =0;1666discard_split_index(istate);1667return0;1668}16691670intunmerged_index(const struct index_state *istate)1671{1672int i;1673for(i =0; i < istate->cache_nr; i++) {1674if(ce_stage(istate->cache[i]))1675return1;1676}1677return0;1678}16791680#define WRITE_BUFFER_SIZE 81921681static unsigned char write_buffer[WRITE_BUFFER_SIZE];1682static unsigned long write_buffer_len;16831684static intce_write_flush(git_SHA_CTX *context,int fd)1685{1686unsigned int buffered = write_buffer_len;1687if(buffered) {1688git_SHA1_Update(context, write_buffer, buffered);1689if(write_in_full(fd, write_buffer, buffered) != buffered)1690return-1;1691 write_buffer_len =0;1692}1693return0;1694}16951696static intce_write(git_SHA_CTX *context,int fd,void*data,unsigned int len)1697{1698while(len) {1699unsigned int buffered = write_buffer_len;1700unsigned int partial = WRITE_BUFFER_SIZE - buffered;1701if(partial > len)1702 partial = len;1703memcpy(write_buffer + buffered, data, partial);1704 buffered += partial;1705if(buffered == WRITE_BUFFER_SIZE) {1706 write_buffer_len = buffered;1707if(ce_write_flush(context, fd))1708return-1;1709 buffered =0;1710}1711 write_buffer_len = buffered;1712 len -= partial;1713 data = (char*) data + partial;1714}1715return0;1716}17171718static intwrite_index_ext_header(git_SHA_CTX *context,int fd,1719unsigned int ext,unsigned int sz)1720{1721 ext =htonl(ext);1722 sz =htonl(sz);1723return((ce_write(context, fd, &ext,4) <0) ||1724(ce_write(context, fd, &sz,4) <0)) ? -1:0;1725}17261727static intce_flush(git_SHA_CTX *context,int fd,unsigned char*sha1)1728{1729unsigned int left = write_buffer_len;17301731if(left) {1732 write_buffer_len =0;1733git_SHA1_Update(context, write_buffer, left);1734}17351736/* Flush first if not enough space for SHA1 signature */1737if(left +20> WRITE_BUFFER_SIZE) {1738if(write_in_full(fd, write_buffer, left) != left)1739return-1;1740 left =0;1741}17421743/* Append the SHA1 signature at the end */1744git_SHA1_Final(write_buffer + left, context);1745hashcpy(sha1, write_buffer + left);1746 left +=20;1747return(write_in_full(fd, write_buffer, left) != left) ? -1:0;1748}17491750static voidce_smudge_racily_clean_entry(struct cache_entry *ce)1751{1752/*1753 * The only thing we care about in this function is to smudge the1754 * falsely clean entry due to touch-update-touch race, so we leave1755 * everything else as they are. We are called for entries whose1756 * ce_stat_data.sd_mtime match the index file mtime.1757 *1758 * Note that this actually does not do much for gitlinks, for1759 * which ce_match_stat_basic() always goes to the actual1760 * contents. The caller checks with is_racy_timestamp() which1761 * always says "no" for gitlinks, so we are not called for them ;-)1762 */1763struct stat st;17641765if(lstat(ce->name, &st) <0)1766return;1767if(ce_match_stat_basic(ce, &st))1768return;1769if(ce_modified_check_fs(ce, &st)) {1770/* This is "racily clean"; smudge it. Note that this1771 * is a tricky code. At first glance, it may appear1772 * that it can break with this sequence:1773 *1774 * $ echo xyzzy >frotz1775 * $ git-update-index --add frotz1776 * $ : >frotz1777 * $ sleep 31778 * $ echo filfre >nitfol1779 * $ git-update-index --add nitfol1780 *1781 * but it does not. When the second update-index runs,1782 * it notices that the entry "frotz" has the same timestamp1783 * as index, and if we were to smudge it by resetting its1784 * size to zero here, then the object name recorded1785 * in index is the 6-byte file but the cached stat information1786 * becomes zero --- which would then match what we would1787 * obtain from the filesystem next time we stat("frotz").1788 *1789 * However, the second update-index, before calling1790 * this function, notices that the cached size is 61791 * bytes and what is on the filesystem is an empty1792 * file, and never calls us, so the cached size information1793 * for "frotz" stays 6 which does not match the filesystem.1794 */1795 ce->ce_stat_data.sd_size =0;1796}1797}17981799/* Copy miscellaneous fields but not the name */1800static char*copy_cache_entry_to_ondisk(struct ondisk_cache_entry *ondisk,1801struct cache_entry *ce)1802{1803short flags;18041805 ondisk->ctime.sec =htonl(ce->ce_stat_data.sd_ctime.sec);1806 ondisk->mtime.sec =htonl(ce->ce_stat_data.sd_mtime.sec);1807 ondisk->ctime.nsec =htonl(ce->ce_stat_data.sd_ctime.nsec);1808 ondisk->mtime.nsec =htonl(ce->ce_stat_data.sd_mtime.nsec);1809 ondisk->dev =htonl(ce->ce_stat_data.sd_dev);1810 ondisk->ino =htonl(ce->ce_stat_data.sd_ino);1811 ondisk->mode =htonl(ce->ce_mode);1812 ondisk->uid =htonl(ce->ce_stat_data.sd_uid);1813 ondisk->gid =htonl(ce->ce_stat_data.sd_gid);1814 ondisk->size =htonl(ce->ce_stat_data.sd_size);1815hashcpy(ondisk->sha1, ce->sha1);18161817 flags = ce->ce_flags & ~CE_NAMEMASK;1818 flags |= (ce_namelen(ce) >= CE_NAMEMASK ? CE_NAMEMASK :ce_namelen(ce));1819 ondisk->flags =htons(flags);1820if(ce->ce_flags & CE_EXTENDED) {1821struct ondisk_cache_entry_extended *ondisk2;1822 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;1823 ondisk2->flags2 =htons((ce->ce_flags & CE_EXTENDED_FLAGS) >>16);1824return ondisk2->name;1825}1826else{1827return ondisk->name;1828}1829}18301831static intce_write_entry(git_SHA_CTX *c,int fd,struct cache_entry *ce,1832struct strbuf *previous_name)1833{1834int size;1835struct ondisk_cache_entry *ondisk;1836int saved_namelen = saved_namelen;/* compiler workaround */1837char*name;1838int result;18391840if(ce->ce_flags & CE_STRIP_NAME) {1841 saved_namelen =ce_namelen(ce);1842 ce->ce_namelen =0;1843}18441845if(!previous_name) {1846 size =ondisk_ce_size(ce);1847 ondisk =xcalloc(1, size);1848 name =copy_cache_entry_to_ondisk(ondisk, ce);1849memcpy(name, ce->name,ce_namelen(ce));1850}else{1851int common, to_remove, prefix_size;1852unsigned char to_remove_vi[16];1853for(common =0;1854(ce->name[common] &&1855 common < previous_name->len &&1856 ce->name[common] == previous_name->buf[common]);1857 common++)1858;/* still matching */1859 to_remove = previous_name->len - common;1860 prefix_size =encode_varint(to_remove, to_remove_vi);18611862if(ce->ce_flags & CE_EXTENDED)1863 size =offsetof(struct ondisk_cache_entry_extended, name);1864else1865 size =offsetof(struct ondisk_cache_entry, name);1866 size += prefix_size + (ce_namelen(ce) - common +1);18671868 ondisk =xcalloc(1, size);1869 name =copy_cache_entry_to_ondisk(ondisk, ce);1870memcpy(name, to_remove_vi, prefix_size);1871memcpy(name + prefix_size, ce->name + common,ce_namelen(ce) - common);18721873strbuf_splice(previous_name, common, to_remove,1874 ce->name + common,ce_namelen(ce) - common);1875}1876if(ce->ce_flags & CE_STRIP_NAME) {1877 ce->ce_namelen = saved_namelen;1878 ce->ce_flags &= ~CE_STRIP_NAME;1879}18801881 result =ce_write(c, fd, ondisk, size);1882free(ondisk);1883return result;1884}18851886/*1887 * This function verifies if index_state has the correct sha1 of the1888 * index file. Don't die if we have any other failure, just return 0.1889 */1890static intverify_index_from(const struct index_state *istate,const char*path)1891{1892int fd;1893 ssize_t n;1894struct stat st;1895unsigned char sha1[20];18961897if(!istate->initialized)1898return0;18991900 fd =open(path, O_RDONLY);1901if(fd <0)1902return0;19031904if(fstat(fd, &st))1905goto out;19061907if(st.st_size <sizeof(struct cache_header) +20)1908goto out;19091910 n =pread_in_full(fd, sha1,20, st.st_size -20);1911if(n !=20)1912goto out;19131914if(hashcmp(istate->sha1, sha1))1915goto out;19161917close(fd);1918return1;19191920out:1921close(fd);1922return0;1923}19241925static intverify_index(const struct index_state *istate)1926{1927returnverify_index_from(istate,get_index_file());1928}19291930static inthas_racy_timestamp(struct index_state *istate)1931{1932int entries = istate->cache_nr;1933int i;19341935for(i =0; i < entries; i++) {1936struct cache_entry *ce = istate->cache[i];1937if(is_racy_timestamp(istate, ce))1938return1;1939}1940return0;1941}19421943/*1944 * Opportunistically update the index but do not complain if we can't1945 */1946voidupdate_index_if_able(struct index_state *istate,struct lock_file *lockfile)1947{1948if((istate->cache_changed ||has_racy_timestamp(istate)) &&1949verify_index(istate) &&1950write_locked_index(istate, lockfile, COMMIT_LOCK))1951rollback_lock_file(lockfile);1952}19531954static intdo_write_index(struct index_state *istate,int newfd,1955int strip_extensions)1956{1957 git_SHA_CTX c;1958struct cache_header hdr;1959int i, err, removed, extended, hdr_version;1960struct cache_entry **cache = istate->cache;1961int entries = istate->cache_nr;1962struct stat st;1963struct strbuf previous_name_buf = STRBUF_INIT, *previous_name;19641965for(i = removed = extended =0; i < entries; i++) {1966if(cache[i]->ce_flags & CE_REMOVE)1967 removed++;19681969/* reduce extended entries if possible */1970 cache[i]->ce_flags &= ~CE_EXTENDED;1971if(cache[i]->ce_flags & CE_EXTENDED_FLAGS) {1972 extended++;1973 cache[i]->ce_flags |= CE_EXTENDED;1974}1975}19761977if(!istate->version) {1978 istate->version =get_index_format_default();1979if(getenv("GIT_TEST_SPLIT_INDEX"))1980init_split_index(istate);1981}19821983/* demote version 3 to version 2 when the latter suffices */1984if(istate->version ==3|| istate->version ==2)1985 istate->version = extended ?3:2;19861987 hdr_version = istate->version;19881989 hdr.hdr_signature =htonl(CACHE_SIGNATURE);1990 hdr.hdr_version =htonl(hdr_version);1991 hdr.hdr_entries =htonl(entries - removed);19921993git_SHA1_Init(&c);1994if(ce_write(&c, newfd, &hdr,sizeof(hdr)) <0)1995return-1;19961997 previous_name = (hdr_version ==4) ? &previous_name_buf : NULL;1998for(i =0; i < entries; i++) {1999struct cache_entry *ce = cache[i];2000if(ce->ce_flags & CE_REMOVE)2001continue;2002if(!ce_uptodate(ce) &&is_racy_timestamp(istate, ce))2003ce_smudge_racily_clean_entry(ce);2004if(is_null_sha1(ce->sha1)) {2005static const char msg[] ="cache entry has null sha1:%s";2006static int allow = -1;20072008if(allow <0)2009 allow =git_env_bool("GIT_ALLOW_NULL_SHA1",0);2010if(allow)2011warning(msg, ce->name);2012else2013returnerror(msg, ce->name);2014}2015if(ce_write_entry(&c, newfd, ce, previous_name) <0)2016return-1;2017}2018strbuf_release(&previous_name_buf);20192020/* Write extension data here */2021if(!strip_extensions && istate->split_index) {2022struct strbuf sb = STRBUF_INIT;20232024 err =write_link_extension(&sb, istate) <0||2025write_index_ext_header(&c, newfd, CACHE_EXT_LINK,2026 sb.len) <0||2027ce_write(&c, newfd, sb.buf, sb.len) <0;2028strbuf_release(&sb);2029if(err)2030return-1;2031}2032if(!strip_extensions && istate->cache_tree) {2033struct strbuf sb = STRBUF_INIT;20342035cache_tree_write(&sb, istate->cache_tree);2036 err =write_index_ext_header(&c, newfd, CACHE_EXT_TREE, sb.len) <02037||ce_write(&c, newfd, sb.buf, sb.len) <0;2038strbuf_release(&sb);2039if(err)2040return-1;2041}2042if(!strip_extensions && istate->resolve_undo) {2043struct strbuf sb = STRBUF_INIT;20442045resolve_undo_write(&sb, istate->resolve_undo);2046 err =write_index_ext_header(&c, newfd, CACHE_EXT_RESOLVE_UNDO,2047 sb.len) <02048||ce_write(&c, newfd, sb.buf, sb.len) <0;2049strbuf_release(&sb);2050if(err)2051return-1;2052}20532054if(ce_flush(&c, newfd, istate->sha1) ||fstat(newfd, &st))2055return-1;2056 istate->timestamp.sec = (unsigned int)st.st_mtime;2057 istate->timestamp.nsec =ST_MTIME_NSEC(st);2058return0;2059}20602061voidset_alternate_index_output(const char*name)2062{2063 alternate_index_output = name;2064}20652066static intcommit_locked_index(struct lock_file *lk)2067{2068if(alternate_index_output)2069returncommit_lock_file_to(lk, alternate_index_output);2070else2071returncommit_lock_file(lk);2072}20732074static intdo_write_locked_index(struct index_state *istate,struct lock_file *lock,2075unsigned flags)2076{2077int ret =do_write_index(istate, lock->fd,0);2078if(ret)2079return ret;2080assert((flags & (COMMIT_LOCK | CLOSE_LOCK)) !=2081(COMMIT_LOCK | CLOSE_LOCK));2082if(flags & COMMIT_LOCK)2083returncommit_locked_index(lock);2084else if(flags & CLOSE_LOCK)2085returnclose_lock_file(lock);2086else2087return ret;2088}20892090static intwrite_split_index(struct index_state *istate,2091struct lock_file *lock,2092unsigned flags)2093{2094int ret;2095prepare_to_write_split_index(istate);2096 ret =do_write_locked_index(istate, lock, flags);2097finish_writing_split_index(istate);2098return ret;2099}21002101static char*temporary_sharedindex;21022103static voidremove_temporary_sharedindex(void)2104{2105if(temporary_sharedindex) {2106unlink_or_warn(temporary_sharedindex);2107free(temporary_sharedindex);2108 temporary_sharedindex = NULL;2109}2110}21112112static voidremove_temporary_sharedindex_on_signal(int signo)2113{2114remove_temporary_sharedindex();2115sigchain_pop(signo);2116raise(signo);2117}21182119static intwrite_shared_index(struct index_state *istate,2120struct lock_file *lock,unsigned flags)2121{2122struct split_index *si = istate->split_index;2123static int installed_handler;2124int fd, ret;21252126 temporary_sharedindex =git_pathdup("sharedindex_XXXXXX");2127 fd =mkstemp(temporary_sharedindex);2128if(fd <0) {2129free(temporary_sharedindex);2130 temporary_sharedindex = NULL;2131hashclr(si->base_sha1);2132returndo_write_locked_index(istate, lock, flags);2133}2134if(!installed_handler) {2135atexit(remove_temporary_sharedindex);2136sigchain_push_common(remove_temporary_sharedindex_on_signal);2137}2138move_cache_to_base_index(istate);2139 ret =do_write_index(si->base, fd,1);2140close(fd);2141if(ret) {2142remove_temporary_sharedindex();2143return ret;2144}2145 ret =rename(temporary_sharedindex,2146git_path("sharedindex.%s",sha1_to_hex(si->base->sha1)));2147free(temporary_sharedindex);2148 temporary_sharedindex = NULL;2149if(!ret)2150hashcpy(si->base_sha1, si->base->sha1);2151return ret;2152}21532154intwrite_locked_index(struct index_state *istate,struct lock_file *lock,2155unsigned flags)2156{2157struct split_index *si = istate->split_index;21582159if(!si || alternate_index_output ||2160(istate->cache_changed & ~EXTMASK)) {2161if(si)2162hashclr(si->base_sha1);2163returndo_write_locked_index(istate, lock, flags);2164}21652166if(getenv("GIT_TEST_SPLIT_INDEX")) {2167int v = si->base_sha1[0];2168if((v &15) <6)2169 istate->cache_changed |= SPLIT_INDEX_ORDERED;2170}2171if(istate->cache_changed & SPLIT_INDEX_ORDERED) {2172int ret =write_shared_index(istate, lock, flags);2173if(ret)2174return ret;2175}21762177returnwrite_split_index(istate, lock, flags);2178}21792180/*2181 * Read the index file that is potentially unmerged into given2182 * index_state, dropping any unmerged entries. Returns true if2183 * the index is unmerged. Callers who want to refuse to work2184 * from an unmerged state can call this and check its return value,2185 * instead of calling read_cache().2186 */2187intread_index_unmerged(struct index_state *istate)2188{2189int i;2190int unmerged =0;21912192read_index(istate);2193for(i =0; i < istate->cache_nr; i++) {2194struct cache_entry *ce = istate->cache[i];2195struct cache_entry *new_ce;2196int size, len;21972198if(!ce_stage(ce))2199continue;2200 unmerged =1;2201 len =ce_namelen(ce);2202 size =cache_entry_size(len);2203 new_ce =xcalloc(1, size);2204memcpy(new_ce->name, ce->name, len);2205 new_ce->ce_flags =create_ce_flags(0) | CE_CONFLICTED;2206 new_ce->ce_namelen = len;2207 new_ce->ce_mode = ce->ce_mode;2208if(add_index_entry(istate, new_ce,0))2209returnerror("%s: cannot drop to stage #0",2210 new_ce->name);2211}2212return unmerged;2213}22142215/*2216 * Returns 1 if the path is an "other" path with respect to2217 * the index; that is, the path is not mentioned in the index at all,2218 * either as a file, a directory with some files in the index,2219 * or as an unmerged entry.2220 *2221 * We helpfully remove a trailing "/" from directories so that2222 * the output of read_directory can be used as-is.2223 */2224intindex_name_is_other(const struct index_state *istate,const char*name,2225int namelen)2226{2227int pos;2228if(namelen && name[namelen -1] =='/')2229 namelen--;2230 pos =index_name_pos(istate, name, namelen);2231if(0<= pos)2232return0;/* exact match */2233 pos = -pos -1;2234if(pos < istate->cache_nr) {2235struct cache_entry *ce = istate->cache[pos];2236if(ce_namelen(ce) == namelen &&2237!memcmp(ce->name, name, namelen))2238return0;/* Yup, this one exists unmerged */2239}2240return1;2241}22422243void*read_blob_data_from_index(struct index_state *istate,const char*path,unsigned long*size)2244{2245int pos, len;2246unsigned long sz;2247enum object_type type;2248void*data;22492250 len =strlen(path);2251 pos =index_name_pos(istate, path, len);2252if(pos <0) {2253/*2254 * We might be in the middle of a merge, in which2255 * case we would read stage #2 (ours).2256 */2257int i;2258for(i = -pos -1;2259(pos <0&& i < istate->cache_nr &&2260!strcmp(istate->cache[i]->name, path));2261 i++)2262if(ce_stage(istate->cache[i]) ==2)2263 pos = i;2264}2265if(pos <0)2266return NULL;2267 data =read_sha1_file(istate->cache[pos]->sha1, &type, &sz);2268if(!data || type != OBJ_BLOB) {2269free(data);2270return NULL;2271}2272if(size)2273*size = sz;2274return data;2275}22762277voidstat_validity_clear(struct stat_validity *sv)2278{2279free(sv->sd);2280 sv->sd = NULL;2281}22822283intstat_validity_check(struct stat_validity *sv,const char*path)2284{2285struct stat st;22862287if(stat(path, &st) <0)2288return sv->sd == NULL;2289if(!sv->sd)2290return0;2291returnS_ISREG(st.st_mode) && !match_stat_data(sv->sd, &st);2292}22932294voidstat_validity_update(struct stat_validity *sv,int fd)2295{2296struct stat st;22972298if(fstat(fd, &st) <0|| !S_ISREG(st.st_mode))2299stat_validity_clear(sv);2300else{2301if(!sv->sd)2302 sv->sd =xcalloc(1,sizeof(struct stat_data));2303fill_stat_data(sv->sd, &st);2304}2305}