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 ref_cache; 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 ref_cache that contains this ref_dir. */ 82struct ref_cache *ref_cache; 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 ref_cache *ref_cache, 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_cache, 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 ref_cache *ref_cache, 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_cache = ref_cache; 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_cache, 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 ref_cache::packed if any. The 891 * data will not be freed as long as the reference count is 892 * 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 */ 913static struct ref_cache { 914struct ref_cache *next; 915struct ref_entry *loose; 916struct packed_ref_cache *packed; 917/* 918 * The submodule name, or "" for the main repo. We allocate 919 * length 1 rather than FLEX_ARRAY so that the main ref_cache 920 * is initialized correctly. 921 */ 922char name[1]; 923} ref_cache, *submodule_ref_caches; 924 925/* Lock used for the main packed-refs file: */ 926static struct lock_file packlock; 927 928/* 929 * Increment the reference count of *packed_refs. 930 */ 931static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 932{ 933 packed_refs->referrers++; 934} 935 936/* 937 * Decrease the reference count of *packed_refs. If it goes to zero, 938 * free *packed_refs and return true; otherwise return false. 939 */ 940static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs) 941{ 942if(!--packed_refs->referrers) { 943free_ref_entry(packed_refs->root); 944stat_validity_clear(&packed_refs->validity); 945free(packed_refs); 946return1; 947}else{ 948return0; 949} 950} 951 952static voidclear_packed_ref_cache(struct ref_cache *refs) 953{ 954if(refs->packed) { 955struct packed_ref_cache *packed_refs = refs->packed; 956 957if(packed_refs->lock) 958die("internal error: packed-ref cache cleared while locked"); 959 refs->packed = NULL; 960release_packed_ref_cache(packed_refs); 961} 962} 963 964static voidclear_loose_ref_cache(struct ref_cache *refs) 965{ 966if(refs->loose) { 967free_ref_entry(refs->loose); 968 refs->loose = NULL; 969} 970} 971 972/* 973 * Create a new submodule ref cache and add it to the internal 974 * set of caches. 975 */ 976static struct ref_cache *create_ref_cache(const char*submodule) 977{ 978struct ref_cache *refs; 979if(!submodule) 980 submodule =""; 981FLEX_ALLOC_STR(refs, name, submodule); 982 refs->next = submodule_ref_caches; 983 submodule_ref_caches = refs; 984return refs; 985} 986 987static struct ref_cache *lookup_ref_cache(const char*submodule) 988{ 989struct ref_cache *refs; 990 991if(!submodule || !*submodule) 992return&ref_cache; 993 994for(refs = submodule_ref_caches; refs; refs = refs->next) 995if(!strcmp(submodule, refs->name)) 996return refs; 997return NULL; 998} 9991000/*1001 * Return a pointer to a ref_cache for the specified submodule. For1002 * the main repository, use submodule==NULL; such a call cannot fail.1003 * For a submodule, the submodule must exist and be a nonbare1004 * repository, otherwise return NULL.1005 *1006 * The returned structure will be allocated and initialized but not1007 * necessarily populated; it should not be freed.1008 */1009static struct ref_cache *get_ref_cache(const char*submodule)1010{1011struct ref_cache *refs =lookup_ref_cache(submodule);10121013if(!refs) {1014struct strbuf submodule_sb = STRBUF_INIT;10151016strbuf_addstr(&submodule_sb, submodule);1017if(is_nonbare_repository_dir(&submodule_sb))1018 refs =create_ref_cache(submodule);1019strbuf_release(&submodule_sb);1020}10211022return refs;1023}10241025/* The length of a peeled reference line in packed-refs, including EOL: */1026#define PEELED_LINE_LENGTH 4210271028/*1029 * The packed-refs header line that we write out. Perhaps other1030 * traits will be added later. The trailing space is required.1031 */1032static const char PACKED_REFS_HEADER[] =1033"# pack-refs with: peeled fully-peeled\n";10341035/*1036 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1037 * Return a pointer to the refname within the line (null-terminated),1038 * or NULL if there was a problem.1039 */1040static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1)1041{1042const char*ref;10431044/*1045 * 42: the answer to everything.1046 *1047 * In this case, it happens to be the answer to1048 * 40 (length of sha1 hex representation)1049 * +1 (space in between hex and name)1050 * +1 (newline at the end of the line)1051 */1052if(line->len <=42)1053return NULL;10541055if(get_sha1_hex(line->buf, sha1) <0)1056return NULL;1057if(!isspace(line->buf[40]))1058return NULL;10591060 ref = line->buf +41;1061if(isspace(*ref))1062return NULL;10631064if(line->buf[line->len -1] !='\n')1065return NULL;1066 line->buf[--line->len] =0;10671068return ref;1069}10701071/*1072 * Read f, which is a packed-refs file, into dir.1073 *1074 * A comment line of the form "# pack-refs with: " may contain zero or1075 * more traits. We interpret the traits as follows:1076 *1077 * No traits:1078 *1079 * Probably no references are peeled. But if the file contains a1080 * peeled value for a reference, we will use it.1081 *1082 * peeled:1083 *1084 * References under "refs/tags/", if they *can* be peeled, *are*1085 * peeled in this file. References outside of "refs/tags/" are1086 * probably not peeled even if they could have been, but if we find1087 * a peeled value for such a reference we will use it.1088 *1089 * fully-peeled:1090 *1091 * All references in the file that can be peeled are peeled.1092 * Inversely (and this is more important), any references in the1093 * file for which no peeled value is recorded is not peelable. This1094 * trait should typically be written alongside "peeled" for1095 * compatibility with older clients, but we do not require it1096 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1097 */1098static voidread_packed_refs(FILE*f,struct ref_dir *dir)1099{1100struct ref_entry *last = NULL;1101struct strbuf line = STRBUF_INIT;1102enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;11031104while(strbuf_getwholeline(&line, f,'\n') != EOF) {1105unsigned char sha1[20];1106const char*refname;1107const char*traits;11081109if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1110if(strstr(traits," fully-peeled "))1111 peeled = PEELED_FULLY;1112else if(strstr(traits," peeled "))1113 peeled = PEELED_TAGS;1114/* perhaps other traits later as well */1115continue;1116}11171118 refname =parse_ref_line(&line, sha1);1119if(refname) {1120int flag = REF_ISPACKED;11211122if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1123if(!refname_is_safe(refname))1124die("packed refname is dangerous:%s", refname);1125hashclr(sha1);1126 flag |= REF_BAD_NAME | REF_ISBROKEN;1127}1128 last =create_ref_entry(refname, sha1, flag,0);1129if(peeled == PEELED_FULLY ||1130(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1131 last->flag |= REF_KNOWS_PEELED;1132add_ref(dir, last);1133continue;1134}1135if(last &&1136 line.buf[0] =='^'&&1137 line.len == PEELED_LINE_LENGTH &&1138 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1139!get_sha1_hex(line.buf +1, sha1)) {1140hashcpy(last->u.value.peeled.hash, sha1);1141/*1142 * Regardless of what the file header said,1143 * we definitely know the value of *this*1144 * reference:1145 */1146 last->flag |= REF_KNOWS_PEELED;1147}1148}11491150strbuf_release(&line);1151}11521153/*1154 * Get the packed_ref_cache for the specified ref_cache, creating it1155 * if necessary.1156 */1157static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1158{1159char*packed_refs_file;11601161if(*refs->name)1162 packed_refs_file =git_pathdup_submodule(refs->name,"packed-refs");1163else1164 packed_refs_file =git_pathdup("packed-refs");11651166if(refs->packed &&1167!stat_validity_check(&refs->packed->validity, packed_refs_file))1168clear_packed_ref_cache(refs);11691170if(!refs->packed) {1171FILE*f;11721173 refs->packed =xcalloc(1,sizeof(*refs->packed));1174acquire_packed_ref_cache(refs->packed);1175 refs->packed->root =create_dir_entry(refs,"",0,0);1176 f =fopen(packed_refs_file,"r");1177if(f) {1178stat_validity_update(&refs->packed->validity,fileno(f));1179read_packed_refs(f,get_ref_dir(refs->packed->root));1180fclose(f);1181}1182}1183free(packed_refs_file);1184return refs->packed;1185}11861187static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1188{1189returnget_ref_dir(packed_ref_cache->root);1190}11911192static struct ref_dir *get_packed_refs(struct ref_cache *refs)1193{1194returnget_packed_ref_dir(get_packed_ref_cache(refs));1195}11961197/*1198 * Add a reference to the in-memory packed reference cache. This may1199 * only be called while the packed-refs file is locked (see1200 * lock_packed_refs()). To actually write the packed-refs file, call1201 * commit_packed_refs().1202 */1203static voidadd_packed_ref(const char*refname,const unsigned char*sha1)1204{1205struct packed_ref_cache *packed_ref_cache =1206get_packed_ref_cache(&ref_cache);12071208if(!packed_ref_cache->lock)1209die("internal error: packed refs not locked");1210add_ref(get_packed_ref_dir(packed_ref_cache),1211create_ref_entry(refname, sha1, REF_ISPACKED,1));1212}12131214/*1215 * Read the loose references from the namespace dirname into dir1216 * (without recursing). dirname must end with '/'. dir must be the1217 * directory entry corresponding to dirname.1218 */1219static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1220{1221struct ref_cache *refs = dir->ref_cache;1222DIR*d;1223struct dirent *de;1224int dirnamelen =strlen(dirname);1225struct strbuf refname;1226struct strbuf path = STRBUF_INIT;1227size_t path_baselen;12281229if(*refs->name)1230strbuf_git_path_submodule(&path, refs->name,"%s", dirname);1231else1232strbuf_git_path(&path,"%s", dirname);1233 path_baselen = path.len;12341235 d =opendir(path.buf);1236if(!d) {1237strbuf_release(&path);1238return;1239}12401241strbuf_init(&refname, dirnamelen +257);1242strbuf_add(&refname, dirname, dirnamelen);12431244while((de =readdir(d)) != NULL) {1245unsigned char sha1[20];1246struct stat st;1247int flag;12481249if(de->d_name[0] =='.')1250continue;1251if(ends_with(de->d_name,".lock"))1252continue;1253strbuf_addstr(&refname, de->d_name);1254strbuf_addstr(&path, de->d_name);1255if(stat(path.buf, &st) <0) {1256;/* silently ignore */1257}else if(S_ISDIR(st.st_mode)) {1258strbuf_addch(&refname,'/');1259add_entry_to_dir(dir,1260create_dir_entry(refs, refname.buf,1261 refname.len,1));1262}else{1263int read_ok;12641265if(*refs->name) {1266hashclr(sha1);1267 flag =0;1268 read_ok = !resolve_gitlink_ref(refs->name,1269 refname.buf, sha1);1270}else{1271 read_ok = !read_ref_full(refname.buf,1272 RESOLVE_REF_READING,1273 sha1, &flag);1274}12751276if(!read_ok) {1277hashclr(sha1);1278 flag |= REF_ISBROKEN;1279}else if(is_null_sha1(sha1)) {1280/*1281 * It is so astronomically unlikely1282 * that NULL_SHA1 is the SHA-1 of an1283 * actual object that we consider its1284 * appearance in a loose reference1285 * file to be repo corruption1286 * (probably due to a software bug).1287 */1288 flag |= REF_ISBROKEN;1289}12901291if(check_refname_format(refname.buf,1292 REFNAME_ALLOW_ONELEVEL)) {1293if(!refname_is_safe(refname.buf))1294die("loose refname is dangerous:%s", refname.buf);1295hashclr(sha1);1296 flag |= REF_BAD_NAME | REF_ISBROKEN;1297}1298add_entry_to_dir(dir,1299create_ref_entry(refname.buf, sha1, flag,0));1300}1301strbuf_setlen(&refname, dirnamelen);1302strbuf_setlen(&path, path_baselen);1303}1304strbuf_release(&refname);1305strbuf_release(&path);1306closedir(d);1307}13081309static struct ref_dir *get_loose_refs(struct ref_cache *refs)1310{1311if(!refs->loose) {1312/*1313 * Mark the top-level directory complete because we1314 * are about to read the only subdirectory that can1315 * hold references:1316 */1317 refs->loose =create_dir_entry(refs,"",0,0);1318/*1319 * Create an incomplete entry for "refs/":1320 */1321add_entry_to_dir(get_ref_dir(refs->loose),1322create_dir_entry(refs,"refs/",5,1));1323}1324returnget_ref_dir(refs->loose);1325}13261327#define MAXREFLEN (1024)13281329/*1330 * Called by resolve_gitlink_ref_recursive() after it failed to read1331 * from the loose refs in ref_cache refs. Find <refname> in the1332 * packed-refs file for the submodule.1333 */1334static intresolve_gitlink_packed_ref(struct ref_cache *refs,1335const char*refname,unsigned char*sha1)1336{1337struct ref_entry *ref;1338struct ref_dir *dir =get_packed_refs(refs);13391340 ref =find_ref(dir, refname);1341if(ref == NULL)1342return-1;13431344hashcpy(sha1, ref->u.value.oid.hash);1345return0;1346}13471348static intresolve_gitlink_ref_recursive(struct ref_cache *refs,1349const char*refname,unsigned char*sha1,1350int recursion)1351{1352int fd, len;1353char buffer[128], *p;1354char*path;13551356if(recursion > SYMREF_MAXDEPTH ||strlen(refname) > MAXREFLEN)1357return-1;1358 path = *refs->name1359?git_pathdup_submodule(refs->name,"%s", refname)1360:git_pathdup("%s", refname);1361 fd =open(path, O_RDONLY);1362free(path);1363if(fd <0)1364returnresolve_gitlink_packed_ref(refs, refname, sha1);13651366 len =read(fd, buffer,sizeof(buffer)-1);1367close(fd);1368if(len <0)1369return-1;1370while(len &&isspace(buffer[len-1]))1371 len--;1372 buffer[len] =0;13731374/* Was it a detached head or an old-fashioned symlink? */1375if(!get_sha1_hex(buffer, sha1))1376return0;13771378/* Symref? */1379if(strncmp(buffer,"ref:",4))1380return-1;1381 p = buffer +4;1382while(isspace(*p))1383 p++;13841385returnresolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1386}13871388intresolve_gitlink_ref(const char*path,const char*refname,unsigned char*sha1)1389{1390int len =strlen(path), retval;1391struct strbuf submodule = STRBUF_INIT;1392struct ref_cache *refs;13931394while(len && path[len-1] =='/')1395 len--;1396if(!len)1397return-1;13981399strbuf_add(&submodule, path, len);1400 refs =get_ref_cache(submodule.buf);1401if(!refs) {1402strbuf_release(&submodule);1403return-1;1404}1405strbuf_release(&submodule);14061407 retval =resolve_gitlink_ref_recursive(refs, refname, sha1,0);1408return retval;1409}14101411/*1412 * Return the ref_entry for the given refname from the packed1413 * references. If it does not exist, return NULL.1414 */1415static struct ref_entry *get_packed_ref(const char*refname)1416{1417returnfind_ref(get_packed_refs(&ref_cache), refname);1418}14191420/*1421 * A loose ref file doesn't exist; check for a packed ref.1422 */1423static intresolve_missing_loose_ref(const char*refname,1424unsigned char*sha1,1425unsigned int*flags)1426{1427struct ref_entry *entry;14281429/*1430 * The loose reference file does not exist; check for a packed1431 * reference.1432 */1433 entry =get_packed_ref(refname);1434if(entry) {1435hashcpy(sha1, entry->u.value.oid.hash);1436*flags |= REF_ISPACKED;1437return0;1438}1439/* refname is not a packed reference. */1440return-1;1441}14421443intread_raw_ref(const char*refname,unsigned char*sha1,1444struct strbuf *referent,unsigned int*type)1445{1446struct strbuf sb_contents = STRBUF_INIT;1447struct strbuf sb_path = STRBUF_INIT;1448const char*path;1449const char*buf;1450struct stat st;1451int fd;1452int ret = -1;1453int save_errno;1454int remaining_retries =3;14551456*type =0;1457strbuf_reset(&sb_path);1458strbuf_git_path(&sb_path,"%s", refname);1459 path = sb_path.buf;14601461stat_ref:1462/*1463 * We might have to loop back here to avoid a race1464 * condition: first we lstat() the file, then we try1465 * to read it as a link or as a file. But if somebody1466 * changes the type of the file (file <-> directory1467 * <-> symlink) between the lstat() and reading, then1468 * we don't want to report that as an error but rather1469 * try again starting with the lstat().1470 *1471 * We'll keep a count of the retries, though, just to avoid1472 * any confusing situation sending us into an infinite loop.1473 */14741475if(remaining_retries-- <=0)1476goto out;14771478if(lstat(path, &st) <0) {1479if(errno != ENOENT)1480goto out;1481if(resolve_missing_loose_ref(refname, sha1, type)) {1482 errno = ENOENT;1483goto out;1484}1485 ret =0;1486goto out;1487}14881489/* Follow "normalized" - ie "refs/.." symlinks by hand */1490if(S_ISLNK(st.st_mode)) {1491strbuf_reset(&sb_contents);1492if(strbuf_readlink(&sb_contents, path,0) <0) {1493if(errno == ENOENT || errno == EINVAL)1494/* inconsistent with lstat; retry */1495goto stat_ref;1496else1497goto out;1498}1499if(starts_with(sb_contents.buf,"refs/") &&1500!check_refname_format(sb_contents.buf,0)) {1501strbuf_swap(&sb_contents, referent);1502*type |= REF_ISSYMREF;1503 ret =0;1504goto out;1505}1506/*1507 * It doesn't look like a refname; fall through to just1508 * treating it like a non-symlink, and reading whatever it1509 * points to.1510 */1511}15121513/* Is it a directory? */1514if(S_ISDIR(st.st_mode)) {1515/*1516 * Even though there is a directory where the loose1517 * ref is supposed to be, there could still be a1518 * packed ref:1519 */1520if(resolve_missing_loose_ref(refname, sha1, type)) {1521 errno = EISDIR;1522goto out;1523}1524 ret =0;1525goto out;1526}15271528/*1529 * Anything else, just open it and try to use it as1530 * a ref1531 */1532 fd =open(path, O_RDONLY);1533if(fd <0) {1534if(errno == ENOENT && !S_ISLNK(st.st_mode))1535/* inconsistent with lstat; retry */1536goto stat_ref;1537else1538goto out;1539}1540strbuf_reset(&sb_contents);1541if(strbuf_read(&sb_contents, fd,256) <0) {1542int save_errno = errno;1543close(fd);1544 errno = save_errno;1545goto out;1546}1547close(fd);1548strbuf_rtrim(&sb_contents);1549 buf = sb_contents.buf;1550if(starts_with(buf,"ref:")) {1551 buf +=4;1552while(isspace(*buf))1553 buf++;15541555strbuf_reset(referent);1556strbuf_addstr(referent, buf);1557*type |= REF_ISSYMREF;1558 ret =0;1559goto out;1560}15611562/*1563 * Please note that FETCH_HEAD has additional1564 * data after the sha.1565 */1566if(get_sha1_hex(buf, sha1) ||1567(buf[40] !='\0'&& !isspace(buf[40]))) {1568*type |= REF_ISBROKEN;1569 errno = EINVAL;1570goto out;1571}15721573 ret =0;15741575out:1576 save_errno = errno;1577strbuf_release(&sb_path);1578strbuf_release(&sb_contents);1579 errno = save_errno;1580return ret;1581}15821583static voidunlock_ref(struct ref_lock *lock)1584{1585/* Do not free lock->lk -- atexit() still looks at them */1586if(lock->lk)1587rollback_lock_file(lock->lk);1588free(lock->ref_name);1589free(lock);1590}15911592/*1593 * Lock refname, without following symrefs, and set *lock_p to point1594 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1595 * and type similarly to read_raw_ref().1596 *1597 * The caller must verify that refname is a "safe" reference name (in1598 * the sense of refname_is_safe()) before calling this function.1599 *1600 * If the reference doesn't already exist, verify that refname doesn't1601 * have a D/F conflict with any existing references. extras and skip1602 * are passed to verify_refname_available_dir() for this check.1603 *1604 * If mustexist is not set and the reference is not found or is1605 * broken, lock the reference anyway but clear sha1.1606 *1607 * Return 0 on success. On failure, write an error message to err and1608 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1609 *1610 * Implementation note: This function is basically1611 *1612 * lock reference1613 * read_raw_ref()1614 *1615 * but it includes a lot more code to1616 * - Deal with possible races with other processes1617 * - Avoid calling verify_refname_available_dir() when it can be1618 * avoided, namely if we were successfully able to read the ref1619 * - Generate informative error messages in the case of failure1620 */1621static intlock_raw_ref(const char*refname,int mustexist,1622const struct string_list *extras,1623const struct string_list *skip,1624struct ref_lock **lock_p,1625struct strbuf *referent,1626unsigned int*type,1627struct strbuf *err)1628{1629struct ref_lock *lock;1630struct strbuf ref_file = STRBUF_INIT;1631int attempts_remaining =3;1632int ret = TRANSACTION_GENERIC_ERROR;16331634assert(err);1635*type =0;16361637/* First lock the file so it can't change out from under us. */16381639*lock_p = lock =xcalloc(1,sizeof(*lock));16401641 lock->ref_name =xstrdup(refname);1642strbuf_git_path(&ref_file,"%s", refname);16431644retry:1645switch(safe_create_leading_directories(ref_file.buf)) {1646case SCLD_OK:1647break;/* success */1648case SCLD_EXISTS:1649/*1650 * Suppose refname is "refs/foo/bar". We just failed1651 * to create the containing directory, "refs/foo",1652 * because there was a non-directory in the way. This1653 * indicates a D/F conflict, probably because of1654 * another reference such as "refs/foo". There is no1655 * reason to expect this error to be transitory.1656 */1657if(verify_refname_available(refname, extras, skip, err)) {1658if(mustexist) {1659/*1660 * To the user the relevant error is1661 * that the "mustexist" reference is1662 * missing:1663 */1664strbuf_reset(err);1665strbuf_addf(err,"unable to resolve reference '%s'",1666 refname);1667}else{1668/*1669 * The error message set by1670 * verify_refname_available_dir() is OK.1671 */1672 ret = TRANSACTION_NAME_CONFLICT;1673}1674}else{1675/*1676 * The file that is in the way isn't a loose1677 * reference. Report it as a low-level1678 * failure.1679 */1680strbuf_addf(err,"unable to create lock file%s.lock; "1681"non-directory in the way",1682 ref_file.buf);1683}1684goto error_return;1685case SCLD_VANISHED:1686/* Maybe another process was tidying up. Try again. */1687if(--attempts_remaining >0)1688goto retry;1689/* fall through */1690default:1691strbuf_addf(err,"unable to create directory for%s",1692 ref_file.buf);1693goto error_return;1694}16951696if(!lock->lk)1697 lock->lk =xcalloc(1,sizeof(struct lock_file));16981699if(hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) <0) {1700if(errno == ENOENT && --attempts_remaining >0) {1701/*1702 * Maybe somebody just deleted one of the1703 * directories leading to ref_file. Try1704 * again:1705 */1706goto retry;1707}else{1708unable_to_lock_message(ref_file.buf, errno, err);1709goto error_return;1710}1711}17121713/*1714 * Now we hold the lock and can read the reference without1715 * fear that its value will change.1716 */17171718if(read_raw_ref(refname, lock->old_oid.hash, referent, type)) {1719if(errno == ENOENT) {1720if(mustexist) {1721/* Garden variety missing reference. */1722strbuf_addf(err,"unable to resolve reference '%s'",1723 refname);1724goto error_return;1725}else{1726/*1727 * Reference is missing, but that's OK. We1728 * know that there is not a conflict with1729 * another loose reference because1730 * (supposing that we are trying to lock1731 * reference "refs/foo/bar"):1732 *1733 * - We were successfully able to create1734 * the lockfile refs/foo/bar.lock, so we1735 * know there cannot be a loose reference1736 * named "refs/foo".1737 *1738 * - We got ENOENT and not EISDIR, so we1739 * know that there cannot be a loose1740 * reference named "refs/foo/bar/baz".1741 */1742}1743}else if(errno == EISDIR) {1744/*1745 * There is a directory in the way. It might have1746 * contained references that have been deleted. If1747 * we don't require that the reference already1748 * exists, try to remove the directory so that it1749 * doesn't cause trouble when we want to rename the1750 * lockfile into place later.1751 */1752if(mustexist) {1753/* Garden variety missing reference. */1754strbuf_addf(err,"unable to resolve reference '%s'",1755 refname);1756goto error_return;1757}else if(remove_dir_recursively(&ref_file,1758 REMOVE_DIR_EMPTY_ONLY)) {1759if(verify_refname_available_dir(1760 refname, extras, skip,1761get_loose_refs(&ref_cache),1762 err)) {1763/*1764 * The error message set by1765 * verify_refname_available() is OK.1766 */1767 ret = TRANSACTION_NAME_CONFLICT;1768goto error_return;1769}else{1770/*1771 * We can't delete the directory,1772 * but we also don't know of any1773 * references that it should1774 * contain.1775 */1776strbuf_addf(err,"there is a non-empty directory '%s' "1777"blocking reference '%s'",1778 ref_file.buf, refname);1779goto error_return;1780}1781}1782}else if(errno == EINVAL && (*type & REF_ISBROKEN)) {1783strbuf_addf(err,"unable to resolve reference '%s': "1784"reference broken", refname);1785goto error_return;1786}else{1787strbuf_addf(err,"unable to resolve reference '%s':%s",1788 refname,strerror(errno));1789goto error_return;1790}17911792/*1793 * If the ref did not exist and we are creating it,1794 * make sure there is no existing packed ref whose1795 * name begins with our refname, nor a packed ref1796 * whose name is a proper prefix of our refname.1797 */1798if(verify_refname_available_dir(1799 refname, extras, skip,1800get_packed_refs(&ref_cache),1801 err)) {1802goto error_return;1803}1804}18051806 ret =0;1807goto out;18081809error_return:1810unlock_ref(lock);1811*lock_p = NULL;18121813out:1814strbuf_release(&ref_file);1815return ret;1816}18171818/*1819 * Peel the entry (if possible) and return its new peel_status. If1820 * repeel is true, re-peel the entry even if there is an old peeled1821 * value that is already stored in it.1822 *1823 * It is OK to call this function with a packed reference entry that1824 * might be stale and might even refer to an object that has since1825 * been garbage-collected. In such a case, if the entry has1826 * REF_KNOWS_PEELED then leave the status unchanged and return1827 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1828 */1829static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1830{1831enum peel_status status;18321833if(entry->flag & REF_KNOWS_PEELED) {1834if(repeel) {1835 entry->flag &= ~REF_KNOWS_PEELED;1836oidclr(&entry->u.value.peeled);1837}else{1838returnis_null_oid(&entry->u.value.peeled) ?1839 PEEL_NON_TAG : PEEL_PEELED;1840}1841}1842if(entry->flag & REF_ISBROKEN)1843return PEEL_BROKEN;1844if(entry->flag & REF_ISSYMREF)1845return PEEL_IS_SYMREF;18461847 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1848if(status == PEEL_PEELED || status == PEEL_NON_TAG)1849 entry->flag |= REF_KNOWS_PEELED;1850return status;1851}18521853intpeel_ref(const char*refname,unsigned char*sha1)1854{1855int flag;1856unsigned char base[20];18571858if(current_ref_iter && current_ref_iter->refname == refname) {1859struct object_id peeled;18601861if(ref_iterator_peel(current_ref_iter, &peeled))1862return-1;1863hashcpy(sha1, peeled.hash);1864return0;1865}18661867if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1868return-1;18691870/*1871 * If the reference is packed, read its ref_entry from the1872 * cache in the hope that we already know its peeled value.1873 * We only try this optimization on packed references because1874 * (a) forcing the filling of the loose reference cache could1875 * be expensive and (b) loose references anyway usually do not1876 * have REF_KNOWS_PEELED.1877 */1878if(flag & REF_ISPACKED) {1879struct ref_entry *r =get_packed_ref(refname);1880if(r) {1881if(peel_entry(r,0))1882return-1;1883hashcpy(sha1, r->u.value.peeled.hash);1884return0;1885}1886}18871888returnpeel_object(base, sha1);1889}18901891struct files_ref_iterator {1892struct ref_iterator base;18931894struct packed_ref_cache *packed_ref_cache;1895struct ref_iterator *iter0;1896unsigned int flags;1897};18981899static intfiles_ref_iterator_advance(struct ref_iterator *ref_iterator)1900{1901struct files_ref_iterator *iter =1902(struct files_ref_iterator *)ref_iterator;1903int ok;19041905while((ok =ref_iterator_advance(iter->iter0)) == ITER_OK) {1906if(!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&1907!ref_resolves_to_object(iter->iter0->refname,1908 iter->iter0->oid,1909 iter->iter0->flags))1910continue;19111912 iter->base.refname = iter->iter0->refname;1913 iter->base.oid = iter->iter0->oid;1914 iter->base.flags = iter->iter0->flags;1915return ITER_OK;1916}19171918 iter->iter0 = NULL;1919if(ref_iterator_abort(ref_iterator) != ITER_DONE)1920 ok = ITER_ERROR;19211922return ok;1923}19241925static intfiles_ref_iterator_peel(struct ref_iterator *ref_iterator,1926struct object_id *peeled)1927{1928struct files_ref_iterator *iter =1929(struct files_ref_iterator *)ref_iterator;19301931returnref_iterator_peel(iter->iter0, peeled);1932}19331934static intfiles_ref_iterator_abort(struct ref_iterator *ref_iterator)1935{1936struct files_ref_iterator *iter =1937(struct files_ref_iterator *)ref_iterator;1938int ok = ITER_DONE;19391940if(iter->iter0)1941 ok =ref_iterator_abort(iter->iter0);19421943release_packed_ref_cache(iter->packed_ref_cache);1944base_ref_iterator_free(ref_iterator);1945return ok;1946}19471948static struct ref_iterator_vtable files_ref_iterator_vtable = {1949 files_ref_iterator_advance,1950 files_ref_iterator_peel,1951 files_ref_iterator_abort1952};19531954struct ref_iterator *files_ref_iterator_begin(1955const char*submodule,1956const char*prefix,unsigned int flags)1957{1958struct ref_cache *refs =get_ref_cache(submodule);1959struct ref_dir *loose_dir, *packed_dir;1960struct ref_iterator *loose_iter, *packed_iter;1961struct files_ref_iterator *iter;1962struct ref_iterator *ref_iterator;19631964if(!refs)1965returnempty_ref_iterator_begin();19661967if(ref_paranoia <0)1968 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1969if(ref_paranoia)1970 flags |= DO_FOR_EACH_INCLUDE_BROKEN;19711972 iter =xcalloc(1,sizeof(*iter));1973 ref_iterator = &iter->base;1974base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);19751976/*1977 * We must make sure that all loose refs are read before1978 * accessing the packed-refs file; this avoids a race1979 * condition if loose refs are migrated to the packed-refs1980 * file by a simultaneous process, but our in-memory view is1981 * from before the migration. We ensure this as follows:1982 * First, we call prime_ref_dir(), which pre-reads the loose1983 * references for the subtree into the cache. (If they've1984 * already been read, that's OK; we only need to guarantee1985 * that they're read before the packed refs, not *how much*1986 * before.) After that, we call get_packed_ref_cache(), which1987 * internally checks whether the packed-ref cache is up to1988 * date with what is on disk, and re-reads it if not.1989 */19901991 loose_dir =get_loose_refs(refs);19921993if(prefix && *prefix)1994 loose_dir =find_containing_dir(loose_dir, prefix,0);19951996if(loose_dir) {1997prime_ref_dir(loose_dir);1998 loose_iter =cache_ref_iterator_begin(loose_dir);1999}else{2000/* There's nothing to iterate over. */2001 loose_iter =empty_ref_iterator_begin();2002}20032004 iter->packed_ref_cache =get_packed_ref_cache(refs);2005acquire_packed_ref_cache(iter->packed_ref_cache);2006 packed_dir =get_packed_ref_dir(iter->packed_ref_cache);20072008if(prefix && *prefix)2009 packed_dir =find_containing_dir(packed_dir, prefix,0);20102011if(packed_dir) {2012 packed_iter =cache_ref_iterator_begin(packed_dir);2013}else{2014/* There's nothing to iterate over. */2015 packed_iter =empty_ref_iterator_begin();2016}20172018 iter->iter0 =overlay_ref_iterator_begin(loose_iter, packed_iter);2019 iter->flags = flags;20202021return ref_iterator;2022}20232024/*2025 * Verify that the reference locked by lock has the value old_sha1.2026 * Fail if the reference doesn't exist and mustexist is set. Return 02027 * on success. On error, write an error message to err, set errno, and2028 * return a negative value.2029 */2030static intverify_lock(struct ref_lock *lock,2031const unsigned char*old_sha1,int mustexist,2032struct strbuf *err)2033{2034assert(err);20352036if(read_ref_full(lock->ref_name,2037 mustexist ? RESOLVE_REF_READING :0,2038 lock->old_oid.hash, NULL)) {2039if(old_sha1) {2040int save_errno = errno;2041strbuf_addf(err,"can't verify ref '%s'", lock->ref_name);2042 errno = save_errno;2043return-1;2044}else{2045oidclr(&lock->old_oid);2046return0;2047}2048}2049if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {2050strbuf_addf(err,"ref '%s' is at%sbut expected%s",2051 lock->ref_name,2052oid_to_hex(&lock->old_oid),2053sha1_to_hex(old_sha1));2054 errno = EBUSY;2055return-1;2056}2057return0;2058}20592060static intremove_empty_directories(struct strbuf *path)2061{2062/*2063 * we want to create a file but there is a directory there;2064 * if that is an empty directory (or a directory that contains2065 * only empty directories), remove them.2066 */2067returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);2068}20692070/*2071 * Locks a ref returning the lock on success and NULL on failure.2072 * On failure errno is set to something meaningful.2073 */2074static struct ref_lock *lock_ref_sha1_basic(const char*refname,2075const unsigned char*old_sha1,2076const struct string_list *extras,2077const struct string_list *skip,2078unsigned int flags,int*type,2079struct strbuf *err)2080{2081struct strbuf ref_file = STRBUF_INIT;2082struct ref_lock *lock;2083int last_errno =0;2084int lflags = LOCK_NO_DEREF;2085int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2086int resolve_flags = RESOLVE_REF_NO_RECURSE;2087int attempts_remaining =3;2088int resolved;20892090assert(err);20912092 lock =xcalloc(1,sizeof(struct ref_lock));20932094if(mustexist)2095 resolve_flags |= RESOLVE_REF_READING;2096if(flags & REF_DELETING)2097 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;20982099strbuf_git_path(&ref_file,"%s", refname);2100 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2101 lock->old_oid.hash, type);2102if(!resolved && errno == EISDIR) {2103/*2104 * we are trying to lock foo but we used to2105 * have foo/bar which now does not exist;2106 * it is normal for the empty directory 'foo'2107 * to remain.2108 */2109if(remove_empty_directories(&ref_file)) {2110 last_errno = errno;2111if(!verify_refname_available_dir(refname, extras, skip,2112get_loose_refs(&ref_cache), err))2113strbuf_addf(err,"there are still refs under '%s'",2114 refname);2115goto error_return;2116}2117 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2118 lock->old_oid.hash, type);2119}2120if(!resolved) {2121 last_errno = errno;2122if(last_errno != ENOTDIR ||2123!verify_refname_available_dir(refname, extras, skip,2124get_loose_refs(&ref_cache), err))2125strbuf_addf(err,"unable to resolve reference '%s':%s",2126 refname,strerror(last_errno));21272128goto error_return;2129}21302131/*2132 * If the ref did not exist and we are creating it, make sure2133 * there is no existing packed ref whose name begins with our2134 * refname, nor a packed ref whose name is a proper prefix of2135 * our refname.2136 */2137if(is_null_oid(&lock->old_oid) &&2138verify_refname_available_dir(refname, extras, skip,2139get_packed_refs(&ref_cache), err)) {2140 last_errno = ENOTDIR;2141goto error_return;2142}21432144 lock->lk =xcalloc(1,sizeof(struct lock_file));21452146 lock->ref_name =xstrdup(refname);21472148 retry:2149switch(safe_create_leading_directories_const(ref_file.buf)) {2150case SCLD_OK:2151break;/* success */2152case SCLD_VANISHED:2153if(--attempts_remaining >0)2154goto retry;2155/* fall through */2156default:2157 last_errno = errno;2158strbuf_addf(err,"unable to create directory for '%s'",2159 ref_file.buf);2160goto error_return;2161}21622163if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {2164 last_errno = errno;2165if(errno == ENOENT && --attempts_remaining >0)2166/*2167 * Maybe somebody just deleted one of the2168 * directories leading to ref_file. Try2169 * again:2170 */2171goto retry;2172else{2173unable_to_lock_message(ref_file.buf, errno, err);2174goto error_return;2175}2176}2177if(verify_lock(lock, old_sha1, mustexist, err)) {2178 last_errno = errno;2179goto error_return;2180}2181goto out;21822183 error_return:2184unlock_ref(lock);2185 lock = NULL;21862187 out:2188strbuf_release(&ref_file);2189 errno = last_errno;2190return lock;2191}21922193/*2194 * Write an entry to the packed-refs file for the specified refname.2195 * If peeled is non-NULL, write it as the entry's peeled value.2196 */2197static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2198unsigned char*peeled)2199{2200fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2201if(peeled)2202fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2203}22042205/*2206 * An each_ref_entry_fn that writes the entry to a packed-refs file.2207 */2208static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2209{2210enum peel_status peel_status =peel_entry(entry,0);22112212if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2213error("internal error:%sis not a valid packed reference!",2214 entry->name);2215write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2216 peel_status == PEEL_PEELED ?2217 entry->u.value.peeled.hash : NULL);2218return0;2219}22202221/*2222 * Lock the packed-refs file for writing. Flags is passed to2223 * hold_lock_file_for_update(). Return 0 on success. On errors, set2224 * errno appropriately and return a nonzero value.2225 */2226static intlock_packed_refs(int flags)2227{2228static int timeout_configured =0;2229static int timeout_value =1000;22302231struct packed_ref_cache *packed_ref_cache;22322233if(!timeout_configured) {2234git_config_get_int("core.packedrefstimeout", &timeout_value);2235 timeout_configured =1;2236}22372238if(hold_lock_file_for_update_timeout(2239&packlock,git_path("packed-refs"),2240 flags, timeout_value) <0)2241return-1;2242/*2243 * Get the current packed-refs while holding the lock. If the2244 * packed-refs file has been modified since we last read it,2245 * this will automatically invalidate the cache and re-read2246 * the packed-refs file.2247 */2248 packed_ref_cache =get_packed_ref_cache(&ref_cache);2249 packed_ref_cache->lock = &packlock;2250/* Increment the reference count to prevent it from being freed: */2251acquire_packed_ref_cache(packed_ref_cache);2252return0;2253}22542255/*2256 * Write the current version of the packed refs cache from memory to2257 * disk. The packed-refs file must already be locked for writing (see2258 * lock_packed_refs()). Return zero on success. On errors, set errno2259 * and return a nonzero value2260 */2261static intcommit_packed_refs(void)2262{2263struct packed_ref_cache *packed_ref_cache =2264get_packed_ref_cache(&ref_cache);2265int error =0;2266int save_errno =0;2267FILE*out;22682269if(!packed_ref_cache->lock)2270die("internal error: packed-refs not locked");22712272 out =fdopen_lock_file(packed_ref_cache->lock,"w");2273if(!out)2274die_errno("unable to fdopen packed-refs descriptor");22752276fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2277do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),22780, write_packed_entry_fn, out);22792280if(commit_lock_file(packed_ref_cache->lock)) {2281 save_errno = errno;2282 error = -1;2283}2284 packed_ref_cache->lock = NULL;2285release_packed_ref_cache(packed_ref_cache);2286 errno = save_errno;2287return error;2288}22892290/*2291 * Rollback the lockfile for the packed-refs file, and discard the2292 * in-memory packed reference cache. (The packed-refs file will be2293 * read anew if it is needed again after this function is called.)2294 */2295static voidrollback_packed_refs(void)2296{2297struct packed_ref_cache *packed_ref_cache =2298get_packed_ref_cache(&ref_cache);22992300if(!packed_ref_cache->lock)2301die("internal error: packed-refs not locked");2302rollback_lock_file(packed_ref_cache->lock);2303 packed_ref_cache->lock = NULL;2304release_packed_ref_cache(packed_ref_cache);2305clear_packed_ref_cache(&ref_cache);2306}23072308struct ref_to_prune {2309struct ref_to_prune *next;2310unsigned char sha1[20];2311char name[FLEX_ARRAY];2312};23132314struct pack_refs_cb_data {2315unsigned int flags;2316struct ref_dir *packed_refs;2317struct ref_to_prune *ref_to_prune;2318};23192320/*2321 * An each_ref_entry_fn that is run over loose references only. If2322 * the loose reference can be packed, add an entry in the packed ref2323 * cache. If the reference should be pruned, also add it to2324 * ref_to_prune in the pack_refs_cb_data.2325 */2326static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2327{2328struct pack_refs_cb_data *cb = cb_data;2329enum peel_status peel_status;2330struct ref_entry *packed_entry;2331int is_tag_ref =starts_with(entry->name,"refs/tags/");23322333/* Do not pack per-worktree refs: */2334if(ref_type(entry->name) != REF_TYPE_NORMAL)2335return0;23362337/* ALWAYS pack tags */2338if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2339return0;23402341/* Do not pack symbolic or broken refs: */2342if((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))2343return0;23442345/* Add a packed ref cache entry equivalent to the loose entry. */2346 peel_status =peel_entry(entry,1);2347if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2348die("internal error peeling reference%s(%s)",2349 entry->name,oid_to_hex(&entry->u.value.oid));2350 packed_entry =find_ref(cb->packed_refs, entry->name);2351if(packed_entry) {2352/* Overwrite existing packed entry with info from loose entry */2353 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2354oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2355}else{2356 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2357 REF_ISPACKED | REF_KNOWS_PEELED,0);2358add_ref(cb->packed_refs, packed_entry);2359}2360oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);23612362/* Schedule the loose reference for pruning if requested. */2363if((cb->flags & PACK_REFS_PRUNE)) {2364struct ref_to_prune *n;2365FLEX_ALLOC_STR(n, name, entry->name);2366hashcpy(n->sha1, entry->u.value.oid.hash);2367 n->next = cb->ref_to_prune;2368 cb->ref_to_prune = n;2369}2370return0;2371}23722373/*2374 * Remove empty parents, but spare refs/ and immediate subdirs.2375 * Note: munges *name.2376 */2377static voidtry_remove_empty_parents(char*name)2378{2379char*p, *q;2380int i;2381 p = name;2382for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2383while(*p && *p !='/')2384 p++;2385/* tolerate duplicate slashes; see check_refname_format() */2386while(*p =='/')2387 p++;2388}2389for(q = p; *q; q++)2390;2391while(1) {2392while(q > p && *q !='/')2393 q--;2394while(q > p && *(q-1) =='/')2395 q--;2396if(q == p)2397break;2398*q ='\0';2399if(rmdir(git_path("%s", name)))2400break;2401}2402}24032404/* make sure nobody touched the ref, and unlink */2405static voidprune_ref(struct ref_to_prune *r)2406{2407struct ref_transaction *transaction;2408struct strbuf err = STRBUF_INIT;24092410if(check_refname_format(r->name,0))2411return;24122413 transaction =ref_transaction_begin(&err);2414if(!transaction ||2415ref_transaction_delete(transaction, r->name, r->sha1,2416 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2417ref_transaction_commit(transaction, &err)) {2418ref_transaction_free(transaction);2419error("%s", err.buf);2420strbuf_release(&err);2421return;2422}2423ref_transaction_free(transaction);2424strbuf_release(&err);2425try_remove_empty_parents(r->name);2426}24272428static voidprune_refs(struct ref_to_prune *r)2429{2430while(r) {2431prune_ref(r);2432 r = r->next;2433}2434}24352436intpack_refs(unsigned int flags)2437{2438struct pack_refs_cb_data cbdata;24392440memset(&cbdata,0,sizeof(cbdata));2441 cbdata.flags = flags;24422443lock_packed_refs(LOCK_DIE_ON_ERROR);2444 cbdata.packed_refs =get_packed_refs(&ref_cache);24452446do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2447 pack_if_possible_fn, &cbdata);24482449if(commit_packed_refs())2450die_errno("unable to overwrite old ref-pack file");24512452prune_refs(cbdata.ref_to_prune);2453return0;2454}24552456/*2457 * Rewrite the packed-refs file, omitting any refs listed in2458 * 'refnames'. On error, leave packed-refs unchanged, write an error2459 * message to 'err', and return a nonzero value.2460 *2461 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2462 */2463static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2464{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(&ref_cache);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 ref_dir *packed_refs =get_packed_refs(&ref_cache);2633struct ref_dir *loose_refs =get_loose_refs(&ref_cache);26342635if(verify_refname_available_dir(newname, extras, skip,2636 packed_refs, err) ||2637verify_refname_available_dir(newname, extras, skip,2638 loose_refs, err))2639return-1;26402641return0;2642}26432644static intwrite_ref_to_lockfile(struct ref_lock *lock,2645const unsigned char*sha1,struct strbuf *err);2646static intcommit_ref_update(struct ref_lock *lock,2647const unsigned char*sha1,const char*logmsg,2648struct strbuf *err);26492650intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2651{2652unsigned char sha1[20], orig_sha1[20];2653int flag =0, logmoved =0;2654struct ref_lock *lock;2655struct stat loginfo;2656int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2657struct strbuf err = STRBUF_INIT;26582659if(log &&S_ISLNK(loginfo.st_mode))2660returnerror("reflog for%sis a symlink", oldrefname);26612662if(!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2663 orig_sha1, &flag))2664returnerror("refname%snot found", oldrefname);26652666if(flag & REF_ISSYMREF)2667returnerror("refname%sis a symbolic ref, renaming it is not supported",2668 oldrefname);2669if(!rename_ref_available(oldrefname, newrefname))2670return1;26712672if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2673returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2674 oldrefname,strerror(errno));26752676if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2677error("unable to delete old%s", oldrefname);2678goto rollback;2679}26802681/*2682 * Since we are doing a shallow lookup, sha1 is not the2683 * correct value to pass to delete_ref as old_sha1. But that2684 * doesn't matter, because an old_sha1 check wouldn't add to2685 * the safety anyway; we want to delete the reference whatever2686 * its current value.2687 */2688if(!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2689 sha1, NULL) &&2690delete_ref(newrefname, NULL, REF_NODEREF)) {2691if(errno==EISDIR) {2692struct strbuf path = STRBUF_INIT;2693int result;26942695strbuf_git_path(&path,"%s", newrefname);2696 result =remove_empty_directories(&path);2697strbuf_release(&path);26982699if(result) {2700error("Directory not empty:%s", newrefname);2701goto rollback;2702}2703}else{2704error("unable to delete existing%s", newrefname);2705goto rollback;2706}2707}27082709if(log &&rename_tmp_log(newrefname))2710goto rollback;27112712 logmoved = log;27132714 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, REF_NODEREF,2715 NULL, &err);2716if(!lock) {2717error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2718strbuf_release(&err);2719goto rollback;2720}2721hashcpy(lock->old_oid.hash, orig_sha1);27222723if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2724commit_ref_update(lock, orig_sha1, logmsg, &err)) {2725error("unable to write current sha1 into%s:%s", newrefname, err.buf);2726strbuf_release(&err);2727goto rollback;2728}27292730return0;27312732 rollback:2733 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, REF_NODEREF,2734 NULL, &err);2735if(!lock) {2736error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2737strbuf_release(&err);2738goto rollbacklog;2739}27402741 flag = log_all_ref_updates;2742 log_all_ref_updates =0;2743if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2744commit_ref_update(lock, orig_sha1, NULL, &err)) {2745error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2746strbuf_release(&err);2747}2748 log_all_ref_updates = flag;27492750 rollbacklog:2751if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2752error("unable to restore logfile%sfrom%s:%s",2753 oldrefname, newrefname,strerror(errno));2754if(!logmoved && log &&2755rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2756error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2757 oldrefname,strerror(errno));27582759return1;2760}27612762static intclose_ref(struct ref_lock *lock)2763{2764if(close_lock_file(lock->lk))2765return-1;2766return0;2767}27682769static intcommit_ref(struct ref_lock *lock)2770{2771char*path =get_locked_file_path(lock->lk);2772struct stat st;27732774if(!lstat(path, &st) &&S_ISDIR(st.st_mode)) {2775/*2776 * There is a directory at the path we want to rename2777 * the lockfile to. Hopefully it is empty; try to2778 * delete it.2779 */2780size_t len =strlen(path);2781struct strbuf sb_path = STRBUF_INIT;27822783strbuf_attach(&sb_path, path, len, len);27842785/*2786 * If this fails, commit_lock_file() will also fail2787 * and will report the problem.2788 */2789remove_empty_directories(&sb_path);2790strbuf_release(&sb_path);2791}else{2792free(path);2793}27942795if(commit_lock_file(lock->lk))2796return-1;2797return0;2798}27992800/*2801 * Create a reflog for a ref. If force_create = 0, the reflog will2802 * only be created for certain refs (those for which2803 * should_autocreate_reflog returns non-zero. Otherwise, create it2804 * regardless of the ref name. Fill in *err and return -1 on failure.2805 */2806static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)2807{2808int logfd, oflags = O_APPEND | O_WRONLY;28092810strbuf_git_path(logfile,"logs/%s", refname);2811if(force_create ||should_autocreate_reflog(refname)) {2812if(safe_create_leading_directories(logfile->buf) <0) {2813strbuf_addf(err,"unable to create directory for '%s': "2814"%s", logfile->buf,strerror(errno));2815return-1;2816}2817 oflags |= O_CREAT;2818}28192820 logfd =open(logfile->buf, oflags,0666);2821if(logfd <0) {2822if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2823return0;28242825if(errno == EISDIR) {2826if(remove_empty_directories(logfile)) {2827strbuf_addf(err,"there are still logs under "2828"'%s'", logfile->buf);2829return-1;2830}2831 logfd =open(logfile->buf, oflags,0666);2832}28332834if(logfd <0) {2835strbuf_addf(err,"unable to append to '%s':%s",2836 logfile->buf,strerror(errno));2837return-1;2838}2839}28402841adjust_shared_perm(logfile->buf);2842close(logfd);2843return0;2844}284528462847intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)2848{2849int ret;2850struct strbuf sb = STRBUF_INIT;28512852 ret =log_ref_setup(refname, &sb, err, force_create);2853strbuf_release(&sb);2854return ret;2855}28562857static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2858const unsigned char*new_sha1,2859const char*committer,const char*msg)2860{2861int msglen, written;2862unsigned maxlen, len;2863char*logrec;28642865 msglen = msg ?strlen(msg) :0;2866 maxlen =strlen(committer) + msglen +100;2867 logrec =xmalloc(maxlen);2868 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2869sha1_to_hex(old_sha1),2870sha1_to_hex(new_sha1),2871 committer);2872if(msglen)2873 len +=copy_reflog_msg(logrec + len -1, msg) -1;28742875 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2876free(logrec);2877if(written != len)2878return-1;28792880return0;2881}28822883static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,2884const unsigned char*new_sha1,const char*msg,2885struct strbuf *logfile,int flags,2886struct strbuf *err)2887{2888int logfd, result, oflags = O_APPEND | O_WRONLY;28892890if(log_all_ref_updates <0)2891 log_all_ref_updates = !is_bare_repository();28922893 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);28942895if(result)2896return result;28972898 logfd =open(logfile->buf, oflags);2899if(logfd <0)2900return0;2901 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2902git_committer_info(0), msg);2903if(result) {2904strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2905strerror(errno));2906close(logfd);2907return-1;2908}2909if(close(logfd)) {2910strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2911strerror(errno));2912return-1;2913}2914return0;2915}29162917static intlog_ref_write(const char*refname,const unsigned char*old_sha1,2918const unsigned char*new_sha1,const char*msg,2919int flags,struct strbuf *err)2920{2921returnfiles_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2922 err);2923}29242925intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2926const unsigned char*new_sha1,const char*msg,2927int flags,struct strbuf *err)2928{2929struct strbuf sb = STRBUF_INIT;2930int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2931 err);2932strbuf_release(&sb);2933return ret;2934}29352936/*2937 * Write sha1 into the open lockfile, then close the lockfile. On2938 * errors, rollback the lockfile, fill in *err and2939 * return -1.2940 */2941static intwrite_ref_to_lockfile(struct ref_lock *lock,2942const unsigned char*sha1,struct strbuf *err)2943{2944static char term ='\n';2945struct object *o;2946int fd;29472948 o =parse_object(sha1);2949if(!o) {2950strbuf_addf(err,2951"trying to write ref '%s' with nonexistent object%s",2952 lock->ref_name,sha1_to_hex(sha1));2953unlock_ref(lock);2954return-1;2955}2956if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2957strbuf_addf(err,2958"trying to write non-commit object%sto branch '%s'",2959sha1_to_hex(sha1), lock->ref_name);2960unlock_ref(lock);2961return-1;2962}2963 fd =get_lock_file_fd(lock->lk);2964if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2965write_in_full(fd, &term,1) !=1||2966close_ref(lock) <0) {2967strbuf_addf(err,2968"couldn't write '%s'",get_lock_file_path(lock->lk));2969unlock_ref(lock);2970return-1;2971}2972return0;2973}29742975/*2976 * Commit a change to a loose reference that has already been written2977 * to the loose reference lockfile. Also update the reflogs if2978 * necessary, using the specified lockmsg (which can be NULL).2979 */2980static intcommit_ref_update(struct ref_lock *lock,2981const unsigned char*sha1,const char*logmsg,2982struct strbuf *err)2983{2984clear_loose_ref_cache(&ref_cache);2985if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg,0, err)) {2986char*old_msg =strbuf_detach(err, NULL);2987strbuf_addf(err,"cannot update the ref '%s':%s",2988 lock->ref_name, old_msg);2989free(old_msg);2990unlock_ref(lock);2991return-1;2992}29932994if(strcmp(lock->ref_name,"HEAD") !=0) {2995/*2996 * Special hack: If a branch is updated directly and HEAD2997 * points to it (may happen on the remote side of a push2998 * for example) then logically the HEAD reflog should be2999 * updated too.3000 * A generic solution implies reverse symref information,3001 * but finding all symrefs pointing to the given branch3002 * would be rather costly for this rare event (the direct3003 * update of a branch) to be worth it. So let's cheat and3004 * check with HEAD only which should cover 99% of all usage3005 * scenarios (even 100% of the default ones).3006 */3007unsigned char head_sha1[20];3008int head_flag;3009const char*head_ref;30103011 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3012 head_sha1, &head_flag);3013if(head_ref && (head_flag & REF_ISSYMREF) &&3014!strcmp(head_ref, lock->ref_name)) {3015struct strbuf log_err = STRBUF_INIT;3016if(log_ref_write("HEAD", lock->old_oid.hash, sha1,3017 logmsg,0, &log_err)) {3018error("%s", log_err.buf);3019strbuf_release(&log_err);3020}3021}3022}30233024if(commit_ref(lock)) {3025strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3026unlock_ref(lock);3027return-1;3028}30293030unlock_ref(lock);3031return0;3032}30333034static intcreate_ref_symlink(struct ref_lock *lock,const char*target)3035{3036int ret = -1;3037#ifndef NO_SYMLINK_HEAD3038char*ref_path =get_locked_file_path(lock->lk);3039unlink(ref_path);3040 ret =symlink(target, ref_path);3041free(ref_path);30423043if(ret)3044fprintf(stderr,"no symlink - falling back to symbolic ref\n");3045#endif3046return ret;3047}30483049static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,3050const char*target,const char*logmsg)3051{3052struct strbuf err = STRBUF_INIT;3053unsigned char new_sha1[20];3054if(logmsg && !read_ref(target, new_sha1) &&3055log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg,0, &err)) {3056error("%s", err.buf);3057strbuf_release(&err);3058}3059}30603061static intcreate_symref_locked(struct ref_lock *lock,const char*refname,3062const char*target,const char*logmsg)3063{3064if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {3065update_symref_reflog(lock, refname, target, logmsg);3066return0;3067}30683069if(!fdopen_lock_file(lock->lk,"w"))3070returnerror("unable to fdopen%s:%s",3071 lock->lk->tempfile.filename.buf,strerror(errno));30723073update_symref_reflog(lock, refname, target, logmsg);30743075/* no error check; commit_ref will check ferror */3076fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);3077if(commit_ref(lock) <0)3078returnerror("unable to write symref for%s:%s", refname,3079strerror(errno));3080return0;3081}30823083intcreate_symref(const char*refname,const char*target,const char*logmsg)3084{3085struct strbuf err = STRBUF_INIT;3086struct ref_lock *lock;3087int ret;30883089 lock =lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,3090&err);3091if(!lock) {3092error("%s", err.buf);3093strbuf_release(&err);3094return-1;3095}30963097 ret =create_symref_locked(lock, refname, target, logmsg);3098unlock_ref(lock);3099return ret;3100}31013102intset_worktree_head_symref(const char*gitdir,const char*target)3103{3104static struct lock_file head_lock;3105struct ref_lock *lock;3106struct strbuf head_path = STRBUF_INIT;3107const char*head_rel;3108int ret;31093110strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));3111if(hold_lock_file_for_update(&head_lock, head_path.buf,3112 LOCK_NO_DEREF) <0) {3113struct strbuf err = STRBUF_INIT;3114unable_to_lock_message(head_path.buf, errno, &err);3115error("%s", err.buf);3116strbuf_release(&err);3117strbuf_release(&head_path);3118return-1;3119}31203121/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3122 linked trees */3123 head_rel =remove_leading_path(head_path.buf,3124absolute_path(get_git_common_dir()));3125/* to make use of create_symref_locked(), initialize ref_lock */3126 lock =xcalloc(1,sizeof(struct ref_lock));3127 lock->lk = &head_lock;3128 lock->ref_name =xstrdup(head_rel);31293130 ret =create_symref_locked(lock, head_rel, target, NULL);31313132unlock_ref(lock);/* will free lock */3133strbuf_release(&head_path);3134return ret;3135}31363137intreflog_exists(const char*refname)3138{3139struct stat st;31403141return!lstat(git_path("logs/%s", refname), &st) &&3142S_ISREG(st.st_mode);3143}31443145intdelete_reflog(const char*refname)3146{3147returnremove_path(git_path("logs/%s", refname));3148}31493150static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3151{3152unsigned char osha1[20], nsha1[20];3153char*email_end, *message;3154unsigned long timestamp;3155int tz;31563157/* old SP new SP name <email> SP time TAB msg LF */3158if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3159get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3160get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3161!(email_end =strchr(sb->buf +82,'>')) ||3162 email_end[1] !=' '||3163!(timestamp =strtoul(email_end +2, &message,10)) ||3164!message || message[0] !=' '||3165(message[1] !='+'&& message[1] !='-') ||3166!isdigit(message[2]) || !isdigit(message[3]) ||3167!isdigit(message[4]) || !isdigit(message[5]))3168return0;/* corrupt? */3169 email_end[1] ='\0';3170 tz =strtol(message +1, NULL,10);3171if(message[6] !='\t')3172 message +=6;3173else3174 message +=7;3175returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3176}31773178static char*find_beginning_of_line(char*bob,char*scan)3179{3180while(bob < scan && *(--scan) !='\n')3181;/* keep scanning backwards */3182/*3183 * Return either beginning of the buffer, or LF at the end of3184 * the previous line.3185 */3186return scan;3187}31883189intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)3190{3191struct strbuf sb = STRBUF_INIT;3192FILE*logfp;3193long pos;3194int ret =0, at_tail =1;31953196 logfp =fopen(git_path("logs/%s", refname),"r");3197if(!logfp)3198return-1;31993200/* Jump to the end */3201if(fseek(logfp,0, SEEK_END) <0)3202returnerror("cannot seek back reflog for%s:%s",3203 refname,strerror(errno));3204 pos =ftell(logfp);3205while(!ret &&0< pos) {3206int cnt;3207size_t nread;3208char buf[BUFSIZ];3209char*endp, *scanp;32103211/* Fill next block from the end */3212 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3213if(fseek(logfp, pos - cnt, SEEK_SET))3214returnerror("cannot seek back reflog for%s:%s",3215 refname,strerror(errno));3216 nread =fread(buf, cnt,1, logfp);3217if(nread !=1)3218returnerror("cannot read%dbytes from reflog for%s:%s",3219 cnt, refname,strerror(errno));3220 pos -= cnt;32213222 scanp = endp = buf + cnt;3223if(at_tail && scanp[-1] =='\n')3224/* Looking at the final LF at the end of the file */3225 scanp--;3226 at_tail =0;32273228while(buf < scanp) {3229/*3230 * terminating LF of the previous line, or the beginning3231 * of the buffer.3232 */3233char*bp;32343235 bp =find_beginning_of_line(buf, scanp);32363237if(*bp =='\n') {3238/*3239 * The newline is the end of the previous line,3240 * so we know we have complete line starting3241 * at (bp + 1). Prefix it onto any prior data3242 * we collected for the line and process it.3243 */3244strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3245 scanp = bp;3246 endp = bp +1;3247 ret =show_one_reflog_ent(&sb, fn, cb_data);3248strbuf_reset(&sb);3249if(ret)3250break;3251}else if(!pos) {3252/*3253 * We are at the start of the buffer, and the3254 * start of the file; there is no previous3255 * line, and we have everything for this one.3256 * Process it, and we can end the loop.3257 */3258strbuf_splice(&sb,0,0, buf, endp - buf);3259 ret =show_one_reflog_ent(&sb, fn, cb_data);3260strbuf_reset(&sb);3261break;3262}32633264if(bp == buf) {3265/*3266 * We are at the start of the buffer, and there3267 * is more file to read backwards. Which means3268 * we are in the middle of a line. Note that we3269 * may get here even if *bp was a newline; that3270 * just means we are at the exact end of the3271 * previous line, rather than some spot in the3272 * middle.3273 *3274 * Save away what we have to be combined with3275 * the data from the next read.3276 */3277strbuf_splice(&sb,0,0, buf, endp - buf);3278break;3279}3280}32813282}3283if(!ret && sb.len)3284die("BUG: reverse reflog parser had leftover data");32853286fclose(logfp);3287strbuf_release(&sb);3288return ret;3289}32903291intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3292{3293FILE*logfp;3294struct strbuf sb = STRBUF_INIT;3295int ret =0;32963297 logfp =fopen(git_path("logs/%s", refname),"r");3298if(!logfp)3299return-1;33003301while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3302 ret =show_one_reflog_ent(&sb, fn, cb_data);3303fclose(logfp);3304strbuf_release(&sb);3305return ret;3306}33073308struct files_reflog_iterator {3309struct ref_iterator base;33103311struct dir_iterator *dir_iterator;3312struct object_id oid;3313};33143315static intfiles_reflog_iterator_advance(struct ref_iterator *ref_iterator)3316{3317struct files_reflog_iterator *iter =3318(struct files_reflog_iterator *)ref_iterator;3319struct dir_iterator *diter = iter->dir_iterator;3320int ok;33213322while((ok =dir_iterator_advance(diter)) == ITER_OK) {3323int flags;33243325if(!S_ISREG(diter->st.st_mode))3326continue;3327if(diter->basename[0] =='.')3328continue;3329if(ends_with(diter->basename,".lock"))3330continue;33313332if(read_ref_full(diter->relative_path,0,3333 iter->oid.hash, &flags)) {3334error("bad ref for%s", diter->path.buf);3335continue;3336}33373338 iter->base.refname = diter->relative_path;3339 iter->base.oid = &iter->oid;3340 iter->base.flags = flags;3341return ITER_OK;3342}33433344 iter->dir_iterator = NULL;3345if(ref_iterator_abort(ref_iterator) == ITER_ERROR)3346 ok = ITER_ERROR;3347return ok;3348}33493350static intfiles_reflog_iterator_peel(struct ref_iterator *ref_iterator,3351struct object_id *peeled)3352{3353die("BUG: ref_iterator_peel() called for reflog_iterator");3354}33553356static intfiles_reflog_iterator_abort(struct ref_iterator *ref_iterator)3357{3358struct files_reflog_iterator *iter =3359(struct files_reflog_iterator *)ref_iterator;3360int ok = ITER_DONE;33613362if(iter->dir_iterator)3363 ok =dir_iterator_abort(iter->dir_iterator);33643365base_ref_iterator_free(ref_iterator);3366return ok;3367}33683369static struct ref_iterator_vtable files_reflog_iterator_vtable = {3370 files_reflog_iterator_advance,3371 files_reflog_iterator_peel,3372 files_reflog_iterator_abort3373};33743375struct ref_iterator *files_reflog_iterator_begin(void)3376{3377struct files_reflog_iterator *iter =xcalloc(1,sizeof(*iter));3378struct ref_iterator *ref_iterator = &iter->base;33793380base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);3381 iter->dir_iterator =dir_iterator_begin(git_path("logs"));3382return ref_iterator;3383}33843385intfor_each_reflog(each_ref_fn fn,void*cb_data)3386{3387returndo_for_each_ref_iterator(files_reflog_iterator_begin(),3388 fn, cb_data);3389}33903391static intref_update_reject_duplicates(struct string_list *refnames,3392struct strbuf *err)3393{3394int i, n = refnames->nr;33953396assert(err);33973398for(i =1; i < n; i++)3399if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3400strbuf_addf(err,3401"multiple updates for ref '%s' not allowed.",3402 refnames->items[i].string);3403return1;3404}3405return0;3406}34073408/*3409 * If update is a direct update of head_ref (the reference pointed to3410 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3411 */3412static intsplit_head_update(struct ref_update *update,3413struct ref_transaction *transaction,3414const char*head_ref,3415struct string_list *affected_refnames,3416struct strbuf *err)3417{3418struct string_list_item *item;3419struct ref_update *new_update;34203421if((update->flags & REF_LOG_ONLY) ||3422(update->flags & REF_ISPRUNING) ||3423(update->flags & REF_UPDATE_VIA_HEAD))3424return0;34253426if(strcmp(update->refname, head_ref))3427return0;34283429/*3430 * First make sure that HEAD is not already in the3431 * transaction. This insertion is O(N) in the transaction3432 * size, but it happens at most once per transaction.3433 */3434 item =string_list_insert(affected_refnames,"HEAD");3435if(item->util) {3436/* An entry already existed */3437strbuf_addf(err,3438"multiple updates for 'HEAD' (including one "3439"via its referent '%s') are not allowed",3440 update->refname);3441return TRANSACTION_NAME_CONFLICT;3442}34433444 new_update =ref_transaction_add_update(3445 transaction,"HEAD",3446 update->flags | REF_LOG_ONLY | REF_NODEREF,3447 update->new_sha1, update->old_sha1,3448 update->msg);34493450 item->util = new_update;34513452return0;3453}34543455/*3456 * update is for a symref that points at referent and doesn't have3457 * REF_NODEREF set. Split it into two updates:3458 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3459 * - A new, separate update for the referent reference3460 * Note that the new update will itself be subject to splitting when3461 * the iteration gets to it.3462 */3463static intsplit_symref_update(struct ref_update *update,3464const char*referent,3465struct ref_transaction *transaction,3466struct string_list *affected_refnames,3467struct strbuf *err)3468{3469struct string_list_item *item;3470struct ref_update *new_update;3471unsigned int new_flags;34723473/*3474 * First make sure that referent is not already in the3475 * transaction. This insertion is O(N) in the transaction3476 * size, but it happens at most once per symref in a3477 * transaction.3478 */3479 item =string_list_insert(affected_refnames, referent);3480if(item->util) {3481/* An entry already existed */3482strbuf_addf(err,3483"multiple updates for '%s' (including one "3484"via symref '%s') are not allowed",3485 referent, update->refname);3486return TRANSACTION_NAME_CONFLICT;3487}34883489 new_flags = update->flags;3490if(!strcmp(update->refname,"HEAD")) {3491/*3492 * Record that the new update came via HEAD, so that3493 * when we process it, split_head_update() doesn't try3494 * to add another reflog update for HEAD. Note that3495 * this bit will be propagated if the new_update3496 * itself needs to be split.3497 */3498 new_flags |= REF_UPDATE_VIA_HEAD;3499}35003501 new_update =ref_transaction_add_update(3502 transaction, referent, new_flags,3503 update->new_sha1, update->old_sha1,3504 update->msg);35053506 new_update->parent_update = update;35073508/*3509 * Change the symbolic ref update to log only. Also, it3510 * doesn't need to check its old SHA-1 value, as that will be3511 * done when new_update is processed.3512 */3513 update->flags |= REF_LOG_ONLY | REF_NODEREF;3514 update->flags &= ~REF_HAVE_OLD;35153516 item->util = new_update;35173518return0;3519}35203521/*3522 * Return the refname under which update was originally requested.3523 */3524static const char*original_update_refname(struct ref_update *update)3525{3526while(update->parent_update)3527 update = update->parent_update;35283529return update->refname;3530}35313532/*3533 * Check whether the REF_HAVE_OLD and old_oid values stored in update3534 * are consistent with oid, which is the reference's current value. If3535 * everything is OK, return 0; otherwise, write an error message to3536 * err and return -1.3537 */3538static intcheck_old_oid(struct ref_update *update,struct object_id *oid,3539struct strbuf *err)3540{3541if(!(update->flags & REF_HAVE_OLD) ||3542!hashcmp(oid->hash, update->old_sha1))3543return0;35443545if(is_null_sha1(update->old_sha1))3546strbuf_addf(err,"cannot lock ref '%s': "3547"reference already exists",3548original_update_refname(update));3549else if(is_null_oid(oid))3550strbuf_addf(err,"cannot lock ref '%s': "3551"reference is missing but expected%s",3552original_update_refname(update),3553sha1_to_hex(update->old_sha1));3554else3555strbuf_addf(err,"cannot lock ref '%s': "3556"is at%sbut expected%s",3557original_update_refname(update),3558oid_to_hex(oid),3559sha1_to_hex(update->old_sha1));35603561return-1;3562}35633564/*3565 * Prepare for carrying out update:3566 * - Lock the reference referred to by update.3567 * - Read the reference under lock.3568 * - Check that its old SHA-1 value (if specified) is correct, and in3569 * any case record it in update->lock->old_oid for later use when3570 * writing the reflog.3571 * - If it is a symref update without REF_NODEREF, split it up into a3572 * REF_LOG_ONLY update of the symref and add a separate update for3573 * the referent to transaction.3574 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3575 * update of HEAD.3576 */3577static intlock_ref_for_update(struct ref_update *update,3578struct ref_transaction *transaction,3579const char*head_ref,3580struct string_list *affected_refnames,3581struct strbuf *err)3582{3583struct strbuf referent = STRBUF_INIT;3584int mustexist = (update->flags & REF_HAVE_OLD) &&3585!is_null_sha1(update->old_sha1);3586int ret;3587struct ref_lock *lock;35883589if((update->flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1))3590 update->flags |= REF_DELETING;35913592if(head_ref) {3593 ret =split_head_update(update, transaction, head_ref,3594 affected_refnames, err);3595if(ret)3596return ret;3597}35983599 ret =lock_raw_ref(update->refname, mustexist,3600 affected_refnames, NULL,3601&update->lock, &referent,3602&update->type, err);36033604if(ret) {3605char*reason;36063607 reason =strbuf_detach(err, NULL);3608strbuf_addf(err,"cannot lock ref '%s':%s",3609original_update_refname(update), reason);3610free(reason);3611return ret;3612}36133614 lock = update->lock;36153616if(update->type & REF_ISSYMREF) {3617if(update->flags & REF_NODEREF) {3618/*3619 * We won't be reading the referent as part of3620 * the transaction, so we have to read it here3621 * to record and possibly check old_sha1:3622 */3623if(read_ref_full(referent.buf,0,3624 lock->old_oid.hash, NULL)) {3625if(update->flags & REF_HAVE_OLD) {3626strbuf_addf(err,"cannot lock ref '%s': "3627"error reading reference",3628original_update_refname(update));3629return-1;3630}3631}else if(check_old_oid(update, &lock->old_oid, err)) {3632return TRANSACTION_GENERIC_ERROR;3633}3634}else{3635/*3636 * Create a new update for the reference this3637 * symref is pointing at. Also, we will record3638 * and verify old_sha1 for this update as part3639 * of processing the split-off update, so we3640 * don't have to do it here.3641 */3642 ret =split_symref_update(update, referent.buf, transaction,3643 affected_refnames, err);3644if(ret)3645return ret;3646}3647}else{3648struct ref_update *parent_update;36493650if(check_old_oid(update, &lock->old_oid, err))3651return TRANSACTION_GENERIC_ERROR;36523653/*3654 * If this update is happening indirectly because of a3655 * symref update, record the old SHA-1 in the parent3656 * update:3657 */3658for(parent_update = update->parent_update;3659 parent_update;3660 parent_update = parent_update->parent_update) {3661oidcpy(&parent_update->lock->old_oid, &lock->old_oid);3662}3663}36643665if((update->flags & REF_HAVE_NEW) &&3666!(update->flags & REF_DELETING) &&3667!(update->flags & REF_LOG_ONLY)) {3668if(!(update->type & REF_ISSYMREF) &&3669!hashcmp(lock->old_oid.hash, update->new_sha1)) {3670/*3671 * The reference already has the desired3672 * value, so we don't need to write it.3673 */3674}else if(write_ref_to_lockfile(lock, update->new_sha1,3675 err)) {3676char*write_err =strbuf_detach(err, NULL);36773678/*3679 * The lock was freed upon failure of3680 * write_ref_to_lockfile():3681 */3682 update->lock = NULL;3683strbuf_addf(err,3684"cannot update ref '%s':%s",3685 update->refname, write_err);3686free(write_err);3687return TRANSACTION_GENERIC_ERROR;3688}else{3689 update->flags |= REF_NEEDS_COMMIT;3690}3691}3692if(!(update->flags & REF_NEEDS_COMMIT)) {3693/*3694 * We didn't call write_ref_to_lockfile(), so3695 * the lockfile is still open. Close it to3696 * free up the file descriptor:3697 */3698if(close_ref(lock)) {3699strbuf_addf(err,"couldn't close '%s.lock'",3700 update->refname);3701return TRANSACTION_GENERIC_ERROR;3702}3703}3704return0;3705}37063707intref_transaction_commit(struct ref_transaction *transaction,3708struct strbuf *err)3709{3710int ret =0, i;3711struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3712struct string_list_item *ref_to_delete;3713struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3714char*head_ref = NULL;3715int head_type;3716struct object_id head_oid;37173718assert(err);37193720if(transaction->state != REF_TRANSACTION_OPEN)3721die("BUG: commit called for transaction that is not open");37223723if(!transaction->nr) {3724 transaction->state = REF_TRANSACTION_CLOSED;3725return0;3726}37273728/*3729 * Fail if a refname appears more than once in the3730 * transaction. (If we end up splitting up any updates using3731 * split_symref_update() or split_head_update(), those3732 * functions will check that the new updates don't have the3733 * same refname as any existing ones.)3734 */3735for(i =0; i < transaction->nr; i++) {3736struct ref_update *update = transaction->updates[i];3737struct string_list_item *item =3738string_list_append(&affected_refnames, update->refname);37393740/*3741 * We store a pointer to update in item->util, but at3742 * the moment we never use the value of this field3743 * except to check whether it is non-NULL.3744 */3745 item->util = update;3746}3747string_list_sort(&affected_refnames);3748if(ref_update_reject_duplicates(&affected_refnames, err)) {3749 ret = TRANSACTION_GENERIC_ERROR;3750goto cleanup;3751}37523753/*3754 * Special hack: If a branch is updated directly and HEAD3755 * points to it (may happen on the remote side of a push3756 * for example) then logically the HEAD reflog should be3757 * updated too.3758 *3759 * A generic solution would require reverse symref lookups,3760 * but finding all symrefs pointing to a given branch would be3761 * rather costly for this rare event (the direct update of a3762 * branch) to be worth it. So let's cheat and check with HEAD3763 * only, which should cover 99% of all usage scenarios (even3764 * 100% of the default ones).3765 *3766 * So if HEAD is a symbolic reference, then record the name of3767 * the reference that it points to. If we see an update of3768 * head_ref within the transaction, then split_head_update()3769 * arranges for the reflog of HEAD to be updated, too.3770 */3771 head_ref =resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3772 head_oid.hash, &head_type);37733774if(head_ref && !(head_type & REF_ISSYMREF)) {3775free(head_ref);3776 head_ref = NULL;3777}37783779/*3780 * Acquire all locks, verify old values if provided, check3781 * that new values are valid, and write new values to the3782 * lockfiles, ready to be activated. Only keep one lockfile3783 * open at a time to avoid running out of file descriptors.3784 */3785for(i =0; i < transaction->nr; i++) {3786struct ref_update *update = transaction->updates[i];37873788 ret =lock_ref_for_update(update, transaction, head_ref,3789&affected_refnames, err);3790if(ret)3791goto cleanup;3792}37933794/* Perform updates first so live commits remain referenced */3795for(i =0; i < transaction->nr; i++) {3796struct ref_update *update = transaction->updates[i];3797struct ref_lock *lock = update->lock;37983799if(update->flags & REF_NEEDS_COMMIT ||3800 update->flags & REF_LOG_ONLY) {3801if(log_ref_write(lock->ref_name, lock->old_oid.hash,3802 update->new_sha1,3803 update->msg, update->flags, err)) {3804char*old_msg =strbuf_detach(err, NULL);38053806strbuf_addf(err,"cannot update the ref '%s':%s",3807 lock->ref_name, old_msg);3808free(old_msg);3809unlock_ref(lock);3810 update->lock = NULL;3811 ret = TRANSACTION_GENERIC_ERROR;3812goto cleanup;3813}3814}3815if(update->flags & REF_NEEDS_COMMIT) {3816clear_loose_ref_cache(&ref_cache);3817if(commit_ref(lock)) {3818strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3819unlock_ref(lock);3820 update->lock = NULL;3821 ret = TRANSACTION_GENERIC_ERROR;3822goto cleanup;3823}3824}3825}3826/* Perform deletes now that updates are safely completed */3827for(i =0; i < transaction->nr; i++) {3828struct ref_update *update = transaction->updates[i];38293830if(update->flags & REF_DELETING &&3831!(update->flags & REF_LOG_ONLY)) {3832if(delete_ref_loose(update->lock, update->type, err)) {3833 ret = TRANSACTION_GENERIC_ERROR;3834goto cleanup;3835}38363837if(!(update->flags & REF_ISPRUNING))3838string_list_append(&refs_to_delete,3839 update->lock->ref_name);3840}3841}38423843if(repack_without_refs(&refs_to_delete, err)) {3844 ret = TRANSACTION_GENERIC_ERROR;3845goto cleanup;3846}3847for_each_string_list_item(ref_to_delete, &refs_to_delete)3848unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3849clear_loose_ref_cache(&ref_cache);38503851cleanup:3852 transaction->state = REF_TRANSACTION_CLOSED;38533854for(i =0; i < transaction->nr; i++)3855if(transaction->updates[i]->lock)3856unlock_ref(transaction->updates[i]->lock);3857string_list_clear(&refs_to_delete,0);3858free(head_ref);3859string_list_clear(&affected_refnames,0);38603861return ret;3862}38633864static intref_present(const char*refname,3865const struct object_id *oid,int flags,void*cb_data)3866{3867struct string_list *affected_refnames = cb_data;38683869returnstring_list_has_string(affected_refnames, refname);3870}38713872intinitial_ref_transaction_commit(struct ref_transaction *transaction,3873struct strbuf *err)3874{3875int ret =0, i;3876struct string_list affected_refnames = STRING_LIST_INIT_NODUP;38773878assert(err);38793880if(transaction->state != REF_TRANSACTION_OPEN)3881die("BUG: commit called for transaction that is not open");38823883/* Fail if a refname appears more than once in the transaction: */3884for(i =0; i < transaction->nr; i++)3885string_list_append(&affected_refnames,3886 transaction->updates[i]->refname);3887string_list_sort(&affected_refnames);3888if(ref_update_reject_duplicates(&affected_refnames, err)) {3889 ret = TRANSACTION_GENERIC_ERROR;3890goto cleanup;3891}38923893/*3894 * It's really undefined to call this function in an active3895 * repository or when there are existing references: we are3896 * only locking and changing packed-refs, so (1) any3897 * simultaneous processes might try to change a reference at3898 * the same time we do, and (2) any existing loose versions of3899 * the references that we are setting would have precedence3900 * over our values. But some remote helpers create the remote3901 * "HEAD" and "master" branches before calling this function,3902 * so here we really only check that none of the references3903 * that we are creating already exists.3904 */3905if(for_each_rawref(ref_present, &affected_refnames))3906die("BUG: initial ref transaction called with existing refs");39073908for(i =0; i < transaction->nr; i++) {3909struct ref_update *update = transaction->updates[i];39103911if((update->flags & REF_HAVE_OLD) &&3912!is_null_sha1(update->old_sha1))3913die("BUG: initial ref transaction with old_sha1 set");3914if(verify_refname_available(update->refname,3915&affected_refnames, NULL,3916 err)) {3917 ret = TRANSACTION_NAME_CONFLICT;3918goto cleanup;3919}3920}39213922if(lock_packed_refs(0)) {3923strbuf_addf(err,"unable to lock packed-refs file:%s",3924strerror(errno));3925 ret = TRANSACTION_GENERIC_ERROR;3926goto cleanup;3927}39283929for(i =0; i < transaction->nr; i++) {3930struct ref_update *update = transaction->updates[i];39313932if((update->flags & REF_HAVE_NEW) &&3933!is_null_sha1(update->new_sha1))3934add_packed_ref(update->refname, update->new_sha1);3935}39363937if(commit_packed_refs()) {3938strbuf_addf(err,"unable to commit packed-refs file:%s",3939strerror(errno));3940 ret = TRANSACTION_GENERIC_ERROR;3941goto cleanup;3942}39433944cleanup:3945 transaction->state = REF_TRANSACTION_CLOSED;3946string_list_clear(&affected_refnames,0);3947return ret;3948}39493950struct expire_reflog_cb {3951unsigned int flags;3952 reflog_expiry_should_prune_fn *should_prune_fn;3953void*policy_cb;3954FILE*newlog;3955unsigned char last_kept_sha1[20];3956};39573958static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3959const char*email,unsigned long timestamp,int tz,3960const char*message,void*cb_data)3961{3962struct expire_reflog_cb *cb = cb_data;3963struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;39643965if(cb->flags & EXPIRE_REFLOGS_REWRITE)3966 osha1 = cb->last_kept_sha1;39673968if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3969 message, policy_cb)) {3970if(!cb->newlog)3971printf("would prune%s", message);3972else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3973printf("prune%s", message);3974}else{3975if(cb->newlog) {3976fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3977sha1_to_hex(osha1),sha1_to_hex(nsha1),3978 email, timestamp, tz, message);3979hashcpy(cb->last_kept_sha1, nsha1);3980}3981if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3982printf("keep%s", message);3983}3984return0;3985}39863987intreflog_expire(const char*refname,const unsigned char*sha1,3988unsigned int flags,3989 reflog_expiry_prepare_fn prepare_fn,3990 reflog_expiry_should_prune_fn should_prune_fn,3991 reflog_expiry_cleanup_fn cleanup_fn,3992void*policy_cb_data)3993{3994static struct lock_file reflog_lock;3995struct expire_reflog_cb cb;3996struct ref_lock *lock;3997char*log_file;3998int status =0;3999int type;4000struct strbuf err = STRBUF_INIT;40014002memset(&cb,0,sizeof(cb));4003 cb.flags = flags;4004 cb.policy_cb = policy_cb_data;4005 cb.should_prune_fn = should_prune_fn;40064007/*4008 * The reflog file is locked by holding the lock on the4009 * reference itself, plus we might need to update the4010 * reference if --updateref was specified:4011 */4012 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,4013&type, &err);4014if(!lock) {4015error("cannot lock ref '%s':%s", refname, err.buf);4016strbuf_release(&err);4017return-1;4018}4019if(!reflog_exists(refname)) {4020unlock_ref(lock);4021return0;4022}40234024 log_file =git_pathdup("logs/%s", refname);4025if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4026/*4027 * Even though holding $GIT_DIR/logs/$reflog.lock has4028 * no locking implications, we use the lock_file4029 * machinery here anyway because it does a lot of the4030 * work we need, including cleaning up if the program4031 * exits unexpectedly.4032 */4033if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4034struct strbuf err = STRBUF_INIT;4035unable_to_lock_message(log_file, errno, &err);4036error("%s", err.buf);4037strbuf_release(&err);4038goto failure;4039}4040 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4041if(!cb.newlog) {4042error("cannot fdopen%s(%s)",4043get_lock_file_path(&reflog_lock),strerror(errno));4044goto failure;4045}4046}40474048(*prepare_fn)(refname, sha1, cb.policy_cb);4049for_each_reflog_ent(refname, expire_reflog_ent, &cb);4050(*cleanup_fn)(cb.policy_cb);40514052if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4053/*4054 * It doesn't make sense to adjust a reference pointed4055 * to by a symbolic ref based on expiring entries in4056 * the symbolic reference's reflog. Nor can we update4057 * a reference if there are no remaining reflog4058 * entries.4059 */4060int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4061!(type & REF_ISSYMREF) &&4062!is_null_sha1(cb.last_kept_sha1);40634064if(close_lock_file(&reflog_lock)) {4065 status |=error("couldn't write%s:%s", log_file,4066strerror(errno));4067}else if(update &&4068(write_in_full(get_lock_file_fd(lock->lk),4069sha1_to_hex(cb.last_kept_sha1),40) !=40||4070write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||4071close_ref(lock) <0)) {4072 status |=error("couldn't write%s",4073get_lock_file_path(lock->lk));4074rollback_lock_file(&reflog_lock);4075}else if(commit_lock_file(&reflog_lock)) {4076 status |=error("unable to write reflog '%s' (%s)",4077 log_file,strerror(errno));4078}else if(update &&commit_ref(lock)) {4079 status |=error("couldn't set%s", lock->ref_name);4080}4081}4082free(log_file);4083unlock_ref(lock);4084return status;40854086 failure:4087rollback_lock_file(&reflog_lock);4088free(log_file);4089unlock_ref(lock);4090return-1;4091}