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; 159static int cloexec = O_CLOEXEC; 160int fd =open(ce->name, O_RDONLY | cloexec); 161 162if((cloexec & O_CLOEXEC) && fd <0&& errno == EINVAL) { 163/* Try again w/o O_CLOEXEC: the kernel might not support it */ 164 cloexec &= ~O_CLOEXEC; 165 fd =open(ce->name, O_RDONLY | cloexec); 166} 167 168if(fd >=0) { 169unsigned char sha1[20]; 170if(!index_fd(sha1, fd, st, OBJ_BLOB, ce->name,0)) 171 match =hashcmp(sha1, ce->oid.hash); 172/* index_fd() closed the file descriptor already */ 173} 174return match; 175} 176 177static intce_compare_link(const struct cache_entry *ce,size_t expected_size) 178{ 179int match = -1; 180void*buffer; 181unsigned long size; 182enum object_type type; 183struct strbuf sb = STRBUF_INIT; 184 185if(strbuf_readlink(&sb, ce->name, expected_size)) 186return-1; 187 188 buffer =read_sha1_file(ce->oid.hash, &type, &size); 189if(buffer) { 190if(size == sb.len) 191 match =memcmp(buffer, sb.buf, size); 192free(buffer); 193} 194strbuf_release(&sb); 195return match; 196} 197 198static intce_compare_gitlink(const struct cache_entry *ce) 199{ 200unsigned char sha1[20]; 201 202/* 203 * We don't actually require that the .git directory 204 * under GITLINK directory be a valid git directory. It 205 * might even be missing (in case nobody populated that 206 * sub-project). 207 * 208 * If so, we consider it always to match. 209 */ 210if(resolve_gitlink_ref(ce->name,"HEAD", sha1) <0) 211return0; 212returnhashcmp(sha1, ce->oid.hash); 213} 214 215static intce_modified_check_fs(const struct cache_entry *ce,struct stat *st) 216{ 217switch(st->st_mode & S_IFMT) { 218case S_IFREG: 219if(ce_compare_data(ce, st)) 220return DATA_CHANGED; 221break; 222case S_IFLNK: 223if(ce_compare_link(ce,xsize_t(st->st_size))) 224return DATA_CHANGED; 225break; 226case S_IFDIR: 227if(S_ISGITLINK(ce->ce_mode)) 228returnce_compare_gitlink(ce) ? DATA_CHANGED :0; 229default: 230return TYPE_CHANGED; 231} 232return0; 233} 234 235static intce_match_stat_basic(const struct cache_entry *ce,struct stat *st) 236{ 237unsigned int changed =0; 238 239if(ce->ce_flags & CE_REMOVE) 240return MODE_CHANGED | DATA_CHANGED | TYPE_CHANGED; 241 242switch(ce->ce_mode & S_IFMT) { 243case S_IFREG: 244 changed |= !S_ISREG(st->st_mode) ? TYPE_CHANGED :0; 245/* We consider only the owner x bit to be relevant for 246 * "mode changes" 247 */ 248if(trust_executable_bit && 249(0100& (ce->ce_mode ^ st->st_mode))) 250 changed |= MODE_CHANGED; 251break; 252case S_IFLNK: 253if(!S_ISLNK(st->st_mode) && 254(has_symlinks || !S_ISREG(st->st_mode))) 255 changed |= TYPE_CHANGED; 256break; 257case S_IFGITLINK: 258/* We ignore most of the st_xxx fields for gitlinks */ 259if(!S_ISDIR(st->st_mode)) 260 changed |= TYPE_CHANGED; 261else if(ce_compare_gitlink(ce)) 262 changed |= DATA_CHANGED; 263return changed; 264default: 265die("internal error: ce_mode is%o", ce->ce_mode); 266} 267 268 changed |=match_stat_data(&ce->ce_stat_data, st); 269 270/* Racily smudged entry? */ 271if(!ce->ce_stat_data.sd_size) { 272if(!is_empty_blob_sha1(ce->oid.hash)) 273 changed |= DATA_CHANGED; 274} 275 276return changed; 277} 278 279static intis_racy_stat(const struct index_state *istate, 280const struct stat_data *sd) 281{ 282return(istate->timestamp.sec && 283#ifdef USE_NSEC 284/* nanosecond timestamped files can also be racy! */ 285(istate->timestamp.sec < sd->sd_mtime.sec || 286(istate->timestamp.sec == sd->sd_mtime.sec && 287 istate->timestamp.nsec <= sd->sd_mtime.nsec)) 288#else 289 istate->timestamp.sec <= sd->sd_mtime.sec 290#endif 291); 292} 293 294static intis_racy_timestamp(const struct index_state *istate, 295const struct cache_entry *ce) 296{ 297return(!S_ISGITLINK(ce->ce_mode) && 298is_racy_stat(istate, &ce->ce_stat_data)); 299} 300 301intmatch_stat_data_racy(const struct index_state *istate, 302const struct stat_data *sd,struct stat *st) 303{ 304if(is_racy_stat(istate, sd)) 305return MTIME_CHANGED; 306returnmatch_stat_data(sd, st); 307} 308 309intie_match_stat(const struct index_state *istate, 310const struct cache_entry *ce,struct stat *st, 311unsigned int options) 312{ 313unsigned int changed; 314int ignore_valid = options & CE_MATCH_IGNORE_VALID; 315int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE; 316int assume_racy_is_modified = options & CE_MATCH_RACY_IS_DIRTY; 317 318/* 319 * If it's marked as always valid in the index, it's 320 * valid whatever the checked-out copy says. 321 * 322 * skip-worktree has the same effect with higher precedence 323 */ 324if(!ignore_skip_worktree &&ce_skip_worktree(ce)) 325return0; 326if(!ignore_valid && (ce->ce_flags & CE_VALID)) 327return0; 328 329/* 330 * Intent-to-add entries have not been added, so the index entry 331 * by definition never matches what is in the work tree until it 332 * actually gets added. 333 */ 334if(ce_intent_to_add(ce)) 335return DATA_CHANGED | TYPE_CHANGED | MODE_CHANGED; 336 337 changed =ce_match_stat_basic(ce, st); 338 339/* 340 * Within 1 second of this sequence: 341 * echo xyzzy >file && git-update-index --add file 342 * running this command: 343 * echo frotz >file 344 * would give a falsely clean cache entry. The mtime and 345 * length match the cache, and other stat fields do not change. 346 * 347 * We could detect this at update-index time (the cache entry 348 * being registered/updated records the same time as "now") 349 * and delay the return from git-update-index, but that would 350 * effectively mean we can make at most one commit per second, 351 * which is not acceptable. Instead, we check cache entries 352 * whose mtime are the same as the index file timestamp more 353 * carefully than others. 354 */ 355if(!changed &&is_racy_timestamp(istate, ce)) { 356if(assume_racy_is_modified) 357 changed |= DATA_CHANGED; 358else 359 changed |=ce_modified_check_fs(ce, st); 360} 361 362return changed; 363} 364 365intie_modified(const struct index_state *istate, 366const struct cache_entry *ce, 367struct stat *st,unsigned int options) 368{ 369int changed, changed_fs; 370 371 changed =ie_match_stat(istate, ce, st, options); 372if(!changed) 373return0; 374/* 375 * If the mode or type has changed, there's no point in trying 376 * to refresh the entry - it's not going to match 377 */ 378if(changed & (MODE_CHANGED | TYPE_CHANGED)) 379return changed; 380 381/* 382 * Immediately after read-tree or update-index --cacheinfo, 383 * the length field is zero, as we have never even read the 384 * lstat(2) information once, and we cannot trust DATA_CHANGED 385 * returned by ie_match_stat() which in turn was returned by 386 * ce_match_stat_basic() to signal that the filesize of the 387 * blob changed. We have to actually go to the filesystem to 388 * see if the contents match, and if so, should answer "unchanged". 389 * 390 * The logic does not apply to gitlinks, as ce_match_stat_basic() 391 * already has checked the actual HEAD from the filesystem in the 392 * subproject. If ie_match_stat() already said it is different, 393 * then we know it is. 394 */ 395if((changed & DATA_CHANGED) && 396(S_ISGITLINK(ce->ce_mode) || ce->ce_stat_data.sd_size !=0)) 397return changed; 398 399 changed_fs =ce_modified_check_fs(ce, st); 400if(changed_fs) 401return changed | changed_fs; 402return0; 403} 404 405intbase_name_compare(const char*name1,int len1,int mode1, 406const char*name2,int len2,int mode2) 407{ 408unsigned char c1, c2; 409int len = len1 < len2 ? len1 : len2; 410int cmp; 411 412 cmp =memcmp(name1, name2, len); 413if(cmp) 414return cmp; 415 c1 = name1[len]; 416 c2 = name2[len]; 417if(!c1 &&S_ISDIR(mode1)) 418 c1 ='/'; 419if(!c2 &&S_ISDIR(mode2)) 420 c2 ='/'; 421return(c1 < c2) ? -1: (c1 > c2) ?1:0; 422} 423 424/* 425 * df_name_compare() is identical to base_name_compare(), except it 426 * compares conflicting directory/file entries as equal. Note that 427 * while a directory name compares as equal to a regular file, they 428 * then individually compare _differently_ to a filename that has 429 * a dot after the basename (because '\0' < '.' < '/'). 430 * 431 * This is used by routines that want to traverse the git namespace 432 * but then handle conflicting entries together when possible. 433 */ 434intdf_name_compare(const char*name1,int len1,int mode1, 435const char*name2,int len2,int mode2) 436{ 437int len = len1 < len2 ? len1 : len2, cmp; 438unsigned char c1, c2; 439 440 cmp =memcmp(name1, name2, len); 441if(cmp) 442return cmp; 443/* Directories and files compare equal (same length, same name) */ 444if(len1 == len2) 445return0; 446 c1 = name1[len]; 447if(!c1 &&S_ISDIR(mode1)) 448 c1 ='/'; 449 c2 = name2[len]; 450if(!c2 &&S_ISDIR(mode2)) 451 c2 ='/'; 452if(c1 =='/'&& !c2) 453return0; 454if(c2 =='/'&& !c1) 455return0; 456return c1 - c2; 457} 458 459intname_compare(const char*name1,size_t len1,const char*name2,size_t len2) 460{ 461size_t min_len = (len1 < len2) ? len1 : len2; 462int cmp =memcmp(name1, name2, min_len); 463if(cmp) 464return cmp; 465if(len1 < len2) 466return-1; 467if(len1 > len2) 468return1; 469return0; 470} 471 472intcache_name_stage_compare(const char*name1,int len1,int stage1,const char*name2,int len2,int stage2) 473{ 474int cmp; 475 476 cmp =name_compare(name1, len1, name2, len2); 477if(cmp) 478return cmp; 479 480if(stage1 < stage2) 481return-1; 482if(stage1 > stage2) 483return1; 484return0; 485} 486 487static intindex_name_stage_pos(const struct index_state *istate,const char*name,int namelen,int stage) 488{ 489int first, last; 490 491 first =0; 492 last = istate->cache_nr; 493while(last > first) { 494int next = (last + first) >>1; 495struct cache_entry *ce = istate->cache[next]; 496int cmp =cache_name_stage_compare(name, namelen, stage, ce->name,ce_namelen(ce),ce_stage(ce)); 497if(!cmp) 498return next; 499if(cmp <0) { 500 last = next; 501continue; 502} 503 first = next+1; 504} 505return-first-1; 506} 507 508intindex_name_pos(const struct index_state *istate,const char*name,int namelen) 509{ 510returnindex_name_stage_pos(istate, name, namelen,0); 511} 512 513/* Remove entry, return true if there are more entries to go.. */ 514intremove_index_entry_at(struct index_state *istate,int pos) 515{ 516struct cache_entry *ce = istate->cache[pos]; 517 518record_resolve_undo(istate, ce); 519remove_name_hash(istate, ce); 520save_or_free_index_entry(istate, ce); 521 istate->cache_changed |= CE_ENTRY_REMOVED; 522 istate->cache_nr--; 523if(pos >= istate->cache_nr) 524return0; 525memmove(istate->cache + pos, 526 istate->cache + pos +1, 527(istate->cache_nr - pos) *sizeof(struct cache_entry *)); 528return1; 529} 530 531/* 532 * Remove all cache entries marked for removal, that is where 533 * CE_REMOVE is set in ce_flags. This is much more effective than 534 * calling remove_index_entry_at() for each entry to be removed. 535 */ 536voidremove_marked_cache_entries(struct index_state *istate) 537{ 538struct cache_entry **ce_array = istate->cache; 539unsigned int i, j; 540 541for(i = j =0; i < istate->cache_nr; i++) { 542if(ce_array[i]->ce_flags & CE_REMOVE) { 543remove_name_hash(istate, ce_array[i]); 544save_or_free_index_entry(istate, ce_array[i]); 545} 546else 547 ce_array[j++] = ce_array[i]; 548} 549if(j == istate->cache_nr) 550return; 551 istate->cache_changed |= CE_ENTRY_REMOVED; 552 istate->cache_nr = j; 553} 554 555intremove_file_from_index(struct index_state *istate,const char*path) 556{ 557int pos =index_name_pos(istate, path,strlen(path)); 558if(pos <0) 559 pos = -pos-1; 560cache_tree_invalidate_path(istate, path); 561untracked_cache_remove_from_index(istate, path); 562while(pos < istate->cache_nr && !strcmp(istate->cache[pos]->name, path)) 563remove_index_entry_at(istate, pos); 564return0; 565} 566 567static intcompare_name(struct cache_entry *ce,const char*path,int namelen) 568{ 569return namelen !=ce_namelen(ce) ||memcmp(path, ce->name, namelen); 570} 571 572static intindex_name_pos_also_unmerged(struct index_state *istate, 573const char*path,int namelen) 574{ 575int pos =index_name_pos(istate, path, namelen); 576struct cache_entry *ce; 577 578if(pos >=0) 579return pos; 580 581/* maybe unmerged? */ 582 pos = -1- pos; 583if(pos >= istate->cache_nr || 584compare_name((ce = istate->cache[pos]), path, namelen)) 585return-1; 586 587/* order of preference: stage 2, 1, 3 */ 588if(ce_stage(ce) ==1&& pos +1< istate->cache_nr && 589ce_stage((ce = istate->cache[pos +1])) ==2&& 590!compare_name(ce, path, namelen)) 591 pos++; 592return pos; 593} 594 595static intdifferent_name(struct cache_entry *ce,struct cache_entry *alias) 596{ 597int len =ce_namelen(ce); 598returnce_namelen(alias) != len ||memcmp(ce->name, alias->name, len); 599} 600 601/* 602 * If we add a filename that aliases in the cache, we will use the 603 * name that we already have - but we don't want to update the same 604 * alias twice, because that implies that there were actually two 605 * different files with aliasing names! 606 * 607 * So we use the CE_ADDED flag to verify that the alias was an old 608 * one before we accept it as 609 */ 610static struct cache_entry *create_alias_ce(struct index_state *istate, 611struct cache_entry *ce, 612struct cache_entry *alias) 613{ 614int len; 615struct cache_entry *new; 616 617if(alias->ce_flags & CE_ADDED) 618die("Will not add file alias '%s' ('%s' already exists in index)", ce->name, alias->name); 619 620/* Ok, create the new entry using the name of the existing alias */ 621 len =ce_namelen(alias); 622new=xcalloc(1,cache_entry_size(len)); 623memcpy(new->name, alias->name, len); 624copy_cache_entry(new, ce); 625save_or_free_index_entry(istate, ce); 626return new; 627} 628 629voidset_object_name_for_intent_to_add_entry(struct cache_entry *ce) 630{ 631unsigned char sha1[20]; 632if(write_sha1_file("",0, blob_type, sha1)) 633die("cannot create an empty blob in the object database"); 634hashcpy(ce->oid.hash, sha1); 635} 636 637intadd_to_index(struct index_state *istate,const char*path,struct stat *st,int flags) 638{ 639int size, namelen, was_same; 640 mode_t st_mode = st->st_mode; 641struct cache_entry *ce, *alias; 642unsigned ce_option = CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE|CE_MATCH_RACY_IS_DIRTY; 643int verbose = flags & (ADD_CACHE_VERBOSE | ADD_CACHE_PRETEND); 644int pretend = flags & ADD_CACHE_PRETEND; 645int intent_only = flags & ADD_CACHE_INTENT; 646int add_option = (ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE| 647(intent_only ? ADD_CACHE_NEW_ONLY :0)); 648 649if(!S_ISREG(st_mode) && !S_ISLNK(st_mode) && !S_ISDIR(st_mode)) 650returnerror("%s: can only add regular files, symbolic links or git-directories", path); 651 652 namelen =strlen(path); 653if(S_ISDIR(st_mode)) { 654while(namelen && path[namelen-1] =='/') 655 namelen--; 656} 657 size =cache_entry_size(namelen); 658 ce =xcalloc(1, size); 659memcpy(ce->name, path, namelen); 660 ce->ce_namelen = namelen; 661if(!intent_only) 662fill_stat_cache_info(ce, st); 663else 664 ce->ce_flags |= CE_INTENT_TO_ADD; 665 666 667if(trust_executable_bit && has_symlinks) { 668 ce->ce_mode =create_ce_mode(st_mode); 669}else{ 670/* If there is an existing entry, pick the mode bits and type 671 * from it, otherwise assume unexecutable regular file. 672 */ 673struct cache_entry *ent; 674int pos =index_name_pos_also_unmerged(istate, path, namelen); 675 676 ent = (0<= pos) ? istate->cache[pos] : NULL; 677 ce->ce_mode =ce_mode_from_stat(ent, st_mode); 678} 679 680/* When core.ignorecase=true, determine if a directory of the same name but differing 681 * case already exists within the Git repository. If it does, ensure the directory 682 * case of the file being added to the repository matches (is folded into) the existing 683 * entry's directory case. 684 */ 685if(ignore_case) { 686adjust_dirname_case(istate, ce->name); 687} 688 689 alias =index_file_exists(istate, ce->name,ce_namelen(ce), ignore_case); 690if(alias && !ce_stage(alias) && !ie_match_stat(istate, alias, st, ce_option)) { 691/* Nothing changed, really */ 692if(!S_ISGITLINK(alias->ce_mode)) 693ce_mark_uptodate(alias); 694 alias->ce_flags |= CE_ADDED; 695 696free(ce); 697return0; 698} 699if(!intent_only) { 700if(index_path(ce->oid.hash, path, st, HASH_WRITE_OBJECT)) { 701free(ce); 702returnerror("unable to index file%s", path); 703} 704}else 705set_object_name_for_intent_to_add_entry(ce); 706 707if(ignore_case && alias &&different_name(ce, alias)) 708 ce =create_alias_ce(istate, ce, alias); 709 ce->ce_flags |= CE_ADDED; 710 711/* It was suspected to be racily clean, but it turns out to be Ok */ 712 was_same = (alias && 713!ce_stage(alias) && 714!oidcmp(&alias->oid, &ce->oid) && 715 ce->ce_mode == alias->ce_mode); 716 717if(pretend) 718free(ce); 719else if(add_index_entry(istate, ce, add_option)) { 720free(ce); 721returnerror("unable to add%sto index", path); 722} 723if(verbose && !was_same) 724printf("add '%s'\n", path); 725return0; 726} 727 728intadd_file_to_index(struct index_state *istate,const char*path,int flags) 729{ 730struct stat st; 731if(lstat(path, &st)) 732die_errno("unable to stat '%s'", path); 733returnadd_to_index(istate, path, &st, flags); 734} 735 736struct cache_entry *make_cache_entry(unsigned int mode, 737const unsigned char*sha1,const char*path,int stage, 738unsigned int refresh_options) 739{ 740int size, len; 741struct cache_entry *ce, *ret; 742 743if(!verify_path(path)) { 744error("Invalid path '%s'", path); 745return NULL; 746} 747 748 len =strlen(path); 749 size =cache_entry_size(len); 750 ce =xcalloc(1, size); 751 752hashcpy(ce->oid.hash, sha1); 753memcpy(ce->name, path, len); 754 ce->ce_flags =create_ce_flags(stage); 755 ce->ce_namelen = len; 756 ce->ce_mode =create_ce_mode(mode); 757 758 ret =refresh_cache_entry(ce, refresh_options); 759if(ret != ce) 760free(ce); 761return ret; 762} 763 764/* 765 * Chmod an index entry with either +x or -x. 766 * 767 * Returns -1 if the chmod for the particular cache entry failed (if it's 768 * not a regular file), -2 if an invalid flip argument is passed in, 0 769 * otherwise. 770 */ 771intchmod_index_entry(struct index_state *istate,struct cache_entry *ce, 772char flip) 773{ 774if(!S_ISREG(ce->ce_mode)) 775return-1; 776switch(flip) { 777case'+': 778 ce->ce_mode |=0111; 779break; 780case'-': 781 ce->ce_mode &= ~0111; 782break; 783default: 784return-2; 785} 786cache_tree_invalidate_path(istate, ce->name); 787 ce->ce_flags |= CE_UPDATE_IN_BASE; 788 istate->cache_changed |= CE_ENTRY_CHANGED; 789 790return0; 791} 792 793intce_same_name(const struct cache_entry *a,const struct cache_entry *b) 794{ 795int len =ce_namelen(a); 796returnce_namelen(b) == len && !memcmp(a->name, b->name, len); 797} 798 799/* 800 * We fundamentally don't like some paths: we don't want 801 * dot or dot-dot anywhere, and for obvious reasons don't 802 * want to recurse into ".git" either. 803 * 804 * Also, we don't want double slashes or slashes at the 805 * end that can make pathnames ambiguous. 806 */ 807static intverify_dotfile(const char*rest) 808{ 809/* 810 * The first character was '.', but that 811 * has already been discarded, we now test 812 * the rest. 813 */ 814 815/* "." is not allowed */ 816if(*rest =='\0'||is_dir_sep(*rest)) 817return0; 818 819switch(*rest) { 820/* 821 * ".git" followed by NUL or slash is bad. This 822 * shares the path end test with the ".." case. 823 */ 824case'g': 825case'G': 826if(rest[1] !='i'&& rest[1] !='I') 827break; 828if(rest[2] !='t'&& rest[2] !='T') 829break; 830 rest +=2; 831/* fallthrough */ 832case'.': 833if(rest[1] =='\0'||is_dir_sep(rest[1])) 834return0; 835} 836return1; 837} 838 839intverify_path(const char*path) 840{ 841char c; 842 843if(has_dos_drive_prefix(path)) 844return0; 845 846goto inside; 847for(;;) { 848if(!c) 849return1; 850if(is_dir_sep(c)) { 851inside: 852if(protect_hfs &&is_hfs_dotgit(path)) 853return0; 854if(protect_ntfs &&is_ntfs_dotgit(path)) 855return0; 856 c = *path++; 857if((c =='.'&& !verify_dotfile(path)) || 858is_dir_sep(c) || c =='\0') 859return0; 860} 861 c = *path++; 862} 863} 864 865/* 866 * Do we have another file that has the beginning components being a 867 * proper superset of the name we're trying to add? 868 */ 869static inthas_file_name(struct index_state *istate, 870const struct cache_entry *ce,int pos,int ok_to_replace) 871{ 872int retval =0; 873int len =ce_namelen(ce); 874int stage =ce_stage(ce); 875const char*name = ce->name; 876 877while(pos < istate->cache_nr) { 878struct cache_entry *p = istate->cache[pos++]; 879 880if(len >=ce_namelen(p)) 881break; 882if(memcmp(name, p->name, len)) 883break; 884if(ce_stage(p) != stage) 885continue; 886if(p->name[len] !='/') 887continue; 888if(p->ce_flags & CE_REMOVE) 889continue; 890 retval = -1; 891if(!ok_to_replace) 892break; 893remove_index_entry_at(istate, --pos); 894} 895return retval; 896} 897 898/* 899 * Do we have another file with a pathname that is a proper 900 * subset of the name we're trying to add? 901 */ 902static inthas_dir_name(struct index_state *istate, 903const struct cache_entry *ce,int pos,int ok_to_replace) 904{ 905int retval =0; 906int stage =ce_stage(ce); 907const char*name = ce->name; 908const char*slash = name +ce_namelen(ce); 909 910for(;;) { 911int len; 912 913for(;;) { 914if(*--slash =='/') 915break; 916if(slash <= ce->name) 917return retval; 918} 919 len = slash - name; 920 921 pos =index_name_stage_pos(istate, name, len, stage); 922if(pos >=0) { 923/* 924 * Found one, but not so fast. This could 925 * be a marker that says "I was here, but 926 * I am being removed". Such an entry is 927 * not a part of the resulting tree, and 928 * it is Ok to have a directory at the same 929 * path. 930 */ 931if(!(istate->cache[pos]->ce_flags & CE_REMOVE)) { 932 retval = -1; 933if(!ok_to_replace) 934break; 935remove_index_entry_at(istate, pos); 936continue; 937} 938} 939else 940 pos = -pos-1; 941 942/* 943 * Trivial optimization: if we find an entry that 944 * already matches the sub-directory, then we know 945 * we're ok, and we can exit. 946 */ 947while(pos < istate->cache_nr) { 948struct cache_entry *p = istate->cache[pos]; 949if((ce_namelen(p) <= len) || 950(p->name[len] !='/') || 951memcmp(p->name, name, len)) 952break;/* not our subdirectory */ 953if(ce_stage(p) == stage && !(p->ce_flags & CE_REMOVE)) 954/* 955 * p is at the same stage as our entry, and 956 * is a subdirectory of what we are looking 957 * at, so we cannot have conflicts at our 958 * level or anything shorter. 959 */ 960return retval; 961 pos++; 962} 963} 964return retval; 965} 966 967/* We may be in a situation where we already have path/file and path 968 * is being added, or we already have path and path/file is being 969 * added. Either one would result in a nonsense tree that has path 970 * twice when git-write-tree tries to write it out. Prevent it. 971 * 972 * If ok-to-replace is specified, we remove the conflicting entries 973 * from the cache so the caller should recompute the insert position. 974 * When this happens, we return non-zero. 975 */ 976static intcheck_file_directory_conflict(struct index_state *istate, 977const struct cache_entry *ce, 978int pos,int ok_to_replace) 979{ 980int retval; 981 982/* 983 * When ce is an "I am going away" entry, we allow it to be added 984 */ 985if(ce->ce_flags & CE_REMOVE) 986return0; 987 988/* 989 * We check if the path is a sub-path of a subsequent pathname 990 * first, since removing those will not change the position 991 * in the array. 992 */ 993 retval =has_file_name(istate, ce, pos, ok_to_replace); 994 995/* 996 * Then check if the path might have a clashing sub-directory 997 * before it. 998 */ 999return retval +has_dir_name(istate, ce, pos, ok_to_replace);1000}10011002static intadd_index_entry_with_check(struct index_state *istate,struct cache_entry *ce,int option)1003{1004int pos;1005int ok_to_add = option & ADD_CACHE_OK_TO_ADD;1006int ok_to_replace = option & ADD_CACHE_OK_TO_REPLACE;1007int skip_df_check = option & ADD_CACHE_SKIP_DFCHECK;1008int new_only = option & ADD_CACHE_NEW_ONLY;10091010if(!(option & ADD_CACHE_KEEP_CACHE_TREE))1011cache_tree_invalidate_path(istate, ce->name);1012 pos =index_name_stage_pos(istate, ce->name,ce_namelen(ce),ce_stage(ce));10131014/* existing match? Just replace it. */1015if(pos >=0) {1016if(!new_only)1017replace_index_entry(istate, pos, ce);1018return0;1019}1020 pos = -pos-1;10211022if(!(option & ADD_CACHE_KEEP_CACHE_TREE))1023untracked_cache_add_to_index(istate, ce->name);10241025/*1026 * Inserting a merged entry ("stage 0") into the index1027 * will always replace all non-merged entries..1028 */1029if(pos < istate->cache_nr &&ce_stage(ce) ==0) {1030while(ce_same_name(istate->cache[pos], ce)) {1031 ok_to_add =1;1032if(!remove_index_entry_at(istate, pos))1033break;1034}1035}10361037if(!ok_to_add)1038return-1;1039if(!verify_path(ce->name))1040returnerror("Invalid path '%s'", ce->name);10411042if(!skip_df_check &&1043check_file_directory_conflict(istate, ce, pos, ok_to_replace)) {1044if(!ok_to_replace)1045returnerror("'%s' appears as both a file and as a directory",1046 ce->name);1047 pos =index_name_stage_pos(istate, ce->name,ce_namelen(ce),ce_stage(ce));1048 pos = -pos-1;1049}1050return pos +1;1051}10521053intadd_index_entry(struct index_state *istate,struct cache_entry *ce,int option)1054{1055int pos;10561057if(option & ADD_CACHE_JUST_APPEND)1058 pos = istate->cache_nr;1059else{1060int ret;1061 ret =add_index_entry_with_check(istate, ce, option);1062if(ret <=0)1063return ret;1064 pos = ret -1;1065}10661067/* Make sure the array is big enough .. */1068ALLOC_GROW(istate->cache, istate->cache_nr +1, istate->cache_alloc);10691070/* Add it in.. */1071 istate->cache_nr++;1072if(istate->cache_nr > pos +1)1073memmove(istate->cache + pos +1,1074 istate->cache + pos,1075(istate->cache_nr - pos -1) *sizeof(ce));1076set_index_entry(istate, pos, ce);1077 istate->cache_changed |= CE_ENTRY_ADDED;1078return0;1079}10801081/*1082 * "refresh" does not calculate a new sha1 file or bring the1083 * cache up-to-date for mode/content changes. But what it1084 * _does_ do is to "re-match" the stat information of a file1085 * with the cache, so that you can refresh the cache for a1086 * file that hasn't been changed but where the stat entry is1087 * out of date.1088 *1089 * For example, you'd want to do this after doing a "git-read-tree",1090 * to link up the stat cache details with the proper files.1091 */1092static struct cache_entry *refresh_cache_ent(struct index_state *istate,1093struct cache_entry *ce,1094unsigned int options,int*err,1095int*changed_ret)1096{1097struct stat st;1098struct cache_entry *updated;1099int changed, size;1100int refresh = options & CE_MATCH_REFRESH;1101int ignore_valid = options & CE_MATCH_IGNORE_VALID;1102int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE;1103int ignore_missing = options & CE_MATCH_IGNORE_MISSING;11041105if(!refresh ||ce_uptodate(ce))1106return ce;11071108/*1109 * CE_VALID or CE_SKIP_WORKTREE means the user promised us1110 * that the change to the work tree does not matter and told1111 * us not to worry.1112 */1113if(!ignore_skip_worktree &&ce_skip_worktree(ce)) {1114ce_mark_uptodate(ce);1115return ce;1116}1117if(!ignore_valid && (ce->ce_flags & CE_VALID)) {1118ce_mark_uptodate(ce);1119return ce;1120}11211122if(has_symlink_leading_path(ce->name,ce_namelen(ce))) {1123if(ignore_missing)1124return ce;1125if(err)1126*err = ENOENT;1127return NULL;1128}11291130if(lstat(ce->name, &st) <0) {1131if(ignore_missing && errno == ENOENT)1132return ce;1133if(err)1134*err = errno;1135return NULL;1136}11371138 changed =ie_match_stat(istate, ce, &st, options);1139if(changed_ret)1140*changed_ret = changed;1141if(!changed) {1142/*1143 * The path is unchanged. If we were told to ignore1144 * valid bit, then we did the actual stat check and1145 * found that the entry is unmodified. If the entry1146 * is not marked VALID, this is the place to mark it1147 * valid again, under "assume unchanged" mode.1148 */1149if(ignore_valid && assume_unchanged &&1150!(ce->ce_flags & CE_VALID))1151;/* mark this one VALID again */1152else{1153/*1154 * We do not mark the index itself "modified"1155 * because CE_UPTODATE flag is in-core only;1156 * we are not going to write this change out.1157 */1158if(!S_ISGITLINK(ce->ce_mode))1159ce_mark_uptodate(ce);1160return ce;1161}1162}11631164if(ie_modified(istate, ce, &st, options)) {1165if(err)1166*err = EINVAL;1167return NULL;1168}11691170 size =ce_size(ce);1171 updated =xmalloc(size);1172memcpy(updated, ce, size);1173fill_stat_cache_info(updated, &st);1174/*1175 * If ignore_valid is not set, we should leave CE_VALID bit1176 * alone. Otherwise, paths marked with --no-assume-unchanged1177 * (i.e. things to be edited) will reacquire CE_VALID bit1178 * automatically, which is not really what we want.1179 */1180if(!ignore_valid && assume_unchanged &&1181!(ce->ce_flags & CE_VALID))1182 updated->ce_flags &= ~CE_VALID;11831184/* istate->cache_changed is updated in the caller */1185return updated;1186}11871188static voidshow_file(const char* fmt,const char* name,int in_porcelain,1189int* first,const char*header_msg)1190{1191if(in_porcelain && *first && header_msg) {1192printf("%s\n", header_msg);1193*first =0;1194}1195printf(fmt, name);1196}11971198intrefresh_index(struct index_state *istate,unsigned int flags,1199const struct pathspec *pathspec,1200char*seen,const char*header_msg)1201{1202int i;1203int has_errors =0;1204int really = (flags & REFRESH_REALLY) !=0;1205int allow_unmerged = (flags & REFRESH_UNMERGED) !=0;1206int quiet = (flags & REFRESH_QUIET) !=0;1207int not_new = (flags & REFRESH_IGNORE_MISSING) !=0;1208int ignore_submodules = (flags & REFRESH_IGNORE_SUBMODULES) !=0;1209int first =1;1210int in_porcelain = (flags & REFRESH_IN_PORCELAIN);1211unsigned int options = (CE_MATCH_REFRESH |1212(really ? CE_MATCH_IGNORE_VALID :0) |1213(not_new ? CE_MATCH_IGNORE_MISSING :0));1214const char*modified_fmt;1215const char*deleted_fmt;1216const char*typechange_fmt;1217const char*added_fmt;1218const char*unmerged_fmt;12191220 modified_fmt = (in_porcelain ?"M\t%s\n":"%s: needs update\n");1221 deleted_fmt = (in_porcelain ?"D\t%s\n":"%s: needs update\n");1222 typechange_fmt = (in_porcelain ?"T\t%s\n":"%sneeds update\n");1223 added_fmt = (in_porcelain ?"A\t%s\n":"%sneeds update\n");1224 unmerged_fmt = (in_porcelain ?"U\t%s\n":"%s: needs merge\n");1225for(i =0; i < istate->cache_nr; i++) {1226struct cache_entry *ce, *new;1227int cache_errno =0;1228int changed =0;1229int filtered =0;12301231 ce = istate->cache[i];1232if(ignore_submodules &&S_ISGITLINK(ce->ce_mode))1233continue;12341235if(pathspec && !ce_path_match(ce, pathspec, seen))1236 filtered =1;12371238if(ce_stage(ce)) {1239while((i < istate->cache_nr) &&1240!strcmp(istate->cache[i]->name, ce->name))1241 i++;1242 i--;1243if(allow_unmerged)1244continue;1245if(!filtered)1246show_file(unmerged_fmt, ce->name, in_porcelain,1247&first, header_msg);1248 has_errors =1;1249continue;1250}12511252if(filtered)1253continue;12541255new=refresh_cache_ent(istate, ce, options, &cache_errno, &changed);1256if(new== ce)1257continue;1258if(!new) {1259const char*fmt;12601261if(really && cache_errno == EINVAL) {1262/* If we are doing --really-refresh that1263 * means the index is not valid anymore.1264 */1265 ce->ce_flags &= ~CE_VALID;1266 ce->ce_flags |= CE_UPDATE_IN_BASE;1267 istate->cache_changed |= CE_ENTRY_CHANGED;1268}1269if(quiet)1270continue;12711272if(cache_errno == ENOENT)1273 fmt = deleted_fmt;1274else if(ce_intent_to_add(ce))1275 fmt = added_fmt;/* must be before other checks */1276else if(changed & TYPE_CHANGED)1277 fmt = typechange_fmt;1278else1279 fmt = modified_fmt;1280show_file(fmt,1281 ce->name, in_porcelain, &first, header_msg);1282 has_errors =1;1283continue;1284}12851286replace_index_entry(istate, i,new);1287}1288return has_errors;1289}12901291struct cache_entry *refresh_cache_entry(struct cache_entry *ce,1292unsigned int options)1293{1294returnrefresh_cache_ent(&the_index, ce, options, NULL, NULL);1295}129612971298/*****************************************************************1299 * Index File I/O1300 *****************************************************************/13011302#define INDEX_FORMAT_DEFAULT 313031304static unsigned intget_index_format_default(void)1305{1306char*envversion =getenv("GIT_INDEX_VERSION");1307char*endp;1308int value;1309unsigned int version = INDEX_FORMAT_DEFAULT;13101311if(!envversion) {1312if(!git_config_get_int("index.version", &value))1313 version = value;1314if(version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) {1315warning(_("index.version set, but the value is invalid.\n"1316"Using version%i"), INDEX_FORMAT_DEFAULT);1317return INDEX_FORMAT_DEFAULT;1318}1319return version;1320}13211322 version =strtoul(envversion, &endp,10);1323if(*endp ||1324 version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < version) {1325warning(_("GIT_INDEX_VERSION set, but the value is invalid.\n"1326"Using version%i"), INDEX_FORMAT_DEFAULT);1327 version = INDEX_FORMAT_DEFAULT;1328}1329return version;1330}13311332/*1333 * dev/ino/uid/gid/size are also just tracked to the low 32 bits1334 * Again - this is just a (very strong in practice) heuristic that1335 * the inode hasn't changed.1336 *1337 * We save the fields in big-endian order to allow using the1338 * index file over NFS transparently.1339 */1340struct ondisk_cache_entry {1341struct cache_time ctime;1342struct cache_time mtime;1343uint32_t dev;1344uint32_t ino;1345uint32_t mode;1346uint32_t uid;1347uint32_t gid;1348uint32_t size;1349unsigned char sha1[20];1350uint16_t flags;1351char name[FLEX_ARRAY];/* more */1352};13531354/*1355 * This struct is used when CE_EXTENDED bit is 11356 * The struct must match ondisk_cache_entry exactly from1357 * ctime till flags1358 */1359struct ondisk_cache_entry_extended {1360struct cache_time ctime;1361struct cache_time mtime;1362uint32_t dev;1363uint32_t ino;1364uint32_t mode;1365uint32_t uid;1366uint32_t gid;1367uint32_t size;1368unsigned char sha1[20];1369uint16_t flags;1370uint16_t flags2;1371char name[FLEX_ARRAY];/* more */1372};13731374/* These are only used for v3 or lower */1375#define align_flex_name(STRUCT,len) ((offsetof(struct STRUCT,name) + (len) + 8) & ~7)1376#define ondisk_cache_entry_size(len) align_flex_name(ondisk_cache_entry,len)1377#define ondisk_cache_entry_extended_size(len) align_flex_name(ondisk_cache_entry_extended,len)1378#define ondisk_ce_size(ce) (((ce)->ce_flags & CE_EXTENDED) ? \1379 ondisk_cache_entry_extended_size(ce_namelen(ce)) : \1380 ondisk_cache_entry_size(ce_namelen(ce)))13811382static intverify_hdr(struct cache_header *hdr,unsigned long size)1383{1384 git_SHA_CTX c;1385unsigned char sha1[20];1386int hdr_version;13871388if(hdr->hdr_signature !=htonl(CACHE_SIGNATURE))1389returnerror("bad signature");1390 hdr_version =ntohl(hdr->hdr_version);1391if(hdr_version < INDEX_FORMAT_LB || INDEX_FORMAT_UB < hdr_version)1392returnerror("bad index version%d", hdr_version);1393git_SHA1_Init(&c);1394git_SHA1_Update(&c, hdr, size -20);1395git_SHA1_Final(sha1, &c);1396if(hashcmp(sha1, (unsigned char*)hdr + size -20))1397returnerror("bad index file sha1 signature");1398return0;1399}14001401static intread_index_extension(struct index_state *istate,1402const char*ext,void*data,unsigned long sz)1403{1404switch(CACHE_EXT(ext)) {1405case CACHE_EXT_TREE:1406 istate->cache_tree =cache_tree_read(data, sz);1407break;1408case CACHE_EXT_RESOLVE_UNDO:1409 istate->resolve_undo =resolve_undo_read(data, sz);1410break;1411case CACHE_EXT_LINK:1412if(read_link_extension(istate, data, sz))1413return-1;1414break;1415case CACHE_EXT_UNTRACKED:1416 istate->untracked =read_untracked_extension(data, sz);1417break;1418default:1419if(*ext <'A'||'Z'< *ext)1420returnerror("index uses %.4s extension, which we do not understand",1421 ext);1422fprintf(stderr,"ignoring %.4s extension\n", ext);1423break;1424}1425return0;1426}14271428inthold_locked_index(struct lock_file *lk,int die_on_error)1429{1430returnhold_lock_file_for_update(lk,get_index_file(),1431 die_on_error1432? LOCK_DIE_ON_ERROR1433:0);1434}14351436intread_index(struct index_state *istate)1437{1438returnread_index_from(istate,get_index_file());1439}14401441static struct cache_entry *cache_entry_from_ondisk(struct ondisk_cache_entry *ondisk,1442unsigned int flags,1443const char*name,1444size_t len)1445{1446struct cache_entry *ce =xmalloc(cache_entry_size(len));14471448 ce->ce_stat_data.sd_ctime.sec =get_be32(&ondisk->ctime.sec);1449 ce->ce_stat_data.sd_mtime.sec =get_be32(&ondisk->mtime.sec);1450 ce->ce_stat_data.sd_ctime.nsec =get_be32(&ondisk->ctime.nsec);1451 ce->ce_stat_data.sd_mtime.nsec =get_be32(&ondisk->mtime.nsec);1452 ce->ce_stat_data.sd_dev =get_be32(&ondisk->dev);1453 ce->ce_stat_data.sd_ino =get_be32(&ondisk->ino);1454 ce->ce_mode =get_be32(&ondisk->mode);1455 ce->ce_stat_data.sd_uid =get_be32(&ondisk->uid);1456 ce->ce_stat_data.sd_gid =get_be32(&ondisk->gid);1457 ce->ce_stat_data.sd_size =get_be32(&ondisk->size);1458 ce->ce_flags = flags & ~CE_NAMEMASK;1459 ce->ce_namelen = len;1460 ce->index =0;1461hashcpy(ce->oid.hash, ondisk->sha1);1462memcpy(ce->name, name, len);1463 ce->name[len] ='\0';1464return ce;1465}14661467/*1468 * Adjacent cache entries tend to share the leading paths, so it makes1469 * sense to only store the differences in later entries. In the v41470 * on-disk format of the index, each on-disk cache entry stores the1471 * number of bytes to be stripped from the end of the previous name,1472 * and the bytes to append to the result, to come up with its name.1473 */1474static unsigned longexpand_name_field(struct strbuf *name,const char*cp_)1475{1476const unsigned char*ep, *cp = (const unsigned char*)cp_;1477size_t len =decode_varint(&cp);14781479if(name->len < len)1480die("malformed name field in the index");1481strbuf_remove(name, name->len - len, len);1482for(ep = cp; *ep; ep++)1483;/* find the end */1484strbuf_add(name, cp, ep - cp);1485return(const char*)ep +1- cp_;1486}14871488static struct cache_entry *create_from_disk(struct ondisk_cache_entry *ondisk,1489unsigned long*ent_size,1490struct strbuf *previous_name)1491{1492struct cache_entry *ce;1493size_t len;1494const char*name;1495unsigned int flags;14961497/* On-disk flags are just 16 bits */1498 flags =get_be16(&ondisk->flags);1499 len = flags & CE_NAMEMASK;15001501if(flags & CE_EXTENDED) {1502struct ondisk_cache_entry_extended *ondisk2;1503int extended_flags;1504 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;1505 extended_flags =get_be16(&ondisk2->flags2) <<16;1506/* We do not yet understand any bit out of CE_EXTENDED_FLAGS */1507if(extended_flags & ~CE_EXTENDED_FLAGS)1508die("Unknown index entry format%08x", extended_flags);1509 flags |= extended_flags;1510 name = ondisk2->name;1511}1512else1513 name = ondisk->name;15141515if(!previous_name) {1516/* v3 and earlier */1517if(len == CE_NAMEMASK)1518 len =strlen(name);1519 ce =cache_entry_from_ondisk(ondisk, flags, name, len);15201521*ent_size =ondisk_ce_size(ce);1522}else{1523unsigned long consumed;1524 consumed =expand_name_field(previous_name, name);1525 ce =cache_entry_from_ondisk(ondisk, flags,1526 previous_name->buf,1527 previous_name->len);15281529*ent_size = (name - ((char*)ondisk)) + consumed;1530}1531return ce;1532}15331534static voidcheck_ce_order(struct index_state *istate)1535{1536unsigned int i;15371538for(i =1; i < istate->cache_nr; i++) {1539struct cache_entry *ce = istate->cache[i -1];1540struct cache_entry *next_ce = istate->cache[i];1541int name_compare =strcmp(ce->name, next_ce->name);15421543if(0< name_compare)1544die("unordered stage entries in index");1545if(!name_compare) {1546if(!ce_stage(ce))1547die("multiple stage entries for merged file '%s'",1548 ce->name);1549if(ce_stage(ce) >ce_stage(next_ce))1550die("unordered stage entries for '%s'",1551 ce->name);1552}1553}1554}15551556static voidtweak_untracked_cache(struct index_state *istate)1557{1558switch(git_config_get_untracked_cache()) {1559case-1:/* keep: do nothing */1560break;1561case0:/* false */1562remove_untracked_cache(istate);1563break;1564case1:/* true */1565add_untracked_cache(istate);1566break;1567default:/* unknown value: do nothing */1568break;1569}1570}15711572static voidpost_read_index_from(struct index_state *istate)1573{1574check_ce_order(istate);1575tweak_untracked_cache(istate);1576}15771578/* remember to discard_cache() before reading a different cache! */1579intdo_read_index(struct index_state *istate,const char*path,int must_exist)1580{1581int fd, i;1582struct stat st;1583unsigned long src_offset;1584struct cache_header *hdr;1585void*mmap;1586size_t mmap_size;1587struct strbuf previous_name_buf = STRBUF_INIT, *previous_name;15881589if(istate->initialized)1590return istate->cache_nr;15911592 istate->timestamp.sec =0;1593 istate->timestamp.nsec =0;1594 fd =open(path, O_RDONLY);1595if(fd <0) {1596if(!must_exist && errno == ENOENT)1597return0;1598die_errno("%s: index file open failed", path);1599}16001601if(fstat(fd, &st))1602die_errno("cannot stat the open index");16031604 mmap_size =xsize_t(st.st_size);1605if(mmap_size <sizeof(struct cache_header) +20)1606die("index file smaller than expected");16071608 mmap =xmmap(NULL, mmap_size, PROT_READ, MAP_PRIVATE, fd,0);1609if(mmap == MAP_FAILED)1610die_errno("unable to map index file");1611close(fd);16121613 hdr = mmap;1614if(verify_hdr(hdr, mmap_size) <0)1615goto unmap;16161617hashcpy(istate->sha1, (const unsigned char*)hdr + mmap_size -20);1618 istate->version =ntohl(hdr->hdr_version);1619 istate->cache_nr =ntohl(hdr->hdr_entries);1620 istate->cache_alloc =alloc_nr(istate->cache_nr);1621 istate->cache =xcalloc(istate->cache_alloc,sizeof(*istate->cache));1622 istate->initialized =1;16231624if(istate->version ==4)1625 previous_name = &previous_name_buf;1626else1627 previous_name = NULL;16281629 src_offset =sizeof(*hdr);1630for(i =0; i < istate->cache_nr; i++) {1631struct ondisk_cache_entry *disk_ce;1632struct cache_entry *ce;1633unsigned long consumed;16341635 disk_ce = (struct ondisk_cache_entry *)((char*)mmap + src_offset);1636 ce =create_from_disk(disk_ce, &consumed, previous_name);1637set_index_entry(istate, i, ce);16381639 src_offset += consumed;1640}1641strbuf_release(&previous_name_buf);1642 istate->timestamp.sec = st.st_mtime;1643 istate->timestamp.nsec =ST_MTIME_NSEC(st);16441645while(src_offset <= mmap_size -20-8) {1646/* After an array of active_nr index entries,1647 * there can be arbitrary number of extended1648 * sections, each of which is prefixed with1649 * extension name (4-byte) and section length1650 * in 4-byte network byte order.1651 */1652uint32_t extsize;1653memcpy(&extsize, (char*)mmap + src_offset +4,4);1654 extsize =ntohl(extsize);1655if(read_index_extension(istate,1656(const char*) mmap + src_offset,1657(char*) mmap + src_offset +8,1658 extsize) <0)1659goto unmap;1660 src_offset +=8;1661 src_offset += extsize;1662}1663munmap(mmap, mmap_size);1664return istate->cache_nr;16651666unmap:1667munmap(mmap, mmap_size);1668die("index file corrupt");1669}16701671intread_index_from(struct index_state *istate,const char*path)1672{1673struct split_index *split_index;1674int ret;16751676/* istate->initialized covers both .git/index and .git/sharedindex.xxx */1677if(istate->initialized)1678return istate->cache_nr;16791680 ret =do_read_index(istate, path,0);16811682 split_index = istate->split_index;1683if(!split_index ||is_null_sha1(split_index->base_sha1)) {1684post_read_index_from(istate);1685return ret;1686}16871688if(split_index->base)1689discard_index(split_index->base);1690else1691 split_index->base =xcalloc(1,sizeof(*split_index->base));1692 ret =do_read_index(split_index->base,1693git_path("sharedindex.%s",1694sha1_to_hex(split_index->base_sha1)),1);1695if(hashcmp(split_index->base_sha1, split_index->base->sha1))1696die("broken index, expect%sin%s, got%s",1697sha1_to_hex(split_index->base_sha1),1698git_path("sharedindex.%s",1699sha1_to_hex(split_index->base_sha1)),1700sha1_to_hex(split_index->base->sha1));1701merge_base_index(istate);1702post_read_index_from(istate);1703return ret;1704}17051706intis_index_unborn(struct index_state *istate)1707{1708return(!istate->cache_nr && !istate->timestamp.sec);1709}17101711intdiscard_index(struct index_state *istate)1712{1713int i;17141715for(i =0; i < istate->cache_nr; i++) {1716if(istate->cache[i]->index &&1717 istate->split_index &&1718 istate->split_index->base &&1719 istate->cache[i]->index <= istate->split_index->base->cache_nr &&1720 istate->cache[i] == istate->split_index->base->cache[istate->cache[i]->index -1])1721continue;1722free(istate->cache[i]);1723}1724resolve_undo_clear_index(istate);1725 istate->cache_nr =0;1726 istate->cache_changed =0;1727 istate->timestamp.sec =0;1728 istate->timestamp.nsec =0;1729free_name_hash(istate);1730cache_tree_free(&(istate->cache_tree));1731 istate->initialized =0;1732free(istate->cache);1733 istate->cache = NULL;1734 istate->cache_alloc =0;1735discard_split_index(istate);1736free_untracked_cache(istate->untracked);1737 istate->untracked = NULL;1738return0;1739}17401741intunmerged_index(const struct index_state *istate)1742{1743int i;1744for(i =0; i < istate->cache_nr; i++) {1745if(ce_stage(istate->cache[i]))1746return1;1747}1748return0;1749}17501751#define WRITE_BUFFER_SIZE 81921752static unsigned char write_buffer[WRITE_BUFFER_SIZE];1753static unsigned long write_buffer_len;17541755static intce_write_flush(git_SHA_CTX *context,int fd)1756{1757unsigned int buffered = write_buffer_len;1758if(buffered) {1759git_SHA1_Update(context, write_buffer, buffered);1760if(write_in_full(fd, write_buffer, buffered) != buffered)1761return-1;1762 write_buffer_len =0;1763}1764return0;1765}17661767static intce_write(git_SHA_CTX *context,int fd,void*data,unsigned int len)1768{1769while(len) {1770unsigned int buffered = write_buffer_len;1771unsigned int partial = WRITE_BUFFER_SIZE - buffered;1772if(partial > len)1773 partial = len;1774memcpy(write_buffer + buffered, data, partial);1775 buffered += partial;1776if(buffered == WRITE_BUFFER_SIZE) {1777 write_buffer_len = buffered;1778if(ce_write_flush(context, fd))1779return-1;1780 buffered =0;1781}1782 write_buffer_len = buffered;1783 len -= partial;1784 data = (char*) data + partial;1785}1786return0;1787}17881789static intwrite_index_ext_header(git_SHA_CTX *context,int fd,1790unsigned int ext,unsigned int sz)1791{1792 ext =htonl(ext);1793 sz =htonl(sz);1794return((ce_write(context, fd, &ext,4) <0) ||1795(ce_write(context, fd, &sz,4) <0)) ? -1:0;1796}17971798static intce_flush(git_SHA_CTX *context,int fd,unsigned char*sha1)1799{1800unsigned int left = write_buffer_len;18011802if(left) {1803 write_buffer_len =0;1804git_SHA1_Update(context, write_buffer, left);1805}18061807/* Flush first if not enough space for SHA1 signature */1808if(left +20> WRITE_BUFFER_SIZE) {1809if(write_in_full(fd, write_buffer, left) != left)1810return-1;1811 left =0;1812}18131814/* Append the SHA1 signature at the end */1815git_SHA1_Final(write_buffer + left, context);1816hashcpy(sha1, write_buffer + left);1817 left +=20;1818return(write_in_full(fd, write_buffer, left) != left) ? -1:0;1819}18201821static voidce_smudge_racily_clean_entry(struct cache_entry *ce)1822{1823/*1824 * The only thing we care about in this function is to smudge the1825 * falsely clean entry due to touch-update-touch race, so we leave1826 * everything else as they are. We are called for entries whose1827 * ce_stat_data.sd_mtime match the index file mtime.1828 *1829 * Note that this actually does not do much for gitlinks, for1830 * which ce_match_stat_basic() always goes to the actual1831 * contents. The caller checks with is_racy_timestamp() which1832 * always says "no" for gitlinks, so we are not called for them ;-)1833 */1834struct stat st;18351836if(lstat(ce->name, &st) <0)1837return;1838if(ce_match_stat_basic(ce, &st))1839return;1840if(ce_modified_check_fs(ce, &st)) {1841/* This is "racily clean"; smudge it. Note that this1842 * is a tricky code. At first glance, it may appear1843 * that it can break with this sequence:1844 *1845 * $ echo xyzzy >frotz1846 * $ git-update-index --add frotz1847 * $ : >frotz1848 * $ sleep 31849 * $ echo filfre >nitfol1850 * $ git-update-index --add nitfol1851 *1852 * but it does not. When the second update-index runs,1853 * it notices that the entry "frotz" has the same timestamp1854 * as index, and if we were to smudge it by resetting its1855 * size to zero here, then the object name recorded1856 * in index is the 6-byte file but the cached stat information1857 * becomes zero --- which would then match what we would1858 * obtain from the filesystem next time we stat("frotz").1859 *1860 * However, the second update-index, before calling1861 * this function, notices that the cached size is 61862 * bytes and what is on the filesystem is an empty1863 * file, and never calls us, so the cached size information1864 * for "frotz" stays 6 which does not match the filesystem.1865 */1866 ce->ce_stat_data.sd_size =0;1867}1868}18691870/* Copy miscellaneous fields but not the name */1871static char*copy_cache_entry_to_ondisk(struct ondisk_cache_entry *ondisk,1872struct cache_entry *ce)1873{1874short flags;18751876 ondisk->ctime.sec =htonl(ce->ce_stat_data.sd_ctime.sec);1877 ondisk->mtime.sec =htonl(ce->ce_stat_data.sd_mtime.sec);1878 ondisk->ctime.nsec =htonl(ce->ce_stat_data.sd_ctime.nsec);1879 ondisk->mtime.nsec =htonl(ce->ce_stat_data.sd_mtime.nsec);1880 ondisk->dev =htonl(ce->ce_stat_data.sd_dev);1881 ondisk->ino =htonl(ce->ce_stat_data.sd_ino);1882 ondisk->mode =htonl(ce->ce_mode);1883 ondisk->uid =htonl(ce->ce_stat_data.sd_uid);1884 ondisk->gid =htonl(ce->ce_stat_data.sd_gid);1885 ondisk->size =htonl(ce->ce_stat_data.sd_size);1886hashcpy(ondisk->sha1, ce->oid.hash);18871888 flags = ce->ce_flags & ~CE_NAMEMASK;1889 flags |= (ce_namelen(ce) >= CE_NAMEMASK ? CE_NAMEMASK :ce_namelen(ce));1890 ondisk->flags =htons(flags);1891if(ce->ce_flags & CE_EXTENDED) {1892struct ondisk_cache_entry_extended *ondisk2;1893 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;1894 ondisk2->flags2 =htons((ce->ce_flags & CE_EXTENDED_FLAGS) >>16);1895return ondisk2->name;1896}1897else{1898return ondisk->name;1899}1900}19011902static intce_write_entry(git_SHA_CTX *c,int fd,struct cache_entry *ce,1903struct strbuf *previous_name)1904{1905int size;1906struct ondisk_cache_entry *ondisk;1907int saved_namelen = saved_namelen;/* compiler workaround */1908char*name;1909int result;19101911if(ce->ce_flags & CE_STRIP_NAME) {1912 saved_namelen =ce_namelen(ce);1913 ce->ce_namelen =0;1914}19151916if(!previous_name) {1917 size =ondisk_ce_size(ce);1918 ondisk =xcalloc(1, size);1919 name =copy_cache_entry_to_ondisk(ondisk, ce);1920memcpy(name, ce->name,ce_namelen(ce));1921}else{1922int common, to_remove, prefix_size;1923unsigned char to_remove_vi[16];1924for(common =0;1925(ce->name[common] &&1926 common < previous_name->len &&1927 ce->name[common] == previous_name->buf[common]);1928 common++)1929;/* still matching */1930 to_remove = previous_name->len - common;1931 prefix_size =encode_varint(to_remove, to_remove_vi);19321933if(ce->ce_flags & CE_EXTENDED)1934 size =offsetof(struct ondisk_cache_entry_extended, name);1935else1936 size =offsetof(struct ondisk_cache_entry, name);1937 size += prefix_size + (ce_namelen(ce) - common +1);19381939 ondisk =xcalloc(1, size);1940 name =copy_cache_entry_to_ondisk(ondisk, ce);1941memcpy(name, to_remove_vi, prefix_size);1942memcpy(name + prefix_size, ce->name + common,ce_namelen(ce) - common);19431944strbuf_splice(previous_name, common, to_remove,1945 ce->name + common,ce_namelen(ce) - common);1946}1947if(ce->ce_flags & CE_STRIP_NAME) {1948 ce->ce_namelen = saved_namelen;1949 ce->ce_flags &= ~CE_STRIP_NAME;1950}19511952 result =ce_write(c, fd, ondisk, size);1953free(ondisk);1954return result;1955}19561957/*1958 * This function verifies if index_state has the correct sha1 of the1959 * index file. Don't die if we have any other failure, just return 0.1960 */1961static intverify_index_from(const struct index_state *istate,const char*path)1962{1963int fd;1964 ssize_t n;1965struct stat st;1966unsigned char sha1[20];19671968if(!istate->initialized)1969return0;19701971 fd =open(path, O_RDONLY);1972if(fd <0)1973return0;19741975if(fstat(fd, &st))1976goto out;19771978if(st.st_size <sizeof(struct cache_header) +20)1979goto out;19801981 n =pread_in_full(fd, sha1,20, st.st_size -20);1982if(n !=20)1983goto out;19841985if(hashcmp(istate->sha1, sha1))1986goto out;19871988close(fd);1989return1;19901991out:1992close(fd);1993return0;1994}19951996static intverify_index(const struct index_state *istate)1997{1998returnverify_index_from(istate,get_index_file());1999}20002001static inthas_racy_timestamp(struct index_state *istate)2002{2003int entries = istate->cache_nr;2004int i;20052006for(i =0; i < entries; i++) {2007struct cache_entry *ce = istate->cache[i];2008if(is_racy_timestamp(istate, ce))2009return1;2010}2011return0;2012}20132014/*2015 * Opportunistically update the index but do not complain if we can't2016 */2017voidupdate_index_if_able(struct index_state *istate,struct lock_file *lockfile)2018{2019if((istate->cache_changed ||has_racy_timestamp(istate)) &&2020verify_index(istate) &&2021write_locked_index(istate, lockfile, COMMIT_LOCK))2022rollback_lock_file(lockfile);2023}20242025static intdo_write_index(struct index_state *istate,int newfd,2026int strip_extensions)2027{2028 git_SHA_CTX c;2029struct cache_header hdr;2030int i, err, removed, extended, hdr_version;2031struct cache_entry **cache = istate->cache;2032int entries = istate->cache_nr;2033struct stat st;2034struct strbuf previous_name_buf = STRBUF_INIT, *previous_name;20352036for(i = removed = extended =0; i < entries; i++) {2037if(cache[i]->ce_flags & CE_REMOVE)2038 removed++;20392040/* reduce extended entries if possible */2041 cache[i]->ce_flags &= ~CE_EXTENDED;2042if(cache[i]->ce_flags & CE_EXTENDED_FLAGS) {2043 extended++;2044 cache[i]->ce_flags |= CE_EXTENDED;2045}2046}20472048if(!istate->version) {2049 istate->version =get_index_format_default();2050if(getenv("GIT_TEST_SPLIT_INDEX"))2051init_split_index(istate);2052}20532054/* demote version 3 to version 2 when the latter suffices */2055if(istate->version ==3|| istate->version ==2)2056 istate->version = extended ?3:2;20572058 hdr_version = istate->version;20592060 hdr.hdr_signature =htonl(CACHE_SIGNATURE);2061 hdr.hdr_version =htonl(hdr_version);2062 hdr.hdr_entries =htonl(entries - removed);20632064git_SHA1_Init(&c);2065if(ce_write(&c, newfd, &hdr,sizeof(hdr)) <0)2066return-1;20672068 previous_name = (hdr_version ==4) ? &previous_name_buf : NULL;2069for(i =0; i < entries; i++) {2070struct cache_entry *ce = cache[i];2071if(ce->ce_flags & CE_REMOVE)2072continue;2073if(!ce_uptodate(ce) &&is_racy_timestamp(istate, ce))2074ce_smudge_racily_clean_entry(ce);2075if(is_null_oid(&ce->oid)) {2076static const char msg[] ="cache entry has null sha1:%s";2077static int allow = -1;20782079if(allow <0)2080 allow =git_env_bool("GIT_ALLOW_NULL_SHA1",0);2081if(allow)2082warning(msg, ce->name);2083else2084returnerror(msg, ce->name);2085}2086if(ce_write_entry(&c, newfd, ce, previous_name) <0)2087return-1;2088}2089strbuf_release(&previous_name_buf);20902091/* Write extension data here */2092if(!strip_extensions && istate->split_index) {2093struct strbuf sb = STRBUF_INIT;20942095 err =write_link_extension(&sb, istate) <0||2096write_index_ext_header(&c, newfd, CACHE_EXT_LINK,2097 sb.len) <0||2098ce_write(&c, newfd, sb.buf, sb.len) <0;2099strbuf_release(&sb);2100if(err)2101return-1;2102}2103if(!strip_extensions && istate->cache_tree) {2104struct strbuf sb = STRBUF_INIT;21052106cache_tree_write(&sb, istate->cache_tree);2107 err =write_index_ext_header(&c, newfd, CACHE_EXT_TREE, sb.len) <02108||ce_write(&c, newfd, sb.buf, sb.len) <0;2109strbuf_release(&sb);2110if(err)2111return-1;2112}2113if(!strip_extensions && istate->resolve_undo) {2114struct strbuf sb = STRBUF_INIT;21152116resolve_undo_write(&sb, istate->resolve_undo);2117 err =write_index_ext_header(&c, newfd, CACHE_EXT_RESOLVE_UNDO,2118 sb.len) <02119||ce_write(&c, newfd, sb.buf, sb.len) <0;2120strbuf_release(&sb);2121if(err)2122return-1;2123}2124if(!strip_extensions && istate->untracked) {2125struct strbuf sb = STRBUF_INIT;21262127write_untracked_extension(&sb, istate->untracked);2128 err =write_index_ext_header(&c, newfd, CACHE_EXT_UNTRACKED,2129 sb.len) <0||2130ce_write(&c, newfd, sb.buf, sb.len) <0;2131strbuf_release(&sb);2132if(err)2133return-1;2134}21352136if(ce_flush(&c, newfd, istate->sha1) ||fstat(newfd, &st))2137return-1;2138 istate->timestamp.sec = (unsigned int)st.st_mtime;2139 istate->timestamp.nsec =ST_MTIME_NSEC(st);2140return0;2141}21422143voidset_alternate_index_output(const char*name)2144{2145 alternate_index_output = name;2146}21472148static intcommit_locked_index(struct lock_file *lk)2149{2150if(alternate_index_output)2151returncommit_lock_file_to(lk, alternate_index_output);2152else2153returncommit_lock_file(lk);2154}21552156static intdo_write_locked_index(struct index_state *istate,struct lock_file *lock,2157unsigned flags)2158{2159int ret =do_write_index(istate,get_lock_file_fd(lock),0);2160if(ret)2161return ret;2162assert((flags & (COMMIT_LOCK | CLOSE_LOCK)) !=2163(COMMIT_LOCK | CLOSE_LOCK));2164if(flags & COMMIT_LOCK)2165returncommit_locked_index(lock);2166else if(flags & CLOSE_LOCK)2167returnclose_lock_file(lock);2168else2169return ret;2170}21712172static intwrite_split_index(struct index_state *istate,2173struct lock_file *lock,2174unsigned flags)2175{2176int ret;2177prepare_to_write_split_index(istate);2178 ret =do_write_locked_index(istate, lock, flags);2179finish_writing_split_index(istate);2180return ret;2181}21822183static struct tempfile temporary_sharedindex;21842185static intwrite_shared_index(struct index_state *istate,2186struct lock_file *lock,unsigned flags)2187{2188struct split_index *si = istate->split_index;2189int fd, ret;21902191 fd =mks_tempfile(&temporary_sharedindex,git_path("sharedindex_XXXXXX"));2192if(fd <0) {2193hashclr(si->base_sha1);2194returndo_write_locked_index(istate, lock, flags);2195}2196move_cache_to_base_index(istate);2197 ret =do_write_index(si->base, fd,1);2198if(ret) {2199delete_tempfile(&temporary_sharedindex);2200return ret;2201}2202 ret =rename_tempfile(&temporary_sharedindex,2203git_path("sharedindex.%s",sha1_to_hex(si->base->sha1)));2204if(!ret)2205hashcpy(si->base_sha1, si->base->sha1);2206return ret;2207}22082209intwrite_locked_index(struct index_state *istate,struct lock_file *lock,2210unsigned flags)2211{2212struct split_index *si = istate->split_index;22132214if(!si || alternate_index_output ||2215(istate->cache_changed & ~EXTMASK)) {2216if(si)2217hashclr(si->base_sha1);2218returndo_write_locked_index(istate, lock, flags);2219}22202221if(getenv("GIT_TEST_SPLIT_INDEX")) {2222int v = si->base_sha1[0];2223if((v &15) <6)2224 istate->cache_changed |= SPLIT_INDEX_ORDERED;2225}2226if(istate->cache_changed & SPLIT_INDEX_ORDERED) {2227int ret =write_shared_index(istate, lock, flags);2228if(ret)2229return ret;2230}22312232returnwrite_split_index(istate, lock, flags);2233}22342235/*2236 * Read the index file that is potentially unmerged into given2237 * index_state, dropping any unmerged entries. Returns true if2238 * the index is unmerged. Callers who want to refuse to work2239 * from an unmerged state can call this and check its return value,2240 * instead of calling read_cache().2241 */2242intread_index_unmerged(struct index_state *istate)2243{2244int i;2245int unmerged =0;22462247read_index(istate);2248for(i =0; i < istate->cache_nr; i++) {2249struct cache_entry *ce = istate->cache[i];2250struct cache_entry *new_ce;2251int size, len;22522253if(!ce_stage(ce))2254continue;2255 unmerged =1;2256 len =ce_namelen(ce);2257 size =cache_entry_size(len);2258 new_ce =xcalloc(1, size);2259memcpy(new_ce->name, ce->name, len);2260 new_ce->ce_flags =create_ce_flags(0) | CE_CONFLICTED;2261 new_ce->ce_namelen = len;2262 new_ce->ce_mode = ce->ce_mode;2263if(add_index_entry(istate, new_ce,0))2264returnerror("%s: cannot drop to stage #0",2265 new_ce->name);2266}2267return unmerged;2268}22692270/*2271 * Returns 1 if the path is an "other" path with respect to2272 * the index; that is, the path is not mentioned in the index at all,2273 * either as a file, a directory with some files in the index,2274 * or as an unmerged entry.2275 *2276 * We helpfully remove a trailing "/" from directories so that2277 * the output of read_directory can be used as-is.2278 */2279intindex_name_is_other(const struct index_state *istate,const char*name,2280int namelen)2281{2282int pos;2283if(namelen && name[namelen -1] =='/')2284 namelen--;2285 pos =index_name_pos(istate, name, namelen);2286if(0<= pos)2287return0;/* exact match */2288 pos = -pos -1;2289if(pos < istate->cache_nr) {2290struct cache_entry *ce = istate->cache[pos];2291if(ce_namelen(ce) == namelen &&2292!memcmp(ce->name, name, namelen))2293return0;/* Yup, this one exists unmerged */2294}2295return1;2296}22972298void*read_blob_data_from_index(struct index_state *istate,const char*path,unsigned long*size)2299{2300int pos, len;2301unsigned long sz;2302enum object_type type;2303void*data;23042305 len =strlen(path);2306 pos =index_name_pos(istate, path, len);2307if(pos <0) {2308/*2309 * We might be in the middle of a merge, in which2310 * case we would read stage #2 (ours).2311 */2312int i;2313for(i = -pos -1;2314(pos <0&& i < istate->cache_nr &&2315!strcmp(istate->cache[i]->name, path));2316 i++)2317if(ce_stage(istate->cache[i]) ==2)2318 pos = i;2319}2320if(pos <0)2321return NULL;2322 data =read_sha1_file(istate->cache[pos]->oid.hash, &type, &sz);2323if(!data || type != OBJ_BLOB) {2324free(data);2325return NULL;2326}2327if(size)2328*size = sz;2329return data;2330}23312332voidstat_validity_clear(struct stat_validity *sv)2333{2334free(sv->sd);2335 sv->sd = NULL;2336}23372338intstat_validity_check(struct stat_validity *sv,const char*path)2339{2340struct stat st;23412342if(stat(path, &st) <0)2343return sv->sd == NULL;2344if(!sv->sd)2345return0;2346returnS_ISREG(st.st_mode) && !match_stat_data(sv->sd, &st);2347}23482349voidstat_validity_update(struct stat_validity *sv,int fd)2350{2351struct stat st;23522353if(fstat(fd, &st) <0|| !S_ISREG(st.st_mode))2354stat_validity_clear(sv);2355else{2356if(!sv->sd)2357 sv->sd =xcalloc(1,sizeof(struct stat_data));2358fill_stat_data(sv->sd, &st);2359}2360}