1#include"../cache.h" 2#include"../refs.h" 3#include"refs-internal.h" 4#include"../iterator.h" 5#include"../dir-iterator.h" 6#include"../lockfile.h" 7#include"../object.h" 8#include"../dir.h" 9 10struct ref_lock { 11char*ref_name; 12struct lock_file *lk; 13struct object_id old_oid; 14}; 15 16struct ref_entry; 17 18/* 19 * Information used (along with the information in ref_entry) to 20 * describe a single cached reference. This data structure only 21 * occurs embedded in a union in struct ref_entry, and only when 22 * (ref_entry->flag & REF_DIR) is zero. 23 */ 24struct ref_value { 25/* 26 * The name of the object to which this reference resolves 27 * (which may be a tag object). If REF_ISBROKEN, this is 28 * null. If REF_ISSYMREF, then this is the name of the object 29 * referred to by the last reference in the symlink chain. 30 */ 31struct object_id oid; 32 33/* 34 * If REF_KNOWS_PEELED, then this field holds the peeled value 35 * of this reference, or null if the reference is known not to 36 * be peelable. See the documentation for peel_ref() for an 37 * exact definition of "peelable". 38 */ 39struct object_id peeled; 40}; 41 42struct files_ref_store; 43 44/* 45 * Information used (along with the information in ref_entry) to 46 * describe a level in the hierarchy of references. This data 47 * structure only occurs embedded in a union in struct ref_entry, and 48 * only when (ref_entry.flag & REF_DIR) is set. In that case, 49 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 50 * in the directory have already been read: 51 * 52 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 53 * or packed references, already read. 54 * 55 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 56 * references that hasn't been read yet (nor has any of its 57 * subdirectories). 58 * 59 * Entries within a directory are stored within a growable array of 60 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 61 * sorted are sorted by their component name in strcmp() order and the 62 * remaining entries are unsorted. 63 * 64 * Loose references are read lazily, one directory at a time. When a 65 * directory of loose references is read, then all of the references 66 * in that directory are stored, and REF_INCOMPLETE stubs are created 67 * for any subdirectories, but the subdirectories themselves are not 68 * read. The reading is triggered by get_ref_dir(). 69 */ 70struct ref_dir { 71int nr, alloc; 72 73/* 74 * Entries with index 0 <= i < sorted are sorted by name. New 75 * entries are appended to the list unsorted, and are sorted 76 * only when required; thus we avoid the need to sort the list 77 * after the addition of every reference. 78 */ 79int sorted; 80 81/* A pointer to the files_ref_store that contains this ref_dir. */ 82struct files_ref_store *ref_store; 83 84struct ref_entry **entries; 85}; 86 87/* 88 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 89 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 90 * public values; see refs.h. 91 */ 92 93/* 94 * The field ref_entry->u.value.peeled of this value entry contains 95 * the correct peeled value for the reference, which might be 96 * null_sha1 if the reference is not a tag or if it is broken. 97 */ 98#define REF_KNOWS_PEELED 0x10 99 100/* ref_entry represents a directory of references */ 101#define REF_DIR 0x20 102 103/* 104 * Entry has not yet been read from disk (used only for REF_DIR 105 * entries representing loose references) 106 */ 107#define REF_INCOMPLETE 0x40 108 109/* 110 * A ref_entry represents either a reference or a "subdirectory" of 111 * references. 112 * 113 * Each directory in the reference namespace is represented by a 114 * ref_entry with (flags & REF_DIR) set and containing a subdir member 115 * that holds the entries in that directory that have been read so 116 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 117 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 118 * used for loose reference directories. 119 * 120 * References are represented by a ref_entry with (flags & REF_DIR) 121 * unset and a value member that describes the reference's value. The 122 * flag member is at the ref_entry level, but it is also needed to 123 * interpret the contents of the value field (in other words, a 124 * ref_value object is not very much use without the enclosing 125 * ref_entry). 126 * 127 * Reference names cannot end with slash and directories' names are 128 * always stored with a trailing slash (except for the top-level 129 * directory, which is always denoted by ""). This has two nice 130 * consequences: (1) when the entries in each subdir are sorted 131 * lexicographically by name (as they usually are), the references in 132 * a whole tree can be generated in lexicographic order by traversing 133 * the tree in left-to-right, depth-first order; (2) the names of 134 * references and subdirectories cannot conflict, and therefore the 135 * presence of an empty subdirectory does not block the creation of a 136 * similarly-named reference. (The fact that reference names with the 137 * same leading components can conflict *with each other* is a 138 * separate issue that is regulated by verify_refname_available().) 139 * 140 * Please note that the name field contains the fully-qualified 141 * reference (or subdirectory) name. Space could be saved by only 142 * storing the relative names. But that would require the full names 143 * to be generated on the fly when iterating in do_for_each_ref(), and 144 * would break callback functions, who have always been able to assume 145 * that the name strings that they are passed will not be freed during 146 * the iteration. 147 */ 148struct ref_entry { 149unsigned char flag;/* ISSYMREF? ISPACKED? */ 150union{ 151struct ref_value value;/* if not (flags&REF_DIR) */ 152struct ref_dir subdir;/* if (flags&REF_DIR) */ 153} u; 154/* 155 * The full name of the reference (e.g., "refs/heads/master") 156 * or the full name of the directory with a trailing slash 157 * (e.g., "refs/heads/"): 158 */ 159char name[FLEX_ARRAY]; 160}; 161 162static voidread_loose_refs(const char*dirname,struct ref_dir *dir); 163static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len); 164static struct ref_entry *create_dir_entry(struct files_ref_store *ref_store, 165const char*dirname,size_t len, 166int incomplete); 167static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry); 168 169static struct ref_dir *get_ref_dir(struct ref_entry *entry) 170{ 171struct ref_dir *dir; 172assert(entry->flag & REF_DIR); 173 dir = &entry->u.subdir; 174if(entry->flag & REF_INCOMPLETE) { 175read_loose_refs(entry->name, dir); 176 177/* 178 * Manually add refs/bisect, which, being 179 * per-worktree, might not appear in the directory 180 * listing for refs/ in the main repo. 181 */ 182if(!strcmp(entry->name,"refs/")) { 183int pos =search_ref_dir(dir,"refs/bisect/",12); 184if(pos <0) { 185struct ref_entry *child_entry; 186 child_entry =create_dir_entry(dir->ref_store, 187"refs/bisect/", 18812,1); 189add_entry_to_dir(dir, child_entry); 190read_loose_refs("refs/bisect", 191&child_entry->u.subdir); 192} 193} 194 entry->flag &= ~REF_INCOMPLETE; 195} 196return dir; 197} 198 199static struct ref_entry *create_ref_entry(const char*refname, 200const unsigned char*sha1,int flag, 201int check_name) 202{ 203struct ref_entry *ref; 204 205if(check_name && 206check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 207die("Reference has invalid format: '%s'", refname); 208FLEX_ALLOC_STR(ref, name, refname); 209hashcpy(ref->u.value.oid.hash, sha1); 210oidclr(&ref->u.value.peeled); 211 ref->flag = flag; 212return ref; 213} 214 215static voidclear_ref_dir(struct ref_dir *dir); 216 217static voidfree_ref_entry(struct ref_entry *entry) 218{ 219if(entry->flag & REF_DIR) { 220/* 221 * Do not use get_ref_dir() here, as that might 222 * trigger the reading of loose refs. 223 */ 224clear_ref_dir(&entry->u.subdir); 225} 226free(entry); 227} 228 229/* 230 * Add a ref_entry to the end of dir (unsorted). Entry is always 231 * stored directly in dir; no recursion into subdirectories is 232 * done. 233 */ 234static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry) 235{ 236ALLOC_GROW(dir->entries, dir->nr +1, dir->alloc); 237 dir->entries[dir->nr++] = entry; 238/* optimize for the case that entries are added in order */ 239if(dir->nr ==1|| 240(dir->nr == dir->sorted +1&& 241strcmp(dir->entries[dir->nr -2]->name, 242 dir->entries[dir->nr -1]->name) <0)) 243 dir->sorted = dir->nr; 244} 245 246/* 247 * Clear and free all entries in dir, recursively. 248 */ 249static voidclear_ref_dir(struct ref_dir *dir) 250{ 251int i; 252for(i =0; i < dir->nr; i++) 253free_ref_entry(dir->entries[i]); 254free(dir->entries); 255 dir->sorted = dir->nr = dir->alloc =0; 256 dir->entries = NULL; 257} 258 259/* 260 * Create a struct ref_entry object for the specified dirname. 261 * dirname is the name of the directory with a trailing slash (e.g., 262 * "refs/heads/") or "" for the top-level directory. 263 */ 264static struct ref_entry *create_dir_entry(struct files_ref_store *ref_store, 265const char*dirname,size_t len, 266int incomplete) 267{ 268struct ref_entry *direntry; 269FLEX_ALLOC_MEM(direntry, name, dirname, len); 270 direntry->u.subdir.ref_store = ref_store; 271 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE :0); 272return direntry; 273} 274 275static intref_entry_cmp(const void*a,const void*b) 276{ 277struct ref_entry *one = *(struct ref_entry **)a; 278struct ref_entry *two = *(struct ref_entry **)b; 279returnstrcmp(one->name, two->name); 280} 281 282static voidsort_ref_dir(struct ref_dir *dir); 283 284struct string_slice { 285size_t len; 286const char*str; 287}; 288 289static intref_entry_cmp_sslice(const void*key_,const void*ent_) 290{ 291const struct string_slice *key = key_; 292const struct ref_entry *ent = *(const struct ref_entry *const*)ent_; 293int cmp =strncmp(key->str, ent->name, key->len); 294if(cmp) 295return cmp; 296return'\0'- (unsigned char)ent->name[key->len]; 297} 298 299/* 300 * Return the index of the entry with the given refname from the 301 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 302 * no such entry is found. dir must already be complete. 303 */ 304static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len) 305{ 306struct ref_entry **r; 307struct string_slice key; 308 309if(refname == NULL || !dir->nr) 310return-1; 311 312sort_ref_dir(dir); 313 key.len = len; 314 key.str = refname; 315 r =bsearch(&key, dir->entries, dir->nr,sizeof(*dir->entries), 316 ref_entry_cmp_sslice); 317 318if(r == NULL) 319return-1; 320 321return r - dir->entries; 322} 323 324/* 325 * Search for a directory entry directly within dir (without 326 * recursing). Sort dir if necessary. subdirname must be a directory 327 * name (i.e., end in '/'). If mkdir is set, then create the 328 * directory if it is missing; otherwise, return NULL if the desired 329 * directory cannot be found. dir must already be complete. 330 */ 331static struct ref_dir *search_for_subdir(struct ref_dir *dir, 332const char*subdirname,size_t len, 333int mkdir) 334{ 335int entry_index =search_ref_dir(dir, subdirname, len); 336struct ref_entry *entry; 337if(entry_index == -1) { 338if(!mkdir) 339return NULL; 340/* 341 * Since dir is complete, the absence of a subdir 342 * means that the subdir really doesn't exist; 343 * therefore, create an empty record for it but mark 344 * the record complete. 345 */ 346 entry =create_dir_entry(dir->ref_store, subdirname, len,0); 347add_entry_to_dir(dir, entry); 348}else{ 349 entry = dir->entries[entry_index]; 350} 351returnget_ref_dir(entry); 352} 353 354/* 355 * If refname is a reference name, find the ref_dir within the dir 356 * tree that should hold refname. If refname is a directory name 357 * (i.e., ends in '/'), then return that ref_dir itself. dir must 358 * represent the top-level directory and must already be complete. 359 * Sort ref_dirs and recurse into subdirectories as necessary. If 360 * mkdir is set, then create any missing directories; otherwise, 361 * return NULL if the desired directory cannot be found. 362 */ 363static struct ref_dir *find_containing_dir(struct ref_dir *dir, 364const char*refname,int mkdir) 365{ 366const char*slash; 367for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 368size_t dirnamelen = slash - refname +1; 369struct ref_dir *subdir; 370 subdir =search_for_subdir(dir, refname, dirnamelen, mkdir); 371if(!subdir) { 372 dir = NULL; 373break; 374} 375 dir = subdir; 376} 377 378return dir; 379} 380 381/* 382 * Find the value entry with the given name in dir, sorting ref_dirs 383 * and recursing into subdirectories as necessary. If the name is not 384 * found or it corresponds to a directory entry, return NULL. 385 */ 386static struct ref_entry *find_ref(struct ref_dir *dir,const char*refname) 387{ 388int entry_index; 389struct ref_entry *entry; 390 dir =find_containing_dir(dir, refname,0); 391if(!dir) 392return NULL; 393 entry_index =search_ref_dir(dir, refname,strlen(refname)); 394if(entry_index == -1) 395return NULL; 396 entry = dir->entries[entry_index]; 397return(entry->flag & REF_DIR) ? NULL : entry; 398} 399 400/* 401 * Remove the entry with the given name from dir, recursing into 402 * subdirectories as necessary. If refname is the name of a directory 403 * (i.e., ends with '/'), then remove the directory and its contents. 404 * If the removal was successful, return the number of entries 405 * remaining in the directory entry that contained the deleted entry. 406 * If the name was not found, return -1. Please note that this 407 * function only deletes the entry from the cache; it does not delete 408 * it from the filesystem or ensure that other cache entries (which 409 * might be symbolic references to the removed entry) are updated. 410 * Nor does it remove any containing dir entries that might be made 411 * empty by the removal. dir must represent the top-level directory 412 * and must already be complete. 413 */ 414static intremove_entry(struct ref_dir *dir,const char*refname) 415{ 416int refname_len =strlen(refname); 417int entry_index; 418struct ref_entry *entry; 419int is_dir = refname[refname_len -1] =='/'; 420if(is_dir) { 421/* 422 * refname represents a reference directory. Remove 423 * the trailing slash; otherwise we will get the 424 * directory *representing* refname rather than the 425 * one *containing* it. 426 */ 427char*dirname =xmemdupz(refname, refname_len -1); 428 dir =find_containing_dir(dir, dirname,0); 429free(dirname); 430}else{ 431 dir =find_containing_dir(dir, refname,0); 432} 433if(!dir) 434return-1; 435 entry_index =search_ref_dir(dir, refname, refname_len); 436if(entry_index == -1) 437return-1; 438 entry = dir->entries[entry_index]; 439 440memmove(&dir->entries[entry_index], 441&dir->entries[entry_index +1], 442(dir->nr - entry_index -1) *sizeof(*dir->entries) 443); 444 dir->nr--; 445if(dir->sorted > entry_index) 446 dir->sorted--; 447free_ref_entry(entry); 448return dir->nr; 449} 450 451/* 452 * Add a ref_entry to the ref_dir (unsorted), recursing into 453 * subdirectories as necessary. dir must represent the top-level 454 * directory. Return 0 on success. 455 */ 456static intadd_ref(struct ref_dir *dir,struct ref_entry *ref) 457{ 458 dir =find_containing_dir(dir, ref->name,1); 459if(!dir) 460return-1; 461add_entry_to_dir(dir, ref); 462return0; 463} 464 465/* 466 * Emit a warning and return true iff ref1 and ref2 have the same name 467 * and the same sha1. Die if they have the same name but different 468 * sha1s. 469 */ 470static intis_dup_ref(const struct ref_entry *ref1,const struct ref_entry *ref2) 471{ 472if(strcmp(ref1->name, ref2->name)) 473return0; 474 475/* Duplicate name; make sure that they don't conflict: */ 476 477if((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 478/* This is impossible by construction */ 479die("Reference directory conflict:%s", ref1->name); 480 481if(oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 482die("Duplicated ref, and SHA1s don't match:%s", ref1->name); 483 484warning("Duplicated ref:%s", ref1->name); 485return1; 486} 487 488/* 489 * Sort the entries in dir non-recursively (if they are not already 490 * sorted) and remove any duplicate entries. 491 */ 492static voidsort_ref_dir(struct ref_dir *dir) 493{ 494int i, j; 495struct ref_entry *last = NULL; 496 497/* 498 * This check also prevents passing a zero-length array to qsort(), 499 * which is a problem on some platforms. 500 */ 501if(dir->sorted == dir->nr) 502return; 503 504qsort(dir->entries, dir->nr,sizeof(*dir->entries), ref_entry_cmp); 505 506/* Remove any duplicates: */ 507for(i =0, j =0; j < dir->nr; j++) { 508struct ref_entry *entry = dir->entries[j]; 509if(last &&is_dup_ref(last, entry)) 510free_ref_entry(entry); 511else 512 last = dir->entries[i++] = entry; 513} 514 dir->sorted = dir->nr = i; 515} 516 517/* 518 * Return true if refname, which has the specified oid and flags, can 519 * be resolved to an object in the database. If the referred-to object 520 * does not exist, emit a warning and return false. 521 */ 522static intref_resolves_to_object(const char*refname, 523const struct object_id *oid, 524unsigned int flags) 525{ 526if(flags & REF_ISBROKEN) 527return0; 528if(!has_sha1_file(oid->hash)) { 529error("%sdoes not point to a valid object!", refname); 530return0; 531} 532return1; 533} 534 535/* 536 * Return true if the reference described by entry can be resolved to 537 * an object in the database; otherwise, emit a warning and return 538 * false. 539 */ 540static intentry_resolves_to_object(struct ref_entry *entry) 541{ 542returnref_resolves_to_object(entry->name, 543&entry->u.value.oid, entry->flag); 544} 545 546typedefinteach_ref_entry_fn(struct ref_entry *entry,void*cb_data); 547 548/* 549 * Call fn for each reference in dir that has index in the range 550 * offset <= index < dir->nr. Recurse into subdirectories that are in 551 * that index range, sorting them before iterating. This function 552 * does not sort dir itself; it should be sorted beforehand. fn is 553 * called for all references, including broken ones. 554 */ 555static intdo_for_each_entry_in_dir(struct ref_dir *dir,int offset, 556 each_ref_entry_fn fn,void*cb_data) 557{ 558int i; 559assert(dir->sorted == dir->nr); 560for(i = offset; i < dir->nr; i++) { 561struct ref_entry *entry = dir->entries[i]; 562int retval; 563if(entry->flag & REF_DIR) { 564struct ref_dir *subdir =get_ref_dir(entry); 565sort_ref_dir(subdir); 566 retval =do_for_each_entry_in_dir(subdir,0, fn, cb_data); 567}else{ 568 retval =fn(entry, cb_data); 569} 570if(retval) 571return retval; 572} 573return0; 574} 575 576/* 577 * Load all of the refs from the dir into our in-memory cache. The hard work 578 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 579 * through all of the sub-directories. We do not even need to care about 580 * sorting, as traversal order does not matter to us. 581 */ 582static voidprime_ref_dir(struct ref_dir *dir) 583{ 584int i; 585for(i =0; i < dir->nr; i++) { 586struct ref_entry *entry = dir->entries[i]; 587if(entry->flag & REF_DIR) 588prime_ref_dir(get_ref_dir(entry)); 589} 590} 591 592/* 593 * A level in the reference hierarchy that is currently being iterated 594 * through. 595 */ 596struct cache_ref_iterator_level { 597/* 598 * The ref_dir being iterated over at this level. The ref_dir 599 * is sorted before being stored here. 600 */ 601struct ref_dir *dir; 602 603/* 604 * The index of the current entry within dir (which might 605 * itself be a directory). If index == -1, then the iteration 606 * hasn't yet begun. If index == dir->nr, then the iteration 607 * through this level is over. 608 */ 609int index; 610}; 611 612/* 613 * Represent an iteration through a ref_dir in the memory cache. The 614 * iteration recurses through subdirectories. 615 */ 616struct cache_ref_iterator { 617struct ref_iterator base; 618 619/* 620 * The number of levels currently on the stack. This is always 621 * at least 1, because when it becomes zero the iteration is 622 * ended and this struct is freed. 623 */ 624size_t levels_nr; 625 626/* The number of levels that have been allocated on the stack */ 627size_t levels_alloc; 628 629/* 630 * A stack of levels. levels[0] is the uppermost level that is 631 * being iterated over in this iteration. (This is not 632 * necessary the top level in the references hierarchy. If we 633 * are iterating through a subtree, then levels[0] will hold 634 * the ref_dir for that subtree, and subsequent levels will go 635 * on from there.) 636 */ 637struct cache_ref_iterator_level *levels; 638}; 639 640static intcache_ref_iterator_advance(struct ref_iterator *ref_iterator) 641{ 642struct cache_ref_iterator *iter = 643(struct cache_ref_iterator *)ref_iterator; 644 645while(1) { 646struct cache_ref_iterator_level *level = 647&iter->levels[iter->levels_nr -1]; 648struct ref_dir *dir = level->dir; 649struct ref_entry *entry; 650 651if(level->index == -1) 652sort_ref_dir(dir); 653 654if(++level->index == level->dir->nr) { 655/* This level is exhausted; pop up a level */ 656if(--iter->levels_nr ==0) 657returnref_iterator_abort(ref_iterator); 658 659continue; 660} 661 662 entry = dir->entries[level->index]; 663 664if(entry->flag & REF_DIR) { 665/* push down a level */ 666ALLOC_GROW(iter->levels, iter->levels_nr +1, 667 iter->levels_alloc); 668 669 level = &iter->levels[iter->levels_nr++]; 670 level->dir =get_ref_dir(entry); 671 level->index = -1; 672}else{ 673 iter->base.refname = entry->name; 674 iter->base.oid = &entry->u.value.oid; 675 iter->base.flags = entry->flag; 676return ITER_OK; 677} 678} 679} 680 681static enum peel_status peel_entry(struct ref_entry *entry,int repeel); 682 683static intcache_ref_iterator_peel(struct ref_iterator *ref_iterator, 684struct object_id *peeled) 685{ 686struct cache_ref_iterator *iter = 687(struct cache_ref_iterator *)ref_iterator; 688struct cache_ref_iterator_level *level; 689struct ref_entry *entry; 690 691 level = &iter->levels[iter->levels_nr -1]; 692 693if(level->index == -1) 694die("BUG: peel called before advance for cache iterator"); 695 696 entry = level->dir->entries[level->index]; 697 698if(peel_entry(entry,0)) 699return-1; 700hashcpy(peeled->hash, entry->u.value.peeled.hash); 701return0; 702} 703 704static intcache_ref_iterator_abort(struct ref_iterator *ref_iterator) 705{ 706struct cache_ref_iterator *iter = 707(struct cache_ref_iterator *)ref_iterator; 708 709free(iter->levels); 710base_ref_iterator_free(ref_iterator); 711return ITER_DONE; 712} 713 714static struct ref_iterator_vtable cache_ref_iterator_vtable = { 715 cache_ref_iterator_advance, 716 cache_ref_iterator_peel, 717 cache_ref_iterator_abort 718}; 719 720static struct ref_iterator *cache_ref_iterator_begin(struct ref_dir *dir) 721{ 722struct cache_ref_iterator *iter; 723struct ref_iterator *ref_iterator; 724struct cache_ref_iterator_level *level; 725 726 iter =xcalloc(1,sizeof(*iter)); 727 ref_iterator = &iter->base; 728base_ref_iterator_init(ref_iterator, &cache_ref_iterator_vtable); 729ALLOC_GROW(iter->levels,10, iter->levels_alloc); 730 731 iter->levels_nr =1; 732 level = &iter->levels[0]; 733 level->index = -1; 734 level->dir = dir; 735 736return ref_iterator; 737} 738 739struct nonmatching_ref_data { 740const struct string_list *skip; 741const char*conflicting_refname; 742}; 743 744static intnonmatching_ref_fn(struct ref_entry *entry,void*vdata) 745{ 746struct nonmatching_ref_data *data = vdata; 747 748if(data->skip &&string_list_has_string(data->skip, entry->name)) 749return0; 750 751 data->conflicting_refname = entry->name; 752return1; 753} 754 755/* 756 * Return 0 if a reference named refname could be created without 757 * conflicting with the name of an existing reference in dir. 758 * See verify_refname_available for more information. 759 */ 760static intverify_refname_available_dir(const char*refname, 761const struct string_list *extras, 762const struct string_list *skip, 763struct ref_dir *dir, 764struct strbuf *err) 765{ 766const char*slash; 767const char*extra_refname; 768int pos; 769struct strbuf dirname = STRBUF_INIT; 770int ret = -1; 771 772/* 773 * For the sake of comments in this function, suppose that 774 * refname is "refs/foo/bar". 775 */ 776 777assert(err); 778 779strbuf_grow(&dirname,strlen(refname) +1); 780for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 781/* Expand dirname to the new prefix, not including the trailing slash: */ 782strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 783 784/* 785 * We are still at a leading dir of the refname (e.g., 786 * "refs/foo"; if there is a reference with that name, 787 * it is a conflict, *unless* it is in skip. 788 */ 789if(dir) { 790 pos =search_ref_dir(dir, dirname.buf, dirname.len); 791if(pos >=0&& 792(!skip || !string_list_has_string(skip, dirname.buf))) { 793/* 794 * We found a reference whose name is 795 * a proper prefix of refname; e.g., 796 * "refs/foo", and is not in skip. 797 */ 798strbuf_addf(err,"'%s' exists; cannot create '%s'", 799 dirname.buf, refname); 800goto cleanup; 801} 802} 803 804if(extras &&string_list_has_string(extras, dirname.buf) && 805(!skip || !string_list_has_string(skip, dirname.buf))) { 806strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 807 refname, dirname.buf); 808goto cleanup; 809} 810 811/* 812 * Otherwise, we can try to continue our search with 813 * the next component. So try to look up the 814 * directory, e.g., "refs/foo/". If we come up empty, 815 * we know there is nothing under this whole prefix, 816 * but even in that case we still have to continue the 817 * search for conflicts with extras. 818 */ 819strbuf_addch(&dirname,'/'); 820if(dir) { 821 pos =search_ref_dir(dir, dirname.buf, dirname.len); 822if(pos <0) { 823/* 824 * There was no directory "refs/foo/", 825 * so there is nothing under this 826 * whole prefix. So there is no need 827 * to continue looking for conflicting 828 * references. But we need to continue 829 * looking for conflicting extras. 830 */ 831 dir = NULL; 832}else{ 833 dir =get_ref_dir(dir->entries[pos]); 834} 835} 836} 837 838/* 839 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 840 * There is no point in searching for a reference with that 841 * name, because a refname isn't considered to conflict with 842 * itself. But we still need to check for references whose 843 * names are in the "refs/foo/bar/" namespace, because they 844 * *do* conflict. 845 */ 846strbuf_addstr(&dirname, refname + dirname.len); 847strbuf_addch(&dirname,'/'); 848 849if(dir) { 850 pos =search_ref_dir(dir, dirname.buf, dirname.len); 851 852if(pos >=0) { 853/* 854 * We found a directory named "$refname/" 855 * (e.g., "refs/foo/bar/"). It is a problem 856 * iff it contains any ref that is not in 857 * "skip". 858 */ 859struct nonmatching_ref_data data; 860 861 data.skip = skip; 862 data.conflicting_refname = NULL; 863 dir =get_ref_dir(dir->entries[pos]); 864sort_ref_dir(dir); 865if(do_for_each_entry_in_dir(dir,0, nonmatching_ref_fn, &data)) { 866strbuf_addf(err,"'%s' exists; cannot create '%s'", 867 data.conflicting_refname, refname); 868goto cleanup; 869} 870} 871} 872 873 extra_refname =find_descendant_ref(dirname.buf, extras, skip); 874if(extra_refname) 875strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 876 refname, extra_refname); 877else 878 ret =0; 879 880cleanup: 881strbuf_release(&dirname); 882return ret; 883} 884 885struct packed_ref_cache { 886struct ref_entry *root; 887 888/* 889 * Count of references to the data structure in this instance, 890 * including the pointer from files_ref_store::packed if any. 891 * The data will not be freed as long as the reference count 892 * is nonzero. 893 */ 894unsigned int referrers; 895 896/* 897 * Iff the packed-refs file associated with this instance is 898 * currently locked for writing, this points at the associated 899 * lock (which is owned by somebody else). The referrer count 900 * is also incremented when the file is locked and decremented 901 * when it is unlocked. 902 */ 903struct lock_file *lock; 904 905/* The metadata from when this packed-refs cache was read */ 906struct stat_validity validity; 907}; 908 909/* 910 * Future: need to be in "struct repository" 911 * when doing a full libification. 912 */ 913struct files_ref_store { 914struct ref_store base; 915struct ref_entry *loose; 916struct packed_ref_cache *packed; 917}; 918 919/* Lock used for the main packed-refs file: */ 920static struct lock_file packlock; 921 922/* 923 * Increment the reference count of *packed_refs. 924 */ 925static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 926{ 927 packed_refs->referrers++; 928} 929 930/* 931 * Decrease the reference count of *packed_refs. If it goes to zero, 932 * free *packed_refs and return true; otherwise return false. 933 */ 934static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs) 935{ 936if(!--packed_refs->referrers) { 937free_ref_entry(packed_refs->root); 938stat_validity_clear(&packed_refs->validity); 939free(packed_refs); 940return1; 941}else{ 942return0; 943} 944} 945 946static voidclear_packed_ref_cache(struct files_ref_store *refs) 947{ 948if(refs->packed) { 949struct packed_ref_cache *packed_refs = refs->packed; 950 951if(packed_refs->lock) 952die("internal error: packed-ref cache cleared while locked"); 953 refs->packed = NULL; 954release_packed_ref_cache(packed_refs); 955} 956} 957 958static voidclear_loose_ref_cache(struct files_ref_store *refs) 959{ 960if(refs->loose) { 961free_ref_entry(refs->loose); 962 refs->loose = NULL; 963} 964} 965 966/* 967 * Create a new submodule ref cache and add it to the internal 968 * set of caches. 969 */ 970static struct ref_store *files_ref_store_create(const char*submodule) 971{ 972struct files_ref_store *refs =xcalloc(1,sizeof(*refs)); 973struct ref_store *ref_store = (struct ref_store *)refs; 974 975base_ref_store_init(ref_store, &refs_be_files, submodule); 976 977return ref_store; 978} 979 980/* 981 * Downcast ref_store to files_ref_store. Die if ref_store is not a 982 * files_ref_store. If submodule_allowed is not true, then also die if 983 * files_ref_store is for a submodule (i.e., not for the main 984 * repository). caller is used in any necessary error messages. 985 */ 986static struct files_ref_store *files_downcast( 987struct ref_store *ref_store,int submodule_allowed, 988const char*caller) 989{ 990if(ref_store->be != &refs_be_files) 991die("BUG: ref_store is type\"%s\"not\"files\"in%s", 992 ref_store->be->name, caller); 993 994if(!submodule_allowed) 995assert_main_repository(ref_store, caller); 996 997return(struct files_ref_store *)ref_store; 998} 9991000/* The length of a peeled reference line in packed-refs, including EOL: */1001#define PEELED_LINE_LENGTH 4210021003/*1004 * The packed-refs header line that we write out. Perhaps other1005 * traits will be added later. The trailing space is required.1006 */1007static const char PACKED_REFS_HEADER[] =1008"# pack-refs with: peeled fully-peeled\n";10091010/*1011 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1012 * Return a pointer to the refname within the line (null-terminated),1013 * or NULL if there was a problem.1014 */1015static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1)1016{1017const char*ref;10181019/*1020 * 42: the answer to everything.1021 *1022 * In this case, it happens to be the answer to1023 * 40 (length of sha1 hex representation)1024 * +1 (space in between hex and name)1025 * +1 (newline at the end of the line)1026 */1027if(line->len <=42)1028return NULL;10291030if(get_sha1_hex(line->buf, sha1) <0)1031return NULL;1032if(!isspace(line->buf[40]))1033return NULL;10341035 ref = line->buf +41;1036if(isspace(*ref))1037return NULL;10381039if(line->buf[line->len -1] !='\n')1040return NULL;1041 line->buf[--line->len] =0;10421043return ref;1044}10451046/*1047 * Read f, which is a packed-refs file, into dir.1048 *1049 * A comment line of the form "# pack-refs with: " may contain zero or1050 * more traits. We interpret the traits as follows:1051 *1052 * No traits:1053 *1054 * Probably no references are peeled. But if the file contains a1055 * peeled value for a reference, we will use it.1056 *1057 * peeled:1058 *1059 * References under "refs/tags/", if they *can* be peeled, *are*1060 * peeled in this file. References outside of "refs/tags/" are1061 * probably not peeled even if they could have been, but if we find1062 * a peeled value for such a reference we will use it.1063 *1064 * fully-peeled:1065 *1066 * All references in the file that can be peeled are peeled.1067 * Inversely (and this is more important), any references in the1068 * file for which no peeled value is recorded is not peelable. This1069 * trait should typically be written alongside "peeled" for1070 * compatibility with older clients, but we do not require it1071 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1072 */1073static voidread_packed_refs(FILE*f,struct ref_dir *dir)1074{1075struct ref_entry *last = NULL;1076struct strbuf line = STRBUF_INIT;1077enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;10781079while(strbuf_getwholeline(&line, f,'\n') != EOF) {1080unsigned char sha1[20];1081const char*refname;1082const char*traits;10831084if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1085if(strstr(traits," fully-peeled "))1086 peeled = PEELED_FULLY;1087else if(strstr(traits," peeled "))1088 peeled = PEELED_TAGS;1089/* perhaps other traits later as well */1090continue;1091}10921093 refname =parse_ref_line(&line, sha1);1094if(refname) {1095int flag = REF_ISPACKED;10961097if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1098if(!refname_is_safe(refname))1099die("packed refname is dangerous:%s", refname);1100hashclr(sha1);1101 flag |= REF_BAD_NAME | REF_ISBROKEN;1102}1103 last =create_ref_entry(refname, sha1, flag,0);1104if(peeled == PEELED_FULLY ||1105(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1106 last->flag |= REF_KNOWS_PEELED;1107add_ref(dir, last);1108continue;1109}1110if(last &&1111 line.buf[0] =='^'&&1112 line.len == PEELED_LINE_LENGTH &&1113 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1114!get_sha1_hex(line.buf +1, sha1)) {1115hashcpy(last->u.value.peeled.hash, sha1);1116/*1117 * Regardless of what the file header said,1118 * we definitely know the value of *this*1119 * reference:1120 */1121 last->flag |= REF_KNOWS_PEELED;1122}1123}11241125strbuf_release(&line);1126}11271128/*1129 * Get the packed_ref_cache for the specified files_ref_store,1130 * creating it if necessary.1131 */1132static struct packed_ref_cache *get_packed_ref_cache(struct files_ref_store *refs)1133{1134char*packed_refs_file;11351136if(*refs->base.submodule)1137 packed_refs_file =git_pathdup_submodule(refs->base.submodule,1138"packed-refs");1139else1140 packed_refs_file =git_pathdup("packed-refs");11411142if(refs->packed &&1143!stat_validity_check(&refs->packed->validity, packed_refs_file))1144clear_packed_ref_cache(refs);11451146if(!refs->packed) {1147FILE*f;11481149 refs->packed =xcalloc(1,sizeof(*refs->packed));1150acquire_packed_ref_cache(refs->packed);1151 refs->packed->root =create_dir_entry(refs,"",0,0);1152 f =fopen(packed_refs_file,"r");1153if(f) {1154stat_validity_update(&refs->packed->validity,fileno(f));1155read_packed_refs(f,get_ref_dir(refs->packed->root));1156fclose(f);1157}1158}1159free(packed_refs_file);1160return refs->packed;1161}11621163static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1164{1165returnget_ref_dir(packed_ref_cache->root);1166}11671168static struct ref_dir *get_packed_refs(struct files_ref_store *refs)1169{1170returnget_packed_ref_dir(get_packed_ref_cache(refs));1171}11721173/*1174 * Add a reference to the in-memory packed reference cache. This may1175 * only be called while the packed-refs file is locked (see1176 * lock_packed_refs()). To actually write the packed-refs file, call1177 * commit_packed_refs().1178 */1179static voidadd_packed_ref(struct files_ref_store *refs,1180const char*refname,const unsigned char*sha1)1181{1182struct packed_ref_cache *packed_ref_cache =get_packed_ref_cache(refs);11831184if(!packed_ref_cache->lock)1185die("internal error: packed refs not locked");1186add_ref(get_packed_ref_dir(packed_ref_cache),1187create_ref_entry(refname, sha1, REF_ISPACKED,1));1188}11891190/*1191 * Read the loose references from the namespace dirname into dir1192 * (without recursing). dirname must end with '/'. dir must be the1193 * directory entry corresponding to dirname.1194 */1195static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1196{1197struct files_ref_store *refs = dir->ref_store;1198DIR*d;1199struct dirent *de;1200int dirnamelen =strlen(dirname);1201struct strbuf refname;1202struct strbuf path = STRBUF_INIT;1203size_t path_baselen;12041205if(*refs->base.submodule)1206strbuf_git_path_submodule(&path, refs->base.submodule,"%s", dirname);1207else1208strbuf_git_path(&path,"%s", dirname);1209 path_baselen = path.len;12101211 d =opendir(path.buf);1212if(!d) {1213strbuf_release(&path);1214return;1215}12161217strbuf_init(&refname, dirnamelen +257);1218strbuf_add(&refname, dirname, dirnamelen);12191220while((de =readdir(d)) != NULL) {1221unsigned char sha1[20];1222struct stat st;1223int flag;12241225if(de->d_name[0] =='.')1226continue;1227if(ends_with(de->d_name,".lock"))1228continue;1229strbuf_addstr(&refname, de->d_name);1230strbuf_addstr(&path, de->d_name);1231if(stat(path.buf, &st) <0) {1232;/* silently ignore */1233}else if(S_ISDIR(st.st_mode)) {1234strbuf_addch(&refname,'/');1235add_entry_to_dir(dir,1236create_dir_entry(refs, refname.buf,1237 refname.len,1));1238}else{1239int read_ok;12401241if(*refs->base.submodule) {1242hashclr(sha1);1243 flag =0;1244 read_ok = !resolve_gitlink_ref(refs->base.submodule,1245 refname.buf, sha1);1246}else{1247 read_ok = !read_ref_full(refname.buf,1248 RESOLVE_REF_READING,1249 sha1, &flag);1250}12511252if(!read_ok) {1253hashclr(sha1);1254 flag |= REF_ISBROKEN;1255}else if(is_null_sha1(sha1)) {1256/*1257 * It is so astronomically unlikely1258 * that NULL_SHA1 is the SHA-1 of an1259 * actual object that we consider its1260 * appearance in a loose reference1261 * file to be repo corruption1262 * (probably due to a software bug).1263 */1264 flag |= REF_ISBROKEN;1265}12661267if(check_refname_format(refname.buf,1268 REFNAME_ALLOW_ONELEVEL)) {1269if(!refname_is_safe(refname.buf))1270die("loose refname is dangerous:%s", refname.buf);1271hashclr(sha1);1272 flag |= REF_BAD_NAME | REF_ISBROKEN;1273}1274add_entry_to_dir(dir,1275create_ref_entry(refname.buf, sha1, flag,0));1276}1277strbuf_setlen(&refname, dirnamelen);1278strbuf_setlen(&path, path_baselen);1279}1280strbuf_release(&refname);1281strbuf_release(&path);1282closedir(d);1283}12841285static struct ref_dir *get_loose_refs(struct files_ref_store *refs)1286{1287if(!refs->loose) {1288/*1289 * Mark the top-level directory complete because we1290 * are about to read the only subdirectory that can1291 * hold references:1292 */1293 refs->loose =create_dir_entry(refs,"",0,0);1294/*1295 * Create an incomplete entry for "refs/":1296 */1297add_entry_to_dir(get_ref_dir(refs->loose),1298create_dir_entry(refs,"refs/",5,1));1299}1300returnget_ref_dir(refs->loose);1301}13021303/*1304 * Return the ref_entry for the given refname from the packed1305 * references. If it does not exist, return NULL.1306 */1307static struct ref_entry *get_packed_ref(struct files_ref_store *refs,1308const char*refname)1309{1310returnfind_ref(get_packed_refs(refs), refname);1311}13121313/*1314 * A loose ref file doesn't exist; check for a packed ref.1315 */1316static intresolve_packed_ref(struct files_ref_store *refs,1317const char*refname,1318unsigned char*sha1,unsigned int*flags)1319{1320struct ref_entry *entry;13211322/*1323 * The loose reference file does not exist; check for a packed1324 * reference.1325 */1326 entry =get_packed_ref(refs, refname);1327if(entry) {1328hashcpy(sha1, entry->u.value.oid.hash);1329*flags |= REF_ISPACKED;1330return0;1331}1332/* refname is not a packed reference. */1333return-1;1334}13351336static intfiles_read_raw_ref(struct ref_store *ref_store,1337const char*refname,unsigned char*sha1,1338struct strbuf *referent,unsigned int*type)1339{1340struct files_ref_store *refs =1341files_downcast(ref_store,1,"read_raw_ref");1342struct strbuf sb_contents = STRBUF_INIT;1343struct strbuf sb_path = STRBUF_INIT;1344const char*path;1345const char*buf;1346struct stat st;1347int fd;1348int ret = -1;1349int save_errno;13501351*type =0;1352strbuf_reset(&sb_path);13531354if(*refs->base.submodule)1355strbuf_git_path_submodule(&sb_path, refs->base.submodule,"%s", refname);1356else1357strbuf_git_path(&sb_path,"%s", refname);13581359 path = sb_path.buf;13601361stat_ref:1362/*1363 * We might have to loop back here to avoid a race1364 * condition: first we lstat() the file, then we try1365 * to read it as a link or as a file. But if somebody1366 * changes the type of the file (file <-> directory1367 * <-> symlink) between the lstat() and reading, then1368 * we don't want to report that as an error but rather1369 * try again starting with the lstat().1370 */13711372if(lstat(path, &st) <0) {1373if(errno != ENOENT)1374goto out;1375if(resolve_packed_ref(refs, refname, sha1, type)) {1376 errno = ENOENT;1377goto out;1378}1379 ret =0;1380goto out;1381}13821383/* Follow "normalized" - ie "refs/.." symlinks by hand */1384if(S_ISLNK(st.st_mode)) {1385strbuf_reset(&sb_contents);1386if(strbuf_readlink(&sb_contents, path,0) <0) {1387if(errno == ENOENT || errno == EINVAL)1388/* inconsistent with lstat; retry */1389goto stat_ref;1390else1391goto out;1392}1393if(starts_with(sb_contents.buf,"refs/") &&1394!check_refname_format(sb_contents.buf,0)) {1395strbuf_swap(&sb_contents, referent);1396*type |= REF_ISSYMREF;1397 ret =0;1398goto out;1399}1400}14011402/* Is it a directory? */1403if(S_ISDIR(st.st_mode)) {1404/*1405 * Even though there is a directory where the loose1406 * ref is supposed to be, there could still be a1407 * packed ref:1408 */1409if(resolve_packed_ref(refs, refname, sha1, type)) {1410 errno = EISDIR;1411goto out;1412}1413 ret =0;1414goto out;1415}14161417/*1418 * Anything else, just open it and try to use it as1419 * a ref1420 */1421 fd =open(path, O_RDONLY);1422if(fd <0) {1423if(errno == ENOENT)1424/* inconsistent with lstat; retry */1425goto stat_ref;1426else1427goto out;1428}1429strbuf_reset(&sb_contents);1430if(strbuf_read(&sb_contents, fd,256) <0) {1431int save_errno = errno;1432close(fd);1433 errno = save_errno;1434goto out;1435}1436close(fd);1437strbuf_rtrim(&sb_contents);1438 buf = sb_contents.buf;1439if(starts_with(buf,"ref:")) {1440 buf +=4;1441while(isspace(*buf))1442 buf++;14431444strbuf_reset(referent);1445strbuf_addstr(referent, buf);1446*type |= REF_ISSYMREF;1447 ret =0;1448goto out;1449}14501451/*1452 * Please note that FETCH_HEAD has additional1453 * data after the sha.1454 */1455if(get_sha1_hex(buf, sha1) ||1456(buf[40] !='\0'&& !isspace(buf[40]))) {1457*type |= REF_ISBROKEN;1458 errno = EINVAL;1459goto out;1460}14611462 ret =0;14631464out:1465 save_errno = errno;1466strbuf_release(&sb_path);1467strbuf_release(&sb_contents);1468 errno = save_errno;1469return ret;1470}14711472static voidunlock_ref(struct ref_lock *lock)1473{1474/* Do not free lock->lk -- atexit() still looks at them */1475if(lock->lk)1476rollback_lock_file(lock->lk);1477free(lock->ref_name);1478free(lock);1479}14801481/*1482 * Lock refname, without following symrefs, and set *lock_p to point1483 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1484 * and type similarly to read_raw_ref().1485 *1486 * The caller must verify that refname is a "safe" reference name (in1487 * the sense of refname_is_safe()) before calling this function.1488 *1489 * If the reference doesn't already exist, verify that refname doesn't1490 * have a D/F conflict with any existing references. extras and skip1491 * are passed to verify_refname_available_dir() for this check.1492 *1493 * If mustexist is not set and the reference is not found or is1494 * broken, lock the reference anyway but clear sha1.1495 *1496 * Return 0 on success. On failure, write an error message to err and1497 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1498 *1499 * Implementation note: This function is basically1500 *1501 * lock reference1502 * read_raw_ref()1503 *1504 * but it includes a lot more code to1505 * - Deal with possible races with other processes1506 * - Avoid calling verify_refname_available_dir() when it can be1507 * avoided, namely if we were successfully able to read the ref1508 * - Generate informative error messages in the case of failure1509 */1510static intlock_raw_ref(struct files_ref_store *refs,1511const char*refname,int mustexist,1512const struct string_list *extras,1513const struct string_list *skip,1514struct ref_lock **lock_p,1515struct strbuf *referent,1516unsigned int*type,1517struct strbuf *err)1518{1519struct ref_lock *lock;1520struct strbuf ref_file = STRBUF_INIT;1521int attempts_remaining =3;1522int ret = TRANSACTION_GENERIC_ERROR;15231524assert(err);1525assert_main_repository(&refs->base,"lock_raw_ref");15261527*type =0;15281529/* First lock the file so it can't change out from under us. */15301531*lock_p = lock =xcalloc(1,sizeof(*lock));15321533 lock->ref_name =xstrdup(refname);1534strbuf_git_path(&ref_file,"%s", refname);15351536retry:1537switch(safe_create_leading_directories(ref_file.buf)) {1538case SCLD_OK:1539break;/* success */1540case SCLD_EXISTS:1541/*1542 * Suppose refname is "refs/foo/bar". We just failed1543 * to create the containing directory, "refs/foo",1544 * because there was a non-directory in the way. This1545 * indicates a D/F conflict, probably because of1546 * another reference such as "refs/foo". There is no1547 * reason to expect this error to be transitory.1548 */1549if(verify_refname_available(refname, extras, skip, err)) {1550if(mustexist) {1551/*1552 * To the user the relevant error is1553 * that the "mustexist" reference is1554 * missing:1555 */1556strbuf_reset(err);1557strbuf_addf(err,"unable to resolve reference '%s'",1558 refname);1559}else{1560/*1561 * The error message set by1562 * verify_refname_available_dir() is OK.1563 */1564 ret = TRANSACTION_NAME_CONFLICT;1565}1566}else{1567/*1568 * The file that is in the way isn't a loose1569 * reference. Report it as a low-level1570 * failure.1571 */1572strbuf_addf(err,"unable to create lock file%s.lock; "1573"non-directory in the way",1574 ref_file.buf);1575}1576goto error_return;1577case SCLD_VANISHED:1578/* Maybe another process was tidying up. Try again. */1579if(--attempts_remaining >0)1580goto retry;1581/* fall through */1582default:1583strbuf_addf(err,"unable to create directory for%s",1584 ref_file.buf);1585goto error_return;1586}15871588if(!lock->lk)1589 lock->lk =xcalloc(1,sizeof(struct lock_file));15901591if(hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) <0) {1592if(errno == ENOENT && --attempts_remaining >0) {1593/*1594 * Maybe somebody just deleted one of the1595 * directories leading to ref_file. Try1596 * again:1597 */1598goto retry;1599}else{1600unable_to_lock_message(ref_file.buf, errno, err);1601goto error_return;1602}1603}16041605/*1606 * Now we hold the lock and can read the reference without1607 * fear that its value will change.1608 */16091610if(files_read_raw_ref(&refs->base, refname,1611 lock->old_oid.hash, referent, type)) {1612if(errno == ENOENT) {1613if(mustexist) {1614/* Garden variety missing reference. */1615strbuf_addf(err,"unable to resolve reference '%s'",1616 refname);1617goto error_return;1618}else{1619/*1620 * Reference is missing, but that's OK. We1621 * know that there is not a conflict with1622 * another loose reference because1623 * (supposing that we are trying to lock1624 * reference "refs/foo/bar"):1625 *1626 * - We were successfully able to create1627 * the lockfile refs/foo/bar.lock, so we1628 * know there cannot be a loose reference1629 * named "refs/foo".1630 *1631 * - We got ENOENT and not EISDIR, so we1632 * know that there cannot be a loose1633 * reference named "refs/foo/bar/baz".1634 */1635}1636}else if(errno == EISDIR) {1637/*1638 * There is a directory in the way. It might have1639 * contained references that have been deleted. If1640 * we don't require that the reference already1641 * exists, try to remove the directory so that it1642 * doesn't cause trouble when we want to rename the1643 * lockfile into place later.1644 */1645if(mustexist) {1646/* Garden variety missing reference. */1647strbuf_addf(err,"unable to resolve reference '%s'",1648 refname);1649goto error_return;1650}else if(remove_dir_recursively(&ref_file,1651 REMOVE_DIR_EMPTY_ONLY)) {1652if(verify_refname_available_dir(1653 refname, extras, skip,1654get_loose_refs(refs),1655 err)) {1656/*1657 * The error message set by1658 * verify_refname_available() is OK.1659 */1660 ret = TRANSACTION_NAME_CONFLICT;1661goto error_return;1662}else{1663/*1664 * We can't delete the directory,1665 * but we also don't know of any1666 * references that it should1667 * contain.1668 */1669strbuf_addf(err,"there is a non-empty directory '%s' "1670"blocking reference '%s'",1671 ref_file.buf, refname);1672goto error_return;1673}1674}1675}else if(errno == EINVAL && (*type & REF_ISBROKEN)) {1676strbuf_addf(err,"unable to resolve reference '%s': "1677"reference broken", refname);1678goto error_return;1679}else{1680strbuf_addf(err,"unable to resolve reference '%s':%s",1681 refname,strerror(errno));1682goto error_return;1683}16841685/*1686 * If the ref did not exist and we are creating it,1687 * make sure there is no existing packed ref whose1688 * name begins with our refname, nor a packed ref1689 * whose name is a proper prefix of our refname.1690 */1691if(verify_refname_available_dir(1692 refname, extras, skip,1693get_packed_refs(refs),1694 err)) {1695goto error_return;1696}1697}16981699 ret =0;1700goto out;17011702error_return:1703unlock_ref(lock);1704*lock_p = NULL;17051706out:1707strbuf_release(&ref_file);1708return ret;1709}17101711/*1712 * Peel the entry (if possible) and return its new peel_status. If1713 * repeel is true, re-peel the entry even if there is an old peeled1714 * value that is already stored in it.1715 *1716 * It is OK to call this function with a packed reference entry that1717 * might be stale and might even refer to an object that has since1718 * been garbage-collected. In such a case, if the entry has1719 * REF_KNOWS_PEELED then leave the status unchanged and return1720 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1721 */1722static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1723{1724enum peel_status status;17251726if(entry->flag & REF_KNOWS_PEELED) {1727if(repeel) {1728 entry->flag &= ~REF_KNOWS_PEELED;1729oidclr(&entry->u.value.peeled);1730}else{1731returnis_null_oid(&entry->u.value.peeled) ?1732 PEEL_NON_TAG : PEEL_PEELED;1733}1734}1735if(entry->flag & REF_ISBROKEN)1736return PEEL_BROKEN;1737if(entry->flag & REF_ISSYMREF)1738return PEEL_IS_SYMREF;17391740 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1741if(status == PEEL_PEELED || status == PEEL_NON_TAG)1742 entry->flag |= REF_KNOWS_PEELED;1743return status;1744}17451746static intfiles_peel_ref(struct ref_store *ref_store,1747const char*refname,unsigned char*sha1)1748{1749struct files_ref_store *refs =files_downcast(ref_store,0,"peel_ref");1750int flag;1751unsigned char base[20];17521753if(current_ref_iter && current_ref_iter->refname == refname) {1754struct object_id peeled;17551756if(ref_iterator_peel(current_ref_iter, &peeled))1757return-1;1758hashcpy(sha1, peeled.hash);1759return0;1760}17611762if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1763return-1;17641765/*1766 * If the reference is packed, read its ref_entry from the1767 * cache in the hope that we already know its peeled value.1768 * We only try this optimization on packed references because1769 * (a) forcing the filling of the loose reference cache could1770 * be expensive and (b) loose references anyway usually do not1771 * have REF_KNOWS_PEELED.1772 */1773if(flag & REF_ISPACKED) {1774struct ref_entry *r =get_packed_ref(refs, refname);1775if(r) {1776if(peel_entry(r,0))1777return-1;1778hashcpy(sha1, r->u.value.peeled.hash);1779return0;1780}1781}17821783returnpeel_object(base, sha1);1784}17851786struct files_ref_iterator {1787struct ref_iterator base;17881789struct packed_ref_cache *packed_ref_cache;1790struct ref_iterator *iter0;1791unsigned int flags;1792};17931794static intfiles_ref_iterator_advance(struct ref_iterator *ref_iterator)1795{1796struct files_ref_iterator *iter =1797(struct files_ref_iterator *)ref_iterator;1798int ok;17991800while((ok =ref_iterator_advance(iter->iter0)) == ITER_OK) {1801if(!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&1802!ref_resolves_to_object(iter->iter0->refname,1803 iter->iter0->oid,1804 iter->iter0->flags))1805continue;18061807 iter->base.refname = iter->iter0->refname;1808 iter->base.oid = iter->iter0->oid;1809 iter->base.flags = iter->iter0->flags;1810return ITER_OK;1811}18121813 iter->iter0 = NULL;1814if(ref_iterator_abort(ref_iterator) != ITER_DONE)1815 ok = ITER_ERROR;18161817return ok;1818}18191820static intfiles_ref_iterator_peel(struct ref_iterator *ref_iterator,1821struct object_id *peeled)1822{1823struct files_ref_iterator *iter =1824(struct files_ref_iterator *)ref_iterator;18251826returnref_iterator_peel(iter->iter0, peeled);1827}18281829static intfiles_ref_iterator_abort(struct ref_iterator *ref_iterator)1830{1831struct files_ref_iterator *iter =1832(struct files_ref_iterator *)ref_iterator;1833int ok = ITER_DONE;18341835if(iter->iter0)1836 ok =ref_iterator_abort(iter->iter0);18371838release_packed_ref_cache(iter->packed_ref_cache);1839base_ref_iterator_free(ref_iterator);1840return ok;1841}18421843static struct ref_iterator_vtable files_ref_iterator_vtable = {1844 files_ref_iterator_advance,1845 files_ref_iterator_peel,1846 files_ref_iterator_abort1847};18481849static struct ref_iterator *files_ref_iterator_begin(1850struct ref_store *ref_store,1851const char*prefix,unsigned int flags)1852{1853struct files_ref_store *refs =1854files_downcast(ref_store,1,"ref_iterator_begin");1855struct ref_dir *loose_dir, *packed_dir;1856struct ref_iterator *loose_iter, *packed_iter;1857struct files_ref_iterator *iter;1858struct ref_iterator *ref_iterator;18591860if(!refs)1861returnempty_ref_iterator_begin();18621863if(ref_paranoia <0)1864 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1865if(ref_paranoia)1866 flags |= DO_FOR_EACH_INCLUDE_BROKEN;18671868 iter =xcalloc(1,sizeof(*iter));1869 ref_iterator = &iter->base;1870base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);18711872/*1873 * We must make sure that all loose refs are read before1874 * accessing the packed-refs file; this avoids a race1875 * condition if loose refs are migrated to the packed-refs1876 * file by a simultaneous process, but our in-memory view is1877 * from before the migration. We ensure this as follows:1878 * First, we call prime_ref_dir(), which pre-reads the loose1879 * references for the subtree into the cache. (If they've1880 * already been read, that's OK; we only need to guarantee1881 * that they're read before the packed refs, not *how much*1882 * before.) After that, we call get_packed_ref_cache(), which1883 * internally checks whether the packed-ref cache is up to1884 * date with what is on disk, and re-reads it if not.1885 */18861887 loose_dir =get_loose_refs(refs);18881889if(prefix && *prefix)1890 loose_dir =find_containing_dir(loose_dir, prefix,0);18911892if(loose_dir) {1893prime_ref_dir(loose_dir);1894 loose_iter =cache_ref_iterator_begin(loose_dir);1895}else{1896/* There's nothing to iterate over. */1897 loose_iter =empty_ref_iterator_begin();1898}18991900 iter->packed_ref_cache =get_packed_ref_cache(refs);1901acquire_packed_ref_cache(iter->packed_ref_cache);1902 packed_dir =get_packed_ref_dir(iter->packed_ref_cache);19031904if(prefix && *prefix)1905 packed_dir =find_containing_dir(packed_dir, prefix,0);19061907if(packed_dir) {1908 packed_iter =cache_ref_iterator_begin(packed_dir);1909}else{1910/* There's nothing to iterate over. */1911 packed_iter =empty_ref_iterator_begin();1912}19131914 iter->iter0 =overlay_ref_iterator_begin(loose_iter, packed_iter);1915 iter->flags = flags;19161917return ref_iterator;1918}19191920/*1921 * Verify that the reference locked by lock has the value old_sha1.1922 * Fail if the reference doesn't exist and mustexist is set. Return 01923 * on success. On error, write an error message to err, set errno, and1924 * return a negative value.1925 */1926static intverify_lock(struct ref_lock *lock,1927const unsigned char*old_sha1,int mustexist,1928struct strbuf *err)1929{1930assert(err);19311932if(read_ref_full(lock->ref_name,1933 mustexist ? RESOLVE_REF_READING :0,1934 lock->old_oid.hash, NULL)) {1935if(old_sha1) {1936int save_errno = errno;1937strbuf_addf(err,"can't verify ref '%s'", lock->ref_name);1938 errno = save_errno;1939return-1;1940}else{1941hashclr(lock->old_oid.hash);1942return0;1943}1944}1945if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {1946strbuf_addf(err,"ref '%s' is at%sbut expected%s",1947 lock->ref_name,1948sha1_to_hex(lock->old_oid.hash),1949sha1_to_hex(old_sha1));1950 errno = EBUSY;1951return-1;1952}1953return0;1954}19551956static intremove_empty_directories(struct strbuf *path)1957{1958/*1959 * we want to create a file but there is a directory there;1960 * if that is an empty directory (or a directory that contains1961 * only empty directories), remove them.1962 */1963returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);1964}19651966/*1967 * Locks a ref returning the lock on success and NULL on failure.1968 * On failure errno is set to something meaningful.1969 */1970static struct ref_lock *lock_ref_sha1_basic(struct files_ref_store *refs,1971const char*refname,1972const unsigned char*old_sha1,1973const struct string_list *extras,1974const struct string_list *skip,1975unsigned int flags,int*type,1976struct strbuf *err)1977{1978struct strbuf ref_file = STRBUF_INIT;1979struct ref_lock *lock;1980int last_errno =0;1981int lflags = LOCK_NO_DEREF;1982int mustexist = (old_sha1 && !is_null_sha1(old_sha1));1983int resolve_flags = RESOLVE_REF_NO_RECURSE;1984int attempts_remaining =3;1985int resolved;19861987assert_main_repository(&refs->base,"lock_ref_sha1_basic");1988assert(err);19891990 lock =xcalloc(1,sizeof(struct ref_lock));19911992if(mustexist)1993 resolve_flags |= RESOLVE_REF_READING;1994if(flags & REF_DELETING)1995 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;19961997strbuf_git_path(&ref_file,"%s", refname);1998 resolved = !!resolve_ref_unsafe(refname, resolve_flags,1999 lock->old_oid.hash, type);2000if(!resolved && errno == EISDIR) {2001/*2002 * we are trying to lock foo but we used to2003 * have foo/bar which now does not exist;2004 * it is normal for the empty directory 'foo'2005 * to remain.2006 */2007if(remove_empty_directories(&ref_file)) {2008 last_errno = errno;2009if(!verify_refname_available_dir(2010 refname, extras, skip,2011get_loose_refs(refs), err))2012strbuf_addf(err,"there are still refs under '%s'",2013 refname);2014goto error_return;2015}2016 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2017 lock->old_oid.hash, type);2018}2019if(!resolved) {2020 last_errno = errno;2021if(last_errno != ENOTDIR ||2022!verify_refname_available_dir(2023 refname, extras, skip,2024get_loose_refs(refs), err))2025strbuf_addf(err,"unable to resolve reference '%s':%s",2026 refname,strerror(last_errno));20272028goto error_return;2029}20302031/*2032 * If the ref did not exist and we are creating it, make sure2033 * there is no existing packed ref whose name begins with our2034 * refname, nor a packed ref whose name is a proper prefix of2035 * our refname.2036 */2037if(is_null_oid(&lock->old_oid) &&2038verify_refname_available_dir(refname, extras, skip,2039get_packed_refs(refs),2040 err)) {2041 last_errno = ENOTDIR;2042goto error_return;2043}20442045 lock->lk =xcalloc(1,sizeof(struct lock_file));20462047 lock->ref_name =xstrdup(refname);20482049 retry:2050switch(safe_create_leading_directories_const(ref_file.buf)) {2051case SCLD_OK:2052break;/* success */2053case SCLD_VANISHED:2054if(--attempts_remaining >0)2055goto retry;2056/* fall through */2057default:2058 last_errno = errno;2059strbuf_addf(err,"unable to create directory for '%s'",2060 ref_file.buf);2061goto error_return;2062}20632064if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {2065 last_errno = errno;2066if(errno == ENOENT && --attempts_remaining >0)2067/*2068 * Maybe somebody just deleted one of the2069 * directories leading to ref_file. Try2070 * again:2071 */2072goto retry;2073else{2074unable_to_lock_message(ref_file.buf, errno, err);2075goto error_return;2076}2077}2078if(verify_lock(lock, old_sha1, mustexist, err)) {2079 last_errno = errno;2080goto error_return;2081}2082goto out;20832084 error_return:2085unlock_ref(lock);2086 lock = NULL;20872088 out:2089strbuf_release(&ref_file);2090 errno = last_errno;2091return lock;2092}20932094/*2095 * Write an entry to the packed-refs file for the specified refname.2096 * If peeled is non-NULL, write it as the entry's peeled value.2097 */2098static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2099unsigned char*peeled)2100{2101fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2102if(peeled)2103fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2104}21052106/*2107 * An each_ref_entry_fn that writes the entry to a packed-refs file.2108 */2109static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2110{2111enum peel_status peel_status =peel_entry(entry,0);21122113if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2114error("internal error:%sis not a valid packed reference!",2115 entry->name);2116write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2117 peel_status == PEEL_PEELED ?2118 entry->u.value.peeled.hash : NULL);2119return0;2120}21212122/*2123 * Lock the packed-refs file for writing. Flags is passed to2124 * hold_lock_file_for_update(). Return 0 on success. On errors, set2125 * errno appropriately and return a nonzero value.2126 */2127static intlock_packed_refs(struct files_ref_store *refs,int flags)2128{2129static int timeout_configured =0;2130static int timeout_value =1000;2131struct packed_ref_cache *packed_ref_cache;21322133assert_main_repository(&refs->base,"lock_packed_refs");21342135if(!timeout_configured) {2136git_config_get_int("core.packedrefstimeout", &timeout_value);2137 timeout_configured =1;2138}21392140if(hold_lock_file_for_update_timeout(2141&packlock,git_path("packed-refs"),2142 flags, timeout_value) <0)2143return-1;2144/*2145 * Get the current packed-refs while holding the lock. If the2146 * packed-refs file has been modified since we last read it,2147 * this will automatically invalidate the cache and re-read2148 * the packed-refs file.2149 */2150 packed_ref_cache =get_packed_ref_cache(refs);2151 packed_ref_cache->lock = &packlock;2152/* Increment the reference count to prevent it from being freed: */2153acquire_packed_ref_cache(packed_ref_cache);2154return0;2155}21562157/*2158 * Write the current version of the packed refs cache from memory to2159 * disk. The packed-refs file must already be locked for writing (see2160 * lock_packed_refs()). Return zero on success. On errors, set errno2161 * and return a nonzero value2162 */2163static intcommit_packed_refs(struct files_ref_store *refs)2164{2165struct packed_ref_cache *packed_ref_cache =2166get_packed_ref_cache(refs);2167int error =0;2168int save_errno =0;2169FILE*out;21702171assert_main_repository(&refs->base,"commit_packed_refs");21722173if(!packed_ref_cache->lock)2174die("internal error: packed-refs not locked");21752176 out =fdopen_lock_file(packed_ref_cache->lock,"w");2177if(!out)2178die_errno("unable to fdopen packed-refs descriptor");21792180fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2181do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),21820, write_packed_entry_fn, out);21832184if(commit_lock_file(packed_ref_cache->lock)) {2185 save_errno = errno;2186 error = -1;2187}2188 packed_ref_cache->lock = NULL;2189release_packed_ref_cache(packed_ref_cache);2190 errno = save_errno;2191return error;2192}21932194/*2195 * Rollback the lockfile for the packed-refs file, and discard the2196 * in-memory packed reference cache. (The packed-refs file will be2197 * read anew if it is needed again after this function is called.)2198 */2199static voidrollback_packed_refs(struct files_ref_store *refs)2200{2201struct packed_ref_cache *packed_ref_cache =2202get_packed_ref_cache(refs);22032204assert_main_repository(&refs->base,"rollback_packed_refs");22052206if(!packed_ref_cache->lock)2207die("internal error: packed-refs not locked");2208rollback_lock_file(packed_ref_cache->lock);2209 packed_ref_cache->lock = NULL;2210release_packed_ref_cache(packed_ref_cache);2211clear_packed_ref_cache(refs);2212}22132214struct ref_to_prune {2215struct ref_to_prune *next;2216unsigned char sha1[20];2217char name[FLEX_ARRAY];2218};22192220struct pack_refs_cb_data {2221unsigned int flags;2222struct ref_dir *packed_refs;2223struct ref_to_prune *ref_to_prune;2224};22252226/*2227 * An each_ref_entry_fn that is run over loose references only. If2228 * the loose reference can be packed, add an entry in the packed ref2229 * cache. If the reference should be pruned, also add it to2230 * ref_to_prune in the pack_refs_cb_data.2231 */2232static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2233{2234struct pack_refs_cb_data *cb = cb_data;2235enum peel_status peel_status;2236struct ref_entry *packed_entry;2237int is_tag_ref =starts_with(entry->name,"refs/tags/");22382239/* Do not pack per-worktree refs: */2240if(ref_type(entry->name) != REF_TYPE_NORMAL)2241return0;22422243/* ALWAYS pack tags */2244if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2245return0;22462247/* Do not pack symbolic or broken refs: */2248if((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))2249return0;22502251/* Add a packed ref cache entry equivalent to the loose entry. */2252 peel_status =peel_entry(entry,1);2253if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2254die("internal error peeling reference%s(%s)",2255 entry->name,oid_to_hex(&entry->u.value.oid));2256 packed_entry =find_ref(cb->packed_refs, entry->name);2257if(packed_entry) {2258/* Overwrite existing packed entry with info from loose entry */2259 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2260oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2261}else{2262 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2263 REF_ISPACKED | REF_KNOWS_PEELED,0);2264add_ref(cb->packed_refs, packed_entry);2265}2266oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);22672268/* Schedule the loose reference for pruning if requested. */2269if((cb->flags & PACK_REFS_PRUNE)) {2270struct ref_to_prune *n;2271FLEX_ALLOC_STR(n, name, entry->name);2272hashcpy(n->sha1, entry->u.value.oid.hash);2273 n->next = cb->ref_to_prune;2274 cb->ref_to_prune = n;2275}2276return0;2277}22782279/*2280 * Remove empty parents, but spare refs/ and immediate subdirs.2281 * Note: munges *name.2282 */2283static voidtry_remove_empty_parents(char*name)2284{2285char*p, *q;2286int i;2287 p = name;2288for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2289while(*p && *p !='/')2290 p++;2291/* tolerate duplicate slashes; see check_refname_format() */2292while(*p =='/')2293 p++;2294}2295for(q = p; *q; q++)2296;2297while(1) {2298while(q > p && *q !='/')2299 q--;2300while(q > p && *(q-1) =='/')2301 q--;2302if(q == p)2303break;2304*q ='\0';2305if(rmdir(git_path("%s", name)))2306break;2307}2308}23092310/* make sure nobody touched the ref, and unlink */2311static voidprune_ref(struct ref_to_prune *r)2312{2313struct ref_transaction *transaction;2314struct strbuf err = STRBUF_INIT;23152316if(check_refname_format(r->name,0))2317return;23182319 transaction =ref_transaction_begin(&err);2320if(!transaction ||2321ref_transaction_delete(transaction, r->name, r->sha1,2322 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2323ref_transaction_commit(transaction, &err)) {2324ref_transaction_free(transaction);2325error("%s", err.buf);2326strbuf_release(&err);2327return;2328}2329ref_transaction_free(transaction);2330strbuf_release(&err);2331try_remove_empty_parents(r->name);2332}23332334static voidprune_refs(struct ref_to_prune *r)2335{2336while(r) {2337prune_ref(r);2338 r = r->next;2339}2340}23412342static intfiles_pack_refs(struct ref_store *ref_store,unsigned int flags)2343{2344struct files_ref_store *refs =2345files_downcast(ref_store,0,"pack_refs");2346struct pack_refs_cb_data cbdata;23472348memset(&cbdata,0,sizeof(cbdata));2349 cbdata.flags = flags;23502351lock_packed_refs(refs, LOCK_DIE_ON_ERROR);2352 cbdata.packed_refs =get_packed_refs(refs);23532354do_for_each_entry_in_dir(get_loose_refs(refs),0,2355 pack_if_possible_fn, &cbdata);23562357if(commit_packed_refs(refs))2358die_errno("unable to overwrite old ref-pack file");23592360prune_refs(cbdata.ref_to_prune);2361return0;2362}23632364/*2365 * Rewrite the packed-refs file, omitting any refs listed in2366 * 'refnames'. On error, leave packed-refs unchanged, write an error2367 * message to 'err', and return a nonzero value.2368 *2369 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2370 */2371static intrepack_without_refs(struct files_ref_store *refs,2372struct string_list *refnames,struct strbuf *err)2373{2374struct ref_dir *packed;2375struct string_list_item *refname;2376int ret, needs_repacking =0, removed =0;23772378assert_main_repository(&refs->base,"repack_without_refs");2379assert(err);23802381/* Look for a packed ref */2382for_each_string_list_item(refname, refnames) {2383if(get_packed_ref(refs, refname->string)) {2384 needs_repacking =1;2385break;2386}2387}23882389/* Avoid locking if we have nothing to do */2390if(!needs_repacking)2391return0;/* no refname exists in packed refs */23922393if(lock_packed_refs(refs,0)) {2394unable_to_lock_message(git_path("packed-refs"), errno, err);2395return-1;2396}2397 packed =get_packed_refs(refs);23982399/* Remove refnames from the cache */2400for_each_string_list_item(refname, refnames)2401if(remove_entry(packed, refname->string) != -1)2402 removed =1;2403if(!removed) {2404/*2405 * All packed entries disappeared while we were2406 * acquiring the lock.2407 */2408rollback_packed_refs(refs);2409return0;2410}24112412/* Write what remains */2413 ret =commit_packed_refs(refs);2414if(ret)2415strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2416strerror(errno));2417return ret;2418}24192420static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2421{2422assert(err);24232424if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2425/*2426 * loose. The loose file name is the same as the2427 * lockfile name, minus ".lock":2428 */2429char*loose_filename =get_locked_file_path(lock->lk);2430int res =unlink_or_msg(loose_filename, err);2431free(loose_filename);2432if(res)2433return1;2434}2435return0;2436}24372438static intfiles_delete_refs(struct ref_store *ref_store,2439struct string_list *refnames,unsigned int flags)2440{2441struct files_ref_store *refs =2442files_downcast(ref_store,0,"delete_refs");2443struct strbuf err = STRBUF_INIT;2444int i, result =0;24452446if(!refnames->nr)2447return0;24482449 result =repack_without_refs(refs, refnames, &err);2450if(result) {2451/*2452 * If we failed to rewrite the packed-refs file, then2453 * it is unsafe to try to remove loose refs, because2454 * doing so might expose an obsolete packed value for2455 * a reference that might even point at an object that2456 * has been garbage collected.2457 */2458if(refnames->nr ==1)2459error(_("could not delete reference%s:%s"),2460 refnames->items[0].string, err.buf);2461else2462error(_("could not delete references:%s"), err.buf);24632464goto out;2465}24662467for(i =0; i < refnames->nr; i++) {2468const char*refname = refnames->items[i].string;24692470if(delete_ref(refname, NULL, flags))2471 result |=error(_("could not remove reference%s"), refname);2472}24732474out:2475strbuf_release(&err);2476return result;2477}24782479/*2480 * People using contrib's git-new-workdir have .git/logs/refs ->2481 * /some/other/path/.git/logs/refs, and that may live on another device.2482 *2483 * IOW, to avoid cross device rename errors, the temporary renamed log must2484 * live into logs/refs.2485 */2486#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"24872488static intrename_tmp_log(const char*newrefname)2489{2490int attempts_remaining =4;2491struct strbuf path = STRBUF_INIT;2492int ret = -1;24932494 retry:2495strbuf_reset(&path);2496strbuf_git_path(&path,"logs/%s", newrefname);2497switch(safe_create_leading_directories_const(path.buf)) {2498case SCLD_OK:2499break;/* success */2500case SCLD_VANISHED:2501if(--attempts_remaining >0)2502goto retry;2503/* fall through */2504default:2505error("unable to create directory for%s", newrefname);2506goto out;2507}25082509if(rename(git_path(TMP_RENAMED_LOG), path.buf)) {2510if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2511/*2512 * rename(a, b) when b is an existing2513 * directory ought to result in ISDIR, but2514 * Solaris 5.8 gives ENOTDIR. Sheesh.2515 */2516if(remove_empty_directories(&path)) {2517error("Directory not empty: logs/%s", newrefname);2518goto out;2519}2520goto retry;2521}else if(errno == ENOENT && --attempts_remaining >0) {2522/*2523 * Maybe another process just deleted one of2524 * the directories in the path to newrefname.2525 * Try again from the beginning.2526 */2527goto retry;2528}else{2529error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2530 newrefname,strerror(errno));2531goto out;2532}2533}2534 ret =0;2535out:2536strbuf_release(&path);2537return ret;2538}25392540static intfiles_verify_refname_available(struct ref_store *ref_store,2541const char*newname,2542const struct string_list *extras,2543const struct string_list *skip,2544struct strbuf *err)2545{2546struct files_ref_store *refs =2547files_downcast(ref_store,1,"verify_refname_available");2548struct ref_dir *packed_refs =get_packed_refs(refs);2549struct ref_dir *loose_refs =get_loose_refs(refs);25502551if(verify_refname_available_dir(newname, extras, skip,2552 packed_refs, err) ||2553verify_refname_available_dir(newname, extras, skip,2554 loose_refs, err))2555return-1;25562557return0;2558}25592560static intwrite_ref_to_lockfile(struct ref_lock *lock,2561const unsigned char*sha1,struct strbuf *err);2562static intcommit_ref_update(struct files_ref_store *refs,2563struct ref_lock *lock,2564const unsigned char*sha1,const char*logmsg,2565struct strbuf *err);25662567static intfiles_rename_ref(struct ref_store *ref_store,2568const char*oldrefname,const char*newrefname,2569const char*logmsg)2570{2571struct files_ref_store *refs =2572files_downcast(ref_store,0,"rename_ref");2573unsigned char sha1[20], orig_sha1[20];2574int flag =0, logmoved =0;2575struct ref_lock *lock;2576struct stat loginfo;2577int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2578struct strbuf err = STRBUF_INIT;25792580if(log &&S_ISLNK(loginfo.st_mode))2581returnerror("reflog for%sis a symlink", oldrefname);25822583if(!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2584 orig_sha1, &flag))2585returnerror("refname%snot found", oldrefname);25862587if(flag & REF_ISSYMREF)2588returnerror("refname%sis a symbolic ref, renaming it is not supported",2589 oldrefname);2590if(!rename_ref_available(oldrefname, newrefname))2591return1;25922593if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2594returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2595 oldrefname,strerror(errno));25962597if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2598error("unable to delete old%s", oldrefname);2599goto rollback;2600}26012602/*2603 * Since we are doing a shallow lookup, sha1 is not the2604 * correct value to pass to delete_ref as old_sha1. But that2605 * doesn't matter, because an old_sha1 check wouldn't add to2606 * the safety anyway; we want to delete the reference whatever2607 * its current value.2608 */2609if(!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2610 sha1, NULL) &&2611delete_ref(newrefname, NULL, REF_NODEREF)) {2612if(errno==EISDIR) {2613struct strbuf path = STRBUF_INIT;2614int result;26152616strbuf_git_path(&path,"%s", newrefname);2617 result =remove_empty_directories(&path);2618strbuf_release(&path);26192620if(result) {2621error("Directory not empty:%s", newrefname);2622goto rollback;2623}2624}else{2625error("unable to delete existing%s", newrefname);2626goto rollback;2627}2628}26292630if(log &&rename_tmp_log(newrefname))2631goto rollback;26322633 logmoved = log;26342635 lock =lock_ref_sha1_basic(refs, newrefname, NULL, NULL, NULL,2636 REF_NODEREF, NULL, &err);2637if(!lock) {2638error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2639strbuf_release(&err);2640goto rollback;2641}2642hashcpy(lock->old_oid.hash, orig_sha1);26432644if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2645commit_ref_update(refs, lock, orig_sha1, logmsg, &err)) {2646error("unable to write current sha1 into%s:%s", newrefname, err.buf);2647strbuf_release(&err);2648goto rollback;2649}26502651return0;26522653 rollback:2654 lock =lock_ref_sha1_basic(refs, oldrefname, NULL, NULL, NULL,2655 REF_NODEREF, NULL, &err);2656if(!lock) {2657error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2658strbuf_release(&err);2659goto rollbacklog;2660}26612662 flag = log_all_ref_updates;2663 log_all_ref_updates =0;2664if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2665commit_ref_update(refs, lock, orig_sha1, NULL, &err)) {2666error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2667strbuf_release(&err);2668}2669 log_all_ref_updates = flag;26702671 rollbacklog:2672if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2673error("unable to restore logfile%sfrom%s:%s",2674 oldrefname, newrefname,strerror(errno));2675if(!logmoved && log &&2676rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2677error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2678 oldrefname,strerror(errno));26792680return1;2681}26822683static intclose_ref(struct ref_lock *lock)2684{2685if(close_lock_file(lock->lk))2686return-1;2687return0;2688}26892690static intcommit_ref(struct ref_lock *lock)2691{2692char*path =get_locked_file_path(lock->lk);2693struct stat st;26942695if(!lstat(path, &st) &&S_ISDIR(st.st_mode)) {2696/*2697 * There is a directory at the path we want to rename2698 * the lockfile to. Hopefully it is empty; try to2699 * delete it.2700 */2701size_t len =strlen(path);2702struct strbuf sb_path = STRBUF_INIT;27032704strbuf_attach(&sb_path, path, len, len);27052706/*2707 * If this fails, commit_lock_file() will also fail2708 * and will report the problem.2709 */2710remove_empty_directories(&sb_path);2711strbuf_release(&sb_path);2712}else{2713free(path);2714}27152716if(commit_lock_file(lock->lk))2717return-1;2718return0;2719}27202721/*2722 * Create a reflog for a ref. If force_create = 0, the reflog will2723 * only be created for certain refs (those for which2724 * should_autocreate_reflog returns non-zero. Otherwise, create it2725 * regardless of the ref name. Fill in *err and return -1 on failure.2726 */2727static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)2728{2729int logfd, oflags = O_APPEND | O_WRONLY;27302731strbuf_git_path(logfile,"logs/%s", refname);2732if(force_create ||should_autocreate_reflog(refname)) {2733if(safe_create_leading_directories(logfile->buf) <0) {2734strbuf_addf(err,"unable to create directory for '%s': "2735"%s", logfile->buf,strerror(errno));2736return-1;2737}2738 oflags |= O_CREAT;2739}27402741 logfd =open(logfile->buf, oflags,0666);2742if(logfd <0) {2743if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2744return0;27452746if(errno == EISDIR) {2747if(remove_empty_directories(logfile)) {2748strbuf_addf(err,"there are still logs under "2749"'%s'", logfile->buf);2750return-1;2751}2752 logfd =open(logfile->buf, oflags,0666);2753}27542755if(logfd <0) {2756strbuf_addf(err,"unable to append to '%s':%s",2757 logfile->buf,strerror(errno));2758return-1;2759}2760}27612762adjust_shared_perm(logfile->buf);2763close(logfd);2764return0;2765}276627672768static intfiles_create_reflog(struct ref_store *ref_store,2769const char*refname,int force_create,2770struct strbuf *err)2771{2772int ret;2773struct strbuf sb = STRBUF_INIT;27742775/* Check validity (but we don't need the result): */2776files_downcast(ref_store,0,"create_reflog");27772778 ret =log_ref_setup(refname, &sb, err, force_create);2779strbuf_release(&sb);2780return ret;2781}27822783static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2784const unsigned char*new_sha1,2785const char*committer,const char*msg)2786{2787int msglen, written;2788unsigned maxlen, len;2789char*logrec;27902791 msglen = msg ?strlen(msg) :0;2792 maxlen =strlen(committer) + msglen +100;2793 logrec =xmalloc(maxlen);2794 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2795sha1_to_hex(old_sha1),2796sha1_to_hex(new_sha1),2797 committer);2798if(msglen)2799 len +=copy_reflog_msg(logrec + len -1, msg) -1;28002801 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2802free(logrec);2803if(written != len)2804return-1;28052806return0;2807}28082809static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,2810const unsigned char*new_sha1,const char*msg,2811struct strbuf *logfile,int flags,2812struct strbuf *err)2813{2814int logfd, result, oflags = O_APPEND | O_WRONLY;28152816if(log_all_ref_updates <0)2817 log_all_ref_updates = !is_bare_repository();28182819 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);28202821if(result)2822return result;28232824 logfd =open(logfile->buf, oflags);2825if(logfd <0)2826return0;2827 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2828git_committer_info(0), msg);2829if(result) {2830strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2831strerror(errno));2832close(logfd);2833return-1;2834}2835if(close(logfd)) {2836strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2837strerror(errno));2838return-1;2839}2840return0;2841}28422843static intlog_ref_write(const char*refname,const unsigned char*old_sha1,2844const unsigned char*new_sha1,const char*msg,2845int flags,struct strbuf *err)2846{2847returnfiles_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2848 err);2849}28502851intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2852const unsigned char*new_sha1,const char*msg,2853int flags,struct strbuf *err)2854{2855struct strbuf sb = STRBUF_INIT;2856int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2857 err);2858strbuf_release(&sb);2859return ret;2860}28612862/*2863 * Write sha1 into the open lockfile, then close the lockfile. On2864 * errors, rollback the lockfile, fill in *err and2865 * return -1.2866 */2867static intwrite_ref_to_lockfile(struct ref_lock *lock,2868const unsigned char*sha1,struct strbuf *err)2869{2870static char term ='\n';2871struct object *o;2872int fd;28732874 o =parse_object(sha1);2875if(!o) {2876strbuf_addf(err,2877"trying to write ref '%s' with nonexistent object%s",2878 lock->ref_name,sha1_to_hex(sha1));2879unlock_ref(lock);2880return-1;2881}2882if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2883strbuf_addf(err,2884"trying to write non-commit object%sto branch '%s'",2885sha1_to_hex(sha1), lock->ref_name);2886unlock_ref(lock);2887return-1;2888}2889 fd =get_lock_file_fd(lock->lk);2890if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2891write_in_full(fd, &term,1) !=1||2892close_ref(lock) <0) {2893strbuf_addf(err,2894"couldn't write '%s'",get_lock_file_path(lock->lk));2895unlock_ref(lock);2896return-1;2897}2898return0;2899}29002901/*2902 * Commit a change to a loose reference that has already been written2903 * to the loose reference lockfile. Also update the reflogs if2904 * necessary, using the specified lockmsg (which can be NULL).2905 */2906static intcommit_ref_update(struct files_ref_store *refs,2907struct ref_lock *lock,2908const unsigned char*sha1,const char*logmsg,2909struct strbuf *err)2910{2911assert_main_repository(&refs->base,"commit_ref_update");29122913clear_loose_ref_cache(refs);2914if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg,0, err)) {2915char*old_msg =strbuf_detach(err, NULL);2916strbuf_addf(err,"cannot update the ref '%s':%s",2917 lock->ref_name, old_msg);2918free(old_msg);2919unlock_ref(lock);2920return-1;2921}29222923if(strcmp(lock->ref_name,"HEAD") !=0) {2924/*2925 * Special hack: If a branch is updated directly and HEAD2926 * points to it (may happen on the remote side of a push2927 * for example) then logically the HEAD reflog should be2928 * updated too.2929 * A generic solution implies reverse symref information,2930 * but finding all symrefs pointing to the given branch2931 * would be rather costly for this rare event (the direct2932 * update of a branch) to be worth it. So let's cheat and2933 * check with HEAD only which should cover 99% of all usage2934 * scenarios (even 100% of the default ones).2935 */2936unsigned char head_sha1[20];2937int head_flag;2938const char*head_ref;29392940 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,2941 head_sha1, &head_flag);2942if(head_ref && (head_flag & REF_ISSYMREF) &&2943!strcmp(head_ref, lock->ref_name)) {2944struct strbuf log_err = STRBUF_INIT;2945if(log_ref_write("HEAD", lock->old_oid.hash, sha1,2946 logmsg,0, &log_err)) {2947error("%s", log_err.buf);2948strbuf_release(&log_err);2949}2950}2951}29522953if(commit_ref(lock)) {2954strbuf_addf(err,"couldn't set '%s'", lock->ref_name);2955unlock_ref(lock);2956return-1;2957}29582959unlock_ref(lock);2960return0;2961}29622963static intcreate_ref_symlink(struct ref_lock *lock,const char*target)2964{2965int ret = -1;2966#ifndef NO_SYMLINK_HEAD2967char*ref_path =get_locked_file_path(lock->lk);2968unlink(ref_path);2969 ret =symlink(target, ref_path);2970free(ref_path);29712972if(ret)2973fprintf(stderr,"no symlink - falling back to symbolic ref\n");2974#endif2975return ret;2976}29772978static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,2979const char*target,const char*logmsg)2980{2981struct strbuf err = STRBUF_INIT;2982unsigned char new_sha1[20];2983if(logmsg && !read_ref(target, new_sha1) &&2984log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg,0, &err)) {2985error("%s", err.buf);2986strbuf_release(&err);2987}2988}29892990static intcreate_symref_locked(struct ref_lock *lock,const char*refname,2991const char*target,const char*logmsg)2992{2993if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {2994update_symref_reflog(lock, refname, target, logmsg);2995return0;2996}29972998if(!fdopen_lock_file(lock->lk,"w"))2999returnerror("unable to fdopen%s:%s",3000 lock->lk->tempfile.filename.buf,strerror(errno));30013002update_symref_reflog(lock, refname, target, logmsg);30033004/* no error check; commit_ref will check ferror */3005fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);3006if(commit_ref(lock) <0)3007returnerror("unable to write symref for%s:%s", refname,3008strerror(errno));3009return0;3010}30113012static intfiles_create_symref(struct ref_store *ref_store,3013const char*refname,const char*target,3014const char*logmsg)3015{3016struct files_ref_store *refs =3017files_downcast(ref_store,0,"create_symref");3018struct strbuf err = STRBUF_INIT;3019struct ref_lock *lock;3020int ret;30213022 lock =lock_ref_sha1_basic(refs, refname, NULL,3023 NULL, NULL, REF_NODEREF, NULL,3024&err);3025if(!lock) {3026error("%s", err.buf);3027strbuf_release(&err);3028return-1;3029}30303031 ret =create_symref_locked(lock, refname, target, logmsg);3032unlock_ref(lock);3033return ret;3034}30353036intset_worktree_head_symref(const char*gitdir,const char*target)3037{3038static struct lock_file head_lock;3039struct ref_lock *lock;3040struct strbuf head_path = STRBUF_INIT;3041const char*head_rel;3042int ret;30433044strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));3045if(hold_lock_file_for_update(&head_lock, head_path.buf,3046 LOCK_NO_DEREF) <0) {3047struct strbuf err = STRBUF_INIT;3048unable_to_lock_message(head_path.buf, errno, &err);3049error("%s", err.buf);3050strbuf_release(&err);3051strbuf_release(&head_path);3052return-1;3053}30543055/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3056 linked trees */3057 head_rel =remove_leading_path(head_path.buf,3058absolute_path(get_git_common_dir()));3059/* to make use of create_symref_locked(), initialize ref_lock */3060 lock =xcalloc(1,sizeof(struct ref_lock));3061 lock->lk = &head_lock;3062 lock->ref_name =xstrdup(head_rel);30633064 ret =create_symref_locked(lock, head_rel, target, NULL);30653066unlock_ref(lock);/* will free lock */3067strbuf_release(&head_path);3068return ret;3069}30703071static intfiles_reflog_exists(struct ref_store *ref_store,3072const char*refname)3073{3074struct stat st;30753076/* Check validity (but we don't need the result): */3077files_downcast(ref_store,0,"reflog_exists");30783079return!lstat(git_path("logs/%s", refname), &st) &&3080S_ISREG(st.st_mode);3081}30823083static intfiles_delete_reflog(struct ref_store *ref_store,3084const char*refname)3085{3086/* Check validity (but we don't need the result): */3087files_downcast(ref_store,0,"delete_reflog");30883089returnremove_path(git_path("logs/%s", refname));3090}30913092static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3093{3094unsigned char osha1[20], nsha1[20];3095char*email_end, *message;3096unsigned long timestamp;3097int tz;30983099/* old SP new SP name <email> SP time TAB msg LF */3100if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3101get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3102get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3103!(email_end =strchr(sb->buf +82,'>')) ||3104 email_end[1] !=' '||3105!(timestamp =strtoul(email_end +2, &message,10)) ||3106!message || message[0] !=' '||3107(message[1] !='+'&& message[1] !='-') ||3108!isdigit(message[2]) || !isdigit(message[3]) ||3109!isdigit(message[4]) || !isdigit(message[5]))3110return0;/* corrupt? */3111 email_end[1] ='\0';3112 tz =strtol(message +1, NULL,10);3113if(message[6] !='\t')3114 message +=6;3115else3116 message +=7;3117returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3118}31193120static char*find_beginning_of_line(char*bob,char*scan)3121{3122while(bob < scan && *(--scan) !='\n')3123;/* keep scanning backwards */3124/*3125 * Return either beginning of the buffer, or LF at the end of3126 * the previous line.3127 */3128return scan;3129}31303131static intfiles_for_each_reflog_ent_reverse(struct ref_store *ref_store,3132const char*refname,3133 each_reflog_ent_fn fn,3134void*cb_data)3135{3136struct strbuf sb = STRBUF_INIT;3137FILE*logfp;3138long pos;3139int ret =0, at_tail =1;31403141/* Check validity (but we don't need the result): */3142files_downcast(ref_store,0,"for_each_reflog_ent_reverse");31433144 logfp =fopen(git_path("logs/%s", refname),"r");3145if(!logfp)3146return-1;31473148/* Jump to the end */3149if(fseek(logfp,0, SEEK_END) <0)3150returnerror("cannot seek back reflog for%s:%s",3151 refname,strerror(errno));3152 pos =ftell(logfp);3153while(!ret &&0< pos) {3154int cnt;3155size_t nread;3156char buf[BUFSIZ];3157char*endp, *scanp;31583159/* Fill next block from the end */3160 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3161if(fseek(logfp, pos - cnt, SEEK_SET))3162returnerror("cannot seek back reflog for%s:%s",3163 refname,strerror(errno));3164 nread =fread(buf, cnt,1, logfp);3165if(nread !=1)3166returnerror("cannot read%dbytes from reflog for%s:%s",3167 cnt, refname,strerror(errno));3168 pos -= cnt;31693170 scanp = endp = buf + cnt;3171if(at_tail && scanp[-1] =='\n')3172/* Looking at the final LF at the end of the file */3173 scanp--;3174 at_tail =0;31753176while(buf < scanp) {3177/*3178 * terminating LF of the previous line, or the beginning3179 * of the buffer.3180 */3181char*bp;31823183 bp =find_beginning_of_line(buf, scanp);31843185if(*bp =='\n') {3186/*3187 * The newline is the end of the previous line,3188 * so we know we have complete line starting3189 * at (bp + 1). Prefix it onto any prior data3190 * we collected for the line and process it.3191 */3192strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3193 scanp = bp;3194 endp = bp +1;3195 ret =show_one_reflog_ent(&sb, fn, cb_data);3196strbuf_reset(&sb);3197if(ret)3198break;3199}else if(!pos) {3200/*3201 * We are at the start of the buffer, and the3202 * start of the file; there is no previous3203 * line, and we have everything for this one.3204 * Process it, and we can end the loop.3205 */3206strbuf_splice(&sb,0,0, buf, endp - buf);3207 ret =show_one_reflog_ent(&sb, fn, cb_data);3208strbuf_reset(&sb);3209break;3210}32113212if(bp == buf) {3213/*3214 * We are at the start of the buffer, and there3215 * is more file to read backwards. Which means3216 * we are in the middle of a line. Note that we3217 * may get here even if *bp was a newline; that3218 * just means we are at the exact end of the3219 * previous line, rather than some spot in the3220 * middle.3221 *3222 * Save away what we have to be combined with3223 * the data from the next read.3224 */3225strbuf_splice(&sb,0,0, buf, endp - buf);3226break;3227}3228}32293230}3231if(!ret && sb.len)3232die("BUG: reverse reflog parser had leftover data");32333234fclose(logfp);3235strbuf_release(&sb);3236return ret;3237}32383239static intfiles_for_each_reflog_ent(struct ref_store *ref_store,3240const char*refname,3241 each_reflog_ent_fn fn,void*cb_data)3242{3243FILE*logfp;3244struct strbuf sb = STRBUF_INIT;3245int ret =0;32463247/* Check validity (but we don't need the result): */3248files_downcast(ref_store,0,"for_each_reflog_ent");32493250 logfp =fopen(git_path("logs/%s", refname),"r");3251if(!logfp)3252return-1;32533254while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3255 ret =show_one_reflog_ent(&sb, fn, cb_data);3256fclose(logfp);3257strbuf_release(&sb);3258return ret;3259}32603261struct files_reflog_iterator {3262struct ref_iterator base;32633264struct dir_iterator *dir_iterator;3265struct object_id oid;3266};32673268static intfiles_reflog_iterator_advance(struct ref_iterator *ref_iterator)3269{3270struct files_reflog_iterator *iter =3271(struct files_reflog_iterator *)ref_iterator;3272struct dir_iterator *diter = iter->dir_iterator;3273int ok;32743275while((ok =dir_iterator_advance(diter)) == ITER_OK) {3276int flags;32773278if(!S_ISREG(diter->st.st_mode))3279continue;3280if(diter->basename[0] =='.')3281continue;3282if(ends_with(diter->basename,".lock"))3283continue;32843285if(read_ref_full(diter->relative_path,0,3286 iter->oid.hash, &flags)) {3287error("bad ref for%s", diter->path.buf);3288continue;3289}32903291 iter->base.refname = diter->relative_path;3292 iter->base.oid = &iter->oid;3293 iter->base.flags = flags;3294return ITER_OK;3295}32963297 iter->dir_iterator = NULL;3298if(ref_iterator_abort(ref_iterator) == ITER_ERROR)3299 ok = ITER_ERROR;3300return ok;3301}33023303static intfiles_reflog_iterator_peel(struct ref_iterator *ref_iterator,3304struct object_id *peeled)3305{3306die("BUG: ref_iterator_peel() called for reflog_iterator");3307}33083309static intfiles_reflog_iterator_abort(struct ref_iterator *ref_iterator)3310{3311struct files_reflog_iterator *iter =3312(struct files_reflog_iterator *)ref_iterator;3313int ok = ITER_DONE;33143315if(iter->dir_iterator)3316 ok =dir_iterator_abort(iter->dir_iterator);33173318base_ref_iterator_free(ref_iterator);3319return ok;3320}33213322static struct ref_iterator_vtable files_reflog_iterator_vtable = {3323 files_reflog_iterator_advance,3324 files_reflog_iterator_peel,3325 files_reflog_iterator_abort3326};33273328static struct ref_iterator *files_reflog_iterator_begin(struct ref_store *ref_store)3329{3330struct files_reflog_iterator *iter =xcalloc(1,sizeof(*iter));3331struct ref_iterator *ref_iterator = &iter->base;33323333/* Check validity (but we don't need the result): */3334files_downcast(ref_store,0,"reflog_iterator_begin");33353336base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);3337 iter->dir_iterator =dir_iterator_begin(git_path("logs"));3338return ref_iterator;3339}33403341static intref_update_reject_duplicates(struct string_list *refnames,3342struct strbuf *err)3343{3344int i, n = refnames->nr;33453346assert(err);33473348for(i =1; i < n; i++)3349if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3350strbuf_addf(err,3351"multiple updates for ref '%s' not allowed.",3352 refnames->items[i].string);3353return1;3354}3355return0;3356}33573358/*3359 * If update is a direct update of head_ref (the reference pointed to3360 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3361 */3362static intsplit_head_update(struct ref_update *update,3363struct ref_transaction *transaction,3364const char*head_ref,3365struct string_list *affected_refnames,3366struct strbuf *err)3367{3368struct string_list_item *item;3369struct ref_update *new_update;33703371if((update->flags & REF_LOG_ONLY) ||3372(update->flags & REF_ISPRUNING) ||3373(update->flags & REF_UPDATE_VIA_HEAD))3374return0;33753376if(strcmp(update->refname, head_ref))3377return0;33783379/*3380 * First make sure that HEAD is not already in the3381 * transaction. This insertion is O(N) in the transaction3382 * size, but it happens at most once per transaction.3383 */3384 item =string_list_insert(affected_refnames,"HEAD");3385if(item->util) {3386/* An entry already existed */3387strbuf_addf(err,3388"multiple updates for 'HEAD' (including one "3389"via its referent '%s') are not allowed",3390 update->refname);3391return TRANSACTION_NAME_CONFLICT;3392}33933394 new_update =ref_transaction_add_update(3395 transaction,"HEAD",3396 update->flags | REF_LOG_ONLY | REF_NODEREF,3397 update->new_sha1, update->old_sha1,3398 update->msg);33993400 item->util = new_update;34013402return0;3403}34043405/*3406 * update is for a symref that points at referent and doesn't have3407 * REF_NODEREF set. Split it into two updates:3408 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3409 * - A new, separate update for the referent reference3410 * Note that the new update will itself be subject to splitting when3411 * the iteration gets to it.3412 */3413static intsplit_symref_update(struct files_ref_store *refs,3414struct ref_update *update,3415const char*referent,3416struct ref_transaction *transaction,3417struct string_list *affected_refnames,3418struct strbuf *err)3419{3420struct string_list_item *item;3421struct ref_update *new_update;3422unsigned int new_flags;34233424/*3425 * First make sure that referent is not already in the3426 * transaction. This insertion is O(N) in the transaction3427 * size, but it happens at most once per symref in a3428 * transaction.3429 */3430 item =string_list_insert(affected_refnames, referent);3431if(item->util) {3432/* An entry already existed */3433strbuf_addf(err,3434"multiple updates for '%s' (including one "3435"via symref '%s') are not allowed",3436 referent, update->refname);3437return TRANSACTION_NAME_CONFLICT;3438}34393440 new_flags = update->flags;3441if(!strcmp(update->refname,"HEAD")) {3442/*3443 * Record that the new update came via HEAD, so that3444 * when we process it, split_head_update() doesn't try3445 * to add another reflog update for HEAD. Note that3446 * this bit will be propagated if the new_update3447 * itself needs to be split.3448 */3449 new_flags |= REF_UPDATE_VIA_HEAD;3450}34513452 new_update =ref_transaction_add_update(3453 transaction, referent, new_flags,3454 update->new_sha1, update->old_sha1,3455 update->msg);34563457 new_update->parent_update = update;34583459/*3460 * Change the symbolic ref update to log only. Also, it3461 * doesn't need to check its old SHA-1 value, as that will be3462 * done when new_update is processed.3463 */3464 update->flags |= REF_LOG_ONLY | REF_NODEREF;3465 update->flags &= ~REF_HAVE_OLD;34663467 item->util = new_update;34683469return0;3470}34713472/*3473 * Return the refname under which update was originally requested.3474 */3475static const char*original_update_refname(struct ref_update *update)3476{3477while(update->parent_update)3478 update = update->parent_update;34793480return update->refname;3481}34823483/*3484 * Prepare for carrying out update:3485 * - Lock the reference referred to by update.3486 * - Read the reference under lock.3487 * - Check that its old SHA-1 value (if specified) is correct, and in3488 * any case record it in update->lock->old_oid for later use when3489 * writing the reflog.3490 * - If it is a symref update without REF_NODEREF, split it up into a3491 * REF_LOG_ONLY update of the symref and add a separate update for3492 * the referent to transaction.3493 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3494 * update of HEAD.3495 */3496static intlock_ref_for_update(struct files_ref_store *refs,3497struct ref_update *update,3498struct ref_transaction *transaction,3499const char*head_ref,3500struct string_list *affected_refnames,3501struct strbuf *err)3502{3503struct strbuf referent = STRBUF_INIT;3504int mustexist = (update->flags & REF_HAVE_OLD) &&3505!is_null_sha1(update->old_sha1);3506int ret;3507struct ref_lock *lock;35083509assert_main_repository(&refs->base,"lock_ref_for_update");35103511if((update->flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1))3512 update->flags |= REF_DELETING;35133514if(head_ref) {3515 ret =split_head_update(update, transaction, head_ref,3516 affected_refnames, err);3517if(ret)3518return ret;3519}35203521 ret =lock_raw_ref(refs, update->refname, mustexist,3522 affected_refnames, NULL,3523&lock, &referent,3524&update->type, err);3525if(ret) {3526char*reason;35273528 reason =strbuf_detach(err, NULL);3529strbuf_addf(err,"cannot lock ref '%s':%s",3530 update->refname, reason);3531free(reason);3532return ret;3533}35343535 update->backend_data = lock;35363537if(update->type & REF_ISSYMREF) {3538if(update->flags & REF_NODEREF) {3539/*3540 * We won't be reading the referent as part of3541 * the transaction, so we have to read it here3542 * to record and possibly check old_sha1:3543 */3544if(read_ref_full(update->refname,3545 mustexist ? RESOLVE_REF_READING :0,3546 lock->old_oid.hash, NULL)) {3547if(update->flags & REF_HAVE_OLD) {3548strbuf_addf(err,"cannot lock ref '%s': "3549"can't resolve old value",3550 update->refname);3551return TRANSACTION_GENERIC_ERROR;3552}else{3553hashclr(lock->old_oid.hash);3554}3555}3556if((update->flags & REF_HAVE_OLD) &&3557hashcmp(lock->old_oid.hash, update->old_sha1)) {3558strbuf_addf(err,"cannot lock ref '%s': "3559"is at%sbut expected%s",3560 update->refname,3561sha1_to_hex(lock->old_oid.hash),3562sha1_to_hex(update->old_sha1));3563return TRANSACTION_GENERIC_ERROR;3564}35653566}else{3567/*3568 * Create a new update for the reference this3569 * symref is pointing at. Also, we will record3570 * and verify old_sha1 for this update as part3571 * of processing the split-off update, so we3572 * don't have to do it here.3573 */3574 ret =split_symref_update(refs, update,3575 referent.buf, transaction,3576 affected_refnames, err);3577if(ret)3578return ret;3579}3580}else{3581struct ref_update *parent_update;35823583/*3584 * If this update is happening indirectly because of a3585 * symref update, record the old SHA-1 in the parent3586 * update:3587 */3588for(parent_update = update->parent_update;3589 parent_update;3590 parent_update = parent_update->parent_update) {3591struct ref_lock *parent_lock = parent_update->backend_data;3592oidcpy(&parent_lock->old_oid, &lock->old_oid);3593}35943595if((update->flags & REF_HAVE_OLD) &&3596hashcmp(lock->old_oid.hash, update->old_sha1)) {3597if(is_null_sha1(update->old_sha1))3598strbuf_addf(err,"cannot lock ref '%s': reference already exists",3599original_update_refname(update));3600else3601strbuf_addf(err,"cannot lock ref '%s': is at%sbut expected%s",3602original_update_refname(update),3603sha1_to_hex(lock->old_oid.hash),3604sha1_to_hex(update->old_sha1));36053606return TRANSACTION_GENERIC_ERROR;3607}3608}36093610if((update->flags & REF_HAVE_NEW) &&3611!(update->flags & REF_DELETING) &&3612!(update->flags & REF_LOG_ONLY)) {3613if(!(update->type & REF_ISSYMREF) &&3614!hashcmp(lock->old_oid.hash, update->new_sha1)) {3615/*3616 * The reference already has the desired3617 * value, so we don't need to write it.3618 */3619}else if(write_ref_to_lockfile(lock, update->new_sha1,3620 err)) {3621char*write_err =strbuf_detach(err, NULL);36223623/*3624 * The lock was freed upon failure of3625 * write_ref_to_lockfile():3626 */3627 update->backend_data = NULL;3628strbuf_addf(err,3629"cannot update the ref '%s':%s",3630 update->refname, write_err);3631free(write_err);3632return TRANSACTION_GENERIC_ERROR;3633}else{3634 update->flags |= REF_NEEDS_COMMIT;3635}3636}3637if(!(update->flags & REF_NEEDS_COMMIT)) {3638/*3639 * We didn't call write_ref_to_lockfile(), so3640 * the lockfile is still open. Close it to3641 * free up the file descriptor:3642 */3643if(close_ref(lock)) {3644strbuf_addf(err,"couldn't close '%s.lock'",3645 update->refname);3646return TRANSACTION_GENERIC_ERROR;3647}3648}3649return0;3650}36513652static intfiles_transaction_commit(struct ref_store *ref_store,3653struct ref_transaction *transaction,3654struct strbuf *err)3655{3656struct files_ref_store *refs =3657files_downcast(ref_store,0,"ref_transaction_commit");3658int ret =0, i;3659struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3660struct string_list_item *ref_to_delete;3661struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3662char*head_ref = NULL;3663int head_type;3664struct object_id head_oid;36653666assert(err);36673668if(transaction->state != REF_TRANSACTION_OPEN)3669die("BUG: commit called for transaction that is not open");36703671if(!transaction->nr) {3672 transaction->state = REF_TRANSACTION_CLOSED;3673return0;3674}36753676/*3677 * Fail if a refname appears more than once in the3678 * transaction. (If we end up splitting up any updates using3679 * split_symref_update() or split_head_update(), those3680 * functions will check that the new updates don't have the3681 * same refname as any existing ones.)3682 */3683for(i =0; i < transaction->nr; i++) {3684struct ref_update *update = transaction->updates[i];3685struct string_list_item *item =3686string_list_append(&affected_refnames, update->refname);36873688/*3689 * We store a pointer to update in item->util, but at3690 * the moment we never use the value of this field3691 * except to check whether it is non-NULL.3692 */3693 item->util = update;3694}3695string_list_sort(&affected_refnames);3696if(ref_update_reject_duplicates(&affected_refnames, err)) {3697 ret = TRANSACTION_GENERIC_ERROR;3698goto cleanup;3699}37003701/*3702 * Special hack: If a branch is updated directly and HEAD3703 * points to it (may happen on the remote side of a push3704 * for example) then logically the HEAD reflog should be3705 * updated too.3706 *3707 * A generic solution would require reverse symref lookups,3708 * but finding all symrefs pointing to a given branch would be3709 * rather costly for this rare event (the direct update of a3710 * branch) to be worth it. So let's cheat and check with HEAD3711 * only, which should cover 99% of all usage scenarios (even3712 * 100% of the default ones).3713 *3714 * So if HEAD is a symbolic reference, then record the name of3715 * the reference that it points to. If we see an update of3716 * head_ref within the transaction, then split_head_update()3717 * arranges for the reflog of HEAD to be updated, too.3718 */3719 head_ref =resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3720 head_oid.hash, &head_type);37213722if(head_ref && !(head_type & REF_ISSYMREF)) {3723free(head_ref);3724 head_ref = NULL;3725}37263727/*3728 * Acquire all locks, verify old values if provided, check3729 * that new values are valid, and write new values to the3730 * lockfiles, ready to be activated. Only keep one lockfile3731 * open at a time to avoid running out of file descriptors.3732 */3733for(i =0; i < transaction->nr; i++) {3734struct ref_update *update = transaction->updates[i];37353736 ret =lock_ref_for_update(refs, update, transaction,3737 head_ref, &affected_refnames, err);3738if(ret)3739goto cleanup;3740}37413742/* Perform updates first so live commits remain referenced */3743for(i =0; i < transaction->nr; i++) {3744struct ref_update *update = transaction->updates[i];3745struct ref_lock *lock = update->backend_data;37463747if(update->flags & REF_NEEDS_COMMIT ||3748 update->flags & REF_LOG_ONLY) {3749if(log_ref_write(lock->ref_name, lock->old_oid.hash,3750 update->new_sha1,3751 update->msg, update->flags, err)) {3752char*old_msg =strbuf_detach(err, NULL);37533754strbuf_addf(err,"cannot update the ref '%s':%s",3755 lock->ref_name, old_msg);3756free(old_msg);3757unlock_ref(lock);3758 update->backend_data = NULL;3759 ret = TRANSACTION_GENERIC_ERROR;3760goto cleanup;3761}3762}3763if(update->flags & REF_NEEDS_COMMIT) {3764clear_loose_ref_cache(refs);3765if(commit_ref(lock)) {3766strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3767unlock_ref(lock);3768 update->backend_data = NULL;3769 ret = TRANSACTION_GENERIC_ERROR;3770goto cleanup;3771}3772}3773}3774/* Perform deletes now that updates are safely completed */3775for(i =0; i < transaction->nr; i++) {3776struct ref_update *update = transaction->updates[i];3777struct ref_lock *lock = update->backend_data;37783779if(update->flags & REF_DELETING &&3780!(update->flags & REF_LOG_ONLY)) {3781if(delete_ref_loose(lock, update->type, err)) {3782 ret = TRANSACTION_GENERIC_ERROR;3783goto cleanup;3784}37853786if(!(update->flags & REF_ISPRUNING))3787string_list_append(&refs_to_delete,3788 lock->ref_name);3789}3790}37913792if(repack_without_refs(refs, &refs_to_delete, err)) {3793 ret = TRANSACTION_GENERIC_ERROR;3794goto cleanup;3795}3796for_each_string_list_item(ref_to_delete, &refs_to_delete)3797unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3798clear_loose_ref_cache(refs);37993800cleanup:3801 transaction->state = REF_TRANSACTION_CLOSED;38023803for(i =0; i < transaction->nr; i++)3804if(transaction->updates[i]->backend_data)3805unlock_ref(transaction->updates[i]->backend_data);3806string_list_clear(&refs_to_delete,0);3807free(head_ref);3808string_list_clear(&affected_refnames,0);38093810return ret;3811}38123813static intref_present(const char*refname,3814const struct object_id *oid,int flags,void*cb_data)3815{3816struct string_list *affected_refnames = cb_data;38173818returnstring_list_has_string(affected_refnames, refname);3819}38203821static intfiles_initial_transaction_commit(struct ref_store *ref_store,3822struct ref_transaction *transaction,3823struct strbuf *err)3824{3825struct files_ref_store *refs =3826files_downcast(ref_store,0,"initial_ref_transaction_commit");3827int ret =0, i;3828struct string_list affected_refnames = STRING_LIST_INIT_NODUP;38293830assert(err);38313832if(transaction->state != REF_TRANSACTION_OPEN)3833die("BUG: commit called for transaction that is not open");38343835/* Fail if a refname appears more than once in the transaction: */3836for(i =0; i < transaction->nr; i++)3837string_list_append(&affected_refnames,3838 transaction->updates[i]->refname);3839string_list_sort(&affected_refnames);3840if(ref_update_reject_duplicates(&affected_refnames, err)) {3841 ret = TRANSACTION_GENERIC_ERROR;3842goto cleanup;3843}38443845/*3846 * It's really undefined to call this function in an active3847 * repository or when there are existing references: we are3848 * only locking and changing packed-refs, so (1) any3849 * simultaneous processes might try to change a reference at3850 * the same time we do, and (2) any existing loose versions of3851 * the references that we are setting would have precedence3852 * over our values. But some remote helpers create the remote3853 * "HEAD" and "master" branches before calling this function,3854 * so here we really only check that none of the references3855 * that we are creating already exists.3856 */3857if(for_each_rawref(ref_present, &affected_refnames))3858die("BUG: initial ref transaction called with existing refs");38593860for(i =0; i < transaction->nr; i++) {3861struct ref_update *update = transaction->updates[i];38623863if((update->flags & REF_HAVE_OLD) &&3864!is_null_sha1(update->old_sha1))3865die("BUG: initial ref transaction with old_sha1 set");3866if(verify_refname_available(update->refname,3867&affected_refnames, NULL,3868 err)) {3869 ret = TRANSACTION_NAME_CONFLICT;3870goto cleanup;3871}3872}38733874if(lock_packed_refs(refs,0)) {3875strbuf_addf(err,"unable to lock packed-refs file:%s",3876strerror(errno));3877 ret = TRANSACTION_GENERIC_ERROR;3878goto cleanup;3879}38803881for(i =0; i < transaction->nr; i++) {3882struct ref_update *update = transaction->updates[i];38833884if((update->flags & REF_HAVE_NEW) &&3885!is_null_sha1(update->new_sha1))3886add_packed_ref(refs, update->refname, update->new_sha1);3887}38883889if(commit_packed_refs(refs)) {3890strbuf_addf(err,"unable to commit packed-refs file:%s",3891strerror(errno));3892 ret = TRANSACTION_GENERIC_ERROR;3893goto cleanup;3894}38953896cleanup:3897 transaction->state = REF_TRANSACTION_CLOSED;3898string_list_clear(&affected_refnames,0);3899return ret;3900}39013902struct expire_reflog_cb {3903unsigned int flags;3904 reflog_expiry_should_prune_fn *should_prune_fn;3905void*policy_cb;3906FILE*newlog;3907unsigned char last_kept_sha1[20];3908};39093910static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3911const char*email,unsigned long timestamp,int tz,3912const char*message,void*cb_data)3913{3914struct expire_reflog_cb *cb = cb_data;3915struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;39163917if(cb->flags & EXPIRE_REFLOGS_REWRITE)3918 osha1 = cb->last_kept_sha1;39193920if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3921 message, policy_cb)) {3922if(!cb->newlog)3923printf("would prune%s", message);3924else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3925printf("prune%s", message);3926}else{3927if(cb->newlog) {3928fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3929sha1_to_hex(osha1),sha1_to_hex(nsha1),3930 email, timestamp, tz, message);3931hashcpy(cb->last_kept_sha1, nsha1);3932}3933if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3934printf("keep%s", message);3935}3936return0;3937}39383939static intfiles_reflog_expire(struct ref_store *ref_store,3940const char*refname,const unsigned char*sha1,3941unsigned int flags,3942 reflog_expiry_prepare_fn prepare_fn,3943 reflog_expiry_should_prune_fn should_prune_fn,3944 reflog_expiry_cleanup_fn cleanup_fn,3945void*policy_cb_data)3946{3947struct files_ref_store *refs =3948files_downcast(ref_store,0,"reflog_expire");3949static struct lock_file reflog_lock;3950struct expire_reflog_cb cb;3951struct ref_lock *lock;3952char*log_file;3953int status =0;3954int type;3955struct strbuf err = STRBUF_INIT;39563957memset(&cb,0,sizeof(cb));3958 cb.flags = flags;3959 cb.policy_cb = policy_cb_data;3960 cb.should_prune_fn = should_prune_fn;39613962/*3963 * The reflog file is locked by holding the lock on the3964 * reference itself, plus we might need to update the3965 * reference if --updateref was specified:3966 */3967 lock =lock_ref_sha1_basic(refs, refname, sha1,3968 NULL, NULL, REF_NODEREF,3969&type, &err);3970if(!lock) {3971error("cannot lock ref '%s':%s", refname, err.buf);3972strbuf_release(&err);3973return-1;3974}3975if(!reflog_exists(refname)) {3976unlock_ref(lock);3977return0;3978}39793980 log_file =git_pathdup("logs/%s", refname);3981if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3982/*3983 * Even though holding $GIT_DIR/logs/$reflog.lock has3984 * no locking implications, we use the lock_file3985 * machinery here anyway because it does a lot of the3986 * work we need, including cleaning up if the program3987 * exits unexpectedly.3988 */3989if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {3990struct strbuf err = STRBUF_INIT;3991unable_to_lock_message(log_file, errno, &err);3992error("%s", err.buf);3993strbuf_release(&err);3994goto failure;3995}3996 cb.newlog =fdopen_lock_file(&reflog_lock,"w");3997if(!cb.newlog) {3998error("cannot fdopen%s(%s)",3999get_lock_file_path(&reflog_lock),strerror(errno));4000goto failure;4001}4002}40034004(*prepare_fn)(refname, sha1, cb.policy_cb);4005for_each_reflog_ent(refname, expire_reflog_ent, &cb);4006(*cleanup_fn)(cb.policy_cb);40074008if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4009/*4010 * It doesn't make sense to adjust a reference pointed4011 * to by a symbolic ref based on expiring entries in4012 * the symbolic reference's reflog. Nor can we update4013 * a reference if there are no remaining reflog4014 * entries.4015 */4016int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4017!(type & REF_ISSYMREF) &&4018!is_null_sha1(cb.last_kept_sha1);40194020if(close_lock_file(&reflog_lock)) {4021 status |=error("couldn't write%s:%s", log_file,4022strerror(errno));4023}else if(update &&4024(write_in_full(get_lock_file_fd(lock->lk),4025sha1_to_hex(cb.last_kept_sha1),40) !=40||4026write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||4027close_ref(lock) <0)) {4028 status |=error("couldn't write%s",4029get_lock_file_path(lock->lk));4030rollback_lock_file(&reflog_lock);4031}else if(commit_lock_file(&reflog_lock)) {4032 status |=error("unable to write reflog '%s' (%s)",4033 log_file,strerror(errno));4034}else if(update &&commit_ref(lock)) {4035 status |=error("couldn't set%s", lock->ref_name);4036}4037}4038free(log_file);4039unlock_ref(lock);4040return status;40414042 failure:4043rollback_lock_file(&reflog_lock);4044free(log_file);4045unlock_ref(lock);4046return-1;4047}40484049static intfiles_init_db(struct ref_store *ref_store,struct strbuf *err)4050{4051/* Check validity (but we don't need the result): */4052files_downcast(ref_store,0,"init_db");40534054/*4055 * Create .git/refs/{heads,tags}4056 */4057safe_create_dir(git_path("refs/heads"),1);4058safe_create_dir(git_path("refs/tags"),1);4059if(get_shared_repository()) {4060adjust_shared_perm(git_path("refs/heads"));4061adjust_shared_perm(git_path("refs/tags"));4062}4063return0;4064}40654066struct ref_storage_be refs_be_files = {4067 NULL,4068"files",4069 files_ref_store_create,4070 files_init_db,4071 files_transaction_commit,4072 files_initial_transaction_commit,40734074 files_pack_refs,4075 files_peel_ref,4076 files_create_symref,4077 files_delete_refs,4078 files_rename_ref,40794080 files_ref_iterator_begin,4081 files_read_raw_ref,4082 files_verify_refname_available,40834084 files_reflog_iterator_begin,4085 files_for_each_reflog_ent,4086 files_for_each_reflog_ent_reverse,4087 files_reflog_exists,4088 files_create_reflog,4089 files_delete_reflog,4090 files_reflog_expire4091};