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"cache-tree.h" 9#include"refs.h" 10#include"dir.h" 11#include"tree.h" 12#include"commit.h" 13#include"blob.h" 14#include"resolve-undo.h" 15 16static struct cache_entry *refresh_cache_entry(struct cache_entry *ce,int really); 17 18/* Index extensions. 19 * 20 * The first letter should be 'A'..'Z' for extensions that are not 21 * necessary for a correct operation (i.e. optimization data). 22 * When new extensions are added that _needs_ to be understood in 23 * order to correctly interpret the index file, pick character that 24 * is outside the range, to cause the reader to abort. 25 */ 26 27#define CACHE_EXT(s) ( (s[0]<<24)|(s[1]<<16)|(s[2]<<8)|(s[3]) ) 28#define CACHE_EXT_TREE 0x54524545/* "TREE" */ 29#define CACHE_EXT_RESOLVE_UNDO 0x52455543/* "REUN" */ 30 31struct index_state the_index; 32 33static voidset_index_entry(struct index_state *istate,int nr,struct cache_entry *ce) 34{ 35 istate->cache[nr] = ce; 36add_name_hash(istate, ce); 37} 38 39static voidreplace_index_entry(struct index_state *istate,int nr,struct cache_entry *ce) 40{ 41struct cache_entry *old = istate->cache[nr]; 42 43remove_name_hash(old); 44set_index_entry(istate, nr, ce); 45 istate->cache_changed =1; 46} 47 48voidrename_index_entry_at(struct index_state *istate,int nr,const char*new_name) 49{ 50struct cache_entry *old = istate->cache[nr], *new; 51int namelen =strlen(new_name); 52 53new=xmalloc(cache_entry_size(namelen)); 54copy_cache_entry(new, old); 55new->ce_flags &= ~(CE_STATE_MASK | CE_NAMEMASK); 56new->ce_flags |= (namelen >= CE_NAMEMASK ? CE_NAMEMASK : namelen); 57memcpy(new->name, new_name, namelen +1); 58 59cache_tree_invalidate_path(istate->cache_tree, old->name); 60remove_index_entry_at(istate, nr); 61add_index_entry(istate,new, ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE); 62} 63 64/* 65 * This only updates the "non-critical" parts of the directory 66 * cache, ie the parts that aren't tracked by GIT, and only used 67 * to validate the cache. 68 */ 69voidfill_stat_cache_info(struct cache_entry *ce,struct stat *st) 70{ 71 ce->ce_ctime.sec = (unsigned int)st->st_ctime; 72 ce->ce_mtime.sec = (unsigned int)st->st_mtime; 73 ce->ce_ctime.nsec =ST_CTIME_NSEC(*st); 74 ce->ce_mtime.nsec =ST_MTIME_NSEC(*st); 75 ce->ce_dev = st->st_dev; 76 ce->ce_ino = st->st_ino; 77 ce->ce_uid = st->st_uid; 78 ce->ce_gid = st->st_gid; 79 ce->ce_size = st->st_size; 80 81if(assume_unchanged) 82 ce->ce_flags |= CE_VALID; 83 84if(S_ISREG(st->st_mode)) 85ce_mark_uptodate(ce); 86} 87 88static intce_compare_data(struct cache_entry *ce,struct stat *st) 89{ 90int match = -1; 91int fd =open(ce->name, O_RDONLY); 92 93if(fd >=0) { 94unsigned char sha1[20]; 95if(!index_fd(sha1, fd, st,0, OBJ_BLOB, ce->name)) 96 match =hashcmp(sha1, ce->sha1); 97/* index_fd() closed the file descriptor already */ 98} 99return match; 100} 101 102static intce_compare_link(struct cache_entry *ce,size_t expected_size) 103{ 104int match = -1; 105void*buffer; 106unsigned long size; 107enum object_type type; 108struct strbuf sb = STRBUF_INIT; 109 110if(strbuf_readlink(&sb, ce->name, expected_size)) 111return-1; 112 113 buffer =read_sha1_file(ce->sha1, &type, &size); 114if(buffer) { 115if(size == sb.len) 116 match =memcmp(buffer, sb.buf, size); 117free(buffer); 118} 119strbuf_release(&sb); 120return match; 121} 122 123static intce_compare_gitlink(struct cache_entry *ce) 124{ 125unsigned char sha1[20]; 126 127/* 128 * We don't actually require that the .git directory 129 * under GITLINK directory be a valid git directory. It 130 * might even be missing (in case nobody populated that 131 * sub-project). 132 * 133 * If so, we consider it always to match. 134 */ 135if(resolve_gitlink_ref(ce->name,"HEAD", sha1) <0) 136return0; 137returnhashcmp(sha1, ce->sha1); 138} 139 140static intce_modified_check_fs(struct cache_entry *ce,struct stat *st) 141{ 142switch(st->st_mode & S_IFMT) { 143case S_IFREG: 144if(ce_compare_data(ce, st)) 145return DATA_CHANGED; 146break; 147case S_IFLNK: 148if(ce_compare_link(ce,xsize_t(st->st_size))) 149return DATA_CHANGED; 150break; 151case S_IFDIR: 152if(S_ISGITLINK(ce->ce_mode)) 153returnce_compare_gitlink(ce) ? DATA_CHANGED :0; 154default: 155return TYPE_CHANGED; 156} 157return0; 158} 159 160static intis_empty_blob_sha1(const unsigned char*sha1) 161{ 162static const unsigned char empty_blob_sha1[20] = { 1630xe6,0x9d,0xe2,0x9b,0xb2,0xd1,0xd6,0x43,0x4b,0x8b, 1640x29,0xae,0x77,0x5a,0xd8,0xc2,0xe4,0x8c,0x53,0x91 165}; 166 167return!hashcmp(sha1, empty_blob_sha1); 168} 169 170static intce_match_stat_basic(struct cache_entry *ce,struct stat *st) 171{ 172unsigned int changed =0; 173 174if(ce->ce_flags & CE_REMOVE) 175return MODE_CHANGED | DATA_CHANGED | TYPE_CHANGED; 176 177switch(ce->ce_mode & S_IFMT) { 178case S_IFREG: 179 changed |= !S_ISREG(st->st_mode) ? TYPE_CHANGED :0; 180/* We consider only the owner x bit to be relevant for 181 * "mode changes" 182 */ 183if(trust_executable_bit && 184(0100& (ce->ce_mode ^ st->st_mode))) 185 changed |= MODE_CHANGED; 186break; 187case S_IFLNK: 188if(!S_ISLNK(st->st_mode) && 189(has_symlinks || !S_ISREG(st->st_mode))) 190 changed |= TYPE_CHANGED; 191break; 192case S_IFGITLINK: 193/* We ignore most of the st_xxx fields for gitlinks */ 194if(!S_ISDIR(st->st_mode)) 195 changed |= TYPE_CHANGED; 196else if(ce_compare_gitlink(ce)) 197 changed |= DATA_CHANGED; 198return changed; 199default: 200die("internal error: ce_mode is%o", ce->ce_mode); 201} 202if(ce->ce_mtime.sec != (unsigned int)st->st_mtime) 203 changed |= MTIME_CHANGED; 204if(trust_ctime && ce->ce_ctime.sec != (unsigned int)st->st_ctime) 205 changed |= CTIME_CHANGED; 206 207#ifdef USE_NSEC 208if(ce->ce_mtime.nsec !=ST_MTIME_NSEC(*st)) 209 changed |= MTIME_CHANGED; 210if(trust_ctime && ce->ce_ctime.nsec !=ST_CTIME_NSEC(*st)) 211 changed |= CTIME_CHANGED; 212#endif 213 214if(ce->ce_uid != (unsigned int) st->st_uid || 215 ce->ce_gid != (unsigned int) st->st_gid) 216 changed |= OWNER_CHANGED; 217if(ce->ce_ino != (unsigned int) st->st_ino) 218 changed |= INODE_CHANGED; 219 220#ifdef USE_STDEV 221/* 222 * st_dev breaks on network filesystems where different 223 * clients will have different views of what "device" 224 * the filesystem is on 225 */ 226if(ce->ce_dev != (unsigned int) st->st_dev) 227 changed |= INODE_CHANGED; 228#endif 229 230if(ce->ce_size != (unsigned int) st->st_size) 231 changed |= DATA_CHANGED; 232 233/* Racily smudged entry? */ 234if(!ce->ce_size) { 235if(!is_empty_blob_sha1(ce->sha1)) 236 changed |= DATA_CHANGED; 237} 238 239return changed; 240} 241 242static intis_racy_timestamp(const struct index_state *istate,struct cache_entry *ce) 243{ 244return(!S_ISGITLINK(ce->ce_mode) && 245 istate->timestamp.sec && 246#ifdef USE_NSEC 247/* nanosecond timestamped files can also be racy! */ 248(istate->timestamp.sec < ce->ce_mtime.sec || 249(istate->timestamp.sec == ce->ce_mtime.sec && 250 istate->timestamp.nsec <= ce->ce_mtime.nsec)) 251#else 252 istate->timestamp.sec <= ce->ce_mtime.sec 253#endif 254); 255} 256 257intie_match_stat(const struct index_state *istate, 258struct cache_entry *ce,struct stat *st, 259unsigned int options) 260{ 261unsigned int changed; 262int ignore_valid = options & CE_MATCH_IGNORE_VALID; 263int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE; 264int assume_racy_is_modified = options & CE_MATCH_RACY_IS_DIRTY; 265 266/* 267 * If it's marked as always valid in the index, it's 268 * valid whatever the checked-out copy says. 269 * 270 * skip-worktree has the same effect with higher precedence 271 */ 272if(!ignore_skip_worktree &&ce_skip_worktree(ce)) 273return0; 274if(!ignore_valid && (ce->ce_flags & CE_VALID)) 275return0; 276 277/* 278 * Intent-to-add entries have not been added, so the index entry 279 * by definition never matches what is in the work tree until it 280 * actually gets added. 281 */ 282if(ce->ce_flags & CE_INTENT_TO_ADD) 283return DATA_CHANGED | TYPE_CHANGED | MODE_CHANGED; 284 285 changed =ce_match_stat_basic(ce, st); 286 287/* 288 * Within 1 second of this sequence: 289 * echo xyzzy >file && git-update-index --add file 290 * running this command: 291 * echo frotz >file 292 * would give a falsely clean cache entry. The mtime and 293 * length match the cache, and other stat fields do not change. 294 * 295 * We could detect this at update-index time (the cache entry 296 * being registered/updated records the same time as "now") 297 * and delay the return from git-update-index, but that would 298 * effectively mean we can make at most one commit per second, 299 * which is not acceptable. Instead, we check cache entries 300 * whose mtime are the same as the index file timestamp more 301 * carefully than others. 302 */ 303if(!changed &&is_racy_timestamp(istate, ce)) { 304if(assume_racy_is_modified) 305 changed |= DATA_CHANGED; 306else 307 changed |=ce_modified_check_fs(ce, st); 308} 309 310return changed; 311} 312 313intie_modified(const struct index_state *istate, 314struct cache_entry *ce,struct stat *st,unsigned int options) 315{ 316int changed, changed_fs; 317 318 changed =ie_match_stat(istate, ce, st, options); 319if(!changed) 320return0; 321/* 322 * If the mode or type has changed, there's no point in trying 323 * to refresh the entry - it's not going to match 324 */ 325if(changed & (MODE_CHANGED | TYPE_CHANGED)) 326return changed; 327 328/* 329 * Immediately after read-tree or update-index --cacheinfo, 330 * the length field is zero, as we have never even read the 331 * lstat(2) information once, and we cannot trust DATA_CHANGED 332 * returned by ie_match_stat() which in turn was returned by 333 * ce_match_stat_basic() to signal that the filesize of the 334 * blob changed. We have to actually go to the filesystem to 335 * see if the contents match, and if so, should answer "unchanged". 336 * 337 * The logic does not apply to gitlinks, as ce_match_stat_basic() 338 * already has checked the actual HEAD from the filesystem in the 339 * subproject. If ie_match_stat() already said it is different, 340 * then we know it is. 341 */ 342if((changed & DATA_CHANGED) && 343(S_ISGITLINK(ce->ce_mode) || ce->ce_size !=0)) 344return changed; 345 346 changed_fs =ce_modified_check_fs(ce, st); 347if(changed_fs) 348return changed | changed_fs; 349return0; 350} 351 352intbase_name_compare(const char*name1,int len1,int mode1, 353const char*name2,int len2,int mode2) 354{ 355unsigned char c1, c2; 356int len = len1 < len2 ? len1 : len2; 357int cmp; 358 359 cmp =memcmp(name1, name2, len); 360if(cmp) 361return cmp; 362 c1 = name1[len]; 363 c2 = name2[len]; 364if(!c1 &&S_ISDIR(mode1)) 365 c1 ='/'; 366if(!c2 &&S_ISDIR(mode2)) 367 c2 ='/'; 368return(c1 < c2) ? -1: (c1 > c2) ?1:0; 369} 370 371/* 372 * df_name_compare() is identical to base_name_compare(), except it 373 * compares conflicting directory/file entries as equal. Note that 374 * while a directory name compares as equal to a regular file, they 375 * then individually compare _differently_ to a filename that has 376 * a dot after the basename (because '\0' < '.' < '/'). 377 * 378 * This is used by routines that want to traverse the git namespace 379 * but then handle conflicting entries together when possible. 380 */ 381intdf_name_compare(const char*name1,int len1,int mode1, 382const char*name2,int len2,int mode2) 383{ 384int len = len1 < len2 ? len1 : len2, cmp; 385unsigned char c1, c2; 386 387 cmp =memcmp(name1, name2, len); 388if(cmp) 389return cmp; 390/* Directories and files compare equal (same length, same name) */ 391if(len1 == len2) 392return0; 393 c1 = name1[len]; 394if(!c1 &&S_ISDIR(mode1)) 395 c1 ='/'; 396 c2 = name2[len]; 397if(!c2 &&S_ISDIR(mode2)) 398 c2 ='/'; 399if(c1 =='/'&& !c2) 400return0; 401if(c2 =='/'&& !c1) 402return0; 403return c1 - c2; 404} 405 406intcache_name_compare(const char*name1,int flags1,const char*name2,int flags2) 407{ 408int len1 = flags1 & CE_NAMEMASK; 409int len2 = flags2 & CE_NAMEMASK; 410int len = len1 < len2 ? len1 : len2; 411int cmp; 412 413 cmp =memcmp(name1, name2, len); 414if(cmp) 415return cmp; 416if(len1 < len2) 417return-1; 418if(len1 > len2) 419return1; 420 421/* Compare stages */ 422 flags1 &= CE_STAGEMASK; 423 flags2 &= CE_STAGEMASK; 424 425if(flags1 < flags2) 426return-1; 427if(flags1 > flags2) 428return1; 429return0; 430} 431 432intindex_name_pos(const struct index_state *istate,const char*name,int namelen) 433{ 434int first, last; 435 436 first =0; 437 last = istate->cache_nr; 438while(last > first) { 439int next = (last + first) >>1; 440struct cache_entry *ce = istate->cache[next]; 441int cmp =cache_name_compare(name, namelen, ce->name, ce->ce_flags); 442if(!cmp) 443return next; 444if(cmp <0) { 445 last = next; 446continue; 447} 448 first = next+1; 449} 450return-first-1; 451} 452 453/* Remove entry, return true if there are more entries to go.. */ 454intremove_index_entry_at(struct index_state *istate,int pos) 455{ 456struct cache_entry *ce = istate->cache[pos]; 457 458record_resolve_undo(istate, ce); 459remove_name_hash(ce); 460 istate->cache_changed =1; 461 istate->cache_nr--; 462if(pos >= istate->cache_nr) 463return0; 464memmove(istate->cache + pos, 465 istate->cache + pos +1, 466(istate->cache_nr - pos) *sizeof(struct cache_entry *)); 467return1; 468} 469 470/* 471 * Remove all cache ententries marked for removal, that is where 472 * CE_REMOVE is set in ce_flags. This is much more effective than 473 * calling remove_index_entry_at() for each entry to be removed. 474 */ 475voidremove_marked_cache_entries(struct index_state *istate) 476{ 477struct cache_entry **ce_array = istate->cache; 478unsigned int i, j; 479 480for(i = j =0; i < istate->cache_nr; i++) { 481if(ce_array[i]->ce_flags & CE_REMOVE) 482remove_name_hash(ce_array[i]); 483else 484 ce_array[j++] = ce_array[i]; 485} 486 istate->cache_changed =1; 487 istate->cache_nr = j; 488} 489 490intremove_file_from_index(struct index_state *istate,const char*path) 491{ 492int pos =index_name_pos(istate, path,strlen(path)); 493if(pos <0) 494 pos = -pos-1; 495cache_tree_invalidate_path(istate->cache_tree, path); 496while(pos < istate->cache_nr && !strcmp(istate->cache[pos]->name, path)) 497remove_index_entry_at(istate, pos); 498return0; 499} 500 501static intcompare_name(struct cache_entry *ce,const char*path,int namelen) 502{ 503return namelen !=ce_namelen(ce) ||memcmp(path, ce->name, namelen); 504} 505 506static intindex_name_pos_also_unmerged(struct index_state *istate, 507const char*path,int namelen) 508{ 509int pos =index_name_pos(istate, path, namelen); 510struct cache_entry *ce; 511 512if(pos >=0) 513return pos; 514 515/* maybe unmerged? */ 516 pos = -1- pos; 517if(pos >= istate->cache_nr || 518compare_name((ce = istate->cache[pos]), path, namelen)) 519return-1; 520 521/* order of preference: stage 2, 1, 3 */ 522if(ce_stage(ce) ==1&& pos +1< istate->cache_nr && 523ce_stage((ce = istate->cache[pos +1])) ==2&& 524!compare_name(ce, path, namelen)) 525 pos++; 526return pos; 527} 528 529static intdifferent_name(struct cache_entry *ce,struct cache_entry *alias) 530{ 531int len =ce_namelen(ce); 532returnce_namelen(alias) != len ||memcmp(ce->name, alias->name, len); 533} 534 535/* 536 * If we add a filename that aliases in the cache, we will use the 537 * name that we already have - but we don't want to update the same 538 * alias twice, because that implies that there were actually two 539 * different files with aliasing names! 540 * 541 * So we use the CE_ADDED flag to verify that the alias was an old 542 * one before we accept it as 543 */ 544static struct cache_entry *create_alias_ce(struct cache_entry *ce,struct cache_entry *alias) 545{ 546int len; 547struct cache_entry *new; 548 549if(alias->ce_flags & CE_ADDED) 550die("Will not add file alias '%s' ('%s' already exists in index)", ce->name, alias->name); 551 552/* Ok, create the new entry using the name of the existing alias */ 553 len =ce_namelen(alias); 554new=xcalloc(1,cache_entry_size(len)); 555memcpy(new->name, alias->name, len); 556copy_cache_entry(new, ce); 557free(ce); 558return new; 559} 560 561static voidrecord_intent_to_add(struct cache_entry *ce) 562{ 563unsigned char sha1[20]; 564if(write_sha1_file("",0, blob_type, sha1)) 565die("cannot create an empty blob in the object database"); 566hashcpy(ce->sha1, sha1); 567} 568 569intadd_to_index(struct index_state *istate,const char*path,struct stat *st,int flags) 570{ 571int size, namelen, was_same; 572 mode_t st_mode = st->st_mode; 573struct cache_entry *ce, *alias; 574unsigned ce_option = CE_MATCH_IGNORE_VALID|CE_MATCH_IGNORE_SKIP_WORKTREE|CE_MATCH_RACY_IS_DIRTY; 575int verbose = flags & (ADD_CACHE_VERBOSE | ADD_CACHE_PRETEND); 576int pretend = flags & ADD_CACHE_PRETEND; 577int intent_only = flags & ADD_CACHE_INTENT; 578int add_option = (ADD_CACHE_OK_TO_ADD|ADD_CACHE_OK_TO_REPLACE| 579(intent_only ? ADD_CACHE_NEW_ONLY :0)); 580 581if(!S_ISREG(st_mode) && !S_ISLNK(st_mode) && !S_ISDIR(st_mode)) 582returnerror("%s: can only add regular files, symbolic links or git-directories", path); 583 584 namelen =strlen(path); 585if(S_ISDIR(st_mode)) { 586while(namelen && path[namelen-1] =='/') 587 namelen--; 588} 589 size =cache_entry_size(namelen); 590 ce =xcalloc(1, size); 591memcpy(ce->name, path, namelen); 592 ce->ce_flags = namelen; 593if(!intent_only) 594fill_stat_cache_info(ce, st); 595else 596 ce->ce_flags |= CE_INTENT_TO_ADD; 597 598if(trust_executable_bit && has_symlinks) 599 ce->ce_mode =create_ce_mode(st_mode); 600else{ 601/* If there is an existing entry, pick the mode bits and type 602 * from it, otherwise assume unexecutable regular file. 603 */ 604struct cache_entry *ent; 605int pos =index_name_pos_also_unmerged(istate, path, namelen); 606 607 ent = (0<= pos) ? istate->cache[pos] : NULL; 608 ce->ce_mode =ce_mode_from_stat(ent, st_mode); 609} 610 611 alias =index_name_exists(istate, ce->name,ce_namelen(ce), ignore_case); 612if(alias && !ce_stage(alias) && !ie_match_stat(istate, alias, st, ce_option)) { 613/* Nothing changed, really */ 614free(ce); 615ce_mark_uptodate(alias); 616 alias->ce_flags |= CE_ADDED; 617return0; 618} 619if(!intent_only) { 620if(index_path(ce->sha1, path, st,1)) 621returnerror("unable to index file%s", path); 622}else 623record_intent_to_add(ce); 624 625if(ignore_case && alias &&different_name(ce, alias)) 626 ce =create_alias_ce(ce, alias); 627 ce->ce_flags |= CE_ADDED; 628 629/* It was suspected to be racily clean, but it turns out to be Ok */ 630 was_same = (alias && 631!ce_stage(alias) && 632!hashcmp(alias->sha1, ce->sha1) && 633 ce->ce_mode == alias->ce_mode); 634 635if(pretend) 636; 637else if(add_index_entry(istate, ce, add_option)) 638returnerror("unable to add%sto index",path); 639if(verbose && !was_same) 640printf("add '%s'\n", path); 641return0; 642} 643 644intadd_file_to_index(struct index_state *istate,const char*path,int flags) 645{ 646struct stat st; 647if(lstat(path, &st)) 648die_errno("unable to stat '%s'", path); 649returnadd_to_index(istate, path, &st, flags); 650} 651 652struct cache_entry *make_cache_entry(unsigned int mode, 653const unsigned char*sha1,const char*path,int stage, 654int refresh) 655{ 656int size, len; 657struct cache_entry *ce; 658 659if(!verify_path(path)) { 660error("Invalid path '%s'", path); 661return NULL; 662} 663 664 len =strlen(path); 665 size =cache_entry_size(len); 666 ce =xcalloc(1, size); 667 668hashcpy(ce->sha1, sha1); 669memcpy(ce->name, path, len); 670 ce->ce_flags =create_ce_flags(len, stage); 671 ce->ce_mode =create_ce_mode(mode); 672 673if(refresh) 674returnrefresh_cache_entry(ce,0); 675 676return ce; 677} 678 679intce_same_name(struct cache_entry *a,struct cache_entry *b) 680{ 681int len =ce_namelen(a); 682returnce_namelen(b) == len && !memcmp(a->name, b->name, len); 683} 684 685intce_path_match(const struct cache_entry *ce,const char**pathspec) 686{ 687const char*match, *name; 688int len; 689 690if(!pathspec) 691return1; 692 693 len =ce_namelen(ce); 694 name = ce->name; 695while((match = *pathspec++) != NULL) { 696int matchlen =strlen(match); 697if(matchlen > len) 698continue; 699if(memcmp(name, match, matchlen)) 700continue; 701if(matchlen && name[matchlen-1] =='/') 702return1; 703if(name[matchlen] =='/'|| !name[matchlen]) 704return1; 705if(!matchlen) 706return1; 707} 708return0; 709} 710 711/* 712 * We fundamentally don't like some paths: we don't want 713 * dot or dot-dot anywhere, and for obvious reasons don't 714 * want to recurse into ".git" either. 715 * 716 * Also, we don't want double slashes or slashes at the 717 * end that can make pathnames ambiguous. 718 */ 719static intverify_dotfile(const char*rest) 720{ 721/* 722 * The first character was '.', but that 723 * has already been discarded, we now test 724 * the rest. 725 */ 726switch(*rest) { 727/* "." is not allowed */ 728case'\0':case'/': 729return0; 730 731/* 732 * ".git" followed by NUL or slash is bad. This 733 * shares the path end test with the ".." case. 734 */ 735case'g': 736if(rest[1] !='i') 737break; 738if(rest[2] !='t') 739break; 740 rest +=2; 741/* fallthrough */ 742case'.': 743if(rest[1] =='\0'|| rest[1] =='/') 744return0; 745} 746return1; 747} 748 749intverify_path(const char*path) 750{ 751char c; 752 753goto inside; 754for(;;) { 755if(!c) 756return1; 757if(c =='/') { 758inside: 759 c = *path++; 760switch(c) { 761default: 762continue; 763case'/':case'\0': 764break; 765case'.': 766if(verify_dotfile(path)) 767continue; 768} 769return0; 770} 771 c = *path++; 772} 773} 774 775/* 776 * Do we have another file that has the beginning components being a 777 * proper superset of the name we're trying to add? 778 */ 779static inthas_file_name(struct index_state *istate, 780const struct cache_entry *ce,int pos,int ok_to_replace) 781{ 782int retval =0; 783int len =ce_namelen(ce); 784int stage =ce_stage(ce); 785const char*name = ce->name; 786 787while(pos < istate->cache_nr) { 788struct cache_entry *p = istate->cache[pos++]; 789 790if(len >=ce_namelen(p)) 791break; 792if(memcmp(name, p->name, len)) 793break; 794if(ce_stage(p) != stage) 795continue; 796if(p->name[len] !='/') 797continue; 798if(p->ce_flags & CE_REMOVE) 799continue; 800 retval = -1; 801if(!ok_to_replace) 802break; 803remove_index_entry_at(istate, --pos); 804} 805return retval; 806} 807 808/* 809 * Do we have another file with a pathname that is a proper 810 * subset of the name we're trying to add? 811 */ 812static inthas_dir_name(struct index_state *istate, 813const struct cache_entry *ce,int pos,int ok_to_replace) 814{ 815int retval =0; 816int stage =ce_stage(ce); 817const char*name = ce->name; 818const char*slash = name +ce_namelen(ce); 819 820for(;;) { 821int len; 822 823for(;;) { 824if(*--slash =='/') 825break; 826if(slash <= ce->name) 827return retval; 828} 829 len = slash - name; 830 831 pos =index_name_pos(istate, name,create_ce_flags(len, stage)); 832if(pos >=0) { 833/* 834 * Found one, but not so fast. This could 835 * be a marker that says "I was here, but 836 * I am being removed". Such an entry is 837 * not a part of the resulting tree, and 838 * it is Ok to have a directory at the same 839 * path. 840 */ 841if(!(istate->cache[pos]->ce_flags & CE_REMOVE)) { 842 retval = -1; 843if(!ok_to_replace) 844break; 845remove_index_entry_at(istate, pos); 846continue; 847} 848} 849else 850 pos = -pos-1; 851 852/* 853 * Trivial optimization: if we find an entry that 854 * already matches the sub-directory, then we know 855 * we're ok, and we can exit. 856 */ 857while(pos < istate->cache_nr) { 858struct cache_entry *p = istate->cache[pos]; 859if((ce_namelen(p) <= len) || 860(p->name[len] !='/') || 861memcmp(p->name, name, len)) 862break;/* not our subdirectory */ 863if(ce_stage(p) == stage && !(p->ce_flags & CE_REMOVE)) 864/* 865 * p is at the same stage as our entry, and 866 * is a subdirectory of what we are looking 867 * at, so we cannot have conflicts at our 868 * level or anything shorter. 869 */ 870return retval; 871 pos++; 872} 873} 874return retval; 875} 876 877/* We may be in a situation where we already have path/file and path 878 * is being added, or we already have path and path/file is being 879 * added. Either one would result in a nonsense tree that has path 880 * twice when git-write-tree tries to write it out. Prevent it. 881 * 882 * If ok-to-replace is specified, we remove the conflicting entries 883 * from the cache so the caller should recompute the insert position. 884 * When this happens, we return non-zero. 885 */ 886static intcheck_file_directory_conflict(struct index_state *istate, 887const struct cache_entry *ce, 888int pos,int ok_to_replace) 889{ 890int retval; 891 892/* 893 * When ce is an "I am going away" entry, we allow it to be added 894 */ 895if(ce->ce_flags & CE_REMOVE) 896return0; 897 898/* 899 * We check if the path is a sub-path of a subsequent pathname 900 * first, since removing those will not change the position 901 * in the array. 902 */ 903 retval =has_file_name(istate, ce, pos, ok_to_replace); 904 905/* 906 * Then check if the path might have a clashing sub-directory 907 * before it. 908 */ 909return retval +has_dir_name(istate, ce, pos, ok_to_replace); 910} 911 912static intadd_index_entry_with_check(struct index_state *istate,struct cache_entry *ce,int option) 913{ 914int pos; 915int ok_to_add = option & ADD_CACHE_OK_TO_ADD; 916int ok_to_replace = option & ADD_CACHE_OK_TO_REPLACE; 917int skip_df_check = option & ADD_CACHE_SKIP_DFCHECK; 918int new_only = option & ADD_CACHE_NEW_ONLY; 919 920cache_tree_invalidate_path(istate->cache_tree, ce->name); 921 pos =index_name_pos(istate, ce->name, ce->ce_flags); 922 923/* existing match? Just replace it. */ 924if(pos >=0) { 925if(!new_only) 926replace_index_entry(istate, pos, ce); 927return0; 928} 929 pos = -pos-1; 930 931/* 932 * Inserting a merged entry ("stage 0") into the index 933 * will always replace all non-merged entries.. 934 */ 935if(pos < istate->cache_nr &&ce_stage(ce) ==0) { 936while(ce_same_name(istate->cache[pos], ce)) { 937 ok_to_add =1; 938if(!remove_index_entry_at(istate, pos)) 939break; 940} 941} 942 943if(!ok_to_add) 944return-1; 945if(!verify_path(ce->name)) 946returnerror("Invalid path '%s'", ce->name); 947 948if(!skip_df_check && 949check_file_directory_conflict(istate, ce, pos, ok_to_replace)) { 950if(!ok_to_replace) 951returnerror("'%s' appears as both a file and as a directory", 952 ce->name); 953 pos =index_name_pos(istate, ce->name, ce->ce_flags); 954 pos = -pos-1; 955} 956return pos +1; 957} 958 959intadd_index_entry(struct index_state *istate,struct cache_entry *ce,int option) 960{ 961int pos; 962 963if(option & ADD_CACHE_JUST_APPEND) 964 pos = istate->cache_nr; 965else{ 966int ret; 967 ret =add_index_entry_with_check(istate, ce, option); 968if(ret <=0) 969return ret; 970 pos = ret -1; 971} 972 973/* Make sure the array is big enough .. */ 974if(istate->cache_nr == istate->cache_alloc) { 975 istate->cache_alloc =alloc_nr(istate->cache_alloc); 976 istate->cache =xrealloc(istate->cache, 977 istate->cache_alloc *sizeof(struct cache_entry *)); 978} 979 980/* Add it in.. */ 981 istate->cache_nr++; 982if(istate->cache_nr > pos +1) 983memmove(istate->cache + pos +1, 984 istate->cache + pos, 985(istate->cache_nr - pos -1) *sizeof(ce)); 986set_index_entry(istate, pos, ce); 987 istate->cache_changed =1; 988return0; 989} 990 991/* 992 * "refresh" does not calculate a new sha1 file or bring the 993 * cache up-to-date for mode/content changes. But what it 994 * _does_ do is to "re-match" the stat information of a file 995 * with the cache, so that you can refresh the cache for a 996 * file that hasn't been changed but where the stat entry is 997 * out of date. 998 * 999 * For example, you'd want to do this after doing a "git-read-tree",1000 * to link up the stat cache details with the proper files.1001 */1002static struct cache_entry *refresh_cache_ent(struct index_state *istate,1003struct cache_entry *ce,1004unsigned int options,int*err)1005{1006struct stat st;1007struct cache_entry *updated;1008int changed, size;1009int ignore_valid = options & CE_MATCH_IGNORE_VALID;1010int ignore_skip_worktree = options & CE_MATCH_IGNORE_SKIP_WORKTREE;10111012if(ce_uptodate(ce))1013return ce;10141015/*1016 * CE_VALID or CE_SKIP_WORKTREE means the user promised us1017 * that the change to the work tree does not matter and told1018 * us not to worry.1019 */1020if(!ignore_skip_worktree &&ce_skip_worktree(ce)) {1021ce_mark_uptodate(ce);1022return ce;1023}1024if(!ignore_valid && (ce->ce_flags & CE_VALID)) {1025ce_mark_uptodate(ce);1026return ce;1027}10281029if(lstat(ce->name, &st) <0) {1030if(err)1031*err = errno;1032return NULL;1033}10341035 changed =ie_match_stat(istate, ce, &st, options);1036if(!changed) {1037/*1038 * The path is unchanged. If we were told to ignore1039 * valid bit, then we did the actual stat check and1040 * found that the entry is unmodified. If the entry1041 * is not marked VALID, this is the place to mark it1042 * valid again, under "assume unchanged" mode.1043 */1044if(ignore_valid && assume_unchanged &&1045!(ce->ce_flags & CE_VALID))1046;/* mark this one VALID again */1047else{1048/*1049 * We do not mark the index itself "modified"1050 * because CE_UPTODATE flag is in-core only;1051 * we are not going to write this change out.1052 */1053ce_mark_uptodate(ce);1054return ce;1055}1056}10571058if(ie_modified(istate, ce, &st, options)) {1059if(err)1060*err = EINVAL;1061return NULL;1062}10631064 size =ce_size(ce);1065 updated =xmalloc(size);1066memcpy(updated, ce, size);1067fill_stat_cache_info(updated, &st);1068/*1069 * If ignore_valid is not set, we should leave CE_VALID bit1070 * alone. Otherwise, paths marked with --no-assume-unchanged1071 * (i.e. things to be edited) will reacquire CE_VALID bit1072 * automatically, which is not really what we want.1073 */1074if(!ignore_valid && assume_unchanged &&1075!(ce->ce_flags & CE_VALID))1076 updated->ce_flags &= ~CE_VALID;10771078return updated;1079}10801081static voidshow_file(const char* fmt,const char* name,int in_porcelain,1082int* first,char*header_msg)1083{1084if(in_porcelain && *first && header_msg) {1085printf("%s\n", header_msg);1086*first=0;1087}1088printf(fmt, name);1089}10901091intrefresh_index(struct index_state *istate,unsigned int flags,const char**pathspec,1092char*seen,char*header_msg)1093{1094int i;1095int has_errors =0;1096int really = (flags & REFRESH_REALLY) !=0;1097int allow_unmerged = (flags & REFRESH_UNMERGED) !=0;1098int quiet = (flags & REFRESH_QUIET) !=0;1099int not_new = (flags & REFRESH_IGNORE_MISSING) !=0;1100int ignore_submodules = (flags & REFRESH_IGNORE_SUBMODULES) !=0;1101int first =1;1102int in_porcelain = (flags & REFRESH_IN_PORCELAIN);1103unsigned int options = really ? CE_MATCH_IGNORE_VALID :0;1104const char*needs_update_fmt;1105const char*needs_merge_fmt;11061107 needs_update_fmt = (in_porcelain ?"M\t%s\n":"%s: needs update\n");1108 needs_merge_fmt = (in_porcelain ?"U\t%s\n":"%s: needs merge\n");1109for(i =0; i < istate->cache_nr; i++) {1110struct cache_entry *ce, *new;1111int cache_errno =0;11121113 ce = istate->cache[i];1114if(ignore_submodules &&S_ISGITLINK(ce->ce_mode))1115continue;11161117if(ce_stage(ce)) {1118while((i < istate->cache_nr) &&1119!strcmp(istate->cache[i]->name, ce->name))1120 i++;1121 i--;1122if(allow_unmerged)1123continue;1124show_file(needs_merge_fmt, ce->name, in_porcelain, &first, header_msg);1125 has_errors =1;1126continue;1127}11281129if(pathspec && !match_pathspec(pathspec, ce->name,strlen(ce->name),0, seen))1130continue;11311132new=refresh_cache_ent(istate, ce, options, &cache_errno);1133if(new== ce)1134continue;1135if(!new) {1136if(not_new && cache_errno == ENOENT)1137continue;1138if(really && cache_errno == EINVAL) {1139/* If we are doing --really-refresh that1140 * means the index is not valid anymore.1141 */1142 ce->ce_flags &= ~CE_VALID;1143 istate->cache_changed =1;1144}1145if(quiet)1146continue;1147show_file(needs_update_fmt, ce->name, in_porcelain, &first, header_msg);1148 has_errors =1;1149continue;1150}11511152replace_index_entry(istate, i,new);1153}1154return has_errors;1155}11561157static struct cache_entry *refresh_cache_entry(struct cache_entry *ce,int really)1158{1159returnrefresh_cache_ent(&the_index, ce, really, NULL);1160}11611162static intverify_hdr(struct cache_header *hdr,unsigned long size)1163{1164 git_SHA_CTX c;1165unsigned char sha1[20];11661167if(hdr->hdr_signature !=htonl(CACHE_SIGNATURE))1168returnerror("bad signature");1169if(hdr->hdr_version !=htonl(2) && hdr->hdr_version !=htonl(3))1170returnerror("bad index version");1171git_SHA1_Init(&c);1172git_SHA1_Update(&c, hdr, size -20);1173git_SHA1_Final(sha1, &c);1174if(hashcmp(sha1, (unsigned char*)hdr + size -20))1175returnerror("bad index file sha1 signature");1176return0;1177}11781179static intread_index_extension(struct index_state *istate,1180const char*ext,void*data,unsigned long sz)1181{1182switch(CACHE_EXT(ext)) {1183case CACHE_EXT_TREE:1184 istate->cache_tree =cache_tree_read(data, sz);1185break;1186case CACHE_EXT_RESOLVE_UNDO:1187 istate->resolve_undo =resolve_undo_read(data, sz);1188break;1189default:1190if(*ext <'A'||'Z'< *ext)1191returnerror("index uses %.4s extension, which we do not understand",1192 ext);1193fprintf(stderr,"ignoring %.4s extension\n", ext);1194break;1195}1196return0;1197}11981199intread_index(struct index_state *istate)1200{1201returnread_index_from(istate,get_index_file());1202}12031204static voidconvert_from_disk(struct ondisk_cache_entry *ondisk,struct cache_entry *ce)1205{1206size_t len;1207const char*name;12081209 ce->ce_ctime.sec =ntohl(ondisk->ctime.sec);1210 ce->ce_mtime.sec =ntohl(ondisk->mtime.sec);1211 ce->ce_ctime.nsec =ntohl(ondisk->ctime.nsec);1212 ce->ce_mtime.nsec =ntohl(ondisk->mtime.nsec);1213 ce->ce_dev =ntohl(ondisk->dev);1214 ce->ce_ino =ntohl(ondisk->ino);1215 ce->ce_mode =ntohl(ondisk->mode);1216 ce->ce_uid =ntohl(ondisk->uid);1217 ce->ce_gid =ntohl(ondisk->gid);1218 ce->ce_size =ntohl(ondisk->size);1219/* On-disk flags are just 16 bits */1220 ce->ce_flags =ntohs(ondisk->flags);12211222hashcpy(ce->sha1, ondisk->sha1);12231224 len = ce->ce_flags & CE_NAMEMASK;12251226if(ce->ce_flags & CE_EXTENDED) {1227struct ondisk_cache_entry_extended *ondisk2;1228int extended_flags;1229 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;1230 extended_flags =ntohs(ondisk2->flags2) <<16;1231/* We do not yet understand any bit out of CE_EXTENDED_FLAGS */1232if(extended_flags & ~CE_EXTENDED_FLAGS)1233die("Unknown index entry format%08x", extended_flags);1234 ce->ce_flags |= extended_flags;1235 name = ondisk2->name;1236}1237else1238 name = ondisk->name;12391240if(len == CE_NAMEMASK)1241 len =strlen(name);1242/*1243 * NEEDSWORK: If the original index is crafted, this copy could1244 * go unchecked.1245 */1246memcpy(ce->name, name, len +1);1247}12481249staticinlinesize_testimate_cache_size(size_t ondisk_size,unsigned int entries)1250{1251long per_entry;12521253 per_entry =sizeof(struct cache_entry) -sizeof(struct ondisk_cache_entry);12541255/*1256 * Alignment can cause differences. This should be "alignof", but1257 * since that's a gcc'ism, just use the size of a pointer.1258 */1259 per_entry +=sizeof(void*);1260return ondisk_size + entries*per_entry;1261}12621263/* remember to discard_cache() before reading a different cache! */1264intread_index_from(struct index_state *istate,const char*path)1265{1266int fd, i;1267struct stat st;1268unsigned long src_offset, dst_offset;1269struct cache_header *hdr;1270void*mmap;1271size_t mmap_size;12721273 errno = EBUSY;1274if(istate->initialized)1275return istate->cache_nr;12761277 errno = ENOENT;1278 istate->timestamp.sec =0;1279 istate->timestamp.nsec =0;1280 fd =open(path, O_RDONLY);1281if(fd <0) {1282if(errno == ENOENT)1283return0;1284die_errno("index file open failed");1285}12861287if(fstat(fd, &st))1288die_errno("cannot stat the open index");12891290 errno = EINVAL;1291 mmap_size =xsize_t(st.st_size);1292if(mmap_size <sizeof(struct cache_header) +20)1293die("index file smaller than expected");12941295 mmap =xmmap(NULL, mmap_size, PROT_READ | PROT_WRITE, MAP_PRIVATE, fd,0);1296close(fd);1297if(mmap == MAP_FAILED)1298die_errno("unable to map index file");12991300 hdr = mmap;1301if(verify_hdr(hdr, mmap_size) <0)1302goto unmap;13031304 istate->cache_nr =ntohl(hdr->hdr_entries);1305 istate->cache_alloc =alloc_nr(istate->cache_nr);1306 istate->cache =xcalloc(istate->cache_alloc,sizeof(struct cache_entry *));13071308/*1309 * The disk format is actually larger than the in-memory format,1310 * due to space for nsec etc, so even though the in-memory one1311 * has room for a few more flags, we can allocate using the same1312 * index size1313 */1314 istate->alloc =xmalloc(estimate_cache_size(mmap_size, istate->cache_nr));1315 istate->initialized =1;13161317 src_offset =sizeof(*hdr);1318 dst_offset =0;1319for(i =0; i < istate->cache_nr; i++) {1320struct ondisk_cache_entry *disk_ce;1321struct cache_entry *ce;13221323 disk_ce = (struct ondisk_cache_entry *)((char*)mmap + src_offset);1324 ce = (struct cache_entry *)((char*)istate->alloc + dst_offset);1325convert_from_disk(disk_ce, ce);1326set_index_entry(istate, i, ce);13271328 src_offset +=ondisk_ce_size(ce);1329 dst_offset +=ce_size(ce);1330}1331 istate->timestamp.sec = st.st_mtime;1332 istate->timestamp.nsec =ST_MTIME_NSEC(st);13331334while(src_offset <= mmap_size -20-8) {1335/* After an array of active_nr index entries,1336 * there can be arbitrary number of extended1337 * sections, each of which is prefixed with1338 * extension name (4-byte) and section length1339 * in 4-byte network byte order.1340 */1341uint32_t extsize;1342memcpy(&extsize, (char*)mmap + src_offset +4,4);1343 extsize =ntohl(extsize);1344if(read_index_extension(istate,1345(const char*) mmap + src_offset,1346(char*) mmap + src_offset +8,1347 extsize) <0)1348goto unmap;1349 src_offset +=8;1350 src_offset += extsize;1351}1352munmap(mmap, mmap_size);1353return istate->cache_nr;13541355unmap:1356munmap(mmap, mmap_size);1357 errno = EINVAL;1358die("index file corrupt");1359}13601361intis_index_unborn(struct index_state *istate)1362{1363return(!istate->cache_nr && !istate->alloc && !istate->timestamp.sec);1364}13651366intdiscard_index(struct index_state *istate)1367{1368resolve_undo_clear_index(istate);1369 istate->cache_nr =0;1370 istate->cache_changed =0;1371 istate->timestamp.sec =0;1372 istate->timestamp.nsec =0;1373 istate->name_hash_initialized =0;1374free_hash(&istate->name_hash);1375cache_tree_free(&(istate->cache_tree));1376free(istate->alloc);1377 istate->alloc = NULL;1378 istate->initialized =0;13791380/* no need to throw away allocated active_cache */1381return0;1382}13831384intunmerged_index(const struct index_state *istate)1385{1386int i;1387for(i =0; i < istate->cache_nr; i++) {1388if(ce_stage(istate->cache[i]))1389return1;1390}1391return0;1392}13931394#define WRITE_BUFFER_SIZE 81921395static unsigned char write_buffer[WRITE_BUFFER_SIZE];1396static unsigned long write_buffer_len;13971398static intce_write_flush(git_SHA_CTX *context,int fd)1399{1400unsigned int buffered = write_buffer_len;1401if(buffered) {1402git_SHA1_Update(context, write_buffer, buffered);1403if(write_in_full(fd, write_buffer, buffered) != buffered)1404return-1;1405 write_buffer_len =0;1406}1407return0;1408}14091410static intce_write(git_SHA_CTX *context,int fd,void*data,unsigned int len)1411{1412while(len) {1413unsigned int buffered = write_buffer_len;1414unsigned int partial = WRITE_BUFFER_SIZE - buffered;1415if(partial > len)1416 partial = len;1417memcpy(write_buffer + buffered, data, partial);1418 buffered += partial;1419if(buffered == WRITE_BUFFER_SIZE) {1420 write_buffer_len = buffered;1421if(ce_write_flush(context, fd))1422return-1;1423 buffered =0;1424}1425 write_buffer_len = buffered;1426 len -= partial;1427 data = (char*) data + partial;1428}1429return0;1430}14311432static intwrite_index_ext_header(git_SHA_CTX *context,int fd,1433unsigned int ext,unsigned int sz)1434{1435 ext =htonl(ext);1436 sz =htonl(sz);1437return((ce_write(context, fd, &ext,4) <0) ||1438(ce_write(context, fd, &sz,4) <0)) ? -1:0;1439}14401441static intce_flush(git_SHA_CTX *context,int fd)1442{1443unsigned int left = write_buffer_len;14441445if(left) {1446 write_buffer_len =0;1447git_SHA1_Update(context, write_buffer, left);1448}14491450/* Flush first if not enough space for SHA1 signature */1451if(left +20> WRITE_BUFFER_SIZE) {1452if(write_in_full(fd, write_buffer, left) != left)1453return-1;1454 left =0;1455}14561457/* Append the SHA1 signature at the end */1458git_SHA1_Final(write_buffer + left, context);1459 left +=20;1460return(write_in_full(fd, write_buffer, left) != left) ? -1:0;1461}14621463static voidce_smudge_racily_clean_entry(struct cache_entry *ce)1464{1465/*1466 * The only thing we care about in this function is to smudge the1467 * falsely clean entry due to touch-update-touch race, so we leave1468 * everything else as they are. We are called for entries whose1469 * ce_mtime match the index file mtime.1470 *1471 * Note that this actually does not do much for gitlinks, for1472 * which ce_match_stat_basic() always goes to the actual1473 * contents. The caller checks with is_racy_timestamp() which1474 * always says "no" for gitlinks, so we are not called for them ;-)1475 */1476struct stat st;14771478if(lstat(ce->name, &st) <0)1479return;1480if(ce_match_stat_basic(ce, &st))1481return;1482if(ce_modified_check_fs(ce, &st)) {1483/* This is "racily clean"; smudge it. Note that this1484 * is a tricky code. At first glance, it may appear1485 * that it can break with this sequence:1486 *1487 * $ echo xyzzy >frotz1488 * $ git-update-index --add frotz1489 * $ : >frotz1490 * $ sleep 31491 * $ echo filfre >nitfol1492 * $ git-update-index --add nitfol1493 *1494 * but it does not. When the second update-index runs,1495 * it notices that the entry "frotz" has the same timestamp1496 * as index, and if we were to smudge it by resetting its1497 * size to zero here, then the object name recorded1498 * in index is the 6-byte file but the cached stat information1499 * becomes zero --- which would then match what we would1500 * obtain from the filesystem next time we stat("frotz").1501 *1502 * However, the second update-index, before calling1503 * this function, notices that the cached size is 61504 * bytes and what is on the filesystem is an empty1505 * file, and never calls us, so the cached size information1506 * for "frotz" stays 6 which does not match the filesystem.1507 */1508 ce->ce_size =0;1509}1510}15111512static intce_write_entry(git_SHA_CTX *c,int fd,struct cache_entry *ce)1513{1514int size =ondisk_ce_size(ce);1515struct ondisk_cache_entry *ondisk =xcalloc(1, size);1516char*name;15171518 ondisk->ctime.sec =htonl(ce->ce_ctime.sec);1519 ondisk->mtime.sec =htonl(ce->ce_mtime.sec);1520 ondisk->ctime.nsec =htonl(ce->ce_ctime.nsec);1521 ondisk->mtime.nsec =htonl(ce->ce_mtime.nsec);1522 ondisk->dev =htonl(ce->ce_dev);1523 ondisk->ino =htonl(ce->ce_ino);1524 ondisk->mode =htonl(ce->ce_mode);1525 ondisk->uid =htonl(ce->ce_uid);1526 ondisk->gid =htonl(ce->ce_gid);1527 ondisk->size =htonl(ce->ce_size);1528hashcpy(ondisk->sha1, ce->sha1);1529 ondisk->flags =htons(ce->ce_flags);1530if(ce->ce_flags & CE_EXTENDED) {1531struct ondisk_cache_entry_extended *ondisk2;1532 ondisk2 = (struct ondisk_cache_entry_extended *)ondisk;1533 ondisk2->flags2 =htons((ce->ce_flags & CE_EXTENDED_FLAGS) >>16);1534 name = ondisk2->name;1535}1536else1537 name = ondisk->name;1538memcpy(name, ce->name,ce_namelen(ce));15391540returnce_write(c, fd, ondisk, size);1541}15421543intwrite_index(struct index_state *istate,int newfd)1544{1545 git_SHA_CTX c;1546struct cache_header hdr;1547int i, err, removed, extended;1548struct cache_entry **cache = istate->cache;1549int entries = istate->cache_nr;1550struct stat st;15511552for(i = removed = extended =0; i < entries; i++) {1553if(cache[i]->ce_flags & CE_REMOVE)1554 removed++;15551556/* reduce extended entries if possible */1557 cache[i]->ce_flags &= ~CE_EXTENDED;1558if(cache[i]->ce_flags & CE_EXTENDED_FLAGS) {1559 extended++;1560 cache[i]->ce_flags |= CE_EXTENDED;1561}1562}15631564 hdr.hdr_signature =htonl(CACHE_SIGNATURE);1565/* for extended format, increase version so older git won't try to read it */1566 hdr.hdr_version =htonl(extended ?3:2);1567 hdr.hdr_entries =htonl(entries - removed);15681569git_SHA1_Init(&c);1570if(ce_write(&c, newfd, &hdr,sizeof(hdr)) <0)1571return-1;15721573for(i =0; i < entries; i++) {1574struct cache_entry *ce = cache[i];1575if(ce->ce_flags & CE_REMOVE)1576continue;1577if(!ce_uptodate(ce) &&is_racy_timestamp(istate, ce))1578ce_smudge_racily_clean_entry(ce);1579if(ce_write_entry(&c, newfd, ce) <0)1580return-1;1581}15821583/* Write extension data here */1584if(istate->cache_tree) {1585struct strbuf sb = STRBUF_INIT;15861587cache_tree_write(&sb, istate->cache_tree);1588 err =write_index_ext_header(&c, newfd, CACHE_EXT_TREE, sb.len) <01589||ce_write(&c, newfd, sb.buf, sb.len) <0;1590strbuf_release(&sb);1591if(err)1592return-1;1593}1594if(istate->resolve_undo) {1595struct strbuf sb = STRBUF_INIT;15961597resolve_undo_write(&sb, istate->resolve_undo);1598 err =write_index_ext_header(&c, newfd, CACHE_EXT_RESOLVE_UNDO,1599 sb.len) <01600||ce_write(&c, newfd, sb.buf, sb.len) <0;1601strbuf_release(&sb);1602if(err)1603return-1;1604}16051606if(ce_flush(&c, newfd) ||fstat(newfd, &st))1607return-1;1608 istate->timestamp.sec = (unsigned int)st.st_mtime;1609 istate->timestamp.nsec =ST_MTIME_NSEC(st);1610return0;1611}16121613/*1614 * Read the index file that is potentially unmerged into given1615 * index_state, dropping any unmerged entries. Returns true if1616 * the index is unmerged. Callers who want to refuse to work1617 * from an unmerged state can call this and check its return value,1618 * instead of calling read_cache().1619 */1620intread_index_unmerged(struct index_state *istate)1621{1622int i;1623int unmerged =0;16241625read_index(istate);1626for(i =0; i < istate->cache_nr; i++) {1627struct cache_entry *ce = istate->cache[i];1628struct cache_entry *new_ce;1629int size, len;16301631if(!ce_stage(ce))1632continue;1633 unmerged =1;1634 len =strlen(ce->name);1635 size =cache_entry_size(len);1636 new_ce =xcalloc(1, size);1637memcpy(new_ce->name, ce->name, len);1638 new_ce->ce_flags =create_ce_flags(len,0) | CE_CONFLICTED;1639 new_ce->ce_mode = ce->ce_mode;1640if(add_index_entry(istate, new_ce,0))1641returnerror("%s: cannot drop to stage #0",1642 ce->name);1643 i =index_name_pos(istate, new_ce->name, len);1644}1645return unmerged;1646}16471648/*1649 * Returns 1 if the path is an "other" path with respect to1650 * the index; that is, the path is not mentioned in the index at all,1651 * either as a file, a directory with some files in the index,1652 * or as an unmerged entry.1653 *1654 * We helpfully remove a trailing "/" from directories so that1655 * the output of read_directory can be used as-is.1656 */1657intindex_name_is_other(const struct index_state *istate,const char*name,1658int namelen)1659{1660int pos;1661if(namelen && name[namelen -1] =='/')1662 namelen--;1663 pos =index_name_pos(istate, name, namelen);1664if(0<= pos)1665return0;/* exact match */1666 pos = -pos -1;1667if(pos < istate->cache_nr) {1668struct cache_entry *ce = istate->cache[pos];1669if(ce_namelen(ce) == namelen &&1670!memcmp(ce->name, name, namelen))1671return0;/* Yup, this one exists unmerged */1672}1673return1;1674}