1#include"../cache.h" 2#include"../refs.h" 3#include"refs-internal.h" 4#include"../iterator.h" 5#include"../dir-iterator.h" 6#include"../lockfile.h" 7#include"../object.h" 8#include"../dir.h" 9 10struct ref_lock { 11char*ref_name; 12struct lock_file *lk; 13struct object_id old_oid; 14}; 15 16struct ref_entry; 17 18/* 19 * Information used (along with the information in ref_entry) to 20 * describe a single cached reference. This data structure only 21 * occurs embedded in a union in struct ref_entry, and only when 22 * (ref_entry->flag & REF_DIR) is zero. 23 */ 24struct ref_value { 25/* 26 * The name of the object to which this reference resolves 27 * (which may be a tag object). If REF_ISBROKEN, this is 28 * null. If REF_ISSYMREF, then this is the name of the object 29 * referred to by the last reference in the symlink chain. 30 */ 31struct object_id oid; 32 33/* 34 * If REF_KNOWS_PEELED, then this field holds the peeled value 35 * of this reference, or null if the reference is known not to 36 * be peelable. See the documentation for peel_ref() for an 37 * exact definition of "peelable". 38 */ 39struct object_id peeled; 40}; 41 42struct files_ref_store; 43 44/* 45 * Information used (along with the information in ref_entry) to 46 * describe a level in the hierarchy of references. This data 47 * structure only occurs embedded in a union in struct ref_entry, and 48 * only when (ref_entry.flag & REF_DIR) is set. In that case, 49 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 50 * in the directory have already been read: 51 * 52 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 53 * or packed references, already read. 54 * 55 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 56 * references that hasn't been read yet (nor has any of its 57 * subdirectories). 58 * 59 * Entries within a directory are stored within a growable array of 60 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 61 * sorted are sorted by their component name in strcmp() order and the 62 * remaining entries are unsorted. 63 * 64 * Loose references are read lazily, one directory at a time. When a 65 * directory of loose references is read, then all of the references 66 * in that directory are stored, and REF_INCOMPLETE stubs are created 67 * for any subdirectories, but the subdirectories themselves are not 68 * read. The reading is triggered by get_ref_dir(). 69 */ 70struct ref_dir { 71int nr, alloc; 72 73/* 74 * Entries with index 0 <= i < sorted are sorted by name. New 75 * entries are appended to the list unsorted, and are sorted 76 * only when required; thus we avoid the need to sort the list 77 * after the addition of every reference. 78 */ 79int sorted; 80 81/* A pointer to the files_ref_store that contains this ref_dir. */ 82struct files_ref_store *ref_store; 83 84struct ref_entry **entries; 85}; 86 87/* 88 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 89 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 90 * public values; see refs.h. 91 */ 92 93/* 94 * The field ref_entry->u.value.peeled of this value entry contains 95 * the correct peeled value for the reference, which might be 96 * null_sha1 if the reference is not a tag or if it is broken. 97 */ 98#define REF_KNOWS_PEELED 0x10 99 100/* ref_entry represents a directory of references */ 101#define REF_DIR 0x20 102 103/* 104 * Entry has not yet been read from disk (used only for REF_DIR 105 * entries representing loose references) 106 */ 107#define REF_INCOMPLETE 0x40 108 109/* 110 * A ref_entry represents either a reference or a "subdirectory" of 111 * references. 112 * 113 * Each directory in the reference namespace is represented by a 114 * ref_entry with (flags & REF_DIR) set and containing a subdir member 115 * that holds the entries in that directory that have been read so 116 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 117 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 118 * used for loose reference directories. 119 * 120 * References are represented by a ref_entry with (flags & REF_DIR) 121 * unset and a value member that describes the reference's value. The 122 * flag member is at the ref_entry level, but it is also needed to 123 * interpret the contents of the value field (in other words, a 124 * ref_value object is not very much use without the enclosing 125 * ref_entry). 126 * 127 * Reference names cannot end with slash and directories' names are 128 * always stored with a trailing slash (except for the top-level 129 * directory, which is always denoted by ""). This has two nice 130 * consequences: (1) when the entries in each subdir are sorted 131 * lexicographically by name (as they usually are), the references in 132 * a whole tree can be generated in lexicographic order by traversing 133 * the tree in left-to-right, depth-first order; (2) the names of 134 * references and subdirectories cannot conflict, and therefore the 135 * presence of an empty subdirectory does not block the creation of a 136 * similarly-named reference. (The fact that reference names with the 137 * same leading components can conflict *with each other* is a 138 * separate issue that is regulated by verify_refname_available().) 139 * 140 * Please note that the name field contains the fully-qualified 141 * reference (or subdirectory) name. Space could be saved by only 142 * storing the relative names. But that would require the full names 143 * to be generated on the fly when iterating in do_for_each_ref(), and 144 * would break callback functions, who have always been able to assume 145 * that the name strings that they are passed will not be freed during 146 * the iteration. 147 */ 148struct ref_entry { 149unsigned char flag;/* ISSYMREF? ISPACKED? */ 150union{ 151struct ref_value value;/* if not (flags&REF_DIR) */ 152struct ref_dir subdir;/* if (flags&REF_DIR) */ 153} u; 154/* 155 * The full name of the reference (e.g., "refs/heads/master") 156 * or the full name of the directory with a trailing slash 157 * (e.g., "refs/heads/"): 158 */ 159char name[FLEX_ARRAY]; 160}; 161 162static voidread_loose_refs(const char*dirname,struct ref_dir *dir); 163static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len); 164static struct ref_entry *create_dir_entry(struct files_ref_store *ref_store, 165const char*dirname,size_t len, 166int incomplete); 167static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry); 168static intfiles_log_ref_write(struct files_ref_store *refs, 169const char*refname,const unsigned char*old_sha1, 170const unsigned char*new_sha1,const char*msg, 171int flags,struct strbuf *err); 172 173static struct ref_dir *get_ref_dir(struct ref_entry *entry) 174{ 175struct ref_dir *dir; 176assert(entry->flag & REF_DIR); 177 dir = &entry->u.subdir; 178if(entry->flag & REF_INCOMPLETE) { 179read_loose_refs(entry->name, dir); 180 181/* 182 * Manually add refs/bisect, which, being 183 * per-worktree, might not appear in the directory 184 * listing for refs/ in the main repo. 185 */ 186if(!strcmp(entry->name,"refs/")) { 187int pos =search_ref_dir(dir,"refs/bisect/",12); 188if(pos <0) { 189struct ref_entry *child_entry; 190 child_entry =create_dir_entry(dir->ref_store, 191"refs/bisect/", 19212,1); 193add_entry_to_dir(dir, child_entry); 194read_loose_refs("refs/bisect", 195&child_entry->u.subdir); 196} 197} 198 entry->flag &= ~REF_INCOMPLETE; 199} 200return dir; 201} 202 203static struct ref_entry *create_ref_entry(const char*refname, 204const unsigned char*sha1,int flag, 205int check_name) 206{ 207struct ref_entry *ref; 208 209if(check_name && 210check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 211die("Reference has invalid format: '%s'", refname); 212FLEX_ALLOC_STR(ref, name, refname); 213hashcpy(ref->u.value.oid.hash, sha1); 214oidclr(&ref->u.value.peeled); 215 ref->flag = flag; 216return ref; 217} 218 219static voidclear_ref_dir(struct ref_dir *dir); 220 221static voidfree_ref_entry(struct ref_entry *entry) 222{ 223if(entry->flag & REF_DIR) { 224/* 225 * Do not use get_ref_dir() here, as that might 226 * trigger the reading of loose refs. 227 */ 228clear_ref_dir(&entry->u.subdir); 229} 230free(entry); 231} 232 233/* 234 * Add a ref_entry to the end of dir (unsorted). Entry is always 235 * stored directly in dir; no recursion into subdirectories is 236 * done. 237 */ 238static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry) 239{ 240ALLOC_GROW(dir->entries, dir->nr +1, dir->alloc); 241 dir->entries[dir->nr++] = entry; 242/* optimize for the case that entries are added in order */ 243if(dir->nr ==1|| 244(dir->nr == dir->sorted +1&& 245strcmp(dir->entries[dir->nr -2]->name, 246 dir->entries[dir->nr -1]->name) <0)) 247 dir->sorted = dir->nr; 248} 249 250/* 251 * Clear and free all entries in dir, recursively. 252 */ 253static voidclear_ref_dir(struct ref_dir *dir) 254{ 255int i; 256for(i =0; i < dir->nr; i++) 257free_ref_entry(dir->entries[i]); 258free(dir->entries); 259 dir->sorted = dir->nr = dir->alloc =0; 260 dir->entries = NULL; 261} 262 263/* 264 * Create a struct ref_entry object for the specified dirname. 265 * dirname is the name of the directory with a trailing slash (e.g., 266 * "refs/heads/") or "" for the top-level directory. 267 */ 268static struct ref_entry *create_dir_entry(struct files_ref_store *ref_store, 269const char*dirname,size_t len, 270int incomplete) 271{ 272struct ref_entry *direntry; 273FLEX_ALLOC_MEM(direntry, name, dirname, len); 274 direntry->u.subdir.ref_store = ref_store; 275 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE :0); 276return direntry; 277} 278 279static intref_entry_cmp(const void*a,const void*b) 280{ 281struct ref_entry *one = *(struct ref_entry **)a; 282struct ref_entry *two = *(struct ref_entry **)b; 283returnstrcmp(one->name, two->name); 284} 285 286static voidsort_ref_dir(struct ref_dir *dir); 287 288struct string_slice { 289size_t len; 290const char*str; 291}; 292 293static intref_entry_cmp_sslice(const void*key_,const void*ent_) 294{ 295const struct string_slice *key = key_; 296const struct ref_entry *ent = *(const struct ref_entry *const*)ent_; 297int cmp =strncmp(key->str, ent->name, key->len); 298if(cmp) 299return cmp; 300return'\0'- (unsigned char)ent->name[key->len]; 301} 302 303/* 304 * Return the index of the entry with the given refname from the 305 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 306 * no such entry is found. dir must already be complete. 307 */ 308static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len) 309{ 310struct ref_entry **r; 311struct string_slice key; 312 313if(refname == NULL || !dir->nr) 314return-1; 315 316sort_ref_dir(dir); 317 key.len = len; 318 key.str = refname; 319 r =bsearch(&key, dir->entries, dir->nr,sizeof(*dir->entries), 320 ref_entry_cmp_sslice); 321 322if(r == NULL) 323return-1; 324 325return r - dir->entries; 326} 327 328/* 329 * Search for a directory entry directly within dir (without 330 * recursing). Sort dir if necessary. subdirname must be a directory 331 * name (i.e., end in '/'). If mkdir is set, then create the 332 * directory if it is missing; otherwise, return NULL if the desired 333 * directory cannot be found. dir must already be complete. 334 */ 335static struct ref_dir *search_for_subdir(struct ref_dir *dir, 336const char*subdirname,size_t len, 337int mkdir) 338{ 339int entry_index =search_ref_dir(dir, subdirname, len); 340struct ref_entry *entry; 341if(entry_index == -1) { 342if(!mkdir) 343return NULL; 344/* 345 * Since dir is complete, the absence of a subdir 346 * means that the subdir really doesn't exist; 347 * therefore, create an empty record for it but mark 348 * the record complete. 349 */ 350 entry =create_dir_entry(dir->ref_store, subdirname, len,0); 351add_entry_to_dir(dir, entry); 352}else{ 353 entry = dir->entries[entry_index]; 354} 355returnget_ref_dir(entry); 356} 357 358/* 359 * If refname is a reference name, find the ref_dir within the dir 360 * tree that should hold refname. If refname is a directory name 361 * (i.e., ends in '/'), then return that ref_dir itself. dir must 362 * represent the top-level directory and must already be complete. 363 * Sort ref_dirs and recurse into subdirectories as necessary. If 364 * mkdir is set, then create any missing directories; otherwise, 365 * return NULL if the desired directory cannot be found. 366 */ 367static struct ref_dir *find_containing_dir(struct ref_dir *dir, 368const char*refname,int mkdir) 369{ 370const char*slash; 371for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 372size_t dirnamelen = slash - refname +1; 373struct ref_dir *subdir; 374 subdir =search_for_subdir(dir, refname, dirnamelen, mkdir); 375if(!subdir) { 376 dir = NULL; 377break; 378} 379 dir = subdir; 380} 381 382return dir; 383} 384 385/* 386 * Find the value entry with the given name in dir, sorting ref_dirs 387 * and recursing into subdirectories as necessary. If the name is not 388 * found or it corresponds to a directory entry, return NULL. 389 */ 390static struct ref_entry *find_ref(struct ref_dir *dir,const char*refname) 391{ 392int entry_index; 393struct ref_entry *entry; 394 dir =find_containing_dir(dir, refname,0); 395if(!dir) 396return NULL; 397 entry_index =search_ref_dir(dir, refname,strlen(refname)); 398if(entry_index == -1) 399return NULL; 400 entry = dir->entries[entry_index]; 401return(entry->flag & REF_DIR) ? NULL : entry; 402} 403 404/* 405 * Remove the entry with the given name from dir, recursing into 406 * subdirectories as necessary. If refname is the name of a directory 407 * (i.e., ends with '/'), then remove the directory and its contents. 408 * If the removal was successful, return the number of entries 409 * remaining in the directory entry that contained the deleted entry. 410 * If the name was not found, return -1. Please note that this 411 * function only deletes the entry from the cache; it does not delete 412 * it from the filesystem or ensure that other cache entries (which 413 * might be symbolic references to the removed entry) are updated. 414 * Nor does it remove any containing dir entries that might be made 415 * empty by the removal. dir must represent the top-level directory 416 * and must already be complete. 417 */ 418static intremove_entry(struct ref_dir *dir,const char*refname) 419{ 420int refname_len =strlen(refname); 421int entry_index; 422struct ref_entry *entry; 423int is_dir = refname[refname_len -1] =='/'; 424if(is_dir) { 425/* 426 * refname represents a reference directory. Remove 427 * the trailing slash; otherwise we will get the 428 * directory *representing* refname rather than the 429 * one *containing* it. 430 */ 431char*dirname =xmemdupz(refname, refname_len -1); 432 dir =find_containing_dir(dir, dirname,0); 433free(dirname); 434}else{ 435 dir =find_containing_dir(dir, refname,0); 436} 437if(!dir) 438return-1; 439 entry_index =search_ref_dir(dir, refname, refname_len); 440if(entry_index == -1) 441return-1; 442 entry = dir->entries[entry_index]; 443 444memmove(&dir->entries[entry_index], 445&dir->entries[entry_index +1], 446(dir->nr - entry_index -1) *sizeof(*dir->entries) 447); 448 dir->nr--; 449if(dir->sorted > entry_index) 450 dir->sorted--; 451free_ref_entry(entry); 452return dir->nr; 453} 454 455/* 456 * Add a ref_entry to the ref_dir (unsorted), recursing into 457 * subdirectories as necessary. dir must represent the top-level 458 * directory. Return 0 on success. 459 */ 460static intadd_ref(struct ref_dir *dir,struct ref_entry *ref) 461{ 462 dir =find_containing_dir(dir, ref->name,1); 463if(!dir) 464return-1; 465add_entry_to_dir(dir, ref); 466return0; 467} 468 469/* 470 * Emit a warning and return true iff ref1 and ref2 have the same name 471 * and the same sha1. Die if they have the same name but different 472 * sha1s. 473 */ 474static intis_dup_ref(const struct ref_entry *ref1,const struct ref_entry *ref2) 475{ 476if(strcmp(ref1->name, ref2->name)) 477return0; 478 479/* Duplicate name; make sure that they don't conflict: */ 480 481if((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 482/* This is impossible by construction */ 483die("Reference directory conflict:%s", ref1->name); 484 485if(oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 486die("Duplicated ref, and SHA1s don't match:%s", ref1->name); 487 488warning("Duplicated ref:%s", ref1->name); 489return1; 490} 491 492/* 493 * Sort the entries in dir non-recursively (if they are not already 494 * sorted) and remove any duplicate entries. 495 */ 496static voidsort_ref_dir(struct ref_dir *dir) 497{ 498int i, j; 499struct ref_entry *last = NULL; 500 501/* 502 * This check also prevents passing a zero-length array to qsort(), 503 * which is a problem on some platforms. 504 */ 505if(dir->sorted == dir->nr) 506return; 507 508QSORT(dir->entries, dir->nr, ref_entry_cmp); 509 510/* Remove any duplicates: */ 511for(i =0, j =0; j < dir->nr; j++) { 512struct ref_entry *entry = dir->entries[j]; 513if(last &&is_dup_ref(last, entry)) 514free_ref_entry(entry); 515else 516 last = dir->entries[i++] = entry; 517} 518 dir->sorted = dir->nr = i; 519} 520 521/* 522 * Return true if refname, which has the specified oid and flags, can 523 * be resolved to an object in the database. If the referred-to object 524 * does not exist, emit a warning and return false. 525 */ 526static intref_resolves_to_object(const char*refname, 527const struct object_id *oid, 528unsigned int flags) 529{ 530if(flags & REF_ISBROKEN) 531return0; 532if(!has_sha1_file(oid->hash)) { 533error("%sdoes not point to a valid object!", refname); 534return0; 535} 536return1; 537} 538 539/* 540 * Return true if the reference described by entry can be resolved to 541 * an object in the database; otherwise, emit a warning and return 542 * false. 543 */ 544static intentry_resolves_to_object(struct ref_entry *entry) 545{ 546returnref_resolves_to_object(entry->name, 547&entry->u.value.oid, entry->flag); 548} 549 550typedefinteach_ref_entry_fn(struct ref_entry *entry,void*cb_data); 551 552/* 553 * Call fn for each reference in dir that has index in the range 554 * offset <= index < dir->nr. Recurse into subdirectories that are in 555 * that index range, sorting them before iterating. This function 556 * does not sort dir itself; it should be sorted beforehand. fn is 557 * called for all references, including broken ones. 558 */ 559static intdo_for_each_entry_in_dir(struct ref_dir *dir,int offset, 560 each_ref_entry_fn fn,void*cb_data) 561{ 562int i; 563assert(dir->sorted == dir->nr); 564for(i = offset; i < dir->nr; i++) { 565struct ref_entry *entry = dir->entries[i]; 566int retval; 567if(entry->flag & REF_DIR) { 568struct ref_dir *subdir =get_ref_dir(entry); 569sort_ref_dir(subdir); 570 retval =do_for_each_entry_in_dir(subdir,0, fn, cb_data); 571}else{ 572 retval =fn(entry, cb_data); 573} 574if(retval) 575return retval; 576} 577return0; 578} 579 580/* 581 * Load all of the refs from the dir into our in-memory cache. The hard work 582 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 583 * through all of the sub-directories. We do not even need to care about 584 * sorting, as traversal order does not matter to us. 585 */ 586static voidprime_ref_dir(struct ref_dir *dir) 587{ 588int i; 589for(i =0; i < dir->nr; i++) { 590struct ref_entry *entry = dir->entries[i]; 591if(entry->flag & REF_DIR) 592prime_ref_dir(get_ref_dir(entry)); 593} 594} 595 596/* 597 * A level in the reference hierarchy that is currently being iterated 598 * through. 599 */ 600struct cache_ref_iterator_level { 601/* 602 * The ref_dir being iterated over at this level. The ref_dir 603 * is sorted before being stored here. 604 */ 605struct ref_dir *dir; 606 607/* 608 * The index of the current entry within dir (which might 609 * itself be a directory). If index == -1, then the iteration 610 * hasn't yet begun. If index == dir->nr, then the iteration 611 * through this level is over. 612 */ 613int index; 614}; 615 616/* 617 * Represent an iteration through a ref_dir in the memory cache. The 618 * iteration recurses through subdirectories. 619 */ 620struct cache_ref_iterator { 621struct ref_iterator base; 622 623/* 624 * The number of levels currently on the stack. This is always 625 * at least 1, because when it becomes zero the iteration is 626 * ended and this struct is freed. 627 */ 628size_t levels_nr; 629 630/* The number of levels that have been allocated on the stack */ 631size_t levels_alloc; 632 633/* 634 * A stack of levels. levels[0] is the uppermost level that is 635 * being iterated over in this iteration. (This is not 636 * necessary the top level in the references hierarchy. If we 637 * are iterating through a subtree, then levels[0] will hold 638 * the ref_dir for that subtree, and subsequent levels will go 639 * on from there.) 640 */ 641struct cache_ref_iterator_level *levels; 642}; 643 644static intcache_ref_iterator_advance(struct ref_iterator *ref_iterator) 645{ 646struct cache_ref_iterator *iter = 647(struct cache_ref_iterator *)ref_iterator; 648 649while(1) { 650struct cache_ref_iterator_level *level = 651&iter->levels[iter->levels_nr -1]; 652struct ref_dir *dir = level->dir; 653struct ref_entry *entry; 654 655if(level->index == -1) 656sort_ref_dir(dir); 657 658if(++level->index == level->dir->nr) { 659/* This level is exhausted; pop up a level */ 660if(--iter->levels_nr ==0) 661returnref_iterator_abort(ref_iterator); 662 663continue; 664} 665 666 entry = dir->entries[level->index]; 667 668if(entry->flag & REF_DIR) { 669/* push down a level */ 670ALLOC_GROW(iter->levels, iter->levels_nr +1, 671 iter->levels_alloc); 672 673 level = &iter->levels[iter->levels_nr++]; 674 level->dir =get_ref_dir(entry); 675 level->index = -1; 676}else{ 677 iter->base.refname = entry->name; 678 iter->base.oid = &entry->u.value.oid; 679 iter->base.flags = entry->flag; 680return ITER_OK; 681} 682} 683} 684 685static enum peel_status peel_entry(struct ref_entry *entry,int repeel); 686 687static intcache_ref_iterator_peel(struct ref_iterator *ref_iterator, 688struct object_id *peeled) 689{ 690struct cache_ref_iterator *iter = 691(struct cache_ref_iterator *)ref_iterator; 692struct cache_ref_iterator_level *level; 693struct ref_entry *entry; 694 695 level = &iter->levels[iter->levels_nr -1]; 696 697if(level->index == -1) 698die("BUG: peel called before advance for cache iterator"); 699 700 entry = level->dir->entries[level->index]; 701 702if(peel_entry(entry,0)) 703return-1; 704oidcpy(peeled, &entry->u.value.peeled); 705return0; 706} 707 708static intcache_ref_iterator_abort(struct ref_iterator *ref_iterator) 709{ 710struct cache_ref_iterator *iter = 711(struct cache_ref_iterator *)ref_iterator; 712 713free(iter->levels); 714base_ref_iterator_free(ref_iterator); 715return ITER_DONE; 716} 717 718static struct ref_iterator_vtable cache_ref_iterator_vtable = { 719 cache_ref_iterator_advance, 720 cache_ref_iterator_peel, 721 cache_ref_iterator_abort 722}; 723 724static struct ref_iterator *cache_ref_iterator_begin(struct ref_dir *dir) 725{ 726struct cache_ref_iterator *iter; 727struct ref_iterator *ref_iterator; 728struct cache_ref_iterator_level *level; 729 730 iter =xcalloc(1,sizeof(*iter)); 731 ref_iterator = &iter->base; 732base_ref_iterator_init(ref_iterator, &cache_ref_iterator_vtable); 733ALLOC_GROW(iter->levels,10, iter->levels_alloc); 734 735 iter->levels_nr =1; 736 level = &iter->levels[0]; 737 level->index = -1; 738 level->dir = dir; 739 740return ref_iterator; 741} 742 743struct nonmatching_ref_data { 744const struct string_list *skip; 745const char*conflicting_refname; 746}; 747 748static intnonmatching_ref_fn(struct ref_entry *entry,void*vdata) 749{ 750struct nonmatching_ref_data *data = vdata; 751 752if(data->skip &&string_list_has_string(data->skip, entry->name)) 753return0; 754 755 data->conflicting_refname = entry->name; 756return1; 757} 758 759/* 760 * Return 0 if a reference named refname could be created without 761 * conflicting with the name of an existing reference in dir. 762 * See verify_refname_available for more information. 763 */ 764static intverify_refname_available_dir(const char*refname, 765const struct string_list *extras, 766const struct string_list *skip, 767struct ref_dir *dir, 768struct strbuf *err) 769{ 770const char*slash; 771const char*extra_refname; 772int pos; 773struct strbuf dirname = STRBUF_INIT; 774int ret = -1; 775 776/* 777 * For the sake of comments in this function, suppose that 778 * refname is "refs/foo/bar". 779 */ 780 781assert(err); 782 783strbuf_grow(&dirname,strlen(refname) +1); 784for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 785/* Expand dirname to the new prefix, not including the trailing slash: */ 786strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 787 788/* 789 * We are still at a leading dir of the refname (e.g., 790 * "refs/foo"; if there is a reference with that name, 791 * it is a conflict, *unless* it is in skip. 792 */ 793if(dir) { 794 pos =search_ref_dir(dir, dirname.buf, dirname.len); 795if(pos >=0&& 796(!skip || !string_list_has_string(skip, dirname.buf))) { 797/* 798 * We found a reference whose name is 799 * a proper prefix of refname; e.g., 800 * "refs/foo", and is not in skip. 801 */ 802strbuf_addf(err,"'%s' exists; cannot create '%s'", 803 dirname.buf, refname); 804goto cleanup; 805} 806} 807 808if(extras &&string_list_has_string(extras, dirname.buf) && 809(!skip || !string_list_has_string(skip, dirname.buf))) { 810strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 811 refname, dirname.buf); 812goto cleanup; 813} 814 815/* 816 * Otherwise, we can try to continue our search with 817 * the next component. So try to look up the 818 * directory, e.g., "refs/foo/". If we come up empty, 819 * we know there is nothing under this whole prefix, 820 * but even in that case we still have to continue the 821 * search for conflicts with extras. 822 */ 823strbuf_addch(&dirname,'/'); 824if(dir) { 825 pos =search_ref_dir(dir, dirname.buf, dirname.len); 826if(pos <0) { 827/* 828 * There was no directory "refs/foo/", 829 * so there is nothing under this 830 * whole prefix. So there is no need 831 * to continue looking for conflicting 832 * references. But we need to continue 833 * looking for conflicting extras. 834 */ 835 dir = NULL; 836}else{ 837 dir =get_ref_dir(dir->entries[pos]); 838} 839} 840} 841 842/* 843 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 844 * There is no point in searching for a reference with that 845 * name, because a refname isn't considered to conflict with 846 * itself. But we still need to check for references whose 847 * names are in the "refs/foo/bar/" namespace, because they 848 * *do* conflict. 849 */ 850strbuf_addstr(&dirname, refname + dirname.len); 851strbuf_addch(&dirname,'/'); 852 853if(dir) { 854 pos =search_ref_dir(dir, dirname.buf, dirname.len); 855 856if(pos >=0) { 857/* 858 * We found a directory named "$refname/" 859 * (e.g., "refs/foo/bar/"). It is a problem 860 * iff it contains any ref that is not in 861 * "skip". 862 */ 863struct nonmatching_ref_data data; 864 865 data.skip = skip; 866 data.conflicting_refname = NULL; 867 dir =get_ref_dir(dir->entries[pos]); 868sort_ref_dir(dir); 869if(do_for_each_entry_in_dir(dir,0, nonmatching_ref_fn, &data)) { 870strbuf_addf(err,"'%s' exists; cannot create '%s'", 871 data.conflicting_refname, refname); 872goto cleanup; 873} 874} 875} 876 877 extra_refname =find_descendant_ref(dirname.buf, extras, skip); 878if(extra_refname) 879strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 880 refname, extra_refname); 881else 882 ret =0; 883 884cleanup: 885strbuf_release(&dirname); 886return ret; 887} 888 889struct packed_ref_cache { 890struct ref_entry *root; 891 892/* 893 * Count of references to the data structure in this instance, 894 * including the pointer from files_ref_store::packed if any. 895 * The data will not be freed as long as the reference count 896 * is nonzero. 897 */ 898unsigned int referrers; 899 900/* 901 * Iff the packed-refs file associated with this instance is 902 * currently locked for writing, this points at the associated 903 * lock (which is owned by somebody else). The referrer count 904 * is also incremented when the file is locked and decremented 905 * when it is unlocked. 906 */ 907struct lock_file *lock; 908 909/* The metadata from when this packed-refs cache was read */ 910struct stat_validity validity; 911}; 912 913/* 914 * Future: need to be in "struct repository" 915 * when doing a full libification. 916 */ 917struct files_ref_store { 918struct ref_store base; 919unsigned int store_flags; 920 921char*gitdir; 922char*gitcommondir; 923char*packed_refs_path; 924 925struct ref_entry *loose; 926struct packed_ref_cache *packed; 927}; 928 929/* Lock used for the main packed-refs file: */ 930static struct lock_file packlock; 931 932/* 933 * Increment the reference count of *packed_refs. 934 */ 935static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 936{ 937 packed_refs->referrers++; 938} 939 940/* 941 * Decrease the reference count of *packed_refs. If it goes to zero, 942 * free *packed_refs and return true; otherwise return false. 943 */ 944static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs) 945{ 946if(!--packed_refs->referrers) { 947free_ref_entry(packed_refs->root); 948stat_validity_clear(&packed_refs->validity); 949free(packed_refs); 950return1; 951}else{ 952return0; 953} 954} 955 956static voidclear_packed_ref_cache(struct files_ref_store *refs) 957{ 958if(refs->packed) { 959struct packed_ref_cache *packed_refs = refs->packed; 960 961if(packed_refs->lock) 962die("internal error: packed-ref cache cleared while locked"); 963 refs->packed = NULL; 964release_packed_ref_cache(packed_refs); 965} 966} 967 968static voidclear_loose_ref_cache(struct files_ref_store *refs) 969{ 970if(refs->loose) { 971free_ref_entry(refs->loose); 972 refs->loose = NULL; 973} 974} 975 976/* 977 * Create a new submodule ref cache and add it to the internal 978 * set of caches. 979 */ 980static struct ref_store *files_ref_store_create(const char*gitdir, 981unsigned int flags) 982{ 983struct files_ref_store *refs =xcalloc(1,sizeof(*refs)); 984struct ref_store *ref_store = (struct ref_store *)refs; 985struct strbuf sb = STRBUF_INIT; 986 987base_ref_store_init(ref_store, &refs_be_files); 988 refs->store_flags = flags; 989 990 refs->gitdir =xstrdup(gitdir); 991get_common_dir_noenv(&sb, gitdir); 992 refs->gitcommondir =strbuf_detach(&sb, NULL); 993strbuf_addf(&sb,"%s/packed-refs", refs->gitcommondir); 994 refs->packed_refs_path =strbuf_detach(&sb, NULL); 995 996return ref_store; 997} 998 999/*1000 * Die if refs is not the main ref store. caller is used in any1001 * necessary error messages.1002 */1003static voidfiles_assert_main_repository(struct files_ref_store *refs,1004const char*caller)1005{1006if(refs->store_flags & REF_STORE_MAIN)1007return;10081009die("BUG: operation%sonly allowed for main ref store", caller);1010}10111012/*1013 * Downcast ref_store to files_ref_store. Die if ref_store is not a1014 * files_ref_store. required_flags is compared with ref_store's1015 * store_flags to ensure the ref_store has all required capabilities.1016 * "caller" is used in any necessary error messages.1017 */1018static struct files_ref_store *files_downcast(struct ref_store *ref_store,1019unsigned int required_flags,1020const char*caller)1021{1022struct files_ref_store *refs;10231024if(ref_store->be != &refs_be_files)1025die("BUG: ref_store is type\"%s\"not\"files\"in%s",1026 ref_store->be->name, caller);10271028 refs = (struct files_ref_store *)ref_store;10291030if((refs->store_flags & required_flags) != required_flags)1031die("BUG: operation%srequires abilities 0x%x, but only have 0x%x",1032 caller, required_flags, refs->store_flags);10331034return refs;1035}10361037/* The length of a peeled reference line in packed-refs, including EOL: */1038#define PEELED_LINE_LENGTH 4210391040/*1041 * The packed-refs header line that we write out. Perhaps other1042 * traits will be added later. The trailing space is required.1043 */1044static const char PACKED_REFS_HEADER[] =1045"# pack-refs with: peeled fully-peeled\n";10461047/*1048 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1049 * Return a pointer to the refname within the line (null-terminated),1050 * or NULL if there was a problem.1051 */1052static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1)1053{1054const char*ref;10551056/*1057 * 42: the answer to everything.1058 *1059 * In this case, it happens to be the answer to1060 * 40 (length of sha1 hex representation)1061 * +1 (space in between hex and name)1062 * +1 (newline at the end of the line)1063 */1064if(line->len <=42)1065return NULL;10661067if(get_sha1_hex(line->buf, sha1) <0)1068return NULL;1069if(!isspace(line->buf[40]))1070return NULL;10711072 ref = line->buf +41;1073if(isspace(*ref))1074return NULL;10751076if(line->buf[line->len -1] !='\n')1077return NULL;1078 line->buf[--line->len] =0;10791080return ref;1081}10821083/*1084 * Read f, which is a packed-refs file, into dir.1085 *1086 * A comment line of the form "# pack-refs with: " may contain zero or1087 * more traits. We interpret the traits as follows:1088 *1089 * No traits:1090 *1091 * Probably no references are peeled. But if the file contains a1092 * peeled value for a reference, we will use it.1093 *1094 * peeled:1095 *1096 * References under "refs/tags/", if they *can* be peeled, *are*1097 * peeled in this file. References outside of "refs/tags/" are1098 * probably not peeled even if they could have been, but if we find1099 * a peeled value for such a reference we will use it.1100 *1101 * fully-peeled:1102 *1103 * All references in the file that can be peeled are peeled.1104 * Inversely (and this is more important), any references in the1105 * file for which no peeled value is recorded is not peelable. This1106 * trait should typically be written alongside "peeled" for1107 * compatibility with older clients, but we do not require it1108 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1109 */1110static voidread_packed_refs(FILE*f,struct ref_dir *dir)1111{1112struct ref_entry *last = NULL;1113struct strbuf line = STRBUF_INIT;1114enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;11151116while(strbuf_getwholeline(&line, f,'\n') != EOF) {1117unsigned char sha1[20];1118const char*refname;1119const char*traits;11201121if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1122if(strstr(traits," fully-peeled "))1123 peeled = PEELED_FULLY;1124else if(strstr(traits," peeled "))1125 peeled = PEELED_TAGS;1126/* perhaps other traits later as well */1127continue;1128}11291130 refname =parse_ref_line(&line, sha1);1131if(refname) {1132int flag = REF_ISPACKED;11331134if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1135if(!refname_is_safe(refname))1136die("packed refname is dangerous:%s", refname);1137hashclr(sha1);1138 flag |= REF_BAD_NAME | REF_ISBROKEN;1139}1140 last =create_ref_entry(refname, sha1, flag,0);1141if(peeled == PEELED_FULLY ||1142(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1143 last->flag |= REF_KNOWS_PEELED;1144add_ref(dir, last);1145continue;1146}1147if(last &&1148 line.buf[0] =='^'&&1149 line.len == PEELED_LINE_LENGTH &&1150 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1151!get_sha1_hex(line.buf +1, sha1)) {1152hashcpy(last->u.value.peeled.hash, sha1);1153/*1154 * Regardless of what the file header said,1155 * we definitely know the value of *this*1156 * reference:1157 */1158 last->flag |= REF_KNOWS_PEELED;1159}1160}11611162strbuf_release(&line);1163}11641165static const char*files_packed_refs_path(struct files_ref_store *refs)1166{1167return refs->packed_refs_path;1168}11691170static voidfiles_reflog_path(struct files_ref_store *refs,1171struct strbuf *sb,1172const char*refname)1173{1174if(!refname) {1175/*1176 * FIXME: of course this is wrong in multi worktree1177 * setting. To be fixed real soon.1178 */1179strbuf_addf(sb,"%s/logs", refs->gitcommondir);1180return;1181}11821183switch(ref_type(refname)) {1184case REF_TYPE_PER_WORKTREE:1185case REF_TYPE_PSEUDOREF:1186strbuf_addf(sb,"%s/logs/%s", refs->gitdir, refname);1187break;1188case REF_TYPE_NORMAL:1189strbuf_addf(sb,"%s/logs/%s", refs->gitcommondir, refname);1190break;1191default:1192die("BUG: unknown ref type%dof ref%s",1193ref_type(refname), refname);1194}1195}11961197static voidfiles_ref_path(struct files_ref_store *refs,1198struct strbuf *sb,1199const char*refname)1200{1201switch(ref_type(refname)) {1202case REF_TYPE_PER_WORKTREE:1203case REF_TYPE_PSEUDOREF:1204strbuf_addf(sb,"%s/%s", refs->gitdir, refname);1205break;1206case REF_TYPE_NORMAL:1207strbuf_addf(sb,"%s/%s", refs->gitcommondir, refname);1208break;1209default:1210die("BUG: unknown ref type%dof ref%s",1211ref_type(refname), refname);1212}1213}12141215/*1216 * Get the packed_ref_cache for the specified files_ref_store,1217 * creating it if necessary.1218 */1219static struct packed_ref_cache *get_packed_ref_cache(struct files_ref_store *refs)1220{1221const char*packed_refs_file =files_packed_refs_path(refs);12221223if(refs->packed &&1224!stat_validity_check(&refs->packed->validity, packed_refs_file))1225clear_packed_ref_cache(refs);12261227if(!refs->packed) {1228FILE*f;12291230 refs->packed =xcalloc(1,sizeof(*refs->packed));1231acquire_packed_ref_cache(refs->packed);1232 refs->packed->root =create_dir_entry(refs,"",0,0);1233 f =fopen(packed_refs_file,"r");1234if(f) {1235stat_validity_update(&refs->packed->validity,fileno(f));1236read_packed_refs(f,get_ref_dir(refs->packed->root));1237fclose(f);1238}1239}1240return refs->packed;1241}12421243static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1244{1245returnget_ref_dir(packed_ref_cache->root);1246}12471248static struct ref_dir *get_packed_refs(struct files_ref_store *refs)1249{1250returnget_packed_ref_dir(get_packed_ref_cache(refs));1251}12521253/*1254 * Add a reference to the in-memory packed reference cache. This may1255 * only be called while the packed-refs file is locked (see1256 * lock_packed_refs()). To actually write the packed-refs file, call1257 * commit_packed_refs().1258 */1259static voidadd_packed_ref(struct files_ref_store *refs,1260const char*refname,const unsigned char*sha1)1261{1262struct packed_ref_cache *packed_ref_cache =get_packed_ref_cache(refs);12631264if(!packed_ref_cache->lock)1265die("internal error: packed refs not locked");1266add_ref(get_packed_ref_dir(packed_ref_cache),1267create_ref_entry(refname, sha1, REF_ISPACKED,1));1268}12691270/*1271 * Read the loose references from the namespace dirname into dir1272 * (without recursing). dirname must end with '/'. dir must be the1273 * directory entry corresponding to dirname.1274 */1275static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1276{1277struct files_ref_store *refs = dir->ref_store;1278DIR*d;1279struct dirent *de;1280int dirnamelen =strlen(dirname);1281struct strbuf refname;1282struct strbuf path = STRBUF_INIT;1283size_t path_baselen;12841285files_ref_path(refs, &path, dirname);1286 path_baselen = path.len;12871288 d =opendir(path.buf);1289if(!d) {1290strbuf_release(&path);1291return;1292}12931294strbuf_init(&refname, dirnamelen +257);1295strbuf_add(&refname, dirname, dirnamelen);12961297while((de =readdir(d)) != NULL) {1298unsigned char sha1[20];1299struct stat st;1300int flag;13011302if(de->d_name[0] =='.')1303continue;1304if(ends_with(de->d_name,".lock"))1305continue;1306strbuf_addstr(&refname, de->d_name);1307strbuf_addstr(&path, de->d_name);1308if(stat(path.buf, &st) <0) {1309;/* silently ignore */1310}else if(S_ISDIR(st.st_mode)) {1311strbuf_addch(&refname,'/');1312add_entry_to_dir(dir,1313create_dir_entry(refs, refname.buf,1314 refname.len,1));1315}else{1316if(!resolve_ref_recursively(&refs->base,1317 refname.buf,1318 RESOLVE_REF_READING,1319 sha1, &flag)) {1320hashclr(sha1);1321 flag |= REF_ISBROKEN;1322}else if(is_null_sha1(sha1)) {1323/*1324 * It is so astronomically unlikely1325 * that NULL_SHA1 is the SHA-1 of an1326 * actual object that we consider its1327 * appearance in a loose reference1328 * file to be repo corruption1329 * (probably due to a software bug).1330 */1331 flag |= REF_ISBROKEN;1332}13331334if(check_refname_format(refname.buf,1335 REFNAME_ALLOW_ONELEVEL)) {1336if(!refname_is_safe(refname.buf))1337die("loose refname is dangerous:%s", refname.buf);1338hashclr(sha1);1339 flag |= REF_BAD_NAME | REF_ISBROKEN;1340}1341add_entry_to_dir(dir,1342create_ref_entry(refname.buf, sha1, flag,0));1343}1344strbuf_setlen(&refname, dirnamelen);1345strbuf_setlen(&path, path_baselen);1346}1347strbuf_release(&refname);1348strbuf_release(&path);1349closedir(d);1350}13511352static struct ref_dir *get_loose_refs(struct files_ref_store *refs)1353{1354if(!refs->loose) {1355/*1356 * Mark the top-level directory complete because we1357 * are about to read the only subdirectory that can1358 * hold references:1359 */1360 refs->loose =create_dir_entry(refs,"",0,0);1361/*1362 * Create an incomplete entry for "refs/":1363 */1364add_entry_to_dir(get_ref_dir(refs->loose),1365create_dir_entry(refs,"refs/",5,1));1366}1367returnget_ref_dir(refs->loose);1368}13691370/*1371 * Return the ref_entry for the given refname from the packed1372 * references. If it does not exist, return NULL.1373 */1374static struct ref_entry *get_packed_ref(struct files_ref_store *refs,1375const char*refname)1376{1377returnfind_ref(get_packed_refs(refs), refname);1378}13791380/*1381 * A loose ref file doesn't exist; check for a packed ref.1382 */1383static intresolve_packed_ref(struct files_ref_store *refs,1384const char*refname,1385unsigned char*sha1,unsigned int*flags)1386{1387struct ref_entry *entry;13881389/*1390 * The loose reference file does not exist; check for a packed1391 * reference.1392 */1393 entry =get_packed_ref(refs, refname);1394if(entry) {1395hashcpy(sha1, entry->u.value.oid.hash);1396*flags |= REF_ISPACKED;1397return0;1398}1399/* refname is not a packed reference. */1400return-1;1401}14021403static intfiles_read_raw_ref(struct ref_store *ref_store,1404const char*refname,unsigned char*sha1,1405struct strbuf *referent,unsigned int*type)1406{1407struct files_ref_store *refs =1408files_downcast(ref_store, REF_STORE_READ,"read_raw_ref");1409struct strbuf sb_contents = STRBUF_INIT;1410struct strbuf sb_path = STRBUF_INIT;1411const char*path;1412const char*buf;1413struct stat st;1414int fd;1415int ret = -1;1416int save_errno;1417int remaining_retries =3;14181419*type =0;1420strbuf_reset(&sb_path);14211422files_ref_path(refs, &sb_path, refname);14231424 path = sb_path.buf;14251426stat_ref:1427/*1428 * We might have to loop back here to avoid a race1429 * condition: first we lstat() the file, then we try1430 * to read it as a link or as a file. But if somebody1431 * changes the type of the file (file <-> directory1432 * <-> symlink) between the lstat() and reading, then1433 * we don't want to report that as an error but rather1434 * try again starting with the lstat().1435 *1436 * We'll keep a count of the retries, though, just to avoid1437 * any confusing situation sending us into an infinite loop.1438 */14391440if(remaining_retries-- <=0)1441goto out;14421443if(lstat(path, &st) <0) {1444if(errno != ENOENT)1445goto out;1446if(resolve_packed_ref(refs, refname, sha1, type)) {1447 errno = ENOENT;1448goto out;1449}1450 ret =0;1451goto out;1452}14531454/* Follow "normalized" - ie "refs/.." symlinks by hand */1455if(S_ISLNK(st.st_mode)) {1456strbuf_reset(&sb_contents);1457if(strbuf_readlink(&sb_contents, path,0) <0) {1458if(errno == ENOENT || errno == EINVAL)1459/* inconsistent with lstat; retry */1460goto stat_ref;1461else1462goto out;1463}1464if(starts_with(sb_contents.buf,"refs/") &&1465!check_refname_format(sb_contents.buf,0)) {1466strbuf_swap(&sb_contents, referent);1467*type |= REF_ISSYMREF;1468 ret =0;1469goto out;1470}1471/*1472 * It doesn't look like a refname; fall through to just1473 * treating it like a non-symlink, and reading whatever it1474 * points to.1475 */1476}14771478/* Is it a directory? */1479if(S_ISDIR(st.st_mode)) {1480/*1481 * Even though there is a directory where the loose1482 * ref is supposed to be, there could still be a1483 * packed ref:1484 */1485if(resolve_packed_ref(refs, refname, sha1, type)) {1486 errno = EISDIR;1487goto out;1488}1489 ret =0;1490goto out;1491}14921493/*1494 * Anything else, just open it and try to use it as1495 * a ref1496 */1497 fd =open(path, O_RDONLY);1498if(fd <0) {1499if(errno == ENOENT && !S_ISLNK(st.st_mode))1500/* inconsistent with lstat; retry */1501goto stat_ref;1502else1503goto out;1504}1505strbuf_reset(&sb_contents);1506if(strbuf_read(&sb_contents, fd,256) <0) {1507int save_errno = errno;1508close(fd);1509 errno = save_errno;1510goto out;1511}1512close(fd);1513strbuf_rtrim(&sb_contents);1514 buf = sb_contents.buf;1515if(starts_with(buf,"ref:")) {1516 buf +=4;1517while(isspace(*buf))1518 buf++;15191520strbuf_reset(referent);1521strbuf_addstr(referent, buf);1522*type |= REF_ISSYMREF;1523 ret =0;1524goto out;1525}15261527/*1528 * Please note that FETCH_HEAD has additional1529 * data after the sha.1530 */1531if(get_sha1_hex(buf, sha1) ||1532(buf[40] !='\0'&& !isspace(buf[40]))) {1533*type |= REF_ISBROKEN;1534 errno = EINVAL;1535goto out;1536}15371538 ret =0;15391540out:1541 save_errno = errno;1542strbuf_release(&sb_path);1543strbuf_release(&sb_contents);1544 errno = save_errno;1545return ret;1546}15471548static voidunlock_ref(struct ref_lock *lock)1549{1550/* Do not free lock->lk -- atexit() still looks at them */1551if(lock->lk)1552rollback_lock_file(lock->lk);1553free(lock->ref_name);1554free(lock);1555}15561557/*1558 * Lock refname, without following symrefs, and set *lock_p to point1559 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1560 * and type similarly to read_raw_ref().1561 *1562 * The caller must verify that refname is a "safe" reference name (in1563 * the sense of refname_is_safe()) before calling this function.1564 *1565 * If the reference doesn't already exist, verify that refname doesn't1566 * have a D/F conflict with any existing references. extras and skip1567 * are passed to verify_refname_available_dir() for this check.1568 *1569 * If mustexist is not set and the reference is not found or is1570 * broken, lock the reference anyway but clear sha1.1571 *1572 * Return 0 on success. On failure, write an error message to err and1573 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1574 *1575 * Implementation note: This function is basically1576 *1577 * lock reference1578 * read_raw_ref()1579 *1580 * but it includes a lot more code to1581 * - Deal with possible races with other processes1582 * - Avoid calling verify_refname_available_dir() when it can be1583 * avoided, namely if we were successfully able to read the ref1584 * - Generate informative error messages in the case of failure1585 */1586static intlock_raw_ref(struct files_ref_store *refs,1587const char*refname,int mustexist,1588const struct string_list *extras,1589const struct string_list *skip,1590struct ref_lock **lock_p,1591struct strbuf *referent,1592unsigned int*type,1593struct strbuf *err)1594{1595struct ref_lock *lock;1596struct strbuf ref_file = STRBUF_INIT;1597int attempts_remaining =3;1598int ret = TRANSACTION_GENERIC_ERROR;15991600assert(err);1601files_assert_main_repository(refs,"lock_raw_ref");16021603*type =0;16041605/* First lock the file so it can't change out from under us. */16061607*lock_p = lock =xcalloc(1,sizeof(*lock));16081609 lock->ref_name =xstrdup(refname);1610files_ref_path(refs, &ref_file, refname);16111612retry:1613switch(safe_create_leading_directories(ref_file.buf)) {1614case SCLD_OK:1615break;/* success */1616case SCLD_EXISTS:1617/*1618 * Suppose refname is "refs/foo/bar". We just failed1619 * to create the containing directory, "refs/foo",1620 * because there was a non-directory in the way. This1621 * indicates a D/F conflict, probably because of1622 * another reference such as "refs/foo". There is no1623 * reason to expect this error to be transitory.1624 */1625if(verify_refname_available(refname, extras, skip, err)) {1626if(mustexist) {1627/*1628 * To the user the relevant error is1629 * that the "mustexist" reference is1630 * missing:1631 */1632strbuf_reset(err);1633strbuf_addf(err,"unable to resolve reference '%s'",1634 refname);1635}else{1636/*1637 * The error message set by1638 * verify_refname_available_dir() is OK.1639 */1640 ret = TRANSACTION_NAME_CONFLICT;1641}1642}else{1643/*1644 * The file that is in the way isn't a loose1645 * reference. Report it as a low-level1646 * failure.1647 */1648strbuf_addf(err,"unable to create lock file%s.lock; "1649"non-directory in the way",1650 ref_file.buf);1651}1652goto error_return;1653case SCLD_VANISHED:1654/* Maybe another process was tidying up. Try again. */1655if(--attempts_remaining >0)1656goto retry;1657/* fall through */1658default:1659strbuf_addf(err,"unable to create directory for%s",1660 ref_file.buf);1661goto error_return;1662}16631664if(!lock->lk)1665 lock->lk =xcalloc(1,sizeof(struct lock_file));16661667if(hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) <0) {1668if(errno == ENOENT && --attempts_remaining >0) {1669/*1670 * Maybe somebody just deleted one of the1671 * directories leading to ref_file. Try1672 * again:1673 */1674goto retry;1675}else{1676unable_to_lock_message(ref_file.buf, errno, err);1677goto error_return;1678}1679}16801681/*1682 * Now we hold the lock and can read the reference without1683 * fear that its value will change.1684 */16851686if(files_read_raw_ref(&refs->base, refname,1687 lock->old_oid.hash, referent, type)) {1688if(errno == ENOENT) {1689if(mustexist) {1690/* Garden variety missing reference. */1691strbuf_addf(err,"unable to resolve reference '%s'",1692 refname);1693goto error_return;1694}else{1695/*1696 * Reference is missing, but that's OK. We1697 * know that there is not a conflict with1698 * another loose reference because1699 * (supposing that we are trying to lock1700 * reference "refs/foo/bar"):1701 *1702 * - We were successfully able to create1703 * the lockfile refs/foo/bar.lock, so we1704 * know there cannot be a loose reference1705 * named "refs/foo".1706 *1707 * - We got ENOENT and not EISDIR, so we1708 * know that there cannot be a loose1709 * reference named "refs/foo/bar/baz".1710 */1711}1712}else if(errno == EISDIR) {1713/*1714 * There is a directory in the way. It might have1715 * contained references that have been deleted. If1716 * we don't require that the reference already1717 * exists, try to remove the directory so that it1718 * doesn't cause trouble when we want to rename the1719 * lockfile into place later.1720 */1721if(mustexist) {1722/* Garden variety missing reference. */1723strbuf_addf(err,"unable to resolve reference '%s'",1724 refname);1725goto error_return;1726}else if(remove_dir_recursively(&ref_file,1727 REMOVE_DIR_EMPTY_ONLY)) {1728if(verify_refname_available_dir(1729 refname, extras, skip,1730get_loose_refs(refs),1731 err)) {1732/*1733 * The error message set by1734 * verify_refname_available() is OK.1735 */1736 ret = TRANSACTION_NAME_CONFLICT;1737goto error_return;1738}else{1739/*1740 * We can't delete the directory,1741 * but we also don't know of any1742 * references that it should1743 * contain.1744 */1745strbuf_addf(err,"there is a non-empty directory '%s' "1746"blocking reference '%s'",1747 ref_file.buf, refname);1748goto error_return;1749}1750}1751}else if(errno == EINVAL && (*type & REF_ISBROKEN)) {1752strbuf_addf(err,"unable to resolve reference '%s': "1753"reference broken", refname);1754goto error_return;1755}else{1756strbuf_addf(err,"unable to resolve reference '%s':%s",1757 refname,strerror(errno));1758goto error_return;1759}17601761/*1762 * If the ref did not exist and we are creating it,1763 * make sure there is no existing packed ref whose1764 * name begins with our refname, nor a packed ref1765 * whose name is a proper prefix of our refname.1766 */1767if(verify_refname_available_dir(1768 refname, extras, skip,1769get_packed_refs(refs),1770 err)) {1771goto error_return;1772}1773}17741775 ret =0;1776goto out;17771778error_return:1779unlock_ref(lock);1780*lock_p = NULL;17811782out:1783strbuf_release(&ref_file);1784return ret;1785}17861787/*1788 * Peel the entry (if possible) and return its new peel_status. If1789 * repeel is true, re-peel the entry even if there is an old peeled1790 * value that is already stored in it.1791 *1792 * It is OK to call this function with a packed reference entry that1793 * might be stale and might even refer to an object that has since1794 * been garbage-collected. In such a case, if the entry has1795 * REF_KNOWS_PEELED then leave the status unchanged and return1796 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1797 */1798static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1799{1800enum peel_status status;18011802if(entry->flag & REF_KNOWS_PEELED) {1803if(repeel) {1804 entry->flag &= ~REF_KNOWS_PEELED;1805oidclr(&entry->u.value.peeled);1806}else{1807returnis_null_oid(&entry->u.value.peeled) ?1808 PEEL_NON_TAG : PEEL_PEELED;1809}1810}1811if(entry->flag & REF_ISBROKEN)1812return PEEL_BROKEN;1813if(entry->flag & REF_ISSYMREF)1814return PEEL_IS_SYMREF;18151816 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1817if(status == PEEL_PEELED || status == PEEL_NON_TAG)1818 entry->flag |= REF_KNOWS_PEELED;1819return status;1820}18211822static intfiles_peel_ref(struct ref_store *ref_store,1823const char*refname,unsigned char*sha1)1824{1825struct files_ref_store *refs =1826files_downcast(ref_store, REF_STORE_READ | REF_STORE_ODB,1827"peel_ref");1828int flag;1829unsigned char base[20];18301831files_assert_main_repository(refs,"peel_ref");18321833if(current_ref_iter && current_ref_iter->refname == refname) {1834struct object_id peeled;18351836if(ref_iterator_peel(current_ref_iter, &peeled))1837return-1;1838hashcpy(sha1, peeled.hash);1839return0;1840}18411842if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1843return-1;18441845/*1846 * If the reference is packed, read its ref_entry from the1847 * cache in the hope that we already know its peeled value.1848 * We only try this optimization on packed references because1849 * (a) forcing the filling of the loose reference cache could1850 * be expensive and (b) loose references anyway usually do not1851 * have REF_KNOWS_PEELED.1852 */1853if(flag & REF_ISPACKED) {1854struct ref_entry *r =get_packed_ref(refs, refname);1855if(r) {1856if(peel_entry(r,0))1857return-1;1858hashcpy(sha1, r->u.value.peeled.hash);1859return0;1860}1861}18621863returnpeel_object(base, sha1);1864}18651866struct files_ref_iterator {1867struct ref_iterator base;18681869struct packed_ref_cache *packed_ref_cache;1870struct ref_iterator *iter0;1871unsigned int flags;1872};18731874static intfiles_ref_iterator_advance(struct ref_iterator *ref_iterator)1875{1876struct files_ref_iterator *iter =1877(struct files_ref_iterator *)ref_iterator;1878int ok;18791880while((ok =ref_iterator_advance(iter->iter0)) == ITER_OK) {1881if(iter->flags & DO_FOR_EACH_PER_WORKTREE_ONLY &&1882ref_type(iter->iter0->refname) != REF_TYPE_PER_WORKTREE)1883continue;18841885if(!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&1886!ref_resolves_to_object(iter->iter0->refname,1887 iter->iter0->oid,1888 iter->iter0->flags))1889continue;18901891 iter->base.refname = iter->iter0->refname;1892 iter->base.oid = iter->iter0->oid;1893 iter->base.flags = iter->iter0->flags;1894return ITER_OK;1895}18961897 iter->iter0 = NULL;1898if(ref_iterator_abort(ref_iterator) != ITER_DONE)1899 ok = ITER_ERROR;19001901return ok;1902}19031904static intfiles_ref_iterator_peel(struct ref_iterator *ref_iterator,1905struct object_id *peeled)1906{1907struct files_ref_iterator *iter =1908(struct files_ref_iterator *)ref_iterator;19091910returnref_iterator_peel(iter->iter0, peeled);1911}19121913static intfiles_ref_iterator_abort(struct ref_iterator *ref_iterator)1914{1915struct files_ref_iterator *iter =1916(struct files_ref_iterator *)ref_iterator;1917int ok = ITER_DONE;19181919if(iter->iter0)1920 ok =ref_iterator_abort(iter->iter0);19211922release_packed_ref_cache(iter->packed_ref_cache);1923base_ref_iterator_free(ref_iterator);1924return ok;1925}19261927static struct ref_iterator_vtable files_ref_iterator_vtable = {1928 files_ref_iterator_advance,1929 files_ref_iterator_peel,1930 files_ref_iterator_abort1931};19321933static struct ref_iterator *files_ref_iterator_begin(1934struct ref_store *ref_store,1935const char*prefix,unsigned int flags)1936{1937struct files_ref_store *refs;1938struct ref_dir *loose_dir, *packed_dir;1939struct ref_iterator *loose_iter, *packed_iter;1940struct files_ref_iterator *iter;1941struct ref_iterator *ref_iterator;19421943if(ref_paranoia <0)1944 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1945if(ref_paranoia)1946 flags |= DO_FOR_EACH_INCLUDE_BROKEN;19471948 refs =files_downcast(ref_store,1949 REF_STORE_READ | (ref_paranoia ?0: REF_STORE_ODB),1950"ref_iterator_begin");19511952 iter =xcalloc(1,sizeof(*iter));1953 ref_iterator = &iter->base;1954base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);19551956/*1957 * We must make sure that all loose refs are read before1958 * accessing the packed-refs file; this avoids a race1959 * condition if loose refs are migrated to the packed-refs1960 * file by a simultaneous process, but our in-memory view is1961 * from before the migration. We ensure this as follows:1962 * First, we call prime_ref_dir(), which pre-reads the loose1963 * references for the subtree into the cache. (If they've1964 * already been read, that's OK; we only need to guarantee1965 * that they're read before the packed refs, not *how much*1966 * before.) After that, we call get_packed_ref_cache(), which1967 * internally checks whether the packed-ref cache is up to1968 * date with what is on disk, and re-reads it if not.1969 */19701971 loose_dir =get_loose_refs(refs);19721973if(prefix && *prefix)1974 loose_dir =find_containing_dir(loose_dir, prefix,0);19751976if(loose_dir) {1977prime_ref_dir(loose_dir);1978 loose_iter =cache_ref_iterator_begin(loose_dir);1979}else{1980/* There's nothing to iterate over. */1981 loose_iter =empty_ref_iterator_begin();1982}19831984 iter->packed_ref_cache =get_packed_ref_cache(refs);1985acquire_packed_ref_cache(iter->packed_ref_cache);1986 packed_dir =get_packed_ref_dir(iter->packed_ref_cache);19871988if(prefix && *prefix)1989 packed_dir =find_containing_dir(packed_dir, prefix,0);19901991if(packed_dir) {1992 packed_iter =cache_ref_iterator_begin(packed_dir);1993}else{1994/* There's nothing to iterate over. */1995 packed_iter =empty_ref_iterator_begin();1996}19971998 iter->iter0 =overlay_ref_iterator_begin(loose_iter, packed_iter);1999 iter->flags = flags;20002001return ref_iterator;2002}20032004/*2005 * Verify that the reference locked by lock has the value old_sha1.2006 * Fail if the reference doesn't exist and mustexist is set. Return 02007 * on success. On error, write an error message to err, set errno, and2008 * return a negative value.2009 */2010static intverify_lock(struct ref_lock *lock,2011const unsigned char*old_sha1,int mustexist,2012struct strbuf *err)2013{2014assert(err);20152016if(read_ref_full(lock->ref_name,2017 mustexist ? RESOLVE_REF_READING :0,2018 lock->old_oid.hash, NULL)) {2019if(old_sha1) {2020int save_errno = errno;2021strbuf_addf(err,"can't verify ref '%s'", lock->ref_name);2022 errno = save_errno;2023return-1;2024}else{2025oidclr(&lock->old_oid);2026return0;2027}2028}2029if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {2030strbuf_addf(err,"ref '%s' is at%sbut expected%s",2031 lock->ref_name,2032oid_to_hex(&lock->old_oid),2033sha1_to_hex(old_sha1));2034 errno = EBUSY;2035return-1;2036}2037return0;2038}20392040static intremove_empty_directories(struct strbuf *path)2041{2042/*2043 * we want to create a file but there is a directory there;2044 * if that is an empty directory (or a directory that contains2045 * only empty directories), remove them.2046 */2047returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);2048}20492050static intcreate_reflock(const char*path,void*cb)2051{2052struct lock_file *lk = cb;20532054returnhold_lock_file_for_update(lk, path, LOCK_NO_DEREF) <0? -1:0;2055}20562057/*2058 * Locks a ref returning the lock on success and NULL on failure.2059 * On failure errno is set to something meaningful.2060 */2061static struct ref_lock *lock_ref_sha1_basic(struct files_ref_store *refs,2062const 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 mustexist = (old_sha1 && !is_null_sha1(old_sha1));2073int resolve_flags = RESOLVE_REF_NO_RECURSE;2074int resolved;20752076files_assert_main_repository(refs,"lock_ref_sha1_basic");2077assert(err);20782079 lock =xcalloc(1,sizeof(struct ref_lock));20802081if(mustexist)2082 resolve_flags |= RESOLVE_REF_READING;2083if(flags & REF_DELETING)2084 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;20852086files_ref_path(refs, &ref_file, refname);2087 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2088 lock->old_oid.hash, type);2089if(!resolved && errno == EISDIR) {2090/*2091 * we are trying to lock foo but we used to2092 * have foo/bar which now does not exist;2093 * it is normal for the empty directory 'foo'2094 * to remain.2095 */2096if(remove_empty_directories(&ref_file)) {2097 last_errno = errno;2098if(!verify_refname_available_dir(2099 refname, extras, skip,2100get_loose_refs(refs), 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(2112 refname, extras, skip,2113get_loose_refs(refs), err))2114strbuf_addf(err,"unable to resolve reference '%s':%s",2115 refname,strerror(last_errno));21162117goto error_return;2118}21192120/*2121 * If the ref did not exist and we are creating it, make sure2122 * there is no existing packed ref whose name begins with our2123 * refname, nor a packed ref whose name is a proper prefix of2124 * our refname.2125 */2126if(is_null_oid(&lock->old_oid) &&2127verify_refname_available_dir(refname, extras, skip,2128get_packed_refs(refs),2129 err)) {2130 last_errno = ENOTDIR;2131goto error_return;2132}21332134 lock->lk =xcalloc(1,sizeof(struct lock_file));21352136 lock->ref_name =xstrdup(refname);21372138if(raceproof_create_file(ref_file.buf, create_reflock, lock->lk)) {2139 last_errno = errno;2140unable_to_lock_message(ref_file.buf, errno, err);2141goto error_return;2142}21432144if(verify_lock(lock, old_sha1, mustexist, err)) {2145 last_errno = errno;2146goto error_return;2147}2148goto out;21492150 error_return:2151unlock_ref(lock);2152 lock = NULL;21532154 out:2155strbuf_release(&ref_file);2156 errno = last_errno;2157return lock;2158}21592160/*2161 * Write an entry to the packed-refs file for the specified refname.2162 * If peeled is non-NULL, write it as the entry's peeled value.2163 */2164static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2165unsigned char*peeled)2166{2167fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2168if(peeled)2169fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2170}21712172/*2173 * An each_ref_entry_fn that writes the entry to a packed-refs file.2174 */2175static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2176{2177enum peel_status peel_status =peel_entry(entry,0);21782179if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2180error("internal error:%sis not a valid packed reference!",2181 entry->name);2182write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2183 peel_status == PEEL_PEELED ?2184 entry->u.value.peeled.hash : NULL);2185return0;2186}21872188/*2189 * Lock the packed-refs file for writing. Flags is passed to2190 * hold_lock_file_for_update(). Return 0 on success. On errors, set2191 * errno appropriately and return a nonzero value.2192 */2193static intlock_packed_refs(struct files_ref_store *refs,int flags)2194{2195static int timeout_configured =0;2196static int timeout_value =1000;2197struct packed_ref_cache *packed_ref_cache;21982199files_assert_main_repository(refs,"lock_packed_refs");22002201if(!timeout_configured) {2202git_config_get_int("core.packedrefstimeout", &timeout_value);2203 timeout_configured =1;2204}22052206if(hold_lock_file_for_update_timeout(2207&packlock,files_packed_refs_path(refs),2208 flags, timeout_value) <0)2209return-1;2210/*2211 * Get the current packed-refs while holding the lock. If the2212 * packed-refs file has been modified since we last read it,2213 * this will automatically invalidate the cache and re-read2214 * the packed-refs file.2215 */2216 packed_ref_cache =get_packed_ref_cache(refs);2217 packed_ref_cache->lock = &packlock;2218/* Increment the reference count to prevent it from being freed: */2219acquire_packed_ref_cache(packed_ref_cache);2220return0;2221}22222223/*2224 * Write the current version of the packed refs cache from memory to2225 * disk. The packed-refs file must already be locked for writing (see2226 * lock_packed_refs()). Return zero on success. On errors, set errno2227 * and return a nonzero value2228 */2229static intcommit_packed_refs(struct files_ref_store *refs)2230{2231struct packed_ref_cache *packed_ref_cache =2232get_packed_ref_cache(refs);2233int error =0;2234int save_errno =0;2235FILE*out;22362237files_assert_main_repository(refs,"commit_packed_refs");22382239if(!packed_ref_cache->lock)2240die("internal error: packed-refs not locked");22412242 out =fdopen_lock_file(packed_ref_cache->lock,"w");2243if(!out)2244die_errno("unable to fdopen packed-refs descriptor");22452246fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2247do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),22480, write_packed_entry_fn, out);22492250if(commit_lock_file(packed_ref_cache->lock)) {2251 save_errno = errno;2252 error = -1;2253}2254 packed_ref_cache->lock = NULL;2255release_packed_ref_cache(packed_ref_cache);2256 errno = save_errno;2257return error;2258}22592260/*2261 * Rollback the lockfile for the packed-refs file, and discard the2262 * in-memory packed reference cache. (The packed-refs file will be2263 * read anew if it is needed again after this function is called.)2264 */2265static voidrollback_packed_refs(struct files_ref_store *refs)2266{2267struct packed_ref_cache *packed_ref_cache =2268get_packed_ref_cache(refs);22692270files_assert_main_repository(refs,"rollback_packed_refs");22712272if(!packed_ref_cache->lock)2273die("internal error: packed-refs not locked");2274rollback_lock_file(packed_ref_cache->lock);2275 packed_ref_cache->lock = NULL;2276release_packed_ref_cache(packed_ref_cache);2277clear_packed_ref_cache(refs);2278}22792280struct ref_to_prune {2281struct ref_to_prune *next;2282unsigned char sha1[20];2283char name[FLEX_ARRAY];2284};22852286struct pack_refs_cb_data {2287unsigned int flags;2288struct ref_dir *packed_refs;2289struct ref_to_prune *ref_to_prune;2290};22912292/*2293 * An each_ref_entry_fn that is run over loose references only. If2294 * the loose reference can be packed, add an entry in the packed ref2295 * cache. If the reference should be pruned, also add it to2296 * ref_to_prune in the pack_refs_cb_data.2297 */2298static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2299{2300struct pack_refs_cb_data *cb = cb_data;2301enum peel_status peel_status;2302struct ref_entry *packed_entry;2303int is_tag_ref =starts_with(entry->name,"refs/tags/");23042305/* Do not pack per-worktree refs: */2306if(ref_type(entry->name) != REF_TYPE_NORMAL)2307return0;23082309/* ALWAYS pack tags */2310if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2311return0;23122313/* Do not pack symbolic or broken refs: */2314if((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))2315return0;23162317/* Add a packed ref cache entry equivalent to the loose entry. */2318 peel_status =peel_entry(entry,1);2319if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2320die("internal error peeling reference%s(%s)",2321 entry->name,oid_to_hex(&entry->u.value.oid));2322 packed_entry =find_ref(cb->packed_refs, entry->name);2323if(packed_entry) {2324/* Overwrite existing packed entry with info from loose entry */2325 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2326oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2327}else{2328 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2329 REF_ISPACKED | REF_KNOWS_PEELED,0);2330add_ref(cb->packed_refs, packed_entry);2331}2332oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);23332334/* Schedule the loose reference for pruning if requested. */2335if((cb->flags & PACK_REFS_PRUNE)) {2336struct ref_to_prune *n;2337FLEX_ALLOC_STR(n, name, entry->name);2338hashcpy(n->sha1, entry->u.value.oid.hash);2339 n->next = cb->ref_to_prune;2340 cb->ref_to_prune = n;2341}2342return0;2343}23442345enum{2346 REMOVE_EMPTY_PARENTS_REF =0x01,2347 REMOVE_EMPTY_PARENTS_REFLOG =0x022348};23492350/*2351 * Remove empty parent directories associated with the specified2352 * reference and/or its reflog, but spare [logs/]refs/ and immediate2353 * subdirs. flags is a combination of REMOVE_EMPTY_PARENTS_REF and/or2354 * REMOVE_EMPTY_PARENTS_REFLOG.2355 */2356static voidtry_remove_empty_parents(struct files_ref_store *refs,2357const char*refname,2358unsigned int flags)2359{2360struct strbuf buf = STRBUF_INIT;2361struct strbuf sb = STRBUF_INIT;2362char*p, *q;2363int i;23642365strbuf_addstr(&buf, refname);2366 p = buf.buf;2367for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2368while(*p && *p !='/')2369 p++;2370/* tolerate duplicate slashes; see check_refname_format() */2371while(*p =='/')2372 p++;2373}2374 q = buf.buf + buf.len;2375while(flags & (REMOVE_EMPTY_PARENTS_REF | REMOVE_EMPTY_PARENTS_REFLOG)) {2376while(q > p && *q !='/')2377 q--;2378while(q > p && *(q-1) =='/')2379 q--;2380if(q == p)2381break;2382strbuf_setlen(&buf, q - buf.buf);23832384strbuf_reset(&sb);2385files_ref_path(refs, &sb, buf.buf);2386if((flags & REMOVE_EMPTY_PARENTS_REF) &&rmdir(sb.buf))2387 flags &= ~REMOVE_EMPTY_PARENTS_REF;23882389strbuf_reset(&sb);2390files_reflog_path(refs, &sb, buf.buf);2391if((flags & REMOVE_EMPTY_PARENTS_REFLOG) &&rmdir(sb.buf))2392 flags &= ~REMOVE_EMPTY_PARENTS_REFLOG;2393}2394strbuf_release(&buf);2395strbuf_release(&sb);2396}23972398/* make sure nobody touched the ref, and unlink */2399static voidprune_ref(struct ref_to_prune *r)2400{2401struct ref_transaction *transaction;2402struct strbuf err = STRBUF_INIT;24032404if(check_refname_format(r->name,0))2405return;24062407 transaction =ref_transaction_begin(&err);2408if(!transaction ||2409ref_transaction_delete(transaction, r->name, r->sha1,2410 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2411ref_transaction_commit(transaction, &err)) {2412ref_transaction_free(transaction);2413error("%s", err.buf);2414strbuf_release(&err);2415return;2416}2417ref_transaction_free(transaction);2418strbuf_release(&err);2419}24202421static voidprune_refs(struct ref_to_prune *r)2422{2423while(r) {2424prune_ref(r);2425 r = r->next;2426}2427}24282429static intfiles_pack_refs(struct ref_store *ref_store,unsigned int flags)2430{2431struct files_ref_store *refs =2432files_downcast(ref_store, REF_STORE_WRITE | REF_STORE_ODB,2433"pack_refs");2434struct pack_refs_cb_data cbdata;24352436memset(&cbdata,0,sizeof(cbdata));2437 cbdata.flags = flags;24382439lock_packed_refs(refs, LOCK_DIE_ON_ERROR);2440 cbdata.packed_refs =get_packed_refs(refs);24412442do_for_each_entry_in_dir(get_loose_refs(refs),0,2443 pack_if_possible_fn, &cbdata);24442445if(commit_packed_refs(refs))2446die_errno("unable to overwrite old ref-pack file");24472448prune_refs(cbdata.ref_to_prune);2449return0;2450}24512452/*2453 * Rewrite the packed-refs file, omitting any refs listed in2454 * 'refnames'. On error, leave packed-refs unchanged, write an error2455 * message to 'err', and return a nonzero value.2456 *2457 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2458 */2459static intrepack_without_refs(struct files_ref_store *refs,2460struct string_list *refnames,struct strbuf *err)2461{2462struct ref_dir *packed;2463struct string_list_item *refname;2464int ret, needs_repacking =0, removed =0;24652466files_assert_main_repository(refs,"repack_without_refs");2467assert(err);24682469/* Look for a packed ref */2470for_each_string_list_item(refname, refnames) {2471if(get_packed_ref(refs, refname->string)) {2472 needs_repacking =1;2473break;2474}2475}24762477/* Avoid locking if we have nothing to do */2478if(!needs_repacking)2479return0;/* no refname exists in packed refs */24802481if(lock_packed_refs(refs,0)) {2482unable_to_lock_message(files_packed_refs_path(refs), errno, err);2483return-1;2484}2485 packed =get_packed_refs(refs);24862487/* Remove refnames from the cache */2488for_each_string_list_item(refname, refnames)2489if(remove_entry(packed, refname->string) != -1)2490 removed =1;2491if(!removed) {2492/*2493 * All packed entries disappeared while we were2494 * acquiring the lock.2495 */2496rollback_packed_refs(refs);2497return0;2498}24992500/* Write what remains */2501 ret =commit_packed_refs(refs);2502if(ret)2503strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2504strerror(errno));2505return ret;2506}25072508static intfiles_delete_refs(struct ref_store *ref_store,2509struct string_list *refnames,unsigned int flags)2510{2511struct files_ref_store *refs =2512files_downcast(ref_store, REF_STORE_WRITE,"delete_refs");2513struct strbuf err = STRBUF_INIT;2514int i, result =0;25152516if(!refnames->nr)2517return0;25182519 result =repack_without_refs(refs, refnames, &err);2520if(result) {2521/*2522 * If we failed to rewrite the packed-refs file, then2523 * it is unsafe to try to remove loose refs, because2524 * doing so might expose an obsolete packed value for2525 * a reference that might even point at an object that2526 * has been garbage collected.2527 */2528if(refnames->nr ==1)2529error(_("could not delete reference%s:%s"),2530 refnames->items[0].string, err.buf);2531else2532error(_("could not delete references:%s"), err.buf);25332534goto out;2535}25362537for(i =0; i < refnames->nr; i++) {2538const char*refname = refnames->items[i].string;25392540if(delete_ref(NULL, refname, NULL, flags))2541 result |=error(_("could not remove reference%s"), refname);2542}25432544out:2545strbuf_release(&err);2546return result;2547}25482549/*2550 * People using contrib's git-new-workdir have .git/logs/refs ->2551 * /some/other/path/.git/logs/refs, and that may live on another device.2552 *2553 * IOW, to avoid cross device rename errors, the temporary renamed log must2554 * live into logs/refs.2555 */2556#define TMP_RENAMED_LOG"refs/.tmp-renamed-log"25572558struct rename_cb {2559const char*tmp_renamed_log;2560int true_errno;2561};25622563static intrename_tmp_log_callback(const char*path,void*cb_data)2564{2565struct rename_cb *cb = cb_data;25662567if(rename(cb->tmp_renamed_log, path)) {2568/*2569 * rename(a, b) when b is an existing directory ought2570 * to result in ISDIR, but Solaris 5.8 gives ENOTDIR.2571 * Sheesh. Record the true errno for error reporting,2572 * but report EISDIR to raceproof_create_file() so2573 * that it knows to retry.2574 */2575 cb->true_errno = errno;2576if(errno == ENOTDIR)2577 errno = EISDIR;2578return-1;2579}else{2580return0;2581}2582}25832584static intrename_tmp_log(struct files_ref_store *refs,const char*newrefname)2585{2586struct strbuf path = STRBUF_INIT;2587struct strbuf tmp = STRBUF_INIT;2588struct rename_cb cb;2589int ret;25902591files_reflog_path(refs, &path, newrefname);2592files_reflog_path(refs, &tmp, TMP_RENAMED_LOG);2593 cb.tmp_renamed_log = tmp.buf;2594 ret =raceproof_create_file(path.buf, rename_tmp_log_callback, &cb);2595if(ret) {2596if(errno == EISDIR)2597error("directory not empty:%s", path.buf);2598else2599error("unable to move logfile%sto%s:%s",2600 tmp.buf, path.buf,2601strerror(cb.true_errno));2602}26032604strbuf_release(&path);2605strbuf_release(&tmp);2606return ret;2607}26082609static intfiles_verify_refname_available(struct ref_store *ref_store,2610const char*newname,2611const struct string_list *extras,2612const struct string_list *skip,2613struct strbuf *err)2614{2615struct files_ref_store *refs =2616files_downcast(ref_store, REF_STORE_READ,"verify_refname_available");2617struct ref_dir *packed_refs =get_packed_refs(refs);2618struct ref_dir *loose_refs =get_loose_refs(refs);26192620if(verify_refname_available_dir(newname, extras, skip,2621 packed_refs, err) ||2622verify_refname_available_dir(newname, extras, skip,2623 loose_refs, err))2624return-1;26252626return0;2627}26282629static intwrite_ref_to_lockfile(struct ref_lock *lock,2630const unsigned char*sha1,struct strbuf *err);2631static intcommit_ref_update(struct files_ref_store *refs,2632struct ref_lock *lock,2633const unsigned char*sha1,const char*logmsg,2634struct strbuf *err);26352636static intfiles_rename_ref(struct ref_store *ref_store,2637const char*oldrefname,const char*newrefname,2638const char*logmsg)2639{2640struct files_ref_store *refs =2641files_downcast(ref_store, REF_STORE_WRITE,"rename_ref");2642unsigned char sha1[20], orig_sha1[20];2643int flag =0, logmoved =0;2644struct ref_lock *lock;2645struct stat loginfo;2646struct strbuf sb_oldref = STRBUF_INIT;2647struct strbuf sb_newref = STRBUF_INIT;2648struct strbuf tmp_renamed_log = STRBUF_INIT;2649int log, ret;2650struct strbuf err = STRBUF_INIT;26512652files_reflog_path(refs, &sb_oldref, oldrefname);2653files_reflog_path(refs, &sb_newref, newrefname);2654files_reflog_path(refs, &tmp_renamed_log, TMP_RENAMED_LOG);26552656 log = !lstat(sb_oldref.buf, &loginfo);2657if(log &&S_ISLNK(loginfo.st_mode)) {2658 ret =error("reflog for%sis a symlink", oldrefname);2659goto out;2660}26612662if(!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2663 orig_sha1, &flag)) {2664 ret =error("refname%snot found", oldrefname);2665goto out;2666}26672668if(flag & REF_ISSYMREF) {2669 ret =error("refname%sis a symbolic ref, renaming it is not supported",2670 oldrefname);2671goto out;2672}2673if(!rename_ref_available(oldrefname, newrefname)) {2674 ret =1;2675goto out;2676}26772678if(log &&rename(sb_oldref.buf, tmp_renamed_log.buf)) {2679 ret =error("unable to move logfile logs/%sto logs/"TMP_RENAMED_LOG":%s",2680 oldrefname,strerror(errno));2681goto out;2682}26832684if(delete_ref(logmsg, oldrefname, orig_sha1, REF_NODEREF)) {2685error("unable to delete old%s", oldrefname);2686goto rollback;2687}26882689/*2690 * Since we are doing a shallow lookup, sha1 is not the2691 * correct value to pass to delete_ref as old_sha1. But that2692 * doesn't matter, because an old_sha1 check wouldn't add to2693 * the safety anyway; we want to delete the reference whatever2694 * its current value.2695 */2696if(!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2697 sha1, NULL) &&2698delete_ref(NULL, newrefname, NULL, REF_NODEREF)) {2699if(errno == EISDIR) {2700struct strbuf path = STRBUF_INIT;2701int result;27022703files_ref_path(refs, &path, newrefname);2704 result =remove_empty_directories(&path);2705strbuf_release(&path);27062707if(result) {2708error("Directory not empty:%s", newrefname);2709goto rollback;2710}2711}else{2712error("unable to delete existing%s", newrefname);2713goto rollback;2714}2715}27162717if(log &&rename_tmp_log(refs, newrefname))2718goto rollback;27192720 logmoved = log;27212722 lock =lock_ref_sha1_basic(refs, newrefname, NULL, NULL, NULL,2723 REF_NODEREF, NULL, &err);2724if(!lock) {2725error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2726strbuf_release(&err);2727goto rollback;2728}2729hashcpy(lock->old_oid.hash, orig_sha1);27302731if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2732commit_ref_update(refs, lock, orig_sha1, logmsg, &err)) {2733error("unable to write current sha1 into%s:%s", newrefname, err.buf);2734strbuf_release(&err);2735goto rollback;2736}27372738 ret =0;2739goto out;27402741 rollback:2742 lock =lock_ref_sha1_basic(refs, oldrefname, NULL, NULL, NULL,2743 REF_NODEREF, NULL, &err);2744if(!lock) {2745error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2746strbuf_release(&err);2747goto rollbacklog;2748}27492750 flag = log_all_ref_updates;2751 log_all_ref_updates = LOG_REFS_NONE;2752if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2753commit_ref_update(refs, lock, orig_sha1, NULL, &err)) {2754error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2755strbuf_release(&err);2756}2757 log_all_ref_updates = flag;27582759 rollbacklog:2760if(logmoved &&rename(sb_newref.buf, sb_oldref.buf))2761error("unable to restore logfile%sfrom%s:%s",2762 oldrefname, newrefname,strerror(errno));2763if(!logmoved && log &&2764rename(tmp_renamed_log.buf, sb_oldref.buf))2765error("unable to restore logfile%sfrom logs/"TMP_RENAMED_LOG":%s",2766 oldrefname,strerror(errno));2767 ret =1;2768 out:2769strbuf_release(&sb_newref);2770strbuf_release(&sb_oldref);2771strbuf_release(&tmp_renamed_log);27722773return ret;2774}27752776static intclose_ref(struct ref_lock *lock)2777{2778if(close_lock_file(lock->lk))2779return-1;2780return0;2781}27822783static intcommit_ref(struct ref_lock *lock)2784{2785char*path =get_locked_file_path(lock->lk);2786struct stat st;27872788if(!lstat(path, &st) &&S_ISDIR(st.st_mode)) {2789/*2790 * There is a directory at the path we want to rename2791 * the lockfile to. Hopefully it is empty; try to2792 * delete it.2793 */2794size_t len =strlen(path);2795struct strbuf sb_path = STRBUF_INIT;27962797strbuf_attach(&sb_path, path, len, len);27982799/*2800 * If this fails, commit_lock_file() will also fail2801 * and will report the problem.2802 */2803remove_empty_directories(&sb_path);2804strbuf_release(&sb_path);2805}else{2806free(path);2807}28082809if(commit_lock_file(lock->lk))2810return-1;2811return0;2812}28132814static intopen_or_create_logfile(const char*path,void*cb)2815{2816int*fd = cb;28172818*fd =open(path, O_APPEND | O_WRONLY | O_CREAT,0666);2819return(*fd <0) ? -1:0;2820}28212822/*2823 * Create a reflog for a ref. If force_create = 0, only create the2824 * reflog for certain refs (those for which should_autocreate_reflog2825 * returns non-zero). Otherwise, create it regardless of the reference2826 * name. If the logfile already existed or was created, return 0 and2827 * set *logfd to the file descriptor opened for appending to the file.2828 * If no logfile exists and we decided not to create one, return 0 and2829 * set *logfd to -1. On failure, fill in *err, set *logfd to -1, and2830 * return -1.2831 */2832static intlog_ref_setup(struct files_ref_store *refs,2833const char*refname,int force_create,2834int*logfd,struct strbuf *err)2835{2836struct strbuf logfile_sb = STRBUF_INIT;2837char*logfile;28382839files_reflog_path(refs, &logfile_sb, refname);2840 logfile =strbuf_detach(&logfile_sb, NULL);28412842if(force_create ||should_autocreate_reflog(refname)) {2843if(raceproof_create_file(logfile, open_or_create_logfile, logfd)) {2844if(errno == ENOENT)2845strbuf_addf(err,"unable to create directory for '%s': "2846"%s", logfile,strerror(errno));2847else if(errno == EISDIR)2848strbuf_addf(err,"there are still logs under '%s'",2849 logfile);2850else2851strbuf_addf(err,"unable to append to '%s':%s",2852 logfile,strerror(errno));28532854goto error;2855}2856}else{2857*logfd =open(logfile, O_APPEND | O_WRONLY,0666);2858if(*logfd <0) {2859if(errno == ENOENT || errno == EISDIR) {2860/*2861 * The logfile doesn't already exist,2862 * but that is not an error; it only2863 * means that we won't write log2864 * entries to it.2865 */2866;2867}else{2868strbuf_addf(err,"unable to append to '%s':%s",2869 logfile,strerror(errno));2870goto error;2871}2872}2873}28742875if(*logfd >=0)2876adjust_shared_perm(logfile);28772878free(logfile);2879return0;28802881error:2882free(logfile);2883return-1;2884}28852886static intfiles_create_reflog(struct ref_store *ref_store,2887const char*refname,int force_create,2888struct strbuf *err)2889{2890struct files_ref_store *refs =2891files_downcast(ref_store, REF_STORE_WRITE,"create_reflog");2892int fd;28932894if(log_ref_setup(refs, refname, force_create, &fd, err))2895return-1;28962897if(fd >=0)2898close(fd);28992900return0;2901}29022903static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2904const unsigned char*new_sha1,2905const char*committer,const char*msg)2906{2907int msglen, written;2908unsigned maxlen, len;2909char*logrec;29102911 msglen = msg ?strlen(msg) :0;2912 maxlen =strlen(committer) + msglen +100;2913 logrec =xmalloc(maxlen);2914 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2915sha1_to_hex(old_sha1),2916sha1_to_hex(new_sha1),2917 committer);2918if(msglen)2919 len +=copy_reflog_msg(logrec + len -1, msg) -1;29202921 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2922free(logrec);2923if(written != len)2924return-1;29252926return0;2927}29282929static intfiles_log_ref_write(struct files_ref_store *refs,2930const char*refname,const unsigned char*old_sha1,2931const unsigned char*new_sha1,const char*msg,2932int flags,struct strbuf *err)2933{2934int logfd, result;29352936if(log_all_ref_updates == LOG_REFS_UNSET)2937 log_all_ref_updates =is_bare_repository() ? LOG_REFS_NONE : LOG_REFS_NORMAL;29382939 result =log_ref_setup(refs, refname,2940 flags & REF_FORCE_CREATE_REFLOG,2941&logfd, err);29422943if(result)2944return result;29452946if(logfd <0)2947return0;2948 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2949git_committer_info(0), msg);2950if(result) {2951struct strbuf sb = STRBUF_INIT;2952int save_errno = errno;29532954files_reflog_path(refs, &sb, refname);2955strbuf_addf(err,"unable to append to '%s':%s",2956 sb.buf,strerror(save_errno));2957strbuf_release(&sb);2958close(logfd);2959return-1;2960}2961if(close(logfd)) {2962struct strbuf sb = STRBUF_INIT;2963int save_errno = errno;29642965files_reflog_path(refs, &sb, refname);2966strbuf_addf(err,"unable to append to '%s':%s",2967 sb.buf,strerror(save_errno));2968strbuf_release(&sb);2969return-1;2970}2971return0;2972}29732974/*2975 * Write sha1 into the open lockfile, then close the lockfile. On2976 * errors, rollback the lockfile, fill in *err and2977 * return -1.2978 */2979static intwrite_ref_to_lockfile(struct ref_lock *lock,2980const unsigned char*sha1,struct strbuf *err)2981{2982static char term ='\n';2983struct object *o;2984int fd;29852986 o =parse_object(sha1);2987if(!o) {2988strbuf_addf(err,2989"trying to write ref '%s' with nonexistent object%s",2990 lock->ref_name,sha1_to_hex(sha1));2991unlock_ref(lock);2992return-1;2993}2994if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2995strbuf_addf(err,2996"trying to write non-commit object%sto branch '%s'",2997sha1_to_hex(sha1), lock->ref_name);2998unlock_ref(lock);2999return-1;3000}3001 fd =get_lock_file_fd(lock->lk);3002if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||3003write_in_full(fd, &term,1) !=1||3004close_ref(lock) <0) {3005strbuf_addf(err,3006"couldn't write '%s'",get_lock_file_path(lock->lk));3007unlock_ref(lock);3008return-1;3009}3010return0;3011}30123013/*3014 * Commit a change to a loose reference that has already been written3015 * to the loose reference lockfile. Also update the reflogs if3016 * necessary, using the specified lockmsg (which can be NULL).3017 */3018static intcommit_ref_update(struct files_ref_store *refs,3019struct ref_lock *lock,3020const unsigned char*sha1,const char*logmsg,3021struct strbuf *err)3022{3023files_assert_main_repository(refs,"commit_ref_update");30243025clear_loose_ref_cache(refs);3026if(files_log_ref_write(refs, lock->ref_name,3027 lock->old_oid.hash, sha1,3028 logmsg,0, err)) {3029char*old_msg =strbuf_detach(err, NULL);3030strbuf_addf(err,"cannot update the ref '%s':%s",3031 lock->ref_name, old_msg);3032free(old_msg);3033unlock_ref(lock);3034return-1;3035}30363037if(strcmp(lock->ref_name,"HEAD") !=0) {3038/*3039 * Special hack: If a branch is updated directly and HEAD3040 * points to it (may happen on the remote side of a push3041 * for example) then logically the HEAD reflog should be3042 * updated too.3043 * A generic solution implies reverse symref information,3044 * but finding all symrefs pointing to the given branch3045 * would be rather costly for this rare event (the direct3046 * update of a branch) to be worth it. So let's cheat and3047 * check with HEAD only which should cover 99% of all usage3048 * scenarios (even 100% of the default ones).3049 */3050unsigned char head_sha1[20];3051int head_flag;3052const char*head_ref;30533054 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3055 head_sha1, &head_flag);3056if(head_ref && (head_flag & REF_ISSYMREF) &&3057!strcmp(head_ref, lock->ref_name)) {3058struct strbuf log_err = STRBUF_INIT;3059if(files_log_ref_write(refs,"HEAD",3060 lock->old_oid.hash, sha1,3061 logmsg,0, &log_err)) {3062error("%s", log_err.buf);3063strbuf_release(&log_err);3064}3065}3066}30673068if(commit_ref(lock)) {3069strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3070unlock_ref(lock);3071return-1;3072}30733074unlock_ref(lock);3075return0;3076}30773078static intcreate_ref_symlink(struct ref_lock *lock,const char*target)3079{3080int ret = -1;3081#ifndef NO_SYMLINK_HEAD3082char*ref_path =get_locked_file_path(lock->lk);3083unlink(ref_path);3084 ret =symlink(target, ref_path);3085free(ref_path);30863087if(ret)3088fprintf(stderr,"no symlink - falling back to symbolic ref\n");3089#endif3090return ret;3091}30923093static voidupdate_symref_reflog(struct files_ref_store *refs,3094struct ref_lock *lock,const char*refname,3095const char*target,const char*logmsg)3096{3097struct strbuf err = STRBUF_INIT;3098unsigned char new_sha1[20];3099if(logmsg && !read_ref(target, new_sha1) &&3100files_log_ref_write(refs, refname, lock->old_oid.hash,3101 new_sha1, logmsg,0, &err)) {3102error("%s", err.buf);3103strbuf_release(&err);3104}3105}31063107static intcreate_symref_locked(struct files_ref_store *refs,3108struct ref_lock *lock,const char*refname,3109const char*target,const char*logmsg)3110{3111if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {3112update_symref_reflog(refs, lock, refname, target, logmsg);3113return0;3114}31153116if(!fdopen_lock_file(lock->lk,"w"))3117returnerror("unable to fdopen%s:%s",3118 lock->lk->tempfile.filename.buf,strerror(errno));31193120update_symref_reflog(refs, lock, refname, target, logmsg);31213122/* no error check; commit_ref will check ferror */3123fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);3124if(commit_ref(lock) <0)3125returnerror("unable to write symref for%s:%s", refname,3126strerror(errno));3127return0;3128}31293130static intfiles_create_symref(struct ref_store *ref_store,3131const char*refname,const char*target,3132const char*logmsg)3133{3134struct files_ref_store *refs =3135files_downcast(ref_store, REF_STORE_WRITE,"create_symref");3136struct strbuf err = STRBUF_INIT;3137struct ref_lock *lock;3138int ret;31393140 lock =lock_ref_sha1_basic(refs, refname, NULL,3141 NULL, NULL, REF_NODEREF, NULL,3142&err);3143if(!lock) {3144error("%s", err.buf);3145strbuf_release(&err);3146return-1;3147}31483149 ret =create_symref_locked(refs, lock, refname, target, logmsg);3150unlock_ref(lock);3151return ret;3152}31533154intset_worktree_head_symref(const char*gitdir,const char*target,const char*logmsg)3155{3156/*3157 * FIXME: this obviously will not work well for future refs3158 * backends. This function needs to die.3159 */3160struct files_ref_store *refs =3161files_downcast(get_main_ref_store(),3162 REF_STORE_WRITE,3163"set_head_symref");31643165static struct lock_file head_lock;3166struct ref_lock *lock;3167struct strbuf head_path = STRBUF_INIT;3168const char*head_rel;3169int ret;31703171strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));3172if(hold_lock_file_for_update(&head_lock, head_path.buf,3173 LOCK_NO_DEREF) <0) {3174struct strbuf err = STRBUF_INIT;3175unable_to_lock_message(head_path.buf, errno, &err);3176error("%s", err.buf);3177strbuf_release(&err);3178strbuf_release(&head_path);3179return-1;3180}31813182/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3183 linked trees */3184 head_rel =remove_leading_path(head_path.buf,3185absolute_path(get_git_common_dir()));3186/* to make use of create_symref_locked(), initialize ref_lock */3187 lock =xcalloc(1,sizeof(struct ref_lock));3188 lock->lk = &head_lock;3189 lock->ref_name =xstrdup(head_rel);31903191 ret =create_symref_locked(refs, lock, head_rel, target, logmsg);31923193unlock_ref(lock);/* will free lock */3194strbuf_release(&head_path);3195return ret;3196}31973198static intfiles_reflog_exists(struct ref_store *ref_store,3199const char*refname)3200{3201struct files_ref_store *refs =3202files_downcast(ref_store, REF_STORE_READ,"reflog_exists");3203struct strbuf sb = STRBUF_INIT;3204struct stat st;3205int ret;32063207files_reflog_path(refs, &sb, refname);3208 ret = !lstat(sb.buf, &st) &&S_ISREG(st.st_mode);3209strbuf_release(&sb);3210return ret;3211}32123213static intfiles_delete_reflog(struct ref_store *ref_store,3214const char*refname)3215{3216struct files_ref_store *refs =3217files_downcast(ref_store, REF_STORE_WRITE,"delete_reflog");3218struct strbuf sb = STRBUF_INIT;3219int ret;32203221files_reflog_path(refs, &sb, refname);3222 ret =remove_path(sb.buf);3223strbuf_release(&sb);3224return ret;3225}32263227static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3228{3229struct object_id ooid, noid;3230char*email_end, *message;3231unsigned long timestamp;3232int tz;3233const char*p = sb->buf;32343235/* old SP new SP name <email> SP time TAB msg LF */3236if(!sb->len || sb->buf[sb->len -1] !='\n'||3237parse_oid_hex(p, &ooid, &p) || *p++ !=' '||3238parse_oid_hex(p, &noid, &p) || *p++ !=' '||3239!(email_end =strchr(p,'>')) ||3240 email_end[1] !=' '||3241!(timestamp =strtoul(email_end +2, &message,10)) ||3242!message || message[0] !=' '||3243(message[1] !='+'&& message[1] !='-') ||3244!isdigit(message[2]) || !isdigit(message[3]) ||3245!isdigit(message[4]) || !isdigit(message[5]))3246return0;/* corrupt? */3247 email_end[1] ='\0';3248 tz =strtol(message +1, NULL,10);3249if(message[6] !='\t')3250 message +=6;3251else3252 message +=7;3253returnfn(&ooid, &noid, p, timestamp, tz, message, cb_data);3254}32553256static char*find_beginning_of_line(char*bob,char*scan)3257{3258while(bob < scan && *(--scan) !='\n')3259;/* keep scanning backwards */3260/*3261 * Return either beginning of the buffer, or LF at the end of3262 * the previous line.3263 */3264return scan;3265}32663267static intfiles_for_each_reflog_ent_reverse(struct ref_store *ref_store,3268const char*refname,3269 each_reflog_ent_fn fn,3270void*cb_data)3271{3272struct files_ref_store *refs =3273files_downcast(ref_store, REF_STORE_READ,3274"for_each_reflog_ent_reverse");3275struct strbuf sb = STRBUF_INIT;3276FILE*logfp;3277long pos;3278int ret =0, at_tail =1;32793280files_reflog_path(refs, &sb, refname);3281 logfp =fopen(sb.buf,"r");3282strbuf_release(&sb);3283if(!logfp)3284return-1;32853286/* Jump to the end */3287if(fseek(logfp,0, SEEK_END) <0)3288returnerror("cannot seek back reflog for%s:%s",3289 refname,strerror(errno));3290 pos =ftell(logfp);3291while(!ret &&0< pos) {3292int cnt;3293size_t nread;3294char buf[BUFSIZ];3295char*endp, *scanp;32963297/* Fill next block from the end */3298 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3299if(fseek(logfp, pos - cnt, SEEK_SET))3300returnerror("cannot seek back reflog for%s:%s",3301 refname,strerror(errno));3302 nread =fread(buf, cnt,1, logfp);3303if(nread !=1)3304returnerror("cannot read%dbytes from reflog for%s:%s",3305 cnt, refname,strerror(errno));3306 pos -= cnt;33073308 scanp = endp = buf + cnt;3309if(at_tail && scanp[-1] =='\n')3310/* Looking at the final LF at the end of the file */3311 scanp--;3312 at_tail =0;33133314while(buf < scanp) {3315/*3316 * terminating LF of the previous line, or the beginning3317 * of the buffer.3318 */3319char*bp;33203321 bp =find_beginning_of_line(buf, scanp);33223323if(*bp =='\n') {3324/*3325 * The newline is the end of the previous line,3326 * so we know we have complete line starting3327 * at (bp + 1). Prefix it onto any prior data3328 * we collected for the line and process it.3329 */3330strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3331 scanp = bp;3332 endp = bp +1;3333 ret =show_one_reflog_ent(&sb, fn, cb_data);3334strbuf_reset(&sb);3335if(ret)3336break;3337}else if(!pos) {3338/*3339 * We are at the start of the buffer, and the3340 * start of the file; there is no previous3341 * line, and we have everything for this one.3342 * Process it, and we can end the loop.3343 */3344strbuf_splice(&sb,0,0, buf, endp - buf);3345 ret =show_one_reflog_ent(&sb, fn, cb_data);3346strbuf_reset(&sb);3347break;3348}33493350if(bp == buf) {3351/*3352 * We are at the start of the buffer, and there3353 * is more file to read backwards. Which means3354 * we are in the middle of a line. Note that we3355 * may get here even if *bp was a newline; that3356 * just means we are at the exact end of the3357 * previous line, rather than some spot in the3358 * middle.3359 *3360 * Save away what we have to be combined with3361 * the data from the next read.3362 */3363strbuf_splice(&sb,0,0, buf, endp - buf);3364break;3365}3366}33673368}3369if(!ret && sb.len)3370die("BUG: reverse reflog parser had leftover data");33713372fclose(logfp);3373strbuf_release(&sb);3374return ret;3375}33763377static intfiles_for_each_reflog_ent(struct ref_store *ref_store,3378const char*refname,3379 each_reflog_ent_fn fn,void*cb_data)3380{3381struct files_ref_store *refs =3382files_downcast(ref_store, REF_STORE_READ,3383"for_each_reflog_ent");3384FILE*logfp;3385struct strbuf sb = STRBUF_INIT;3386int ret =0;33873388files_reflog_path(refs, &sb, refname);3389 logfp =fopen(sb.buf,"r");3390strbuf_release(&sb);3391if(!logfp)3392return-1;33933394while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3395 ret =show_one_reflog_ent(&sb, fn, cb_data);3396fclose(logfp);3397strbuf_release(&sb);3398return ret;3399}34003401struct files_reflog_iterator {3402struct ref_iterator base;34033404struct dir_iterator *dir_iterator;3405struct object_id oid;3406};34073408static intfiles_reflog_iterator_advance(struct ref_iterator *ref_iterator)3409{3410struct files_reflog_iterator *iter =3411(struct files_reflog_iterator *)ref_iterator;3412struct dir_iterator *diter = iter->dir_iterator;3413int ok;34143415while((ok =dir_iterator_advance(diter)) == ITER_OK) {3416int flags;34173418if(!S_ISREG(diter->st.st_mode))3419continue;3420if(diter->basename[0] =='.')3421continue;3422if(ends_with(diter->basename,".lock"))3423continue;34243425if(read_ref_full(diter->relative_path,0,3426 iter->oid.hash, &flags)) {3427error("bad ref for%s", diter->path.buf);3428continue;3429}34303431 iter->base.refname = diter->relative_path;3432 iter->base.oid = &iter->oid;3433 iter->base.flags = flags;3434return ITER_OK;3435}34363437 iter->dir_iterator = NULL;3438if(ref_iterator_abort(ref_iterator) == ITER_ERROR)3439 ok = ITER_ERROR;3440return ok;3441}34423443static intfiles_reflog_iterator_peel(struct ref_iterator *ref_iterator,3444struct object_id *peeled)3445{3446die("BUG: ref_iterator_peel() called for reflog_iterator");3447}34483449static intfiles_reflog_iterator_abort(struct ref_iterator *ref_iterator)3450{3451struct files_reflog_iterator *iter =3452(struct files_reflog_iterator *)ref_iterator;3453int ok = ITER_DONE;34543455if(iter->dir_iterator)3456 ok =dir_iterator_abort(iter->dir_iterator);34573458base_ref_iterator_free(ref_iterator);3459return ok;3460}34613462static struct ref_iterator_vtable files_reflog_iterator_vtable = {3463 files_reflog_iterator_advance,3464 files_reflog_iterator_peel,3465 files_reflog_iterator_abort3466};34673468static struct ref_iterator *files_reflog_iterator_begin(struct ref_store *ref_store)3469{3470struct files_ref_store *refs =3471files_downcast(ref_store, REF_STORE_READ,3472"reflog_iterator_begin");3473struct files_reflog_iterator *iter =xcalloc(1,sizeof(*iter));3474struct ref_iterator *ref_iterator = &iter->base;3475struct strbuf sb = STRBUF_INIT;34763477base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);3478files_reflog_path(refs, &sb, NULL);3479 iter->dir_iterator =dir_iterator_begin(sb.buf);3480strbuf_release(&sb);3481return ref_iterator;3482}34833484static intref_update_reject_duplicates(struct string_list *refnames,3485struct strbuf *err)3486{3487int i, n = refnames->nr;34883489assert(err);34903491for(i =1; i < n; i++)3492if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3493strbuf_addf(err,3494"multiple updates for ref '%s' not allowed.",3495 refnames->items[i].string);3496return1;3497}3498return0;3499}35003501/*3502 * If update is a direct update of head_ref (the reference pointed to3503 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3504 */3505static intsplit_head_update(struct ref_update *update,3506struct ref_transaction *transaction,3507const char*head_ref,3508struct string_list *affected_refnames,3509struct strbuf *err)3510{3511struct string_list_item *item;3512struct ref_update *new_update;35133514if((update->flags & REF_LOG_ONLY) ||3515(update->flags & REF_ISPRUNING) ||3516(update->flags & REF_UPDATE_VIA_HEAD))3517return0;35183519if(strcmp(update->refname, head_ref))3520return0;35213522/*3523 * First make sure that HEAD is not already in the3524 * transaction. This insertion is O(N) in the transaction3525 * size, but it happens at most once per transaction.3526 */3527 item =string_list_insert(affected_refnames,"HEAD");3528if(item->util) {3529/* An entry already existed */3530strbuf_addf(err,3531"multiple updates for 'HEAD' (including one "3532"via its referent '%s') are not allowed",3533 update->refname);3534return TRANSACTION_NAME_CONFLICT;3535}35363537 new_update =ref_transaction_add_update(3538 transaction,"HEAD",3539 update->flags | REF_LOG_ONLY | REF_NODEREF,3540 update->new_sha1, update->old_sha1,3541 update->msg);35423543 item->util = new_update;35443545return0;3546}35473548/*3549 * update is for a symref that points at referent and doesn't have3550 * REF_NODEREF set. Split it into two updates:3551 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3552 * - A new, separate update for the referent reference3553 * Note that the new update will itself be subject to splitting when3554 * the iteration gets to it.3555 */3556static intsplit_symref_update(struct files_ref_store *refs,3557struct ref_update *update,3558const char*referent,3559struct ref_transaction *transaction,3560struct string_list *affected_refnames,3561struct strbuf *err)3562{3563struct string_list_item *item;3564struct ref_update *new_update;3565unsigned int new_flags;35663567/*3568 * First make sure that referent is not already in the3569 * transaction. This insertion is O(N) in the transaction3570 * size, but it happens at most once per symref in a3571 * transaction.3572 */3573 item =string_list_insert(affected_refnames, referent);3574if(item->util) {3575/* An entry already existed */3576strbuf_addf(err,3577"multiple updates for '%s' (including one "3578"via symref '%s') are not allowed",3579 referent, update->refname);3580return TRANSACTION_NAME_CONFLICT;3581}35823583 new_flags = update->flags;3584if(!strcmp(update->refname,"HEAD")) {3585/*3586 * Record that the new update came via HEAD, so that3587 * when we process it, split_head_update() doesn't try3588 * to add another reflog update for HEAD. Note that3589 * this bit will be propagated if the new_update3590 * itself needs to be split.3591 */3592 new_flags |= REF_UPDATE_VIA_HEAD;3593}35943595 new_update =ref_transaction_add_update(3596 transaction, referent, new_flags,3597 update->new_sha1, update->old_sha1,3598 update->msg);35993600 new_update->parent_update = update;36013602/*3603 * Change the symbolic ref update to log only. Also, it3604 * doesn't need to check its old SHA-1 value, as that will be3605 * done when new_update is processed.3606 */3607 update->flags |= REF_LOG_ONLY | REF_NODEREF;3608 update->flags &= ~REF_HAVE_OLD;36093610 item->util = new_update;36113612return0;3613}36143615/*3616 * Return the refname under which update was originally requested.3617 */3618static const char*original_update_refname(struct ref_update *update)3619{3620while(update->parent_update)3621 update = update->parent_update;36223623return update->refname;3624}36253626/*3627 * Check whether the REF_HAVE_OLD and old_oid values stored in update3628 * are consistent with oid, which is the reference's current value. If3629 * everything is OK, return 0; otherwise, write an error message to3630 * err and return -1.3631 */3632static intcheck_old_oid(struct ref_update *update,struct object_id *oid,3633struct strbuf *err)3634{3635if(!(update->flags & REF_HAVE_OLD) ||3636!hashcmp(oid->hash, update->old_sha1))3637return0;36383639if(is_null_sha1(update->old_sha1))3640strbuf_addf(err,"cannot lock ref '%s': "3641"reference already exists",3642original_update_refname(update));3643else if(is_null_oid(oid))3644strbuf_addf(err,"cannot lock ref '%s': "3645"reference is missing but expected%s",3646original_update_refname(update),3647sha1_to_hex(update->old_sha1));3648else3649strbuf_addf(err,"cannot lock ref '%s': "3650"is at%sbut expected%s",3651original_update_refname(update),3652oid_to_hex(oid),3653sha1_to_hex(update->old_sha1));36543655return-1;3656}36573658/*3659 * Prepare for carrying out update:3660 * - Lock the reference referred to by update.3661 * - Read the reference under lock.3662 * - Check that its old SHA-1 value (if specified) is correct, and in3663 * any case record it in update->lock->old_oid for later use when3664 * writing the reflog.3665 * - If it is a symref update without REF_NODEREF, split it up into a3666 * REF_LOG_ONLY update of the symref and add a separate update for3667 * the referent to transaction.3668 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3669 * update of HEAD.3670 */3671static intlock_ref_for_update(struct files_ref_store *refs,3672struct ref_update *update,3673struct ref_transaction *transaction,3674const char*head_ref,3675struct string_list *affected_refnames,3676struct strbuf *err)3677{3678struct strbuf referent = STRBUF_INIT;3679int mustexist = (update->flags & REF_HAVE_OLD) &&3680!is_null_sha1(update->old_sha1);3681int ret;3682struct ref_lock *lock;36833684files_assert_main_repository(refs,"lock_ref_for_update");36853686if((update->flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1))3687 update->flags |= REF_DELETING;36883689if(head_ref) {3690 ret =split_head_update(update, transaction, head_ref,3691 affected_refnames, err);3692if(ret)3693return ret;3694}36953696 ret =lock_raw_ref(refs, update->refname, mustexist,3697 affected_refnames, NULL,3698&lock, &referent,3699&update->type, err);3700if(ret) {3701char*reason;37023703 reason =strbuf_detach(err, NULL);3704strbuf_addf(err,"cannot lock ref '%s':%s",3705original_update_refname(update), reason);3706free(reason);3707return ret;3708}37093710 update->backend_data = lock;37113712if(update->type & REF_ISSYMREF) {3713if(update->flags & REF_NODEREF) {3714/*3715 * We won't be reading the referent as part of3716 * the transaction, so we have to read it here3717 * to record and possibly check old_sha1:3718 */3719if(read_ref_full(referent.buf,0,3720 lock->old_oid.hash, NULL)) {3721if(update->flags & REF_HAVE_OLD) {3722strbuf_addf(err,"cannot lock ref '%s': "3723"error reading reference",3724original_update_refname(update));3725return-1;3726}3727}else if(check_old_oid(update, &lock->old_oid, err)) {3728return TRANSACTION_GENERIC_ERROR;3729}3730}else{3731/*3732 * Create a new update for the reference this3733 * symref is pointing at. Also, we will record3734 * and verify old_sha1 for this update as part3735 * of processing the split-off update, so we3736 * don't have to do it here.3737 */3738 ret =split_symref_update(refs, update,3739 referent.buf, transaction,3740 affected_refnames, err);3741if(ret)3742return ret;3743}3744}else{3745struct ref_update *parent_update;37463747if(check_old_oid(update, &lock->old_oid, err))3748return TRANSACTION_GENERIC_ERROR;37493750/*3751 * If this update is happening indirectly because of a3752 * symref update, record the old SHA-1 in the parent3753 * update:3754 */3755for(parent_update = update->parent_update;3756 parent_update;3757 parent_update = parent_update->parent_update) {3758struct ref_lock *parent_lock = parent_update->backend_data;3759oidcpy(&parent_lock->old_oid, &lock->old_oid);3760}3761}37623763if((update->flags & REF_HAVE_NEW) &&3764!(update->flags & REF_DELETING) &&3765!(update->flags & REF_LOG_ONLY)) {3766if(!(update->type & REF_ISSYMREF) &&3767!hashcmp(lock->old_oid.hash, update->new_sha1)) {3768/*3769 * The reference already has the desired3770 * value, so we don't need to write it.3771 */3772}else if(write_ref_to_lockfile(lock, update->new_sha1,3773 err)) {3774char*write_err =strbuf_detach(err, NULL);37753776/*3777 * The lock was freed upon failure of3778 * write_ref_to_lockfile():3779 */3780 update->backend_data = NULL;3781strbuf_addf(err,3782"cannot update ref '%s':%s",3783 update->refname, write_err);3784free(write_err);3785return TRANSACTION_GENERIC_ERROR;3786}else{3787 update->flags |= REF_NEEDS_COMMIT;3788}3789}3790if(!(update->flags & REF_NEEDS_COMMIT)) {3791/*3792 * We didn't call write_ref_to_lockfile(), so3793 * the lockfile is still open. Close it to3794 * free up the file descriptor:3795 */3796if(close_ref(lock)) {3797strbuf_addf(err,"couldn't close '%s.lock'",3798 update->refname);3799return TRANSACTION_GENERIC_ERROR;3800}3801}3802return0;3803}38043805static intfiles_transaction_commit(struct ref_store *ref_store,3806struct ref_transaction *transaction,3807struct strbuf *err)3808{3809struct files_ref_store *refs =3810files_downcast(ref_store, REF_STORE_WRITE,3811"ref_transaction_commit");3812int ret =0, i;3813struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3814struct string_list_item *ref_to_delete;3815struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3816char*head_ref = NULL;3817int head_type;3818struct object_id head_oid;3819struct strbuf sb = STRBUF_INIT;38203821assert(err);38223823if(transaction->state != REF_TRANSACTION_OPEN)3824die("BUG: commit called for transaction that is not open");38253826if(!transaction->nr) {3827 transaction->state = REF_TRANSACTION_CLOSED;3828return0;3829}38303831/*3832 * Fail if a refname appears more than once in the3833 * transaction. (If we end up splitting up any updates using3834 * split_symref_update() or split_head_update(), those3835 * functions will check that the new updates don't have the3836 * same refname as any existing ones.)3837 */3838for(i =0; i < transaction->nr; i++) {3839struct ref_update *update = transaction->updates[i];3840struct string_list_item *item =3841string_list_append(&affected_refnames, update->refname);38423843/*3844 * We store a pointer to update in item->util, but at3845 * the moment we never use the value of this field3846 * except to check whether it is non-NULL.3847 */3848 item->util = update;3849}3850string_list_sort(&affected_refnames);3851if(ref_update_reject_duplicates(&affected_refnames, err)) {3852 ret = TRANSACTION_GENERIC_ERROR;3853goto cleanup;3854}38553856/*3857 * Special hack: If a branch is updated directly and HEAD3858 * points to it (may happen on the remote side of a push3859 * for example) then logically the HEAD reflog should be3860 * updated too.3861 *3862 * A generic solution would require reverse symref lookups,3863 * but finding all symrefs pointing to a given branch would be3864 * rather costly for this rare event (the direct update of a3865 * branch) to be worth it. So let's cheat and check with HEAD3866 * only, which should cover 99% of all usage scenarios (even3867 * 100% of the default ones).3868 *3869 * So if HEAD is a symbolic reference, then record the name of3870 * the reference that it points to. If we see an update of3871 * head_ref within the transaction, then split_head_update()3872 * arranges for the reflog of HEAD to be updated, too.3873 */3874 head_ref =resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3875 head_oid.hash, &head_type);38763877if(head_ref && !(head_type & REF_ISSYMREF)) {3878free(head_ref);3879 head_ref = NULL;3880}38813882/*3883 * Acquire all locks, verify old values if provided, check3884 * that new values are valid, and write new values to the3885 * lockfiles, ready to be activated. Only keep one lockfile3886 * open at a time to avoid running out of file descriptors.3887 */3888for(i =0; i < transaction->nr; i++) {3889struct ref_update *update = transaction->updates[i];38903891 ret =lock_ref_for_update(refs, update, transaction,3892 head_ref, &affected_refnames, err);3893if(ret)3894goto cleanup;3895}38963897/* Perform updates first so live commits remain referenced */3898for(i =0; i < transaction->nr; i++) {3899struct ref_update *update = transaction->updates[i];3900struct ref_lock *lock = update->backend_data;39013902if(update->flags & REF_NEEDS_COMMIT ||3903 update->flags & REF_LOG_ONLY) {3904if(files_log_ref_write(refs,3905 lock->ref_name,3906 lock->old_oid.hash,3907 update->new_sha1,3908 update->msg, update->flags,3909 err)) {3910char*old_msg =strbuf_detach(err, NULL);39113912strbuf_addf(err,"cannot update the ref '%s':%s",3913 lock->ref_name, old_msg);3914free(old_msg);3915unlock_ref(lock);3916 update->backend_data = NULL;3917 ret = TRANSACTION_GENERIC_ERROR;3918goto cleanup;3919}3920}3921if(update->flags & REF_NEEDS_COMMIT) {3922clear_loose_ref_cache(refs);3923if(commit_ref(lock)) {3924strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3925unlock_ref(lock);3926 update->backend_data = NULL;3927 ret = TRANSACTION_GENERIC_ERROR;3928goto cleanup;3929}3930}3931}3932/* Perform deletes now that updates are safely completed */3933for(i =0; i < transaction->nr; i++) {3934struct ref_update *update = transaction->updates[i];3935struct ref_lock *lock = update->backend_data;39363937if(update->flags & REF_DELETING &&3938!(update->flags & REF_LOG_ONLY)) {3939if(!(update->type & REF_ISPACKED) ||3940 update->type & REF_ISSYMREF) {3941/* It is a loose reference. */3942strbuf_reset(&sb);3943files_ref_path(refs, &sb, lock->ref_name);3944if(unlink_or_msg(sb.buf, err)) {3945 ret = TRANSACTION_GENERIC_ERROR;3946goto cleanup;3947}3948 update->flags |= REF_DELETED_LOOSE;3949}39503951if(!(update->flags & REF_ISPRUNING))3952string_list_append(&refs_to_delete,3953 lock->ref_name);3954}3955}39563957if(repack_without_refs(refs, &refs_to_delete, err)) {3958 ret = TRANSACTION_GENERIC_ERROR;3959goto cleanup;3960}39613962/* Delete the reflogs of any references that were deleted: */3963for_each_string_list_item(ref_to_delete, &refs_to_delete) {3964strbuf_reset(&sb);3965files_reflog_path(refs, &sb, ref_to_delete->string);3966if(!unlink_or_warn(sb.buf))3967try_remove_empty_parents(refs, ref_to_delete->string,3968 REMOVE_EMPTY_PARENTS_REFLOG);3969}39703971clear_loose_ref_cache(refs);39723973cleanup:3974strbuf_release(&sb);3975 transaction->state = REF_TRANSACTION_CLOSED;39763977for(i =0; i < transaction->nr; i++) {3978struct ref_update *update = transaction->updates[i];3979struct ref_lock *lock = update->backend_data;39803981if(lock)3982unlock_ref(lock);39833984if(update->flags & REF_DELETED_LOOSE) {3985/*3986 * The loose reference was deleted. Delete any3987 * empty parent directories. (Note that this3988 * can only work because we have already3989 * removed the lockfile.)3990 */3991try_remove_empty_parents(refs, update->refname,3992 REMOVE_EMPTY_PARENTS_REF);3993}3994}39953996string_list_clear(&refs_to_delete,0);3997free(head_ref);3998string_list_clear(&affected_refnames,0);39994000return ret;4001}40024003static intref_present(const char*refname,4004const struct object_id *oid,int flags,void*cb_data)4005{4006struct string_list *affected_refnames = cb_data;40074008returnstring_list_has_string(affected_refnames, refname);4009}40104011static intfiles_initial_transaction_commit(struct ref_store *ref_store,4012struct ref_transaction *transaction,4013struct strbuf *err)4014{4015struct files_ref_store *refs =4016files_downcast(ref_store, REF_STORE_WRITE,4017"initial_ref_transaction_commit");4018int ret =0, i;4019struct string_list affected_refnames = STRING_LIST_INIT_NODUP;40204021assert(err);40224023if(transaction->state != REF_TRANSACTION_OPEN)4024die("BUG: commit called for transaction that is not open");40254026/* Fail if a refname appears more than once in the transaction: */4027for(i =0; i < transaction->nr; i++)4028string_list_append(&affected_refnames,4029 transaction->updates[i]->refname);4030string_list_sort(&affected_refnames);4031if(ref_update_reject_duplicates(&affected_refnames, err)) {4032 ret = TRANSACTION_GENERIC_ERROR;4033goto cleanup;4034}40354036/*4037 * It's really undefined to call this function in an active4038 * repository or when there are existing references: we are4039 * only locking and changing packed-refs, so (1) any4040 * simultaneous processes might try to change a reference at4041 * the same time we do, and (2) any existing loose versions of4042 * the references that we are setting would have precedence4043 * over our values. But some remote helpers create the remote4044 * "HEAD" and "master" branches before calling this function,4045 * so here we really only check that none of the references4046 * that we are creating already exists.4047 */4048if(for_each_rawref(ref_present, &affected_refnames))4049die("BUG: initial ref transaction called with existing refs");40504051for(i =0; i < transaction->nr; i++) {4052struct ref_update *update = transaction->updates[i];40534054if((update->flags & REF_HAVE_OLD) &&4055!is_null_sha1(update->old_sha1))4056die("BUG: initial ref transaction with old_sha1 set");4057if(verify_refname_available(update->refname,4058&affected_refnames, NULL,4059 err)) {4060 ret = TRANSACTION_NAME_CONFLICT;4061goto cleanup;4062}4063}40644065if(lock_packed_refs(refs,0)) {4066strbuf_addf(err,"unable to lock packed-refs file:%s",4067strerror(errno));4068 ret = TRANSACTION_GENERIC_ERROR;4069goto cleanup;4070}40714072for(i =0; i < transaction->nr; i++) {4073struct ref_update *update = transaction->updates[i];40744075if((update->flags & REF_HAVE_NEW) &&4076!is_null_sha1(update->new_sha1))4077add_packed_ref(refs, update->refname, update->new_sha1);4078}40794080if(commit_packed_refs(refs)) {4081strbuf_addf(err,"unable to commit packed-refs file:%s",4082strerror(errno));4083 ret = TRANSACTION_GENERIC_ERROR;4084goto cleanup;4085}40864087cleanup:4088 transaction->state = REF_TRANSACTION_CLOSED;4089string_list_clear(&affected_refnames,0);4090return ret;4091}40924093struct expire_reflog_cb {4094unsigned int flags;4095 reflog_expiry_should_prune_fn *should_prune_fn;4096void*policy_cb;4097FILE*newlog;4098struct object_id last_kept_oid;4099};41004101static intexpire_reflog_ent(struct object_id *ooid,struct object_id *noid,4102const char*email,unsigned long timestamp,int tz,4103const char*message,void*cb_data)4104{4105struct expire_reflog_cb *cb = cb_data;4106struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;41074108if(cb->flags & EXPIRE_REFLOGS_REWRITE)4109 ooid = &cb->last_kept_oid;41104111if((*cb->should_prune_fn)(ooid->hash, noid->hash, email, timestamp, tz,4112 message, policy_cb)) {4113if(!cb->newlog)4114printf("would prune%s", message);4115else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4116printf("prune%s", message);4117}else{4118if(cb->newlog) {4119fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",4120oid_to_hex(ooid),oid_to_hex(noid),4121 email, timestamp, tz, message);4122oidcpy(&cb->last_kept_oid, noid);4123}4124if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4125printf("keep%s", message);4126}4127return0;4128}41294130static intfiles_reflog_expire(struct ref_store *ref_store,4131const char*refname,const unsigned char*sha1,4132unsigned int flags,4133 reflog_expiry_prepare_fn prepare_fn,4134 reflog_expiry_should_prune_fn should_prune_fn,4135 reflog_expiry_cleanup_fn cleanup_fn,4136void*policy_cb_data)4137{4138struct files_ref_store *refs =4139files_downcast(ref_store, REF_STORE_WRITE,"reflog_expire");4140static struct lock_file reflog_lock;4141struct expire_reflog_cb cb;4142struct ref_lock *lock;4143struct strbuf log_file_sb = STRBUF_INIT;4144char*log_file;4145int status =0;4146int type;4147struct strbuf err = STRBUF_INIT;41484149memset(&cb,0,sizeof(cb));4150 cb.flags = flags;4151 cb.policy_cb = policy_cb_data;4152 cb.should_prune_fn = should_prune_fn;41534154/*4155 * The reflog file is locked by holding the lock on the4156 * reference itself, plus we might need to update the4157 * reference if --updateref was specified:4158 */4159 lock =lock_ref_sha1_basic(refs, refname, sha1,4160 NULL, NULL, REF_NODEREF,4161&type, &err);4162if(!lock) {4163error("cannot lock ref '%s':%s", refname, err.buf);4164strbuf_release(&err);4165return-1;4166}4167if(!reflog_exists(refname)) {4168unlock_ref(lock);4169return0;4170}41714172files_reflog_path(refs, &log_file_sb, refname);4173 log_file =strbuf_detach(&log_file_sb, NULL);4174if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4175/*4176 * Even though holding $GIT_DIR/logs/$reflog.lock has4177 * no locking implications, we use the lock_file4178 * machinery here anyway because it does a lot of the4179 * work we need, including cleaning up if the program4180 * exits unexpectedly.4181 */4182if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4183struct strbuf err = STRBUF_INIT;4184unable_to_lock_message(log_file, errno, &err);4185error("%s", err.buf);4186strbuf_release(&err);4187goto failure;4188}4189 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4190if(!cb.newlog) {4191error("cannot fdopen%s(%s)",4192get_lock_file_path(&reflog_lock),strerror(errno));4193goto failure;4194}4195}41964197(*prepare_fn)(refname, sha1, cb.policy_cb);4198for_each_reflog_ent(refname, expire_reflog_ent, &cb);4199(*cleanup_fn)(cb.policy_cb);42004201if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4202/*4203 * It doesn't make sense to adjust a reference pointed4204 * to by a symbolic ref based on expiring entries in4205 * the symbolic reference's reflog. Nor can we update4206 * a reference if there are no remaining reflog4207 * entries.4208 */4209int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4210!(type & REF_ISSYMREF) &&4211!is_null_oid(&cb.last_kept_oid);42124213if(close_lock_file(&reflog_lock)) {4214 status |=error("couldn't write%s:%s", log_file,4215strerror(errno));4216}else if(update &&4217(write_in_full(get_lock_file_fd(lock->lk),4218oid_to_hex(&cb.last_kept_oid), GIT_SHA1_HEXSZ) != GIT_SHA1_HEXSZ ||4219write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||4220close_ref(lock) <0)) {4221 status |=error("couldn't write%s",4222get_lock_file_path(lock->lk));4223rollback_lock_file(&reflog_lock);4224}else if(commit_lock_file(&reflog_lock)) {4225 status |=error("unable to write reflog '%s' (%s)",4226 log_file,strerror(errno));4227}else if(update &&commit_ref(lock)) {4228 status |=error("couldn't set%s", lock->ref_name);4229}4230}4231free(log_file);4232unlock_ref(lock);4233return status;42344235 failure:4236rollback_lock_file(&reflog_lock);4237free(log_file);4238unlock_ref(lock);4239return-1;4240}42414242static intfiles_init_db(struct ref_store *ref_store,struct strbuf *err)4243{4244struct files_ref_store *refs =4245files_downcast(ref_store, REF_STORE_WRITE,"init_db");4246struct strbuf sb = STRBUF_INIT;42474248/*4249 * Create .git/refs/{heads,tags}4250 */4251files_ref_path(refs, &sb,"refs/heads");4252safe_create_dir(sb.buf,1);42534254strbuf_reset(&sb);4255files_ref_path(refs, &sb,"refs/tags");4256safe_create_dir(sb.buf,1);42574258strbuf_release(&sb);4259return0;4260}42614262struct ref_storage_be refs_be_files = {4263 NULL,4264"files",4265 files_ref_store_create,4266 files_init_db,4267 files_transaction_commit,4268 files_initial_transaction_commit,42694270 files_pack_refs,4271 files_peel_ref,4272 files_create_symref,4273 files_delete_refs,4274 files_rename_ref,42754276 files_ref_iterator_begin,4277 files_read_raw_ref,4278 files_verify_refname_available,42794280 files_reflog_iterator_begin,4281 files_for_each_reflog_ent,4282 files_for_each_reflog_ent_reverse,4283 files_reflog_exists,4284 files_create_reflog,4285 files_delete_reflog,4286 files_reflog_expire4287};