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, 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; 700oidcpy(peeled, &entry->u.value.peeled); 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; 915 916/* 917 * The name of the submodule represented by this object, or 918 * NULL if it represents the main repository's reference 919 * store: 920 */ 921const char*submodule; 922 923struct ref_entry *loose; 924struct packed_ref_cache *packed; 925}; 926 927/* Lock used for the main packed-refs file: */ 928static struct lock_file packlock; 929 930/* 931 * Increment the reference count of *packed_refs. 932 */ 933static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 934{ 935 packed_refs->referrers++; 936} 937 938/* 939 * Decrease the reference count of *packed_refs. If it goes to zero, 940 * free *packed_refs and return true; otherwise return false. 941 */ 942static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs) 943{ 944if(!--packed_refs->referrers) { 945free_ref_entry(packed_refs->root); 946stat_validity_clear(&packed_refs->validity); 947free(packed_refs); 948return1; 949}else{ 950return0; 951} 952} 953 954static voidclear_packed_ref_cache(struct files_ref_store *refs) 955{ 956if(refs->packed) { 957struct packed_ref_cache *packed_refs = refs->packed; 958 959if(packed_refs->lock) 960die("internal error: packed-ref cache cleared while locked"); 961 refs->packed = NULL; 962release_packed_ref_cache(packed_refs); 963} 964} 965 966static voidclear_loose_ref_cache(struct files_ref_store *refs) 967{ 968if(refs->loose) { 969free_ref_entry(refs->loose); 970 refs->loose = NULL; 971} 972} 973 974/* 975 * Create a new submodule ref cache and add it to the internal 976 * set of caches. 977 */ 978static struct ref_store *files_ref_store_create(const char*submodule) 979{ 980struct files_ref_store *refs =xcalloc(1,sizeof(*refs)); 981struct ref_store *ref_store = (struct ref_store *)refs; 982 983base_ref_store_init(ref_store, &refs_be_files); 984 985 refs->submodule =xstrdup_or_null(submodule); 986 987return ref_store; 988} 989 990/* 991 * Die if refs is for a submodule (i.e., not for the main repository). 992 * caller is used in any necessary error messages. 993 */ 994static voidfiles_assert_main_repository(struct files_ref_store *refs, 995const char*caller) 996{ 997if(refs->submodule) 998die("BUG:%scalled for a submodule", caller); 999}10001001/*1002 * Downcast ref_store to files_ref_store. Die if ref_store is not a1003 * files_ref_store. If submodule_allowed is not true, then also die if1004 * files_ref_store is for a submodule (i.e., not for the main1005 * repository). caller is used in any necessary error messages.1006 */1007static struct files_ref_store *files_downcast(1008struct ref_store *ref_store,int submodule_allowed,1009const char*caller)1010{1011struct files_ref_store *refs;10121013if(ref_store->be != &refs_be_files)1014die("BUG: ref_store is type\"%s\"not\"files\"in%s",1015 ref_store->be->name, caller);10161017 refs = (struct files_ref_store *)ref_store;10181019if(!submodule_allowed)1020files_assert_main_repository(refs, caller);10211022return refs;1023}10241025/* The length of a peeled reference line in packed-refs, including EOL: */1026#define PEELED_LINE_LENGTH 4210271028/*1029 * The packed-refs header line that we write out. Perhaps other1030 * traits will be added later. The trailing space is required.1031 */1032static const char PACKED_REFS_HEADER[] =1033"# pack-refs with: peeled fully-peeled\n";10341035/*1036 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1037 * Return a pointer to the refname within the line (null-terminated),1038 * or NULL if there was a problem.1039 */1040static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1)1041{1042const char*ref;10431044/*1045 * 42: the answer to everything.1046 *1047 * In this case, it happens to be the answer to1048 * 40 (length of sha1 hex representation)1049 * +1 (space in between hex and name)1050 * +1 (newline at the end of the line)1051 */1052if(line->len <=42)1053return NULL;10541055if(get_sha1_hex(line->buf, sha1) <0)1056return NULL;1057if(!isspace(line->buf[40]))1058return NULL;10591060 ref = line->buf +41;1061if(isspace(*ref))1062return NULL;10631064if(line->buf[line->len -1] !='\n')1065return NULL;1066 line->buf[--line->len] =0;10671068return ref;1069}10701071/*1072 * Read f, which is a packed-refs file, into dir.1073 *1074 * A comment line of the form "# pack-refs with: " may contain zero or1075 * more traits. We interpret the traits as follows:1076 *1077 * No traits:1078 *1079 * Probably no references are peeled. But if the file contains a1080 * peeled value for a reference, we will use it.1081 *1082 * peeled:1083 *1084 * References under "refs/tags/", if they *can* be peeled, *are*1085 * peeled in this file. References outside of "refs/tags/" are1086 * probably not peeled even if they could have been, but if we find1087 * a peeled value for such a reference we will use it.1088 *1089 * fully-peeled:1090 *1091 * All references in the file that can be peeled are peeled.1092 * Inversely (and this is more important), any references in the1093 * file for which no peeled value is recorded is not peelable. This1094 * trait should typically be written alongside "peeled" for1095 * compatibility with older clients, but we do not require it1096 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1097 */1098static voidread_packed_refs(FILE*f,struct ref_dir *dir)1099{1100struct ref_entry *last = NULL;1101struct strbuf line = STRBUF_INIT;1102enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;11031104while(strbuf_getwholeline(&line, f,'\n') != EOF) {1105unsigned char sha1[20];1106const char*refname;1107const char*traits;11081109if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1110if(strstr(traits," fully-peeled "))1111 peeled = PEELED_FULLY;1112else if(strstr(traits," peeled "))1113 peeled = PEELED_TAGS;1114/* perhaps other traits later as well */1115continue;1116}11171118 refname =parse_ref_line(&line, sha1);1119if(refname) {1120int flag = REF_ISPACKED;11211122if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1123if(!refname_is_safe(refname))1124die("packed refname is dangerous:%s", refname);1125hashclr(sha1);1126 flag |= REF_BAD_NAME | REF_ISBROKEN;1127}1128 last =create_ref_entry(refname, sha1, flag,0);1129if(peeled == PEELED_FULLY ||1130(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1131 last->flag |= REF_KNOWS_PEELED;1132add_ref(dir, last);1133continue;1134}1135if(last &&1136 line.buf[0] =='^'&&1137 line.len == PEELED_LINE_LENGTH &&1138 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1139!get_sha1_hex(line.buf +1, sha1)) {1140hashcpy(last->u.value.peeled.hash, sha1);1141/*1142 * Regardless of what the file header said,1143 * we definitely know the value of *this*1144 * reference:1145 */1146 last->flag |= REF_KNOWS_PEELED;1147}1148}11491150strbuf_release(&line);1151}11521153/*1154 * Get the packed_ref_cache for the specified files_ref_store,1155 * creating it if necessary.1156 */1157static struct packed_ref_cache *get_packed_ref_cache(struct files_ref_store *refs)1158{1159char*packed_refs_file;11601161if(refs->submodule)1162 packed_refs_file =git_pathdup_submodule(refs->submodule,1163"packed-refs");1164else1165 packed_refs_file =git_pathdup("packed-refs");11661167if(refs->packed &&1168!stat_validity_check(&refs->packed->validity, packed_refs_file))1169clear_packed_ref_cache(refs);11701171if(!refs->packed) {1172FILE*f;11731174 refs->packed =xcalloc(1,sizeof(*refs->packed));1175acquire_packed_ref_cache(refs->packed);1176 refs->packed->root =create_dir_entry(refs,"",0,0);1177 f =fopen(packed_refs_file,"r");1178if(f) {1179stat_validity_update(&refs->packed->validity,fileno(f));1180read_packed_refs(f,get_ref_dir(refs->packed->root));1181fclose(f);1182}1183}1184free(packed_refs_file);1185return refs->packed;1186}11871188static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1189{1190returnget_ref_dir(packed_ref_cache->root);1191}11921193static struct ref_dir *get_packed_refs(struct files_ref_store *refs)1194{1195returnget_packed_ref_dir(get_packed_ref_cache(refs));1196}11971198/*1199 * Add a reference to the in-memory packed reference cache. This may1200 * only be called while the packed-refs file is locked (see1201 * lock_packed_refs()). To actually write the packed-refs file, call1202 * commit_packed_refs().1203 */1204static voidadd_packed_ref(struct files_ref_store *refs,1205const char*refname,const unsigned char*sha1)1206{1207struct packed_ref_cache *packed_ref_cache =get_packed_ref_cache(refs);12081209if(!packed_ref_cache->lock)1210die("internal error: packed refs not locked");1211add_ref(get_packed_ref_dir(packed_ref_cache),1212create_ref_entry(refname, sha1, REF_ISPACKED,1));1213}12141215/*1216 * Read the loose references from the namespace dirname into dir1217 * (without recursing). dirname must end with '/'. dir must be the1218 * directory entry corresponding to dirname.1219 */1220static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1221{1222struct files_ref_store *refs = dir->ref_store;1223DIR*d;1224struct dirent *de;1225int dirnamelen =strlen(dirname);1226struct strbuf refname;1227struct strbuf path = STRBUF_INIT;1228size_t path_baselen;1229int err =0;12301231if(refs->submodule)1232 err =strbuf_git_path_submodule(&path, refs->submodule,"%s", dirname);1233else1234strbuf_git_path(&path,"%s", dirname);1235 path_baselen = path.len;12361237if(err) {1238strbuf_release(&path);1239return;1240}12411242 d =opendir(path.buf);1243if(!d) {1244strbuf_release(&path);1245return;1246}12471248strbuf_init(&refname, dirnamelen +257);1249strbuf_add(&refname, dirname, dirnamelen);12501251while((de =readdir(d)) != NULL) {1252unsigned char sha1[20];1253struct stat st;1254int flag;12551256if(de->d_name[0] =='.')1257continue;1258if(ends_with(de->d_name,".lock"))1259continue;1260strbuf_addstr(&refname, de->d_name);1261strbuf_addstr(&path, de->d_name);1262if(stat(path.buf, &st) <0) {1263;/* silently ignore */1264}else if(S_ISDIR(st.st_mode)) {1265strbuf_addch(&refname,'/');1266add_entry_to_dir(dir,1267create_dir_entry(refs, refname.buf,1268 refname.len,1));1269}else{1270if(!resolve_ref_recursively(&refs->base,1271 refname.buf,1272 RESOLVE_REF_READING,1273 sha1, &flag)) {1274hashclr(sha1);1275 flag |= REF_ISBROKEN;1276}else if(is_null_sha1(sha1)) {1277/*1278 * It is so astronomically unlikely1279 * that NULL_SHA1 is the SHA-1 of an1280 * actual object that we consider its1281 * appearance in a loose reference1282 * file to be repo corruption1283 * (probably due to a software bug).1284 */1285 flag |= REF_ISBROKEN;1286}12871288if(check_refname_format(refname.buf,1289 REFNAME_ALLOW_ONELEVEL)) {1290if(!refname_is_safe(refname.buf))1291die("loose refname is dangerous:%s", refname.buf);1292hashclr(sha1);1293 flag |= REF_BAD_NAME | REF_ISBROKEN;1294}1295add_entry_to_dir(dir,1296create_ref_entry(refname.buf, sha1, flag,0));1297}1298strbuf_setlen(&refname, dirnamelen);1299strbuf_setlen(&path, path_baselen);1300}1301strbuf_release(&refname);1302strbuf_release(&path);1303closedir(d);1304}13051306static struct ref_dir *get_loose_refs(struct files_ref_store *refs)1307{1308if(!refs->loose) {1309/*1310 * Mark the top-level directory complete because we1311 * are about to read the only subdirectory that can1312 * hold references:1313 */1314 refs->loose =create_dir_entry(refs,"",0,0);1315/*1316 * Create an incomplete entry for "refs/":1317 */1318add_entry_to_dir(get_ref_dir(refs->loose),1319create_dir_entry(refs,"refs/",5,1));1320}1321returnget_ref_dir(refs->loose);1322}13231324/*1325 * Return the ref_entry for the given refname from the packed1326 * references. If it does not exist, return NULL.1327 */1328static struct ref_entry *get_packed_ref(struct files_ref_store *refs,1329const char*refname)1330{1331returnfind_ref(get_packed_refs(refs), refname);1332}13331334/*1335 * A loose ref file doesn't exist; check for a packed ref.1336 */1337static intresolve_packed_ref(struct files_ref_store *refs,1338const char*refname,1339unsigned char*sha1,unsigned int*flags)1340{1341struct ref_entry *entry;13421343/*1344 * The loose reference file does not exist; check for a packed1345 * reference.1346 */1347 entry =get_packed_ref(refs, refname);1348if(entry) {1349hashcpy(sha1, entry->u.value.oid.hash);1350*flags |= REF_ISPACKED;1351return0;1352}1353/* refname is not a packed reference. */1354return-1;1355}13561357static intfiles_read_raw_ref(struct ref_store *ref_store,1358const char*refname,unsigned char*sha1,1359struct strbuf *referent,unsigned int*type)1360{1361struct files_ref_store *refs =1362files_downcast(ref_store,1,"read_raw_ref");1363struct strbuf sb_contents = STRBUF_INIT;1364struct strbuf sb_path = STRBUF_INIT;1365const char*path;1366const char*buf;1367struct stat st;1368int fd;1369int ret = -1;1370int save_errno;1371int remaining_retries =3;13721373*type =0;1374strbuf_reset(&sb_path);13751376if(refs->submodule)1377strbuf_git_path_submodule(&sb_path, refs->submodule,"%s", refname);1378else1379strbuf_git_path(&sb_path,"%s", refname);13801381 path = sb_path.buf;13821383stat_ref:1384/*1385 * We might have to loop back here to avoid a race1386 * condition: first we lstat() the file, then we try1387 * to read it as a link or as a file. But if somebody1388 * changes the type of the file (file <-> directory1389 * <-> symlink) between the lstat() and reading, then1390 * we don't want to report that as an error but rather1391 * try again starting with the lstat().1392 *1393 * We'll keep a count of the retries, though, just to avoid1394 * any confusing situation sending us into an infinite loop.1395 */13961397if(remaining_retries-- <=0)1398goto out;13991400if(lstat(path, &st) <0) {1401if(errno != ENOENT)1402goto out;1403if(resolve_packed_ref(refs, refname, sha1, type)) {1404 errno = ENOENT;1405goto out;1406}1407 ret =0;1408goto out;1409}14101411/* Follow "normalized" - ie "refs/.." symlinks by hand */1412if(S_ISLNK(st.st_mode)) {1413strbuf_reset(&sb_contents);1414if(strbuf_readlink(&sb_contents, path,0) <0) {1415if(errno == ENOENT || errno == EINVAL)1416/* inconsistent with lstat; retry */1417goto stat_ref;1418else1419goto out;1420}1421if(starts_with(sb_contents.buf,"refs/") &&1422!check_refname_format(sb_contents.buf,0)) {1423strbuf_swap(&sb_contents, referent);1424*type |= REF_ISSYMREF;1425 ret =0;1426goto out;1427}1428/*1429 * It doesn't look like a refname; fall through to just1430 * treating it like a non-symlink, and reading whatever it1431 * points to.1432 */1433}14341435/* Is it a directory? */1436if(S_ISDIR(st.st_mode)) {1437/*1438 * Even though there is a directory where the loose1439 * ref is supposed to be, there could still be a1440 * packed ref:1441 */1442if(resolve_packed_ref(refs, refname, sha1, type)) {1443 errno = EISDIR;1444goto out;1445}1446 ret =0;1447goto out;1448}14491450/*1451 * Anything else, just open it and try to use it as1452 * a ref1453 */1454 fd =open(path, O_RDONLY);1455if(fd <0) {1456if(errno == ENOENT && !S_ISLNK(st.st_mode))1457/* inconsistent with lstat; retry */1458goto stat_ref;1459else1460goto out;1461}1462strbuf_reset(&sb_contents);1463if(strbuf_read(&sb_contents, fd,256) <0) {1464int save_errno = errno;1465close(fd);1466 errno = save_errno;1467goto out;1468}1469close(fd);1470strbuf_rtrim(&sb_contents);1471 buf = sb_contents.buf;1472if(starts_with(buf,"ref:")) {1473 buf +=4;1474while(isspace(*buf))1475 buf++;14761477strbuf_reset(referent);1478strbuf_addstr(referent, buf);1479*type |= REF_ISSYMREF;1480 ret =0;1481goto out;1482}14831484/*1485 * Please note that FETCH_HEAD has additional1486 * data after the sha.1487 */1488if(get_sha1_hex(buf, sha1) ||1489(buf[40] !='\0'&& !isspace(buf[40]))) {1490*type |= REF_ISBROKEN;1491 errno = EINVAL;1492goto out;1493}14941495 ret =0;14961497out:1498 save_errno = errno;1499strbuf_release(&sb_path);1500strbuf_release(&sb_contents);1501 errno = save_errno;1502return ret;1503}15041505static voidunlock_ref(struct ref_lock *lock)1506{1507/* Do not free lock->lk -- atexit() still looks at them */1508if(lock->lk)1509rollback_lock_file(lock->lk);1510free(lock->ref_name);1511free(lock);1512}15131514/*1515 * Lock refname, without following symrefs, and set *lock_p to point1516 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1517 * and type similarly to read_raw_ref().1518 *1519 * The caller must verify that refname is a "safe" reference name (in1520 * the sense of refname_is_safe()) before calling this function.1521 *1522 * If the reference doesn't already exist, verify that refname doesn't1523 * have a D/F conflict with any existing references. extras and skip1524 * are passed to verify_refname_available_dir() for this check.1525 *1526 * If mustexist is not set and the reference is not found or is1527 * broken, lock the reference anyway but clear sha1.1528 *1529 * Return 0 on success. On failure, write an error message to err and1530 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1531 *1532 * Implementation note: This function is basically1533 *1534 * lock reference1535 * read_raw_ref()1536 *1537 * but it includes a lot more code to1538 * - Deal with possible races with other processes1539 * - Avoid calling verify_refname_available_dir() when it can be1540 * avoided, namely if we were successfully able to read the ref1541 * - Generate informative error messages in the case of failure1542 */1543static intlock_raw_ref(struct files_ref_store *refs,1544const char*refname,int mustexist,1545const struct string_list *extras,1546const struct string_list *skip,1547struct ref_lock **lock_p,1548struct strbuf *referent,1549unsigned int*type,1550struct strbuf *err)1551{1552struct ref_lock *lock;1553struct strbuf ref_file = STRBUF_INIT;1554int attempts_remaining =3;1555int ret = TRANSACTION_GENERIC_ERROR;15561557assert(err);1558files_assert_main_repository(refs,"lock_raw_ref");15591560*type =0;15611562/* First lock the file so it can't change out from under us. */15631564*lock_p = lock =xcalloc(1,sizeof(*lock));15651566 lock->ref_name =xstrdup(refname);1567strbuf_git_path(&ref_file,"%s", refname);15681569retry:1570switch(safe_create_leading_directories(ref_file.buf)) {1571case SCLD_OK:1572break;/* success */1573case SCLD_EXISTS:1574/*1575 * Suppose refname is "refs/foo/bar". We just failed1576 * to create the containing directory, "refs/foo",1577 * because there was a non-directory in the way. This1578 * indicates a D/F conflict, probably because of1579 * another reference such as "refs/foo". There is no1580 * reason to expect this error to be transitory.1581 */1582if(verify_refname_available(refname, extras, skip, err)) {1583if(mustexist) {1584/*1585 * To the user the relevant error is1586 * that the "mustexist" reference is1587 * missing:1588 */1589strbuf_reset(err);1590strbuf_addf(err,"unable to resolve reference '%s'",1591 refname);1592}else{1593/*1594 * The error message set by1595 * verify_refname_available_dir() is OK.1596 */1597 ret = TRANSACTION_NAME_CONFLICT;1598}1599}else{1600/*1601 * The file that is in the way isn't a loose1602 * reference. Report it as a low-level1603 * failure.1604 */1605strbuf_addf(err,"unable to create lock file%s.lock; "1606"non-directory in the way",1607 ref_file.buf);1608}1609goto error_return;1610case SCLD_VANISHED:1611/* Maybe another process was tidying up. Try again. */1612if(--attempts_remaining >0)1613goto retry;1614/* fall through */1615default:1616strbuf_addf(err,"unable to create directory for%s",1617 ref_file.buf);1618goto error_return;1619}16201621if(!lock->lk)1622 lock->lk =xcalloc(1,sizeof(struct lock_file));16231624if(hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) <0) {1625if(errno == ENOENT && --attempts_remaining >0) {1626/*1627 * Maybe somebody just deleted one of the1628 * directories leading to ref_file. Try1629 * again:1630 */1631goto retry;1632}else{1633unable_to_lock_message(ref_file.buf, errno, err);1634goto error_return;1635}1636}16371638/*1639 * Now we hold the lock and can read the reference without1640 * fear that its value will change.1641 */16421643if(files_read_raw_ref(&refs->base, refname,1644 lock->old_oid.hash, referent, type)) {1645if(errno == ENOENT) {1646if(mustexist) {1647/* Garden variety missing reference. */1648strbuf_addf(err,"unable to resolve reference '%s'",1649 refname);1650goto error_return;1651}else{1652/*1653 * Reference is missing, but that's OK. We1654 * know that there is not a conflict with1655 * another loose reference because1656 * (supposing that we are trying to lock1657 * reference "refs/foo/bar"):1658 *1659 * - We were successfully able to create1660 * the lockfile refs/foo/bar.lock, so we1661 * know there cannot be a loose reference1662 * named "refs/foo".1663 *1664 * - We got ENOENT and not EISDIR, so we1665 * know that there cannot be a loose1666 * reference named "refs/foo/bar/baz".1667 */1668}1669}else if(errno == EISDIR) {1670/*1671 * There is a directory in the way. It might have1672 * contained references that have been deleted. If1673 * we don't require that the reference already1674 * exists, try to remove the directory so that it1675 * doesn't cause trouble when we want to rename the1676 * lockfile into place later.1677 */1678if(mustexist) {1679/* Garden variety missing reference. */1680strbuf_addf(err,"unable to resolve reference '%s'",1681 refname);1682goto error_return;1683}else if(remove_dir_recursively(&ref_file,1684 REMOVE_DIR_EMPTY_ONLY)) {1685if(verify_refname_available_dir(1686 refname, extras, skip,1687get_loose_refs(refs),1688 err)) {1689/*1690 * The error message set by1691 * verify_refname_available() is OK.1692 */1693 ret = TRANSACTION_NAME_CONFLICT;1694goto error_return;1695}else{1696/*1697 * We can't delete the directory,1698 * but we also don't know of any1699 * references that it should1700 * contain.1701 */1702strbuf_addf(err,"there is a non-empty directory '%s' "1703"blocking reference '%s'",1704 ref_file.buf, refname);1705goto error_return;1706}1707}1708}else if(errno == EINVAL && (*type & REF_ISBROKEN)) {1709strbuf_addf(err,"unable to resolve reference '%s': "1710"reference broken", refname);1711goto error_return;1712}else{1713strbuf_addf(err,"unable to resolve reference '%s':%s",1714 refname,strerror(errno));1715goto error_return;1716}17171718/*1719 * If the ref did not exist and we are creating it,1720 * make sure there is no existing packed ref whose1721 * name begins with our refname, nor a packed ref1722 * whose name is a proper prefix of our refname.1723 */1724if(verify_refname_available_dir(1725 refname, extras, skip,1726get_packed_refs(refs),1727 err)) {1728goto error_return;1729}1730}17311732 ret =0;1733goto out;17341735error_return:1736unlock_ref(lock);1737*lock_p = NULL;17381739out:1740strbuf_release(&ref_file);1741return ret;1742}17431744/*1745 * Peel the entry (if possible) and return its new peel_status. If1746 * repeel is true, re-peel the entry even if there is an old peeled1747 * value that is already stored in it.1748 *1749 * It is OK to call this function with a packed reference entry that1750 * might be stale and might even refer to an object that has since1751 * been garbage-collected. In such a case, if the entry has1752 * REF_KNOWS_PEELED then leave the status unchanged and return1753 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1754 */1755static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1756{1757enum peel_status status;17581759if(entry->flag & REF_KNOWS_PEELED) {1760if(repeel) {1761 entry->flag &= ~REF_KNOWS_PEELED;1762oidclr(&entry->u.value.peeled);1763}else{1764returnis_null_oid(&entry->u.value.peeled) ?1765 PEEL_NON_TAG : PEEL_PEELED;1766}1767}1768if(entry->flag & REF_ISBROKEN)1769return PEEL_BROKEN;1770if(entry->flag & REF_ISSYMREF)1771return PEEL_IS_SYMREF;17721773 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1774if(status == PEEL_PEELED || status == PEEL_NON_TAG)1775 entry->flag |= REF_KNOWS_PEELED;1776return status;1777}17781779static intfiles_peel_ref(struct ref_store *ref_store,1780const char*refname,unsigned char*sha1)1781{1782struct files_ref_store *refs =files_downcast(ref_store,0,"peel_ref");1783int flag;1784unsigned char base[20];17851786if(current_ref_iter && current_ref_iter->refname == refname) {1787struct object_id peeled;17881789if(ref_iterator_peel(current_ref_iter, &peeled))1790return-1;1791hashcpy(sha1, peeled.hash);1792return0;1793}17941795if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1796return-1;17971798/*1799 * If the reference is packed, read its ref_entry from the1800 * cache in the hope that we already know its peeled value.1801 * We only try this optimization on packed references because1802 * (a) forcing the filling of the loose reference cache could1803 * be expensive and (b) loose references anyway usually do not1804 * have REF_KNOWS_PEELED.1805 */1806if(flag & REF_ISPACKED) {1807struct ref_entry *r =get_packed_ref(refs, refname);1808if(r) {1809if(peel_entry(r,0))1810return-1;1811hashcpy(sha1, r->u.value.peeled.hash);1812return0;1813}1814}18151816returnpeel_object(base, sha1);1817}18181819struct files_ref_iterator {1820struct ref_iterator base;18211822struct packed_ref_cache *packed_ref_cache;1823struct ref_iterator *iter0;1824unsigned int flags;1825};18261827static intfiles_ref_iterator_advance(struct ref_iterator *ref_iterator)1828{1829struct files_ref_iterator *iter =1830(struct files_ref_iterator *)ref_iterator;1831int ok;18321833while((ok =ref_iterator_advance(iter->iter0)) == ITER_OK) {1834if(iter->flags & DO_FOR_EACH_PER_WORKTREE_ONLY &&1835ref_type(iter->iter0->refname) != REF_TYPE_PER_WORKTREE)1836continue;18371838if(!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&1839!ref_resolves_to_object(iter->iter0->refname,1840 iter->iter0->oid,1841 iter->iter0->flags))1842continue;18431844 iter->base.refname = iter->iter0->refname;1845 iter->base.oid = iter->iter0->oid;1846 iter->base.flags = iter->iter0->flags;1847return ITER_OK;1848}18491850 iter->iter0 = NULL;1851if(ref_iterator_abort(ref_iterator) != ITER_DONE)1852 ok = ITER_ERROR;18531854return ok;1855}18561857static intfiles_ref_iterator_peel(struct ref_iterator *ref_iterator,1858struct object_id *peeled)1859{1860struct files_ref_iterator *iter =1861(struct files_ref_iterator *)ref_iterator;18621863returnref_iterator_peel(iter->iter0, peeled);1864}18651866static intfiles_ref_iterator_abort(struct ref_iterator *ref_iterator)1867{1868struct files_ref_iterator *iter =1869(struct files_ref_iterator *)ref_iterator;1870int ok = ITER_DONE;18711872if(iter->iter0)1873 ok =ref_iterator_abort(iter->iter0);18741875release_packed_ref_cache(iter->packed_ref_cache);1876base_ref_iterator_free(ref_iterator);1877return ok;1878}18791880static struct ref_iterator_vtable files_ref_iterator_vtable = {1881 files_ref_iterator_advance,1882 files_ref_iterator_peel,1883 files_ref_iterator_abort1884};18851886static struct ref_iterator *files_ref_iterator_begin(1887struct ref_store *ref_store,1888const char*prefix,unsigned int flags)1889{1890struct files_ref_store *refs =1891files_downcast(ref_store,1,"ref_iterator_begin");1892struct ref_dir *loose_dir, *packed_dir;1893struct ref_iterator *loose_iter, *packed_iter;1894struct files_ref_iterator *iter;1895struct ref_iterator *ref_iterator;18961897if(!refs)1898returnempty_ref_iterator_begin();18991900if(ref_paranoia <0)1901 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1902if(ref_paranoia)1903 flags |= DO_FOR_EACH_INCLUDE_BROKEN;19041905 iter =xcalloc(1,sizeof(*iter));1906 ref_iterator = &iter->base;1907base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);19081909/*1910 * We must make sure that all loose refs are read before1911 * accessing the packed-refs file; this avoids a race1912 * condition if loose refs are migrated to the packed-refs1913 * file by a simultaneous process, but our in-memory view is1914 * from before the migration. We ensure this as follows:1915 * First, we call prime_ref_dir(), which pre-reads the loose1916 * references for the subtree into the cache. (If they've1917 * already been read, that's OK; we only need to guarantee1918 * that they're read before the packed refs, not *how much*1919 * before.) After that, we call get_packed_ref_cache(), which1920 * internally checks whether the packed-ref cache is up to1921 * date with what is on disk, and re-reads it if not.1922 */19231924 loose_dir =get_loose_refs(refs);19251926if(prefix && *prefix)1927 loose_dir =find_containing_dir(loose_dir, prefix,0);19281929if(loose_dir) {1930prime_ref_dir(loose_dir);1931 loose_iter =cache_ref_iterator_begin(loose_dir);1932}else{1933/* There's nothing to iterate over. */1934 loose_iter =empty_ref_iterator_begin();1935}19361937 iter->packed_ref_cache =get_packed_ref_cache(refs);1938acquire_packed_ref_cache(iter->packed_ref_cache);1939 packed_dir =get_packed_ref_dir(iter->packed_ref_cache);19401941if(prefix && *prefix)1942 packed_dir =find_containing_dir(packed_dir, prefix,0);19431944if(packed_dir) {1945 packed_iter =cache_ref_iterator_begin(packed_dir);1946}else{1947/* There's nothing to iterate over. */1948 packed_iter =empty_ref_iterator_begin();1949}19501951 iter->iter0 =overlay_ref_iterator_begin(loose_iter, packed_iter);1952 iter->flags = flags;19531954return ref_iterator;1955}19561957/*1958 * Verify that the reference locked by lock has the value old_sha1.1959 * Fail if the reference doesn't exist and mustexist is set. Return 01960 * on success. On error, write an error message to err, set errno, and1961 * return a negative value.1962 */1963static intverify_lock(struct ref_lock *lock,1964const unsigned char*old_sha1,int mustexist,1965struct strbuf *err)1966{1967assert(err);19681969if(read_ref_full(lock->ref_name,1970 mustexist ? RESOLVE_REF_READING :0,1971 lock->old_oid.hash, NULL)) {1972if(old_sha1) {1973int save_errno = errno;1974strbuf_addf(err,"can't verify ref '%s'", lock->ref_name);1975 errno = save_errno;1976return-1;1977}else{1978oidclr(&lock->old_oid);1979return0;1980}1981}1982if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {1983strbuf_addf(err,"ref '%s' is at%sbut expected%s",1984 lock->ref_name,1985oid_to_hex(&lock->old_oid),1986sha1_to_hex(old_sha1));1987 errno = EBUSY;1988return-1;1989}1990return0;1991}19921993static intremove_empty_directories(struct strbuf *path)1994{1995/*1996 * we want to create a file but there is a directory there;1997 * if that is an empty directory (or a directory that contains1998 * only empty directories), remove them.1999 */2000returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);2001}20022003static intcreate_reflock(const char*path,void*cb)2004{2005struct lock_file *lk = cb;20062007returnhold_lock_file_for_update(lk, path, LOCK_NO_DEREF) <0? -1:0;2008}20092010/*2011 * Locks a ref returning the lock on success and NULL on failure.2012 * On failure errno is set to something meaningful.2013 */2014static struct ref_lock *lock_ref_sha1_basic(struct files_ref_store *refs,2015const char*refname,2016const unsigned char*old_sha1,2017const struct string_list *extras,2018const struct string_list *skip,2019unsigned int flags,int*type,2020struct strbuf *err)2021{2022struct strbuf ref_file = STRBUF_INIT;2023struct ref_lock *lock;2024int last_errno =0;2025int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2026int resolve_flags = RESOLVE_REF_NO_RECURSE;2027int resolved;20282029files_assert_main_repository(refs,"lock_ref_sha1_basic");2030assert(err);20312032 lock =xcalloc(1,sizeof(struct ref_lock));20332034if(mustexist)2035 resolve_flags |= RESOLVE_REF_READING;2036if(flags & REF_DELETING)2037 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;20382039strbuf_git_path(&ref_file,"%s", refname);2040 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2041 lock->old_oid.hash, type);2042if(!resolved && errno == EISDIR) {2043/*2044 * we are trying to lock foo but we used to2045 * have foo/bar which now does not exist;2046 * it is normal for the empty directory 'foo'2047 * to remain.2048 */2049if(remove_empty_directories(&ref_file)) {2050 last_errno = errno;2051if(!verify_refname_available_dir(2052 refname, extras, skip,2053get_loose_refs(refs), err))2054strbuf_addf(err,"there are still refs under '%s'",2055 refname);2056goto error_return;2057}2058 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2059 lock->old_oid.hash, type);2060}2061if(!resolved) {2062 last_errno = errno;2063if(last_errno != ENOTDIR ||2064!verify_refname_available_dir(2065 refname, extras, skip,2066get_loose_refs(refs), err))2067strbuf_addf(err,"unable to resolve reference '%s':%s",2068 refname,strerror(last_errno));20692070goto error_return;2071}20722073/*2074 * If the ref did not exist and we are creating it, make sure2075 * there is no existing packed ref whose name begins with our2076 * refname, nor a packed ref whose name is a proper prefix of2077 * our refname.2078 */2079if(is_null_oid(&lock->old_oid) &&2080verify_refname_available_dir(refname, extras, skip,2081get_packed_refs(refs),2082 err)) {2083 last_errno = ENOTDIR;2084goto error_return;2085}20862087 lock->lk =xcalloc(1,sizeof(struct lock_file));20882089 lock->ref_name =xstrdup(refname);20902091if(raceproof_create_file(ref_file.buf, create_reflock, lock->lk)) {2092 last_errno = errno;2093unable_to_lock_message(ref_file.buf, errno, err);2094goto error_return;2095}20962097if(verify_lock(lock, old_sha1, mustexist, err)) {2098 last_errno = errno;2099goto error_return;2100}2101goto out;21022103 error_return:2104unlock_ref(lock);2105 lock = NULL;21062107 out:2108strbuf_release(&ref_file);2109 errno = last_errno;2110return lock;2111}21122113/*2114 * Write an entry to the packed-refs file for the specified refname.2115 * If peeled is non-NULL, write it as the entry's peeled value.2116 */2117static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2118unsigned char*peeled)2119{2120fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2121if(peeled)2122fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2123}21242125/*2126 * An each_ref_entry_fn that writes the entry to a packed-refs file.2127 */2128static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2129{2130enum peel_status peel_status =peel_entry(entry,0);21312132if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2133error("internal error:%sis not a valid packed reference!",2134 entry->name);2135write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2136 peel_status == PEEL_PEELED ?2137 entry->u.value.peeled.hash : NULL);2138return0;2139}21402141/*2142 * Lock the packed-refs file for writing. Flags is passed to2143 * hold_lock_file_for_update(). Return 0 on success. On errors, set2144 * errno appropriately and return a nonzero value.2145 */2146static intlock_packed_refs(struct files_ref_store *refs,int flags)2147{2148static int timeout_configured =0;2149static int timeout_value =1000;2150struct packed_ref_cache *packed_ref_cache;21512152files_assert_main_repository(refs,"lock_packed_refs");21532154if(!timeout_configured) {2155git_config_get_int("core.packedrefstimeout", &timeout_value);2156 timeout_configured =1;2157}21582159if(hold_lock_file_for_update_timeout(2160&packlock,git_path("packed-refs"),2161 flags, timeout_value) <0)2162return-1;2163/*2164 * Get the current packed-refs while holding the lock. If the2165 * packed-refs file has been modified since we last read it,2166 * this will automatically invalidate the cache and re-read2167 * the packed-refs file.2168 */2169 packed_ref_cache =get_packed_ref_cache(refs);2170 packed_ref_cache->lock = &packlock;2171/* Increment the reference count to prevent it from being freed: */2172acquire_packed_ref_cache(packed_ref_cache);2173return0;2174}21752176/*2177 * Write the current version of the packed refs cache from memory to2178 * disk. The packed-refs file must already be locked for writing (see2179 * lock_packed_refs()). Return zero on success. On errors, set errno2180 * and return a nonzero value2181 */2182static intcommit_packed_refs(struct files_ref_store *refs)2183{2184struct packed_ref_cache *packed_ref_cache =2185get_packed_ref_cache(refs);2186int error =0;2187int save_errno =0;2188FILE*out;21892190files_assert_main_repository(refs,"commit_packed_refs");21912192if(!packed_ref_cache->lock)2193die("internal error: packed-refs not locked");21942195 out =fdopen_lock_file(packed_ref_cache->lock,"w");2196if(!out)2197die_errno("unable to fdopen packed-refs descriptor");21982199fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2200do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),22010, write_packed_entry_fn, out);22022203if(commit_lock_file(packed_ref_cache->lock)) {2204 save_errno = errno;2205 error = -1;2206}2207 packed_ref_cache->lock = NULL;2208release_packed_ref_cache(packed_ref_cache);2209 errno = save_errno;2210return error;2211}22122213/*2214 * Rollback the lockfile for the packed-refs file, and discard the2215 * in-memory packed reference cache. (The packed-refs file will be2216 * read anew if it is needed again after this function is called.)2217 */2218static voidrollback_packed_refs(struct files_ref_store *refs)2219{2220struct packed_ref_cache *packed_ref_cache =2221get_packed_ref_cache(refs);22222223files_assert_main_repository(refs,"rollback_packed_refs");22242225if(!packed_ref_cache->lock)2226die("internal error: packed-refs not locked");2227rollback_lock_file(packed_ref_cache->lock);2228 packed_ref_cache->lock = NULL;2229release_packed_ref_cache(packed_ref_cache);2230clear_packed_ref_cache(refs);2231}22322233struct ref_to_prune {2234struct ref_to_prune *next;2235unsigned char sha1[20];2236char name[FLEX_ARRAY];2237};22382239struct pack_refs_cb_data {2240unsigned int flags;2241struct ref_dir *packed_refs;2242struct ref_to_prune *ref_to_prune;2243};22442245/*2246 * An each_ref_entry_fn that is run over loose references only. If2247 * the loose reference can be packed, add an entry in the packed ref2248 * cache. If the reference should be pruned, also add it to2249 * ref_to_prune in the pack_refs_cb_data.2250 */2251static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2252{2253struct pack_refs_cb_data *cb = cb_data;2254enum peel_status peel_status;2255struct ref_entry *packed_entry;2256int is_tag_ref =starts_with(entry->name,"refs/tags/");22572258/* Do not pack per-worktree refs: */2259if(ref_type(entry->name) != REF_TYPE_NORMAL)2260return0;22612262/* ALWAYS pack tags */2263if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2264return0;22652266/* Do not pack symbolic or broken refs: */2267if((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))2268return0;22692270/* Add a packed ref cache entry equivalent to the loose entry. */2271 peel_status =peel_entry(entry,1);2272if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2273die("internal error peeling reference%s(%s)",2274 entry->name,oid_to_hex(&entry->u.value.oid));2275 packed_entry =find_ref(cb->packed_refs, entry->name);2276if(packed_entry) {2277/* Overwrite existing packed entry with info from loose entry */2278 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2279oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2280}else{2281 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2282 REF_ISPACKED | REF_KNOWS_PEELED,0);2283add_ref(cb->packed_refs, packed_entry);2284}2285oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);22862287/* Schedule the loose reference for pruning if requested. */2288if((cb->flags & PACK_REFS_PRUNE)) {2289struct ref_to_prune *n;2290FLEX_ALLOC_STR(n, name, entry->name);2291hashcpy(n->sha1, entry->u.value.oid.hash);2292 n->next = cb->ref_to_prune;2293 cb->ref_to_prune = n;2294}2295return0;2296}22972298enum{2299 REMOVE_EMPTY_PARENTS_REF =0x01,2300 REMOVE_EMPTY_PARENTS_REFLOG =0x022301};23022303/*2304 * Remove empty parent directories associated with the specified2305 * reference and/or its reflog, but spare [logs/]refs/ and immediate2306 * subdirs. flags is a combination of REMOVE_EMPTY_PARENTS_REF and/or2307 * REMOVE_EMPTY_PARENTS_REFLOG.2308 */2309static voidtry_remove_empty_parents(const char*refname,unsigned int flags)2310{2311struct strbuf buf = STRBUF_INIT;2312char*p, *q;2313int i;23142315strbuf_addstr(&buf, refname);2316 p = buf.buf;2317for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2318while(*p && *p !='/')2319 p++;2320/* tolerate duplicate slashes; see check_refname_format() */2321while(*p =='/')2322 p++;2323}2324 q = buf.buf + buf.len;2325while(flags & (REMOVE_EMPTY_PARENTS_REF | REMOVE_EMPTY_PARENTS_REFLOG)) {2326while(q > p && *q !='/')2327 q--;2328while(q > p && *(q-1) =='/')2329 q--;2330if(q == p)2331break;2332strbuf_setlen(&buf, q - buf.buf);2333if((flags & REMOVE_EMPTY_PARENTS_REF) &&2334rmdir(git_path("%s", buf.buf)))2335 flags &= ~REMOVE_EMPTY_PARENTS_REF;2336if((flags & REMOVE_EMPTY_PARENTS_REFLOG) &&2337rmdir(git_path("logs/%s", buf.buf)))2338 flags &= ~REMOVE_EMPTY_PARENTS_REFLOG;2339}2340strbuf_release(&buf);2341}23422343/* make sure nobody touched the ref, and unlink */2344static voidprune_ref(struct ref_to_prune *r)2345{2346struct ref_transaction *transaction;2347struct strbuf err = STRBUF_INIT;23482349if(check_refname_format(r->name,0))2350return;23512352 transaction =ref_transaction_begin(&err);2353if(!transaction ||2354ref_transaction_delete(transaction, r->name, r->sha1,2355 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2356ref_transaction_commit(transaction, &err)) {2357ref_transaction_free(transaction);2358error("%s", err.buf);2359strbuf_release(&err);2360return;2361}2362ref_transaction_free(transaction);2363strbuf_release(&err);2364}23652366static voidprune_refs(struct ref_to_prune *r)2367{2368while(r) {2369prune_ref(r);2370 r = r->next;2371}2372}23732374static intfiles_pack_refs(struct ref_store *ref_store,unsigned int flags)2375{2376struct files_ref_store *refs =2377files_downcast(ref_store,0,"pack_refs");2378struct pack_refs_cb_data cbdata;23792380memset(&cbdata,0,sizeof(cbdata));2381 cbdata.flags = flags;23822383lock_packed_refs(refs, LOCK_DIE_ON_ERROR);2384 cbdata.packed_refs =get_packed_refs(refs);23852386do_for_each_entry_in_dir(get_loose_refs(refs),0,2387 pack_if_possible_fn, &cbdata);23882389if(commit_packed_refs(refs))2390die_errno("unable to overwrite old ref-pack file");23912392prune_refs(cbdata.ref_to_prune);2393return0;2394}23952396/*2397 * Rewrite the packed-refs file, omitting any refs listed in2398 * 'refnames'. On error, leave packed-refs unchanged, write an error2399 * message to 'err', and return a nonzero value.2400 *2401 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2402 */2403static intrepack_without_refs(struct files_ref_store *refs,2404struct string_list *refnames,struct strbuf *err)2405{2406struct ref_dir *packed;2407struct string_list_item *refname;2408int ret, needs_repacking =0, removed =0;24092410files_assert_main_repository(refs,"repack_without_refs");2411assert(err);24122413/* Look for a packed ref */2414for_each_string_list_item(refname, refnames) {2415if(get_packed_ref(refs, refname->string)) {2416 needs_repacking =1;2417break;2418}2419}24202421/* Avoid locking if we have nothing to do */2422if(!needs_repacking)2423return0;/* no refname exists in packed refs */24242425if(lock_packed_refs(refs,0)) {2426unable_to_lock_message(git_path("packed-refs"), errno, err);2427return-1;2428}2429 packed =get_packed_refs(refs);24302431/* Remove refnames from the cache */2432for_each_string_list_item(refname, refnames)2433if(remove_entry(packed, refname->string) != -1)2434 removed =1;2435if(!removed) {2436/*2437 * All packed entries disappeared while we were2438 * acquiring the lock.2439 */2440rollback_packed_refs(refs);2441return0;2442}24432444/* Write what remains */2445 ret =commit_packed_refs(refs);2446if(ret)2447strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2448strerror(errno));2449return ret;2450}24512452static intfiles_delete_refs(struct ref_store *ref_store,2453struct string_list *refnames,unsigned int flags)2454{2455struct files_ref_store *refs =2456files_downcast(ref_store,0,"delete_refs");2457struct strbuf err = STRBUF_INIT;2458int i, result =0;24592460if(!refnames->nr)2461return0;24622463 result =repack_without_refs(refs, refnames, &err);2464if(result) {2465/*2466 * If we failed to rewrite the packed-refs file, then2467 * it is unsafe to try to remove loose refs, because2468 * doing so might expose an obsolete packed value for2469 * a reference that might even point at an object that2470 * has been garbage collected.2471 */2472if(refnames->nr ==1)2473error(_("could not delete reference%s:%s"),2474 refnames->items[0].string, err.buf);2475else2476error(_("could not delete references:%s"), err.buf);24772478goto out;2479}24802481for(i =0; i < refnames->nr; i++) {2482const char*refname = refnames->items[i].string;24832484if(delete_ref(NULL, refname, NULL, flags))2485 result |=error(_("could not remove reference%s"), refname);2486}24872488out:2489strbuf_release(&err);2490return result;2491}24922493/*2494 * People using contrib's git-new-workdir have .git/logs/refs ->2495 * /some/other/path/.git/logs/refs, and that may live on another device.2496 *2497 * IOW, to avoid cross device rename errors, the temporary renamed log must2498 * live into logs/refs.2499 */2500#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"25012502static intrename_tmp_log_callback(const char*path,void*cb)2503{2504int*true_errno = cb;25052506if(rename(git_path(TMP_RENAMED_LOG), path)) {2507/*2508 * rename(a, b) when b is an existing directory ought2509 * to result in ISDIR, but Solaris 5.8 gives ENOTDIR.2510 * Sheesh. Record the true errno for error reporting,2511 * but report EISDIR to raceproof_create_file() so2512 * that it knows to retry.2513 */2514*true_errno = errno;2515if(errno == ENOTDIR)2516 errno = EISDIR;2517return-1;2518}else{2519return0;2520}2521}25222523static intrename_tmp_log(const char*newrefname)2524{2525char*path =git_pathdup("logs/%s", newrefname);2526int ret, true_errno;25272528 ret =raceproof_create_file(path, rename_tmp_log_callback, &true_errno);2529if(ret) {2530if(errno == EISDIR)2531error("directory not empty:%s", path);2532else2533error("unable to move logfile%sto%s:%s",2534git_path(TMP_RENAMED_LOG), path,2535strerror(true_errno));2536}25372538free(path);2539return ret;2540}25412542static intfiles_verify_refname_available(struct ref_store *ref_store,2543const char*newname,2544const struct string_list *extras,2545const struct string_list *skip,2546struct strbuf *err)2547{2548struct files_ref_store *refs =2549files_downcast(ref_store,1,"verify_refname_available");2550struct ref_dir *packed_refs =get_packed_refs(refs);2551struct ref_dir *loose_refs =get_loose_refs(refs);25522553if(verify_refname_available_dir(newname, extras, skip,2554 packed_refs, err) ||2555verify_refname_available_dir(newname, extras, skip,2556 loose_refs, err))2557return-1;25582559return0;2560}25612562static intwrite_ref_to_lockfile(struct ref_lock *lock,2563const unsigned char*sha1,struct strbuf *err);2564static intcommit_ref_update(struct files_ref_store *refs,2565struct ref_lock *lock,2566const unsigned char*sha1,const char*logmsg,2567struct strbuf *err);25682569static intfiles_rename_ref(struct ref_store *ref_store,2570const char*oldrefname,const char*newrefname,2571const char*logmsg)2572{2573struct files_ref_store *refs =2574files_downcast(ref_store,0,"rename_ref");2575unsigned char sha1[20], orig_sha1[20];2576int flag =0, logmoved =0;2577struct ref_lock *lock;2578struct stat loginfo;2579int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2580struct strbuf err = STRBUF_INIT;25812582if(log &&S_ISLNK(loginfo.st_mode))2583returnerror("reflog for%sis a symlink", oldrefname);25842585if(!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2586 orig_sha1, &flag))2587returnerror("refname%snot found", oldrefname);25882589if(flag & REF_ISSYMREF)2590returnerror("refname%sis a symbolic ref, renaming it is not supported",2591 oldrefname);2592if(!rename_ref_available(oldrefname, newrefname))2593return1;25942595if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2596returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2597 oldrefname,strerror(errno));25982599if(delete_ref(logmsg, oldrefname, orig_sha1, REF_NODEREF)) {2600error("unable to delete old%s", oldrefname);2601goto rollback;2602}26032604/*2605 * Since we are doing a shallow lookup, sha1 is not the2606 * correct value to pass to delete_ref as old_sha1. But that2607 * doesn't matter, because an old_sha1 check wouldn't add to2608 * the safety anyway; we want to delete the reference whatever2609 * its current value.2610 */2611if(!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2612 sha1, NULL) &&2613delete_ref(NULL, newrefname, NULL, REF_NODEREF)) {2614if(errno == EISDIR) {2615struct strbuf path = STRBUF_INIT;2616int result;26172618strbuf_git_path(&path,"%s", newrefname);2619 result =remove_empty_directories(&path);2620strbuf_release(&path);26212622if(result) {2623error("Directory not empty:%s", newrefname);2624goto rollback;2625}2626}else{2627error("unable to delete existing%s", newrefname);2628goto rollback;2629}2630}26312632if(log &&rename_tmp_log(newrefname))2633goto rollback;26342635 logmoved = log;26362637 lock =lock_ref_sha1_basic(refs, newrefname, NULL, NULL, NULL,2638 REF_NODEREF, NULL, &err);2639if(!lock) {2640error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2641strbuf_release(&err);2642goto rollback;2643}2644hashcpy(lock->old_oid.hash, orig_sha1);26452646if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2647commit_ref_update(refs, lock, orig_sha1, logmsg, &err)) {2648error("unable to write current sha1 into%s:%s", newrefname, err.buf);2649strbuf_release(&err);2650goto rollback;2651}26522653return0;26542655 rollback:2656 lock =lock_ref_sha1_basic(refs, oldrefname, NULL, NULL, NULL,2657 REF_NODEREF, NULL, &err);2658if(!lock) {2659error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2660strbuf_release(&err);2661goto rollbacklog;2662}26632664 flag = log_all_ref_updates;2665 log_all_ref_updates = LOG_REFS_NONE;2666if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2667commit_ref_update(refs, lock, orig_sha1, NULL, &err)) {2668error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2669strbuf_release(&err);2670}2671 log_all_ref_updates = flag;26722673 rollbacklog:2674if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2675error("unable to restore logfile%sfrom%s:%s",2676 oldrefname, newrefname,strerror(errno));2677if(!logmoved && log &&2678rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2679error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2680 oldrefname,strerror(errno));26812682return1;2683}26842685static intclose_ref(struct ref_lock *lock)2686{2687if(close_lock_file(lock->lk))2688return-1;2689return0;2690}26912692static intcommit_ref(struct ref_lock *lock)2693{2694char*path =get_locked_file_path(lock->lk);2695struct stat st;26962697if(!lstat(path, &st) &&S_ISDIR(st.st_mode)) {2698/*2699 * There is a directory at the path we want to rename2700 * the lockfile to. Hopefully it is empty; try to2701 * delete it.2702 */2703size_t len =strlen(path);2704struct strbuf sb_path = STRBUF_INIT;27052706strbuf_attach(&sb_path, path, len, len);27072708/*2709 * If this fails, commit_lock_file() will also fail2710 * and will report the problem.2711 */2712remove_empty_directories(&sb_path);2713strbuf_release(&sb_path);2714}else{2715free(path);2716}27172718if(commit_lock_file(lock->lk))2719return-1;2720return0;2721}27222723static intopen_or_create_logfile(const char*path,void*cb)2724{2725int*fd = cb;27262727*fd =open(path, O_APPEND | O_WRONLY | O_CREAT,0666);2728return(*fd <0) ? -1:0;2729}27302731/*2732 * Create a reflog for a ref. If force_create = 0, only create the2733 * reflog for certain refs (those for which should_autocreate_reflog2734 * returns non-zero). Otherwise, create it regardless of the reference2735 * name. If the logfile already existed or was created, return 0 and2736 * set *logfd to the file descriptor opened for appending to the file.2737 * If no logfile exists and we decided not to create one, return 0 and2738 * set *logfd to -1. On failure, fill in *err, set *logfd to -1, and2739 * return -1.2740 */2741static intlog_ref_setup(const char*refname,int force_create,2742int*logfd,struct strbuf *err)2743{2744char*logfile =git_pathdup("logs/%s", refname);27452746if(force_create ||should_autocreate_reflog(refname)) {2747if(raceproof_create_file(logfile, open_or_create_logfile, logfd)) {2748if(errno == ENOENT)2749strbuf_addf(err,"unable to create directory for '%s': "2750"%s", logfile,strerror(errno));2751else if(errno == EISDIR)2752strbuf_addf(err,"there are still logs under '%s'",2753 logfile);2754else2755strbuf_addf(err,"unable to append to '%s':%s",2756 logfile,strerror(errno));27572758goto error;2759}2760}else{2761*logfd =open(logfile, O_APPEND | O_WRONLY,0666);2762if(*logfd <0) {2763if(errno == ENOENT || errno == EISDIR) {2764/*2765 * The logfile doesn't already exist,2766 * but that is not an error; it only2767 * means that we won't write log2768 * entries to it.2769 */2770;2771}else{2772strbuf_addf(err,"unable to append to '%s':%s",2773 logfile,strerror(errno));2774goto error;2775}2776}2777}27782779if(*logfd >=0)2780adjust_shared_perm(logfile);27812782free(logfile);2783return0;27842785error:2786free(logfile);2787return-1;2788}27892790static intfiles_create_reflog(struct ref_store *ref_store,2791const char*refname,int force_create,2792struct strbuf *err)2793{2794int fd;27952796/* Check validity (but we don't need the result): */2797files_downcast(ref_store,0,"create_reflog");27982799if(log_ref_setup(refname, force_create, &fd, err))2800return-1;28012802if(fd >=0)2803close(fd);28042805return0;2806}28072808static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2809const unsigned char*new_sha1,2810const char*committer,const char*msg)2811{2812int msglen, written;2813unsigned maxlen, len;2814char*logrec;28152816 msglen = msg ?strlen(msg) :0;2817 maxlen =strlen(committer) + msglen +100;2818 logrec =xmalloc(maxlen);2819 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2820sha1_to_hex(old_sha1),2821sha1_to_hex(new_sha1),2822 committer);2823if(msglen)2824 len +=copy_reflog_msg(logrec + len -1, msg) -1;28252826 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2827free(logrec);2828if(written != len)2829return-1;28302831return0;2832}28332834intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2835const unsigned char*new_sha1,const char*msg,2836int flags,struct strbuf *err)2837{2838int logfd, result;28392840if(log_all_ref_updates == LOG_REFS_UNSET)2841 log_all_ref_updates =is_bare_repository() ? LOG_REFS_NONE : LOG_REFS_NORMAL;28422843 result =log_ref_setup(refname, flags & REF_FORCE_CREATE_REFLOG,2844&logfd, err);28452846if(result)2847return result;28482849if(logfd <0)2850return0;2851 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2852git_committer_info(0), msg);2853if(result) {2854int save_errno = errno;28552856strbuf_addf(err,"unable to append to '%s':%s",2857git_path("logs/%s", refname),strerror(save_errno));2858close(logfd);2859return-1;2860}2861if(close(logfd)) {2862int save_errno = errno;28632864strbuf_addf(err,"unable to append to '%s':%s",2865git_path("logs/%s", refname),strerror(save_errno));2866return-1;2867}2868return0;2869}28702871/*2872 * Write sha1 into the open lockfile, then close the lockfile. On2873 * errors, rollback the lockfile, fill in *err and2874 * return -1.2875 */2876static intwrite_ref_to_lockfile(struct ref_lock *lock,2877const unsigned char*sha1,struct strbuf *err)2878{2879static char term ='\n';2880struct object *o;2881int fd;28822883 o =parse_object(sha1);2884if(!o) {2885strbuf_addf(err,2886"trying to write ref '%s' with nonexistent object%s",2887 lock->ref_name,sha1_to_hex(sha1));2888unlock_ref(lock);2889return-1;2890}2891if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2892strbuf_addf(err,2893"trying to write non-commit object%sto branch '%s'",2894sha1_to_hex(sha1), lock->ref_name);2895unlock_ref(lock);2896return-1;2897}2898 fd =get_lock_file_fd(lock->lk);2899if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2900write_in_full(fd, &term,1) !=1||2901close_ref(lock) <0) {2902strbuf_addf(err,2903"couldn't write '%s'",get_lock_file_path(lock->lk));2904unlock_ref(lock);2905return-1;2906}2907return0;2908}29092910/*2911 * Commit a change to a loose reference that has already been written2912 * to the loose reference lockfile. Also update the reflogs if2913 * necessary, using the specified lockmsg (which can be NULL).2914 */2915static intcommit_ref_update(struct files_ref_store *refs,2916struct ref_lock *lock,2917const unsigned char*sha1,const char*logmsg,2918struct strbuf *err)2919{2920files_assert_main_repository(refs,"commit_ref_update");29212922clear_loose_ref_cache(refs);2923if(files_log_ref_write(lock->ref_name, lock->old_oid.hash, sha1,2924 logmsg,0, err)) {2925char*old_msg =strbuf_detach(err, NULL);2926strbuf_addf(err,"cannot update the ref '%s':%s",2927 lock->ref_name, old_msg);2928free(old_msg);2929unlock_ref(lock);2930return-1;2931}29322933if(strcmp(lock->ref_name,"HEAD") !=0) {2934/*2935 * Special hack: If a branch is updated directly and HEAD2936 * points to it (may happen on the remote side of a push2937 * for example) then logically the HEAD reflog should be2938 * updated too.2939 * A generic solution implies reverse symref information,2940 * but finding all symrefs pointing to the given branch2941 * would be rather costly for this rare event (the direct2942 * update of a branch) to be worth it. So let's cheat and2943 * check with HEAD only which should cover 99% of all usage2944 * scenarios (even 100% of the default ones).2945 */2946unsigned char head_sha1[20];2947int head_flag;2948const char*head_ref;29492950 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,2951 head_sha1, &head_flag);2952if(head_ref && (head_flag & REF_ISSYMREF) &&2953!strcmp(head_ref, lock->ref_name)) {2954struct strbuf log_err = STRBUF_INIT;2955if(files_log_ref_write("HEAD", lock->old_oid.hash, sha1,2956 logmsg,0, &log_err)) {2957error("%s", log_err.buf);2958strbuf_release(&log_err);2959}2960}2961}29622963if(commit_ref(lock)) {2964strbuf_addf(err,"couldn't set '%s'", lock->ref_name);2965unlock_ref(lock);2966return-1;2967}29682969unlock_ref(lock);2970return0;2971}29722973static intcreate_ref_symlink(struct ref_lock *lock,const char*target)2974{2975int ret = -1;2976#ifndef NO_SYMLINK_HEAD2977char*ref_path =get_locked_file_path(lock->lk);2978unlink(ref_path);2979 ret =symlink(target, ref_path);2980free(ref_path);29812982if(ret)2983fprintf(stderr,"no symlink - falling back to symbolic ref\n");2984#endif2985return ret;2986}29872988static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,2989const char*target,const char*logmsg)2990{2991struct strbuf err = STRBUF_INIT;2992unsigned char new_sha1[20];2993if(logmsg && !read_ref(target, new_sha1) &&2994files_log_ref_write(refname, lock->old_oid.hash, new_sha1,2995 logmsg,0, &err)) {2996error("%s", err.buf);2997strbuf_release(&err);2998}2999}30003001static intcreate_symref_locked(struct ref_lock *lock,const char*refname,3002const char*target,const char*logmsg)3003{3004if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {3005update_symref_reflog(lock, refname, target, logmsg);3006return0;3007}30083009if(!fdopen_lock_file(lock->lk,"w"))3010returnerror("unable to fdopen%s:%s",3011 lock->lk->tempfile.filename.buf,strerror(errno));30123013update_symref_reflog(lock, refname, target, logmsg);30143015/* no error check; commit_ref will check ferror */3016fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);3017if(commit_ref(lock) <0)3018returnerror("unable to write symref for%s:%s", refname,3019strerror(errno));3020return0;3021}30223023static intfiles_create_symref(struct ref_store *ref_store,3024const char*refname,const char*target,3025const char*logmsg)3026{3027struct files_ref_store *refs =3028files_downcast(ref_store,0,"create_symref");3029struct strbuf err = STRBUF_INIT;3030struct ref_lock *lock;3031int ret;30323033 lock =lock_ref_sha1_basic(refs, refname, NULL,3034 NULL, NULL, REF_NODEREF, NULL,3035&err);3036if(!lock) {3037error("%s", err.buf);3038strbuf_release(&err);3039return-1;3040}30413042 ret =create_symref_locked(lock, refname, target, logmsg);3043unlock_ref(lock);3044return ret;3045}30463047intset_worktree_head_symref(const char*gitdir,const char*target,const char*logmsg)3048{3049static struct lock_file head_lock;3050struct ref_lock *lock;3051struct strbuf head_path = STRBUF_INIT;3052const char*head_rel;3053int ret;30543055strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));3056if(hold_lock_file_for_update(&head_lock, head_path.buf,3057 LOCK_NO_DEREF) <0) {3058struct strbuf err = STRBUF_INIT;3059unable_to_lock_message(head_path.buf, errno, &err);3060error("%s", err.buf);3061strbuf_release(&err);3062strbuf_release(&head_path);3063return-1;3064}30653066/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3067 linked trees */3068 head_rel =remove_leading_path(head_path.buf,3069absolute_path(get_git_common_dir()));3070/* to make use of create_symref_locked(), initialize ref_lock */3071 lock =xcalloc(1,sizeof(struct ref_lock));3072 lock->lk = &head_lock;3073 lock->ref_name =xstrdup(head_rel);30743075 ret =create_symref_locked(lock, head_rel, target, logmsg);30763077unlock_ref(lock);/* will free lock */3078strbuf_release(&head_path);3079return ret;3080}30813082static intfiles_reflog_exists(struct ref_store *ref_store,3083const char*refname)3084{3085struct stat st;30863087/* Check validity (but we don't need the result): */3088files_downcast(ref_store,0,"reflog_exists");30893090return!lstat(git_path("logs/%s", refname), &st) &&3091S_ISREG(st.st_mode);3092}30933094static intfiles_delete_reflog(struct ref_store *ref_store,3095const char*refname)3096{3097/* Check validity (but we don't need the result): */3098files_downcast(ref_store,0,"delete_reflog");30993100returnremove_path(git_path("logs/%s", refname));3101}31023103static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3104{3105unsigned char osha1[20], nsha1[20];3106char*email_end, *message;3107unsigned long timestamp;3108int tz;31093110/* old SP new SP name <email> SP time TAB msg LF */3111if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3112get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3113get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3114!(email_end =strchr(sb->buf +82,'>')) ||3115 email_end[1] !=' '||3116!(timestamp =strtoul(email_end +2, &message,10)) ||3117!message || message[0] !=' '||3118(message[1] !='+'&& message[1] !='-') ||3119!isdigit(message[2]) || !isdigit(message[3]) ||3120!isdigit(message[4]) || !isdigit(message[5]))3121return0;/* corrupt? */3122 email_end[1] ='\0';3123 tz =strtol(message +1, NULL,10);3124if(message[6] !='\t')3125 message +=6;3126else3127 message +=7;3128returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3129}31303131static char*find_beginning_of_line(char*bob,char*scan)3132{3133while(bob < scan && *(--scan) !='\n')3134;/* keep scanning backwards */3135/*3136 * Return either beginning of the buffer, or LF at the end of3137 * the previous line.3138 */3139return scan;3140}31413142static intfiles_for_each_reflog_ent_reverse(struct ref_store *ref_store,3143const char*refname,3144 each_reflog_ent_fn fn,3145void*cb_data)3146{3147struct strbuf sb = STRBUF_INIT;3148FILE*logfp;3149long pos;3150int ret =0, at_tail =1;31513152/* Check validity (but we don't need the result): */3153files_downcast(ref_store,0,"for_each_reflog_ent_reverse");31543155 logfp =fopen(git_path("logs/%s", refname),"r");3156if(!logfp)3157return-1;31583159/* Jump to the end */3160if(fseek(logfp,0, SEEK_END) <0)3161returnerror("cannot seek back reflog for%s:%s",3162 refname,strerror(errno));3163 pos =ftell(logfp);3164while(!ret &&0< pos) {3165int cnt;3166size_t nread;3167char buf[BUFSIZ];3168char*endp, *scanp;31693170/* Fill next block from the end */3171 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3172if(fseek(logfp, pos - cnt, SEEK_SET))3173returnerror("cannot seek back reflog for%s:%s",3174 refname,strerror(errno));3175 nread =fread(buf, cnt,1, logfp);3176if(nread !=1)3177returnerror("cannot read%dbytes from reflog for%s:%s",3178 cnt, refname,strerror(errno));3179 pos -= cnt;31803181 scanp = endp = buf + cnt;3182if(at_tail && scanp[-1] =='\n')3183/* Looking at the final LF at the end of the file */3184 scanp--;3185 at_tail =0;31863187while(buf < scanp) {3188/*3189 * terminating LF of the previous line, or the beginning3190 * of the buffer.3191 */3192char*bp;31933194 bp =find_beginning_of_line(buf, scanp);31953196if(*bp =='\n') {3197/*3198 * The newline is the end of the previous line,3199 * so we know we have complete line starting3200 * at (bp + 1). Prefix it onto any prior data3201 * we collected for the line and process it.3202 */3203strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3204 scanp = bp;3205 endp = bp +1;3206 ret =show_one_reflog_ent(&sb, fn, cb_data);3207strbuf_reset(&sb);3208if(ret)3209break;3210}else if(!pos) {3211/*3212 * We are at the start of the buffer, and the3213 * start of the file; there is no previous3214 * line, and we have everything for this one.3215 * Process it, and we can end the loop.3216 */3217strbuf_splice(&sb,0,0, buf, endp - buf);3218 ret =show_one_reflog_ent(&sb, fn, cb_data);3219strbuf_reset(&sb);3220break;3221}32223223if(bp == buf) {3224/*3225 * We are at the start of the buffer, and there3226 * is more file to read backwards. Which means3227 * we are in the middle of a line. Note that we3228 * may get here even if *bp was a newline; that3229 * just means we are at the exact end of the3230 * previous line, rather than some spot in the3231 * middle.3232 *3233 * Save away what we have to be combined with3234 * the data from the next read.3235 */3236strbuf_splice(&sb,0,0, buf, endp - buf);3237break;3238}3239}32403241}3242if(!ret && sb.len)3243die("BUG: reverse reflog parser had leftover data");32443245fclose(logfp);3246strbuf_release(&sb);3247return ret;3248}32493250static intfiles_for_each_reflog_ent(struct ref_store *ref_store,3251const char*refname,3252 each_reflog_ent_fn fn,void*cb_data)3253{3254FILE*logfp;3255struct strbuf sb = STRBUF_INIT;3256int ret =0;32573258/* Check validity (but we don't need the result): */3259files_downcast(ref_store,0,"for_each_reflog_ent");32603261 logfp =fopen(git_path("logs/%s", refname),"r");3262if(!logfp)3263return-1;32643265while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3266 ret =show_one_reflog_ent(&sb, fn, cb_data);3267fclose(logfp);3268strbuf_release(&sb);3269return ret;3270}32713272struct files_reflog_iterator {3273struct ref_iterator base;32743275struct dir_iterator *dir_iterator;3276struct object_id oid;3277};32783279static intfiles_reflog_iterator_advance(struct ref_iterator *ref_iterator)3280{3281struct files_reflog_iterator *iter =3282(struct files_reflog_iterator *)ref_iterator;3283struct dir_iterator *diter = iter->dir_iterator;3284int ok;32853286while((ok =dir_iterator_advance(diter)) == ITER_OK) {3287int flags;32883289if(!S_ISREG(diter->st.st_mode))3290continue;3291if(diter->basename[0] =='.')3292continue;3293if(ends_with(diter->basename,".lock"))3294continue;32953296if(read_ref_full(diter->relative_path,0,3297 iter->oid.hash, &flags)) {3298error("bad ref for%s", diter->path.buf);3299continue;3300}33013302 iter->base.refname = diter->relative_path;3303 iter->base.oid = &iter->oid;3304 iter->base.flags = flags;3305return ITER_OK;3306}33073308 iter->dir_iterator = NULL;3309if(ref_iterator_abort(ref_iterator) == ITER_ERROR)3310 ok = ITER_ERROR;3311return ok;3312}33133314static intfiles_reflog_iterator_peel(struct ref_iterator *ref_iterator,3315struct object_id *peeled)3316{3317die("BUG: ref_iterator_peel() called for reflog_iterator");3318}33193320static intfiles_reflog_iterator_abort(struct ref_iterator *ref_iterator)3321{3322struct files_reflog_iterator *iter =3323(struct files_reflog_iterator *)ref_iterator;3324int ok = ITER_DONE;33253326if(iter->dir_iterator)3327 ok =dir_iterator_abort(iter->dir_iterator);33283329base_ref_iterator_free(ref_iterator);3330return ok;3331}33323333static struct ref_iterator_vtable files_reflog_iterator_vtable = {3334 files_reflog_iterator_advance,3335 files_reflog_iterator_peel,3336 files_reflog_iterator_abort3337};33383339static struct ref_iterator *files_reflog_iterator_begin(struct ref_store *ref_store)3340{3341struct files_reflog_iterator *iter =xcalloc(1,sizeof(*iter));3342struct ref_iterator *ref_iterator = &iter->base;33433344/* Check validity (but we don't need the result): */3345files_downcast(ref_store,0,"reflog_iterator_begin");33463347base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);3348 iter->dir_iterator =dir_iterator_begin(git_path("logs"));3349return ref_iterator;3350}33513352static intref_update_reject_duplicates(struct string_list *refnames,3353struct strbuf *err)3354{3355int i, n = refnames->nr;33563357assert(err);33583359for(i =1; i < n; i++)3360if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3361strbuf_addf(err,3362"multiple updates for ref '%s' not allowed.",3363 refnames->items[i].string);3364return1;3365}3366return0;3367}33683369/*3370 * If update is a direct update of head_ref (the reference pointed to3371 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3372 */3373static intsplit_head_update(struct ref_update *update,3374struct ref_transaction *transaction,3375const char*head_ref,3376struct string_list *affected_refnames,3377struct strbuf *err)3378{3379struct string_list_item *item;3380struct ref_update *new_update;33813382if((update->flags & REF_LOG_ONLY) ||3383(update->flags & REF_ISPRUNING) ||3384(update->flags & REF_UPDATE_VIA_HEAD))3385return0;33863387if(strcmp(update->refname, head_ref))3388return0;33893390/*3391 * First make sure that HEAD is not already in the3392 * transaction. This insertion is O(N) in the transaction3393 * size, but it happens at most once per transaction.3394 */3395 item =string_list_insert(affected_refnames,"HEAD");3396if(item->util) {3397/* An entry already existed */3398strbuf_addf(err,3399"multiple updates for 'HEAD' (including one "3400"via its referent '%s') are not allowed",3401 update->refname);3402return TRANSACTION_NAME_CONFLICT;3403}34043405 new_update =ref_transaction_add_update(3406 transaction,"HEAD",3407 update->flags | REF_LOG_ONLY | REF_NODEREF,3408 update->new_sha1, update->old_sha1,3409 update->msg);34103411 item->util = new_update;34123413return0;3414}34153416/*3417 * update is for a symref that points at referent and doesn't have3418 * REF_NODEREF set. Split it into two updates:3419 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3420 * - A new, separate update for the referent reference3421 * Note that the new update will itself be subject to splitting when3422 * the iteration gets to it.3423 */3424static intsplit_symref_update(struct files_ref_store *refs,3425struct ref_update *update,3426const char*referent,3427struct ref_transaction *transaction,3428struct string_list *affected_refnames,3429struct strbuf *err)3430{3431struct string_list_item *item;3432struct ref_update *new_update;3433unsigned int new_flags;34343435/*3436 * First make sure that referent is not already in the3437 * transaction. This insertion is O(N) in the transaction3438 * size, but it happens at most once per symref in a3439 * transaction.3440 */3441 item =string_list_insert(affected_refnames, referent);3442if(item->util) {3443/* An entry already existed */3444strbuf_addf(err,3445"multiple updates for '%s' (including one "3446"via symref '%s') are not allowed",3447 referent, update->refname);3448return TRANSACTION_NAME_CONFLICT;3449}34503451 new_flags = update->flags;3452if(!strcmp(update->refname,"HEAD")) {3453/*3454 * Record that the new update came via HEAD, so that3455 * when we process it, split_head_update() doesn't try3456 * to add another reflog update for HEAD. Note that3457 * this bit will be propagated if the new_update3458 * itself needs to be split.3459 */3460 new_flags |= REF_UPDATE_VIA_HEAD;3461}34623463 new_update =ref_transaction_add_update(3464 transaction, referent, new_flags,3465 update->new_sha1, update->old_sha1,3466 update->msg);34673468 new_update->parent_update = update;34693470/*3471 * Change the symbolic ref update to log only. Also, it3472 * doesn't need to check its old SHA-1 value, as that will be3473 * done when new_update is processed.3474 */3475 update->flags |= REF_LOG_ONLY | REF_NODEREF;3476 update->flags &= ~REF_HAVE_OLD;34773478 item->util = new_update;34793480return0;3481}34823483/*3484 * Return the refname under which update was originally requested.3485 */3486static const char*original_update_refname(struct ref_update *update)3487{3488while(update->parent_update)3489 update = update->parent_update;34903491return update->refname;3492}34933494/*3495 * Check whether the REF_HAVE_OLD and old_oid values stored in update3496 * are consistent with oid, which is the reference's current value. If3497 * everything is OK, return 0; otherwise, write an error message to3498 * err and return -1.3499 */3500static intcheck_old_oid(struct ref_update *update,struct object_id *oid,3501struct strbuf *err)3502{3503if(!(update->flags & REF_HAVE_OLD) ||3504!hashcmp(oid->hash, update->old_sha1))3505return0;35063507if(is_null_sha1(update->old_sha1))3508strbuf_addf(err,"cannot lock ref '%s': "3509"reference already exists",3510original_update_refname(update));3511else if(is_null_oid(oid))3512strbuf_addf(err,"cannot lock ref '%s': "3513"reference is missing but expected%s",3514original_update_refname(update),3515sha1_to_hex(update->old_sha1));3516else3517strbuf_addf(err,"cannot lock ref '%s': "3518"is at%sbut expected%s",3519original_update_refname(update),3520oid_to_hex(oid),3521sha1_to_hex(update->old_sha1));35223523return-1;3524}35253526/*3527 * Prepare for carrying out update:3528 * - Lock the reference referred to by update.3529 * - Read the reference under lock.3530 * - Check that its old SHA-1 value (if specified) is correct, and in3531 * any case record it in update->lock->old_oid for later use when3532 * writing the reflog.3533 * - If it is a symref update without REF_NODEREF, split it up into a3534 * REF_LOG_ONLY update of the symref and add a separate update for3535 * the referent to transaction.3536 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3537 * update of HEAD.3538 */3539static intlock_ref_for_update(struct files_ref_store *refs,3540struct ref_update *update,3541struct ref_transaction *transaction,3542const char*head_ref,3543struct string_list *affected_refnames,3544struct strbuf *err)3545{3546struct strbuf referent = STRBUF_INIT;3547int mustexist = (update->flags & REF_HAVE_OLD) &&3548!is_null_sha1(update->old_sha1);3549int ret;3550struct ref_lock *lock;35513552files_assert_main_repository(refs,"lock_ref_for_update");35533554if((update->flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1))3555 update->flags |= REF_DELETING;35563557if(head_ref) {3558 ret =split_head_update(update, transaction, head_ref,3559 affected_refnames, err);3560if(ret)3561return ret;3562}35633564 ret =lock_raw_ref(refs, update->refname, mustexist,3565 affected_refnames, NULL,3566&lock, &referent,3567&update->type, err);3568if(ret) {3569char*reason;35703571 reason =strbuf_detach(err, NULL);3572strbuf_addf(err,"cannot lock ref '%s':%s",3573original_update_refname(update), reason);3574free(reason);3575return ret;3576}35773578 update->backend_data = lock;35793580if(update->type & REF_ISSYMREF) {3581if(update->flags & REF_NODEREF) {3582/*3583 * We won't be reading the referent as part of3584 * the transaction, so we have to read it here3585 * to record and possibly check old_sha1:3586 */3587if(read_ref_full(referent.buf,0,3588 lock->old_oid.hash, NULL)) {3589if(update->flags & REF_HAVE_OLD) {3590strbuf_addf(err,"cannot lock ref '%s': "3591"error reading reference",3592original_update_refname(update));3593return-1;3594}3595}else if(check_old_oid(update, &lock->old_oid, err)) {3596return TRANSACTION_GENERIC_ERROR;3597}3598}else{3599/*3600 * Create a new update for the reference this3601 * symref is pointing at. Also, we will record3602 * and verify old_sha1 for this update as part3603 * of processing the split-off update, so we3604 * don't have to do it here.3605 */3606 ret =split_symref_update(refs, update,3607 referent.buf, transaction,3608 affected_refnames, err);3609if(ret)3610return ret;3611}3612}else{3613struct ref_update *parent_update;36143615if(check_old_oid(update, &lock->old_oid, err))3616return TRANSACTION_GENERIC_ERROR;36173618/*3619 * If this update is happening indirectly because of a3620 * symref update, record the old SHA-1 in the parent3621 * update:3622 */3623for(parent_update = update->parent_update;3624 parent_update;3625 parent_update = parent_update->parent_update) {3626struct ref_lock *parent_lock = parent_update->backend_data;3627oidcpy(&parent_lock->old_oid, &lock->old_oid);3628}3629}36303631if((update->flags & REF_HAVE_NEW) &&3632!(update->flags & REF_DELETING) &&3633!(update->flags & REF_LOG_ONLY)) {3634if(!(update->type & REF_ISSYMREF) &&3635!hashcmp(lock->old_oid.hash, update->new_sha1)) {3636/*3637 * The reference already has the desired3638 * value, so we don't need to write it.3639 */3640}else if(write_ref_to_lockfile(lock, update->new_sha1,3641 err)) {3642char*write_err =strbuf_detach(err, NULL);36433644/*3645 * The lock was freed upon failure of3646 * write_ref_to_lockfile():3647 */3648 update->backend_data = NULL;3649strbuf_addf(err,3650"cannot update ref '%s':%s",3651 update->refname, write_err);3652free(write_err);3653return TRANSACTION_GENERIC_ERROR;3654}else{3655 update->flags |= REF_NEEDS_COMMIT;3656}3657}3658if(!(update->flags & REF_NEEDS_COMMIT)) {3659/*3660 * We didn't call write_ref_to_lockfile(), so3661 * the lockfile is still open. Close it to3662 * free up the file descriptor:3663 */3664if(close_ref(lock)) {3665strbuf_addf(err,"couldn't close '%s.lock'",3666 update->refname);3667return TRANSACTION_GENERIC_ERROR;3668}3669}3670return0;3671}36723673static intfiles_transaction_commit(struct ref_store *ref_store,3674struct ref_transaction *transaction,3675struct strbuf *err)3676{3677struct files_ref_store *refs =3678files_downcast(ref_store,0,"ref_transaction_commit");3679int ret =0, i;3680struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3681struct string_list_item *ref_to_delete;3682struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3683char*head_ref = NULL;3684int head_type;3685struct object_id head_oid;36863687assert(err);36883689if(transaction->state != REF_TRANSACTION_OPEN)3690die("BUG: commit called for transaction that is not open");36913692if(!transaction->nr) {3693 transaction->state = REF_TRANSACTION_CLOSED;3694return0;3695}36963697/*3698 * Fail if a refname appears more than once in the3699 * transaction. (If we end up splitting up any updates using3700 * split_symref_update() or split_head_update(), those3701 * functions will check that the new updates don't have the3702 * same refname as any existing ones.)3703 */3704for(i =0; i < transaction->nr; i++) {3705struct ref_update *update = transaction->updates[i];3706struct string_list_item *item =3707string_list_append(&affected_refnames, update->refname);37083709/*3710 * We store a pointer to update in item->util, but at3711 * the moment we never use the value of this field3712 * except to check whether it is non-NULL.3713 */3714 item->util = update;3715}3716string_list_sort(&affected_refnames);3717if(ref_update_reject_duplicates(&affected_refnames, err)) {3718 ret = TRANSACTION_GENERIC_ERROR;3719goto cleanup;3720}37213722/*3723 * Special hack: If a branch is updated directly and HEAD3724 * points to it (may happen on the remote side of a push3725 * for example) then logically the HEAD reflog should be3726 * updated too.3727 *3728 * A generic solution would require reverse symref lookups,3729 * but finding all symrefs pointing to a given branch would be3730 * rather costly for this rare event (the direct update of a3731 * branch) to be worth it. So let's cheat and check with HEAD3732 * only, which should cover 99% of all usage scenarios (even3733 * 100% of the default ones).3734 *3735 * So if HEAD is a symbolic reference, then record the name of3736 * the reference that it points to. If we see an update of3737 * head_ref within the transaction, then split_head_update()3738 * arranges for the reflog of HEAD to be updated, too.3739 */3740 head_ref =resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3741 head_oid.hash, &head_type);37423743if(head_ref && !(head_type & REF_ISSYMREF)) {3744free(head_ref);3745 head_ref = NULL;3746}37473748/*3749 * Acquire all locks, verify old values if provided, check3750 * that new values are valid, and write new values to the3751 * lockfiles, ready to be activated. Only keep one lockfile3752 * open at a time to avoid running out of file descriptors.3753 */3754for(i =0; i < transaction->nr; i++) {3755struct ref_update *update = transaction->updates[i];37563757 ret =lock_ref_for_update(refs, update, transaction,3758 head_ref, &affected_refnames, err);3759if(ret)3760goto cleanup;3761}37623763/* Perform updates first so live commits remain referenced */3764for(i =0; i < transaction->nr; i++) {3765struct ref_update *update = transaction->updates[i];3766struct ref_lock *lock = update->backend_data;37673768if(update->flags & REF_NEEDS_COMMIT ||3769 update->flags & REF_LOG_ONLY) {3770if(files_log_ref_write(lock->ref_name,3771 lock->old_oid.hash,3772 update->new_sha1,3773 update->msg, update->flags,3774 err)) {3775char*old_msg =strbuf_detach(err, NULL);37763777strbuf_addf(err,"cannot update the ref '%s':%s",3778 lock->ref_name, old_msg);3779free(old_msg);3780unlock_ref(lock);3781 update->backend_data = NULL;3782 ret = TRANSACTION_GENERIC_ERROR;3783goto cleanup;3784}3785}3786if(update->flags & REF_NEEDS_COMMIT) {3787clear_loose_ref_cache(refs);3788if(commit_ref(lock)) {3789strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3790unlock_ref(lock);3791 update->backend_data = NULL;3792 ret = TRANSACTION_GENERIC_ERROR;3793goto cleanup;3794}3795}3796}3797/* Perform deletes now that updates are safely completed */3798for(i =0; i < transaction->nr; i++) {3799struct ref_update *update = transaction->updates[i];3800struct ref_lock *lock = update->backend_data;38013802if(update->flags & REF_DELETING &&3803!(update->flags & REF_LOG_ONLY)) {3804if(!(update->type & REF_ISPACKED) ||3805 update->type & REF_ISSYMREF) {3806/* It is a loose reference. */3807if(unlink_or_msg(git_path("%s", lock->ref_name), err)) {3808 ret = TRANSACTION_GENERIC_ERROR;3809goto cleanup;3810}3811 update->flags |= REF_DELETED_LOOSE;3812}38133814if(!(update->flags & REF_ISPRUNING))3815string_list_append(&refs_to_delete,3816 lock->ref_name);3817}3818}38193820if(repack_without_refs(refs, &refs_to_delete, err)) {3821 ret = TRANSACTION_GENERIC_ERROR;3822goto cleanup;3823}38243825/* Delete the reflogs of any references that were deleted: */3826for_each_string_list_item(ref_to_delete, &refs_to_delete) {3827if(!unlink_or_warn(git_path("logs/%s", ref_to_delete->string)))3828try_remove_empty_parents(ref_to_delete->string,3829 REMOVE_EMPTY_PARENTS_REFLOG);3830}38313832clear_loose_ref_cache(refs);38333834cleanup:3835 transaction->state = REF_TRANSACTION_CLOSED;38363837for(i =0; i < transaction->nr; i++) {3838struct ref_update *update = transaction->updates[i];3839struct ref_lock *lock = update->backend_data;38403841if(lock)3842unlock_ref(lock);38433844if(update->flags & REF_DELETED_LOOSE) {3845/*3846 * The loose reference was deleted. Delete any3847 * empty parent directories. (Note that this3848 * can only work because we have already3849 * removed the lockfile.)3850 */3851try_remove_empty_parents(update->refname,3852 REMOVE_EMPTY_PARENTS_REF);3853}3854}38553856string_list_clear(&refs_to_delete,0);3857free(head_ref);3858string_list_clear(&affected_refnames,0);38593860return ret;3861}38623863static intref_present(const char*refname,3864const struct object_id *oid,int flags,void*cb_data)3865{3866struct string_list *affected_refnames = cb_data;38673868returnstring_list_has_string(affected_refnames, refname);3869}38703871static intfiles_initial_transaction_commit(struct ref_store *ref_store,3872struct ref_transaction *transaction,3873struct strbuf *err)3874{3875struct files_ref_store *refs =3876files_downcast(ref_store,0,"initial_ref_transaction_commit");3877int ret =0, i;3878struct string_list affected_refnames = STRING_LIST_INIT_NODUP;38793880assert(err);38813882if(transaction->state != REF_TRANSACTION_OPEN)3883die("BUG: commit called for transaction that is not open");38843885/* Fail if a refname appears more than once in the transaction: */3886for(i =0; i < transaction->nr; i++)3887string_list_append(&affected_refnames,3888 transaction->updates[i]->refname);3889string_list_sort(&affected_refnames);3890if(ref_update_reject_duplicates(&affected_refnames, err)) {3891 ret = TRANSACTION_GENERIC_ERROR;3892goto cleanup;3893}38943895/*3896 * It's really undefined to call this function in an active3897 * repository or when there are existing references: we are3898 * only locking and changing packed-refs, so (1) any3899 * simultaneous processes might try to change a reference at3900 * the same time we do, and (2) any existing loose versions of3901 * the references that we are setting would have precedence3902 * over our values. But some remote helpers create the remote3903 * "HEAD" and "master" branches before calling this function,3904 * so here we really only check that none of the references3905 * that we are creating already exists.3906 */3907if(for_each_rawref(ref_present, &affected_refnames))3908die("BUG: initial ref transaction called with existing refs");39093910for(i =0; i < transaction->nr; i++) {3911struct ref_update *update = transaction->updates[i];39123913if((update->flags & REF_HAVE_OLD) &&3914!is_null_sha1(update->old_sha1))3915die("BUG: initial ref transaction with old_sha1 set");3916if(verify_refname_available(update->refname,3917&affected_refnames, NULL,3918 err)) {3919 ret = TRANSACTION_NAME_CONFLICT;3920goto cleanup;3921}3922}39233924if(lock_packed_refs(refs,0)) {3925strbuf_addf(err,"unable to lock packed-refs file:%s",3926strerror(errno));3927 ret = TRANSACTION_GENERIC_ERROR;3928goto cleanup;3929}39303931for(i =0; i < transaction->nr; i++) {3932struct ref_update *update = transaction->updates[i];39333934if((update->flags & REF_HAVE_NEW) &&3935!is_null_sha1(update->new_sha1))3936add_packed_ref(refs, update->refname, update->new_sha1);3937}39383939if(commit_packed_refs(refs)) {3940strbuf_addf(err,"unable to commit packed-refs file:%s",3941strerror(errno));3942 ret = TRANSACTION_GENERIC_ERROR;3943goto cleanup;3944}39453946cleanup:3947 transaction->state = REF_TRANSACTION_CLOSED;3948string_list_clear(&affected_refnames,0);3949return ret;3950}39513952struct expire_reflog_cb {3953unsigned int flags;3954 reflog_expiry_should_prune_fn *should_prune_fn;3955void*policy_cb;3956FILE*newlog;3957unsigned char last_kept_sha1[20];3958};39593960static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3961const char*email,unsigned long timestamp,int tz,3962const char*message,void*cb_data)3963{3964struct expire_reflog_cb *cb = cb_data;3965struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;39663967if(cb->flags & EXPIRE_REFLOGS_REWRITE)3968 osha1 = cb->last_kept_sha1;39693970if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3971 message, policy_cb)) {3972if(!cb->newlog)3973printf("would prune%s", message);3974else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3975printf("prune%s", message);3976}else{3977if(cb->newlog) {3978fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3979sha1_to_hex(osha1),sha1_to_hex(nsha1),3980 email, timestamp, tz, message);3981hashcpy(cb->last_kept_sha1, nsha1);3982}3983if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3984printf("keep%s", message);3985}3986return0;3987}39883989static intfiles_reflog_expire(struct ref_store *ref_store,3990const char*refname,const unsigned char*sha1,3991unsigned int flags,3992 reflog_expiry_prepare_fn prepare_fn,3993 reflog_expiry_should_prune_fn should_prune_fn,3994 reflog_expiry_cleanup_fn cleanup_fn,3995void*policy_cb_data)3996{3997struct files_ref_store *refs =3998files_downcast(ref_store,0,"reflog_expire");3999static struct lock_file reflog_lock;4000struct expire_reflog_cb cb;4001struct ref_lock *lock;4002char*log_file;4003int status =0;4004int type;4005struct strbuf err = STRBUF_INIT;40064007memset(&cb,0,sizeof(cb));4008 cb.flags = flags;4009 cb.policy_cb = policy_cb_data;4010 cb.should_prune_fn = should_prune_fn;40114012/*4013 * The reflog file is locked by holding the lock on the4014 * reference itself, plus we might need to update the4015 * reference if --updateref was specified:4016 */4017 lock =lock_ref_sha1_basic(refs, refname, sha1,4018 NULL, NULL, REF_NODEREF,4019&type, &err);4020if(!lock) {4021error("cannot lock ref '%s':%s", refname, err.buf);4022strbuf_release(&err);4023return-1;4024}4025if(!reflog_exists(refname)) {4026unlock_ref(lock);4027return0;4028}40294030 log_file =git_pathdup("logs/%s", refname);4031if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4032/*4033 * Even though holding $GIT_DIR/logs/$reflog.lock has4034 * no locking implications, we use the lock_file4035 * machinery here anyway because it does a lot of the4036 * work we need, including cleaning up if the program4037 * exits unexpectedly.4038 */4039if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4040struct strbuf err = STRBUF_INIT;4041unable_to_lock_message(log_file, errno, &err);4042error("%s", err.buf);4043strbuf_release(&err);4044goto failure;4045}4046 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4047if(!cb.newlog) {4048error("cannot fdopen%s(%s)",4049get_lock_file_path(&reflog_lock),strerror(errno));4050goto failure;4051}4052}40534054(*prepare_fn)(refname, sha1, cb.policy_cb);4055for_each_reflog_ent(refname, expire_reflog_ent, &cb);4056(*cleanup_fn)(cb.policy_cb);40574058if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4059/*4060 * It doesn't make sense to adjust a reference pointed4061 * to by a symbolic ref based on expiring entries in4062 * the symbolic reference's reflog. Nor can we update4063 * a reference if there are no remaining reflog4064 * entries.4065 */4066int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4067!(type & REF_ISSYMREF) &&4068!is_null_sha1(cb.last_kept_sha1);40694070if(close_lock_file(&reflog_lock)) {4071 status |=error("couldn't write%s:%s", log_file,4072strerror(errno));4073}else if(update &&4074(write_in_full(get_lock_file_fd(lock->lk),4075sha1_to_hex(cb.last_kept_sha1),40) !=40||4076write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||4077close_ref(lock) <0)) {4078 status |=error("couldn't write%s",4079get_lock_file_path(lock->lk));4080rollback_lock_file(&reflog_lock);4081}else if(commit_lock_file(&reflog_lock)) {4082 status |=error("unable to write reflog '%s' (%s)",4083 log_file,strerror(errno));4084}else if(update &&commit_ref(lock)) {4085 status |=error("couldn't set%s", lock->ref_name);4086}4087}4088free(log_file);4089unlock_ref(lock);4090return status;40914092 failure:4093rollback_lock_file(&reflog_lock);4094free(log_file);4095unlock_ref(lock);4096return-1;4097}40984099static intfiles_init_db(struct ref_store *ref_store,struct strbuf *err)4100{4101/* Check validity (but we don't need the result): */4102files_downcast(ref_store,0,"init_db");41034104/*4105 * Create .git/refs/{heads,tags}4106 */4107safe_create_dir(git_path("refs/heads"),1);4108safe_create_dir(git_path("refs/tags"),1);4109if(get_shared_repository()) {4110adjust_shared_perm(git_path("refs/heads"));4111adjust_shared_perm(git_path("refs/tags"));4112}4113return0;4114}41154116struct ref_storage_be refs_be_files = {4117 NULL,4118"files",4119 files_ref_store_create,4120 files_init_db,4121 files_transaction_commit,4122 files_initial_transaction_commit,41234124 files_pack_refs,4125 files_peel_ref,4126 files_create_symref,4127 files_delete_refs,4128 files_rename_ref,41294130 files_ref_iterator_begin,4131 files_read_raw_ref,4132 files_verify_refname_available,41334134 files_reflog_iterator_begin,4135 files_for_each_reflog_ent,4136 files_for_each_reflog_ent_reverse,4137 files_reflog_exists,4138 files_create_reflog,4139 files_delete_reflog,4140 files_reflog_expire4141};