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}15001501/* Is it a directory? */1502if(S_ISDIR(st.st_mode)) {1503/*1504 * Even though there is a directory where the loose1505 * ref is supposed to be, there could still be a1506 * packed ref:1507 */1508if(resolve_missing_loose_ref(refname, sha1, type)) {1509 errno = EISDIR;1510goto out;1511}1512 ret =0;1513goto out;1514}15151516/*1517 * Anything else, just open it and try to use it as1518 * a ref1519 */1520 fd =open(path, O_RDONLY);1521if(fd <0) {1522if(errno == ENOENT)1523/* inconsistent with lstat; retry */1524goto stat_ref;1525else1526goto out;1527}1528strbuf_reset(&sb_contents);1529if(strbuf_read(&sb_contents, fd,256) <0) {1530int save_errno = errno;1531close(fd);1532 errno = save_errno;1533goto out;1534}1535close(fd);1536strbuf_rtrim(&sb_contents);1537 buf = sb_contents.buf;1538if(starts_with(buf,"ref:")) {1539 buf +=4;1540while(isspace(*buf))1541 buf++;15421543strbuf_reset(referent);1544strbuf_addstr(referent, buf);1545*type |= REF_ISSYMREF;1546 ret =0;1547goto out;1548}15491550/*1551 * Please note that FETCH_HEAD has additional1552 * data after the sha.1553 */1554if(get_sha1_hex(buf, sha1) ||1555(buf[40] !='\0'&& !isspace(buf[40]))) {1556*type |= REF_ISBROKEN;1557 errno = EINVAL;1558goto out;1559}15601561 ret =0;15621563out:1564 save_errno = errno;1565strbuf_release(&sb_path);1566strbuf_release(&sb_contents);1567 errno = save_errno;1568return ret;1569}15701571static voidunlock_ref(struct ref_lock *lock)1572{1573/* Do not free lock->lk -- atexit() still looks at them */1574if(lock->lk)1575rollback_lock_file(lock->lk);1576free(lock->ref_name);1577free(lock);1578}15791580/*1581 * Lock refname, without following symrefs, and set *lock_p to point1582 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1583 * and type similarly to read_raw_ref().1584 *1585 * The caller must verify that refname is a "safe" reference name (in1586 * the sense of refname_is_safe()) before calling this function.1587 *1588 * If the reference doesn't already exist, verify that refname doesn't1589 * have a D/F conflict with any existing references. extras and skip1590 * are passed to verify_refname_available_dir() for this check.1591 *1592 * If mustexist is not set and the reference is not found or is1593 * broken, lock the reference anyway but clear sha1.1594 *1595 * Return 0 on success. On failure, write an error message to err and1596 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1597 *1598 * Implementation note: This function is basically1599 *1600 * lock reference1601 * read_raw_ref()1602 *1603 * but it includes a lot more code to1604 * - Deal with possible races with other processes1605 * - Avoid calling verify_refname_available_dir() when it can be1606 * avoided, namely if we were successfully able to read the ref1607 * - Generate informative error messages in the case of failure1608 */1609static intlock_raw_ref(const char*refname,int mustexist,1610const struct string_list *extras,1611const struct string_list *skip,1612struct ref_lock **lock_p,1613struct strbuf *referent,1614unsigned int*type,1615struct strbuf *err)1616{1617struct ref_lock *lock;1618struct strbuf ref_file = STRBUF_INIT;1619int attempts_remaining =3;1620int ret = TRANSACTION_GENERIC_ERROR;16211622assert(err);1623*type =0;16241625/* First lock the file so it can't change out from under us. */16261627*lock_p = lock =xcalloc(1,sizeof(*lock));16281629 lock->ref_name =xstrdup(refname);1630strbuf_git_path(&ref_file,"%s", refname);16311632retry:1633switch(safe_create_leading_directories(ref_file.buf)) {1634case SCLD_OK:1635break;/* success */1636case SCLD_EXISTS:1637/*1638 * Suppose refname is "refs/foo/bar". We just failed1639 * to create the containing directory, "refs/foo",1640 * because there was a non-directory in the way. This1641 * indicates a D/F conflict, probably because of1642 * another reference such as "refs/foo". There is no1643 * reason to expect this error to be transitory.1644 */1645if(verify_refname_available(refname, extras, skip, err)) {1646if(mustexist) {1647/*1648 * To the user the relevant error is1649 * that the "mustexist" reference is1650 * missing:1651 */1652strbuf_reset(err);1653strbuf_addf(err,"unable to resolve reference '%s'",1654 refname);1655}else{1656/*1657 * The error message set by1658 * verify_refname_available_dir() is OK.1659 */1660 ret = TRANSACTION_NAME_CONFLICT;1661}1662}else{1663/*1664 * The file that is in the way isn't a loose1665 * reference. Report it as a low-level1666 * failure.1667 */1668strbuf_addf(err,"unable to create lock file%s.lock; "1669"non-directory in the way",1670 ref_file.buf);1671}1672goto error_return;1673case SCLD_VANISHED:1674/* Maybe another process was tidying up. Try again. */1675if(--attempts_remaining >0)1676goto retry;1677/* fall through */1678default:1679strbuf_addf(err,"unable to create directory for%s",1680 ref_file.buf);1681goto error_return;1682}16831684if(!lock->lk)1685 lock->lk =xcalloc(1,sizeof(struct lock_file));16861687if(hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) <0) {1688if(errno == ENOENT && --attempts_remaining >0) {1689/*1690 * Maybe somebody just deleted one of the1691 * directories leading to ref_file. Try1692 * again:1693 */1694goto retry;1695}else{1696unable_to_lock_message(ref_file.buf, errno, err);1697goto error_return;1698}1699}17001701/*1702 * Now we hold the lock and can read the reference without1703 * fear that its value will change.1704 */17051706if(read_raw_ref(refname, lock->old_oid.hash, referent, type)) {1707if(errno == ENOENT) {1708if(mustexist) {1709/* Garden variety missing reference. */1710strbuf_addf(err,"unable to resolve reference '%s'",1711 refname);1712goto error_return;1713}else{1714/*1715 * Reference is missing, but that's OK. We1716 * know that there is not a conflict with1717 * another loose reference because1718 * (supposing that we are trying to lock1719 * reference "refs/foo/bar"):1720 *1721 * - We were successfully able to create1722 * the lockfile refs/foo/bar.lock, so we1723 * know there cannot be a loose reference1724 * named "refs/foo".1725 *1726 * - We got ENOENT and not EISDIR, so we1727 * know that there cannot be a loose1728 * reference named "refs/foo/bar/baz".1729 */1730}1731}else if(errno == EISDIR) {1732/*1733 * There is a directory in the way. It might have1734 * contained references that have been deleted. If1735 * we don't require that the reference already1736 * exists, try to remove the directory so that it1737 * doesn't cause trouble when we want to rename the1738 * lockfile into place later.1739 */1740if(mustexist) {1741/* Garden variety missing reference. */1742strbuf_addf(err,"unable to resolve reference '%s'",1743 refname);1744goto error_return;1745}else if(remove_dir_recursively(&ref_file,1746 REMOVE_DIR_EMPTY_ONLY)) {1747if(verify_refname_available_dir(1748 refname, extras, skip,1749get_loose_refs(&ref_cache),1750 err)) {1751/*1752 * The error message set by1753 * verify_refname_available() is OK.1754 */1755 ret = TRANSACTION_NAME_CONFLICT;1756goto error_return;1757}else{1758/*1759 * We can't delete the directory,1760 * but we also don't know of any1761 * references that it should1762 * contain.1763 */1764strbuf_addf(err,"there is a non-empty directory '%s' "1765"blocking reference '%s'",1766 ref_file.buf, refname);1767goto error_return;1768}1769}1770}else if(errno == EINVAL && (*type & REF_ISBROKEN)) {1771strbuf_addf(err,"unable to resolve reference '%s': "1772"reference broken", refname);1773goto error_return;1774}else{1775strbuf_addf(err,"unable to resolve reference '%s':%s",1776 refname,strerror(errno));1777goto error_return;1778}17791780/*1781 * If the ref did not exist and we are creating it,1782 * make sure there is no existing packed ref whose1783 * name begins with our refname, nor a packed ref1784 * whose name is a proper prefix of our refname.1785 */1786if(verify_refname_available_dir(1787 refname, extras, skip,1788get_packed_refs(&ref_cache),1789 err)) {1790goto error_return;1791}1792}17931794 ret =0;1795goto out;17961797error_return:1798unlock_ref(lock);1799*lock_p = NULL;18001801out:1802strbuf_release(&ref_file);1803return ret;1804}18051806/*1807 * Peel the entry (if possible) and return its new peel_status. If1808 * repeel is true, re-peel the entry even if there is an old peeled1809 * value that is already stored in it.1810 *1811 * It is OK to call this function with a packed reference entry that1812 * might be stale and might even refer to an object that has since1813 * been garbage-collected. In such a case, if the entry has1814 * REF_KNOWS_PEELED then leave the status unchanged and return1815 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1816 */1817static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1818{1819enum peel_status status;18201821if(entry->flag & REF_KNOWS_PEELED) {1822if(repeel) {1823 entry->flag &= ~REF_KNOWS_PEELED;1824oidclr(&entry->u.value.peeled);1825}else{1826returnis_null_oid(&entry->u.value.peeled) ?1827 PEEL_NON_TAG : PEEL_PEELED;1828}1829}1830if(entry->flag & REF_ISBROKEN)1831return PEEL_BROKEN;1832if(entry->flag & REF_ISSYMREF)1833return PEEL_IS_SYMREF;18341835 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1836if(status == PEEL_PEELED || status == PEEL_NON_TAG)1837 entry->flag |= REF_KNOWS_PEELED;1838return status;1839}18401841intpeel_ref(const char*refname,unsigned char*sha1)1842{1843int flag;1844unsigned char base[20];18451846if(current_ref_iter && current_ref_iter->refname == refname) {1847struct object_id peeled;18481849if(ref_iterator_peel(current_ref_iter, &peeled))1850return-1;1851hashcpy(sha1, peeled.hash);1852return0;1853}18541855if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1856return-1;18571858/*1859 * If the reference is packed, read its ref_entry from the1860 * cache in the hope that we already know its peeled value.1861 * We only try this optimization on packed references because1862 * (a) forcing the filling of the loose reference cache could1863 * be expensive and (b) loose references anyway usually do not1864 * have REF_KNOWS_PEELED.1865 */1866if(flag & REF_ISPACKED) {1867struct ref_entry *r =get_packed_ref(refname);1868if(r) {1869if(peel_entry(r,0))1870return-1;1871hashcpy(sha1, r->u.value.peeled.hash);1872return0;1873}1874}18751876returnpeel_object(base, sha1);1877}18781879struct files_ref_iterator {1880struct ref_iterator base;18811882struct packed_ref_cache *packed_ref_cache;1883struct ref_iterator *iter0;1884unsigned int flags;1885};18861887static intfiles_ref_iterator_advance(struct ref_iterator *ref_iterator)1888{1889struct files_ref_iterator *iter =1890(struct files_ref_iterator *)ref_iterator;1891int ok;18921893while((ok =ref_iterator_advance(iter->iter0)) == ITER_OK) {1894if(!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&1895!ref_resolves_to_object(iter->iter0->refname,1896 iter->iter0->oid,1897 iter->iter0->flags))1898continue;18991900 iter->base.refname = iter->iter0->refname;1901 iter->base.oid = iter->iter0->oid;1902 iter->base.flags = iter->iter0->flags;1903return ITER_OK;1904}19051906 iter->iter0 = NULL;1907if(ref_iterator_abort(ref_iterator) != ITER_DONE)1908 ok = ITER_ERROR;19091910return ok;1911}19121913static intfiles_ref_iterator_peel(struct ref_iterator *ref_iterator,1914struct object_id *peeled)1915{1916struct files_ref_iterator *iter =1917(struct files_ref_iterator *)ref_iterator;19181919returnref_iterator_peel(iter->iter0, peeled);1920}19211922static intfiles_ref_iterator_abort(struct ref_iterator *ref_iterator)1923{1924struct files_ref_iterator *iter =1925(struct files_ref_iterator *)ref_iterator;1926int ok = ITER_DONE;19271928if(iter->iter0)1929 ok =ref_iterator_abort(iter->iter0);19301931release_packed_ref_cache(iter->packed_ref_cache);1932base_ref_iterator_free(ref_iterator);1933return ok;1934}19351936static struct ref_iterator_vtable files_ref_iterator_vtable = {1937 files_ref_iterator_advance,1938 files_ref_iterator_peel,1939 files_ref_iterator_abort1940};19411942struct ref_iterator *files_ref_iterator_begin(1943const char*submodule,1944const char*prefix,unsigned int flags)1945{1946struct ref_cache *refs =get_ref_cache(submodule);1947struct ref_dir *loose_dir, *packed_dir;1948struct ref_iterator *loose_iter, *packed_iter;1949struct files_ref_iterator *iter;1950struct ref_iterator *ref_iterator;19511952if(!refs)1953returnempty_ref_iterator_begin();19541955if(ref_paranoia <0)1956 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1957if(ref_paranoia)1958 flags |= DO_FOR_EACH_INCLUDE_BROKEN;19591960 iter =xcalloc(1,sizeof(*iter));1961 ref_iterator = &iter->base;1962base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);19631964/*1965 * We must make sure that all loose refs are read before1966 * accessing the packed-refs file; this avoids a race1967 * condition if loose refs are migrated to the packed-refs1968 * file by a simultaneous process, but our in-memory view is1969 * from before the migration. We ensure this as follows:1970 * First, we call prime_ref_dir(), which pre-reads the loose1971 * references for the subtree into the cache. (If they've1972 * already been read, that's OK; we only need to guarantee1973 * that they're read before the packed refs, not *how much*1974 * before.) After that, we call get_packed_ref_cache(), which1975 * internally checks whether the packed-ref cache is up to1976 * date with what is on disk, and re-reads it if not.1977 */19781979 loose_dir =get_loose_refs(refs);19801981if(prefix && *prefix)1982 loose_dir =find_containing_dir(loose_dir, prefix,0);19831984if(loose_dir) {1985prime_ref_dir(loose_dir);1986 loose_iter =cache_ref_iterator_begin(loose_dir);1987}else{1988/* There's nothing to iterate over. */1989 loose_iter =empty_ref_iterator_begin();1990}19911992 iter->packed_ref_cache =get_packed_ref_cache(refs);1993acquire_packed_ref_cache(iter->packed_ref_cache);1994 packed_dir =get_packed_ref_dir(iter->packed_ref_cache);19951996if(prefix && *prefix)1997 packed_dir =find_containing_dir(packed_dir, prefix,0);19981999if(packed_dir) {2000 packed_iter =cache_ref_iterator_begin(packed_dir);2001}else{2002/* There's nothing to iterate over. */2003 packed_iter =empty_ref_iterator_begin();2004}20052006 iter->iter0 =overlay_ref_iterator_begin(loose_iter, packed_iter);2007 iter->flags = flags;20082009return ref_iterator;2010}20112012/*2013 * Verify that the reference locked by lock has the value old_sha1.2014 * Fail if the reference doesn't exist and mustexist is set. Return 02015 * on success. On error, write an error message to err, set errno, and2016 * return a negative value.2017 */2018static intverify_lock(struct ref_lock *lock,2019const unsigned char*old_sha1,int mustexist,2020struct strbuf *err)2021{2022assert(err);20232024if(read_ref_full(lock->ref_name,2025 mustexist ? RESOLVE_REF_READING :0,2026 lock->old_oid.hash, NULL)) {2027if(old_sha1) {2028int save_errno = errno;2029strbuf_addf(err,"can't verify ref '%s'", lock->ref_name);2030 errno = save_errno;2031return-1;2032}else{2033oidclr(&lock->old_oid);2034return0;2035}2036}2037if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {2038strbuf_addf(err,"ref '%s' is at%sbut expected%s",2039 lock->ref_name,2040oid_to_hex(&lock->old_oid),2041sha1_to_hex(old_sha1));2042 errno = EBUSY;2043return-1;2044}2045return0;2046}20472048static intremove_empty_directories(struct strbuf *path)2049{2050/*2051 * we want to create a file but there is a directory there;2052 * if that is an empty directory (or a directory that contains2053 * only empty directories), remove them.2054 */2055returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);2056}20572058/*2059 * Locks a ref returning the lock on success and NULL on failure.2060 * On failure errno is set to something meaningful.2061 */2062static struct ref_lock *lock_ref_sha1_basic(const char*refname,2063const unsigned char*old_sha1,2064const struct string_list *extras,2065const struct string_list *skip,2066unsigned int flags,int*type,2067struct strbuf *err)2068{2069struct strbuf ref_file = STRBUF_INIT;2070struct ref_lock *lock;2071int last_errno =0;2072int lflags = LOCK_NO_DEREF;2073int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2074int resolve_flags = RESOLVE_REF_NO_RECURSE;2075int attempts_remaining =3;2076int resolved;20772078assert(err);20792080 lock =xcalloc(1,sizeof(struct ref_lock));20812082if(mustexist)2083 resolve_flags |= RESOLVE_REF_READING;2084if(flags & REF_DELETING)2085 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;20862087strbuf_git_path(&ref_file,"%s", refname);2088 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2089 lock->old_oid.hash, type);2090if(!resolved && errno == EISDIR) {2091/*2092 * we are trying to lock foo but we used to2093 * have foo/bar which now does not exist;2094 * it is normal for the empty directory 'foo'2095 * to remain.2096 */2097if(remove_empty_directories(&ref_file)) {2098 last_errno = errno;2099if(!verify_refname_available_dir(refname, extras, skip,2100get_loose_refs(&ref_cache), err))2101strbuf_addf(err,"there are still refs under '%s'",2102 refname);2103goto error_return;2104}2105 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2106 lock->old_oid.hash, type);2107}2108if(!resolved) {2109 last_errno = errno;2110if(last_errno != ENOTDIR ||2111!verify_refname_available_dir(refname, extras, skip,2112get_loose_refs(&ref_cache), err))2113strbuf_addf(err,"unable to resolve reference '%s':%s",2114 refname,strerror(last_errno));21152116goto error_return;2117}21182119/*2120 * If the ref did not exist and we are creating it, make sure2121 * there is no existing packed ref whose name begins with our2122 * refname, nor a packed ref whose name is a proper prefix of2123 * our refname.2124 */2125if(is_null_oid(&lock->old_oid) &&2126verify_refname_available_dir(refname, extras, skip,2127get_packed_refs(&ref_cache), err)) {2128 last_errno = ENOTDIR;2129goto error_return;2130}21312132 lock->lk =xcalloc(1,sizeof(struct lock_file));21332134 lock->ref_name =xstrdup(refname);21352136 retry:2137switch(safe_create_leading_directories_const(ref_file.buf)) {2138case SCLD_OK:2139break;/* success */2140case SCLD_VANISHED:2141if(--attempts_remaining >0)2142goto retry;2143/* fall through */2144default:2145 last_errno = errno;2146strbuf_addf(err,"unable to create directory for '%s'",2147 ref_file.buf);2148goto error_return;2149}21502151if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {2152 last_errno = errno;2153if(errno == ENOENT && --attempts_remaining >0)2154/*2155 * Maybe somebody just deleted one of the2156 * directories leading to ref_file. Try2157 * again:2158 */2159goto retry;2160else{2161unable_to_lock_message(ref_file.buf, errno, err);2162goto error_return;2163}2164}2165if(verify_lock(lock, old_sha1, mustexist, err)) {2166 last_errno = errno;2167goto error_return;2168}2169goto out;21702171 error_return:2172unlock_ref(lock);2173 lock = NULL;21742175 out:2176strbuf_release(&ref_file);2177 errno = last_errno;2178return lock;2179}21802181/*2182 * Write an entry to the packed-refs file for the specified refname.2183 * If peeled is non-NULL, write it as the entry's peeled value.2184 */2185static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2186unsigned char*peeled)2187{2188fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2189if(peeled)2190fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2191}21922193/*2194 * An each_ref_entry_fn that writes the entry to a packed-refs file.2195 */2196static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2197{2198enum peel_status peel_status =peel_entry(entry,0);21992200if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2201error("internal error:%sis not a valid packed reference!",2202 entry->name);2203write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2204 peel_status == PEEL_PEELED ?2205 entry->u.value.peeled.hash : NULL);2206return0;2207}22082209/*2210 * Lock the packed-refs file for writing. Flags is passed to2211 * hold_lock_file_for_update(). Return 0 on success. On errors, set2212 * errno appropriately and return a nonzero value.2213 */2214static intlock_packed_refs(int flags)2215{2216static int timeout_configured =0;2217static int timeout_value =1000;22182219struct packed_ref_cache *packed_ref_cache;22202221if(!timeout_configured) {2222git_config_get_int("core.packedrefstimeout", &timeout_value);2223 timeout_configured =1;2224}22252226if(hold_lock_file_for_update_timeout(2227&packlock,git_path("packed-refs"),2228 flags, timeout_value) <0)2229return-1;2230/*2231 * Get the current packed-refs while holding the lock. If the2232 * packed-refs file has been modified since we last read it,2233 * this will automatically invalidate the cache and re-read2234 * the packed-refs file.2235 */2236 packed_ref_cache =get_packed_ref_cache(&ref_cache);2237 packed_ref_cache->lock = &packlock;2238/* Increment the reference count to prevent it from being freed: */2239acquire_packed_ref_cache(packed_ref_cache);2240return0;2241}22422243/*2244 * Write the current version of the packed refs cache from memory to2245 * disk. The packed-refs file must already be locked for writing (see2246 * lock_packed_refs()). Return zero on success. On errors, set errno2247 * and return a nonzero value2248 */2249static intcommit_packed_refs(void)2250{2251struct packed_ref_cache *packed_ref_cache =2252get_packed_ref_cache(&ref_cache);2253int error =0;2254int save_errno =0;2255FILE*out;22562257if(!packed_ref_cache->lock)2258die("internal error: packed-refs not locked");22592260 out =fdopen_lock_file(packed_ref_cache->lock,"w");2261if(!out)2262die_errno("unable to fdopen packed-refs descriptor");22632264fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2265do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),22660, write_packed_entry_fn, out);22672268if(commit_lock_file(packed_ref_cache->lock)) {2269 save_errno = errno;2270 error = -1;2271}2272 packed_ref_cache->lock = NULL;2273release_packed_ref_cache(packed_ref_cache);2274 errno = save_errno;2275return error;2276}22772278/*2279 * Rollback the lockfile for the packed-refs file, and discard the2280 * in-memory packed reference cache. (The packed-refs file will be2281 * read anew if it is needed again after this function is called.)2282 */2283static voidrollback_packed_refs(void)2284{2285struct packed_ref_cache *packed_ref_cache =2286get_packed_ref_cache(&ref_cache);22872288if(!packed_ref_cache->lock)2289die("internal error: packed-refs not locked");2290rollback_lock_file(packed_ref_cache->lock);2291 packed_ref_cache->lock = NULL;2292release_packed_ref_cache(packed_ref_cache);2293clear_packed_ref_cache(&ref_cache);2294}22952296struct ref_to_prune {2297struct ref_to_prune *next;2298unsigned char sha1[20];2299char name[FLEX_ARRAY];2300};23012302struct pack_refs_cb_data {2303unsigned int flags;2304struct ref_dir *packed_refs;2305struct ref_to_prune *ref_to_prune;2306};23072308/*2309 * An each_ref_entry_fn that is run over loose references only. If2310 * the loose reference can be packed, add an entry in the packed ref2311 * cache. If the reference should be pruned, also add it to2312 * ref_to_prune in the pack_refs_cb_data.2313 */2314static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2315{2316struct pack_refs_cb_data *cb = cb_data;2317enum peel_status peel_status;2318struct ref_entry *packed_entry;2319int is_tag_ref =starts_with(entry->name,"refs/tags/");23202321/* Do not pack per-worktree refs: */2322if(ref_type(entry->name) != REF_TYPE_NORMAL)2323return0;23242325/* ALWAYS pack tags */2326if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2327return0;23282329/* Do not pack symbolic or broken refs: */2330if((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))2331return0;23322333/* Add a packed ref cache entry equivalent to the loose entry. */2334 peel_status =peel_entry(entry,1);2335if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2336die("internal error peeling reference%s(%s)",2337 entry->name,oid_to_hex(&entry->u.value.oid));2338 packed_entry =find_ref(cb->packed_refs, entry->name);2339if(packed_entry) {2340/* Overwrite existing packed entry with info from loose entry */2341 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2342oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2343}else{2344 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2345 REF_ISPACKED | REF_KNOWS_PEELED,0);2346add_ref(cb->packed_refs, packed_entry);2347}2348oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);23492350/* Schedule the loose reference for pruning if requested. */2351if((cb->flags & PACK_REFS_PRUNE)) {2352struct ref_to_prune *n;2353FLEX_ALLOC_STR(n, name, entry->name);2354hashcpy(n->sha1, entry->u.value.oid.hash);2355 n->next = cb->ref_to_prune;2356 cb->ref_to_prune = n;2357}2358return0;2359}23602361/*2362 * Remove empty parents, but spare refs/ and immediate subdirs.2363 * Note: munges *name.2364 */2365static voidtry_remove_empty_parents(char*name)2366{2367char*p, *q;2368int i;2369 p = name;2370for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2371while(*p && *p !='/')2372 p++;2373/* tolerate duplicate slashes; see check_refname_format() */2374while(*p =='/')2375 p++;2376}2377for(q = p; *q; q++)2378;2379while(1) {2380while(q > p && *q !='/')2381 q--;2382while(q > p && *(q-1) =='/')2383 q--;2384if(q == p)2385break;2386*q ='\0';2387if(rmdir(git_path("%s", name)))2388break;2389}2390}23912392/* make sure nobody touched the ref, and unlink */2393static voidprune_ref(struct ref_to_prune *r)2394{2395struct ref_transaction *transaction;2396struct strbuf err = STRBUF_INIT;23972398if(check_refname_format(r->name,0))2399return;24002401 transaction =ref_transaction_begin(&err);2402if(!transaction ||2403ref_transaction_delete(transaction, r->name, r->sha1,2404 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2405ref_transaction_commit(transaction, &err)) {2406ref_transaction_free(transaction);2407error("%s", err.buf);2408strbuf_release(&err);2409return;2410}2411ref_transaction_free(transaction);2412strbuf_release(&err);2413try_remove_empty_parents(r->name);2414}24152416static voidprune_refs(struct ref_to_prune *r)2417{2418while(r) {2419prune_ref(r);2420 r = r->next;2421}2422}24232424intpack_refs(unsigned int flags)2425{2426struct pack_refs_cb_data cbdata;24272428memset(&cbdata,0,sizeof(cbdata));2429 cbdata.flags = flags;24302431lock_packed_refs(LOCK_DIE_ON_ERROR);2432 cbdata.packed_refs =get_packed_refs(&ref_cache);24332434do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2435 pack_if_possible_fn, &cbdata);24362437if(commit_packed_refs())2438die_errno("unable to overwrite old ref-pack file");24392440prune_refs(cbdata.ref_to_prune);2441return0;2442}24432444/*2445 * Rewrite the packed-refs file, omitting any refs listed in2446 * 'refnames'. On error, leave packed-refs unchanged, write an error2447 * message to 'err', and return a nonzero value.2448 *2449 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2450 */2451static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2452{2453struct ref_dir *packed;2454struct string_list_item *refname;2455int ret, needs_repacking =0, removed =0;24562457assert(err);24582459/* Look for a packed ref */2460for_each_string_list_item(refname, refnames) {2461if(get_packed_ref(refname->string)) {2462 needs_repacking =1;2463break;2464}2465}24662467/* Avoid locking if we have nothing to do */2468if(!needs_repacking)2469return0;/* no refname exists in packed refs */24702471if(lock_packed_refs(0)) {2472unable_to_lock_message(git_path("packed-refs"), errno, err);2473return-1;2474}2475 packed =get_packed_refs(&ref_cache);24762477/* Remove refnames from the cache */2478for_each_string_list_item(refname, refnames)2479if(remove_entry(packed, refname->string) != -1)2480 removed =1;2481if(!removed) {2482/*2483 * All packed entries disappeared while we were2484 * acquiring the lock.2485 */2486rollback_packed_refs();2487return0;2488}24892490/* Write what remains */2491 ret =commit_packed_refs();2492if(ret)2493strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2494strerror(errno));2495return ret;2496}24972498static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2499{2500assert(err);25012502if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2503/*2504 * loose. The loose file name is the same as the2505 * lockfile name, minus ".lock":2506 */2507char*loose_filename =get_locked_file_path(lock->lk);2508int res =unlink_or_msg(loose_filename, err);2509free(loose_filename);2510if(res)2511return1;2512}2513return0;2514}25152516intdelete_refs(struct string_list *refnames,unsigned int flags)2517{2518struct strbuf err = STRBUF_INIT;2519int i, result =0;25202521if(!refnames->nr)2522return0;25232524 result =repack_without_refs(refnames, &err);2525if(result) {2526/*2527 * If we failed to rewrite the packed-refs file, then2528 * it is unsafe to try to remove loose refs, because2529 * doing so might expose an obsolete packed value for2530 * a reference that might even point at an object that2531 * has been garbage collected.2532 */2533if(refnames->nr ==1)2534error(_("could not delete reference%s:%s"),2535 refnames->items[0].string, err.buf);2536else2537error(_("could not delete references:%s"), err.buf);25382539goto out;2540}25412542for(i =0; i < refnames->nr; i++) {2543const char*refname = refnames->items[i].string;25442545if(delete_ref(refname, NULL, flags))2546 result |=error(_("could not remove reference%s"), refname);2547}25482549out:2550strbuf_release(&err);2551return result;2552}25532554/*2555 * People using contrib's git-new-workdir have .git/logs/refs ->2556 * /some/other/path/.git/logs/refs, and that may live on another device.2557 *2558 * IOW, to avoid cross device rename errors, the temporary renamed log must2559 * live into logs/refs.2560 */2561#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"25622563static intrename_tmp_log(const char*newrefname)2564{2565int attempts_remaining =4;2566struct strbuf path = STRBUF_INIT;2567int ret = -1;25682569 retry:2570strbuf_reset(&path);2571strbuf_git_path(&path,"logs/%s", newrefname);2572switch(safe_create_leading_directories_const(path.buf)) {2573case SCLD_OK:2574break;/* success */2575case SCLD_VANISHED:2576if(--attempts_remaining >0)2577goto retry;2578/* fall through */2579default:2580error("unable to create directory for%s", newrefname);2581goto out;2582}25832584if(rename(git_path(TMP_RENAMED_LOG), path.buf)) {2585if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2586/*2587 * rename(a, b) when b is an existing2588 * directory ought to result in ISDIR, but2589 * Solaris 5.8 gives ENOTDIR. Sheesh.2590 */2591if(remove_empty_directories(&path)) {2592error("Directory not empty: logs/%s", newrefname);2593goto out;2594}2595goto retry;2596}else if(errno == ENOENT && --attempts_remaining >0) {2597/*2598 * Maybe another process just deleted one of2599 * the directories in the path to newrefname.2600 * Try again from the beginning.2601 */2602goto retry;2603}else{2604error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2605 newrefname,strerror(errno));2606goto out;2607}2608}2609 ret =0;2610out:2611strbuf_release(&path);2612return ret;2613}26142615intverify_refname_available(const char*newname,2616const struct string_list *extras,2617const struct string_list *skip,2618struct strbuf *err)2619{2620struct ref_dir *packed_refs =get_packed_refs(&ref_cache);2621struct ref_dir *loose_refs =get_loose_refs(&ref_cache);26222623if(verify_refname_available_dir(newname, extras, skip,2624 packed_refs, err) ||2625verify_refname_available_dir(newname, extras, skip,2626 loose_refs, err))2627return-1;26282629return0;2630}26312632static intwrite_ref_to_lockfile(struct ref_lock *lock,2633const unsigned char*sha1,struct strbuf *err);2634static intcommit_ref_update(struct ref_lock *lock,2635const unsigned char*sha1,const char*logmsg,2636struct strbuf *err);26372638intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2639{2640unsigned char sha1[20], orig_sha1[20];2641int flag =0, logmoved =0;2642struct ref_lock *lock;2643struct stat loginfo;2644int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2645struct strbuf err = STRBUF_INIT;26462647if(log &&S_ISLNK(loginfo.st_mode))2648returnerror("reflog for%sis a symlink", oldrefname);26492650if(!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2651 orig_sha1, &flag))2652returnerror("refname%snot found", oldrefname);26532654if(flag & REF_ISSYMREF)2655returnerror("refname%sis a symbolic ref, renaming it is not supported",2656 oldrefname);2657if(!rename_ref_available(oldrefname, newrefname))2658return1;26592660if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2661returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2662 oldrefname,strerror(errno));26632664if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2665error("unable to delete old%s", oldrefname);2666goto rollback;2667}26682669/*2670 * Since we are doing a shallow lookup, sha1 is not the2671 * correct value to pass to delete_ref as old_sha1. But that2672 * doesn't matter, because an old_sha1 check wouldn't add to2673 * the safety anyway; we want to delete the reference whatever2674 * its current value.2675 */2676if(!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2677 sha1, NULL) &&2678delete_ref(newrefname, NULL, REF_NODEREF)) {2679if(errno==EISDIR) {2680struct strbuf path = STRBUF_INIT;2681int result;26822683strbuf_git_path(&path,"%s", newrefname);2684 result =remove_empty_directories(&path);2685strbuf_release(&path);26862687if(result) {2688error("Directory not empty:%s", newrefname);2689goto rollback;2690}2691}else{2692error("unable to delete existing%s", newrefname);2693goto rollback;2694}2695}26962697if(log &&rename_tmp_log(newrefname))2698goto rollback;26992700 logmoved = log;27012702 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, REF_NODEREF,2703 NULL, &err);2704if(!lock) {2705error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2706strbuf_release(&err);2707goto rollback;2708}2709hashcpy(lock->old_oid.hash, orig_sha1);27102711if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2712commit_ref_update(lock, orig_sha1, logmsg, &err)) {2713error("unable to write current sha1 into%s:%s", newrefname, err.buf);2714strbuf_release(&err);2715goto rollback;2716}27172718return0;27192720 rollback:2721 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, REF_NODEREF,2722 NULL, &err);2723if(!lock) {2724error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2725strbuf_release(&err);2726goto rollbacklog;2727}27282729 flag = log_all_ref_updates;2730 log_all_ref_updates =0;2731if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2732commit_ref_update(lock, orig_sha1, NULL, &err)) {2733error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2734strbuf_release(&err);2735}2736 log_all_ref_updates = flag;27372738 rollbacklog:2739if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2740error("unable to restore logfile%sfrom%s:%s",2741 oldrefname, newrefname,strerror(errno));2742if(!logmoved && log &&2743rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2744error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2745 oldrefname,strerror(errno));27462747return1;2748}27492750static intclose_ref(struct ref_lock *lock)2751{2752if(close_lock_file(lock->lk))2753return-1;2754return0;2755}27562757static intcommit_ref(struct ref_lock *lock)2758{2759char*path =get_locked_file_path(lock->lk);2760struct stat st;27612762if(!lstat(path, &st) &&S_ISDIR(st.st_mode)) {2763/*2764 * There is a directory at the path we want to rename2765 * the lockfile to. Hopefully it is empty; try to2766 * delete it.2767 */2768size_t len =strlen(path);2769struct strbuf sb_path = STRBUF_INIT;27702771strbuf_attach(&sb_path, path, len, len);27722773/*2774 * If this fails, commit_lock_file() will also fail2775 * and will report the problem.2776 */2777remove_empty_directories(&sb_path);2778strbuf_release(&sb_path);2779}else{2780free(path);2781}27822783if(commit_lock_file(lock->lk))2784return-1;2785return0;2786}27872788/*2789 * Create a reflog for a ref. If force_create = 0, the reflog will2790 * only be created for certain refs (those for which2791 * should_autocreate_reflog returns non-zero. Otherwise, create it2792 * regardless of the ref name. Fill in *err and return -1 on failure.2793 */2794static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)2795{2796int logfd, oflags = O_APPEND | O_WRONLY;27972798strbuf_git_path(logfile,"logs/%s", refname);2799if(force_create ||should_autocreate_reflog(refname)) {2800if(safe_create_leading_directories(logfile->buf) <0) {2801strbuf_addf(err,"unable to create directory for '%s': "2802"%s", logfile->buf,strerror(errno));2803return-1;2804}2805 oflags |= O_CREAT;2806}28072808 logfd =open(logfile->buf, oflags,0666);2809if(logfd <0) {2810if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2811return0;28122813if(errno == EISDIR) {2814if(remove_empty_directories(logfile)) {2815strbuf_addf(err,"there are still logs under "2816"'%s'", logfile->buf);2817return-1;2818}2819 logfd =open(logfile->buf, oflags,0666);2820}28212822if(logfd <0) {2823strbuf_addf(err,"unable to append to '%s':%s",2824 logfile->buf,strerror(errno));2825return-1;2826}2827}28282829adjust_shared_perm(logfile->buf);2830close(logfd);2831return0;2832}283328342835intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)2836{2837int ret;2838struct strbuf sb = STRBUF_INIT;28392840 ret =log_ref_setup(refname, &sb, err, force_create);2841strbuf_release(&sb);2842return ret;2843}28442845static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2846const unsigned char*new_sha1,2847const char*committer,const char*msg)2848{2849int msglen, written;2850unsigned maxlen, len;2851char*logrec;28522853 msglen = msg ?strlen(msg) :0;2854 maxlen =strlen(committer) + msglen +100;2855 logrec =xmalloc(maxlen);2856 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2857sha1_to_hex(old_sha1),2858sha1_to_hex(new_sha1),2859 committer);2860if(msglen)2861 len +=copy_reflog_msg(logrec + len -1, msg) -1;28622863 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2864free(logrec);2865if(written != len)2866return-1;28672868return0;2869}28702871static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,2872const unsigned char*new_sha1,const char*msg,2873struct strbuf *logfile,int flags,2874struct strbuf *err)2875{2876int logfd, result, oflags = O_APPEND | O_WRONLY;28772878if(log_all_ref_updates <0)2879 log_all_ref_updates = !is_bare_repository();28802881 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);28822883if(result)2884return result;28852886 logfd =open(logfile->buf, oflags);2887if(logfd <0)2888return0;2889 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2890git_committer_info(0), msg);2891if(result) {2892strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2893strerror(errno));2894close(logfd);2895return-1;2896}2897if(close(logfd)) {2898strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2899strerror(errno));2900return-1;2901}2902return0;2903}29042905static intlog_ref_write(const char*refname,const unsigned char*old_sha1,2906const unsigned char*new_sha1,const char*msg,2907int flags,struct strbuf *err)2908{2909returnfiles_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2910 err);2911}29122913intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2914const unsigned char*new_sha1,const char*msg,2915int flags,struct strbuf *err)2916{2917struct strbuf sb = STRBUF_INIT;2918int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2919 err);2920strbuf_release(&sb);2921return ret;2922}29232924/*2925 * Write sha1 into the open lockfile, then close the lockfile. On2926 * errors, rollback the lockfile, fill in *err and2927 * return -1.2928 */2929static intwrite_ref_to_lockfile(struct ref_lock *lock,2930const unsigned char*sha1,struct strbuf *err)2931{2932static char term ='\n';2933struct object *o;2934int fd;29352936 o =parse_object(sha1);2937if(!o) {2938strbuf_addf(err,2939"trying to write ref '%s' with nonexistent object%s",2940 lock->ref_name,sha1_to_hex(sha1));2941unlock_ref(lock);2942return-1;2943}2944if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2945strbuf_addf(err,2946"trying to write non-commit object%sto branch '%s'",2947sha1_to_hex(sha1), lock->ref_name);2948unlock_ref(lock);2949return-1;2950}2951 fd =get_lock_file_fd(lock->lk);2952if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2953write_in_full(fd, &term,1) !=1||2954close_ref(lock) <0) {2955strbuf_addf(err,2956"couldn't write '%s'",get_lock_file_path(lock->lk));2957unlock_ref(lock);2958return-1;2959}2960return0;2961}29622963/*2964 * Commit a change to a loose reference that has already been written2965 * to the loose reference lockfile. Also update the reflogs if2966 * necessary, using the specified lockmsg (which can be NULL).2967 */2968static intcommit_ref_update(struct ref_lock *lock,2969const unsigned char*sha1,const char*logmsg,2970struct strbuf *err)2971{2972clear_loose_ref_cache(&ref_cache);2973if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg,0, err)) {2974char*old_msg =strbuf_detach(err, NULL);2975strbuf_addf(err,"cannot update the ref '%s':%s",2976 lock->ref_name, old_msg);2977free(old_msg);2978unlock_ref(lock);2979return-1;2980}29812982if(strcmp(lock->ref_name,"HEAD") !=0) {2983/*2984 * Special hack: If a branch is updated directly and HEAD2985 * points to it (may happen on the remote side of a push2986 * for example) then logically the HEAD reflog should be2987 * updated too.2988 * A generic solution implies reverse symref information,2989 * but finding all symrefs pointing to the given branch2990 * would be rather costly for this rare event (the direct2991 * update of a branch) to be worth it. So let's cheat and2992 * check with HEAD only which should cover 99% of all usage2993 * scenarios (even 100% of the default ones).2994 */2995unsigned char head_sha1[20];2996int head_flag;2997const char*head_ref;29982999 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3000 head_sha1, &head_flag);3001if(head_ref && (head_flag & REF_ISSYMREF) &&3002!strcmp(head_ref, lock->ref_name)) {3003struct strbuf log_err = STRBUF_INIT;3004if(log_ref_write("HEAD", lock->old_oid.hash, sha1,3005 logmsg,0, &log_err)) {3006error("%s", log_err.buf);3007strbuf_release(&log_err);3008}3009}3010}30113012if(commit_ref(lock)) {3013strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3014unlock_ref(lock);3015return-1;3016}30173018unlock_ref(lock);3019return0;3020}30213022static intcreate_ref_symlink(struct ref_lock *lock,const char*target)3023{3024int ret = -1;3025#ifndef NO_SYMLINK_HEAD3026char*ref_path =get_locked_file_path(lock->lk);3027unlink(ref_path);3028 ret =symlink(target, ref_path);3029free(ref_path);30303031if(ret)3032fprintf(stderr,"no symlink - falling back to symbolic ref\n");3033#endif3034return ret;3035}30363037static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,3038const char*target,const char*logmsg)3039{3040struct strbuf err = STRBUF_INIT;3041unsigned char new_sha1[20];3042if(logmsg && !read_ref(target, new_sha1) &&3043log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg,0, &err)) {3044error("%s", err.buf);3045strbuf_release(&err);3046}3047}30483049static intcreate_symref_locked(struct ref_lock *lock,const char*refname,3050const char*target,const char*logmsg)3051{3052if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {3053update_symref_reflog(lock, refname, target, logmsg);3054return0;3055}30563057if(!fdopen_lock_file(lock->lk,"w"))3058returnerror("unable to fdopen%s:%s",3059 lock->lk->tempfile.filename.buf,strerror(errno));30603061update_symref_reflog(lock, refname, target, logmsg);30623063/* no error check; commit_ref will check ferror */3064fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);3065if(commit_ref(lock) <0)3066returnerror("unable to write symref for%s:%s", refname,3067strerror(errno));3068return0;3069}30703071intcreate_symref(const char*refname,const char*target,const char*logmsg)3072{3073struct strbuf err = STRBUF_INIT;3074struct ref_lock *lock;3075int ret;30763077 lock =lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,3078&err);3079if(!lock) {3080error("%s", err.buf);3081strbuf_release(&err);3082return-1;3083}30843085 ret =create_symref_locked(lock, refname, target, logmsg);3086unlock_ref(lock);3087return ret;3088}30893090intset_worktree_head_symref(const char*gitdir,const char*target)3091{3092static struct lock_file head_lock;3093struct ref_lock *lock;3094struct strbuf head_path = STRBUF_INIT;3095const char*head_rel;3096int ret;30973098strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));3099if(hold_lock_file_for_update(&head_lock, head_path.buf,3100 LOCK_NO_DEREF) <0) {3101struct strbuf err = STRBUF_INIT;3102unable_to_lock_message(head_path.buf, errno, &err);3103error("%s", err.buf);3104strbuf_release(&err);3105strbuf_release(&head_path);3106return-1;3107}31083109/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3110 linked trees */3111 head_rel =remove_leading_path(head_path.buf,3112absolute_path(get_git_common_dir()));3113/* to make use of create_symref_locked(), initialize ref_lock */3114 lock =xcalloc(1,sizeof(struct ref_lock));3115 lock->lk = &head_lock;3116 lock->ref_name =xstrdup(head_rel);31173118 ret =create_symref_locked(lock, head_rel, target, NULL);31193120unlock_ref(lock);/* will free lock */3121strbuf_release(&head_path);3122return ret;3123}31243125intreflog_exists(const char*refname)3126{3127struct stat st;31283129return!lstat(git_path("logs/%s", refname), &st) &&3130S_ISREG(st.st_mode);3131}31323133intdelete_reflog(const char*refname)3134{3135returnremove_path(git_path("logs/%s", refname));3136}31373138static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3139{3140unsigned char osha1[20], nsha1[20];3141char*email_end, *message;3142unsigned long timestamp;3143int tz;31443145/* old SP new SP name <email> SP time TAB msg LF */3146if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3147get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3148get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3149!(email_end =strchr(sb->buf +82,'>')) ||3150 email_end[1] !=' '||3151!(timestamp =strtoul(email_end +2, &message,10)) ||3152!message || message[0] !=' '||3153(message[1] !='+'&& message[1] !='-') ||3154!isdigit(message[2]) || !isdigit(message[3]) ||3155!isdigit(message[4]) || !isdigit(message[5]))3156return0;/* corrupt? */3157 email_end[1] ='\0';3158 tz =strtol(message +1, NULL,10);3159if(message[6] !='\t')3160 message +=6;3161else3162 message +=7;3163returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3164}31653166static char*find_beginning_of_line(char*bob,char*scan)3167{3168while(bob < scan && *(--scan) !='\n')3169;/* keep scanning backwards */3170/*3171 * Return either beginning of the buffer, or LF at the end of3172 * the previous line.3173 */3174return scan;3175}31763177intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)3178{3179struct strbuf sb = STRBUF_INIT;3180FILE*logfp;3181long pos;3182int ret =0, at_tail =1;31833184 logfp =fopen(git_path("logs/%s", refname),"r");3185if(!logfp)3186return-1;31873188/* Jump to the end */3189if(fseek(logfp,0, SEEK_END) <0)3190returnerror("cannot seek back reflog for%s:%s",3191 refname,strerror(errno));3192 pos =ftell(logfp);3193while(!ret &&0< pos) {3194int cnt;3195size_t nread;3196char buf[BUFSIZ];3197char*endp, *scanp;31983199/* Fill next block from the end */3200 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3201if(fseek(logfp, pos - cnt, SEEK_SET))3202returnerror("cannot seek back reflog for%s:%s",3203 refname,strerror(errno));3204 nread =fread(buf, cnt,1, logfp);3205if(nread !=1)3206returnerror("cannot read%dbytes from reflog for%s:%s",3207 cnt, refname,strerror(errno));3208 pos -= cnt;32093210 scanp = endp = buf + cnt;3211if(at_tail && scanp[-1] =='\n')3212/* Looking at the final LF at the end of the file */3213 scanp--;3214 at_tail =0;32153216while(buf < scanp) {3217/*3218 * terminating LF of the previous line, or the beginning3219 * of the buffer.3220 */3221char*bp;32223223 bp =find_beginning_of_line(buf, scanp);32243225if(*bp =='\n') {3226/*3227 * The newline is the end of the previous line,3228 * so we know we have complete line starting3229 * at (bp + 1). Prefix it onto any prior data3230 * we collected for the line and process it.3231 */3232strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3233 scanp = bp;3234 endp = bp +1;3235 ret =show_one_reflog_ent(&sb, fn, cb_data);3236strbuf_reset(&sb);3237if(ret)3238break;3239}else if(!pos) {3240/*3241 * We are at the start of the buffer, and the3242 * start of the file; there is no previous3243 * line, and we have everything for this one.3244 * Process it, and we can end the loop.3245 */3246strbuf_splice(&sb,0,0, buf, endp - buf);3247 ret =show_one_reflog_ent(&sb, fn, cb_data);3248strbuf_reset(&sb);3249break;3250}32513252if(bp == buf) {3253/*3254 * We are at the start of the buffer, and there3255 * is more file to read backwards. Which means3256 * we are in the middle of a line. Note that we3257 * may get here even if *bp was a newline; that3258 * just means we are at the exact end of the3259 * previous line, rather than some spot in the3260 * middle.3261 *3262 * Save away what we have to be combined with3263 * the data from the next read.3264 */3265strbuf_splice(&sb,0,0, buf, endp - buf);3266break;3267}3268}32693270}3271if(!ret && sb.len)3272die("BUG: reverse reflog parser had leftover data");32733274fclose(logfp);3275strbuf_release(&sb);3276return ret;3277}32783279intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3280{3281FILE*logfp;3282struct strbuf sb = STRBUF_INIT;3283int ret =0;32843285 logfp =fopen(git_path("logs/%s", refname),"r");3286if(!logfp)3287return-1;32883289while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3290 ret =show_one_reflog_ent(&sb, fn, cb_data);3291fclose(logfp);3292strbuf_release(&sb);3293return ret;3294}32953296struct files_reflog_iterator {3297struct ref_iterator base;32983299struct dir_iterator *dir_iterator;3300struct object_id oid;3301};33023303static intfiles_reflog_iterator_advance(struct ref_iterator *ref_iterator)3304{3305struct files_reflog_iterator *iter =3306(struct files_reflog_iterator *)ref_iterator;3307struct dir_iterator *diter = iter->dir_iterator;3308int ok;33093310while((ok =dir_iterator_advance(diter)) == ITER_OK) {3311int flags;33123313if(!S_ISREG(diter->st.st_mode))3314continue;3315if(diter->basename[0] =='.')3316continue;3317if(ends_with(diter->basename,".lock"))3318continue;33193320if(read_ref_full(diter->relative_path,0,3321 iter->oid.hash, &flags)) {3322error("bad ref for%s", diter->path.buf);3323continue;3324}33253326 iter->base.refname = diter->relative_path;3327 iter->base.oid = &iter->oid;3328 iter->base.flags = flags;3329return ITER_OK;3330}33313332 iter->dir_iterator = NULL;3333if(ref_iterator_abort(ref_iterator) == ITER_ERROR)3334 ok = ITER_ERROR;3335return ok;3336}33373338static intfiles_reflog_iterator_peel(struct ref_iterator *ref_iterator,3339struct object_id *peeled)3340{3341die("BUG: ref_iterator_peel() called for reflog_iterator");3342}33433344static intfiles_reflog_iterator_abort(struct ref_iterator *ref_iterator)3345{3346struct files_reflog_iterator *iter =3347(struct files_reflog_iterator *)ref_iterator;3348int ok = ITER_DONE;33493350if(iter->dir_iterator)3351 ok =dir_iterator_abort(iter->dir_iterator);33523353base_ref_iterator_free(ref_iterator);3354return ok;3355}33563357static struct ref_iterator_vtable files_reflog_iterator_vtable = {3358 files_reflog_iterator_advance,3359 files_reflog_iterator_peel,3360 files_reflog_iterator_abort3361};33623363struct ref_iterator *files_reflog_iterator_begin(void)3364{3365struct files_reflog_iterator *iter =xcalloc(1,sizeof(*iter));3366struct ref_iterator *ref_iterator = &iter->base;33673368base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);3369 iter->dir_iterator =dir_iterator_begin(git_path("logs"));3370return ref_iterator;3371}33723373intfor_each_reflog(each_ref_fn fn,void*cb_data)3374{3375returndo_for_each_ref_iterator(files_reflog_iterator_begin(),3376 fn, cb_data);3377}33783379static intref_update_reject_duplicates(struct string_list *refnames,3380struct strbuf *err)3381{3382int i, n = refnames->nr;33833384assert(err);33853386for(i =1; i < n; i++)3387if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3388strbuf_addf(err,3389"multiple updates for ref '%s' not allowed.",3390 refnames->items[i].string);3391return1;3392}3393return0;3394}33953396/*3397 * If update is a direct update of head_ref (the reference pointed to3398 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3399 */3400static intsplit_head_update(struct ref_update *update,3401struct ref_transaction *transaction,3402const char*head_ref,3403struct string_list *affected_refnames,3404struct strbuf *err)3405{3406struct string_list_item *item;3407struct ref_update *new_update;34083409if((update->flags & REF_LOG_ONLY) ||3410(update->flags & REF_ISPRUNING) ||3411(update->flags & REF_UPDATE_VIA_HEAD))3412return0;34133414if(strcmp(update->refname, head_ref))3415return0;34163417/*3418 * First make sure that HEAD is not already in the3419 * transaction. This insertion is O(N) in the transaction3420 * size, but it happens at most once per transaction.3421 */3422 item =string_list_insert(affected_refnames,"HEAD");3423if(item->util) {3424/* An entry already existed */3425strbuf_addf(err,3426"multiple updates for 'HEAD' (including one "3427"via its referent '%s') are not allowed",3428 update->refname);3429return TRANSACTION_NAME_CONFLICT;3430}34313432 new_update =ref_transaction_add_update(3433 transaction,"HEAD",3434 update->flags | REF_LOG_ONLY | REF_NODEREF,3435 update->new_sha1, update->old_sha1,3436 update->msg);34373438 item->util = new_update;34393440return0;3441}34423443/*3444 * update is for a symref that points at referent and doesn't have3445 * REF_NODEREF set. Split it into two updates:3446 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3447 * - A new, separate update for the referent reference3448 * Note that the new update will itself be subject to splitting when3449 * the iteration gets to it.3450 */3451static intsplit_symref_update(struct ref_update *update,3452const char*referent,3453struct ref_transaction *transaction,3454struct string_list *affected_refnames,3455struct strbuf *err)3456{3457struct string_list_item *item;3458struct ref_update *new_update;3459unsigned int new_flags;34603461/*3462 * First make sure that referent is not already in the3463 * transaction. This insertion is O(N) in the transaction3464 * size, but it happens at most once per symref in a3465 * transaction.3466 */3467 item =string_list_insert(affected_refnames, referent);3468if(item->util) {3469/* An entry already existed */3470strbuf_addf(err,3471"multiple updates for '%s' (including one "3472"via symref '%s') are not allowed",3473 referent, update->refname);3474return TRANSACTION_NAME_CONFLICT;3475}34763477 new_flags = update->flags;3478if(!strcmp(update->refname,"HEAD")) {3479/*3480 * Record that the new update came via HEAD, so that3481 * when we process it, split_head_update() doesn't try3482 * to add another reflog update for HEAD. Note that3483 * this bit will be propagated if the new_update3484 * itself needs to be split.3485 */3486 new_flags |= REF_UPDATE_VIA_HEAD;3487}34883489 new_update =ref_transaction_add_update(3490 transaction, referent, new_flags,3491 update->new_sha1, update->old_sha1,3492 update->msg);34933494 new_update->parent_update = update;34953496/*3497 * Change the symbolic ref update to log only. Also, it3498 * doesn't need to check its old SHA-1 value, as that will be3499 * done when new_update is processed.3500 */3501 update->flags |= REF_LOG_ONLY | REF_NODEREF;3502 update->flags &= ~REF_HAVE_OLD;35033504 item->util = new_update;35053506return0;3507}35083509/*3510 * Return the refname under which update was originally requested.3511 */3512static const char*original_update_refname(struct ref_update *update)3513{3514while(update->parent_update)3515 update = update->parent_update;35163517return update->refname;3518}35193520/*3521 * Check whether the REF_HAVE_OLD and old_oid values stored in update3522 * are consistent with oid, which is the reference's current value. If3523 * everything is OK, return 0; otherwise, write an error message to3524 * err and return -1.3525 */3526static intcheck_old_oid(struct ref_update *update,struct object_id *oid,3527struct strbuf *err)3528{3529if(!(update->flags & REF_HAVE_OLD) ||3530!hashcmp(oid->hash, update->old_sha1))3531return0;35323533if(is_null_sha1(update->old_sha1))3534strbuf_addf(err,"cannot lock ref '%s': "3535"reference already exists",3536original_update_refname(update));3537else if(is_null_oid(oid))3538strbuf_addf(err,"cannot lock ref '%s': "3539"reference is missing but expected%s",3540original_update_refname(update),3541sha1_to_hex(update->old_sha1));3542else3543strbuf_addf(err,"cannot lock ref '%s': "3544"is at%sbut expected%s",3545original_update_refname(update),3546oid_to_hex(oid),3547sha1_to_hex(update->old_sha1));35483549return-1;3550}35513552/*3553 * Prepare for carrying out update:3554 * - Lock the reference referred to by update.3555 * - Read the reference under lock.3556 * - Check that its old SHA-1 value (if specified) is correct, and in3557 * any case record it in update->lock->old_oid for later use when3558 * writing the reflog.3559 * - If it is a symref update without REF_NODEREF, split it up into a3560 * REF_LOG_ONLY update of the symref and add a separate update for3561 * the referent to transaction.3562 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3563 * update of HEAD.3564 */3565static intlock_ref_for_update(struct ref_update *update,3566struct ref_transaction *transaction,3567const char*head_ref,3568struct string_list *affected_refnames,3569struct strbuf *err)3570{3571struct strbuf referent = STRBUF_INIT;3572int mustexist = (update->flags & REF_HAVE_OLD) &&3573!is_null_sha1(update->old_sha1);3574int ret;3575struct ref_lock *lock;35763577if((update->flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1))3578 update->flags |= REF_DELETING;35793580if(head_ref) {3581 ret =split_head_update(update, transaction, head_ref,3582 affected_refnames, err);3583if(ret)3584return ret;3585}35863587 ret =lock_raw_ref(update->refname, mustexist,3588 affected_refnames, NULL,3589&update->lock, &referent,3590&update->type, err);35913592if(ret) {3593char*reason;35943595 reason =strbuf_detach(err, NULL);3596strbuf_addf(err,"cannot lock ref '%s':%s",3597original_update_refname(update), reason);3598free(reason);3599return ret;3600}36013602 lock = update->lock;36033604if(update->type & REF_ISSYMREF) {3605if(update->flags & REF_NODEREF) {3606/*3607 * We won't be reading the referent as part of3608 * the transaction, so we have to read it here3609 * to record and possibly check old_sha1:3610 */3611if(read_ref_full(referent.buf,0,3612 lock->old_oid.hash, NULL)) {3613if(update->flags & REF_HAVE_OLD) {3614strbuf_addf(err,"cannot lock ref '%s': "3615"error reading reference",3616original_update_refname(update));3617return-1;3618}3619}else if(check_old_oid(update, &lock->old_oid, err)) {3620return TRANSACTION_GENERIC_ERROR;3621}3622}else{3623/*3624 * Create a new update for the reference this3625 * symref is pointing at. Also, we will record3626 * and verify old_sha1 for this update as part3627 * of processing the split-off update, so we3628 * don't have to do it here.3629 */3630 ret =split_symref_update(update, referent.buf, transaction,3631 affected_refnames, err);3632if(ret)3633return ret;3634}3635}else{3636struct ref_update *parent_update;36373638if(check_old_oid(update, &lock->old_oid, err))3639return TRANSACTION_GENERIC_ERROR;36403641/*3642 * If this update is happening indirectly because of a3643 * symref update, record the old SHA-1 in the parent3644 * update:3645 */3646for(parent_update = update->parent_update;3647 parent_update;3648 parent_update = parent_update->parent_update) {3649oidcpy(&parent_update->lock->old_oid, &lock->old_oid);3650}3651}36523653if((update->flags & REF_HAVE_NEW) &&3654!(update->flags & REF_DELETING) &&3655!(update->flags & REF_LOG_ONLY)) {3656if(!(update->type & REF_ISSYMREF) &&3657!hashcmp(lock->old_oid.hash, update->new_sha1)) {3658/*3659 * The reference already has the desired3660 * value, so we don't need to write it.3661 */3662}else if(write_ref_to_lockfile(lock, update->new_sha1,3663 err)) {3664char*write_err =strbuf_detach(err, NULL);36653666/*3667 * The lock was freed upon failure of3668 * write_ref_to_lockfile():3669 */3670 update->lock = NULL;3671strbuf_addf(err,3672"cannot update ref '%s':%s",3673 update->refname, write_err);3674free(write_err);3675return TRANSACTION_GENERIC_ERROR;3676}else{3677 update->flags |= REF_NEEDS_COMMIT;3678}3679}3680if(!(update->flags & REF_NEEDS_COMMIT)) {3681/*3682 * We didn't call write_ref_to_lockfile(), so3683 * the lockfile is still open. Close it to3684 * free up the file descriptor:3685 */3686if(close_ref(lock)) {3687strbuf_addf(err,"couldn't close '%s.lock'",3688 update->refname);3689return TRANSACTION_GENERIC_ERROR;3690}3691}3692return0;3693}36943695intref_transaction_commit(struct ref_transaction *transaction,3696struct strbuf *err)3697{3698int ret =0, i;3699struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3700struct string_list_item *ref_to_delete;3701struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3702char*head_ref = NULL;3703int head_type;3704struct object_id head_oid;37053706assert(err);37073708if(transaction->state != REF_TRANSACTION_OPEN)3709die("BUG: commit called for transaction that is not open");37103711if(!transaction->nr) {3712 transaction->state = REF_TRANSACTION_CLOSED;3713return0;3714}37153716/*3717 * Fail if a refname appears more than once in the3718 * transaction. (If we end up splitting up any updates using3719 * split_symref_update() or split_head_update(), those3720 * functions will check that the new updates don't have the3721 * same refname as any existing ones.)3722 */3723for(i =0; i < transaction->nr; i++) {3724struct ref_update *update = transaction->updates[i];3725struct string_list_item *item =3726string_list_append(&affected_refnames, update->refname);37273728/*3729 * We store a pointer to update in item->util, but at3730 * the moment we never use the value of this field3731 * except to check whether it is non-NULL.3732 */3733 item->util = update;3734}3735string_list_sort(&affected_refnames);3736if(ref_update_reject_duplicates(&affected_refnames, err)) {3737 ret = TRANSACTION_GENERIC_ERROR;3738goto cleanup;3739}37403741/*3742 * Special hack: If a branch is updated directly and HEAD3743 * points to it (may happen on the remote side of a push3744 * for example) then logically the HEAD reflog should be3745 * updated too.3746 *3747 * A generic solution would require reverse symref lookups,3748 * but finding all symrefs pointing to a given branch would be3749 * rather costly for this rare event (the direct update of a3750 * branch) to be worth it. So let's cheat and check with HEAD3751 * only, which should cover 99% of all usage scenarios (even3752 * 100% of the default ones).3753 *3754 * So if HEAD is a symbolic reference, then record the name of3755 * the reference that it points to. If we see an update of3756 * head_ref within the transaction, then split_head_update()3757 * arranges for the reflog of HEAD to be updated, too.3758 */3759 head_ref =resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3760 head_oid.hash, &head_type);37613762if(head_ref && !(head_type & REF_ISSYMREF)) {3763free(head_ref);3764 head_ref = NULL;3765}37663767/*3768 * Acquire all locks, verify old values if provided, check3769 * that new values are valid, and write new values to the3770 * lockfiles, ready to be activated. Only keep one lockfile3771 * open at a time to avoid running out of file descriptors.3772 */3773for(i =0; i < transaction->nr; i++) {3774struct ref_update *update = transaction->updates[i];37753776 ret =lock_ref_for_update(update, transaction, head_ref,3777&affected_refnames, err);3778if(ret)3779goto cleanup;3780}37813782/* Perform updates first so live commits remain referenced */3783for(i =0; i < transaction->nr; i++) {3784struct ref_update *update = transaction->updates[i];3785struct ref_lock *lock = update->lock;37863787if(update->flags & REF_NEEDS_COMMIT ||3788 update->flags & REF_LOG_ONLY) {3789if(log_ref_write(lock->ref_name, lock->old_oid.hash,3790 update->new_sha1,3791 update->msg, update->flags, err)) {3792char*old_msg =strbuf_detach(err, NULL);37933794strbuf_addf(err,"cannot update the ref '%s':%s",3795 lock->ref_name, old_msg);3796free(old_msg);3797unlock_ref(lock);3798 update->lock = NULL;3799 ret = TRANSACTION_GENERIC_ERROR;3800goto cleanup;3801}3802}3803if(update->flags & REF_NEEDS_COMMIT) {3804clear_loose_ref_cache(&ref_cache);3805if(commit_ref(lock)) {3806strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3807unlock_ref(lock);3808 update->lock = NULL;3809 ret = TRANSACTION_GENERIC_ERROR;3810goto cleanup;3811}3812}3813}3814/* Perform deletes now that updates are safely completed */3815for(i =0; i < transaction->nr; i++) {3816struct ref_update *update = transaction->updates[i];38173818if(update->flags & REF_DELETING &&3819!(update->flags & REF_LOG_ONLY)) {3820if(delete_ref_loose(update->lock, update->type, err)) {3821 ret = TRANSACTION_GENERIC_ERROR;3822goto cleanup;3823}38243825if(!(update->flags & REF_ISPRUNING))3826string_list_append(&refs_to_delete,3827 update->lock->ref_name);3828}3829}38303831if(repack_without_refs(&refs_to_delete, err)) {3832 ret = TRANSACTION_GENERIC_ERROR;3833goto cleanup;3834}3835for_each_string_list_item(ref_to_delete, &refs_to_delete)3836unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3837clear_loose_ref_cache(&ref_cache);38383839cleanup:3840 transaction->state = REF_TRANSACTION_CLOSED;38413842for(i =0; i < transaction->nr; i++)3843if(transaction->updates[i]->lock)3844unlock_ref(transaction->updates[i]->lock);3845string_list_clear(&refs_to_delete,0);3846free(head_ref);3847string_list_clear(&affected_refnames,0);38483849return ret;3850}38513852static intref_present(const char*refname,3853const struct object_id *oid,int flags,void*cb_data)3854{3855struct string_list *affected_refnames = cb_data;38563857returnstring_list_has_string(affected_refnames, refname);3858}38593860intinitial_ref_transaction_commit(struct ref_transaction *transaction,3861struct strbuf *err)3862{3863int ret =0, i;3864struct string_list affected_refnames = STRING_LIST_INIT_NODUP;38653866assert(err);38673868if(transaction->state != REF_TRANSACTION_OPEN)3869die("BUG: commit called for transaction that is not open");38703871/* Fail if a refname appears more than once in the transaction: */3872for(i =0; i < transaction->nr; i++)3873string_list_append(&affected_refnames,3874 transaction->updates[i]->refname);3875string_list_sort(&affected_refnames);3876if(ref_update_reject_duplicates(&affected_refnames, err)) {3877 ret = TRANSACTION_GENERIC_ERROR;3878goto cleanup;3879}38803881/*3882 * It's really undefined to call this function in an active3883 * repository or when there are existing references: we are3884 * only locking and changing packed-refs, so (1) any3885 * simultaneous processes might try to change a reference at3886 * the same time we do, and (2) any existing loose versions of3887 * the references that we are setting would have precedence3888 * over our values. But some remote helpers create the remote3889 * "HEAD" and "master" branches before calling this function,3890 * so here we really only check that none of the references3891 * that we are creating already exists.3892 */3893if(for_each_rawref(ref_present, &affected_refnames))3894die("BUG: initial ref transaction called with existing refs");38953896for(i =0; i < transaction->nr; i++) {3897struct ref_update *update = transaction->updates[i];38983899if((update->flags & REF_HAVE_OLD) &&3900!is_null_sha1(update->old_sha1))3901die("BUG: initial ref transaction with old_sha1 set");3902if(verify_refname_available(update->refname,3903&affected_refnames, NULL,3904 err)) {3905 ret = TRANSACTION_NAME_CONFLICT;3906goto cleanup;3907}3908}39093910if(lock_packed_refs(0)) {3911strbuf_addf(err,"unable to lock packed-refs file:%s",3912strerror(errno));3913 ret = TRANSACTION_GENERIC_ERROR;3914goto cleanup;3915}39163917for(i =0; i < transaction->nr; i++) {3918struct ref_update *update = transaction->updates[i];39193920if((update->flags & REF_HAVE_NEW) &&3921!is_null_sha1(update->new_sha1))3922add_packed_ref(update->refname, update->new_sha1);3923}39243925if(commit_packed_refs()) {3926strbuf_addf(err,"unable to commit packed-refs file:%s",3927strerror(errno));3928 ret = TRANSACTION_GENERIC_ERROR;3929goto cleanup;3930}39313932cleanup:3933 transaction->state = REF_TRANSACTION_CLOSED;3934string_list_clear(&affected_refnames,0);3935return ret;3936}39373938struct expire_reflog_cb {3939unsigned int flags;3940 reflog_expiry_should_prune_fn *should_prune_fn;3941void*policy_cb;3942FILE*newlog;3943unsigned char last_kept_sha1[20];3944};39453946static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3947const char*email,unsigned long timestamp,int tz,3948const char*message,void*cb_data)3949{3950struct expire_reflog_cb *cb = cb_data;3951struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;39523953if(cb->flags & EXPIRE_REFLOGS_REWRITE)3954 osha1 = cb->last_kept_sha1;39553956if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3957 message, policy_cb)) {3958if(!cb->newlog)3959printf("would prune%s", message);3960else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3961printf("prune%s", message);3962}else{3963if(cb->newlog) {3964fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3965sha1_to_hex(osha1),sha1_to_hex(nsha1),3966 email, timestamp, tz, message);3967hashcpy(cb->last_kept_sha1, nsha1);3968}3969if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3970printf("keep%s", message);3971}3972return0;3973}39743975intreflog_expire(const char*refname,const unsigned char*sha1,3976unsigned int flags,3977 reflog_expiry_prepare_fn prepare_fn,3978 reflog_expiry_should_prune_fn should_prune_fn,3979 reflog_expiry_cleanup_fn cleanup_fn,3980void*policy_cb_data)3981{3982static struct lock_file reflog_lock;3983struct expire_reflog_cb cb;3984struct ref_lock *lock;3985char*log_file;3986int status =0;3987int type;3988struct strbuf err = STRBUF_INIT;39893990memset(&cb,0,sizeof(cb));3991 cb.flags = flags;3992 cb.policy_cb = policy_cb_data;3993 cb.should_prune_fn = should_prune_fn;39943995/*3996 * The reflog file is locked by holding the lock on the3997 * reference itself, plus we might need to update the3998 * reference if --updateref was specified:3999 */4000 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,4001&type, &err);4002if(!lock) {4003error("cannot lock ref '%s':%s", refname, err.buf);4004strbuf_release(&err);4005return-1;4006}4007if(!reflog_exists(refname)) {4008unlock_ref(lock);4009return0;4010}40114012 log_file =git_pathdup("logs/%s", refname);4013if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4014/*4015 * Even though holding $GIT_DIR/logs/$reflog.lock has4016 * no locking implications, we use the lock_file4017 * machinery here anyway because it does a lot of the4018 * work we need, including cleaning up if the program4019 * exits unexpectedly.4020 */4021if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4022struct strbuf err = STRBUF_INIT;4023unable_to_lock_message(log_file, errno, &err);4024error("%s", err.buf);4025strbuf_release(&err);4026goto failure;4027}4028 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4029if(!cb.newlog) {4030error("cannot fdopen%s(%s)",4031get_lock_file_path(&reflog_lock),strerror(errno));4032goto failure;4033}4034}40354036(*prepare_fn)(refname, sha1, cb.policy_cb);4037for_each_reflog_ent(refname, expire_reflog_ent, &cb);4038(*cleanup_fn)(cb.policy_cb);40394040if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4041/*4042 * It doesn't make sense to adjust a reference pointed4043 * to by a symbolic ref based on expiring entries in4044 * the symbolic reference's reflog. Nor can we update4045 * a reference if there are no remaining reflog4046 * entries.4047 */4048int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4049!(type & REF_ISSYMREF) &&4050!is_null_sha1(cb.last_kept_sha1);40514052if(close_lock_file(&reflog_lock)) {4053 status |=error("couldn't write%s:%s", log_file,4054strerror(errno));4055}else if(update &&4056(write_in_full(get_lock_file_fd(lock->lk),4057sha1_to_hex(cb.last_kept_sha1),40) !=40||4058write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||4059close_ref(lock) <0)) {4060 status |=error("couldn't write%s",4061get_lock_file_path(lock->lk));4062rollback_lock_file(&reflog_lock);4063}else if(commit_lock_file(&reflog_lock)) {4064 status |=error("unable to write reflog '%s' (%s)",4065 log_file,strerror(errno));4066}else if(update &&commit_ref(lock)) {4067 status |=error("couldn't set%s", lock->ref_name);4068}4069}4070free(log_file);4071unlock_ref(lock);4072return status;40734074 failure:4075rollback_lock_file(&reflog_lock);4076free(log_file);4077unlock_ref(lock);4078return-1;4079}