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(!refs_resolve_ref_unsafe(&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(refs_verify_refname_available(&refs->base, refname,1626 extras, skip, err)) {1627if(mustexist) {1628/*1629 * To the user the relevant error is1630 * that the "mustexist" reference is1631 * missing:1632 */1633strbuf_reset(err);1634strbuf_addf(err,"unable to resolve reference '%s'",1635 refname);1636}else{1637/*1638 * The error message set by1639 * verify_refname_available_dir() is OK.1640 */1641 ret = TRANSACTION_NAME_CONFLICT;1642}1643}else{1644/*1645 * The file that is in the way isn't a loose1646 * reference. Report it as a low-level1647 * failure.1648 */1649strbuf_addf(err,"unable to create lock file%s.lock; "1650"non-directory in the way",1651 ref_file.buf);1652}1653goto error_return;1654case SCLD_VANISHED:1655/* Maybe another process was tidying up. Try again. */1656if(--attempts_remaining >0)1657goto retry;1658/* fall through */1659default:1660strbuf_addf(err,"unable to create directory for%s",1661 ref_file.buf);1662goto error_return;1663}16641665if(!lock->lk)1666 lock->lk =xcalloc(1,sizeof(struct lock_file));16671668if(hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) <0) {1669if(errno == ENOENT && --attempts_remaining >0) {1670/*1671 * Maybe somebody just deleted one of the1672 * directories leading to ref_file. Try1673 * again:1674 */1675goto retry;1676}else{1677unable_to_lock_message(ref_file.buf, errno, err);1678goto error_return;1679}1680}16811682/*1683 * Now we hold the lock and can read the reference without1684 * fear that its value will change.1685 */16861687if(files_read_raw_ref(&refs->base, refname,1688 lock->old_oid.hash, referent, type)) {1689if(errno == ENOENT) {1690if(mustexist) {1691/* Garden variety missing reference. */1692strbuf_addf(err,"unable to resolve reference '%s'",1693 refname);1694goto error_return;1695}else{1696/*1697 * Reference is missing, but that's OK. We1698 * know that there is not a conflict with1699 * another loose reference because1700 * (supposing that we are trying to lock1701 * reference "refs/foo/bar"):1702 *1703 * - We were successfully able to create1704 * the lockfile refs/foo/bar.lock, so we1705 * know there cannot be a loose reference1706 * named "refs/foo".1707 *1708 * - We got ENOENT and not EISDIR, so we1709 * know that there cannot be a loose1710 * reference named "refs/foo/bar/baz".1711 */1712}1713}else if(errno == EISDIR) {1714/*1715 * There is a directory in the way. It might have1716 * contained references that have been deleted. If1717 * we don't require that the reference already1718 * exists, try to remove the directory so that it1719 * doesn't cause trouble when we want to rename the1720 * lockfile into place later.1721 */1722if(mustexist) {1723/* Garden variety missing reference. */1724strbuf_addf(err,"unable to resolve reference '%s'",1725 refname);1726goto error_return;1727}else if(remove_dir_recursively(&ref_file,1728 REMOVE_DIR_EMPTY_ONLY)) {1729if(verify_refname_available_dir(1730 refname, extras, skip,1731get_loose_refs(refs),1732 err)) {1733/*1734 * The error message set by1735 * verify_refname_available() is OK.1736 */1737 ret = TRANSACTION_NAME_CONFLICT;1738goto error_return;1739}else{1740/*1741 * We can't delete the directory,1742 * but we also don't know of any1743 * references that it should1744 * contain.1745 */1746strbuf_addf(err,"there is a non-empty directory '%s' "1747"blocking reference '%s'",1748 ref_file.buf, refname);1749goto error_return;1750}1751}1752}else if(errno == EINVAL && (*type & REF_ISBROKEN)) {1753strbuf_addf(err,"unable to resolve reference '%s': "1754"reference broken", refname);1755goto error_return;1756}else{1757strbuf_addf(err,"unable to resolve reference '%s':%s",1758 refname,strerror(errno));1759goto error_return;1760}17611762/*1763 * If the ref did not exist and we are creating it,1764 * make sure there is no existing packed ref whose1765 * name begins with our refname, nor a packed ref1766 * whose name is a proper prefix of our refname.1767 */1768if(verify_refname_available_dir(1769 refname, extras, skip,1770get_packed_refs(refs),1771 err)) {1772goto error_return;1773}1774}17751776 ret =0;1777goto out;17781779error_return:1780unlock_ref(lock);1781*lock_p = NULL;17821783out:1784strbuf_release(&ref_file);1785return ret;1786}17871788/*1789 * Peel the entry (if possible) and return its new peel_status. If1790 * repeel is true, re-peel the entry even if there is an old peeled1791 * value that is already stored in it.1792 *1793 * It is OK to call this function with a packed reference entry that1794 * might be stale and might even refer to an object that has since1795 * been garbage-collected. In such a case, if the entry has1796 * REF_KNOWS_PEELED then leave the status unchanged and return1797 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1798 */1799static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1800{1801enum peel_status status;18021803if(entry->flag & REF_KNOWS_PEELED) {1804if(repeel) {1805 entry->flag &= ~REF_KNOWS_PEELED;1806oidclr(&entry->u.value.peeled);1807}else{1808returnis_null_oid(&entry->u.value.peeled) ?1809 PEEL_NON_TAG : PEEL_PEELED;1810}1811}1812if(entry->flag & REF_ISBROKEN)1813return PEEL_BROKEN;1814if(entry->flag & REF_ISSYMREF)1815return PEEL_IS_SYMREF;18161817 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1818if(status == PEEL_PEELED || status == PEEL_NON_TAG)1819 entry->flag |= REF_KNOWS_PEELED;1820return status;1821}18221823static intfiles_peel_ref(struct ref_store *ref_store,1824const char*refname,unsigned char*sha1)1825{1826struct files_ref_store *refs =1827files_downcast(ref_store, REF_STORE_READ | REF_STORE_ODB,1828"peel_ref");1829int flag;1830unsigned char base[20];18311832if(current_ref_iter && current_ref_iter->refname == refname) {1833struct object_id peeled;18341835if(ref_iterator_peel(current_ref_iter, &peeled))1836return-1;1837hashcpy(sha1, peeled.hash);1838return0;1839}18401841if(refs_read_ref_full(ref_store, refname,1842 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_store *ref_store,struct ref_lock *lock,2011const unsigned char*old_sha1,int mustexist,2012struct strbuf *err)2013{2014assert(err);20152016if(refs_read_ref_full(ref_store, 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 = !!refs_resolve_ref_unsafe(&refs->base,2088 refname, resolve_flags,2089 lock->old_oid.hash, type);2090if(!resolved && errno == EISDIR) {2091/*2092 * we are trying to lock foo but we used to2093 * have foo/bar which now does not exist;2094 * it is normal for the empty directory 'foo'2095 * to remain.2096 */2097if(remove_empty_directories(&ref_file)) {2098 last_errno = errno;2099if(!verify_refname_available_dir(2100 refname, extras, skip,2101get_loose_refs(refs), err))2102strbuf_addf(err,"there are still refs under '%s'",2103 refname);2104goto error_return;2105}2106 resolved = !!refs_resolve_ref_unsafe(&refs->base,2107 refname, resolve_flags,2108 lock->old_oid.hash, type);2109}2110if(!resolved) {2111 last_errno = errno;2112if(last_errno != ENOTDIR ||2113!verify_refname_available_dir(2114 refname, extras, skip,2115get_loose_refs(refs), err))2116strbuf_addf(err,"unable to resolve reference '%s':%s",2117 refname,strerror(last_errno));21182119goto error_return;2120}21212122/*2123 * If the ref did not exist and we are creating it, make sure2124 * there is no existing packed ref whose name begins with our2125 * refname, nor a packed ref whose name is a proper prefix of2126 * our refname.2127 */2128if(is_null_oid(&lock->old_oid) &&2129verify_refname_available_dir(refname, extras, skip,2130get_packed_refs(refs),2131 err)) {2132 last_errno = ENOTDIR;2133goto error_return;2134}21352136 lock->lk =xcalloc(1,sizeof(struct lock_file));21372138 lock->ref_name =xstrdup(refname);21392140if(raceproof_create_file(ref_file.buf, create_reflock, lock->lk)) {2141 last_errno = errno;2142unable_to_lock_message(ref_file.buf, errno, err);2143goto error_return;2144}21452146if(verify_lock(&refs->base, lock, old_sha1, mustexist, err)) {2147 last_errno = errno;2148goto error_return;2149}2150goto out;21512152 error_return:2153unlock_ref(lock);2154 lock = NULL;21552156 out:2157strbuf_release(&ref_file);2158 errno = last_errno;2159return lock;2160}21612162/*2163 * Write an entry to the packed-refs file for the specified refname.2164 * If peeled is non-NULL, write it as the entry's peeled value.2165 */2166static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2167unsigned char*peeled)2168{2169fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2170if(peeled)2171fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2172}21732174/*2175 * An each_ref_entry_fn that writes the entry to a packed-refs file.2176 */2177static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2178{2179enum peel_status peel_status =peel_entry(entry,0);21802181if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2182error("internal error:%sis not a valid packed reference!",2183 entry->name);2184write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2185 peel_status == PEEL_PEELED ?2186 entry->u.value.peeled.hash : NULL);2187return0;2188}21892190/*2191 * Lock the packed-refs file for writing. Flags is passed to2192 * hold_lock_file_for_update(). Return 0 on success. On errors, set2193 * errno appropriately and return a nonzero value.2194 */2195static intlock_packed_refs(struct files_ref_store *refs,int flags)2196{2197static int timeout_configured =0;2198static int timeout_value =1000;2199struct packed_ref_cache *packed_ref_cache;22002201files_assert_main_repository(refs,"lock_packed_refs");22022203if(!timeout_configured) {2204git_config_get_int("core.packedrefstimeout", &timeout_value);2205 timeout_configured =1;2206}22072208if(hold_lock_file_for_update_timeout(2209&packlock,files_packed_refs_path(refs),2210 flags, timeout_value) <0)2211return-1;2212/*2213 * Get the current packed-refs while holding the lock. If the2214 * packed-refs file has been modified since we last read it,2215 * this will automatically invalidate the cache and re-read2216 * the packed-refs file.2217 */2218 packed_ref_cache =get_packed_ref_cache(refs);2219 packed_ref_cache->lock = &packlock;2220/* Increment the reference count to prevent it from being freed: */2221acquire_packed_ref_cache(packed_ref_cache);2222return0;2223}22242225/*2226 * Write the current version of the packed refs cache from memory to2227 * disk. The packed-refs file must already be locked for writing (see2228 * lock_packed_refs()). Return zero on success. On errors, set errno2229 * and return a nonzero value2230 */2231static intcommit_packed_refs(struct files_ref_store *refs)2232{2233struct packed_ref_cache *packed_ref_cache =2234get_packed_ref_cache(refs);2235int error =0;2236int save_errno =0;2237FILE*out;22382239files_assert_main_repository(refs,"commit_packed_refs");22402241if(!packed_ref_cache->lock)2242die("internal error: packed-refs not locked");22432244 out =fdopen_lock_file(packed_ref_cache->lock,"w");2245if(!out)2246die_errno("unable to fdopen packed-refs descriptor");22472248fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2249do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),22500, write_packed_entry_fn, out);22512252if(commit_lock_file(packed_ref_cache->lock)) {2253 save_errno = errno;2254 error = -1;2255}2256 packed_ref_cache->lock = NULL;2257release_packed_ref_cache(packed_ref_cache);2258 errno = save_errno;2259return error;2260}22612262/*2263 * Rollback the lockfile for the packed-refs file, and discard the2264 * in-memory packed reference cache. (The packed-refs file will be2265 * read anew if it is needed again after this function is called.)2266 */2267static voidrollback_packed_refs(struct files_ref_store *refs)2268{2269struct packed_ref_cache *packed_ref_cache =2270get_packed_ref_cache(refs);22712272files_assert_main_repository(refs,"rollback_packed_refs");22732274if(!packed_ref_cache->lock)2275die("internal error: packed-refs not locked");2276rollback_lock_file(packed_ref_cache->lock);2277 packed_ref_cache->lock = NULL;2278release_packed_ref_cache(packed_ref_cache);2279clear_packed_ref_cache(refs);2280}22812282struct ref_to_prune {2283struct ref_to_prune *next;2284unsigned char sha1[20];2285char name[FLEX_ARRAY];2286};22872288struct pack_refs_cb_data {2289unsigned int flags;2290struct ref_dir *packed_refs;2291struct ref_to_prune *ref_to_prune;2292};22932294/*2295 * An each_ref_entry_fn that is run over loose references only. If2296 * the loose reference can be packed, add an entry in the packed ref2297 * cache. If the reference should be pruned, also add it to2298 * ref_to_prune in the pack_refs_cb_data.2299 */2300static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2301{2302struct pack_refs_cb_data *cb = cb_data;2303enum peel_status peel_status;2304struct ref_entry *packed_entry;2305int is_tag_ref =starts_with(entry->name,"refs/tags/");23062307/* Do not pack per-worktree refs: */2308if(ref_type(entry->name) != REF_TYPE_NORMAL)2309return0;23102311/* ALWAYS pack tags */2312if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2313return0;23142315/* Do not pack symbolic or broken refs: */2316if((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))2317return0;23182319/* Add a packed ref cache entry equivalent to the loose entry. */2320 peel_status =peel_entry(entry,1);2321if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2322die("internal error peeling reference%s(%s)",2323 entry->name,oid_to_hex(&entry->u.value.oid));2324 packed_entry =find_ref(cb->packed_refs, entry->name);2325if(packed_entry) {2326/* Overwrite existing packed entry with info from loose entry */2327 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2328oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2329}else{2330 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2331 REF_ISPACKED | REF_KNOWS_PEELED,0);2332add_ref(cb->packed_refs, packed_entry);2333}2334oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);23352336/* Schedule the loose reference for pruning if requested. */2337if((cb->flags & PACK_REFS_PRUNE)) {2338struct ref_to_prune *n;2339FLEX_ALLOC_STR(n, name, entry->name);2340hashcpy(n->sha1, entry->u.value.oid.hash);2341 n->next = cb->ref_to_prune;2342 cb->ref_to_prune = n;2343}2344return0;2345}23462347enum{2348 REMOVE_EMPTY_PARENTS_REF =0x01,2349 REMOVE_EMPTY_PARENTS_REFLOG =0x022350};23512352/*2353 * Remove empty parent directories associated with the specified2354 * reference and/or its reflog, but spare [logs/]refs/ and immediate2355 * subdirs. flags is a combination of REMOVE_EMPTY_PARENTS_REF and/or2356 * REMOVE_EMPTY_PARENTS_REFLOG.2357 */2358static voidtry_remove_empty_parents(struct files_ref_store *refs,2359const char*refname,2360unsigned int flags)2361{2362struct strbuf buf = STRBUF_INIT;2363struct strbuf sb = STRBUF_INIT;2364char*p, *q;2365int i;23662367strbuf_addstr(&buf, refname);2368 p = buf.buf;2369for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2370while(*p && *p !='/')2371 p++;2372/* tolerate duplicate slashes; see check_refname_format() */2373while(*p =='/')2374 p++;2375}2376 q = buf.buf + buf.len;2377while(flags & (REMOVE_EMPTY_PARENTS_REF | REMOVE_EMPTY_PARENTS_REFLOG)) {2378while(q > p && *q !='/')2379 q--;2380while(q > p && *(q-1) =='/')2381 q--;2382if(q == p)2383break;2384strbuf_setlen(&buf, q - buf.buf);23852386strbuf_reset(&sb);2387files_ref_path(refs, &sb, buf.buf);2388if((flags & REMOVE_EMPTY_PARENTS_REF) &&rmdir(sb.buf))2389 flags &= ~REMOVE_EMPTY_PARENTS_REF;23902391strbuf_reset(&sb);2392files_reflog_path(refs, &sb, buf.buf);2393if((flags & REMOVE_EMPTY_PARENTS_REFLOG) &&rmdir(sb.buf))2394 flags &= ~REMOVE_EMPTY_PARENTS_REFLOG;2395}2396strbuf_release(&buf);2397strbuf_release(&sb);2398}23992400/* make sure nobody touched the ref, and unlink */2401static voidprune_ref(struct files_ref_store *refs,struct ref_to_prune *r)2402{2403struct ref_transaction *transaction;2404struct strbuf err = STRBUF_INIT;24052406if(check_refname_format(r->name,0))2407return;24082409 transaction =ref_store_transaction_begin(&refs->base, &err);2410if(!transaction ||2411ref_transaction_delete(transaction, r->name, r->sha1,2412 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2413ref_transaction_commit(transaction, &err)) {2414ref_transaction_free(transaction);2415error("%s", err.buf);2416strbuf_release(&err);2417return;2418}2419ref_transaction_free(transaction);2420strbuf_release(&err);2421}24222423static voidprune_refs(struct files_ref_store *refs,struct ref_to_prune *r)2424{2425while(r) {2426prune_ref(refs, r);2427 r = r->next;2428}2429}24302431static intfiles_pack_refs(struct ref_store *ref_store,unsigned int flags)2432{2433struct files_ref_store *refs =2434files_downcast(ref_store, REF_STORE_WRITE | REF_STORE_ODB,2435"pack_refs");2436struct pack_refs_cb_data cbdata;24372438memset(&cbdata,0,sizeof(cbdata));2439 cbdata.flags = flags;24402441lock_packed_refs(refs, LOCK_DIE_ON_ERROR);2442 cbdata.packed_refs =get_packed_refs(refs);24432444do_for_each_entry_in_dir(get_loose_refs(refs),0,2445 pack_if_possible_fn, &cbdata);24462447if(commit_packed_refs(refs))2448die_errno("unable to overwrite old ref-pack file");24492450prune_refs(refs, cbdata.ref_to_prune);2451return0;2452}24532454/*2455 * Rewrite the packed-refs file, omitting any refs listed in2456 * 'refnames'. On error, leave packed-refs unchanged, write an error2457 * message to 'err', and return a nonzero value.2458 *2459 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2460 */2461static intrepack_without_refs(struct files_ref_store *refs,2462struct string_list *refnames,struct strbuf *err)2463{2464struct ref_dir *packed;2465struct string_list_item *refname;2466int ret, needs_repacking =0, removed =0;24672468files_assert_main_repository(refs,"repack_without_refs");2469assert(err);24702471/* Look for a packed ref */2472for_each_string_list_item(refname, refnames) {2473if(get_packed_ref(refs, refname->string)) {2474 needs_repacking =1;2475break;2476}2477}24782479/* Avoid locking if we have nothing to do */2480if(!needs_repacking)2481return0;/* no refname exists in packed refs */24822483if(lock_packed_refs(refs,0)) {2484unable_to_lock_message(files_packed_refs_path(refs), errno, err);2485return-1;2486}2487 packed =get_packed_refs(refs);24882489/* Remove refnames from the cache */2490for_each_string_list_item(refname, refnames)2491if(remove_entry(packed, refname->string) != -1)2492 removed =1;2493if(!removed) {2494/*2495 * All packed entries disappeared while we were2496 * acquiring the lock.2497 */2498rollback_packed_refs(refs);2499return0;2500}25012502/* Write what remains */2503 ret =commit_packed_refs(refs);2504if(ret)2505strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2506strerror(errno));2507return ret;2508}25092510static intfiles_delete_refs(struct ref_store *ref_store,2511struct string_list *refnames,unsigned int flags)2512{2513struct files_ref_store *refs =2514files_downcast(ref_store, REF_STORE_WRITE,"delete_refs");2515struct strbuf err = STRBUF_INIT;2516int i, result =0;25172518if(!refnames->nr)2519return0;25202521 result =repack_without_refs(refs, refnames, &err);2522if(result) {2523/*2524 * If we failed to rewrite the packed-refs file, then2525 * it is unsafe to try to remove loose refs, because2526 * doing so might expose an obsolete packed value for2527 * a reference that might even point at an object that2528 * has been garbage collected.2529 */2530if(refnames->nr ==1)2531error(_("could not delete reference%s:%s"),2532 refnames->items[0].string, err.buf);2533else2534error(_("could not delete references:%s"), err.buf);25352536goto out;2537}25382539for(i =0; i < refnames->nr; i++) {2540const char*refname = refnames->items[i].string;25412542if(refs_delete_ref(&refs->base, NULL, refname, NULL, flags))2543 result |=error(_("could not remove reference%s"), refname);2544}25452546out:2547strbuf_release(&err);2548return result;2549}25502551/*2552 * People using contrib's git-new-workdir have .git/logs/refs ->2553 * /some/other/path/.git/logs/refs, and that may live on another device.2554 *2555 * IOW, to avoid cross device rename errors, the temporary renamed log must2556 * live into logs/refs.2557 */2558#define TMP_RENAMED_LOG"refs/.tmp-renamed-log"25592560struct rename_cb {2561const char*tmp_renamed_log;2562int true_errno;2563};25642565static intrename_tmp_log_callback(const char*path,void*cb_data)2566{2567struct rename_cb *cb = cb_data;25682569if(rename(cb->tmp_renamed_log, path)) {2570/*2571 * rename(a, b) when b is an existing directory ought2572 * to result in ISDIR, but Solaris 5.8 gives ENOTDIR.2573 * Sheesh. Record the true errno for error reporting,2574 * but report EISDIR to raceproof_create_file() so2575 * that it knows to retry.2576 */2577 cb->true_errno = errno;2578if(errno == ENOTDIR)2579 errno = EISDIR;2580return-1;2581}else{2582return0;2583}2584}25852586static intrename_tmp_log(struct files_ref_store *refs,const char*newrefname)2587{2588struct strbuf path = STRBUF_INIT;2589struct strbuf tmp = STRBUF_INIT;2590struct rename_cb cb;2591int ret;25922593files_reflog_path(refs, &path, newrefname);2594files_reflog_path(refs, &tmp, TMP_RENAMED_LOG);2595 cb.tmp_renamed_log = tmp.buf;2596 ret =raceproof_create_file(path.buf, rename_tmp_log_callback, &cb);2597if(ret) {2598if(errno == EISDIR)2599error("directory not empty:%s", path.buf);2600else2601error("unable to move logfile%sto%s:%s",2602 tmp.buf, path.buf,2603strerror(cb.true_errno));2604}26052606strbuf_release(&path);2607strbuf_release(&tmp);2608return ret;2609}26102611static intfiles_verify_refname_available(struct ref_store *ref_store,2612const char*newname,2613const struct string_list *extras,2614const struct string_list *skip,2615struct strbuf *err)2616{2617struct files_ref_store *refs =2618files_downcast(ref_store, REF_STORE_READ,"verify_refname_available");2619struct ref_dir *packed_refs =get_packed_refs(refs);2620struct ref_dir *loose_refs =get_loose_refs(refs);26212622if(verify_refname_available_dir(newname, extras, skip,2623 packed_refs, err) ||2624verify_refname_available_dir(newname, extras, skip,2625 loose_refs, err))2626return-1;26272628return0;2629}26302631static intwrite_ref_to_lockfile(struct ref_lock *lock,2632const unsigned char*sha1,struct strbuf *err);2633static intcommit_ref_update(struct files_ref_store *refs,2634struct ref_lock *lock,2635const unsigned char*sha1,const char*logmsg,2636struct strbuf *err);26372638static intfiles_rename_ref(struct ref_store *ref_store,2639const char*oldrefname,const char*newrefname,2640const char*logmsg)2641{2642struct files_ref_store *refs =2643files_downcast(ref_store, REF_STORE_WRITE,"rename_ref");2644unsigned char sha1[20], orig_sha1[20];2645int flag =0, logmoved =0;2646struct ref_lock *lock;2647struct stat loginfo;2648struct strbuf sb_oldref = STRBUF_INIT;2649struct strbuf sb_newref = STRBUF_INIT;2650struct strbuf tmp_renamed_log = STRBUF_INIT;2651int log, ret;2652struct strbuf err = STRBUF_INIT;26532654files_reflog_path(refs, &sb_oldref, oldrefname);2655files_reflog_path(refs, &sb_newref, newrefname);2656files_reflog_path(refs, &tmp_renamed_log, TMP_RENAMED_LOG);26572658 log = !lstat(sb_oldref.buf, &loginfo);2659if(log &&S_ISLNK(loginfo.st_mode)) {2660 ret =error("reflog for%sis a symlink", oldrefname);2661goto out;2662}26632664if(!refs_resolve_ref_unsafe(&refs->base, oldrefname,2665 RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2666 orig_sha1, &flag)) {2667 ret =error("refname%snot found", oldrefname);2668goto out;2669}26702671if(flag & REF_ISSYMREF) {2672 ret =error("refname%sis a symbolic ref, renaming it is not supported",2673 oldrefname);2674goto out;2675}2676if(!refs_rename_ref_available(&refs->base, oldrefname, newrefname)) {2677 ret =1;2678goto out;2679}26802681if(log &&rename(sb_oldref.buf, tmp_renamed_log.buf)) {2682 ret =error("unable to move logfile logs/%sto logs/"TMP_RENAMED_LOG":%s",2683 oldrefname,strerror(errno));2684goto out;2685}26862687if(refs_delete_ref(&refs->base, logmsg, oldrefname,2688 orig_sha1, REF_NODEREF)) {2689error("unable to delete old%s", oldrefname);2690goto rollback;2691}26922693/*2694 * Since we are doing a shallow lookup, sha1 is not the2695 * correct value to pass to delete_ref as old_sha1. But that2696 * doesn't matter, because an old_sha1 check wouldn't add to2697 * the safety anyway; we want to delete the reference whatever2698 * its current value.2699 */2700if(!refs_read_ref_full(&refs->base, newrefname,2701 RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2702 sha1, NULL) &&2703refs_delete_ref(&refs->base, NULL, newrefname,2704 NULL, REF_NODEREF)) {2705if(errno == EISDIR) {2706struct strbuf path = STRBUF_INIT;2707int result;27082709files_ref_path(refs, &path, newrefname);2710 result =remove_empty_directories(&path);2711strbuf_release(&path);27122713if(result) {2714error("Directory not empty:%s", newrefname);2715goto rollback;2716}2717}else{2718error("unable to delete existing%s", newrefname);2719goto rollback;2720}2721}27222723if(log &&rename_tmp_log(refs, newrefname))2724goto rollback;27252726 logmoved = log;27272728 lock =lock_ref_sha1_basic(refs, newrefname, NULL, NULL, NULL,2729 REF_NODEREF, NULL, &err);2730if(!lock) {2731error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2732strbuf_release(&err);2733goto rollback;2734}2735hashcpy(lock->old_oid.hash, orig_sha1);27362737if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2738commit_ref_update(refs, lock, orig_sha1, logmsg, &err)) {2739error("unable to write current sha1 into%s:%s", newrefname, err.buf);2740strbuf_release(&err);2741goto rollback;2742}27432744 ret =0;2745goto out;27462747 rollback:2748 lock =lock_ref_sha1_basic(refs, oldrefname, NULL, NULL, NULL,2749 REF_NODEREF, NULL, &err);2750if(!lock) {2751error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2752strbuf_release(&err);2753goto rollbacklog;2754}27552756 flag = log_all_ref_updates;2757 log_all_ref_updates = LOG_REFS_NONE;2758if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2759commit_ref_update(refs, lock, orig_sha1, NULL, &err)) {2760error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2761strbuf_release(&err);2762}2763 log_all_ref_updates = flag;27642765 rollbacklog:2766if(logmoved &&rename(sb_newref.buf, sb_oldref.buf))2767error("unable to restore logfile%sfrom%s:%s",2768 oldrefname, newrefname,strerror(errno));2769if(!logmoved && log &&2770rename(tmp_renamed_log.buf, sb_oldref.buf))2771error("unable to restore logfile%sfrom logs/"TMP_RENAMED_LOG":%s",2772 oldrefname,strerror(errno));2773 ret =1;2774 out:2775strbuf_release(&sb_newref);2776strbuf_release(&sb_oldref);2777strbuf_release(&tmp_renamed_log);27782779return ret;2780}27812782static intclose_ref(struct ref_lock *lock)2783{2784if(close_lock_file(lock->lk))2785return-1;2786return0;2787}27882789static intcommit_ref(struct ref_lock *lock)2790{2791char*path =get_locked_file_path(lock->lk);2792struct stat st;27932794if(!lstat(path, &st) &&S_ISDIR(st.st_mode)) {2795/*2796 * There is a directory at the path we want to rename2797 * the lockfile to. Hopefully it is empty; try to2798 * delete it.2799 */2800size_t len =strlen(path);2801struct strbuf sb_path = STRBUF_INIT;28022803strbuf_attach(&sb_path, path, len, len);28042805/*2806 * If this fails, commit_lock_file() will also fail2807 * and will report the problem.2808 */2809remove_empty_directories(&sb_path);2810strbuf_release(&sb_path);2811}else{2812free(path);2813}28142815if(commit_lock_file(lock->lk))2816return-1;2817return0;2818}28192820static intopen_or_create_logfile(const char*path,void*cb)2821{2822int*fd = cb;28232824*fd =open(path, O_APPEND | O_WRONLY | O_CREAT,0666);2825return(*fd <0) ? -1:0;2826}28272828/*2829 * Create a reflog for a ref. If force_create = 0, only create the2830 * reflog for certain refs (those for which should_autocreate_reflog2831 * returns non-zero). Otherwise, create it regardless of the reference2832 * name. If the logfile already existed or was created, return 0 and2833 * set *logfd to the file descriptor opened for appending to the file.2834 * If no logfile exists and we decided not to create one, return 0 and2835 * set *logfd to -1. On failure, fill in *err, set *logfd to -1, and2836 * return -1.2837 */2838static intlog_ref_setup(struct files_ref_store *refs,2839const char*refname,int force_create,2840int*logfd,struct strbuf *err)2841{2842struct strbuf logfile_sb = STRBUF_INIT;2843char*logfile;28442845files_reflog_path(refs, &logfile_sb, refname);2846 logfile =strbuf_detach(&logfile_sb, NULL);28472848if(force_create ||should_autocreate_reflog(refname)) {2849if(raceproof_create_file(logfile, open_or_create_logfile, logfd)) {2850if(errno == ENOENT)2851strbuf_addf(err,"unable to create directory for '%s': "2852"%s", logfile,strerror(errno));2853else if(errno == EISDIR)2854strbuf_addf(err,"there are still logs under '%s'",2855 logfile);2856else2857strbuf_addf(err,"unable to append to '%s':%s",2858 logfile,strerror(errno));28592860goto error;2861}2862}else{2863*logfd =open(logfile, O_APPEND | O_WRONLY,0666);2864if(*logfd <0) {2865if(errno == ENOENT || errno == EISDIR) {2866/*2867 * The logfile doesn't already exist,2868 * but that is not an error; it only2869 * means that we won't write log2870 * entries to it.2871 */2872;2873}else{2874strbuf_addf(err,"unable to append to '%s':%s",2875 logfile,strerror(errno));2876goto error;2877}2878}2879}28802881if(*logfd >=0)2882adjust_shared_perm(logfile);28832884free(logfile);2885return0;28862887error:2888free(logfile);2889return-1;2890}28912892static intfiles_create_reflog(struct ref_store *ref_store,2893const char*refname,int force_create,2894struct strbuf *err)2895{2896struct files_ref_store *refs =2897files_downcast(ref_store, REF_STORE_WRITE,"create_reflog");2898int fd;28992900if(log_ref_setup(refs, refname, force_create, &fd, err))2901return-1;29022903if(fd >=0)2904close(fd);29052906return0;2907}29082909static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2910const unsigned char*new_sha1,2911const char*committer,const char*msg)2912{2913int msglen, written;2914unsigned maxlen, len;2915char*logrec;29162917 msglen = msg ?strlen(msg) :0;2918 maxlen =strlen(committer) + msglen +100;2919 logrec =xmalloc(maxlen);2920 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2921sha1_to_hex(old_sha1),2922sha1_to_hex(new_sha1),2923 committer);2924if(msglen)2925 len +=copy_reflog_msg(logrec + len -1, msg) -1;29262927 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2928free(logrec);2929if(written != len)2930return-1;29312932return0;2933}29342935static intfiles_log_ref_write(struct files_ref_store *refs,2936const char*refname,const unsigned char*old_sha1,2937const unsigned char*new_sha1,const char*msg,2938int flags,struct strbuf *err)2939{2940int logfd, result;29412942if(log_all_ref_updates == LOG_REFS_UNSET)2943 log_all_ref_updates =is_bare_repository() ? LOG_REFS_NONE : LOG_REFS_NORMAL;29442945 result =log_ref_setup(refs, refname,2946 flags & REF_FORCE_CREATE_REFLOG,2947&logfd, err);29482949if(result)2950return result;29512952if(logfd <0)2953return0;2954 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2955git_committer_info(0), msg);2956if(result) {2957struct strbuf sb = STRBUF_INIT;2958int save_errno = errno;29592960files_reflog_path(refs, &sb, refname);2961strbuf_addf(err,"unable to append to '%s':%s",2962 sb.buf,strerror(save_errno));2963strbuf_release(&sb);2964close(logfd);2965return-1;2966}2967if(close(logfd)) {2968struct strbuf sb = STRBUF_INIT;2969int save_errno = errno;29702971files_reflog_path(refs, &sb, refname);2972strbuf_addf(err,"unable to append to '%s':%s",2973 sb.buf,strerror(save_errno));2974strbuf_release(&sb);2975return-1;2976}2977return0;2978}29792980/*2981 * Write sha1 into the open lockfile, then close the lockfile. On2982 * errors, rollback the lockfile, fill in *err and2983 * return -1.2984 */2985static intwrite_ref_to_lockfile(struct ref_lock *lock,2986const unsigned char*sha1,struct strbuf *err)2987{2988static char term ='\n';2989struct object *o;2990int fd;29912992 o =parse_object(sha1);2993if(!o) {2994strbuf_addf(err,2995"trying to write ref '%s' with nonexistent object%s",2996 lock->ref_name,sha1_to_hex(sha1));2997unlock_ref(lock);2998return-1;2999}3000if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {3001strbuf_addf(err,3002"trying to write non-commit object%sto branch '%s'",3003sha1_to_hex(sha1), lock->ref_name);3004unlock_ref(lock);3005return-1;3006}3007 fd =get_lock_file_fd(lock->lk);3008if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||3009write_in_full(fd, &term,1) !=1||3010close_ref(lock) <0) {3011strbuf_addf(err,3012"couldn't write '%s'",get_lock_file_path(lock->lk));3013unlock_ref(lock);3014return-1;3015}3016return0;3017}30183019/*3020 * Commit a change to a loose reference that has already been written3021 * to the loose reference lockfile. Also update the reflogs if3022 * necessary, using the specified lockmsg (which can be NULL).3023 */3024static intcommit_ref_update(struct files_ref_store *refs,3025struct ref_lock *lock,3026const unsigned char*sha1,const char*logmsg,3027struct strbuf *err)3028{3029files_assert_main_repository(refs,"commit_ref_update");30303031clear_loose_ref_cache(refs);3032if(files_log_ref_write(refs, lock->ref_name,3033 lock->old_oid.hash, sha1,3034 logmsg,0, err)) {3035char*old_msg =strbuf_detach(err, NULL);3036strbuf_addf(err,"cannot update the ref '%s':%s",3037 lock->ref_name, old_msg);3038free(old_msg);3039unlock_ref(lock);3040return-1;3041}30423043if(strcmp(lock->ref_name,"HEAD") !=0) {3044/*3045 * Special hack: If a branch is updated directly and HEAD3046 * points to it (may happen on the remote side of a push3047 * for example) then logically the HEAD reflog should be3048 * updated too.3049 * A generic solution implies reverse symref information,3050 * but finding all symrefs pointing to the given branch3051 * would be rather costly for this rare event (the direct3052 * update of a branch) to be worth it. So let's cheat and3053 * check with HEAD only which should cover 99% of all usage3054 * scenarios (even 100% of the default ones).3055 */3056unsigned char head_sha1[20];3057int head_flag;3058const char*head_ref;30593060 head_ref =refs_resolve_ref_unsafe(&refs->base,"HEAD",3061 RESOLVE_REF_READING,3062 head_sha1, &head_flag);3063if(head_ref && (head_flag & REF_ISSYMREF) &&3064!strcmp(head_ref, lock->ref_name)) {3065struct strbuf log_err = STRBUF_INIT;3066if(files_log_ref_write(refs,"HEAD",3067 lock->old_oid.hash, sha1,3068 logmsg,0, &log_err)) {3069error("%s", log_err.buf);3070strbuf_release(&log_err);3071}3072}3073}30743075if(commit_ref(lock)) {3076strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3077unlock_ref(lock);3078return-1;3079}30803081unlock_ref(lock);3082return0;3083}30843085static intcreate_ref_symlink(struct ref_lock *lock,const char*target)3086{3087int ret = -1;3088#ifndef NO_SYMLINK_HEAD3089char*ref_path =get_locked_file_path(lock->lk);3090unlink(ref_path);3091 ret =symlink(target, ref_path);3092free(ref_path);30933094if(ret)3095fprintf(stderr,"no symlink - falling back to symbolic ref\n");3096#endif3097return ret;3098}30993100static voidupdate_symref_reflog(struct files_ref_store *refs,3101struct ref_lock *lock,const char*refname,3102const char*target,const char*logmsg)3103{3104struct strbuf err = STRBUF_INIT;3105unsigned char new_sha1[20];3106if(logmsg &&3107!refs_read_ref_full(&refs->base, target,3108 RESOLVE_REF_READING, new_sha1, NULL) &&3109files_log_ref_write(refs, refname, lock->old_oid.hash,3110 new_sha1, logmsg,0, &err)) {3111error("%s", err.buf);3112strbuf_release(&err);3113}3114}31153116static intcreate_symref_locked(struct files_ref_store *refs,3117struct ref_lock *lock,const char*refname,3118const char*target,const char*logmsg)3119{3120if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {3121update_symref_reflog(refs, lock, refname, target, logmsg);3122return0;3123}31243125if(!fdopen_lock_file(lock->lk,"w"))3126returnerror("unable to fdopen%s:%s",3127 lock->lk->tempfile.filename.buf,strerror(errno));31283129update_symref_reflog(refs, lock, refname, target, logmsg);31303131/* no error check; commit_ref will check ferror */3132fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);3133if(commit_ref(lock) <0)3134returnerror("unable to write symref for%s:%s", refname,3135strerror(errno));3136return0;3137}31383139static intfiles_create_symref(struct ref_store *ref_store,3140const char*refname,const char*target,3141const char*logmsg)3142{3143struct files_ref_store *refs =3144files_downcast(ref_store, REF_STORE_WRITE,"create_symref");3145struct strbuf err = STRBUF_INIT;3146struct ref_lock *lock;3147int ret;31483149 lock =lock_ref_sha1_basic(refs, refname, NULL,3150 NULL, NULL, REF_NODEREF, NULL,3151&err);3152if(!lock) {3153error("%s", err.buf);3154strbuf_release(&err);3155return-1;3156}31573158 ret =create_symref_locked(refs, lock, refname, target, logmsg);3159unlock_ref(lock);3160return ret;3161}31623163intset_worktree_head_symref(const char*gitdir,const char*target,const char*logmsg)3164{3165/*3166 * FIXME: this obviously will not work well for future refs3167 * backends. This function needs to die.3168 */3169struct files_ref_store *refs =3170files_downcast(get_main_ref_store(),3171 REF_STORE_WRITE,3172"set_head_symref");31733174static struct lock_file head_lock;3175struct ref_lock *lock;3176struct strbuf head_path = STRBUF_INIT;3177const char*head_rel;3178int ret;31793180strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));3181if(hold_lock_file_for_update(&head_lock, head_path.buf,3182 LOCK_NO_DEREF) <0) {3183struct strbuf err = STRBUF_INIT;3184unable_to_lock_message(head_path.buf, errno, &err);3185error("%s", err.buf);3186strbuf_release(&err);3187strbuf_release(&head_path);3188return-1;3189}31903191/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3192 linked trees */3193 head_rel =remove_leading_path(head_path.buf,3194absolute_path(get_git_common_dir()));3195/* to make use of create_symref_locked(), initialize ref_lock */3196 lock =xcalloc(1,sizeof(struct ref_lock));3197 lock->lk = &head_lock;3198 lock->ref_name =xstrdup(head_rel);31993200 ret =create_symref_locked(refs, lock, head_rel, target, logmsg);32013202unlock_ref(lock);/* will free lock */3203strbuf_release(&head_path);3204return ret;3205}32063207static intfiles_reflog_exists(struct ref_store *ref_store,3208const char*refname)3209{3210struct files_ref_store *refs =3211files_downcast(ref_store, REF_STORE_READ,"reflog_exists");3212struct strbuf sb = STRBUF_INIT;3213struct stat st;3214int ret;32153216files_reflog_path(refs, &sb, refname);3217 ret = !lstat(sb.buf, &st) &&S_ISREG(st.st_mode);3218strbuf_release(&sb);3219return ret;3220}32213222static intfiles_delete_reflog(struct ref_store *ref_store,3223const char*refname)3224{3225struct files_ref_store *refs =3226files_downcast(ref_store, REF_STORE_WRITE,"delete_reflog");3227struct strbuf sb = STRBUF_INIT;3228int ret;32293230files_reflog_path(refs, &sb, refname);3231 ret =remove_path(sb.buf);3232strbuf_release(&sb);3233return ret;3234}32353236static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3237{3238struct object_id ooid, noid;3239char*email_end, *message;3240unsigned long timestamp;3241int tz;3242const char*p = sb->buf;32433244/* old SP new SP name <email> SP time TAB msg LF */3245if(!sb->len || sb->buf[sb->len -1] !='\n'||3246parse_oid_hex(p, &ooid, &p) || *p++ !=' '||3247parse_oid_hex(p, &noid, &p) || *p++ !=' '||3248!(email_end =strchr(p,'>')) ||3249 email_end[1] !=' '||3250!(timestamp =strtoul(email_end +2, &message,10)) ||3251!message || message[0] !=' '||3252(message[1] !='+'&& message[1] !='-') ||3253!isdigit(message[2]) || !isdigit(message[3]) ||3254!isdigit(message[4]) || !isdigit(message[5]))3255return0;/* corrupt? */3256 email_end[1] ='\0';3257 tz =strtol(message +1, NULL,10);3258if(message[6] !='\t')3259 message +=6;3260else3261 message +=7;3262returnfn(&ooid, &noid, p, timestamp, tz, message, cb_data);3263}32643265static char*find_beginning_of_line(char*bob,char*scan)3266{3267while(bob < scan && *(--scan) !='\n')3268;/* keep scanning backwards */3269/*3270 * Return either beginning of the buffer, or LF at the end of3271 * the previous line.3272 */3273return scan;3274}32753276static intfiles_for_each_reflog_ent_reverse(struct ref_store *ref_store,3277const char*refname,3278 each_reflog_ent_fn fn,3279void*cb_data)3280{3281struct files_ref_store *refs =3282files_downcast(ref_store, REF_STORE_READ,3283"for_each_reflog_ent_reverse");3284struct strbuf sb = STRBUF_INIT;3285FILE*logfp;3286long pos;3287int ret =0, at_tail =1;32883289files_reflog_path(refs, &sb, refname);3290 logfp =fopen(sb.buf,"r");3291strbuf_release(&sb);3292if(!logfp)3293return-1;32943295/* Jump to the end */3296if(fseek(logfp,0, SEEK_END) <0)3297returnerror("cannot seek back reflog for%s:%s",3298 refname,strerror(errno));3299 pos =ftell(logfp);3300while(!ret &&0< pos) {3301int cnt;3302size_t nread;3303char buf[BUFSIZ];3304char*endp, *scanp;33053306/* Fill next block from the end */3307 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3308if(fseek(logfp, pos - cnt, SEEK_SET))3309returnerror("cannot seek back reflog for%s:%s",3310 refname,strerror(errno));3311 nread =fread(buf, cnt,1, logfp);3312if(nread !=1)3313returnerror("cannot read%dbytes from reflog for%s:%s",3314 cnt, refname,strerror(errno));3315 pos -= cnt;33163317 scanp = endp = buf + cnt;3318if(at_tail && scanp[-1] =='\n')3319/* Looking at the final LF at the end of the file */3320 scanp--;3321 at_tail =0;33223323while(buf < scanp) {3324/*3325 * terminating LF of the previous line, or the beginning3326 * of the buffer.3327 */3328char*bp;33293330 bp =find_beginning_of_line(buf, scanp);33313332if(*bp =='\n') {3333/*3334 * The newline is the end of the previous line,3335 * so we know we have complete line starting3336 * at (bp + 1). Prefix it onto any prior data3337 * we collected for the line and process it.3338 */3339strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3340 scanp = bp;3341 endp = bp +1;3342 ret =show_one_reflog_ent(&sb, fn, cb_data);3343strbuf_reset(&sb);3344if(ret)3345break;3346}else if(!pos) {3347/*3348 * We are at the start of the buffer, and the3349 * start of the file; there is no previous3350 * line, and we have everything for this one.3351 * Process it, and we can end the loop.3352 */3353strbuf_splice(&sb,0,0, buf, endp - buf);3354 ret =show_one_reflog_ent(&sb, fn, cb_data);3355strbuf_reset(&sb);3356break;3357}33583359if(bp == buf) {3360/*3361 * We are at the start of the buffer, and there3362 * is more file to read backwards. Which means3363 * we are in the middle of a line. Note that we3364 * may get here even if *bp was a newline; that3365 * just means we are at the exact end of the3366 * previous line, rather than some spot in the3367 * middle.3368 *3369 * Save away what we have to be combined with3370 * the data from the next read.3371 */3372strbuf_splice(&sb,0,0, buf, endp - buf);3373break;3374}3375}33763377}3378if(!ret && sb.len)3379die("BUG: reverse reflog parser had leftover data");33803381fclose(logfp);3382strbuf_release(&sb);3383return ret;3384}33853386static intfiles_for_each_reflog_ent(struct ref_store *ref_store,3387const char*refname,3388 each_reflog_ent_fn fn,void*cb_data)3389{3390struct files_ref_store *refs =3391files_downcast(ref_store, REF_STORE_READ,3392"for_each_reflog_ent");3393FILE*logfp;3394struct strbuf sb = STRBUF_INIT;3395int ret =0;33963397files_reflog_path(refs, &sb, refname);3398 logfp =fopen(sb.buf,"r");3399strbuf_release(&sb);3400if(!logfp)3401return-1;34023403while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3404 ret =show_one_reflog_ent(&sb, fn, cb_data);3405fclose(logfp);3406strbuf_release(&sb);3407return ret;3408}34093410struct files_reflog_iterator {3411struct ref_iterator base;34123413struct ref_store *ref_store;3414struct dir_iterator *dir_iterator;3415struct object_id oid;3416};34173418static intfiles_reflog_iterator_advance(struct ref_iterator *ref_iterator)3419{3420struct files_reflog_iterator *iter =3421(struct files_reflog_iterator *)ref_iterator;3422struct dir_iterator *diter = iter->dir_iterator;3423int ok;34243425while((ok =dir_iterator_advance(diter)) == ITER_OK) {3426int flags;34273428if(!S_ISREG(diter->st.st_mode))3429continue;3430if(diter->basename[0] =='.')3431continue;3432if(ends_with(diter->basename,".lock"))3433continue;34343435if(refs_read_ref_full(iter->ref_store,3436 diter->relative_path,0,3437 iter->oid.hash, &flags)) {3438error("bad ref for%s", diter->path.buf);3439continue;3440}34413442 iter->base.refname = diter->relative_path;3443 iter->base.oid = &iter->oid;3444 iter->base.flags = flags;3445return ITER_OK;3446}34473448 iter->dir_iterator = NULL;3449if(ref_iterator_abort(ref_iterator) == ITER_ERROR)3450 ok = ITER_ERROR;3451return ok;3452}34533454static intfiles_reflog_iterator_peel(struct ref_iterator *ref_iterator,3455struct object_id *peeled)3456{3457die("BUG: ref_iterator_peel() called for reflog_iterator");3458}34593460static intfiles_reflog_iterator_abort(struct ref_iterator *ref_iterator)3461{3462struct files_reflog_iterator *iter =3463(struct files_reflog_iterator *)ref_iterator;3464int ok = ITER_DONE;34653466if(iter->dir_iterator)3467 ok =dir_iterator_abort(iter->dir_iterator);34683469base_ref_iterator_free(ref_iterator);3470return ok;3471}34723473static struct ref_iterator_vtable files_reflog_iterator_vtable = {3474 files_reflog_iterator_advance,3475 files_reflog_iterator_peel,3476 files_reflog_iterator_abort3477};34783479static struct ref_iterator *files_reflog_iterator_begin(struct ref_store *ref_store)3480{3481struct files_ref_store *refs =3482files_downcast(ref_store, REF_STORE_READ,3483"reflog_iterator_begin");3484struct files_reflog_iterator *iter =xcalloc(1,sizeof(*iter));3485struct ref_iterator *ref_iterator = &iter->base;3486struct strbuf sb = STRBUF_INIT;34873488base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);3489files_reflog_path(refs, &sb, NULL);3490 iter->dir_iterator =dir_iterator_begin(sb.buf);3491 iter->ref_store = ref_store;3492strbuf_release(&sb);3493return ref_iterator;3494}34953496static intref_update_reject_duplicates(struct string_list *refnames,3497struct strbuf *err)3498{3499int i, n = refnames->nr;35003501assert(err);35023503for(i =1; i < n; i++)3504if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3505strbuf_addf(err,3506"multiple updates for ref '%s' not allowed.",3507 refnames->items[i].string);3508return1;3509}3510return0;3511}35123513/*3514 * If update is a direct update of head_ref (the reference pointed to3515 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3516 */3517static intsplit_head_update(struct ref_update *update,3518struct ref_transaction *transaction,3519const char*head_ref,3520struct string_list *affected_refnames,3521struct strbuf *err)3522{3523struct string_list_item *item;3524struct ref_update *new_update;35253526if((update->flags & REF_LOG_ONLY) ||3527(update->flags & REF_ISPRUNING) ||3528(update->flags & REF_UPDATE_VIA_HEAD))3529return0;35303531if(strcmp(update->refname, head_ref))3532return0;35333534/*3535 * First make sure that HEAD is not already in the3536 * transaction. This insertion is O(N) in the transaction3537 * size, but it happens at most once per transaction.3538 */3539 item =string_list_insert(affected_refnames,"HEAD");3540if(item->util) {3541/* An entry already existed */3542strbuf_addf(err,3543"multiple updates for 'HEAD' (including one "3544"via its referent '%s') are not allowed",3545 update->refname);3546return TRANSACTION_NAME_CONFLICT;3547}35483549 new_update =ref_transaction_add_update(3550 transaction,"HEAD",3551 update->flags | REF_LOG_ONLY | REF_NODEREF,3552 update->new_sha1, update->old_sha1,3553 update->msg);35543555 item->util = new_update;35563557return0;3558}35593560/*3561 * update is for a symref that points at referent and doesn't have3562 * REF_NODEREF set. Split it into two updates:3563 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3564 * - A new, separate update for the referent reference3565 * Note that the new update will itself be subject to splitting when3566 * the iteration gets to it.3567 */3568static intsplit_symref_update(struct files_ref_store *refs,3569struct ref_update *update,3570const char*referent,3571struct ref_transaction *transaction,3572struct string_list *affected_refnames,3573struct strbuf *err)3574{3575struct string_list_item *item;3576struct ref_update *new_update;3577unsigned int new_flags;35783579/*3580 * First make sure that referent is not already in the3581 * transaction. This insertion is O(N) in the transaction3582 * size, but it happens at most once per symref in a3583 * transaction.3584 */3585 item =string_list_insert(affected_refnames, referent);3586if(item->util) {3587/* An entry already existed */3588strbuf_addf(err,3589"multiple updates for '%s' (including one "3590"via symref '%s') are not allowed",3591 referent, update->refname);3592return TRANSACTION_NAME_CONFLICT;3593}35943595 new_flags = update->flags;3596if(!strcmp(update->refname,"HEAD")) {3597/*3598 * Record that the new update came via HEAD, so that3599 * when we process it, split_head_update() doesn't try3600 * to add another reflog update for HEAD. Note that3601 * this bit will be propagated if the new_update3602 * itself needs to be split.3603 */3604 new_flags |= REF_UPDATE_VIA_HEAD;3605}36063607 new_update =ref_transaction_add_update(3608 transaction, referent, new_flags,3609 update->new_sha1, update->old_sha1,3610 update->msg);36113612 new_update->parent_update = update;36133614/*3615 * Change the symbolic ref update to log only. Also, it3616 * doesn't need to check its old SHA-1 value, as that will be3617 * done when new_update is processed.3618 */3619 update->flags |= REF_LOG_ONLY | REF_NODEREF;3620 update->flags &= ~REF_HAVE_OLD;36213622 item->util = new_update;36233624return0;3625}36263627/*3628 * Return the refname under which update was originally requested.3629 */3630static const char*original_update_refname(struct ref_update *update)3631{3632while(update->parent_update)3633 update = update->parent_update;36343635return update->refname;3636}36373638/*3639 * Check whether the REF_HAVE_OLD and old_oid values stored in update3640 * are consistent with oid, which is the reference's current value. If3641 * everything is OK, return 0; otherwise, write an error message to3642 * err and return -1.3643 */3644static intcheck_old_oid(struct ref_update *update,struct object_id *oid,3645struct strbuf *err)3646{3647if(!(update->flags & REF_HAVE_OLD) ||3648!hashcmp(oid->hash, update->old_sha1))3649return0;36503651if(is_null_sha1(update->old_sha1))3652strbuf_addf(err,"cannot lock ref '%s': "3653"reference already exists",3654original_update_refname(update));3655else if(is_null_oid(oid))3656strbuf_addf(err,"cannot lock ref '%s': "3657"reference is missing but expected%s",3658original_update_refname(update),3659sha1_to_hex(update->old_sha1));3660else3661strbuf_addf(err,"cannot lock ref '%s': "3662"is at%sbut expected%s",3663original_update_refname(update),3664oid_to_hex(oid),3665sha1_to_hex(update->old_sha1));36663667return-1;3668}36693670/*3671 * Prepare for carrying out update:3672 * - Lock the reference referred to by update.3673 * - Read the reference under lock.3674 * - Check that its old SHA-1 value (if specified) is correct, and in3675 * any case record it in update->lock->old_oid for later use when3676 * writing the reflog.3677 * - If it is a symref update without REF_NODEREF, split it up into a3678 * REF_LOG_ONLY update of the symref and add a separate update for3679 * the referent to transaction.3680 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3681 * update of HEAD.3682 */3683static intlock_ref_for_update(struct files_ref_store *refs,3684struct ref_update *update,3685struct ref_transaction *transaction,3686const char*head_ref,3687struct string_list *affected_refnames,3688struct strbuf *err)3689{3690struct strbuf referent = STRBUF_INIT;3691int mustexist = (update->flags & REF_HAVE_OLD) &&3692!is_null_sha1(update->old_sha1);3693int ret;3694struct ref_lock *lock;36953696files_assert_main_repository(refs,"lock_ref_for_update");36973698if((update->flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1))3699 update->flags |= REF_DELETING;37003701if(head_ref) {3702 ret =split_head_update(update, transaction, head_ref,3703 affected_refnames, err);3704if(ret)3705return ret;3706}37073708 ret =lock_raw_ref(refs, update->refname, mustexist,3709 affected_refnames, NULL,3710&lock, &referent,3711&update->type, err);3712if(ret) {3713char*reason;37143715 reason =strbuf_detach(err, NULL);3716strbuf_addf(err,"cannot lock ref '%s':%s",3717original_update_refname(update), reason);3718free(reason);3719return ret;3720}37213722 update->backend_data = lock;37233724if(update->type & REF_ISSYMREF) {3725if(update->flags & REF_NODEREF) {3726/*3727 * We won't be reading the referent as part of3728 * the transaction, so we have to read it here3729 * to record and possibly check old_sha1:3730 */3731if(refs_read_ref_full(&refs->base,3732 referent.buf,0,3733 lock->old_oid.hash, NULL)) {3734if(update->flags & REF_HAVE_OLD) {3735strbuf_addf(err,"cannot lock ref '%s': "3736"error reading reference",3737original_update_refname(update));3738return-1;3739}3740}else if(check_old_oid(update, &lock->old_oid, err)) {3741return TRANSACTION_GENERIC_ERROR;3742}3743}else{3744/*3745 * Create a new update for the reference this3746 * symref is pointing at. Also, we will record3747 * and verify old_sha1 for this update as part3748 * of processing the split-off update, so we3749 * don't have to do it here.3750 */3751 ret =split_symref_update(refs, update,3752 referent.buf, transaction,3753 affected_refnames, err);3754if(ret)3755return ret;3756}3757}else{3758struct ref_update *parent_update;37593760if(check_old_oid(update, &lock->old_oid, err))3761return TRANSACTION_GENERIC_ERROR;37623763/*3764 * If this update is happening indirectly because of a3765 * symref update, record the old SHA-1 in the parent3766 * update:3767 */3768for(parent_update = update->parent_update;3769 parent_update;3770 parent_update = parent_update->parent_update) {3771struct ref_lock *parent_lock = parent_update->backend_data;3772oidcpy(&parent_lock->old_oid, &lock->old_oid);3773}3774}37753776if((update->flags & REF_HAVE_NEW) &&3777!(update->flags & REF_DELETING) &&3778!(update->flags & REF_LOG_ONLY)) {3779if(!(update->type & REF_ISSYMREF) &&3780!hashcmp(lock->old_oid.hash, update->new_sha1)) {3781/*3782 * The reference already has the desired3783 * value, so we don't need to write it.3784 */3785}else if(write_ref_to_lockfile(lock, update->new_sha1,3786 err)) {3787char*write_err =strbuf_detach(err, NULL);37883789/*3790 * The lock was freed upon failure of3791 * write_ref_to_lockfile():3792 */3793 update->backend_data = NULL;3794strbuf_addf(err,3795"cannot update ref '%s':%s",3796 update->refname, write_err);3797free(write_err);3798return TRANSACTION_GENERIC_ERROR;3799}else{3800 update->flags |= REF_NEEDS_COMMIT;3801}3802}3803if(!(update->flags & REF_NEEDS_COMMIT)) {3804/*3805 * We didn't call write_ref_to_lockfile(), so3806 * the lockfile is still open. Close it to3807 * free up the file descriptor:3808 */3809if(close_ref(lock)) {3810strbuf_addf(err,"couldn't close '%s.lock'",3811 update->refname);3812return TRANSACTION_GENERIC_ERROR;3813}3814}3815return0;3816}38173818static intfiles_transaction_commit(struct ref_store *ref_store,3819struct ref_transaction *transaction,3820struct strbuf *err)3821{3822struct files_ref_store *refs =3823files_downcast(ref_store, REF_STORE_WRITE,3824"ref_transaction_commit");3825int ret =0, i;3826struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3827struct string_list_item *ref_to_delete;3828struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3829char*head_ref = NULL;3830int head_type;3831struct object_id head_oid;3832struct strbuf sb = STRBUF_INIT;38333834assert(err);38353836if(transaction->state != REF_TRANSACTION_OPEN)3837die("BUG: commit called for transaction that is not open");38383839if(!transaction->nr) {3840 transaction->state = REF_TRANSACTION_CLOSED;3841return0;3842}38433844/*3845 * Fail if a refname appears more than once in the3846 * transaction. (If we end up splitting up any updates using3847 * split_symref_update() or split_head_update(), those3848 * functions will check that the new updates don't have the3849 * same refname as any existing ones.)3850 */3851for(i =0; i < transaction->nr; i++) {3852struct ref_update *update = transaction->updates[i];3853struct string_list_item *item =3854string_list_append(&affected_refnames, update->refname);38553856/*3857 * We store a pointer to update in item->util, but at3858 * the moment we never use the value of this field3859 * except to check whether it is non-NULL.3860 */3861 item->util = update;3862}3863string_list_sort(&affected_refnames);3864if(ref_update_reject_duplicates(&affected_refnames, err)) {3865 ret = TRANSACTION_GENERIC_ERROR;3866goto cleanup;3867}38683869/*3870 * Special hack: If a branch is updated directly and HEAD3871 * points to it (may happen on the remote side of a push3872 * for example) then logically the HEAD reflog should be3873 * updated too.3874 *3875 * A generic solution would require reverse symref lookups,3876 * but finding all symrefs pointing to a given branch would be3877 * rather costly for this rare event (the direct update of a3878 * branch) to be worth it. So let's cheat and check with HEAD3879 * only, which should cover 99% of all usage scenarios (even3880 * 100% of the default ones).3881 *3882 * So if HEAD is a symbolic reference, then record the name of3883 * the reference that it points to. If we see an update of3884 * head_ref within the transaction, then split_head_update()3885 * arranges for the reflog of HEAD to be updated, too.3886 */3887 head_ref =refs_resolve_refdup(ref_store,"HEAD",3888 RESOLVE_REF_NO_RECURSE,3889 head_oid.hash, &head_type);38903891if(head_ref && !(head_type & REF_ISSYMREF)) {3892free(head_ref);3893 head_ref = NULL;3894}38953896/*3897 * Acquire all locks, verify old values if provided, check3898 * that new values are valid, and write new values to the3899 * lockfiles, ready to be activated. Only keep one lockfile3900 * open at a time to avoid running out of file descriptors.3901 */3902for(i =0; i < transaction->nr; i++) {3903struct ref_update *update = transaction->updates[i];39043905 ret =lock_ref_for_update(refs, update, transaction,3906 head_ref, &affected_refnames, err);3907if(ret)3908goto cleanup;3909}39103911/* Perform updates first so live commits remain referenced */3912for(i =0; i < transaction->nr; i++) {3913struct ref_update *update = transaction->updates[i];3914struct ref_lock *lock = update->backend_data;39153916if(update->flags & REF_NEEDS_COMMIT ||3917 update->flags & REF_LOG_ONLY) {3918if(files_log_ref_write(refs,3919 lock->ref_name,3920 lock->old_oid.hash,3921 update->new_sha1,3922 update->msg, update->flags,3923 err)) {3924char*old_msg =strbuf_detach(err, NULL);39253926strbuf_addf(err,"cannot update the ref '%s':%s",3927 lock->ref_name, old_msg);3928free(old_msg);3929unlock_ref(lock);3930 update->backend_data = NULL;3931 ret = TRANSACTION_GENERIC_ERROR;3932goto cleanup;3933}3934}3935if(update->flags & REF_NEEDS_COMMIT) {3936clear_loose_ref_cache(refs);3937if(commit_ref(lock)) {3938strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3939unlock_ref(lock);3940 update->backend_data = NULL;3941 ret = TRANSACTION_GENERIC_ERROR;3942goto cleanup;3943}3944}3945}3946/* Perform deletes now that updates are safely completed */3947for(i =0; i < transaction->nr; i++) {3948struct ref_update *update = transaction->updates[i];3949struct ref_lock *lock = update->backend_data;39503951if(update->flags & REF_DELETING &&3952!(update->flags & REF_LOG_ONLY)) {3953if(!(update->type & REF_ISPACKED) ||3954 update->type & REF_ISSYMREF) {3955/* It is a loose reference. */3956strbuf_reset(&sb);3957files_ref_path(refs, &sb, lock->ref_name);3958if(unlink_or_msg(sb.buf, err)) {3959 ret = TRANSACTION_GENERIC_ERROR;3960goto cleanup;3961}3962 update->flags |= REF_DELETED_LOOSE;3963}39643965if(!(update->flags & REF_ISPRUNING))3966string_list_append(&refs_to_delete,3967 lock->ref_name);3968}3969}39703971if(repack_without_refs(refs, &refs_to_delete, err)) {3972 ret = TRANSACTION_GENERIC_ERROR;3973goto cleanup;3974}39753976/* Delete the reflogs of any references that were deleted: */3977for_each_string_list_item(ref_to_delete, &refs_to_delete) {3978strbuf_reset(&sb);3979files_reflog_path(refs, &sb, ref_to_delete->string);3980if(!unlink_or_warn(sb.buf))3981try_remove_empty_parents(refs, ref_to_delete->string,3982 REMOVE_EMPTY_PARENTS_REFLOG);3983}39843985clear_loose_ref_cache(refs);39863987cleanup:3988strbuf_release(&sb);3989 transaction->state = REF_TRANSACTION_CLOSED;39903991for(i =0; i < transaction->nr; i++) {3992struct ref_update *update = transaction->updates[i];3993struct ref_lock *lock = update->backend_data;39943995if(lock)3996unlock_ref(lock);39973998if(update->flags & REF_DELETED_LOOSE) {3999/*4000 * The loose reference was deleted. Delete any4001 * empty parent directories. (Note that this4002 * can only work because we have already4003 * removed the lockfile.)4004 */4005try_remove_empty_parents(refs, update->refname,4006 REMOVE_EMPTY_PARENTS_REF);4007}4008}40094010string_list_clear(&refs_to_delete,0);4011free(head_ref);4012string_list_clear(&affected_refnames,0);40134014return ret;4015}40164017static intref_present(const char*refname,4018const struct object_id *oid,int flags,void*cb_data)4019{4020struct string_list *affected_refnames = cb_data;40214022returnstring_list_has_string(affected_refnames, refname);4023}40244025static intfiles_initial_transaction_commit(struct ref_store *ref_store,4026struct ref_transaction *transaction,4027struct strbuf *err)4028{4029struct files_ref_store *refs =4030files_downcast(ref_store, REF_STORE_WRITE,4031"initial_ref_transaction_commit");4032int ret =0, i;4033struct string_list affected_refnames = STRING_LIST_INIT_NODUP;40344035assert(err);40364037if(transaction->state != REF_TRANSACTION_OPEN)4038die("BUG: commit called for transaction that is not open");40394040/* Fail if a refname appears more than once in the transaction: */4041for(i =0; i < transaction->nr; i++)4042string_list_append(&affected_refnames,4043 transaction->updates[i]->refname);4044string_list_sort(&affected_refnames);4045if(ref_update_reject_duplicates(&affected_refnames, err)) {4046 ret = TRANSACTION_GENERIC_ERROR;4047goto cleanup;4048}40494050/*4051 * It's really undefined to call this function in an active4052 * repository or when there are existing references: we are4053 * only locking and changing packed-refs, so (1) any4054 * simultaneous processes might try to change a reference at4055 * the same time we do, and (2) any existing loose versions of4056 * the references that we are setting would have precedence4057 * over our values. But some remote helpers create the remote4058 * "HEAD" and "master" branches before calling this function,4059 * so here we really only check that none of the references4060 * that we are creating already exists.4061 */4062if(refs_for_each_rawref(&refs->base, ref_present,4063&affected_refnames))4064die("BUG: initial ref transaction called with existing refs");40654066for(i =0; i < transaction->nr; i++) {4067struct ref_update *update = transaction->updates[i];40684069if((update->flags & REF_HAVE_OLD) &&4070!is_null_sha1(update->old_sha1))4071die("BUG: initial ref transaction with old_sha1 set");4072if(refs_verify_refname_available(&refs->base, update->refname,4073&affected_refnames, NULL,4074 err)) {4075 ret = TRANSACTION_NAME_CONFLICT;4076goto cleanup;4077}4078}40794080if(lock_packed_refs(refs,0)) {4081strbuf_addf(err,"unable to lock packed-refs file:%s",4082strerror(errno));4083 ret = TRANSACTION_GENERIC_ERROR;4084goto cleanup;4085}40864087for(i =0; i < transaction->nr; i++) {4088struct ref_update *update = transaction->updates[i];40894090if((update->flags & REF_HAVE_NEW) &&4091!is_null_sha1(update->new_sha1))4092add_packed_ref(refs, update->refname, update->new_sha1);4093}40944095if(commit_packed_refs(refs)) {4096strbuf_addf(err,"unable to commit packed-refs file:%s",4097strerror(errno));4098 ret = TRANSACTION_GENERIC_ERROR;4099goto cleanup;4100}41014102cleanup:4103 transaction->state = REF_TRANSACTION_CLOSED;4104string_list_clear(&affected_refnames,0);4105return ret;4106}41074108struct expire_reflog_cb {4109unsigned int flags;4110 reflog_expiry_should_prune_fn *should_prune_fn;4111void*policy_cb;4112FILE*newlog;4113struct object_id last_kept_oid;4114};41154116static intexpire_reflog_ent(struct object_id *ooid,struct object_id *noid,4117const char*email,unsigned long timestamp,int tz,4118const char*message,void*cb_data)4119{4120struct expire_reflog_cb *cb = cb_data;4121struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;41224123if(cb->flags & EXPIRE_REFLOGS_REWRITE)4124 ooid = &cb->last_kept_oid;41254126if((*cb->should_prune_fn)(ooid->hash, noid->hash, email, timestamp, tz,4127 message, policy_cb)) {4128if(!cb->newlog)4129printf("would prune%s", message);4130else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4131printf("prune%s", message);4132}else{4133if(cb->newlog) {4134fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",4135oid_to_hex(ooid),oid_to_hex(noid),4136 email, timestamp, tz, message);4137oidcpy(&cb->last_kept_oid, noid);4138}4139if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4140printf("keep%s", message);4141}4142return0;4143}41444145static intfiles_reflog_expire(struct ref_store *ref_store,4146const char*refname,const unsigned char*sha1,4147unsigned int flags,4148 reflog_expiry_prepare_fn prepare_fn,4149 reflog_expiry_should_prune_fn should_prune_fn,4150 reflog_expiry_cleanup_fn cleanup_fn,4151void*policy_cb_data)4152{4153struct files_ref_store *refs =4154files_downcast(ref_store, REF_STORE_WRITE,"reflog_expire");4155static struct lock_file reflog_lock;4156struct expire_reflog_cb cb;4157struct ref_lock *lock;4158struct strbuf log_file_sb = STRBUF_INIT;4159char*log_file;4160int status =0;4161int type;4162struct strbuf err = STRBUF_INIT;41634164memset(&cb,0,sizeof(cb));4165 cb.flags = flags;4166 cb.policy_cb = policy_cb_data;4167 cb.should_prune_fn = should_prune_fn;41684169/*4170 * The reflog file is locked by holding the lock on the4171 * reference itself, plus we might need to update the4172 * reference if --updateref was specified:4173 */4174 lock =lock_ref_sha1_basic(refs, refname, sha1,4175 NULL, NULL, REF_NODEREF,4176&type, &err);4177if(!lock) {4178error("cannot lock ref '%s':%s", refname, err.buf);4179strbuf_release(&err);4180return-1;4181}4182if(!refs_reflog_exists(ref_store, refname)) {4183unlock_ref(lock);4184return0;4185}41864187files_reflog_path(refs, &log_file_sb, refname);4188 log_file =strbuf_detach(&log_file_sb, NULL);4189if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4190/*4191 * Even though holding $GIT_DIR/logs/$reflog.lock has4192 * no locking implications, we use the lock_file4193 * machinery here anyway because it does a lot of the4194 * work we need, including cleaning up if the program4195 * exits unexpectedly.4196 */4197if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4198struct strbuf err = STRBUF_INIT;4199unable_to_lock_message(log_file, errno, &err);4200error("%s", err.buf);4201strbuf_release(&err);4202goto failure;4203}4204 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4205if(!cb.newlog) {4206error("cannot fdopen%s(%s)",4207get_lock_file_path(&reflog_lock),strerror(errno));4208goto failure;4209}4210}42114212(*prepare_fn)(refname, sha1, cb.policy_cb);4213refs_for_each_reflog_ent(ref_store, refname, expire_reflog_ent, &cb);4214(*cleanup_fn)(cb.policy_cb);42154216if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4217/*4218 * It doesn't make sense to adjust a reference pointed4219 * to by a symbolic ref based on expiring entries in4220 * the symbolic reference's reflog. Nor can we update4221 * a reference if there are no remaining reflog4222 * entries.4223 */4224int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4225!(type & REF_ISSYMREF) &&4226!is_null_oid(&cb.last_kept_oid);42274228if(close_lock_file(&reflog_lock)) {4229 status |=error("couldn't write%s:%s", log_file,4230strerror(errno));4231}else if(update &&4232(write_in_full(get_lock_file_fd(lock->lk),4233oid_to_hex(&cb.last_kept_oid), GIT_SHA1_HEXSZ) != GIT_SHA1_HEXSZ ||4234write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||4235close_ref(lock) <0)) {4236 status |=error("couldn't write%s",4237get_lock_file_path(lock->lk));4238rollback_lock_file(&reflog_lock);4239}else if(commit_lock_file(&reflog_lock)) {4240 status |=error("unable to write reflog '%s' (%s)",4241 log_file,strerror(errno));4242}else if(update &&commit_ref(lock)) {4243 status |=error("couldn't set%s", lock->ref_name);4244}4245}4246free(log_file);4247unlock_ref(lock);4248return status;42494250 failure:4251rollback_lock_file(&reflog_lock);4252free(log_file);4253unlock_ref(lock);4254return-1;4255}42564257static intfiles_init_db(struct ref_store *ref_store,struct strbuf *err)4258{4259struct files_ref_store *refs =4260files_downcast(ref_store, REF_STORE_WRITE,"init_db");4261struct strbuf sb = STRBUF_INIT;42624263/*4264 * Create .git/refs/{heads,tags}4265 */4266files_ref_path(refs, &sb,"refs/heads");4267safe_create_dir(sb.buf,1);42684269strbuf_reset(&sb);4270files_ref_path(refs, &sb,"refs/tags");4271safe_create_dir(sb.buf,1);42724273strbuf_release(&sb);4274return0;4275}42764277struct ref_storage_be refs_be_files = {4278 NULL,4279"files",4280 files_ref_store_create,4281 files_init_db,4282 files_transaction_commit,4283 files_initial_transaction_commit,42844285 files_pack_refs,4286 files_peel_ref,4287 files_create_symref,4288 files_delete_refs,4289 files_rename_ref,42904291 files_ref_iterator_begin,4292 files_read_raw_ref,4293 files_verify_refname_available,42944295 files_reflog_iterator_begin,4296 files_for_each_reflog_ent,4297 files_for_each_reflog_ent_reverse,4298 files_reflog_exists,4299 files_create_reflog,4300 files_delete_reflog,4301 files_reflog_expire4302};