1#include"../cache.h" 2#include"../refs.h" 3#include"refs-internal.h" 4#include"../iterator.h" 5#include"../dir-iterator.h" 6#include"../lockfile.h" 7#include"../object.h" 8#include"../dir.h" 9 10struct ref_lock { 11char*ref_name; 12struct lock_file *lk; 13struct object_id old_oid; 14}; 15 16struct ref_entry; 17 18/* 19 * Information used (along with the information in ref_entry) to 20 * describe a single cached reference. This data structure only 21 * occurs embedded in a union in struct ref_entry, and only when 22 * (ref_entry->flag & REF_DIR) is zero. 23 */ 24struct ref_value { 25/* 26 * The name of the object to which this reference resolves 27 * (which may be a tag object). If REF_ISBROKEN, this is 28 * null. If REF_ISSYMREF, then this is the name of the object 29 * referred to by the last reference in the symlink chain. 30 */ 31struct object_id oid; 32 33/* 34 * If REF_KNOWS_PEELED, then this field holds the peeled value 35 * of this reference, or null if the reference is known not to 36 * be peelable. See the documentation for peel_ref() for an 37 * exact definition of "peelable". 38 */ 39struct object_id peeled; 40}; 41 42struct files_ref_store; 43 44/* 45 * Information used (along with the information in ref_entry) to 46 * describe a level in the hierarchy of references. This data 47 * structure only occurs embedded in a union in struct ref_entry, and 48 * only when (ref_entry.flag & REF_DIR) is set. In that case, 49 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 50 * in the directory have already been read: 51 * 52 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 53 * or packed references, already read. 54 * 55 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 56 * references that hasn't been read yet (nor has any of its 57 * subdirectories). 58 * 59 * Entries within a directory are stored within a growable array of 60 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 61 * sorted are sorted by their component name in strcmp() order and the 62 * remaining entries are unsorted. 63 * 64 * Loose references are read lazily, one directory at a time. When a 65 * directory of loose references is read, then all of the references 66 * in that directory are stored, and REF_INCOMPLETE stubs are created 67 * for any subdirectories, but the subdirectories themselves are not 68 * read. The reading is triggered by get_ref_dir(). 69 */ 70struct ref_dir { 71int nr, alloc; 72 73/* 74 * Entries with index 0 <= i < sorted are sorted by name. New 75 * entries are appended to the list unsorted, and are sorted 76 * only when required; thus we avoid the need to sort the list 77 * after the addition of every reference. 78 */ 79int sorted; 80 81/* A pointer to the files_ref_store that contains this ref_dir. */ 82struct files_ref_store *ref_store; 83 84struct ref_entry **entries; 85}; 86 87/* 88 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 89 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 90 * public values; see refs.h. 91 */ 92 93/* 94 * The field ref_entry->u.value.peeled of this value entry contains 95 * the correct peeled value for the reference, which might be 96 * null_sha1 if the reference is not a tag or if it is broken. 97 */ 98#define REF_KNOWS_PEELED 0x10 99 100/* ref_entry represents a directory of references */ 101#define REF_DIR 0x20 102 103/* 104 * Entry has not yet been read from disk (used only for REF_DIR 105 * entries representing loose references) 106 */ 107#define REF_INCOMPLETE 0x40 108 109/* 110 * A ref_entry represents either a reference or a "subdirectory" of 111 * references. 112 * 113 * Each directory in the reference namespace is represented by a 114 * ref_entry with (flags & REF_DIR) set and containing a subdir member 115 * that holds the entries in that directory that have been read so 116 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 117 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 118 * used for loose reference directories. 119 * 120 * References are represented by a ref_entry with (flags & REF_DIR) 121 * unset and a value member that describes the reference's value. The 122 * flag member is at the ref_entry level, but it is also needed to 123 * interpret the contents of the value field (in other words, a 124 * ref_value object is not very much use without the enclosing 125 * ref_entry). 126 * 127 * Reference names cannot end with slash and directories' names are 128 * always stored with a trailing slash (except for the top-level 129 * directory, which is always denoted by ""). This has two nice 130 * consequences: (1) when the entries in each subdir are sorted 131 * lexicographically by name (as they usually are), the references in 132 * a whole tree can be generated in lexicographic order by traversing 133 * the tree in left-to-right, depth-first order; (2) the names of 134 * references and subdirectories cannot conflict, and therefore the 135 * presence of an empty subdirectory does not block the creation of a 136 * similarly-named reference. (The fact that reference names with the 137 * same leading components can conflict *with each other* is a 138 * separate issue that is regulated by verify_refname_available().) 139 * 140 * Please note that the name field contains the fully-qualified 141 * reference (or subdirectory) name. Space could be saved by only 142 * storing the relative names. But that would require the full names 143 * to be generated on the fly when iterating in do_for_each_ref(), and 144 * would break callback functions, who have always been able to assume 145 * that the name strings that they are passed will not be freed during 146 * the iteration. 147 */ 148struct ref_entry { 149unsigned char flag;/* ISSYMREF? ISPACKED? */ 150union{ 151struct ref_value value;/* if not (flags&REF_DIR) */ 152struct ref_dir subdir;/* if (flags&REF_DIR) */ 153} u; 154/* 155 * The full name of the reference (e.g., "refs/heads/master") 156 * or the full name of the directory with a trailing slash 157 * (e.g., "refs/heads/"): 158 */ 159char name[FLEX_ARRAY]; 160}; 161 162static voidread_loose_refs(const char*dirname,struct ref_dir *dir); 163static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len); 164static struct ref_entry *create_dir_entry(struct files_ref_store *ref_store, 165const char*dirname,size_t len, 166int incomplete); 167static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry); 168 169static struct ref_dir *get_ref_dir(struct ref_entry *entry) 170{ 171struct ref_dir *dir; 172assert(entry->flag & REF_DIR); 173 dir = &entry->u.subdir; 174if(entry->flag & REF_INCOMPLETE) { 175read_loose_refs(entry->name, dir); 176 177/* 178 * Manually add refs/bisect, which, being 179 * per-worktree, might not appear in the directory 180 * listing for refs/ in the main repo. 181 */ 182if(!strcmp(entry->name,"refs/")) { 183int pos =search_ref_dir(dir,"refs/bisect/",12); 184if(pos <0) { 185struct ref_entry *child_entry; 186 child_entry =create_dir_entry(dir->ref_store, 187"refs/bisect/", 18812,1); 189add_entry_to_dir(dir, child_entry); 190read_loose_refs("refs/bisect", 191&child_entry->u.subdir); 192} 193} 194 entry->flag &= ~REF_INCOMPLETE; 195} 196return dir; 197} 198 199static struct ref_entry *create_ref_entry(const char*refname, 200const unsigned char*sha1,int flag, 201int check_name) 202{ 203struct ref_entry *ref; 204 205if(check_name && 206check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 207die("Reference has invalid format: '%s'", refname); 208FLEX_ALLOC_STR(ref, name, refname); 209hashcpy(ref->u.value.oid.hash, sha1); 210oidclr(&ref->u.value.peeled); 211 ref->flag = flag; 212return ref; 213} 214 215static voidclear_ref_dir(struct ref_dir *dir); 216 217static voidfree_ref_entry(struct ref_entry *entry) 218{ 219if(entry->flag & REF_DIR) { 220/* 221 * Do not use get_ref_dir() here, as that might 222 * trigger the reading of loose refs. 223 */ 224clear_ref_dir(&entry->u.subdir); 225} 226free(entry); 227} 228 229/* 230 * Add a ref_entry to the end of dir (unsorted). Entry is always 231 * stored directly in dir; no recursion into subdirectories is 232 * done. 233 */ 234static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry) 235{ 236ALLOC_GROW(dir->entries, dir->nr +1, dir->alloc); 237 dir->entries[dir->nr++] = entry; 238/* optimize for the case that entries are added in order */ 239if(dir->nr ==1|| 240(dir->nr == dir->sorted +1&& 241strcmp(dir->entries[dir->nr -2]->name, 242 dir->entries[dir->nr -1]->name) <0)) 243 dir->sorted = dir->nr; 244} 245 246/* 247 * Clear and free all entries in dir, recursively. 248 */ 249static voidclear_ref_dir(struct ref_dir *dir) 250{ 251int i; 252for(i =0; i < dir->nr; i++) 253free_ref_entry(dir->entries[i]); 254free(dir->entries); 255 dir->sorted = dir->nr = dir->alloc =0; 256 dir->entries = NULL; 257} 258 259/* 260 * Create a struct ref_entry object for the specified dirname. 261 * dirname is the name of the directory with a trailing slash (e.g., 262 * "refs/heads/") or "" for the top-level directory. 263 */ 264static struct ref_entry *create_dir_entry(struct files_ref_store *ref_store, 265const char*dirname,size_t len, 266int incomplete) 267{ 268struct ref_entry *direntry; 269FLEX_ALLOC_MEM(direntry, name, dirname, len); 270 direntry->u.subdir.ref_store = ref_store; 271 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE :0); 272return direntry; 273} 274 275static intref_entry_cmp(const void*a,const void*b) 276{ 277struct ref_entry *one = *(struct ref_entry **)a; 278struct ref_entry *two = *(struct ref_entry **)b; 279returnstrcmp(one->name, two->name); 280} 281 282static voidsort_ref_dir(struct ref_dir *dir); 283 284struct string_slice { 285size_t len; 286const char*str; 287}; 288 289static intref_entry_cmp_sslice(const void*key_,const void*ent_) 290{ 291const struct string_slice *key = key_; 292const struct ref_entry *ent = *(const struct ref_entry *const*)ent_; 293int cmp =strncmp(key->str, ent->name, key->len); 294if(cmp) 295return cmp; 296return'\0'- (unsigned char)ent->name[key->len]; 297} 298 299/* 300 * Return the index of the entry with the given refname from the 301 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 302 * no such entry is found. dir must already be complete. 303 */ 304static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len) 305{ 306struct ref_entry **r; 307struct string_slice key; 308 309if(refname == NULL || !dir->nr) 310return-1; 311 312sort_ref_dir(dir); 313 key.len = len; 314 key.str = refname; 315 r =bsearch(&key, dir->entries, dir->nr,sizeof(*dir->entries), 316 ref_entry_cmp_sslice); 317 318if(r == NULL) 319return-1; 320 321return r - dir->entries; 322} 323 324/* 325 * Search for a directory entry directly within dir (without 326 * recursing). Sort dir if necessary. subdirname must be a directory 327 * name (i.e., end in '/'). If mkdir is set, then create the 328 * directory if it is missing; otherwise, return NULL if the desired 329 * directory cannot be found. dir must already be complete. 330 */ 331static struct ref_dir *search_for_subdir(struct ref_dir *dir, 332const char*subdirname,size_t len, 333int mkdir) 334{ 335int entry_index =search_ref_dir(dir, subdirname, len); 336struct ref_entry *entry; 337if(entry_index == -1) { 338if(!mkdir) 339return NULL; 340/* 341 * Since dir is complete, the absence of a subdir 342 * means that the subdir really doesn't exist; 343 * therefore, create an empty record for it but mark 344 * the record complete. 345 */ 346 entry =create_dir_entry(dir->ref_store, subdirname, len,0); 347add_entry_to_dir(dir, entry); 348}else{ 349 entry = dir->entries[entry_index]; 350} 351returnget_ref_dir(entry); 352} 353 354/* 355 * If refname is a reference name, find the ref_dir within the dir 356 * tree that should hold refname. If refname is a directory name 357 * (i.e., ends in '/'), then return that ref_dir itself. dir must 358 * represent the top-level directory and must already be complete. 359 * Sort ref_dirs and recurse into subdirectories as necessary. If 360 * mkdir is set, then create any missing directories; otherwise, 361 * return NULL if the desired directory cannot be found. 362 */ 363static struct ref_dir *find_containing_dir(struct ref_dir *dir, 364const char*refname,int mkdir) 365{ 366const char*slash; 367for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 368size_t dirnamelen = slash - refname +1; 369struct ref_dir *subdir; 370 subdir =search_for_subdir(dir, refname, dirnamelen, mkdir); 371if(!subdir) { 372 dir = NULL; 373break; 374} 375 dir = subdir; 376} 377 378return dir; 379} 380 381/* 382 * Find the value entry with the given name in dir, sorting ref_dirs 383 * and recursing into subdirectories as necessary. If the name is not 384 * found or it corresponds to a directory entry, return NULL. 385 */ 386static struct ref_entry *find_ref(struct ref_dir *dir,const char*refname) 387{ 388int entry_index; 389struct ref_entry *entry; 390 dir =find_containing_dir(dir, refname,0); 391if(!dir) 392return NULL; 393 entry_index =search_ref_dir(dir, refname,strlen(refname)); 394if(entry_index == -1) 395return NULL; 396 entry = dir->entries[entry_index]; 397return(entry->flag & REF_DIR) ? NULL : entry; 398} 399 400/* 401 * Remove the entry with the given name from dir, recursing into 402 * subdirectories as necessary. If refname is the name of a directory 403 * (i.e., ends with '/'), then remove the directory and its contents. 404 * If the removal was successful, return the number of entries 405 * remaining in the directory entry that contained the deleted entry. 406 * If the name was not found, return -1. Please note that this 407 * function only deletes the entry from the cache; it does not delete 408 * it from the filesystem or ensure that other cache entries (which 409 * might be symbolic references to the removed entry) are updated. 410 * Nor does it remove any containing dir entries that might be made 411 * empty by the removal. dir must represent the top-level directory 412 * and must already be complete. 413 */ 414static intremove_entry(struct ref_dir *dir,const char*refname) 415{ 416int refname_len =strlen(refname); 417int entry_index; 418struct ref_entry *entry; 419int is_dir = refname[refname_len -1] =='/'; 420if(is_dir) { 421/* 422 * refname represents a reference directory. Remove 423 * the trailing slash; otherwise we will get the 424 * directory *representing* refname rather than the 425 * one *containing* it. 426 */ 427char*dirname =xmemdupz(refname, refname_len -1); 428 dir =find_containing_dir(dir, dirname,0); 429free(dirname); 430}else{ 431 dir =find_containing_dir(dir, refname,0); 432} 433if(!dir) 434return-1; 435 entry_index =search_ref_dir(dir, refname, refname_len); 436if(entry_index == -1) 437return-1; 438 entry = dir->entries[entry_index]; 439 440memmove(&dir->entries[entry_index], 441&dir->entries[entry_index +1], 442(dir->nr - entry_index -1) *sizeof(*dir->entries) 443); 444 dir->nr--; 445if(dir->sorted > entry_index) 446 dir->sorted--; 447free_ref_entry(entry); 448return dir->nr; 449} 450 451/* 452 * Add a ref_entry to the ref_dir (unsorted), recursing into 453 * subdirectories as necessary. dir must represent the top-level 454 * directory. Return 0 on success. 455 */ 456static intadd_ref(struct ref_dir *dir,struct ref_entry *ref) 457{ 458 dir =find_containing_dir(dir, ref->name,1); 459if(!dir) 460return-1; 461add_entry_to_dir(dir, ref); 462return0; 463} 464 465/* 466 * Emit a warning and return true iff ref1 and ref2 have the same name 467 * and the same sha1. Die if they have the same name but different 468 * sha1s. 469 */ 470static intis_dup_ref(const struct ref_entry *ref1,const struct ref_entry *ref2) 471{ 472if(strcmp(ref1->name, ref2->name)) 473return0; 474 475/* Duplicate name; make sure that they don't conflict: */ 476 477if((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 478/* This is impossible by construction */ 479die("Reference directory conflict:%s", ref1->name); 480 481if(oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 482die("Duplicated ref, and SHA1s don't match:%s", ref1->name); 483 484warning("Duplicated ref:%s", ref1->name); 485return1; 486} 487 488/* 489 * Sort the entries in dir non-recursively (if they are not already 490 * sorted) and remove any duplicate entries. 491 */ 492static voidsort_ref_dir(struct ref_dir *dir) 493{ 494int i, j; 495struct ref_entry *last = NULL; 496 497/* 498 * This check also prevents passing a zero-length array to qsort(), 499 * which is a problem on some platforms. 500 */ 501if(dir->sorted == dir->nr) 502return; 503 504qsort(dir->entries, dir->nr,sizeof(*dir->entries), ref_entry_cmp); 505 506/* Remove any duplicates: */ 507for(i =0, j =0; j < dir->nr; j++) { 508struct ref_entry *entry = dir->entries[j]; 509if(last &&is_dup_ref(last, entry)) 510free_ref_entry(entry); 511else 512 last = dir->entries[i++] = entry; 513} 514 dir->sorted = dir->nr = i; 515} 516 517/* 518 * Return true if refname, which has the specified oid and flags, can 519 * be resolved to an object in the database. If the referred-to object 520 * does not exist, emit a warning and return false. 521 */ 522static intref_resolves_to_object(const char*refname, 523const struct object_id *oid, 524unsigned int flags) 525{ 526if(flags & REF_ISBROKEN) 527return0; 528if(!has_sha1_file(oid->hash)) { 529error("%sdoes not point to a valid object!", refname); 530return0; 531} 532return1; 533} 534 535/* 536 * Return true if the reference described by entry can be resolved to 537 * an object in the database; otherwise, emit a warning and return 538 * false. 539 */ 540static intentry_resolves_to_object(struct ref_entry *entry) 541{ 542returnref_resolves_to_object(entry->name, 543&entry->u.value.oid, entry->flag); 544} 545 546typedefinteach_ref_entry_fn(struct ref_entry *entry,void*cb_data); 547 548/* 549 * Call fn for each reference in dir that has index in the range 550 * offset <= index < dir->nr. Recurse into subdirectories that are in 551 * that index range, sorting them before iterating. This function 552 * does not sort dir itself; it should be sorted beforehand. fn is 553 * called for all references, including broken ones. 554 */ 555static intdo_for_each_entry_in_dir(struct ref_dir *dir,int offset, 556 each_ref_entry_fn fn,void*cb_data) 557{ 558int i; 559assert(dir->sorted == dir->nr); 560for(i = offset; i < dir->nr; i++) { 561struct ref_entry *entry = dir->entries[i]; 562int retval; 563if(entry->flag & REF_DIR) { 564struct ref_dir *subdir =get_ref_dir(entry); 565sort_ref_dir(subdir); 566 retval =do_for_each_entry_in_dir(subdir,0, fn, cb_data); 567}else{ 568 retval =fn(entry, cb_data); 569} 570if(retval) 571return retval; 572} 573return0; 574} 575 576/* 577 * Load all of the refs from the dir into our in-memory cache. The hard work 578 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 579 * through all of the sub-directories. We do not even need to care about 580 * sorting, as traversal order does not matter to us. 581 */ 582static voidprime_ref_dir(struct ref_dir *dir) 583{ 584int i; 585for(i =0; i < dir->nr; i++) { 586struct ref_entry *entry = dir->entries[i]; 587if(entry->flag & REF_DIR) 588prime_ref_dir(get_ref_dir(entry)); 589} 590} 591 592/* 593 * A level in the reference hierarchy that is currently being iterated 594 * through. 595 */ 596struct cache_ref_iterator_level { 597/* 598 * The ref_dir being iterated over at this level. The ref_dir 599 * is sorted before being stored here. 600 */ 601struct ref_dir *dir; 602 603/* 604 * The index of the current entry within dir (which might 605 * itself be a directory). If index == -1, then the iteration 606 * hasn't yet begun. If index == dir->nr, then the iteration 607 * through this level is over. 608 */ 609int index; 610}; 611 612/* 613 * Represent an iteration through a ref_dir in the memory cache. The 614 * iteration recurses through subdirectories. 615 */ 616struct cache_ref_iterator { 617struct ref_iterator base; 618 619/* 620 * The number of levels currently on the stack. This is always 621 * at least 1, because when it becomes zero the iteration is 622 * ended and this struct is freed. 623 */ 624size_t levels_nr; 625 626/* The number of levels that have been allocated on the stack */ 627size_t levels_alloc; 628 629/* 630 * A stack of levels. levels[0] is the uppermost level that is 631 * being iterated over in this iteration. (This is not 632 * necessary the top level in the references hierarchy. If we 633 * are iterating through a subtree, then levels[0] will hold 634 * the ref_dir for that subtree, and subsequent levels will go 635 * on from there.) 636 */ 637struct cache_ref_iterator_level *levels; 638}; 639 640static intcache_ref_iterator_advance(struct ref_iterator *ref_iterator) 641{ 642struct cache_ref_iterator *iter = 643(struct cache_ref_iterator *)ref_iterator; 644 645while(1) { 646struct cache_ref_iterator_level *level = 647&iter->levels[iter->levels_nr -1]; 648struct ref_dir *dir = level->dir; 649struct ref_entry *entry; 650 651if(level->index == -1) 652sort_ref_dir(dir); 653 654if(++level->index == level->dir->nr) { 655/* This level is exhausted; pop up a level */ 656if(--iter->levels_nr ==0) 657returnref_iterator_abort(ref_iterator); 658 659continue; 660} 661 662 entry = dir->entries[level->index]; 663 664if(entry->flag & REF_DIR) { 665/* push down a level */ 666ALLOC_GROW(iter->levels, iter->levels_nr +1, 667 iter->levels_alloc); 668 669 level = &iter->levels[iter->levels_nr++]; 670 level->dir =get_ref_dir(entry); 671 level->index = -1; 672}else{ 673 iter->base.refname = entry->name; 674 iter->base.oid = &entry->u.value.oid; 675 iter->base.flags = entry->flag; 676return ITER_OK; 677} 678} 679} 680 681static enum peel_status peel_entry(struct ref_entry *entry,int repeel); 682 683static intcache_ref_iterator_peel(struct ref_iterator *ref_iterator, 684struct object_id *peeled) 685{ 686struct cache_ref_iterator *iter = 687(struct cache_ref_iterator *)ref_iterator; 688struct cache_ref_iterator_level *level; 689struct ref_entry *entry; 690 691 level = &iter->levels[iter->levels_nr -1]; 692 693if(level->index == -1) 694die("BUG: peel called before advance for cache iterator"); 695 696 entry = level->dir->entries[level->index]; 697 698if(peel_entry(entry,0)) 699return-1; 700hashcpy(peeled->hash, entry->u.value.peeled.hash); 701return0; 702} 703 704static intcache_ref_iterator_abort(struct ref_iterator *ref_iterator) 705{ 706struct cache_ref_iterator *iter = 707(struct cache_ref_iterator *)ref_iterator; 708 709free(iter->levels); 710base_ref_iterator_free(ref_iterator); 711return ITER_DONE; 712} 713 714static struct ref_iterator_vtable cache_ref_iterator_vtable = { 715 cache_ref_iterator_advance, 716 cache_ref_iterator_peel, 717 cache_ref_iterator_abort 718}; 719 720static struct ref_iterator *cache_ref_iterator_begin(struct ref_dir *dir) 721{ 722struct cache_ref_iterator *iter; 723struct ref_iterator *ref_iterator; 724struct cache_ref_iterator_level *level; 725 726 iter =xcalloc(1,sizeof(*iter)); 727 ref_iterator = &iter->base; 728base_ref_iterator_init(ref_iterator, &cache_ref_iterator_vtable); 729ALLOC_GROW(iter->levels,10, iter->levels_alloc); 730 731 iter->levels_nr =1; 732 level = &iter->levels[0]; 733 level->index = -1; 734 level->dir = dir; 735 736return ref_iterator; 737} 738 739struct nonmatching_ref_data { 740const struct string_list *skip; 741const char*conflicting_refname; 742}; 743 744static intnonmatching_ref_fn(struct ref_entry *entry,void*vdata) 745{ 746struct nonmatching_ref_data *data = vdata; 747 748if(data->skip &&string_list_has_string(data->skip, entry->name)) 749return0; 750 751 data->conflicting_refname = entry->name; 752return1; 753} 754 755/* 756 * Return 0 if a reference named refname could be created without 757 * conflicting with the name of an existing reference in dir. 758 * See verify_refname_available for more information. 759 */ 760static intverify_refname_available_dir(const char*refname, 761const struct string_list *extras, 762const struct string_list *skip, 763struct ref_dir *dir, 764struct strbuf *err) 765{ 766const char*slash; 767const char*extra_refname; 768int pos; 769struct strbuf dirname = STRBUF_INIT; 770int ret = -1; 771 772/* 773 * For the sake of comments in this function, suppose that 774 * refname is "refs/foo/bar". 775 */ 776 777assert(err); 778 779strbuf_grow(&dirname,strlen(refname) +1); 780for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 781/* Expand dirname to the new prefix, not including the trailing slash: */ 782strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 783 784/* 785 * We are still at a leading dir of the refname (e.g., 786 * "refs/foo"; if there is a reference with that name, 787 * it is a conflict, *unless* it is in skip. 788 */ 789if(dir) { 790 pos =search_ref_dir(dir, dirname.buf, dirname.len); 791if(pos >=0&& 792(!skip || !string_list_has_string(skip, dirname.buf))) { 793/* 794 * We found a reference whose name is 795 * a proper prefix of refname; e.g., 796 * "refs/foo", and is not in skip. 797 */ 798strbuf_addf(err,"'%s' exists; cannot create '%s'", 799 dirname.buf, refname); 800goto cleanup; 801} 802} 803 804if(extras &&string_list_has_string(extras, dirname.buf) && 805(!skip || !string_list_has_string(skip, dirname.buf))) { 806strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 807 refname, dirname.buf); 808goto cleanup; 809} 810 811/* 812 * Otherwise, we can try to continue our search with 813 * the next component. So try to look up the 814 * directory, e.g., "refs/foo/". If we come up empty, 815 * we know there is nothing under this whole prefix, 816 * but even in that case we still have to continue the 817 * search for conflicts with extras. 818 */ 819strbuf_addch(&dirname,'/'); 820if(dir) { 821 pos =search_ref_dir(dir, dirname.buf, dirname.len); 822if(pos <0) { 823/* 824 * There was no directory "refs/foo/", 825 * so there is nothing under this 826 * whole prefix. So there is no need 827 * to continue looking for conflicting 828 * references. But we need to continue 829 * looking for conflicting extras. 830 */ 831 dir = NULL; 832}else{ 833 dir =get_ref_dir(dir->entries[pos]); 834} 835} 836} 837 838/* 839 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 840 * There is no point in searching for a reference with that 841 * name, because a refname isn't considered to conflict with 842 * itself. But we still need to check for references whose 843 * names are in the "refs/foo/bar/" namespace, because they 844 * *do* conflict. 845 */ 846strbuf_addstr(&dirname, refname + dirname.len); 847strbuf_addch(&dirname,'/'); 848 849if(dir) { 850 pos =search_ref_dir(dir, dirname.buf, dirname.len); 851 852if(pos >=0) { 853/* 854 * We found a directory named "$refname/" 855 * (e.g., "refs/foo/bar/"). It is a problem 856 * iff it contains any ref that is not in 857 * "skip". 858 */ 859struct nonmatching_ref_data data; 860 861 data.skip = skip; 862 data.conflicting_refname = NULL; 863 dir =get_ref_dir(dir->entries[pos]); 864sort_ref_dir(dir); 865if(do_for_each_entry_in_dir(dir,0, nonmatching_ref_fn, &data)) { 866strbuf_addf(err,"'%s' exists; cannot create '%s'", 867 data.conflicting_refname, refname); 868goto cleanup; 869} 870} 871} 872 873 extra_refname =find_descendant_ref(dirname.buf, extras, skip); 874if(extra_refname) 875strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 876 refname, extra_refname); 877else 878 ret =0; 879 880cleanup: 881strbuf_release(&dirname); 882return ret; 883} 884 885struct packed_ref_cache { 886struct ref_entry *root; 887 888/* 889 * Count of references to the data structure in this instance, 890 * including the pointer from files_ref_store::packed if any. 891 * The data will not be freed as long as the reference count 892 * is nonzero. 893 */ 894unsigned int referrers; 895 896/* 897 * Iff the packed-refs file associated with this instance is 898 * currently locked for writing, this points at the associated 899 * lock (which is owned by somebody else). The referrer count 900 * is also incremented when the file is locked and decremented 901 * when it is unlocked. 902 */ 903struct lock_file *lock; 904 905/* The metadata from when this packed-refs cache was read */ 906struct stat_validity validity; 907}; 908 909/* 910 * Future: need to be in "struct repository" 911 * when doing a full libification. 912 */ 913struct files_ref_store { 914struct ref_store base; 915struct ref_entry *loose; 916struct packed_ref_cache *packed; 917}; 918 919/* Lock used for the main packed-refs file: */ 920static struct lock_file packlock; 921 922/* 923 * Increment the reference count of *packed_refs. 924 */ 925static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 926{ 927 packed_refs->referrers++; 928} 929 930/* 931 * Decrease the reference count of *packed_refs. If it goes to zero, 932 * free *packed_refs and return true; otherwise return false. 933 */ 934static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs) 935{ 936if(!--packed_refs->referrers) { 937free_ref_entry(packed_refs->root); 938stat_validity_clear(&packed_refs->validity); 939free(packed_refs); 940return1; 941}else{ 942return0; 943} 944} 945 946static voidclear_packed_ref_cache(struct files_ref_store *refs) 947{ 948if(refs->packed) { 949struct packed_ref_cache *packed_refs = refs->packed; 950 951if(packed_refs->lock) 952die("internal error: packed-ref cache cleared while locked"); 953 refs->packed = NULL; 954release_packed_ref_cache(packed_refs); 955} 956} 957 958static voidclear_loose_ref_cache(struct files_ref_store *refs) 959{ 960if(refs->loose) { 961free_ref_entry(refs->loose); 962 refs->loose = NULL; 963} 964} 965 966/* 967 * Create a new submodule ref cache and add it to the internal 968 * set of caches. 969 */ 970static struct ref_store *files_ref_store_create(const char*submodule) 971{ 972struct files_ref_store *refs =xcalloc(1,sizeof(*refs)); 973struct ref_store *ref_store = (struct ref_store *)refs; 974 975base_ref_store_init(ref_store, &refs_be_files, submodule); 976 977return ref_store; 978} 979 980/* 981 * Downcast ref_store to files_ref_store. Die if ref_store is not a 982 * files_ref_store. If submodule_allowed is not true, then also die if 983 * files_ref_store is for a submodule (i.e., not for the main 984 * repository). caller is used in any necessary error messages. 985 */ 986static struct files_ref_store *files_downcast( 987struct ref_store *ref_store,int submodule_allowed, 988const char*caller) 989{ 990if(ref_store->be != &refs_be_files) 991die("BUG: ref_store is type\"%s\"not\"files\"in%s", 992 ref_store->be->name, caller); 993 994if(!submodule_allowed) 995assert_main_repository(ref_store, caller); 996 997return(struct files_ref_store *)ref_store; 998} 9991000/*1001 * Return a pointer to the reference store for the specified1002 * submodule. For the main repository, use submodule==NULL; such a1003 * call cannot fail. For a submodule, the submodule must exist and be1004 * a nonbare repository, otherwise return NULL. Verify that the1005 * reference store is a files_ref_store, and cast it to that type1006 * before returning it.1007 */1008static struct files_ref_store *get_files_ref_store(const char*submodule,1009const char*caller)1010{1011struct ref_store *refs =get_ref_store(submodule);10121013return refs ?files_downcast(refs,1, caller) : NULL;1014}10151016/* The length of a peeled reference line in packed-refs, including EOL: */1017#define PEELED_LINE_LENGTH 4210181019/*1020 * The packed-refs header line that we write out. Perhaps other1021 * traits will be added later. The trailing space is required.1022 */1023static const char PACKED_REFS_HEADER[] =1024"# pack-refs with: peeled fully-peeled\n";10251026/*1027 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1028 * Return a pointer to the refname within the line (null-terminated),1029 * or NULL if there was a problem.1030 */1031static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1)1032{1033const char*ref;10341035/*1036 * 42: the answer to everything.1037 *1038 * In this case, it happens to be the answer to1039 * 40 (length of sha1 hex representation)1040 * +1 (space in between hex and name)1041 * +1 (newline at the end of the line)1042 */1043if(line->len <=42)1044return NULL;10451046if(get_sha1_hex(line->buf, sha1) <0)1047return NULL;1048if(!isspace(line->buf[40]))1049return NULL;10501051 ref = line->buf +41;1052if(isspace(*ref))1053return NULL;10541055if(line->buf[line->len -1] !='\n')1056return NULL;1057 line->buf[--line->len] =0;10581059return ref;1060}10611062/*1063 * Read f, which is a packed-refs file, into dir.1064 *1065 * A comment line of the form "# pack-refs with: " may contain zero or1066 * more traits. We interpret the traits as follows:1067 *1068 * No traits:1069 *1070 * Probably no references are peeled. But if the file contains a1071 * peeled value for a reference, we will use it.1072 *1073 * peeled:1074 *1075 * References under "refs/tags/", if they *can* be peeled, *are*1076 * peeled in this file. References outside of "refs/tags/" are1077 * probably not peeled even if they could have been, but if we find1078 * a peeled value for such a reference we will use it.1079 *1080 * fully-peeled:1081 *1082 * All references in the file that can be peeled are peeled.1083 * Inversely (and this is more important), any references in the1084 * file for which no peeled value is recorded is not peelable. This1085 * trait should typically be written alongside "peeled" for1086 * compatibility with older clients, but we do not require it1087 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1088 */1089static voidread_packed_refs(FILE*f,struct ref_dir *dir)1090{1091struct ref_entry *last = NULL;1092struct strbuf line = STRBUF_INIT;1093enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;10941095while(strbuf_getwholeline(&line, f,'\n') != EOF) {1096unsigned char sha1[20];1097const char*refname;1098const char*traits;10991100if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1101if(strstr(traits," fully-peeled "))1102 peeled = PEELED_FULLY;1103else if(strstr(traits," peeled "))1104 peeled = PEELED_TAGS;1105/* perhaps other traits later as well */1106continue;1107}11081109 refname =parse_ref_line(&line, sha1);1110if(refname) {1111int flag = REF_ISPACKED;11121113if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1114if(!refname_is_safe(refname))1115die("packed refname is dangerous:%s", refname);1116hashclr(sha1);1117 flag |= REF_BAD_NAME | REF_ISBROKEN;1118}1119 last =create_ref_entry(refname, sha1, flag,0);1120if(peeled == PEELED_FULLY ||1121(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1122 last->flag |= REF_KNOWS_PEELED;1123add_ref(dir, last);1124continue;1125}1126if(last &&1127 line.buf[0] =='^'&&1128 line.len == PEELED_LINE_LENGTH &&1129 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1130!get_sha1_hex(line.buf +1, sha1)) {1131hashcpy(last->u.value.peeled.hash, sha1);1132/*1133 * Regardless of what the file header said,1134 * we definitely know the value of *this*1135 * reference:1136 */1137 last->flag |= REF_KNOWS_PEELED;1138}1139}11401141strbuf_release(&line);1142}11431144/*1145 * Get the packed_ref_cache for the specified files_ref_store,1146 * creating it if necessary.1147 */1148static struct packed_ref_cache *get_packed_ref_cache(struct files_ref_store *refs)1149{1150char*packed_refs_file;11511152if(*refs->base.submodule)1153 packed_refs_file =git_pathdup_submodule(refs->base.submodule,1154"packed-refs");1155else1156 packed_refs_file =git_pathdup("packed-refs");11571158if(refs->packed &&1159!stat_validity_check(&refs->packed->validity, packed_refs_file))1160clear_packed_ref_cache(refs);11611162if(!refs->packed) {1163FILE*f;11641165 refs->packed =xcalloc(1,sizeof(*refs->packed));1166acquire_packed_ref_cache(refs->packed);1167 refs->packed->root =create_dir_entry(refs,"",0,0);1168 f =fopen(packed_refs_file,"r");1169if(f) {1170stat_validity_update(&refs->packed->validity,fileno(f));1171read_packed_refs(f,get_ref_dir(refs->packed->root));1172fclose(f);1173}1174}1175free(packed_refs_file);1176return refs->packed;1177}11781179static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1180{1181returnget_ref_dir(packed_ref_cache->root);1182}11831184static struct ref_dir *get_packed_refs(struct files_ref_store *refs)1185{1186returnget_packed_ref_dir(get_packed_ref_cache(refs));1187}11881189/*1190 * Add a reference to the in-memory packed reference cache. This may1191 * only be called while the packed-refs file is locked (see1192 * lock_packed_refs()). To actually write the packed-refs file, call1193 * commit_packed_refs().1194 */1195static voidadd_packed_ref(const char*refname,const unsigned char*sha1)1196{1197struct files_ref_store *refs =1198get_files_ref_store(NULL,"add_packed_ref");1199struct packed_ref_cache *packed_ref_cache =get_packed_ref_cache(refs);12001201if(!packed_ref_cache->lock)1202die("internal error: packed refs not locked");1203add_ref(get_packed_ref_dir(packed_ref_cache),1204create_ref_entry(refname, sha1, REF_ISPACKED,1));1205}12061207/*1208 * Read the loose references from the namespace dirname into dir1209 * (without recursing). dirname must end with '/'. dir must be the1210 * directory entry corresponding to dirname.1211 */1212static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1213{1214struct files_ref_store *refs = dir->ref_store;1215DIR*d;1216struct dirent *de;1217int dirnamelen =strlen(dirname);1218struct strbuf refname;1219struct strbuf path = STRBUF_INIT;1220size_t path_baselen;12211222if(*refs->base.submodule)1223strbuf_git_path_submodule(&path, refs->base.submodule,"%s", dirname);1224else1225strbuf_git_path(&path,"%s", dirname);1226 path_baselen = path.len;12271228 d =opendir(path.buf);1229if(!d) {1230strbuf_release(&path);1231return;1232}12331234strbuf_init(&refname, dirnamelen +257);1235strbuf_add(&refname, dirname, dirnamelen);12361237while((de =readdir(d)) != NULL) {1238unsigned char sha1[20];1239struct stat st;1240int flag;12411242if(de->d_name[0] =='.')1243continue;1244if(ends_with(de->d_name,".lock"))1245continue;1246strbuf_addstr(&refname, de->d_name);1247strbuf_addstr(&path, de->d_name);1248if(stat(path.buf, &st) <0) {1249;/* silently ignore */1250}else if(S_ISDIR(st.st_mode)) {1251strbuf_addch(&refname,'/');1252add_entry_to_dir(dir,1253create_dir_entry(refs, refname.buf,1254 refname.len,1));1255}else{1256int read_ok;12571258if(*refs->base.submodule) {1259hashclr(sha1);1260 flag =0;1261 read_ok = !resolve_gitlink_ref(refs->base.submodule,1262 refname.buf, sha1);1263}else{1264 read_ok = !read_ref_full(refname.buf,1265 RESOLVE_REF_READING,1266 sha1, &flag);1267}12681269if(!read_ok) {1270hashclr(sha1);1271 flag |= REF_ISBROKEN;1272}else if(is_null_sha1(sha1)) {1273/*1274 * It is so astronomically unlikely1275 * that NULL_SHA1 is the SHA-1 of an1276 * actual object that we consider its1277 * appearance in a loose reference1278 * file to be repo corruption1279 * (probably due to a software bug).1280 */1281 flag |= REF_ISBROKEN;1282}12831284if(check_refname_format(refname.buf,1285 REFNAME_ALLOW_ONELEVEL)) {1286if(!refname_is_safe(refname.buf))1287die("loose refname is dangerous:%s", refname.buf);1288hashclr(sha1);1289 flag |= REF_BAD_NAME | REF_ISBROKEN;1290}1291add_entry_to_dir(dir,1292create_ref_entry(refname.buf, sha1, flag,0));1293}1294strbuf_setlen(&refname, dirnamelen);1295strbuf_setlen(&path, path_baselen);1296}1297strbuf_release(&refname);1298strbuf_release(&path);1299closedir(d);1300}13011302static struct ref_dir *get_loose_refs(struct files_ref_store *refs)1303{1304if(!refs->loose) {1305/*1306 * Mark the top-level directory complete because we1307 * are about to read the only subdirectory that can1308 * hold references:1309 */1310 refs->loose =create_dir_entry(refs,"",0,0);1311/*1312 * Create an incomplete entry for "refs/":1313 */1314add_entry_to_dir(get_ref_dir(refs->loose),1315create_dir_entry(refs,"refs/",5,1));1316}1317returnget_ref_dir(refs->loose);1318}13191320#define MAXREFLEN (1024)13211322/*1323 * Called by resolve_gitlink_ref_recursive() after it failed to read1324 * from the loose refs in refs. Find <refname> in the packed-refs file1325 * for the submodule.1326 */1327static intresolve_gitlink_packed_ref(struct files_ref_store *refs,1328const char*refname,unsigned char*sha1)1329{1330struct ref_entry *ref;1331struct ref_dir *dir =get_packed_refs(refs);13321333 ref =find_ref(dir, refname);1334if(ref == NULL)1335return-1;13361337hashcpy(sha1, ref->u.value.oid.hash);1338return0;1339}13401341static intresolve_gitlink_ref_recursive(struct files_ref_store *refs,1342const char*refname,unsigned char*sha1,1343int recursion)1344{1345int fd, len;1346char buffer[128], *p;1347char*path;13481349if(recursion > SYMREF_MAXDEPTH ||strlen(refname) > MAXREFLEN)1350return-1;1351 path = *refs->base.submodule1352?git_pathdup_submodule(refs->base.submodule,"%s", refname)1353:git_pathdup("%s", refname);1354 fd =open(path, O_RDONLY);1355free(path);1356if(fd <0)1357returnresolve_gitlink_packed_ref(refs, refname, sha1);13581359 len =read(fd, buffer,sizeof(buffer)-1);1360close(fd);1361if(len <0)1362return-1;1363while(len &&isspace(buffer[len-1]))1364 len--;1365 buffer[len] =0;13661367/* Was it a detached head or an old-fashioned symlink? */1368if(!get_sha1_hex(buffer, sha1))1369return0;13701371/* Symref? */1372if(strncmp(buffer,"ref:",4))1373return-1;1374 p = buffer +4;1375while(isspace(*p))1376 p++;13771378returnresolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1379}13801381intresolve_gitlink_ref(const char*path,const char*refname,unsigned char*sha1)1382{1383int len =strlen(path);1384struct strbuf submodule = STRBUF_INIT;1385struct files_ref_store *refs;13861387while(len && path[len-1] =='/')1388 len--;1389if(!len)1390return-1;13911392strbuf_add(&submodule, path, len);1393 refs =get_files_ref_store(submodule.buf,"resolve_gitlink_ref");1394if(!refs) {1395strbuf_release(&submodule);1396return-1;1397}1398strbuf_release(&submodule);13991400returnresolve_gitlink_ref_recursive(refs, refname, sha1,0);1401}14021403/*1404 * Return the ref_entry for the given refname from the packed1405 * references. If it does not exist, return NULL.1406 */1407static struct ref_entry *get_packed_ref(const char*refname)1408{1409struct files_ref_store *refs =1410get_files_ref_store(NULL,"get_packed_ref");14111412returnfind_ref(get_packed_refs(refs), refname);1413}14141415/*1416 * A loose ref file doesn't exist; check for a packed ref.1417 */1418static intresolve_missing_loose_ref(const char*refname,1419unsigned char*sha1,1420unsigned int*flags)1421{1422struct ref_entry *entry;14231424/*1425 * The loose reference file does not exist; check for a packed1426 * reference.1427 */1428 entry =get_packed_ref(refname);1429if(entry) {1430hashcpy(sha1, entry->u.value.oid.hash);1431*flags |= REF_ISPACKED;1432return0;1433}1434/* refname is not a packed reference. */1435return-1;1436}14371438intread_raw_ref(const char*refname,unsigned char*sha1,1439struct strbuf *referent,unsigned int*type)1440{1441struct strbuf sb_contents = STRBUF_INIT;1442struct strbuf sb_path = STRBUF_INIT;1443const char*path;1444const char*buf;1445struct stat st;1446int fd;1447int ret = -1;1448int save_errno;14491450*type =0;1451strbuf_reset(&sb_path);1452strbuf_git_path(&sb_path,"%s", refname);1453 path = sb_path.buf;14541455stat_ref:1456/*1457 * We might have to loop back here to avoid a race1458 * condition: first we lstat() the file, then we try1459 * to read it as a link or as a file. But if somebody1460 * changes the type of the file (file <-> directory1461 * <-> symlink) between the lstat() and reading, then1462 * we don't want to report that as an error but rather1463 * try again starting with the lstat().1464 */14651466if(lstat(path, &st) <0) {1467if(errno != ENOENT)1468goto out;1469if(resolve_missing_loose_ref(refname, sha1, type)) {1470 errno = ENOENT;1471goto out;1472}1473 ret =0;1474goto out;1475}14761477/* Follow "normalized" - ie "refs/.." symlinks by hand */1478if(S_ISLNK(st.st_mode)) {1479strbuf_reset(&sb_contents);1480if(strbuf_readlink(&sb_contents, path,0) <0) {1481if(errno == ENOENT || errno == EINVAL)1482/* inconsistent with lstat; retry */1483goto stat_ref;1484else1485goto out;1486}1487if(starts_with(sb_contents.buf,"refs/") &&1488!check_refname_format(sb_contents.buf,0)) {1489strbuf_swap(&sb_contents, referent);1490*type |= REF_ISSYMREF;1491 ret =0;1492goto out;1493}1494}14951496/* Is it a directory? */1497if(S_ISDIR(st.st_mode)) {1498/*1499 * Even though there is a directory where the loose1500 * ref is supposed to be, there could still be a1501 * packed ref:1502 */1503if(resolve_missing_loose_ref(refname, sha1, type)) {1504 errno = EISDIR;1505goto out;1506}1507 ret =0;1508goto out;1509}15101511/*1512 * Anything else, just open it and try to use it as1513 * a ref1514 */1515 fd =open(path, O_RDONLY);1516if(fd <0) {1517if(errno == ENOENT)1518/* inconsistent with lstat; retry */1519goto stat_ref;1520else1521goto out;1522}1523strbuf_reset(&sb_contents);1524if(strbuf_read(&sb_contents, fd,256) <0) {1525int save_errno = errno;1526close(fd);1527 errno = save_errno;1528goto out;1529}1530close(fd);1531strbuf_rtrim(&sb_contents);1532 buf = sb_contents.buf;1533if(starts_with(buf,"ref:")) {1534 buf +=4;1535while(isspace(*buf))1536 buf++;15371538strbuf_reset(referent);1539strbuf_addstr(referent, buf);1540*type |= REF_ISSYMREF;1541 ret =0;1542goto out;1543}15441545/*1546 * Please note that FETCH_HEAD has additional1547 * data after the sha.1548 */1549if(get_sha1_hex(buf, sha1) ||1550(buf[40] !='\0'&& !isspace(buf[40]))) {1551*type |= REF_ISBROKEN;1552 errno = EINVAL;1553goto out;1554}15551556 ret =0;15571558out:1559 save_errno = errno;1560strbuf_release(&sb_path);1561strbuf_release(&sb_contents);1562 errno = save_errno;1563return ret;1564}15651566static voidunlock_ref(struct ref_lock *lock)1567{1568/* Do not free lock->lk -- atexit() still looks at them */1569if(lock->lk)1570rollback_lock_file(lock->lk);1571free(lock->ref_name);1572free(lock);1573}15741575/*1576 * Lock refname, without following symrefs, and set *lock_p to point1577 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1578 * and type similarly to read_raw_ref().1579 *1580 * The caller must verify that refname is a "safe" reference name (in1581 * the sense of refname_is_safe()) before calling this function.1582 *1583 * If the reference doesn't already exist, verify that refname doesn't1584 * have a D/F conflict with any existing references. extras and skip1585 * are passed to verify_refname_available_dir() for this check.1586 *1587 * If mustexist is not set and the reference is not found or is1588 * broken, lock the reference anyway but clear sha1.1589 *1590 * Return 0 on success. On failure, write an error message to err and1591 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1592 *1593 * Implementation note: This function is basically1594 *1595 * lock reference1596 * read_raw_ref()1597 *1598 * but it includes a lot more code to1599 * - Deal with possible races with other processes1600 * - Avoid calling verify_refname_available_dir() when it can be1601 * avoided, namely if we were successfully able to read the ref1602 * - Generate informative error messages in the case of failure1603 */1604static intlock_raw_ref(const char*refname,int mustexist,1605const struct string_list *extras,1606const struct string_list *skip,1607struct ref_lock **lock_p,1608struct strbuf *referent,1609unsigned int*type,1610struct strbuf *err)1611{1612struct files_ref_store *refs =1613get_files_ref_store(NULL,"lock_raw_ref");1614struct ref_lock *lock;1615struct strbuf ref_file = STRBUF_INIT;1616int attempts_remaining =3;1617int ret = TRANSACTION_GENERIC_ERROR;16181619assert(err);1620*type =0;16211622/* First lock the file so it can't change out from under us. */16231624*lock_p = lock =xcalloc(1,sizeof(*lock));16251626 lock->ref_name =xstrdup(refname);1627strbuf_git_path(&ref_file,"%s", refname);16281629retry:1630switch(safe_create_leading_directories(ref_file.buf)) {1631case SCLD_OK:1632break;/* success */1633case SCLD_EXISTS:1634/*1635 * Suppose refname is "refs/foo/bar". We just failed1636 * to create the containing directory, "refs/foo",1637 * because there was a non-directory in the way. This1638 * indicates a D/F conflict, probably because of1639 * another reference such as "refs/foo". There is no1640 * reason to expect this error to be transitory.1641 */1642if(verify_refname_available(refname, extras, skip, err)) {1643if(mustexist) {1644/*1645 * To the user the relevant error is1646 * that the "mustexist" reference is1647 * missing:1648 */1649strbuf_reset(err);1650strbuf_addf(err,"unable to resolve reference '%s'",1651 refname);1652}else{1653/*1654 * The error message set by1655 * verify_refname_available_dir() is OK.1656 */1657 ret = TRANSACTION_NAME_CONFLICT;1658}1659}else{1660/*1661 * The file that is in the way isn't a loose1662 * reference. Report it as a low-level1663 * failure.1664 */1665strbuf_addf(err,"unable to create lock file%s.lock; "1666"non-directory in the way",1667 ref_file.buf);1668}1669goto error_return;1670case SCLD_VANISHED:1671/* Maybe another process was tidying up. Try again. */1672if(--attempts_remaining >0)1673goto retry;1674/* fall through */1675default:1676strbuf_addf(err,"unable to create directory for%s",1677 ref_file.buf);1678goto error_return;1679}16801681if(!lock->lk)1682 lock->lk =xcalloc(1,sizeof(struct lock_file));16831684if(hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) <0) {1685if(errno == ENOENT && --attempts_remaining >0) {1686/*1687 * Maybe somebody just deleted one of the1688 * directories leading to ref_file. Try1689 * again:1690 */1691goto retry;1692}else{1693unable_to_lock_message(ref_file.buf, errno, err);1694goto error_return;1695}1696}16971698/*1699 * Now we hold the lock and can read the reference without1700 * fear that its value will change.1701 */17021703if(read_raw_ref(refname, lock->old_oid.hash, referent, type)) {1704if(errno == ENOENT) {1705if(mustexist) {1706/* Garden variety missing reference. */1707strbuf_addf(err,"unable to resolve reference '%s'",1708 refname);1709goto error_return;1710}else{1711/*1712 * Reference is missing, but that's OK. We1713 * know that there is not a conflict with1714 * another loose reference because1715 * (supposing that we are trying to lock1716 * reference "refs/foo/bar"):1717 *1718 * - We were successfully able to create1719 * the lockfile refs/foo/bar.lock, so we1720 * know there cannot be a loose reference1721 * named "refs/foo".1722 *1723 * - We got ENOENT and not EISDIR, so we1724 * know that there cannot be a loose1725 * reference named "refs/foo/bar/baz".1726 */1727}1728}else if(errno == EISDIR) {1729/*1730 * There is a directory in the way. It might have1731 * contained references that have been deleted. If1732 * we don't require that the reference already1733 * exists, try to remove the directory so that it1734 * doesn't cause trouble when we want to rename the1735 * lockfile into place later.1736 */1737if(mustexist) {1738/* Garden variety missing reference. */1739strbuf_addf(err,"unable to resolve reference '%s'",1740 refname);1741goto error_return;1742}else if(remove_dir_recursively(&ref_file,1743 REMOVE_DIR_EMPTY_ONLY)) {1744if(verify_refname_available_dir(1745 refname, extras, skip,1746get_loose_refs(refs),1747 err)) {1748/*1749 * The error message set by1750 * verify_refname_available() is OK.1751 */1752 ret = TRANSACTION_NAME_CONFLICT;1753goto error_return;1754}else{1755/*1756 * We can't delete the directory,1757 * but we also don't know of any1758 * references that it should1759 * contain.1760 */1761strbuf_addf(err,"there is a non-empty directory '%s' "1762"blocking reference '%s'",1763 ref_file.buf, refname);1764goto error_return;1765}1766}1767}else if(errno == EINVAL && (*type & REF_ISBROKEN)) {1768strbuf_addf(err,"unable to resolve reference '%s': "1769"reference broken", refname);1770goto error_return;1771}else{1772strbuf_addf(err,"unable to resolve reference '%s':%s",1773 refname,strerror(errno));1774goto error_return;1775}17761777/*1778 * If the ref did not exist and we are creating it,1779 * make sure there is no existing packed ref whose1780 * name begins with our refname, nor a packed ref1781 * whose name is a proper prefix of our refname.1782 */1783if(verify_refname_available_dir(1784 refname, extras, skip,1785get_packed_refs(refs),1786 err)) {1787goto error_return;1788}1789}17901791 ret =0;1792goto out;17931794error_return:1795unlock_ref(lock);1796*lock_p = NULL;17971798out:1799strbuf_release(&ref_file);1800return ret;1801}18021803/*1804 * Peel the entry (if possible) and return its new peel_status. If1805 * repeel is true, re-peel the entry even if there is an old peeled1806 * value that is already stored in it.1807 *1808 * It is OK to call this function with a packed reference entry that1809 * might be stale and might even refer to an object that has since1810 * been garbage-collected. In such a case, if the entry has1811 * REF_KNOWS_PEELED then leave the status unchanged and return1812 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1813 */1814static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1815{1816enum peel_status status;18171818if(entry->flag & REF_KNOWS_PEELED) {1819if(repeel) {1820 entry->flag &= ~REF_KNOWS_PEELED;1821oidclr(&entry->u.value.peeled);1822}else{1823returnis_null_oid(&entry->u.value.peeled) ?1824 PEEL_NON_TAG : PEEL_PEELED;1825}1826}1827if(entry->flag & REF_ISBROKEN)1828return PEEL_BROKEN;1829if(entry->flag & REF_ISSYMREF)1830return PEEL_IS_SYMREF;18311832 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1833if(status == PEEL_PEELED || status == PEEL_NON_TAG)1834 entry->flag |= REF_KNOWS_PEELED;1835return status;1836}18371838intpeel_ref(const char*refname,unsigned char*sha1)1839{1840int flag;1841unsigned char base[20];18421843if(current_ref_iter && current_ref_iter->refname == refname) {1844struct object_id peeled;18451846if(ref_iterator_peel(current_ref_iter, &peeled))1847return-1;1848hashcpy(sha1, peeled.hash);1849return0;1850}18511852if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1853return-1;18541855/*1856 * If the reference is packed, read its ref_entry from the1857 * cache in the hope that we already know its peeled value.1858 * We only try this optimization on packed references because1859 * (a) forcing the filling of the loose reference cache could1860 * be expensive and (b) loose references anyway usually do not1861 * have REF_KNOWS_PEELED.1862 */1863if(flag & REF_ISPACKED) {1864struct ref_entry *r =get_packed_ref(refname);1865if(r) {1866if(peel_entry(r,0))1867return-1;1868hashcpy(sha1, r->u.value.peeled.hash);1869return0;1870}1871}18721873returnpeel_object(base, sha1);1874}18751876struct files_ref_iterator {1877struct ref_iterator base;18781879struct packed_ref_cache *packed_ref_cache;1880struct ref_iterator *iter0;1881unsigned int flags;1882};18831884static intfiles_ref_iterator_advance(struct ref_iterator *ref_iterator)1885{1886struct files_ref_iterator *iter =1887(struct files_ref_iterator *)ref_iterator;1888int ok;18891890while((ok =ref_iterator_advance(iter->iter0)) == ITER_OK) {1891if(!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&1892!ref_resolves_to_object(iter->iter0->refname,1893 iter->iter0->oid,1894 iter->iter0->flags))1895continue;18961897 iter->base.refname = iter->iter0->refname;1898 iter->base.oid = iter->iter0->oid;1899 iter->base.flags = iter->iter0->flags;1900return ITER_OK;1901}19021903 iter->iter0 = NULL;1904if(ref_iterator_abort(ref_iterator) != ITER_DONE)1905 ok = ITER_ERROR;19061907return ok;1908}19091910static intfiles_ref_iterator_peel(struct ref_iterator *ref_iterator,1911struct object_id *peeled)1912{1913struct files_ref_iterator *iter =1914(struct files_ref_iterator *)ref_iterator;19151916returnref_iterator_peel(iter->iter0, peeled);1917}19181919static intfiles_ref_iterator_abort(struct ref_iterator *ref_iterator)1920{1921struct files_ref_iterator *iter =1922(struct files_ref_iterator *)ref_iterator;1923int ok = ITER_DONE;19241925if(iter->iter0)1926 ok =ref_iterator_abort(iter->iter0);19271928release_packed_ref_cache(iter->packed_ref_cache);1929base_ref_iterator_free(ref_iterator);1930return ok;1931}19321933static struct ref_iterator_vtable files_ref_iterator_vtable = {1934 files_ref_iterator_advance,1935 files_ref_iterator_peel,1936 files_ref_iterator_abort1937};19381939struct ref_iterator *files_ref_iterator_begin(1940const char*submodule,1941const char*prefix,unsigned int flags)1942{1943struct files_ref_store *refs =1944get_files_ref_store(submodule,"ref_iterator_begin");1945struct ref_dir *loose_dir, *packed_dir;1946struct ref_iterator *loose_iter, *packed_iter;1947struct files_ref_iterator *iter;1948struct ref_iterator *ref_iterator;19491950if(!refs)1951returnempty_ref_iterator_begin();19521953if(ref_paranoia <0)1954 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1955if(ref_paranoia)1956 flags |= DO_FOR_EACH_INCLUDE_BROKEN;19571958 iter =xcalloc(1,sizeof(*iter));1959 ref_iterator = &iter->base;1960base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);19611962/*1963 * We must make sure that all loose refs are read before1964 * accessing the packed-refs file; this avoids a race1965 * condition if loose refs are migrated to the packed-refs1966 * file by a simultaneous process, but our in-memory view is1967 * from before the migration. We ensure this as follows:1968 * First, we call prime_ref_dir(), which pre-reads the loose1969 * references for the subtree into the cache. (If they've1970 * already been read, that's OK; we only need to guarantee1971 * that they're read before the packed refs, not *how much*1972 * before.) After that, we call get_packed_ref_cache(), which1973 * internally checks whether the packed-ref cache is up to1974 * date with what is on disk, and re-reads it if not.1975 */19761977 loose_dir =get_loose_refs(refs);19781979if(prefix && *prefix)1980 loose_dir =find_containing_dir(loose_dir, prefix,0);19811982if(loose_dir) {1983prime_ref_dir(loose_dir);1984 loose_iter =cache_ref_iterator_begin(loose_dir);1985}else{1986/* There's nothing to iterate over. */1987 loose_iter =empty_ref_iterator_begin();1988}19891990 iter->packed_ref_cache =get_packed_ref_cache(refs);1991acquire_packed_ref_cache(iter->packed_ref_cache);1992 packed_dir =get_packed_ref_dir(iter->packed_ref_cache);19931994if(prefix && *prefix)1995 packed_dir =find_containing_dir(packed_dir, prefix,0);19961997if(packed_dir) {1998 packed_iter =cache_ref_iterator_begin(packed_dir);1999}else{2000/* There's nothing to iterate over. */2001 packed_iter =empty_ref_iterator_begin();2002}20032004 iter->iter0 =overlay_ref_iterator_begin(loose_iter, packed_iter);2005 iter->flags = flags;20062007return ref_iterator;2008}20092010/*2011 * Verify that the reference locked by lock has the value old_sha1.2012 * Fail if the reference doesn't exist and mustexist is set. Return 02013 * on success. On error, write an error message to err, set errno, and2014 * return a negative value.2015 */2016static intverify_lock(struct ref_lock *lock,2017const unsigned char*old_sha1,int mustexist,2018struct strbuf *err)2019{2020assert(err);20212022if(read_ref_full(lock->ref_name,2023 mustexist ? RESOLVE_REF_READING :0,2024 lock->old_oid.hash, NULL)) {2025if(old_sha1) {2026int save_errno = errno;2027strbuf_addf(err,"can't verify ref '%s'", lock->ref_name);2028 errno = save_errno;2029return-1;2030}else{2031hashclr(lock->old_oid.hash);2032return0;2033}2034}2035if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {2036strbuf_addf(err,"ref '%s' is at%sbut expected%s",2037 lock->ref_name,2038sha1_to_hex(lock->old_oid.hash),2039sha1_to_hex(old_sha1));2040 errno = EBUSY;2041return-1;2042}2043return0;2044}20452046static intremove_empty_directories(struct strbuf *path)2047{2048/*2049 * we want to create a file but there is a directory there;2050 * if that is an empty directory (or a directory that contains2051 * only empty directories), remove them.2052 */2053returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);2054}20552056/*2057 * Locks a ref returning the lock on success and NULL on failure.2058 * On failure errno is set to something meaningful.2059 */2060static struct ref_lock *lock_ref_sha1_basic(const char*refname,2061const unsigned char*old_sha1,2062const struct string_list *extras,2063const struct string_list *skip,2064unsigned int flags,int*type,2065struct strbuf *err)2066{2067struct files_ref_store *refs =2068get_files_ref_store(NULL,"lock_ref_sha1_basic");2069struct strbuf ref_file = STRBUF_INIT;2070struct ref_lock *lock;2071int last_errno =0;2072int lflags = LOCK_NO_DEREF;2073int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2074int resolve_flags = RESOLVE_REF_NO_RECURSE;2075int attempts_remaining =3;2076int resolved;20772078assert(err);20792080 lock =xcalloc(1,sizeof(struct ref_lock));20812082if(mustexist)2083 resolve_flags |= RESOLVE_REF_READING;2084if(flags & REF_DELETING)2085 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;20862087strbuf_git_path(&ref_file,"%s", refname);2088 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2089 lock->old_oid.hash, type);2090if(!resolved && errno == EISDIR) {2091/*2092 * we are trying to lock foo but we used to2093 * have foo/bar which now does not exist;2094 * it is normal for the empty directory 'foo'2095 * to remain.2096 */2097if(remove_empty_directories(&ref_file)) {2098 last_errno = errno;2099if(!verify_refname_available_dir(2100 refname, extras, skip,2101get_loose_refs(refs), err))2102strbuf_addf(err,"there are still refs under '%s'",2103 refname);2104goto error_return;2105}2106 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2107 lock->old_oid.hash, type);2108}2109if(!resolved) {2110 last_errno = errno;2111if(last_errno != ENOTDIR ||2112!verify_refname_available_dir(2113 refname, extras, skip,2114get_loose_refs(refs), err))2115strbuf_addf(err,"unable to resolve reference '%s':%s",2116 refname,strerror(last_errno));21172118goto error_return;2119}21202121/*2122 * If the ref did not exist and we are creating it, make sure2123 * there is no existing packed ref whose name begins with our2124 * refname, nor a packed ref whose name is a proper prefix of2125 * our refname.2126 */2127if(is_null_oid(&lock->old_oid) &&2128verify_refname_available_dir(refname, extras, skip,2129get_packed_refs(refs),2130 err)) {2131 last_errno = ENOTDIR;2132goto error_return;2133}21342135 lock->lk =xcalloc(1,sizeof(struct lock_file));21362137 lock->ref_name =xstrdup(refname);21382139 retry:2140switch(safe_create_leading_directories_const(ref_file.buf)) {2141case SCLD_OK:2142break;/* success */2143case SCLD_VANISHED:2144if(--attempts_remaining >0)2145goto retry;2146/* fall through */2147default:2148 last_errno = errno;2149strbuf_addf(err,"unable to create directory for '%s'",2150 ref_file.buf);2151goto error_return;2152}21532154if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {2155 last_errno = errno;2156if(errno == ENOENT && --attempts_remaining >0)2157/*2158 * Maybe somebody just deleted one of the2159 * directories leading to ref_file. Try2160 * again:2161 */2162goto retry;2163else{2164unable_to_lock_message(ref_file.buf, errno, err);2165goto error_return;2166}2167}2168if(verify_lock(lock, old_sha1, mustexist, err)) {2169 last_errno = errno;2170goto error_return;2171}2172goto out;21732174 error_return:2175unlock_ref(lock);2176 lock = NULL;21772178 out:2179strbuf_release(&ref_file);2180 errno = last_errno;2181return lock;2182}21832184/*2185 * Write an entry to the packed-refs file for the specified refname.2186 * If peeled is non-NULL, write it as the entry's peeled value.2187 */2188static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2189unsigned char*peeled)2190{2191fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2192if(peeled)2193fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2194}21952196/*2197 * An each_ref_entry_fn that writes the entry to a packed-refs file.2198 */2199static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2200{2201enum peel_status peel_status =peel_entry(entry,0);22022203if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2204error("internal error:%sis not a valid packed reference!",2205 entry->name);2206write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2207 peel_status == PEEL_PEELED ?2208 entry->u.value.peeled.hash : NULL);2209return0;2210}22112212/*2213 * Lock the packed-refs file for writing. Flags is passed to2214 * hold_lock_file_for_update(). Return 0 on success. On errors, set2215 * errno appropriately and return a nonzero value.2216 */2217static intlock_packed_refs(int flags)2218{2219struct files_ref_store *refs =2220get_files_ref_store(NULL,"lock_packed_refs");2221static int timeout_configured =0;2222static int timeout_value =1000;2223struct packed_ref_cache *packed_ref_cache;22242225if(!timeout_configured) {2226git_config_get_int("core.packedrefstimeout", &timeout_value);2227 timeout_configured =1;2228}22292230if(hold_lock_file_for_update_timeout(2231&packlock,git_path("packed-refs"),2232 flags, timeout_value) <0)2233return-1;2234/*2235 * Get the current packed-refs while holding the lock. If the2236 * packed-refs file has been modified since we last read it,2237 * this will automatically invalidate the cache and re-read2238 * the packed-refs file.2239 */2240 packed_ref_cache =get_packed_ref_cache(refs);2241 packed_ref_cache->lock = &packlock;2242/* Increment the reference count to prevent it from being freed: */2243acquire_packed_ref_cache(packed_ref_cache);2244return0;2245}22462247/*2248 * Write the current version of the packed refs cache from memory to2249 * disk. The packed-refs file must already be locked for writing (see2250 * lock_packed_refs()). Return zero on success. On errors, set errno2251 * and return a nonzero value2252 */2253static intcommit_packed_refs(void)2254{2255struct files_ref_store *refs =2256get_files_ref_store(NULL,"commit_packed_refs");2257struct packed_ref_cache *packed_ref_cache =2258get_packed_ref_cache(refs);2259int error =0;2260int save_errno =0;2261FILE*out;22622263if(!packed_ref_cache->lock)2264die("internal error: packed-refs not locked");22652266 out =fdopen_lock_file(packed_ref_cache->lock,"w");2267if(!out)2268die_errno("unable to fdopen packed-refs descriptor");22692270fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2271do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),22720, write_packed_entry_fn, out);22732274if(commit_lock_file(packed_ref_cache->lock)) {2275 save_errno = errno;2276 error = -1;2277}2278 packed_ref_cache->lock = NULL;2279release_packed_ref_cache(packed_ref_cache);2280 errno = save_errno;2281return error;2282}22832284/*2285 * Rollback the lockfile for the packed-refs file, and discard the2286 * in-memory packed reference cache. (The packed-refs file will be2287 * read anew if it is needed again after this function is called.)2288 */2289static voidrollback_packed_refs(void)2290{2291struct files_ref_store *refs =2292get_files_ref_store(NULL,"rollback_packed_refs");2293struct packed_ref_cache *packed_ref_cache =2294get_packed_ref_cache(refs);22952296if(!packed_ref_cache->lock)2297die("internal error: packed-refs not locked");2298rollback_lock_file(packed_ref_cache->lock);2299 packed_ref_cache->lock = NULL;2300release_packed_ref_cache(packed_ref_cache);2301clear_packed_ref_cache(refs);2302}23032304struct ref_to_prune {2305struct ref_to_prune *next;2306unsigned char sha1[20];2307char name[FLEX_ARRAY];2308};23092310struct pack_refs_cb_data {2311unsigned int flags;2312struct ref_dir *packed_refs;2313struct ref_to_prune *ref_to_prune;2314};23152316/*2317 * An each_ref_entry_fn that is run over loose references only. If2318 * the loose reference can be packed, add an entry in the packed ref2319 * cache. If the reference should be pruned, also add it to2320 * ref_to_prune in the pack_refs_cb_data.2321 */2322static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2323{2324struct pack_refs_cb_data *cb = cb_data;2325enum peel_status peel_status;2326struct ref_entry *packed_entry;2327int is_tag_ref =starts_with(entry->name,"refs/tags/");23282329/* Do not pack per-worktree refs: */2330if(ref_type(entry->name) != REF_TYPE_NORMAL)2331return0;23322333/* ALWAYS pack tags */2334if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2335return0;23362337/* Do not pack symbolic or broken refs: */2338if((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))2339return0;23402341/* Add a packed ref cache entry equivalent to the loose entry. */2342 peel_status =peel_entry(entry,1);2343if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2344die("internal error peeling reference%s(%s)",2345 entry->name,oid_to_hex(&entry->u.value.oid));2346 packed_entry =find_ref(cb->packed_refs, entry->name);2347if(packed_entry) {2348/* Overwrite existing packed entry with info from loose entry */2349 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2350oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2351}else{2352 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2353 REF_ISPACKED | REF_KNOWS_PEELED,0);2354add_ref(cb->packed_refs, packed_entry);2355}2356oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);23572358/* Schedule the loose reference for pruning if requested. */2359if((cb->flags & PACK_REFS_PRUNE)) {2360struct ref_to_prune *n;2361FLEX_ALLOC_STR(n, name, entry->name);2362hashcpy(n->sha1, entry->u.value.oid.hash);2363 n->next = cb->ref_to_prune;2364 cb->ref_to_prune = n;2365}2366return0;2367}23682369/*2370 * Remove empty parents, but spare refs/ and immediate subdirs.2371 * Note: munges *name.2372 */2373static voidtry_remove_empty_parents(char*name)2374{2375char*p, *q;2376int i;2377 p = name;2378for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2379while(*p && *p !='/')2380 p++;2381/* tolerate duplicate slashes; see check_refname_format() */2382while(*p =='/')2383 p++;2384}2385for(q = p; *q; q++)2386;2387while(1) {2388while(q > p && *q !='/')2389 q--;2390while(q > p && *(q-1) =='/')2391 q--;2392if(q == p)2393break;2394*q ='\0';2395if(rmdir(git_path("%s", name)))2396break;2397}2398}23992400/* make sure nobody touched the ref, and unlink */2401static voidprune_ref(struct ref_to_prune *r)2402{2403struct ref_transaction *transaction;2404struct strbuf err = STRBUF_INIT;24052406if(check_refname_format(r->name,0))2407return;24082409 transaction =ref_transaction_begin(&err);2410if(!transaction ||2411ref_transaction_delete(transaction, r->name, r->sha1,2412 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2413ref_transaction_commit(transaction, &err)) {2414ref_transaction_free(transaction);2415error("%s", err.buf);2416strbuf_release(&err);2417return;2418}2419ref_transaction_free(transaction);2420strbuf_release(&err);2421try_remove_empty_parents(r->name);2422}24232424static voidprune_refs(struct ref_to_prune *r)2425{2426while(r) {2427prune_ref(r);2428 r = r->next;2429}2430}24312432intpack_refs(unsigned int flags)2433{2434struct files_ref_store *refs =2435get_files_ref_store(NULL,"pack_refs");2436struct pack_refs_cb_data cbdata;24372438memset(&cbdata,0,sizeof(cbdata));2439 cbdata.flags = flags;24402441lock_packed_refs(LOCK_DIE_ON_ERROR);2442 cbdata.packed_refs =get_packed_refs(refs);24432444do_for_each_entry_in_dir(get_loose_refs(refs),0,2445 pack_if_possible_fn, &cbdata);24462447if(commit_packed_refs())2448die_errno("unable to overwrite old ref-pack file");24492450prune_refs(cbdata.ref_to_prune);2451return0;2452}24532454/*2455 * Rewrite the packed-refs file, omitting any refs listed in2456 * 'refnames'. On error, leave packed-refs unchanged, write an error2457 * message to 'err', and return a nonzero value.2458 *2459 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2460 */2461static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2462{2463struct files_ref_store *refs =2464get_files_ref_store(NULL,"repack_without_refs");2465struct ref_dir *packed;2466struct string_list_item *refname;2467int ret, needs_repacking =0, removed =0;24682469assert(err);24702471/* Look for a packed ref */2472for_each_string_list_item(refname, refnames) {2473if(get_packed_ref(refname->string)) {2474 needs_repacking =1;2475break;2476}2477}24782479/* Avoid locking if we have nothing to do */2480if(!needs_repacking)2481return0;/* no refname exists in packed refs */24822483if(lock_packed_refs(0)) {2484unable_to_lock_message(git_path("packed-refs"), errno, err);2485return-1;2486}2487 packed =get_packed_refs(refs);24882489/* Remove refnames from the cache */2490for_each_string_list_item(refname, refnames)2491if(remove_entry(packed, refname->string) != -1)2492 removed =1;2493if(!removed) {2494/*2495 * All packed entries disappeared while we were2496 * acquiring the lock.2497 */2498rollback_packed_refs();2499return0;2500}25012502/* Write what remains */2503 ret =commit_packed_refs();2504if(ret)2505strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2506strerror(errno));2507return ret;2508}25092510static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2511{2512assert(err);25132514if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2515/*2516 * loose. The loose file name is the same as the2517 * lockfile name, minus ".lock":2518 */2519char*loose_filename =get_locked_file_path(lock->lk);2520int res =unlink_or_msg(loose_filename, err);2521free(loose_filename);2522if(res)2523return1;2524}2525return0;2526}25272528intdelete_refs(struct string_list *refnames,unsigned int flags)2529{2530struct strbuf err = STRBUF_INIT;2531int i, result =0;25322533if(!refnames->nr)2534return0;25352536 result =repack_without_refs(refnames, &err);2537if(result) {2538/*2539 * If we failed to rewrite the packed-refs file, then2540 * it is unsafe to try to remove loose refs, because2541 * doing so might expose an obsolete packed value for2542 * a reference that might even point at an object that2543 * has been garbage collected.2544 */2545if(refnames->nr ==1)2546error(_("could not delete reference%s:%s"),2547 refnames->items[0].string, err.buf);2548else2549error(_("could not delete references:%s"), err.buf);25502551goto out;2552}25532554for(i =0; i < refnames->nr; i++) {2555const char*refname = refnames->items[i].string;25562557if(delete_ref(refname, NULL, flags))2558 result |=error(_("could not remove reference%s"), refname);2559}25602561out:2562strbuf_release(&err);2563return result;2564}25652566/*2567 * People using contrib's git-new-workdir have .git/logs/refs ->2568 * /some/other/path/.git/logs/refs, and that may live on another device.2569 *2570 * IOW, to avoid cross device rename errors, the temporary renamed log must2571 * live into logs/refs.2572 */2573#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"25742575static intrename_tmp_log(const char*newrefname)2576{2577int attempts_remaining =4;2578struct strbuf path = STRBUF_INIT;2579int ret = -1;25802581 retry:2582strbuf_reset(&path);2583strbuf_git_path(&path,"logs/%s", newrefname);2584switch(safe_create_leading_directories_const(path.buf)) {2585case SCLD_OK:2586break;/* success */2587case SCLD_VANISHED:2588if(--attempts_remaining >0)2589goto retry;2590/* fall through */2591default:2592error("unable to create directory for%s", newrefname);2593goto out;2594}25952596if(rename(git_path(TMP_RENAMED_LOG), path.buf)) {2597if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2598/*2599 * rename(a, b) when b is an existing2600 * directory ought to result in ISDIR, but2601 * Solaris 5.8 gives ENOTDIR. Sheesh.2602 */2603if(remove_empty_directories(&path)) {2604error("Directory not empty: logs/%s", newrefname);2605goto out;2606}2607goto retry;2608}else if(errno == ENOENT && --attempts_remaining >0) {2609/*2610 * Maybe another process just deleted one of2611 * the directories in the path to newrefname.2612 * Try again from the beginning.2613 */2614goto retry;2615}else{2616error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2617 newrefname,strerror(errno));2618goto out;2619}2620}2621 ret =0;2622out:2623strbuf_release(&path);2624return ret;2625}26262627intverify_refname_available(const char*newname,2628const struct string_list *extras,2629const struct string_list *skip,2630struct strbuf *err)2631{2632struct files_ref_store *refs =2633get_files_ref_store(NULL,"verify_refname_available");2634struct ref_dir *packed_refs =get_packed_refs(refs);2635struct ref_dir *loose_refs =get_loose_refs(refs);26362637if(verify_refname_available_dir(newname, extras, skip,2638 packed_refs, err) ||2639verify_refname_available_dir(newname, extras, skip,2640 loose_refs, err))2641return-1;26422643return0;2644}26452646static intwrite_ref_to_lockfile(struct ref_lock *lock,2647const unsigned char*sha1,struct strbuf *err);2648static intcommit_ref_update(struct ref_lock *lock,2649const unsigned char*sha1,const char*logmsg,2650struct strbuf *err);26512652intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2653{2654unsigned char sha1[20], orig_sha1[20];2655int flag =0, logmoved =0;2656struct ref_lock *lock;2657struct stat loginfo;2658int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2659struct strbuf err = STRBUF_INIT;26602661if(log &&S_ISLNK(loginfo.st_mode))2662returnerror("reflog for%sis a symlink", oldrefname);26632664if(!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2665 orig_sha1, &flag))2666returnerror("refname%snot found", oldrefname);26672668if(flag & REF_ISSYMREF)2669returnerror("refname%sis a symbolic ref, renaming it is not supported",2670 oldrefname);2671if(!rename_ref_available(oldrefname, newrefname))2672return1;26732674if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2675returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2676 oldrefname,strerror(errno));26772678if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2679error("unable to delete old%s", oldrefname);2680goto rollback;2681}26822683/*2684 * Since we are doing a shallow lookup, sha1 is not the2685 * correct value to pass to delete_ref as old_sha1. But that2686 * doesn't matter, because an old_sha1 check wouldn't add to2687 * the safety anyway; we want to delete the reference whatever2688 * its current value.2689 */2690if(!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2691 sha1, NULL) &&2692delete_ref(newrefname, NULL, REF_NODEREF)) {2693if(errno==EISDIR) {2694struct strbuf path = STRBUF_INIT;2695int result;26962697strbuf_git_path(&path,"%s", newrefname);2698 result =remove_empty_directories(&path);2699strbuf_release(&path);27002701if(result) {2702error("Directory not empty:%s", newrefname);2703goto rollback;2704}2705}else{2706error("unable to delete existing%s", newrefname);2707goto rollback;2708}2709}27102711if(log &&rename_tmp_log(newrefname))2712goto rollback;27132714 logmoved = log;27152716 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, REF_NODEREF,2717 NULL, &err);2718if(!lock) {2719error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2720strbuf_release(&err);2721goto rollback;2722}2723hashcpy(lock->old_oid.hash, orig_sha1);27242725if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2726commit_ref_update(lock, orig_sha1, logmsg, &err)) {2727error("unable to write current sha1 into%s:%s", newrefname, err.buf);2728strbuf_release(&err);2729goto rollback;2730}27312732return0;27332734 rollback:2735 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, REF_NODEREF,2736 NULL, &err);2737if(!lock) {2738error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2739strbuf_release(&err);2740goto rollbacklog;2741}27422743 flag = log_all_ref_updates;2744 log_all_ref_updates =0;2745if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2746commit_ref_update(lock, orig_sha1, NULL, &err)) {2747error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2748strbuf_release(&err);2749}2750 log_all_ref_updates = flag;27512752 rollbacklog:2753if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2754error("unable to restore logfile%sfrom%s:%s",2755 oldrefname, newrefname,strerror(errno));2756if(!logmoved && log &&2757rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2758error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2759 oldrefname,strerror(errno));27602761return1;2762}27632764static intclose_ref(struct ref_lock *lock)2765{2766if(close_lock_file(lock->lk))2767return-1;2768return0;2769}27702771static intcommit_ref(struct ref_lock *lock)2772{2773char*path =get_locked_file_path(lock->lk);2774struct stat st;27752776if(!lstat(path, &st) &&S_ISDIR(st.st_mode)) {2777/*2778 * There is a directory at the path we want to rename2779 * the lockfile to. Hopefully it is empty; try to2780 * delete it.2781 */2782size_t len =strlen(path);2783struct strbuf sb_path = STRBUF_INIT;27842785strbuf_attach(&sb_path, path, len, len);27862787/*2788 * If this fails, commit_lock_file() will also fail2789 * and will report the problem.2790 */2791remove_empty_directories(&sb_path);2792strbuf_release(&sb_path);2793}else{2794free(path);2795}27962797if(commit_lock_file(lock->lk))2798return-1;2799return0;2800}28012802/*2803 * Create a reflog for a ref. If force_create = 0, the reflog will2804 * only be created for certain refs (those for which2805 * should_autocreate_reflog returns non-zero. Otherwise, create it2806 * regardless of the ref name. Fill in *err and return -1 on failure.2807 */2808static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)2809{2810int logfd, oflags = O_APPEND | O_WRONLY;28112812strbuf_git_path(logfile,"logs/%s", refname);2813if(force_create ||should_autocreate_reflog(refname)) {2814if(safe_create_leading_directories(logfile->buf) <0) {2815strbuf_addf(err,"unable to create directory for '%s': "2816"%s", logfile->buf,strerror(errno));2817return-1;2818}2819 oflags |= O_CREAT;2820}28212822 logfd =open(logfile->buf, oflags,0666);2823if(logfd <0) {2824if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2825return0;28262827if(errno == EISDIR) {2828if(remove_empty_directories(logfile)) {2829strbuf_addf(err,"there are still logs under "2830"'%s'", logfile->buf);2831return-1;2832}2833 logfd =open(logfile->buf, oflags,0666);2834}28352836if(logfd <0) {2837strbuf_addf(err,"unable to append to '%s':%s",2838 logfile->buf,strerror(errno));2839return-1;2840}2841}28422843adjust_shared_perm(logfile->buf);2844close(logfd);2845return0;2846}284728482849intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)2850{2851int ret;2852struct strbuf sb = STRBUF_INIT;28532854 ret =log_ref_setup(refname, &sb, err, force_create);2855strbuf_release(&sb);2856return ret;2857}28582859static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2860const unsigned char*new_sha1,2861const char*committer,const char*msg)2862{2863int msglen, written;2864unsigned maxlen, len;2865char*logrec;28662867 msglen = msg ?strlen(msg) :0;2868 maxlen =strlen(committer) + msglen +100;2869 logrec =xmalloc(maxlen);2870 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2871sha1_to_hex(old_sha1),2872sha1_to_hex(new_sha1),2873 committer);2874if(msglen)2875 len +=copy_reflog_msg(logrec + len -1, msg) -1;28762877 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2878free(logrec);2879if(written != len)2880return-1;28812882return0;2883}28842885static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,2886const unsigned char*new_sha1,const char*msg,2887struct strbuf *logfile,int flags,2888struct strbuf *err)2889{2890int logfd, result, oflags = O_APPEND | O_WRONLY;28912892if(log_all_ref_updates <0)2893 log_all_ref_updates = !is_bare_repository();28942895 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);28962897if(result)2898return result;28992900 logfd =open(logfile->buf, oflags);2901if(logfd <0)2902return0;2903 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2904git_committer_info(0), msg);2905if(result) {2906strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2907strerror(errno));2908close(logfd);2909return-1;2910}2911if(close(logfd)) {2912strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2913strerror(errno));2914return-1;2915}2916return0;2917}29182919static intlog_ref_write(const char*refname,const unsigned char*old_sha1,2920const unsigned char*new_sha1,const char*msg,2921int flags,struct strbuf *err)2922{2923returnfiles_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2924 err);2925}29262927intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2928const unsigned char*new_sha1,const char*msg,2929int flags,struct strbuf *err)2930{2931struct strbuf sb = STRBUF_INIT;2932int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2933 err);2934strbuf_release(&sb);2935return ret;2936}29372938/*2939 * Write sha1 into the open lockfile, then close the lockfile. On2940 * errors, rollback the lockfile, fill in *err and2941 * return -1.2942 */2943static intwrite_ref_to_lockfile(struct ref_lock *lock,2944const unsigned char*sha1,struct strbuf *err)2945{2946static char term ='\n';2947struct object *o;2948int fd;29492950 o =parse_object(sha1);2951if(!o) {2952strbuf_addf(err,2953"trying to write ref '%s' with nonexistent object%s",2954 lock->ref_name,sha1_to_hex(sha1));2955unlock_ref(lock);2956return-1;2957}2958if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2959strbuf_addf(err,2960"trying to write non-commit object%sto branch '%s'",2961sha1_to_hex(sha1), lock->ref_name);2962unlock_ref(lock);2963return-1;2964}2965 fd =get_lock_file_fd(lock->lk);2966if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2967write_in_full(fd, &term,1) !=1||2968close_ref(lock) <0) {2969strbuf_addf(err,2970"couldn't write '%s'",get_lock_file_path(lock->lk));2971unlock_ref(lock);2972return-1;2973}2974return0;2975}29762977/*2978 * Commit a change to a loose reference that has already been written2979 * to the loose reference lockfile. Also update the reflogs if2980 * necessary, using the specified lockmsg (which can be NULL).2981 */2982static intcommit_ref_update(struct ref_lock *lock,2983const unsigned char*sha1,const char*logmsg,2984struct strbuf *err)2985{2986struct files_ref_store *refs =2987get_files_ref_store(NULL,"commit_ref_update");29882989clear_loose_ref_cache(refs);2990if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg,0, err)) {2991char*old_msg =strbuf_detach(err, NULL);2992strbuf_addf(err,"cannot update the ref '%s':%s",2993 lock->ref_name, old_msg);2994free(old_msg);2995unlock_ref(lock);2996return-1;2997}29982999if(strcmp(lock->ref_name,"HEAD") !=0) {3000/*3001 * Special hack: If a branch is updated directly and HEAD3002 * points to it (may happen on the remote side of a push3003 * for example) then logically the HEAD reflog should be3004 * updated too.3005 * A generic solution implies reverse symref information,3006 * but finding all symrefs pointing to the given branch3007 * would be rather costly for this rare event (the direct3008 * update of a branch) to be worth it. So let's cheat and3009 * check with HEAD only which should cover 99% of all usage3010 * scenarios (even 100% of the default ones).3011 */3012unsigned char head_sha1[20];3013int head_flag;3014const char*head_ref;30153016 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3017 head_sha1, &head_flag);3018if(head_ref && (head_flag & REF_ISSYMREF) &&3019!strcmp(head_ref, lock->ref_name)) {3020struct strbuf log_err = STRBUF_INIT;3021if(log_ref_write("HEAD", lock->old_oid.hash, sha1,3022 logmsg,0, &log_err)) {3023error("%s", log_err.buf);3024strbuf_release(&log_err);3025}3026}3027}30283029if(commit_ref(lock)) {3030strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3031unlock_ref(lock);3032return-1;3033}30343035unlock_ref(lock);3036return0;3037}30383039static intcreate_ref_symlink(struct ref_lock *lock,const char*target)3040{3041int ret = -1;3042#ifndef NO_SYMLINK_HEAD3043char*ref_path =get_locked_file_path(lock->lk);3044unlink(ref_path);3045 ret =symlink(target, ref_path);3046free(ref_path);30473048if(ret)3049fprintf(stderr,"no symlink - falling back to symbolic ref\n");3050#endif3051return ret;3052}30533054static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,3055const char*target,const char*logmsg)3056{3057struct strbuf err = STRBUF_INIT;3058unsigned char new_sha1[20];3059if(logmsg && !read_ref(target, new_sha1) &&3060log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg,0, &err)) {3061error("%s", err.buf);3062strbuf_release(&err);3063}3064}30653066static intcreate_symref_locked(struct ref_lock *lock,const char*refname,3067const char*target,const char*logmsg)3068{3069if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {3070update_symref_reflog(lock, refname, target, logmsg);3071return0;3072}30733074if(!fdopen_lock_file(lock->lk,"w"))3075returnerror("unable to fdopen%s:%s",3076 lock->lk->tempfile.filename.buf,strerror(errno));30773078update_symref_reflog(lock, refname, target, logmsg);30793080/* no error check; commit_ref will check ferror */3081fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);3082if(commit_ref(lock) <0)3083returnerror("unable to write symref for%s:%s", refname,3084strerror(errno));3085return0;3086}30873088intcreate_symref(const char*refname,const char*target,const char*logmsg)3089{3090struct strbuf err = STRBUF_INIT;3091struct ref_lock *lock;3092int ret;30933094 lock =lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,3095&err);3096if(!lock) {3097error("%s", err.buf);3098strbuf_release(&err);3099return-1;3100}31013102 ret =create_symref_locked(lock, refname, target, logmsg);3103unlock_ref(lock);3104return ret;3105}31063107intset_worktree_head_symref(const char*gitdir,const char*target)3108{3109static struct lock_file head_lock;3110struct ref_lock *lock;3111struct strbuf head_path = STRBUF_INIT;3112const char*head_rel;3113int ret;31143115strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));3116if(hold_lock_file_for_update(&head_lock, head_path.buf,3117 LOCK_NO_DEREF) <0) {3118struct strbuf err = STRBUF_INIT;3119unable_to_lock_message(head_path.buf, errno, &err);3120error("%s", err.buf);3121strbuf_release(&err);3122strbuf_release(&head_path);3123return-1;3124}31253126/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3127 linked trees */3128 head_rel =remove_leading_path(head_path.buf,3129absolute_path(get_git_common_dir()));3130/* to make use of create_symref_locked(), initialize ref_lock */3131 lock =xcalloc(1,sizeof(struct ref_lock));3132 lock->lk = &head_lock;3133 lock->ref_name =xstrdup(head_rel);31343135 ret =create_symref_locked(lock, head_rel, target, NULL);31363137unlock_ref(lock);/* will free lock */3138strbuf_release(&head_path);3139return ret;3140}31413142intreflog_exists(const char*refname)3143{3144struct stat st;31453146return!lstat(git_path("logs/%s", refname), &st) &&3147S_ISREG(st.st_mode);3148}31493150intdelete_reflog(const char*refname)3151{3152returnremove_path(git_path("logs/%s", refname));3153}31543155static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3156{3157unsigned char osha1[20], nsha1[20];3158char*email_end, *message;3159unsigned long timestamp;3160int tz;31613162/* old SP new SP name <email> SP time TAB msg LF */3163if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3164get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3165get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3166!(email_end =strchr(sb->buf +82,'>')) ||3167 email_end[1] !=' '||3168!(timestamp =strtoul(email_end +2, &message,10)) ||3169!message || message[0] !=' '||3170(message[1] !='+'&& message[1] !='-') ||3171!isdigit(message[2]) || !isdigit(message[3]) ||3172!isdigit(message[4]) || !isdigit(message[5]))3173return0;/* corrupt? */3174 email_end[1] ='\0';3175 tz =strtol(message +1, NULL,10);3176if(message[6] !='\t')3177 message +=6;3178else3179 message +=7;3180returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3181}31823183static char*find_beginning_of_line(char*bob,char*scan)3184{3185while(bob < scan && *(--scan) !='\n')3186;/* keep scanning backwards */3187/*3188 * Return either beginning of the buffer, or LF at the end of3189 * the previous line.3190 */3191return scan;3192}31933194intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)3195{3196struct strbuf sb = STRBUF_INIT;3197FILE*logfp;3198long pos;3199int ret =0, at_tail =1;32003201 logfp =fopen(git_path("logs/%s", refname),"r");3202if(!logfp)3203return-1;32043205/* Jump to the end */3206if(fseek(logfp,0, SEEK_END) <0)3207returnerror("cannot seek back reflog for%s:%s",3208 refname,strerror(errno));3209 pos =ftell(logfp);3210while(!ret &&0< pos) {3211int cnt;3212size_t nread;3213char buf[BUFSIZ];3214char*endp, *scanp;32153216/* Fill next block from the end */3217 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3218if(fseek(logfp, pos - cnt, SEEK_SET))3219returnerror("cannot seek back reflog for%s:%s",3220 refname,strerror(errno));3221 nread =fread(buf, cnt,1, logfp);3222if(nread !=1)3223returnerror("cannot read%dbytes from reflog for%s:%s",3224 cnt, refname,strerror(errno));3225 pos -= cnt;32263227 scanp = endp = buf + cnt;3228if(at_tail && scanp[-1] =='\n')3229/* Looking at the final LF at the end of the file */3230 scanp--;3231 at_tail =0;32323233while(buf < scanp) {3234/*3235 * terminating LF of the previous line, or the beginning3236 * of the buffer.3237 */3238char*bp;32393240 bp =find_beginning_of_line(buf, scanp);32413242if(*bp =='\n') {3243/*3244 * The newline is the end of the previous line,3245 * so we know we have complete line starting3246 * at (bp + 1). Prefix it onto any prior data3247 * we collected for the line and process it.3248 */3249strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3250 scanp = bp;3251 endp = bp +1;3252 ret =show_one_reflog_ent(&sb, fn, cb_data);3253strbuf_reset(&sb);3254if(ret)3255break;3256}else if(!pos) {3257/*3258 * We are at the start of the buffer, and the3259 * start of the file; there is no previous3260 * line, and we have everything for this one.3261 * Process it, and we can end the loop.3262 */3263strbuf_splice(&sb,0,0, buf, endp - buf);3264 ret =show_one_reflog_ent(&sb, fn, cb_data);3265strbuf_reset(&sb);3266break;3267}32683269if(bp == buf) {3270/*3271 * We are at the start of the buffer, and there3272 * is more file to read backwards. Which means3273 * we are in the middle of a line. Note that we3274 * may get here even if *bp was a newline; that3275 * just means we are at the exact end of the3276 * previous line, rather than some spot in the3277 * middle.3278 *3279 * Save away what we have to be combined with3280 * the data from the next read.3281 */3282strbuf_splice(&sb,0,0, buf, endp - buf);3283break;3284}3285}32863287}3288if(!ret && sb.len)3289die("BUG: reverse reflog parser had leftover data");32903291fclose(logfp);3292strbuf_release(&sb);3293return ret;3294}32953296intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3297{3298FILE*logfp;3299struct strbuf sb = STRBUF_INIT;3300int ret =0;33013302 logfp =fopen(git_path("logs/%s", refname),"r");3303if(!logfp)3304return-1;33053306while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3307 ret =show_one_reflog_ent(&sb, fn, cb_data);3308fclose(logfp);3309strbuf_release(&sb);3310return ret;3311}33123313struct files_reflog_iterator {3314struct ref_iterator base;33153316struct dir_iterator *dir_iterator;3317struct object_id oid;3318};33193320static intfiles_reflog_iterator_advance(struct ref_iterator *ref_iterator)3321{3322struct files_reflog_iterator *iter =3323(struct files_reflog_iterator *)ref_iterator;3324struct dir_iterator *diter = iter->dir_iterator;3325int ok;33263327while((ok =dir_iterator_advance(diter)) == ITER_OK) {3328int flags;33293330if(!S_ISREG(diter->st.st_mode))3331continue;3332if(diter->basename[0] =='.')3333continue;3334if(ends_with(diter->basename,".lock"))3335continue;33363337if(read_ref_full(diter->relative_path,0,3338 iter->oid.hash, &flags)) {3339error("bad ref for%s", diter->path.buf);3340continue;3341}33423343 iter->base.refname = diter->relative_path;3344 iter->base.oid = &iter->oid;3345 iter->base.flags = flags;3346return ITER_OK;3347}33483349 iter->dir_iterator = NULL;3350if(ref_iterator_abort(ref_iterator) == ITER_ERROR)3351 ok = ITER_ERROR;3352return ok;3353}33543355static intfiles_reflog_iterator_peel(struct ref_iterator *ref_iterator,3356struct object_id *peeled)3357{3358die("BUG: ref_iterator_peel() called for reflog_iterator");3359}33603361static intfiles_reflog_iterator_abort(struct ref_iterator *ref_iterator)3362{3363struct files_reflog_iterator *iter =3364(struct files_reflog_iterator *)ref_iterator;3365int ok = ITER_DONE;33663367if(iter->dir_iterator)3368 ok =dir_iterator_abort(iter->dir_iterator);33693370base_ref_iterator_free(ref_iterator);3371return ok;3372}33733374static struct ref_iterator_vtable files_reflog_iterator_vtable = {3375 files_reflog_iterator_advance,3376 files_reflog_iterator_peel,3377 files_reflog_iterator_abort3378};33793380struct ref_iterator *files_reflog_iterator_begin(void)3381{3382struct files_reflog_iterator *iter =xcalloc(1,sizeof(*iter));3383struct ref_iterator *ref_iterator = &iter->base;33843385base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);3386 iter->dir_iterator =dir_iterator_begin(git_path("logs"));3387return ref_iterator;3388}33893390intfor_each_reflog(each_ref_fn fn,void*cb_data)3391{3392returndo_for_each_ref_iterator(files_reflog_iterator_begin(),3393 fn, cb_data);3394}33953396static intref_update_reject_duplicates(struct string_list *refnames,3397struct strbuf *err)3398{3399int i, n = refnames->nr;34003401assert(err);34023403for(i =1; i < n; i++)3404if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3405strbuf_addf(err,3406"multiple updates for ref '%s' not allowed.",3407 refnames->items[i].string);3408return1;3409}3410return0;3411}34123413/*3414 * If update is a direct update of head_ref (the reference pointed to3415 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3416 */3417static intsplit_head_update(struct ref_update *update,3418struct ref_transaction *transaction,3419const char*head_ref,3420struct string_list *affected_refnames,3421struct strbuf *err)3422{3423struct string_list_item *item;3424struct ref_update *new_update;34253426if((update->flags & REF_LOG_ONLY) ||3427(update->flags & REF_ISPRUNING) ||3428(update->flags & REF_UPDATE_VIA_HEAD))3429return0;34303431if(strcmp(update->refname, head_ref))3432return0;34333434/*3435 * First make sure that HEAD is not already in the3436 * transaction. This insertion is O(N) in the transaction3437 * size, but it happens at most once per transaction.3438 */3439 item =string_list_insert(affected_refnames,"HEAD");3440if(item->util) {3441/* An entry already existed */3442strbuf_addf(err,3443"multiple updates for 'HEAD' (including one "3444"via its referent '%s') are not allowed",3445 update->refname);3446return TRANSACTION_NAME_CONFLICT;3447}34483449 new_update =ref_transaction_add_update(3450 transaction,"HEAD",3451 update->flags | REF_LOG_ONLY | REF_NODEREF,3452 update->new_sha1, update->old_sha1,3453 update->msg);34543455 item->util = new_update;34563457return0;3458}34593460/*3461 * update is for a symref that points at referent and doesn't have3462 * REF_NODEREF set. Split it into two updates:3463 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3464 * - A new, separate update for the referent reference3465 * Note that the new update will itself be subject to splitting when3466 * the iteration gets to it.3467 */3468static intsplit_symref_update(struct ref_update *update,3469const char*referent,3470struct ref_transaction *transaction,3471struct string_list *affected_refnames,3472struct strbuf *err)3473{3474struct string_list_item *item;3475struct ref_update *new_update;3476unsigned int new_flags;34773478/*3479 * First make sure that referent is not already in the3480 * transaction. This insertion is O(N) in the transaction3481 * size, but it happens at most once per symref in a3482 * transaction.3483 */3484 item =string_list_insert(affected_refnames, referent);3485if(item->util) {3486/* An entry already existed */3487strbuf_addf(err,3488"multiple updates for '%s' (including one "3489"via symref '%s') are not allowed",3490 referent, update->refname);3491return TRANSACTION_NAME_CONFLICT;3492}34933494 new_flags = update->flags;3495if(!strcmp(update->refname,"HEAD")) {3496/*3497 * Record that the new update came via HEAD, so that3498 * when we process it, split_head_update() doesn't try3499 * to add another reflog update for HEAD. Note that3500 * this bit will be propagated if the new_update3501 * itself needs to be split.3502 */3503 new_flags |= REF_UPDATE_VIA_HEAD;3504}35053506 new_update =ref_transaction_add_update(3507 transaction, referent, new_flags,3508 update->new_sha1, update->old_sha1,3509 update->msg);35103511 new_update->parent_update = update;35123513/*3514 * Change the symbolic ref update to log only. Also, it3515 * doesn't need to check its old SHA-1 value, as that will be3516 * done when new_update is processed.3517 */3518 update->flags |= REF_LOG_ONLY | REF_NODEREF;3519 update->flags &= ~REF_HAVE_OLD;35203521 item->util = new_update;35223523return0;3524}35253526/*3527 * Return the refname under which update was originally requested.3528 */3529static const char*original_update_refname(struct ref_update *update)3530{3531while(update->parent_update)3532 update = update->parent_update;35333534return update->refname;3535}35363537/*3538 * Prepare for carrying out update:3539 * - Lock the reference referred to by update.3540 * - Read the reference under lock.3541 * - Check that its old SHA-1 value (if specified) is correct, and in3542 * any case record it in update->lock->old_oid for later use when3543 * writing the reflog.3544 * - If it is a symref update without REF_NODEREF, split it up into a3545 * REF_LOG_ONLY update of the symref and add a separate update for3546 * the referent to transaction.3547 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3548 * update of HEAD.3549 */3550static intlock_ref_for_update(struct ref_update *update,3551struct ref_transaction *transaction,3552const char*head_ref,3553struct string_list *affected_refnames,3554struct strbuf *err)3555{3556struct strbuf referent = STRBUF_INIT;3557int mustexist = (update->flags & REF_HAVE_OLD) &&3558!is_null_sha1(update->old_sha1);3559int ret;3560struct ref_lock *lock;35613562if((update->flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1))3563 update->flags |= REF_DELETING;35643565if(head_ref) {3566 ret =split_head_update(update, transaction, head_ref,3567 affected_refnames, err);3568if(ret)3569return ret;3570}35713572 ret =lock_raw_ref(update->refname, mustexist,3573 affected_refnames, NULL,3574&update->lock, &referent,3575&update->type, err);35763577if(ret) {3578char*reason;35793580 reason =strbuf_detach(err, NULL);3581strbuf_addf(err,"cannot lock ref '%s':%s",3582 update->refname, reason);3583free(reason);3584return ret;3585}35863587 lock = update->lock;35883589if(update->type & REF_ISSYMREF) {3590if(update->flags & REF_NODEREF) {3591/*3592 * We won't be reading the referent as part of3593 * the transaction, so we have to read it here3594 * to record and possibly check old_sha1:3595 */3596if(read_ref_full(update->refname,3597 mustexist ? RESOLVE_REF_READING :0,3598 lock->old_oid.hash, NULL)) {3599if(update->flags & REF_HAVE_OLD) {3600strbuf_addf(err,"cannot lock ref '%s': "3601"can't resolve old value",3602 update->refname);3603return TRANSACTION_GENERIC_ERROR;3604}else{3605hashclr(lock->old_oid.hash);3606}3607}3608if((update->flags & REF_HAVE_OLD) &&3609hashcmp(lock->old_oid.hash, update->old_sha1)) {3610strbuf_addf(err,"cannot lock ref '%s': "3611"is at%sbut expected%s",3612 update->refname,3613sha1_to_hex(lock->old_oid.hash),3614sha1_to_hex(update->old_sha1));3615return TRANSACTION_GENERIC_ERROR;3616}36173618}else{3619/*3620 * Create a new update for the reference this3621 * symref is pointing at. Also, we will record3622 * and verify old_sha1 for this update as part3623 * of processing the split-off update, so we3624 * don't have to do it here.3625 */3626 ret =split_symref_update(update, referent.buf, transaction,3627 affected_refnames, err);3628if(ret)3629return ret;3630}3631}else{3632struct ref_update *parent_update;36333634/*3635 * If this update is happening indirectly because of a3636 * symref update, record the old SHA-1 in the parent3637 * update:3638 */3639for(parent_update = update->parent_update;3640 parent_update;3641 parent_update = parent_update->parent_update) {3642oidcpy(&parent_update->lock->old_oid, &lock->old_oid);3643}36443645if((update->flags & REF_HAVE_OLD) &&3646hashcmp(lock->old_oid.hash, update->old_sha1)) {3647if(is_null_sha1(update->old_sha1))3648strbuf_addf(err,"cannot lock ref '%s': reference already exists",3649original_update_refname(update));3650else3651strbuf_addf(err,"cannot lock ref '%s': is at%sbut expected%s",3652original_update_refname(update),3653sha1_to_hex(lock->old_oid.hash),3654sha1_to_hex(update->old_sha1));36553656return TRANSACTION_GENERIC_ERROR;3657}3658}36593660if((update->flags & REF_HAVE_NEW) &&3661!(update->flags & REF_DELETING) &&3662!(update->flags & REF_LOG_ONLY)) {3663if(!(update->type & REF_ISSYMREF) &&3664!hashcmp(lock->old_oid.hash, update->new_sha1)) {3665/*3666 * The reference already has the desired3667 * value, so we don't need to write it.3668 */3669}else if(write_ref_to_lockfile(lock, update->new_sha1,3670 err)) {3671char*write_err =strbuf_detach(err, NULL);36723673/*3674 * The lock was freed upon failure of3675 * write_ref_to_lockfile():3676 */3677 update->lock = NULL;3678strbuf_addf(err,3679"cannot update the ref '%s':%s",3680 update->refname, write_err);3681free(write_err);3682return TRANSACTION_GENERIC_ERROR;3683}else{3684 update->flags |= REF_NEEDS_COMMIT;3685}3686}3687if(!(update->flags & REF_NEEDS_COMMIT)) {3688/*3689 * We didn't call write_ref_to_lockfile(), so3690 * the lockfile is still open. Close it to3691 * free up the file descriptor:3692 */3693if(close_ref(lock)) {3694strbuf_addf(err,"couldn't close '%s.lock'",3695 update->refname);3696return TRANSACTION_GENERIC_ERROR;3697}3698}3699return0;3700}37013702intref_transaction_commit(struct ref_transaction *transaction,3703struct strbuf *err)3704{3705struct files_ref_store *refs =3706get_files_ref_store(NULL,"ref_transaction_commit");3707int ret =0, i;3708struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3709struct string_list_item *ref_to_delete;3710struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3711char*head_ref = NULL;3712int head_type;3713struct object_id head_oid;37143715assert(err);37163717if(transaction->state != REF_TRANSACTION_OPEN)3718die("BUG: commit called for transaction that is not open");37193720if(!transaction->nr) {3721 transaction->state = REF_TRANSACTION_CLOSED;3722return0;3723}37243725/*3726 * Fail if a refname appears more than once in the3727 * transaction. (If we end up splitting up any updates using3728 * split_symref_update() or split_head_update(), those3729 * functions will check that the new updates don't have the3730 * same refname as any existing ones.)3731 */3732for(i =0; i < transaction->nr; i++) {3733struct ref_update *update = transaction->updates[i];3734struct string_list_item *item =3735string_list_append(&affected_refnames, update->refname);37363737/*3738 * We store a pointer to update in item->util, but at3739 * the moment we never use the value of this field3740 * except to check whether it is non-NULL.3741 */3742 item->util = update;3743}3744string_list_sort(&affected_refnames);3745if(ref_update_reject_duplicates(&affected_refnames, err)) {3746 ret = TRANSACTION_GENERIC_ERROR;3747goto cleanup;3748}37493750/*3751 * Special hack: If a branch is updated directly and HEAD3752 * points to it (may happen on the remote side of a push3753 * for example) then logically the HEAD reflog should be3754 * updated too.3755 *3756 * A generic solution would require reverse symref lookups,3757 * but finding all symrefs pointing to a given branch would be3758 * rather costly for this rare event (the direct update of a3759 * branch) to be worth it. So let's cheat and check with HEAD3760 * only, which should cover 99% of all usage scenarios (even3761 * 100% of the default ones).3762 *3763 * So if HEAD is a symbolic reference, then record the name of3764 * the reference that it points to. If we see an update of3765 * head_ref within the transaction, then split_head_update()3766 * arranges for the reflog of HEAD to be updated, too.3767 */3768 head_ref =resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3769 head_oid.hash, &head_type);37703771if(head_ref && !(head_type & REF_ISSYMREF)) {3772free(head_ref);3773 head_ref = NULL;3774}37753776/*3777 * Acquire all locks, verify old values if provided, check3778 * that new values are valid, and write new values to the3779 * lockfiles, ready to be activated. Only keep one lockfile3780 * open at a time to avoid running out of file descriptors.3781 */3782for(i =0; i < transaction->nr; i++) {3783struct ref_update *update = transaction->updates[i];37843785 ret =lock_ref_for_update(update, transaction, head_ref,3786&affected_refnames, err);3787if(ret)3788goto cleanup;3789}37903791/* Perform updates first so live commits remain referenced */3792for(i =0; i < transaction->nr; i++) {3793struct ref_update *update = transaction->updates[i];3794struct ref_lock *lock = update->lock;37953796if(update->flags & REF_NEEDS_COMMIT ||3797 update->flags & REF_LOG_ONLY) {3798if(log_ref_write(lock->ref_name, lock->old_oid.hash,3799 update->new_sha1,3800 update->msg, update->flags, err)) {3801char*old_msg =strbuf_detach(err, NULL);38023803strbuf_addf(err,"cannot update the ref '%s':%s",3804 lock->ref_name, old_msg);3805free(old_msg);3806unlock_ref(lock);3807 update->lock = NULL;3808 ret = TRANSACTION_GENERIC_ERROR;3809goto cleanup;3810}3811}3812if(update->flags & REF_NEEDS_COMMIT) {3813clear_loose_ref_cache(refs);3814if(commit_ref(lock)) {3815strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3816unlock_ref(lock);3817 update->lock = NULL;3818 ret = TRANSACTION_GENERIC_ERROR;3819goto cleanup;3820}3821}3822}3823/* Perform deletes now that updates are safely completed */3824for(i =0; i < transaction->nr; i++) {3825struct ref_update *update = transaction->updates[i];38263827if(update->flags & REF_DELETING &&3828!(update->flags & REF_LOG_ONLY)) {3829if(delete_ref_loose(update->lock, update->type, err)) {3830 ret = TRANSACTION_GENERIC_ERROR;3831goto cleanup;3832}38333834if(!(update->flags & REF_ISPRUNING))3835string_list_append(&refs_to_delete,3836 update->lock->ref_name);3837}3838}38393840if(repack_without_refs(&refs_to_delete, err)) {3841 ret = TRANSACTION_GENERIC_ERROR;3842goto cleanup;3843}3844for_each_string_list_item(ref_to_delete, &refs_to_delete)3845unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3846clear_loose_ref_cache(refs);38473848cleanup:3849 transaction->state = REF_TRANSACTION_CLOSED;38503851for(i =0; i < transaction->nr; i++)3852if(transaction->updates[i]->lock)3853unlock_ref(transaction->updates[i]->lock);3854string_list_clear(&refs_to_delete,0);3855free(head_ref);3856string_list_clear(&affected_refnames,0);38573858return ret;3859}38603861static intref_present(const char*refname,3862const struct object_id *oid,int flags,void*cb_data)3863{3864struct string_list *affected_refnames = cb_data;38653866returnstring_list_has_string(affected_refnames, refname);3867}38683869intinitial_ref_transaction_commit(struct ref_transaction *transaction,3870struct strbuf *err)3871{3872int ret =0, i;3873struct string_list affected_refnames = STRING_LIST_INIT_NODUP;38743875assert(err);38763877if(transaction->state != REF_TRANSACTION_OPEN)3878die("BUG: commit called for transaction that is not open");38793880/* Fail if a refname appears more than once in the transaction: */3881for(i =0; i < transaction->nr; i++)3882string_list_append(&affected_refnames,3883 transaction->updates[i]->refname);3884string_list_sort(&affected_refnames);3885if(ref_update_reject_duplicates(&affected_refnames, err)) {3886 ret = TRANSACTION_GENERIC_ERROR;3887goto cleanup;3888}38893890/*3891 * It's really undefined to call this function in an active3892 * repository or when there are existing references: we are3893 * only locking and changing packed-refs, so (1) any3894 * simultaneous processes might try to change a reference at3895 * the same time we do, and (2) any existing loose versions of3896 * the references that we are setting would have precedence3897 * over our values. But some remote helpers create the remote3898 * "HEAD" and "master" branches before calling this function,3899 * so here we really only check that none of the references3900 * that we are creating already exists.3901 */3902if(for_each_rawref(ref_present, &affected_refnames))3903die("BUG: initial ref transaction called with existing refs");39043905for(i =0; i < transaction->nr; i++) {3906struct ref_update *update = transaction->updates[i];39073908if((update->flags & REF_HAVE_OLD) &&3909!is_null_sha1(update->old_sha1))3910die("BUG: initial ref transaction with old_sha1 set");3911if(verify_refname_available(update->refname,3912&affected_refnames, NULL,3913 err)) {3914 ret = TRANSACTION_NAME_CONFLICT;3915goto cleanup;3916}3917}39183919if(lock_packed_refs(0)) {3920strbuf_addf(err,"unable to lock packed-refs file:%s",3921strerror(errno));3922 ret = TRANSACTION_GENERIC_ERROR;3923goto cleanup;3924}39253926for(i =0; i < transaction->nr; i++) {3927struct ref_update *update = transaction->updates[i];39283929if((update->flags & REF_HAVE_NEW) &&3930!is_null_sha1(update->new_sha1))3931add_packed_ref(update->refname, update->new_sha1);3932}39333934if(commit_packed_refs()) {3935strbuf_addf(err,"unable to commit packed-refs file:%s",3936strerror(errno));3937 ret = TRANSACTION_GENERIC_ERROR;3938goto cleanup;3939}39403941cleanup:3942 transaction->state = REF_TRANSACTION_CLOSED;3943string_list_clear(&affected_refnames,0);3944return ret;3945}39463947struct expire_reflog_cb {3948unsigned int flags;3949 reflog_expiry_should_prune_fn *should_prune_fn;3950void*policy_cb;3951FILE*newlog;3952unsigned char last_kept_sha1[20];3953};39543955static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3956const char*email,unsigned long timestamp,int tz,3957const char*message,void*cb_data)3958{3959struct expire_reflog_cb *cb = cb_data;3960struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;39613962if(cb->flags & EXPIRE_REFLOGS_REWRITE)3963 osha1 = cb->last_kept_sha1;39643965if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3966 message, policy_cb)) {3967if(!cb->newlog)3968printf("would prune%s", message);3969else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3970printf("prune%s", message);3971}else{3972if(cb->newlog) {3973fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3974sha1_to_hex(osha1),sha1_to_hex(nsha1),3975 email, timestamp, tz, message);3976hashcpy(cb->last_kept_sha1, nsha1);3977}3978if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3979printf("keep%s", message);3980}3981return0;3982}39833984intreflog_expire(const char*refname,const unsigned char*sha1,3985unsigned int flags,3986 reflog_expiry_prepare_fn prepare_fn,3987 reflog_expiry_should_prune_fn should_prune_fn,3988 reflog_expiry_cleanup_fn cleanup_fn,3989void*policy_cb_data)3990{3991static struct lock_file reflog_lock;3992struct expire_reflog_cb cb;3993struct ref_lock *lock;3994char*log_file;3995int status =0;3996int type;3997struct strbuf err = STRBUF_INIT;39983999memset(&cb,0,sizeof(cb));4000 cb.flags = flags;4001 cb.policy_cb = policy_cb_data;4002 cb.should_prune_fn = should_prune_fn;40034004/*4005 * The reflog file is locked by holding the lock on the4006 * reference itself, plus we might need to update the4007 * reference if --updateref was specified:4008 */4009 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,4010&type, &err);4011if(!lock) {4012error("cannot lock ref '%s':%s", refname, err.buf);4013strbuf_release(&err);4014return-1;4015}4016if(!reflog_exists(refname)) {4017unlock_ref(lock);4018return0;4019}40204021 log_file =git_pathdup("logs/%s", refname);4022if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4023/*4024 * Even though holding $GIT_DIR/logs/$reflog.lock has4025 * no locking implications, we use the lock_file4026 * machinery here anyway because it does a lot of the4027 * work we need, including cleaning up if the program4028 * exits unexpectedly.4029 */4030if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4031struct strbuf err = STRBUF_INIT;4032unable_to_lock_message(log_file, errno, &err);4033error("%s", err.buf);4034strbuf_release(&err);4035goto failure;4036}4037 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4038if(!cb.newlog) {4039error("cannot fdopen%s(%s)",4040get_lock_file_path(&reflog_lock),strerror(errno));4041goto failure;4042}4043}40444045(*prepare_fn)(refname, sha1, cb.policy_cb);4046for_each_reflog_ent(refname, expire_reflog_ent, &cb);4047(*cleanup_fn)(cb.policy_cb);40484049if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4050/*4051 * It doesn't make sense to adjust a reference pointed4052 * to by a symbolic ref based on expiring entries in4053 * the symbolic reference's reflog. Nor can we update4054 * a reference if there are no remaining reflog4055 * entries.4056 */4057int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4058!(type & REF_ISSYMREF) &&4059!is_null_sha1(cb.last_kept_sha1);40604061if(close_lock_file(&reflog_lock)) {4062 status |=error("couldn't write%s:%s", log_file,4063strerror(errno));4064}else if(update &&4065(write_in_full(get_lock_file_fd(lock->lk),4066sha1_to_hex(cb.last_kept_sha1),40) !=40||4067write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||4068close_ref(lock) <0)) {4069 status |=error("couldn't write%s",4070get_lock_file_path(lock->lk));4071rollback_lock_file(&reflog_lock);4072}else if(commit_lock_file(&reflog_lock)) {4073 status |=error("unable to write reflog '%s' (%s)",4074 log_file,strerror(errno));4075}else if(update &&commit_ref(lock)) {4076 status |=error("couldn't set%s", lock->ref_name);4077}4078}4079free(log_file);4080unlock_ref(lock);4081return status;40824083 failure:4084rollback_lock_file(&reflog_lock);4085free(log_file);4086unlock_ref(lock);4087return-1;4088}40894090struct ref_storage_be refs_be_files = {4091 NULL,4092"files",4093 files_ref_store_create4094};