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;14541455*type =0;1456strbuf_reset(&sb_path);1457strbuf_git_path(&sb_path,"%s", refname);1458 path = sb_path.buf;14591460stat_ref:1461/*1462 * We might have to loop back here to avoid a race1463 * condition: first we lstat() the file, then we try1464 * to read it as a link or as a file. But if somebody1465 * changes the type of the file (file <-> directory1466 * <-> symlink) between the lstat() and reading, then1467 * we don't want to report that as an error but rather1468 * try again starting with the lstat().1469 */14701471if(lstat(path, &st) <0) {1472if(errno != ENOENT)1473goto out;1474if(resolve_missing_loose_ref(refname, sha1, type)) {1475 errno = ENOENT;1476goto out;1477}1478 ret =0;1479goto out;1480}14811482/* Follow "normalized" - ie "refs/.." symlinks by hand */1483if(S_ISLNK(st.st_mode)) {1484strbuf_reset(&sb_contents);1485if(strbuf_readlink(&sb_contents, path,0) <0) {1486if(errno == ENOENT || errno == EINVAL)1487/* inconsistent with lstat; retry */1488goto stat_ref;1489else1490goto out;1491}1492if(starts_with(sb_contents.buf,"refs/") &&1493!check_refname_format(sb_contents.buf,0)) {1494strbuf_swap(&sb_contents, referent);1495*type |= REF_ISSYMREF;1496 ret =0;1497goto out;1498}1499/*1500 * It doesn't look like a refname; fall through to just1501 * treating it like a non-symlink, and reading whatever it1502 * points to.1503 */1504}15051506/* Is it a directory? */1507if(S_ISDIR(st.st_mode)) {1508/*1509 * Even though there is a directory where the loose1510 * ref is supposed to be, there could still be a1511 * packed ref:1512 */1513if(resolve_missing_loose_ref(refname, sha1, type)) {1514 errno = EISDIR;1515goto out;1516}1517 ret =0;1518goto out;1519}15201521/*1522 * Anything else, just open it and try to use it as1523 * a ref1524 */1525 fd =open(path, O_RDONLY);1526if(fd <0) {1527if(errno == ENOENT && !S_ISLNK(st.st_mode))1528/* inconsistent with lstat; retry */1529goto stat_ref;1530else1531goto out;1532}1533strbuf_reset(&sb_contents);1534if(strbuf_read(&sb_contents, fd,256) <0) {1535int save_errno = errno;1536close(fd);1537 errno = save_errno;1538goto out;1539}1540close(fd);1541strbuf_rtrim(&sb_contents);1542 buf = sb_contents.buf;1543if(starts_with(buf,"ref:")) {1544 buf +=4;1545while(isspace(*buf))1546 buf++;15471548strbuf_reset(referent);1549strbuf_addstr(referent, buf);1550*type |= REF_ISSYMREF;1551 ret =0;1552goto out;1553}15541555/*1556 * Please note that FETCH_HEAD has additional1557 * data after the sha.1558 */1559if(get_sha1_hex(buf, sha1) ||1560(buf[40] !='\0'&& !isspace(buf[40]))) {1561*type |= REF_ISBROKEN;1562 errno = EINVAL;1563goto out;1564}15651566 ret =0;15671568out:1569 save_errno = errno;1570strbuf_release(&sb_path);1571strbuf_release(&sb_contents);1572 errno = save_errno;1573return ret;1574}15751576static voidunlock_ref(struct ref_lock *lock)1577{1578/* Do not free lock->lk -- atexit() still looks at them */1579if(lock->lk)1580rollback_lock_file(lock->lk);1581free(lock->ref_name);1582free(lock);1583}15841585/*1586 * Lock refname, without following symrefs, and set *lock_p to point1587 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1588 * and type similarly to read_raw_ref().1589 *1590 * The caller must verify that refname is a "safe" reference name (in1591 * the sense of refname_is_safe()) before calling this function.1592 *1593 * If the reference doesn't already exist, verify that refname doesn't1594 * have a D/F conflict with any existing references. extras and skip1595 * are passed to verify_refname_available_dir() for this check.1596 *1597 * If mustexist is not set and the reference is not found or is1598 * broken, lock the reference anyway but clear sha1.1599 *1600 * Return 0 on success. On failure, write an error message to err and1601 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1602 *1603 * Implementation note: This function is basically1604 *1605 * lock reference1606 * read_raw_ref()1607 *1608 * but it includes a lot more code to1609 * - Deal with possible races with other processes1610 * - Avoid calling verify_refname_available_dir() when it can be1611 * avoided, namely if we were successfully able to read the ref1612 * - Generate informative error messages in the case of failure1613 */1614static intlock_raw_ref(const char*refname,int mustexist,1615const struct string_list *extras,1616const struct string_list *skip,1617struct ref_lock **lock_p,1618struct strbuf *referent,1619unsigned int*type,1620struct strbuf *err)1621{1622struct ref_lock *lock;1623struct strbuf ref_file = STRBUF_INIT;1624int attempts_remaining =3;1625int ret = TRANSACTION_GENERIC_ERROR;16261627assert(err);1628*type =0;16291630/* First lock the file so it can't change out from under us. */16311632*lock_p = lock =xcalloc(1,sizeof(*lock));16331634 lock->ref_name =xstrdup(refname);1635strbuf_git_path(&ref_file,"%s", refname);16361637retry:1638switch(safe_create_leading_directories(ref_file.buf)) {1639case SCLD_OK:1640break;/* success */1641case SCLD_EXISTS:1642/*1643 * Suppose refname is "refs/foo/bar". We just failed1644 * to create the containing directory, "refs/foo",1645 * because there was a non-directory in the way. This1646 * indicates a D/F conflict, probably because of1647 * another reference such as "refs/foo". There is no1648 * reason to expect this error to be transitory.1649 */1650if(verify_refname_available(refname, extras, skip, err)) {1651if(mustexist) {1652/*1653 * To the user the relevant error is1654 * that the "mustexist" reference is1655 * missing:1656 */1657strbuf_reset(err);1658strbuf_addf(err,"unable to resolve reference '%s'",1659 refname);1660}else{1661/*1662 * The error message set by1663 * verify_refname_available_dir() is OK.1664 */1665 ret = TRANSACTION_NAME_CONFLICT;1666}1667}else{1668/*1669 * The file that is in the way isn't a loose1670 * reference. Report it as a low-level1671 * failure.1672 */1673strbuf_addf(err,"unable to create lock file%s.lock; "1674"non-directory in the way",1675 ref_file.buf);1676}1677goto error_return;1678case SCLD_VANISHED:1679/* Maybe another process was tidying up. Try again. */1680if(--attempts_remaining >0)1681goto retry;1682/* fall through */1683default:1684strbuf_addf(err,"unable to create directory for%s",1685 ref_file.buf);1686goto error_return;1687}16881689if(!lock->lk)1690 lock->lk =xcalloc(1,sizeof(struct lock_file));16911692if(hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) <0) {1693if(errno == ENOENT && --attempts_remaining >0) {1694/*1695 * Maybe somebody just deleted one of the1696 * directories leading to ref_file. Try1697 * again:1698 */1699goto retry;1700}else{1701unable_to_lock_message(ref_file.buf, errno, err);1702goto error_return;1703}1704}17051706/*1707 * Now we hold the lock and can read the reference without1708 * fear that its value will change.1709 */17101711if(read_raw_ref(refname, lock->old_oid.hash, referent, type)) {1712if(errno == ENOENT) {1713if(mustexist) {1714/* Garden variety missing reference. */1715strbuf_addf(err,"unable to resolve reference '%s'",1716 refname);1717goto error_return;1718}else{1719/*1720 * Reference is missing, but that's OK. We1721 * know that there is not a conflict with1722 * another loose reference because1723 * (supposing that we are trying to lock1724 * reference "refs/foo/bar"):1725 *1726 * - We were successfully able to create1727 * the lockfile refs/foo/bar.lock, so we1728 * know there cannot be a loose reference1729 * named "refs/foo".1730 *1731 * - We got ENOENT and not EISDIR, so we1732 * know that there cannot be a loose1733 * reference named "refs/foo/bar/baz".1734 */1735}1736}else if(errno == EISDIR) {1737/*1738 * There is a directory in the way. It might have1739 * contained references that have been deleted. If1740 * we don't require that the reference already1741 * exists, try to remove the directory so that it1742 * doesn't cause trouble when we want to rename the1743 * lockfile into place later.1744 */1745if(mustexist) {1746/* Garden variety missing reference. */1747strbuf_addf(err,"unable to resolve reference '%s'",1748 refname);1749goto error_return;1750}else if(remove_dir_recursively(&ref_file,1751 REMOVE_DIR_EMPTY_ONLY)) {1752if(verify_refname_available_dir(1753 refname, extras, skip,1754get_loose_refs(&ref_cache),1755 err)) {1756/*1757 * The error message set by1758 * verify_refname_available() is OK.1759 */1760 ret = TRANSACTION_NAME_CONFLICT;1761goto error_return;1762}else{1763/*1764 * We can't delete the directory,1765 * but we also don't know of any1766 * references that it should1767 * contain.1768 */1769strbuf_addf(err,"there is a non-empty directory '%s' "1770"blocking reference '%s'",1771 ref_file.buf, refname);1772goto error_return;1773}1774}1775}else if(errno == EINVAL && (*type & REF_ISBROKEN)) {1776strbuf_addf(err,"unable to resolve reference '%s': "1777"reference broken", refname);1778goto error_return;1779}else{1780strbuf_addf(err,"unable to resolve reference '%s':%s",1781 refname,strerror(errno));1782goto error_return;1783}17841785/*1786 * If the ref did not exist and we are creating it,1787 * make sure there is no existing packed ref whose1788 * name begins with our refname, nor a packed ref1789 * whose name is a proper prefix of our refname.1790 */1791if(verify_refname_available_dir(1792 refname, extras, skip,1793get_packed_refs(&ref_cache),1794 err)) {1795goto error_return;1796}1797}17981799 ret =0;1800goto out;18011802error_return:1803unlock_ref(lock);1804*lock_p = NULL;18051806out:1807strbuf_release(&ref_file);1808return ret;1809}18101811/*1812 * Peel the entry (if possible) and return its new peel_status. If1813 * repeel is true, re-peel the entry even if there is an old peeled1814 * value that is already stored in it.1815 *1816 * It is OK to call this function with a packed reference entry that1817 * might be stale and might even refer to an object that has since1818 * been garbage-collected. In such a case, if the entry has1819 * REF_KNOWS_PEELED then leave the status unchanged and return1820 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1821 */1822static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1823{1824enum peel_status status;18251826if(entry->flag & REF_KNOWS_PEELED) {1827if(repeel) {1828 entry->flag &= ~REF_KNOWS_PEELED;1829oidclr(&entry->u.value.peeled);1830}else{1831returnis_null_oid(&entry->u.value.peeled) ?1832 PEEL_NON_TAG : PEEL_PEELED;1833}1834}1835if(entry->flag & REF_ISBROKEN)1836return PEEL_BROKEN;1837if(entry->flag & REF_ISSYMREF)1838return PEEL_IS_SYMREF;18391840 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1841if(status == PEEL_PEELED || status == PEEL_NON_TAG)1842 entry->flag |= REF_KNOWS_PEELED;1843return status;1844}18451846intpeel_ref(const char*refname,unsigned char*sha1)1847{1848int flag;1849unsigned char base[20];18501851if(current_ref_iter && current_ref_iter->refname == refname) {1852struct object_id peeled;18531854if(ref_iterator_peel(current_ref_iter, &peeled))1855return-1;1856hashcpy(sha1, peeled.hash);1857return0;1858}18591860if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1861return-1;18621863/*1864 * If the reference is packed, read its ref_entry from the1865 * cache in the hope that we already know its peeled value.1866 * We only try this optimization on packed references because1867 * (a) forcing the filling of the loose reference cache could1868 * be expensive and (b) loose references anyway usually do not1869 * have REF_KNOWS_PEELED.1870 */1871if(flag & REF_ISPACKED) {1872struct ref_entry *r =get_packed_ref(refname);1873if(r) {1874if(peel_entry(r,0))1875return-1;1876hashcpy(sha1, r->u.value.peeled.hash);1877return0;1878}1879}18801881returnpeel_object(base, sha1);1882}18831884struct files_ref_iterator {1885struct ref_iterator base;18861887struct packed_ref_cache *packed_ref_cache;1888struct ref_iterator *iter0;1889unsigned int flags;1890};18911892static intfiles_ref_iterator_advance(struct ref_iterator *ref_iterator)1893{1894struct files_ref_iterator *iter =1895(struct files_ref_iterator *)ref_iterator;1896int ok;18971898while((ok =ref_iterator_advance(iter->iter0)) == ITER_OK) {1899if(!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&1900!ref_resolves_to_object(iter->iter0->refname,1901 iter->iter0->oid,1902 iter->iter0->flags))1903continue;19041905 iter->base.refname = iter->iter0->refname;1906 iter->base.oid = iter->iter0->oid;1907 iter->base.flags = iter->iter0->flags;1908return ITER_OK;1909}19101911 iter->iter0 = NULL;1912if(ref_iterator_abort(ref_iterator) != ITER_DONE)1913 ok = ITER_ERROR;19141915return ok;1916}19171918static intfiles_ref_iterator_peel(struct ref_iterator *ref_iterator,1919struct object_id *peeled)1920{1921struct files_ref_iterator *iter =1922(struct files_ref_iterator *)ref_iterator;19231924returnref_iterator_peel(iter->iter0, peeled);1925}19261927static intfiles_ref_iterator_abort(struct ref_iterator *ref_iterator)1928{1929struct files_ref_iterator *iter =1930(struct files_ref_iterator *)ref_iterator;1931int ok = ITER_DONE;19321933if(iter->iter0)1934 ok =ref_iterator_abort(iter->iter0);19351936release_packed_ref_cache(iter->packed_ref_cache);1937base_ref_iterator_free(ref_iterator);1938return ok;1939}19401941static struct ref_iterator_vtable files_ref_iterator_vtable = {1942 files_ref_iterator_advance,1943 files_ref_iterator_peel,1944 files_ref_iterator_abort1945};19461947struct ref_iterator *files_ref_iterator_begin(1948const char*submodule,1949const char*prefix,unsigned int flags)1950{1951struct ref_cache *refs =get_ref_cache(submodule);1952struct ref_dir *loose_dir, *packed_dir;1953struct ref_iterator *loose_iter, *packed_iter;1954struct files_ref_iterator *iter;1955struct ref_iterator *ref_iterator;19561957if(!refs)1958returnempty_ref_iterator_begin();19591960if(ref_paranoia <0)1961 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1962if(ref_paranoia)1963 flags |= DO_FOR_EACH_INCLUDE_BROKEN;19641965 iter =xcalloc(1,sizeof(*iter));1966 ref_iterator = &iter->base;1967base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);19681969/*1970 * We must make sure that all loose refs are read before1971 * accessing the packed-refs file; this avoids a race1972 * condition if loose refs are migrated to the packed-refs1973 * file by a simultaneous process, but our in-memory view is1974 * from before the migration. We ensure this as follows:1975 * First, we call prime_ref_dir(), which pre-reads the loose1976 * references for the subtree into the cache. (If they've1977 * already been read, that's OK; we only need to guarantee1978 * that they're read before the packed refs, not *how much*1979 * before.) After that, we call get_packed_ref_cache(), which1980 * internally checks whether the packed-ref cache is up to1981 * date with what is on disk, and re-reads it if not.1982 */19831984 loose_dir =get_loose_refs(refs);19851986if(prefix && *prefix)1987 loose_dir =find_containing_dir(loose_dir, prefix,0);19881989if(loose_dir) {1990prime_ref_dir(loose_dir);1991 loose_iter =cache_ref_iterator_begin(loose_dir);1992}else{1993/* There's nothing to iterate over. */1994 loose_iter =empty_ref_iterator_begin();1995}19961997 iter->packed_ref_cache =get_packed_ref_cache(refs);1998acquire_packed_ref_cache(iter->packed_ref_cache);1999 packed_dir =get_packed_ref_dir(iter->packed_ref_cache);20002001if(prefix && *prefix)2002 packed_dir =find_containing_dir(packed_dir, prefix,0);20032004if(packed_dir) {2005 packed_iter =cache_ref_iterator_begin(packed_dir);2006}else{2007/* There's nothing to iterate over. */2008 packed_iter =empty_ref_iterator_begin();2009}20102011 iter->iter0 =overlay_ref_iterator_begin(loose_iter, packed_iter);2012 iter->flags = flags;20132014return ref_iterator;2015}20162017/*2018 * Verify that the reference locked by lock has the value old_sha1.2019 * Fail if the reference doesn't exist and mustexist is set. Return 02020 * on success. On error, write an error message to err, set errno, and2021 * return a negative value.2022 */2023static intverify_lock(struct ref_lock *lock,2024const unsigned char*old_sha1,int mustexist,2025struct strbuf *err)2026{2027assert(err);20282029if(read_ref_full(lock->ref_name,2030 mustexist ? RESOLVE_REF_READING :0,2031 lock->old_oid.hash, NULL)) {2032if(old_sha1) {2033int save_errno = errno;2034strbuf_addf(err,"can't verify ref '%s'", lock->ref_name);2035 errno = save_errno;2036return-1;2037}else{2038oidclr(&lock->old_oid);2039return0;2040}2041}2042if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {2043strbuf_addf(err,"ref '%s' is at%sbut expected%s",2044 lock->ref_name,2045oid_to_hex(&lock->old_oid),2046sha1_to_hex(old_sha1));2047 errno = EBUSY;2048return-1;2049}2050return0;2051}20522053static intremove_empty_directories(struct strbuf *path)2054{2055/*2056 * we want to create a file but there is a directory there;2057 * if that is an empty directory (or a directory that contains2058 * only empty directories), remove them.2059 */2060returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);2061}20622063/*2064 * Locks a ref returning the lock on success and NULL on failure.2065 * On failure errno is set to something meaningful.2066 */2067static struct ref_lock *lock_ref_sha1_basic(const char*refname,2068const unsigned char*old_sha1,2069const struct string_list *extras,2070const struct string_list *skip,2071unsigned int flags,int*type,2072struct strbuf *err)2073{2074struct strbuf ref_file = STRBUF_INIT;2075struct ref_lock *lock;2076int last_errno =0;2077int lflags = LOCK_NO_DEREF;2078int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2079int resolve_flags = RESOLVE_REF_NO_RECURSE;2080int attempts_remaining =3;2081int resolved;20822083assert(err);20842085 lock =xcalloc(1,sizeof(struct ref_lock));20862087if(mustexist)2088 resolve_flags |= RESOLVE_REF_READING;2089if(flags & REF_DELETING)2090 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;20912092strbuf_git_path(&ref_file,"%s", refname);2093 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2094 lock->old_oid.hash, type);2095if(!resolved && errno == EISDIR) {2096/*2097 * we are trying to lock foo but we used to2098 * have foo/bar which now does not exist;2099 * it is normal for the empty directory 'foo'2100 * to remain.2101 */2102if(remove_empty_directories(&ref_file)) {2103 last_errno = errno;2104if(!verify_refname_available_dir(refname, extras, skip,2105get_loose_refs(&ref_cache), err))2106strbuf_addf(err,"there are still refs under '%s'",2107 refname);2108goto error_return;2109}2110 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2111 lock->old_oid.hash, type);2112}2113if(!resolved) {2114 last_errno = errno;2115if(last_errno != ENOTDIR ||2116!verify_refname_available_dir(refname, extras, skip,2117get_loose_refs(&ref_cache), err))2118strbuf_addf(err,"unable to resolve reference '%s':%s",2119 refname,strerror(last_errno));21202121goto error_return;2122}21232124/*2125 * If the ref did not exist and we are creating it, make sure2126 * there is no existing packed ref whose name begins with our2127 * refname, nor a packed ref whose name is a proper prefix of2128 * our refname.2129 */2130if(is_null_oid(&lock->old_oid) &&2131verify_refname_available_dir(refname, extras, skip,2132get_packed_refs(&ref_cache), err)) {2133 last_errno = ENOTDIR;2134goto error_return;2135}21362137 lock->lk =xcalloc(1,sizeof(struct lock_file));21382139 lock->ref_name =xstrdup(refname);21402141 retry:2142switch(safe_create_leading_directories_const(ref_file.buf)) {2143case SCLD_OK:2144break;/* success */2145case SCLD_VANISHED:2146if(--attempts_remaining >0)2147goto retry;2148/* fall through */2149default:2150 last_errno = errno;2151strbuf_addf(err,"unable to create directory for '%s'",2152 ref_file.buf);2153goto error_return;2154}21552156if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {2157 last_errno = errno;2158if(errno == ENOENT && --attempts_remaining >0)2159/*2160 * Maybe somebody just deleted one of the2161 * directories leading to ref_file. Try2162 * again:2163 */2164goto retry;2165else{2166unable_to_lock_message(ref_file.buf, errno, err);2167goto error_return;2168}2169}2170if(verify_lock(lock, old_sha1, mustexist, err)) {2171 last_errno = errno;2172goto error_return;2173}2174goto out;21752176 error_return:2177unlock_ref(lock);2178 lock = NULL;21792180 out:2181strbuf_release(&ref_file);2182 errno = last_errno;2183return lock;2184}21852186/*2187 * Write an entry to the packed-refs file for the specified refname.2188 * If peeled is non-NULL, write it as the entry's peeled value.2189 */2190static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2191unsigned char*peeled)2192{2193fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2194if(peeled)2195fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2196}21972198/*2199 * An each_ref_entry_fn that writes the entry to a packed-refs file.2200 */2201static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2202{2203enum peel_status peel_status =peel_entry(entry,0);22042205if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2206error("internal error:%sis not a valid packed reference!",2207 entry->name);2208write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2209 peel_status == PEEL_PEELED ?2210 entry->u.value.peeled.hash : NULL);2211return0;2212}22132214/*2215 * Lock the packed-refs file for writing. Flags is passed to2216 * hold_lock_file_for_update(). Return 0 on success. On errors, set2217 * errno appropriately and return a nonzero value.2218 */2219static intlock_packed_refs(int flags)2220{2221static int timeout_configured =0;2222static int timeout_value =1000;22232224struct packed_ref_cache *packed_ref_cache;22252226if(!timeout_configured) {2227git_config_get_int("core.packedrefstimeout", &timeout_value);2228 timeout_configured =1;2229}22302231if(hold_lock_file_for_update_timeout(2232&packlock,git_path("packed-refs"),2233 flags, timeout_value) <0)2234return-1;2235/*2236 * Get the current packed-refs while holding the lock. If the2237 * packed-refs file has been modified since we last read it,2238 * this will automatically invalidate the cache and re-read2239 * the packed-refs file.2240 */2241 packed_ref_cache =get_packed_ref_cache(&ref_cache);2242 packed_ref_cache->lock = &packlock;2243/* Increment the reference count to prevent it from being freed: */2244acquire_packed_ref_cache(packed_ref_cache);2245return0;2246}22472248/*2249 * Write the current version of the packed refs cache from memory to2250 * disk. The packed-refs file must already be locked for writing (see2251 * lock_packed_refs()). Return zero on success. On errors, set errno2252 * and return a nonzero value2253 */2254static intcommit_packed_refs(void)2255{2256struct packed_ref_cache *packed_ref_cache =2257get_packed_ref_cache(&ref_cache);2258int error =0;2259int save_errno =0;2260FILE*out;22612262if(!packed_ref_cache->lock)2263die("internal error: packed-refs not locked");22642265 out =fdopen_lock_file(packed_ref_cache->lock,"w");2266if(!out)2267die_errno("unable to fdopen packed-refs descriptor");22682269fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2270do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),22710, write_packed_entry_fn, out);22722273if(commit_lock_file(packed_ref_cache->lock)) {2274 save_errno = errno;2275 error = -1;2276}2277 packed_ref_cache->lock = NULL;2278release_packed_ref_cache(packed_ref_cache);2279 errno = save_errno;2280return error;2281}22822283/*2284 * Rollback the lockfile for the packed-refs file, and discard the2285 * in-memory packed reference cache. (The packed-refs file will be2286 * read anew if it is needed again after this function is called.)2287 */2288static voidrollback_packed_refs(void)2289{2290struct packed_ref_cache *packed_ref_cache =2291get_packed_ref_cache(&ref_cache);22922293if(!packed_ref_cache->lock)2294die("internal error: packed-refs not locked");2295rollback_lock_file(packed_ref_cache->lock);2296 packed_ref_cache->lock = NULL;2297release_packed_ref_cache(packed_ref_cache);2298clear_packed_ref_cache(&ref_cache);2299}23002301struct ref_to_prune {2302struct ref_to_prune *next;2303unsigned char sha1[20];2304char name[FLEX_ARRAY];2305};23062307struct pack_refs_cb_data {2308unsigned int flags;2309struct ref_dir *packed_refs;2310struct ref_to_prune *ref_to_prune;2311};23122313/*2314 * An each_ref_entry_fn that is run over loose references only. If2315 * the loose reference can be packed, add an entry in the packed ref2316 * cache. If the reference should be pruned, also add it to2317 * ref_to_prune in the pack_refs_cb_data.2318 */2319static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2320{2321struct pack_refs_cb_data *cb = cb_data;2322enum peel_status peel_status;2323struct ref_entry *packed_entry;2324int is_tag_ref =starts_with(entry->name,"refs/tags/");23252326/* Do not pack per-worktree refs: */2327if(ref_type(entry->name) != REF_TYPE_NORMAL)2328return0;23292330/* ALWAYS pack tags */2331if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2332return0;23332334/* Do not pack symbolic or broken refs: */2335if((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))2336return0;23372338/* Add a packed ref cache entry equivalent to the loose entry. */2339 peel_status =peel_entry(entry,1);2340if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2341die("internal error peeling reference%s(%s)",2342 entry->name,oid_to_hex(&entry->u.value.oid));2343 packed_entry =find_ref(cb->packed_refs, entry->name);2344if(packed_entry) {2345/* Overwrite existing packed entry with info from loose entry */2346 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2347oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2348}else{2349 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2350 REF_ISPACKED | REF_KNOWS_PEELED,0);2351add_ref(cb->packed_refs, packed_entry);2352}2353oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);23542355/* Schedule the loose reference for pruning if requested. */2356if((cb->flags & PACK_REFS_PRUNE)) {2357struct ref_to_prune *n;2358FLEX_ALLOC_STR(n, name, entry->name);2359hashcpy(n->sha1, entry->u.value.oid.hash);2360 n->next = cb->ref_to_prune;2361 cb->ref_to_prune = n;2362}2363return0;2364}23652366/*2367 * Remove empty parents, but spare refs/ and immediate subdirs.2368 * Note: munges *name.2369 */2370static voidtry_remove_empty_parents(char*name)2371{2372char*p, *q;2373int i;2374 p = name;2375for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2376while(*p && *p !='/')2377 p++;2378/* tolerate duplicate slashes; see check_refname_format() */2379while(*p =='/')2380 p++;2381}2382for(q = p; *q; q++)2383;2384while(1) {2385while(q > p && *q !='/')2386 q--;2387while(q > p && *(q-1) =='/')2388 q--;2389if(q == p)2390break;2391*q ='\0';2392if(rmdir(git_path("%s", name)))2393break;2394}2395}23962397/* make sure nobody touched the ref, and unlink */2398static voidprune_ref(struct ref_to_prune *r)2399{2400struct ref_transaction *transaction;2401struct strbuf err = STRBUF_INIT;24022403if(check_refname_format(r->name,0))2404return;24052406 transaction =ref_transaction_begin(&err);2407if(!transaction ||2408ref_transaction_delete(transaction, r->name, r->sha1,2409 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2410ref_transaction_commit(transaction, &err)) {2411ref_transaction_free(transaction);2412error("%s", err.buf);2413strbuf_release(&err);2414return;2415}2416ref_transaction_free(transaction);2417strbuf_release(&err);2418try_remove_empty_parents(r->name);2419}24202421static voidprune_refs(struct ref_to_prune *r)2422{2423while(r) {2424prune_ref(r);2425 r = r->next;2426}2427}24282429intpack_refs(unsigned int flags)2430{2431struct pack_refs_cb_data cbdata;24322433memset(&cbdata,0,sizeof(cbdata));2434 cbdata.flags = flags;24352436lock_packed_refs(LOCK_DIE_ON_ERROR);2437 cbdata.packed_refs =get_packed_refs(&ref_cache);24382439do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2440 pack_if_possible_fn, &cbdata);24412442if(commit_packed_refs())2443die_errno("unable to overwrite old ref-pack file");24442445prune_refs(cbdata.ref_to_prune);2446return0;2447}24482449/*2450 * Rewrite the packed-refs file, omitting any refs listed in2451 * 'refnames'. On error, leave packed-refs unchanged, write an error2452 * message to 'err', and return a nonzero value.2453 *2454 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2455 */2456static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2457{2458struct ref_dir *packed;2459struct string_list_item *refname;2460int ret, needs_repacking =0, removed =0;24612462assert(err);24632464/* Look for a packed ref */2465for_each_string_list_item(refname, refnames) {2466if(get_packed_ref(refname->string)) {2467 needs_repacking =1;2468break;2469}2470}24712472/* Avoid locking if we have nothing to do */2473if(!needs_repacking)2474return0;/* no refname exists in packed refs */24752476if(lock_packed_refs(0)) {2477unable_to_lock_message(git_path("packed-refs"), errno, err);2478return-1;2479}2480 packed =get_packed_refs(&ref_cache);24812482/* Remove refnames from the cache */2483for_each_string_list_item(refname, refnames)2484if(remove_entry(packed, refname->string) != -1)2485 removed =1;2486if(!removed) {2487/*2488 * All packed entries disappeared while we were2489 * acquiring the lock.2490 */2491rollback_packed_refs();2492return0;2493}24942495/* Write what remains */2496 ret =commit_packed_refs();2497if(ret)2498strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2499strerror(errno));2500return ret;2501}25022503static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2504{2505assert(err);25062507if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2508/*2509 * loose. The loose file name is the same as the2510 * lockfile name, minus ".lock":2511 */2512char*loose_filename =get_locked_file_path(lock->lk);2513int res =unlink_or_msg(loose_filename, err);2514free(loose_filename);2515if(res)2516return1;2517}2518return0;2519}25202521intdelete_refs(struct string_list *refnames,unsigned int flags)2522{2523struct strbuf err = STRBUF_INIT;2524int i, result =0;25252526if(!refnames->nr)2527return0;25282529 result =repack_without_refs(refnames, &err);2530if(result) {2531/*2532 * If we failed to rewrite the packed-refs file, then2533 * it is unsafe to try to remove loose refs, because2534 * doing so might expose an obsolete packed value for2535 * a reference that might even point at an object that2536 * has been garbage collected.2537 */2538if(refnames->nr ==1)2539error(_("could not delete reference%s:%s"),2540 refnames->items[0].string, err.buf);2541else2542error(_("could not delete references:%s"), err.buf);25432544goto out;2545}25462547for(i =0; i < refnames->nr; i++) {2548const char*refname = refnames->items[i].string;25492550if(delete_ref(refname, NULL, flags))2551 result |=error(_("could not remove reference%s"), refname);2552}25532554out:2555strbuf_release(&err);2556return result;2557}25582559/*2560 * People using contrib's git-new-workdir have .git/logs/refs ->2561 * /some/other/path/.git/logs/refs, and that may live on another device.2562 *2563 * IOW, to avoid cross device rename errors, the temporary renamed log must2564 * live into logs/refs.2565 */2566#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"25672568static intrename_tmp_log(const char*newrefname)2569{2570int attempts_remaining =4;2571struct strbuf path = STRBUF_INIT;2572int ret = -1;25732574 retry:2575strbuf_reset(&path);2576strbuf_git_path(&path,"logs/%s", newrefname);2577switch(safe_create_leading_directories_const(path.buf)) {2578case SCLD_OK:2579break;/* success */2580case SCLD_VANISHED:2581if(--attempts_remaining >0)2582goto retry;2583/* fall through */2584default:2585error("unable to create directory for%s", newrefname);2586goto out;2587}25882589if(rename(git_path(TMP_RENAMED_LOG), path.buf)) {2590if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2591/*2592 * rename(a, b) when b is an existing2593 * directory ought to result in ISDIR, but2594 * Solaris 5.8 gives ENOTDIR. Sheesh.2595 */2596if(remove_empty_directories(&path)) {2597error("Directory not empty: logs/%s", newrefname);2598goto out;2599}2600goto retry;2601}else if(errno == ENOENT && --attempts_remaining >0) {2602/*2603 * Maybe another process just deleted one of2604 * the directories in the path to newrefname.2605 * Try again from the beginning.2606 */2607goto retry;2608}else{2609error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2610 newrefname,strerror(errno));2611goto out;2612}2613}2614 ret =0;2615out:2616strbuf_release(&path);2617return ret;2618}26192620intverify_refname_available(const char*newname,2621const struct string_list *extras,2622const struct string_list *skip,2623struct strbuf *err)2624{2625struct ref_dir *packed_refs =get_packed_refs(&ref_cache);2626struct ref_dir *loose_refs =get_loose_refs(&ref_cache);26272628if(verify_refname_available_dir(newname, extras, skip,2629 packed_refs, err) ||2630verify_refname_available_dir(newname, extras, skip,2631 loose_refs, err))2632return-1;26332634return0;2635}26362637static intwrite_ref_to_lockfile(struct ref_lock *lock,2638const unsigned char*sha1,struct strbuf *err);2639static intcommit_ref_update(struct ref_lock *lock,2640const unsigned char*sha1,const char*logmsg,2641struct strbuf *err);26422643intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2644{2645unsigned char sha1[20], orig_sha1[20];2646int flag =0, logmoved =0;2647struct ref_lock *lock;2648struct stat loginfo;2649int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2650struct strbuf err = STRBUF_INIT;26512652if(log &&S_ISLNK(loginfo.st_mode))2653returnerror("reflog for%sis a symlink", oldrefname);26542655if(!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2656 orig_sha1, &flag))2657returnerror("refname%snot found", oldrefname);26582659if(flag & REF_ISSYMREF)2660returnerror("refname%sis a symbolic ref, renaming it is not supported",2661 oldrefname);2662if(!rename_ref_available(oldrefname, newrefname))2663return1;26642665if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2666returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2667 oldrefname,strerror(errno));26682669if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2670error("unable to delete old%s", oldrefname);2671goto rollback;2672}26732674/*2675 * Since we are doing a shallow lookup, sha1 is not the2676 * correct value to pass to delete_ref as old_sha1. But that2677 * doesn't matter, because an old_sha1 check wouldn't add to2678 * the safety anyway; we want to delete the reference whatever2679 * its current value.2680 */2681if(!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2682 sha1, NULL) &&2683delete_ref(newrefname, NULL, REF_NODEREF)) {2684if(errno==EISDIR) {2685struct strbuf path = STRBUF_INIT;2686int result;26872688strbuf_git_path(&path,"%s", newrefname);2689 result =remove_empty_directories(&path);2690strbuf_release(&path);26912692if(result) {2693error("Directory not empty:%s", newrefname);2694goto rollback;2695}2696}else{2697error("unable to delete existing%s", newrefname);2698goto rollback;2699}2700}27012702if(log &&rename_tmp_log(newrefname))2703goto rollback;27042705 logmoved = log;27062707 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, REF_NODEREF,2708 NULL, &err);2709if(!lock) {2710error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2711strbuf_release(&err);2712goto rollback;2713}2714hashcpy(lock->old_oid.hash, orig_sha1);27152716if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2717commit_ref_update(lock, orig_sha1, logmsg, &err)) {2718error("unable to write current sha1 into%s:%s", newrefname, err.buf);2719strbuf_release(&err);2720goto rollback;2721}27222723return0;27242725 rollback:2726 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, REF_NODEREF,2727 NULL, &err);2728if(!lock) {2729error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2730strbuf_release(&err);2731goto rollbacklog;2732}27332734 flag = log_all_ref_updates;2735 log_all_ref_updates =0;2736if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2737commit_ref_update(lock, orig_sha1, NULL, &err)) {2738error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2739strbuf_release(&err);2740}2741 log_all_ref_updates = flag;27422743 rollbacklog:2744if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2745error("unable to restore logfile%sfrom%s:%s",2746 oldrefname, newrefname,strerror(errno));2747if(!logmoved && log &&2748rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2749error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2750 oldrefname,strerror(errno));27512752return1;2753}27542755static intclose_ref(struct ref_lock *lock)2756{2757if(close_lock_file(lock->lk))2758return-1;2759return0;2760}27612762static intcommit_ref(struct ref_lock *lock)2763{2764char*path =get_locked_file_path(lock->lk);2765struct stat st;27662767if(!lstat(path, &st) &&S_ISDIR(st.st_mode)) {2768/*2769 * There is a directory at the path we want to rename2770 * the lockfile to. Hopefully it is empty; try to2771 * delete it.2772 */2773size_t len =strlen(path);2774struct strbuf sb_path = STRBUF_INIT;27752776strbuf_attach(&sb_path, path, len, len);27772778/*2779 * If this fails, commit_lock_file() will also fail2780 * and will report the problem.2781 */2782remove_empty_directories(&sb_path);2783strbuf_release(&sb_path);2784}else{2785free(path);2786}27872788if(commit_lock_file(lock->lk))2789return-1;2790return0;2791}27922793/*2794 * Create a reflog for a ref. If force_create = 0, the reflog will2795 * only be created for certain refs (those for which2796 * should_autocreate_reflog returns non-zero. Otherwise, create it2797 * regardless of the ref name. Fill in *err and return -1 on failure.2798 */2799static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)2800{2801int logfd, oflags = O_APPEND | O_WRONLY;28022803strbuf_git_path(logfile,"logs/%s", refname);2804if(force_create ||should_autocreate_reflog(refname)) {2805if(safe_create_leading_directories(logfile->buf) <0) {2806strbuf_addf(err,"unable to create directory for '%s': "2807"%s", logfile->buf,strerror(errno));2808return-1;2809}2810 oflags |= O_CREAT;2811}28122813 logfd =open(logfile->buf, oflags,0666);2814if(logfd <0) {2815if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2816return0;28172818if(errno == EISDIR) {2819if(remove_empty_directories(logfile)) {2820strbuf_addf(err,"there are still logs under "2821"'%s'", logfile->buf);2822return-1;2823}2824 logfd =open(logfile->buf, oflags,0666);2825}28262827if(logfd <0) {2828strbuf_addf(err,"unable to append to '%s':%s",2829 logfile->buf,strerror(errno));2830return-1;2831}2832}28332834adjust_shared_perm(logfile->buf);2835close(logfd);2836return0;2837}283828392840intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)2841{2842int ret;2843struct strbuf sb = STRBUF_INIT;28442845 ret =log_ref_setup(refname, &sb, err, force_create);2846strbuf_release(&sb);2847return ret;2848}28492850static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2851const unsigned char*new_sha1,2852const char*committer,const char*msg)2853{2854int msglen, written;2855unsigned maxlen, len;2856char*logrec;28572858 msglen = msg ?strlen(msg) :0;2859 maxlen =strlen(committer) + msglen +100;2860 logrec =xmalloc(maxlen);2861 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2862sha1_to_hex(old_sha1),2863sha1_to_hex(new_sha1),2864 committer);2865if(msglen)2866 len +=copy_reflog_msg(logrec + len -1, msg) -1;28672868 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2869free(logrec);2870if(written != len)2871return-1;28722873return0;2874}28752876static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,2877const unsigned char*new_sha1,const char*msg,2878struct strbuf *logfile,int flags,2879struct strbuf *err)2880{2881int logfd, result, oflags = O_APPEND | O_WRONLY;28822883if(log_all_ref_updates <0)2884 log_all_ref_updates = !is_bare_repository();28852886 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);28872888if(result)2889return result;28902891 logfd =open(logfile->buf, oflags);2892if(logfd <0)2893return0;2894 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2895git_committer_info(0), msg);2896if(result) {2897strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2898strerror(errno));2899close(logfd);2900return-1;2901}2902if(close(logfd)) {2903strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2904strerror(errno));2905return-1;2906}2907return0;2908}29092910static intlog_ref_write(const char*refname,const unsigned char*old_sha1,2911const unsigned char*new_sha1,const char*msg,2912int flags,struct strbuf *err)2913{2914returnfiles_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2915 err);2916}29172918intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2919const unsigned char*new_sha1,const char*msg,2920int flags,struct strbuf *err)2921{2922struct strbuf sb = STRBUF_INIT;2923int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2924 err);2925strbuf_release(&sb);2926return ret;2927}29282929/*2930 * Write sha1 into the open lockfile, then close the lockfile. On2931 * errors, rollback the lockfile, fill in *err and2932 * return -1.2933 */2934static intwrite_ref_to_lockfile(struct ref_lock *lock,2935const unsigned char*sha1,struct strbuf *err)2936{2937static char term ='\n';2938struct object *o;2939int fd;29402941 o =parse_object(sha1);2942if(!o) {2943strbuf_addf(err,2944"trying to write ref '%s' with nonexistent object%s",2945 lock->ref_name,sha1_to_hex(sha1));2946unlock_ref(lock);2947return-1;2948}2949if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2950strbuf_addf(err,2951"trying to write non-commit object%sto branch '%s'",2952sha1_to_hex(sha1), lock->ref_name);2953unlock_ref(lock);2954return-1;2955}2956 fd =get_lock_file_fd(lock->lk);2957if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2958write_in_full(fd, &term,1) !=1||2959close_ref(lock) <0) {2960strbuf_addf(err,2961"couldn't write '%s'",get_lock_file_path(lock->lk));2962unlock_ref(lock);2963return-1;2964}2965return0;2966}29672968/*2969 * Commit a change to a loose reference that has already been written2970 * to the loose reference lockfile. Also update the reflogs if2971 * necessary, using the specified lockmsg (which can be NULL).2972 */2973static intcommit_ref_update(struct ref_lock *lock,2974const unsigned char*sha1,const char*logmsg,2975struct strbuf *err)2976{2977clear_loose_ref_cache(&ref_cache);2978if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg,0, err)) {2979char*old_msg =strbuf_detach(err, NULL);2980strbuf_addf(err,"cannot update the ref '%s':%s",2981 lock->ref_name, old_msg);2982free(old_msg);2983unlock_ref(lock);2984return-1;2985}29862987if(strcmp(lock->ref_name,"HEAD") !=0) {2988/*2989 * Special hack: If a branch is updated directly and HEAD2990 * points to it (may happen on the remote side of a push2991 * for example) then logically the HEAD reflog should be2992 * updated too.2993 * A generic solution implies reverse symref information,2994 * but finding all symrefs pointing to the given branch2995 * would be rather costly for this rare event (the direct2996 * update of a branch) to be worth it. So let's cheat and2997 * check with HEAD only which should cover 99% of all usage2998 * scenarios (even 100% of the default ones).2999 */3000unsigned char head_sha1[20];3001int head_flag;3002const char*head_ref;30033004 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3005 head_sha1, &head_flag);3006if(head_ref && (head_flag & REF_ISSYMREF) &&3007!strcmp(head_ref, lock->ref_name)) {3008struct strbuf log_err = STRBUF_INIT;3009if(log_ref_write("HEAD", lock->old_oid.hash, sha1,3010 logmsg,0, &log_err)) {3011error("%s", log_err.buf);3012strbuf_release(&log_err);3013}3014}3015}30163017if(commit_ref(lock)) {3018strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3019unlock_ref(lock);3020return-1;3021}30223023unlock_ref(lock);3024return0;3025}30263027static intcreate_ref_symlink(struct ref_lock *lock,const char*target)3028{3029int ret = -1;3030#ifndef NO_SYMLINK_HEAD3031char*ref_path =get_locked_file_path(lock->lk);3032unlink(ref_path);3033 ret =symlink(target, ref_path);3034free(ref_path);30353036if(ret)3037fprintf(stderr,"no symlink - falling back to symbolic ref\n");3038#endif3039return ret;3040}30413042static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,3043const char*target,const char*logmsg)3044{3045struct strbuf err = STRBUF_INIT;3046unsigned char new_sha1[20];3047if(logmsg && !read_ref(target, new_sha1) &&3048log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg,0, &err)) {3049error("%s", err.buf);3050strbuf_release(&err);3051}3052}30533054static intcreate_symref_locked(struct ref_lock *lock,const char*refname,3055const char*target,const char*logmsg)3056{3057if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {3058update_symref_reflog(lock, refname, target, logmsg);3059return0;3060}30613062if(!fdopen_lock_file(lock->lk,"w"))3063returnerror("unable to fdopen%s:%s",3064 lock->lk->tempfile.filename.buf,strerror(errno));30653066update_symref_reflog(lock, refname, target, logmsg);30673068/* no error check; commit_ref will check ferror */3069fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);3070if(commit_ref(lock) <0)3071returnerror("unable to write symref for%s:%s", refname,3072strerror(errno));3073return0;3074}30753076intcreate_symref(const char*refname,const char*target,const char*logmsg)3077{3078struct strbuf err = STRBUF_INIT;3079struct ref_lock *lock;3080int ret;30813082 lock =lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,3083&err);3084if(!lock) {3085error("%s", err.buf);3086strbuf_release(&err);3087return-1;3088}30893090 ret =create_symref_locked(lock, refname, target, logmsg);3091unlock_ref(lock);3092return ret;3093}30943095intset_worktree_head_symref(const char*gitdir,const char*target)3096{3097static struct lock_file head_lock;3098struct ref_lock *lock;3099struct strbuf head_path = STRBUF_INIT;3100const char*head_rel;3101int ret;31023103strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));3104if(hold_lock_file_for_update(&head_lock, head_path.buf,3105 LOCK_NO_DEREF) <0) {3106struct strbuf err = STRBUF_INIT;3107unable_to_lock_message(head_path.buf, errno, &err);3108error("%s", err.buf);3109strbuf_release(&err);3110strbuf_release(&head_path);3111return-1;3112}31133114/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3115 linked trees */3116 head_rel =remove_leading_path(head_path.buf,3117absolute_path(get_git_common_dir()));3118/* to make use of create_symref_locked(), initialize ref_lock */3119 lock =xcalloc(1,sizeof(struct ref_lock));3120 lock->lk = &head_lock;3121 lock->ref_name =xstrdup(head_rel);31223123 ret =create_symref_locked(lock, head_rel, target, NULL);31243125unlock_ref(lock);/* will free lock */3126strbuf_release(&head_path);3127return ret;3128}31293130intreflog_exists(const char*refname)3131{3132struct stat st;31333134return!lstat(git_path("logs/%s", refname), &st) &&3135S_ISREG(st.st_mode);3136}31373138intdelete_reflog(const char*refname)3139{3140returnremove_path(git_path("logs/%s", refname));3141}31423143static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3144{3145unsigned char osha1[20], nsha1[20];3146char*email_end, *message;3147unsigned long timestamp;3148int tz;31493150/* old SP new SP name <email> SP time TAB msg LF */3151if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3152get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3153get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3154!(email_end =strchr(sb->buf +82,'>')) ||3155 email_end[1] !=' '||3156!(timestamp =strtoul(email_end +2, &message,10)) ||3157!message || message[0] !=' '||3158(message[1] !='+'&& message[1] !='-') ||3159!isdigit(message[2]) || !isdigit(message[3]) ||3160!isdigit(message[4]) || !isdigit(message[5]))3161return0;/* corrupt? */3162 email_end[1] ='\0';3163 tz =strtol(message +1, NULL,10);3164if(message[6] !='\t')3165 message +=6;3166else3167 message +=7;3168returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3169}31703171static char*find_beginning_of_line(char*bob,char*scan)3172{3173while(bob < scan && *(--scan) !='\n')3174;/* keep scanning backwards */3175/*3176 * Return either beginning of the buffer, or LF at the end of3177 * the previous line.3178 */3179return scan;3180}31813182intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)3183{3184struct strbuf sb = STRBUF_INIT;3185FILE*logfp;3186long pos;3187int ret =0, at_tail =1;31883189 logfp =fopen(git_path("logs/%s", refname),"r");3190if(!logfp)3191return-1;31923193/* Jump to the end */3194if(fseek(logfp,0, SEEK_END) <0)3195returnerror("cannot seek back reflog for%s:%s",3196 refname,strerror(errno));3197 pos =ftell(logfp);3198while(!ret &&0< pos) {3199int cnt;3200size_t nread;3201char buf[BUFSIZ];3202char*endp, *scanp;32033204/* Fill next block from the end */3205 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3206if(fseek(logfp, pos - cnt, SEEK_SET))3207returnerror("cannot seek back reflog for%s:%s",3208 refname,strerror(errno));3209 nread =fread(buf, cnt,1, logfp);3210if(nread !=1)3211returnerror("cannot read%dbytes from reflog for%s:%s",3212 cnt, refname,strerror(errno));3213 pos -= cnt;32143215 scanp = endp = buf + cnt;3216if(at_tail && scanp[-1] =='\n')3217/* Looking at the final LF at the end of the file */3218 scanp--;3219 at_tail =0;32203221while(buf < scanp) {3222/*3223 * terminating LF of the previous line, or the beginning3224 * of the buffer.3225 */3226char*bp;32273228 bp =find_beginning_of_line(buf, scanp);32293230if(*bp =='\n') {3231/*3232 * The newline is the end of the previous line,3233 * so we know we have complete line starting3234 * at (bp + 1). Prefix it onto any prior data3235 * we collected for the line and process it.3236 */3237strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3238 scanp = bp;3239 endp = bp +1;3240 ret =show_one_reflog_ent(&sb, fn, cb_data);3241strbuf_reset(&sb);3242if(ret)3243break;3244}else if(!pos) {3245/*3246 * We are at the start of the buffer, and the3247 * start of the file; there is no previous3248 * line, and we have everything for this one.3249 * Process it, and we can end the loop.3250 */3251strbuf_splice(&sb,0,0, buf, endp - buf);3252 ret =show_one_reflog_ent(&sb, fn, cb_data);3253strbuf_reset(&sb);3254break;3255}32563257if(bp == buf) {3258/*3259 * We are at the start of the buffer, and there3260 * is more file to read backwards. Which means3261 * we are in the middle of a line. Note that we3262 * may get here even if *bp was a newline; that3263 * just means we are at the exact end of the3264 * previous line, rather than some spot in the3265 * middle.3266 *3267 * Save away what we have to be combined with3268 * the data from the next read.3269 */3270strbuf_splice(&sb,0,0, buf, endp - buf);3271break;3272}3273}32743275}3276if(!ret && sb.len)3277die("BUG: reverse reflog parser had leftover data");32783279fclose(logfp);3280strbuf_release(&sb);3281return ret;3282}32833284intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3285{3286FILE*logfp;3287struct strbuf sb = STRBUF_INIT;3288int ret =0;32893290 logfp =fopen(git_path("logs/%s", refname),"r");3291if(!logfp)3292return-1;32933294while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3295 ret =show_one_reflog_ent(&sb, fn, cb_data);3296fclose(logfp);3297strbuf_release(&sb);3298return ret;3299}33003301struct files_reflog_iterator {3302struct ref_iterator base;33033304struct dir_iterator *dir_iterator;3305struct object_id oid;3306};33073308static intfiles_reflog_iterator_advance(struct ref_iterator *ref_iterator)3309{3310struct files_reflog_iterator *iter =3311(struct files_reflog_iterator *)ref_iterator;3312struct dir_iterator *diter = iter->dir_iterator;3313int ok;33143315while((ok =dir_iterator_advance(diter)) == ITER_OK) {3316int flags;33173318if(!S_ISREG(diter->st.st_mode))3319continue;3320if(diter->basename[0] =='.')3321continue;3322if(ends_with(diter->basename,".lock"))3323continue;33243325if(read_ref_full(diter->relative_path,0,3326 iter->oid.hash, &flags)) {3327error("bad ref for%s", diter->path.buf);3328continue;3329}33303331 iter->base.refname = diter->relative_path;3332 iter->base.oid = &iter->oid;3333 iter->base.flags = flags;3334return ITER_OK;3335}33363337 iter->dir_iterator = NULL;3338if(ref_iterator_abort(ref_iterator) == ITER_ERROR)3339 ok = ITER_ERROR;3340return ok;3341}33423343static intfiles_reflog_iterator_peel(struct ref_iterator *ref_iterator,3344struct object_id *peeled)3345{3346die("BUG: ref_iterator_peel() called for reflog_iterator");3347}33483349static intfiles_reflog_iterator_abort(struct ref_iterator *ref_iterator)3350{3351struct files_reflog_iterator *iter =3352(struct files_reflog_iterator *)ref_iterator;3353int ok = ITER_DONE;33543355if(iter->dir_iterator)3356 ok =dir_iterator_abort(iter->dir_iterator);33573358base_ref_iterator_free(ref_iterator);3359return ok;3360}33613362static struct ref_iterator_vtable files_reflog_iterator_vtable = {3363 files_reflog_iterator_advance,3364 files_reflog_iterator_peel,3365 files_reflog_iterator_abort3366};33673368struct ref_iterator *files_reflog_iterator_begin(void)3369{3370struct files_reflog_iterator *iter =xcalloc(1,sizeof(*iter));3371struct ref_iterator *ref_iterator = &iter->base;33723373base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);3374 iter->dir_iterator =dir_iterator_begin(git_path("logs"));3375return ref_iterator;3376}33773378intfor_each_reflog(each_ref_fn fn,void*cb_data)3379{3380returndo_for_each_ref_iterator(files_reflog_iterator_begin(),3381 fn, cb_data);3382}33833384static intref_update_reject_duplicates(struct string_list *refnames,3385struct strbuf *err)3386{3387int i, n = refnames->nr;33883389assert(err);33903391for(i =1; i < n; i++)3392if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3393strbuf_addf(err,3394"multiple updates for ref '%s' not allowed.",3395 refnames->items[i].string);3396return1;3397}3398return0;3399}34003401/*3402 * If update is a direct update of head_ref (the reference pointed to3403 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3404 */3405static intsplit_head_update(struct ref_update *update,3406struct ref_transaction *transaction,3407const char*head_ref,3408struct string_list *affected_refnames,3409struct strbuf *err)3410{3411struct string_list_item *item;3412struct ref_update *new_update;34133414if((update->flags & REF_LOG_ONLY) ||3415(update->flags & REF_ISPRUNING) ||3416(update->flags & REF_UPDATE_VIA_HEAD))3417return0;34183419if(strcmp(update->refname, head_ref))3420return0;34213422/*3423 * First make sure that HEAD is not already in the3424 * transaction. This insertion is O(N) in the transaction3425 * size, but it happens at most once per transaction.3426 */3427 item =string_list_insert(affected_refnames,"HEAD");3428if(item->util) {3429/* An entry already existed */3430strbuf_addf(err,3431"multiple updates for 'HEAD' (including one "3432"via its referent '%s') are not allowed",3433 update->refname);3434return TRANSACTION_NAME_CONFLICT;3435}34363437 new_update =ref_transaction_add_update(3438 transaction,"HEAD",3439 update->flags | REF_LOG_ONLY | REF_NODEREF,3440 update->new_sha1, update->old_sha1,3441 update->msg);34423443 item->util = new_update;34443445return0;3446}34473448/*3449 * update is for a symref that points at referent and doesn't have3450 * REF_NODEREF set. Split it into two updates:3451 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3452 * - A new, separate update for the referent reference3453 * Note that the new update will itself be subject to splitting when3454 * the iteration gets to it.3455 */3456static intsplit_symref_update(struct ref_update *update,3457const char*referent,3458struct ref_transaction *transaction,3459struct string_list *affected_refnames,3460struct strbuf *err)3461{3462struct string_list_item *item;3463struct ref_update *new_update;3464unsigned int new_flags;34653466/*3467 * First make sure that referent is not already in the3468 * transaction. This insertion is O(N) in the transaction3469 * size, but it happens at most once per symref in a3470 * transaction.3471 */3472 item =string_list_insert(affected_refnames, referent);3473if(item->util) {3474/* An entry already existed */3475strbuf_addf(err,3476"multiple updates for '%s' (including one "3477"via symref '%s') are not allowed",3478 referent, update->refname);3479return TRANSACTION_NAME_CONFLICT;3480}34813482 new_flags = update->flags;3483if(!strcmp(update->refname,"HEAD")) {3484/*3485 * Record that the new update came via HEAD, so that3486 * when we process it, split_head_update() doesn't try3487 * to add another reflog update for HEAD. Note that3488 * this bit will be propagated if the new_update3489 * itself needs to be split.3490 */3491 new_flags |= REF_UPDATE_VIA_HEAD;3492}34933494 new_update =ref_transaction_add_update(3495 transaction, referent, new_flags,3496 update->new_sha1, update->old_sha1,3497 update->msg);34983499 new_update->parent_update = update;35003501/*3502 * Change the symbolic ref update to log only. Also, it3503 * doesn't need to check its old SHA-1 value, as that will be3504 * done when new_update is processed.3505 */3506 update->flags |= REF_LOG_ONLY | REF_NODEREF;3507 update->flags &= ~REF_HAVE_OLD;35083509 item->util = new_update;35103511return0;3512}35133514/*3515 * Return the refname under which update was originally requested.3516 */3517static const char*original_update_refname(struct ref_update *update)3518{3519while(update->parent_update)3520 update = update->parent_update;35213522return update->refname;3523}35243525/*3526 * Check whether the REF_HAVE_OLD and old_oid values stored in update3527 * are consistent with oid, which is the reference's current value. If3528 * everything is OK, return 0; otherwise, write an error message to3529 * err and return -1.3530 */3531static intcheck_old_oid(struct ref_update *update,struct object_id *oid,3532struct strbuf *err)3533{3534if(!(update->flags & REF_HAVE_OLD) ||3535!hashcmp(oid->hash, update->old_sha1))3536return0;35373538if(is_null_sha1(update->old_sha1))3539strbuf_addf(err,"cannot lock ref '%s': "3540"reference already exists",3541original_update_refname(update));3542else if(is_null_oid(oid))3543strbuf_addf(err,"cannot lock ref '%s': "3544"reference is missing but expected%s",3545original_update_refname(update),3546sha1_to_hex(update->old_sha1));3547else3548strbuf_addf(err,"cannot lock ref '%s': "3549"is at%sbut expected%s",3550original_update_refname(update),3551oid_to_hex(oid),3552sha1_to_hex(update->old_sha1));35533554return-1;3555}35563557/*3558 * Prepare for carrying out update:3559 * - Lock the reference referred to by update.3560 * - Read the reference under lock.3561 * - Check that its old SHA-1 value (if specified) is correct, and in3562 * any case record it in update->lock->old_oid for later use when3563 * writing the reflog.3564 * - If it is a symref update without REF_NODEREF, split it up into a3565 * REF_LOG_ONLY update of the symref and add a separate update for3566 * the referent to transaction.3567 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3568 * update of HEAD.3569 */3570static intlock_ref_for_update(struct ref_update *update,3571struct ref_transaction *transaction,3572const char*head_ref,3573struct string_list *affected_refnames,3574struct strbuf *err)3575{3576struct strbuf referent = STRBUF_INIT;3577int mustexist = (update->flags & REF_HAVE_OLD) &&3578!is_null_sha1(update->old_sha1);3579int ret;3580struct ref_lock *lock;35813582if((update->flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1))3583 update->flags |= REF_DELETING;35843585if(head_ref) {3586 ret =split_head_update(update, transaction, head_ref,3587 affected_refnames, err);3588if(ret)3589return ret;3590}35913592 ret =lock_raw_ref(update->refname, mustexist,3593 affected_refnames, NULL,3594&update->lock, &referent,3595&update->type, err);35963597if(ret) {3598char*reason;35993600 reason =strbuf_detach(err, NULL);3601strbuf_addf(err,"cannot lock ref '%s':%s",3602original_update_refname(update), reason);3603free(reason);3604return ret;3605}36063607 lock = update->lock;36083609if(update->type & REF_ISSYMREF) {3610if(update->flags & REF_NODEREF) {3611/*3612 * We won't be reading the referent as part of3613 * the transaction, so we have to read it here3614 * to record and possibly check old_sha1:3615 */3616if(read_ref_full(referent.buf,0,3617 lock->old_oid.hash, NULL)) {3618if(update->flags & REF_HAVE_OLD) {3619strbuf_addf(err,"cannot lock ref '%s': "3620"error reading reference",3621original_update_refname(update));3622return-1;3623}3624}else if(check_old_oid(update, &lock->old_oid, err)) {3625return TRANSACTION_GENERIC_ERROR;3626}3627}else{3628/*3629 * Create a new update for the reference this3630 * symref is pointing at. Also, we will record3631 * and verify old_sha1 for this update as part3632 * of processing the split-off update, so we3633 * don't have to do it here.3634 */3635 ret =split_symref_update(update, referent.buf, transaction,3636 affected_refnames, err);3637if(ret)3638return ret;3639}3640}else{3641struct ref_update *parent_update;36423643if(check_old_oid(update, &lock->old_oid, err))3644return TRANSACTION_GENERIC_ERROR;36453646/*3647 * If this update is happening indirectly because of a3648 * symref update, record the old SHA-1 in the parent3649 * update:3650 */3651for(parent_update = update->parent_update;3652 parent_update;3653 parent_update = parent_update->parent_update) {3654oidcpy(&parent_update->lock->old_oid, &lock->old_oid);3655}3656}36573658if((update->flags & REF_HAVE_NEW) &&3659!(update->flags & REF_DELETING) &&3660!(update->flags & REF_LOG_ONLY)) {3661if(!(update->type & REF_ISSYMREF) &&3662!hashcmp(lock->old_oid.hash, update->new_sha1)) {3663/*3664 * The reference already has the desired3665 * value, so we don't need to write it.3666 */3667}else if(write_ref_to_lockfile(lock, update->new_sha1,3668 err)) {3669char*write_err =strbuf_detach(err, NULL);36703671/*3672 * The lock was freed upon failure of3673 * write_ref_to_lockfile():3674 */3675 update->lock = NULL;3676strbuf_addf(err,3677"cannot update ref '%s':%s",3678 update->refname, write_err);3679free(write_err);3680return TRANSACTION_GENERIC_ERROR;3681}else{3682 update->flags |= REF_NEEDS_COMMIT;3683}3684}3685if(!(update->flags & REF_NEEDS_COMMIT)) {3686/*3687 * We didn't call write_ref_to_lockfile(), so3688 * the lockfile is still open. Close it to3689 * free up the file descriptor:3690 */3691if(close_ref(lock)) {3692strbuf_addf(err,"couldn't close '%s.lock'",3693 update->refname);3694return TRANSACTION_GENERIC_ERROR;3695}3696}3697return0;3698}36993700intref_transaction_commit(struct ref_transaction *transaction,3701struct strbuf *err)3702{3703int ret =0, i;3704struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3705struct string_list_item *ref_to_delete;3706struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3707char*head_ref = NULL;3708int head_type;3709struct object_id head_oid;37103711assert(err);37123713if(transaction->state != REF_TRANSACTION_OPEN)3714die("BUG: commit called for transaction that is not open");37153716if(!transaction->nr) {3717 transaction->state = REF_TRANSACTION_CLOSED;3718return0;3719}37203721/*3722 * Fail if a refname appears more than once in the3723 * transaction. (If we end up splitting up any updates using3724 * split_symref_update() or split_head_update(), those3725 * functions will check that the new updates don't have the3726 * same refname as any existing ones.)3727 */3728for(i =0; i < transaction->nr; i++) {3729struct ref_update *update = transaction->updates[i];3730struct string_list_item *item =3731string_list_append(&affected_refnames, update->refname);37323733/*3734 * We store a pointer to update in item->util, but at3735 * the moment we never use the value of this field3736 * except to check whether it is non-NULL.3737 */3738 item->util = update;3739}3740string_list_sort(&affected_refnames);3741if(ref_update_reject_duplicates(&affected_refnames, err)) {3742 ret = TRANSACTION_GENERIC_ERROR;3743goto cleanup;3744}37453746/*3747 * Special hack: If a branch is updated directly and HEAD3748 * points to it (may happen on the remote side of a push3749 * for example) then logically the HEAD reflog should be3750 * updated too.3751 *3752 * A generic solution would require reverse symref lookups,3753 * but finding all symrefs pointing to a given branch would be3754 * rather costly for this rare event (the direct update of a3755 * branch) to be worth it. So let's cheat and check with HEAD3756 * only, which should cover 99% of all usage scenarios (even3757 * 100% of the default ones).3758 *3759 * So if HEAD is a symbolic reference, then record the name of3760 * the reference that it points to. If we see an update of3761 * head_ref within the transaction, then split_head_update()3762 * arranges for the reflog of HEAD to be updated, too.3763 */3764 head_ref =resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3765 head_oid.hash, &head_type);37663767if(head_ref && !(head_type & REF_ISSYMREF)) {3768free(head_ref);3769 head_ref = NULL;3770}37713772/*3773 * Acquire all locks, verify old values if provided, check3774 * that new values are valid, and write new values to the3775 * lockfiles, ready to be activated. Only keep one lockfile3776 * open at a time to avoid running out of file descriptors.3777 */3778for(i =0; i < transaction->nr; i++) {3779struct ref_update *update = transaction->updates[i];37803781 ret =lock_ref_for_update(update, transaction, head_ref,3782&affected_refnames, err);3783if(ret)3784goto cleanup;3785}37863787/* Perform updates first so live commits remain referenced */3788for(i =0; i < transaction->nr; i++) {3789struct ref_update *update = transaction->updates[i];3790struct ref_lock *lock = update->lock;37913792if(update->flags & REF_NEEDS_COMMIT ||3793 update->flags & REF_LOG_ONLY) {3794if(log_ref_write(lock->ref_name, lock->old_oid.hash,3795 update->new_sha1,3796 update->msg, update->flags, err)) {3797char*old_msg =strbuf_detach(err, NULL);37983799strbuf_addf(err,"cannot update the ref '%s':%s",3800 lock->ref_name, old_msg);3801free(old_msg);3802unlock_ref(lock);3803 update->lock = NULL;3804 ret = TRANSACTION_GENERIC_ERROR;3805goto cleanup;3806}3807}3808if(update->flags & REF_NEEDS_COMMIT) {3809clear_loose_ref_cache(&ref_cache);3810if(commit_ref(lock)) {3811strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3812unlock_ref(lock);3813 update->lock = NULL;3814 ret = TRANSACTION_GENERIC_ERROR;3815goto cleanup;3816}3817}3818}3819/* Perform deletes now that updates are safely completed */3820for(i =0; i < transaction->nr; i++) {3821struct ref_update *update = transaction->updates[i];38223823if(update->flags & REF_DELETING &&3824!(update->flags & REF_LOG_ONLY)) {3825if(delete_ref_loose(update->lock, update->type, err)) {3826 ret = TRANSACTION_GENERIC_ERROR;3827goto cleanup;3828}38293830if(!(update->flags & REF_ISPRUNING))3831string_list_append(&refs_to_delete,3832 update->lock->ref_name);3833}3834}38353836if(repack_without_refs(&refs_to_delete, err)) {3837 ret = TRANSACTION_GENERIC_ERROR;3838goto cleanup;3839}3840for_each_string_list_item(ref_to_delete, &refs_to_delete)3841unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3842clear_loose_ref_cache(&ref_cache);38433844cleanup:3845 transaction->state = REF_TRANSACTION_CLOSED;38463847for(i =0; i < transaction->nr; i++)3848if(transaction->updates[i]->lock)3849unlock_ref(transaction->updates[i]->lock);3850string_list_clear(&refs_to_delete,0);3851free(head_ref);3852string_list_clear(&affected_refnames,0);38533854return ret;3855}38563857static intref_present(const char*refname,3858const struct object_id *oid,int flags,void*cb_data)3859{3860struct string_list *affected_refnames = cb_data;38613862returnstring_list_has_string(affected_refnames, refname);3863}38643865intinitial_ref_transaction_commit(struct ref_transaction *transaction,3866struct strbuf *err)3867{3868int ret =0, i;3869struct string_list affected_refnames = STRING_LIST_INIT_NODUP;38703871assert(err);38723873if(transaction->state != REF_TRANSACTION_OPEN)3874die("BUG: commit called for transaction that is not open");38753876/* Fail if a refname appears more than once in the transaction: */3877for(i =0; i < transaction->nr; i++)3878string_list_append(&affected_refnames,3879 transaction->updates[i]->refname);3880string_list_sort(&affected_refnames);3881if(ref_update_reject_duplicates(&affected_refnames, err)) {3882 ret = TRANSACTION_GENERIC_ERROR;3883goto cleanup;3884}38853886/*3887 * It's really undefined to call this function in an active3888 * repository or when there are existing references: we are3889 * only locking and changing packed-refs, so (1) any3890 * simultaneous processes might try to change a reference at3891 * the same time we do, and (2) any existing loose versions of3892 * the references that we are setting would have precedence3893 * over our values. But some remote helpers create the remote3894 * "HEAD" and "master" branches before calling this function,3895 * so here we really only check that none of the references3896 * that we are creating already exists.3897 */3898if(for_each_rawref(ref_present, &affected_refnames))3899die("BUG: initial ref transaction called with existing refs");39003901for(i =0; i < transaction->nr; i++) {3902struct ref_update *update = transaction->updates[i];39033904if((update->flags & REF_HAVE_OLD) &&3905!is_null_sha1(update->old_sha1))3906die("BUG: initial ref transaction with old_sha1 set");3907if(verify_refname_available(update->refname,3908&affected_refnames, NULL,3909 err)) {3910 ret = TRANSACTION_NAME_CONFLICT;3911goto cleanup;3912}3913}39143915if(lock_packed_refs(0)) {3916strbuf_addf(err,"unable to lock packed-refs file:%s",3917strerror(errno));3918 ret = TRANSACTION_GENERIC_ERROR;3919goto cleanup;3920}39213922for(i =0; i < transaction->nr; i++) {3923struct ref_update *update = transaction->updates[i];39243925if((update->flags & REF_HAVE_NEW) &&3926!is_null_sha1(update->new_sha1))3927add_packed_ref(update->refname, update->new_sha1);3928}39293930if(commit_packed_refs()) {3931strbuf_addf(err,"unable to commit packed-refs file:%s",3932strerror(errno));3933 ret = TRANSACTION_GENERIC_ERROR;3934goto cleanup;3935}39363937cleanup:3938 transaction->state = REF_TRANSACTION_CLOSED;3939string_list_clear(&affected_refnames,0);3940return ret;3941}39423943struct expire_reflog_cb {3944unsigned int flags;3945 reflog_expiry_should_prune_fn *should_prune_fn;3946void*policy_cb;3947FILE*newlog;3948unsigned char last_kept_sha1[20];3949};39503951static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3952const char*email,unsigned long timestamp,int tz,3953const char*message,void*cb_data)3954{3955struct expire_reflog_cb *cb = cb_data;3956struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;39573958if(cb->flags & EXPIRE_REFLOGS_REWRITE)3959 osha1 = cb->last_kept_sha1;39603961if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3962 message, policy_cb)) {3963if(!cb->newlog)3964printf("would prune%s", message);3965else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3966printf("prune%s", message);3967}else{3968if(cb->newlog) {3969fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3970sha1_to_hex(osha1),sha1_to_hex(nsha1),3971 email, timestamp, tz, message);3972hashcpy(cb->last_kept_sha1, nsha1);3973}3974if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3975printf("keep%s", message);3976}3977return0;3978}39793980intreflog_expire(const char*refname,const unsigned char*sha1,3981unsigned int flags,3982 reflog_expiry_prepare_fn prepare_fn,3983 reflog_expiry_should_prune_fn should_prune_fn,3984 reflog_expiry_cleanup_fn cleanup_fn,3985void*policy_cb_data)3986{3987static struct lock_file reflog_lock;3988struct expire_reflog_cb cb;3989struct ref_lock *lock;3990char*log_file;3991int status =0;3992int type;3993struct strbuf err = STRBUF_INIT;39943995memset(&cb,0,sizeof(cb));3996 cb.flags = flags;3997 cb.policy_cb = policy_cb_data;3998 cb.should_prune_fn = should_prune_fn;39994000/*4001 * The reflog file is locked by holding the lock on the4002 * reference itself, plus we might need to update the4003 * reference if --updateref was specified:4004 */4005 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,4006&type, &err);4007if(!lock) {4008error("cannot lock ref '%s':%s", refname, err.buf);4009strbuf_release(&err);4010return-1;4011}4012if(!reflog_exists(refname)) {4013unlock_ref(lock);4014return0;4015}40164017 log_file =git_pathdup("logs/%s", refname);4018if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4019/*4020 * Even though holding $GIT_DIR/logs/$reflog.lock has4021 * no locking implications, we use the lock_file4022 * machinery here anyway because it does a lot of the4023 * work we need, including cleaning up if the program4024 * exits unexpectedly.4025 */4026if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4027struct strbuf err = STRBUF_INIT;4028unable_to_lock_message(log_file, errno, &err);4029error("%s", err.buf);4030strbuf_release(&err);4031goto failure;4032}4033 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4034if(!cb.newlog) {4035error("cannot fdopen%s(%s)",4036get_lock_file_path(&reflog_lock),strerror(errno));4037goto failure;4038}4039}40404041(*prepare_fn)(refname, sha1, cb.policy_cb);4042for_each_reflog_ent(refname, expire_reflog_ent, &cb);4043(*cleanup_fn)(cb.policy_cb);40444045if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4046/*4047 * It doesn't make sense to adjust a reference pointed4048 * to by a symbolic ref based on expiring entries in4049 * the symbolic reference's reflog. Nor can we update4050 * a reference if there are no remaining reflog4051 * entries.4052 */4053int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4054!(type & REF_ISSYMREF) &&4055!is_null_sha1(cb.last_kept_sha1);40564057if(close_lock_file(&reflog_lock)) {4058 status |=error("couldn't write%s:%s", log_file,4059strerror(errno));4060}else if(update &&4061(write_in_full(get_lock_file_fd(lock->lk),4062sha1_to_hex(cb.last_kept_sha1),40) !=40||4063write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||4064close_ref(lock) <0)) {4065 status |=error("couldn't write%s",4066get_lock_file_path(lock->lk));4067rollback_lock_file(&reflog_lock);4068}else if(commit_lock_file(&reflog_lock)) {4069 status |=error("unable to write reflog '%s' (%s)",4070 log_file,strerror(errno));4071}else if(update &&commit_ref(lock)) {4072 status |=error("couldn't set%s", lock->ref_name);4073}4074}4075free(log_file);4076unlock_ref(lock);4077return status;40784079 failure:4080rollback_lock_file(&reflog_lock);4081free(log_file);4082unlock_ref(lock);4083return-1;4084}