1#include"../cache.h" 2#include"../refs.h" 3#include"refs-internal.h" 4#include"../lockfile.h" 5#include"../object.h" 6#include"../dir.h" 7 8struct ref_lock { 9char*ref_name; 10struct lock_file *lk; 11struct object_id old_oid; 12}; 13 14struct ref_entry; 15 16/* 17 * Information used (along with the information in ref_entry) to 18 * describe a single cached reference. This data structure only 19 * occurs embedded in a union in struct ref_entry, and only when 20 * (ref_entry->flag & REF_DIR) is zero. 21 */ 22struct ref_value { 23/* 24 * The name of the object to which this reference resolves 25 * (which may be a tag object). If REF_ISBROKEN, this is 26 * null. If REF_ISSYMREF, then this is the name of the object 27 * referred to by the last reference in the symlink chain. 28 */ 29struct object_id oid; 30 31/* 32 * If REF_KNOWS_PEELED, then this field holds the peeled value 33 * of this reference, or null if the reference is known not to 34 * be peelable. See the documentation for peel_ref() for an 35 * exact definition of "peelable". 36 */ 37struct object_id peeled; 38}; 39 40struct ref_cache; 41 42/* 43 * Information used (along with the information in ref_entry) to 44 * describe a level in the hierarchy of references. This data 45 * structure only occurs embedded in a union in struct ref_entry, and 46 * only when (ref_entry.flag & REF_DIR) is set. In that case, 47 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 48 * in the directory have already been read: 49 * 50 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 51 * or packed references, already read. 52 * 53 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 54 * references that hasn't been read yet (nor has any of its 55 * subdirectories). 56 * 57 * Entries within a directory are stored within a growable array of 58 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 59 * sorted are sorted by their component name in strcmp() order and the 60 * remaining entries are unsorted. 61 * 62 * Loose references are read lazily, one directory at a time. When a 63 * directory of loose references is read, then all of the references 64 * in that directory are stored, and REF_INCOMPLETE stubs are created 65 * for any subdirectories, but the subdirectories themselves are not 66 * read. The reading is triggered by get_ref_dir(). 67 */ 68struct ref_dir { 69int nr, alloc; 70 71/* 72 * Entries with index 0 <= i < sorted are sorted by name. New 73 * entries are appended to the list unsorted, and are sorted 74 * only when required; thus we avoid the need to sort the list 75 * after the addition of every reference. 76 */ 77int sorted; 78 79/* A pointer to the ref_cache that contains this ref_dir. */ 80struct ref_cache *ref_cache; 81 82struct ref_entry **entries; 83}; 84 85/* 86 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 87 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 88 * public values; see refs.h. 89 */ 90 91/* 92 * The field ref_entry->u.value.peeled of this value entry contains 93 * the correct peeled value for the reference, which might be 94 * null_sha1 if the reference is not a tag or if it is broken. 95 */ 96#define REF_KNOWS_PEELED 0x10 97 98/* ref_entry represents a directory of references */ 99#define REF_DIR 0x20 100 101/* 102 * Entry has not yet been read from disk (used only for REF_DIR 103 * entries representing loose references) 104 */ 105#define REF_INCOMPLETE 0x40 106 107/* 108 * A ref_entry represents either a reference or a "subdirectory" of 109 * references. 110 * 111 * Each directory in the reference namespace is represented by a 112 * ref_entry with (flags & REF_DIR) set and containing a subdir member 113 * that holds the entries in that directory that have been read so 114 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 115 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 116 * used for loose reference directories. 117 * 118 * References are represented by a ref_entry with (flags & REF_DIR) 119 * unset and a value member that describes the reference's value. The 120 * flag member is at the ref_entry level, but it is also needed to 121 * interpret the contents of the value field (in other words, a 122 * ref_value object is not very much use without the enclosing 123 * ref_entry). 124 * 125 * Reference names cannot end with slash and directories' names are 126 * always stored with a trailing slash (except for the top-level 127 * directory, which is always denoted by ""). This has two nice 128 * consequences: (1) when the entries in each subdir are sorted 129 * lexicographically by name (as they usually are), the references in 130 * a whole tree can be generated in lexicographic order by traversing 131 * the tree in left-to-right, depth-first order; (2) the names of 132 * references and subdirectories cannot conflict, and therefore the 133 * presence of an empty subdirectory does not block the creation of a 134 * similarly-named reference. (The fact that reference names with the 135 * same leading components can conflict *with each other* is a 136 * separate issue that is regulated by verify_refname_available().) 137 * 138 * Please note that the name field contains the fully-qualified 139 * reference (or subdirectory) name. Space could be saved by only 140 * storing the relative names. But that would require the full names 141 * to be generated on the fly when iterating in do_for_each_ref(), and 142 * would break callback functions, who have always been able to assume 143 * that the name strings that they are passed will not be freed during 144 * the iteration. 145 */ 146struct ref_entry { 147unsigned char flag;/* ISSYMREF? ISPACKED? */ 148union{ 149struct ref_value value;/* if not (flags&REF_DIR) */ 150struct ref_dir subdir;/* if (flags&REF_DIR) */ 151} u; 152/* 153 * The full name of the reference (e.g., "refs/heads/master") 154 * or the full name of the directory with a trailing slash 155 * (e.g., "refs/heads/"): 156 */ 157char name[FLEX_ARRAY]; 158}; 159 160static voidread_loose_refs(const char*dirname,struct ref_dir *dir); 161static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len); 162static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 163const char*dirname,size_t len, 164int incomplete); 165static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry); 166 167static struct ref_dir *get_ref_dir(struct ref_entry *entry) 168{ 169struct ref_dir *dir; 170assert(entry->flag & REF_DIR); 171 dir = &entry->u.subdir; 172if(entry->flag & REF_INCOMPLETE) { 173read_loose_refs(entry->name, dir); 174 175/* 176 * Manually add refs/bisect, which, being 177 * per-worktree, might not appear in the directory 178 * listing for refs/ in the main repo. 179 */ 180if(!strcmp(entry->name,"refs/")) { 181int pos =search_ref_dir(dir,"refs/bisect/",12); 182if(pos <0) { 183struct ref_entry *child_entry; 184 child_entry =create_dir_entry(dir->ref_cache, 185"refs/bisect/", 18612,1); 187add_entry_to_dir(dir, child_entry); 188read_loose_refs("refs/bisect", 189&child_entry->u.subdir); 190} 191} 192 entry->flag &= ~REF_INCOMPLETE; 193} 194return dir; 195} 196 197static struct ref_entry *create_ref_entry(const char*refname, 198const unsigned char*sha1,int flag, 199int check_name) 200{ 201struct ref_entry *ref; 202 203if(check_name && 204check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 205die("Reference has invalid format: '%s'", refname); 206FLEX_ALLOC_STR(ref, name, refname); 207hashcpy(ref->u.value.oid.hash, sha1); 208oidclr(&ref->u.value.peeled); 209 ref->flag = flag; 210return ref; 211} 212 213static voidclear_ref_dir(struct ref_dir *dir); 214 215static voidfree_ref_entry(struct ref_entry *entry) 216{ 217if(entry->flag & REF_DIR) { 218/* 219 * Do not use get_ref_dir() here, as that might 220 * trigger the reading of loose refs. 221 */ 222clear_ref_dir(&entry->u.subdir); 223} 224free(entry); 225} 226 227/* 228 * Add a ref_entry to the end of dir (unsorted). Entry is always 229 * stored directly in dir; no recursion into subdirectories is 230 * done. 231 */ 232static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry) 233{ 234ALLOC_GROW(dir->entries, dir->nr +1, dir->alloc); 235 dir->entries[dir->nr++] = entry; 236/* optimize for the case that entries are added in order */ 237if(dir->nr ==1|| 238(dir->nr == dir->sorted +1&& 239strcmp(dir->entries[dir->nr -2]->name, 240 dir->entries[dir->nr -1]->name) <0)) 241 dir->sorted = dir->nr; 242} 243 244/* 245 * Clear and free all entries in dir, recursively. 246 */ 247static voidclear_ref_dir(struct ref_dir *dir) 248{ 249int i; 250for(i =0; i < dir->nr; i++) 251free_ref_entry(dir->entries[i]); 252free(dir->entries); 253 dir->sorted = dir->nr = dir->alloc =0; 254 dir->entries = NULL; 255} 256 257/* 258 * Create a struct ref_entry object for the specified dirname. 259 * dirname is the name of the directory with a trailing slash (e.g., 260 * "refs/heads/") or "" for the top-level directory. 261 */ 262static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 263const char*dirname,size_t len, 264int incomplete) 265{ 266struct ref_entry *direntry; 267FLEX_ALLOC_MEM(direntry, name, dirname, len); 268 direntry->u.subdir.ref_cache = ref_cache; 269 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE :0); 270return direntry; 271} 272 273static intref_entry_cmp(const void*a,const void*b) 274{ 275struct ref_entry *one = *(struct ref_entry **)a; 276struct ref_entry *two = *(struct ref_entry **)b; 277returnstrcmp(one->name, two->name); 278} 279 280static voidsort_ref_dir(struct ref_dir *dir); 281 282struct string_slice { 283size_t len; 284const char*str; 285}; 286 287static intref_entry_cmp_sslice(const void*key_,const void*ent_) 288{ 289const struct string_slice *key = key_; 290const struct ref_entry *ent = *(const struct ref_entry *const*)ent_; 291int cmp =strncmp(key->str, ent->name, key->len); 292if(cmp) 293return cmp; 294return'\0'- (unsigned char)ent->name[key->len]; 295} 296 297/* 298 * Return the index of the entry with the given refname from the 299 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 300 * no such entry is found. dir must already be complete. 301 */ 302static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len) 303{ 304struct ref_entry **r; 305struct string_slice key; 306 307if(refname == NULL || !dir->nr) 308return-1; 309 310sort_ref_dir(dir); 311 key.len = len; 312 key.str = refname; 313 r =bsearch(&key, dir->entries, dir->nr,sizeof(*dir->entries), 314 ref_entry_cmp_sslice); 315 316if(r == NULL) 317return-1; 318 319return r - dir->entries; 320} 321 322/* 323 * Search for a directory entry directly within dir (without 324 * recursing). Sort dir if necessary. subdirname must be a directory 325 * name (i.e., end in '/'). If mkdir is set, then create the 326 * directory if it is missing; otherwise, return NULL if the desired 327 * directory cannot be found. dir must already be complete. 328 */ 329static struct ref_dir *search_for_subdir(struct ref_dir *dir, 330const char*subdirname,size_t len, 331int mkdir) 332{ 333int entry_index =search_ref_dir(dir, subdirname, len); 334struct ref_entry *entry; 335if(entry_index == -1) { 336if(!mkdir) 337return NULL; 338/* 339 * Since dir is complete, the absence of a subdir 340 * means that the subdir really doesn't exist; 341 * therefore, create an empty record for it but mark 342 * the record complete. 343 */ 344 entry =create_dir_entry(dir->ref_cache, subdirname, len,0); 345add_entry_to_dir(dir, entry); 346}else{ 347 entry = dir->entries[entry_index]; 348} 349returnget_ref_dir(entry); 350} 351 352/* 353 * If refname is a reference name, find the ref_dir within the dir 354 * tree that should hold refname. If refname is a directory name 355 * (i.e., ends in '/'), then return that ref_dir itself. dir must 356 * represent the top-level directory and must already be complete. 357 * Sort ref_dirs and recurse into subdirectories as necessary. If 358 * mkdir is set, then create any missing directories; otherwise, 359 * return NULL if the desired directory cannot be found. 360 */ 361static struct ref_dir *find_containing_dir(struct ref_dir *dir, 362const char*refname,int mkdir) 363{ 364const char*slash; 365for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 366size_t dirnamelen = slash - refname +1; 367struct ref_dir *subdir; 368 subdir =search_for_subdir(dir, refname, dirnamelen, mkdir); 369if(!subdir) { 370 dir = NULL; 371break; 372} 373 dir = subdir; 374} 375 376return dir; 377} 378 379/* 380 * Find the value entry with the given name in dir, sorting ref_dirs 381 * and recursing into subdirectories as necessary. If the name is not 382 * found or it corresponds to a directory entry, return NULL. 383 */ 384static struct ref_entry *find_ref(struct ref_dir *dir,const char*refname) 385{ 386int entry_index; 387struct ref_entry *entry; 388 dir =find_containing_dir(dir, refname,0); 389if(!dir) 390return NULL; 391 entry_index =search_ref_dir(dir, refname,strlen(refname)); 392if(entry_index == -1) 393return NULL; 394 entry = dir->entries[entry_index]; 395return(entry->flag & REF_DIR) ? NULL : entry; 396} 397 398/* 399 * Remove the entry with the given name from dir, recursing into 400 * subdirectories as necessary. If refname is the name of a directory 401 * (i.e., ends with '/'), then remove the directory and its contents. 402 * If the removal was successful, return the number of entries 403 * remaining in the directory entry that contained the deleted entry. 404 * If the name was not found, return -1. Please note that this 405 * function only deletes the entry from the cache; it does not delete 406 * it from the filesystem or ensure that other cache entries (which 407 * might be symbolic references to the removed entry) are updated. 408 * Nor does it remove any containing dir entries that might be made 409 * empty by the removal. dir must represent the top-level directory 410 * and must already be complete. 411 */ 412static intremove_entry(struct ref_dir *dir,const char*refname) 413{ 414int refname_len =strlen(refname); 415int entry_index; 416struct ref_entry *entry; 417int is_dir = refname[refname_len -1] =='/'; 418if(is_dir) { 419/* 420 * refname represents a reference directory. Remove 421 * the trailing slash; otherwise we will get the 422 * directory *representing* refname rather than the 423 * one *containing* it. 424 */ 425char*dirname =xmemdupz(refname, refname_len -1); 426 dir =find_containing_dir(dir, dirname,0); 427free(dirname); 428}else{ 429 dir =find_containing_dir(dir, refname,0); 430} 431if(!dir) 432return-1; 433 entry_index =search_ref_dir(dir, refname, refname_len); 434if(entry_index == -1) 435return-1; 436 entry = dir->entries[entry_index]; 437 438memmove(&dir->entries[entry_index], 439&dir->entries[entry_index +1], 440(dir->nr - entry_index -1) *sizeof(*dir->entries) 441); 442 dir->nr--; 443if(dir->sorted > entry_index) 444 dir->sorted--; 445free_ref_entry(entry); 446return dir->nr; 447} 448 449/* 450 * Add a ref_entry to the ref_dir (unsorted), recursing into 451 * subdirectories as necessary. dir must represent the top-level 452 * directory. Return 0 on success. 453 */ 454static intadd_ref(struct ref_dir *dir,struct ref_entry *ref) 455{ 456 dir =find_containing_dir(dir, ref->name,1); 457if(!dir) 458return-1; 459add_entry_to_dir(dir, ref); 460return0; 461} 462 463/* 464 * Emit a warning and return true iff ref1 and ref2 have the same name 465 * and the same sha1. Die if they have the same name but different 466 * sha1s. 467 */ 468static intis_dup_ref(const struct ref_entry *ref1,const struct ref_entry *ref2) 469{ 470if(strcmp(ref1->name, ref2->name)) 471return0; 472 473/* Duplicate name; make sure that they don't conflict: */ 474 475if((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 476/* This is impossible by construction */ 477die("Reference directory conflict:%s", ref1->name); 478 479if(oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 480die("Duplicated ref, and SHA1s don't match:%s", ref1->name); 481 482warning("Duplicated ref:%s", ref1->name); 483return1; 484} 485 486/* 487 * Sort the entries in dir non-recursively (if they are not already 488 * sorted) and remove any duplicate entries. 489 */ 490static voidsort_ref_dir(struct ref_dir *dir) 491{ 492int i, j; 493struct ref_entry *last = NULL; 494 495/* 496 * This check also prevents passing a zero-length array to qsort(), 497 * which is a problem on some platforms. 498 */ 499if(dir->sorted == dir->nr) 500return; 501 502qsort(dir->entries, dir->nr,sizeof(*dir->entries), ref_entry_cmp); 503 504/* Remove any duplicates: */ 505for(i =0, j =0; j < dir->nr; j++) { 506struct ref_entry *entry = dir->entries[j]; 507if(last &&is_dup_ref(last, entry)) 508free_ref_entry(entry); 509else 510 last = dir->entries[i++] = entry; 511} 512 dir->sorted = dir->nr = i; 513} 514 515/* 516 * Return true iff the reference described by entry can be resolved to 517 * an object in the database. Emit a warning if the referred-to 518 * object does not exist. 519 */ 520static intref_resolves_to_object(struct ref_entry *entry) 521{ 522if(entry->flag & REF_ISBROKEN) 523return0; 524if(!has_sha1_file(entry->u.value.oid.hash)) { 525error("%sdoes not point to a valid object!", entry->name); 526return0; 527} 528return1; 529} 530 531/* 532 * current_ref is a performance hack: when iterating over references 533 * using the for_each_ref*() functions, current_ref is set to the 534 * current reference's entry before calling the callback function. If 535 * the callback function calls peel_ref(), then peel_ref() first 536 * checks whether the reference to be peeled is the current reference 537 * (it usually is) and if so, returns that reference's peeled version 538 * if it is available. This avoids a refname lookup in a common case. 539 */ 540static struct ref_entry *current_ref; 541 542typedefinteach_ref_entry_fn(struct ref_entry *entry,void*cb_data); 543 544struct ref_entry_cb { 545const char*base; 546int trim; 547int flags; 548 each_ref_fn *fn; 549void*cb_data; 550}; 551 552/* 553 * Handle one reference in a do_for_each_ref*()-style iteration, 554 * calling an each_ref_fn for each entry. 555 */ 556static intdo_one_ref(struct ref_entry *entry,void*cb_data) 557{ 558struct ref_entry_cb *data = cb_data; 559struct ref_entry *old_current_ref; 560int retval; 561 562if(!starts_with(entry->name, data->base)) 563return0; 564 565if(!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && 566!ref_resolves_to_object(entry)) 567return0; 568 569/* Store the old value, in case this is a recursive call: */ 570 old_current_ref = current_ref; 571 current_ref = entry; 572 retval = data->fn(entry->name + data->trim, &entry->u.value.oid, 573 entry->flag, data->cb_data); 574 current_ref = old_current_ref; 575return retval; 576} 577 578/* 579 * Call fn for each reference in dir that has index in the range 580 * offset <= index < dir->nr. Recurse into subdirectories that are in 581 * that index range, sorting them before iterating. This function 582 * does not sort dir itself; it should be sorted beforehand. fn is 583 * called for all references, including broken ones. 584 */ 585static intdo_for_each_entry_in_dir(struct ref_dir *dir,int offset, 586 each_ref_entry_fn fn,void*cb_data) 587{ 588int i; 589assert(dir->sorted == dir->nr); 590for(i = offset; i < dir->nr; i++) { 591struct ref_entry *entry = dir->entries[i]; 592int retval; 593if(entry->flag & REF_DIR) { 594struct ref_dir *subdir =get_ref_dir(entry); 595sort_ref_dir(subdir); 596 retval =do_for_each_entry_in_dir(subdir,0, fn, cb_data); 597}else{ 598 retval =fn(entry, cb_data); 599} 600if(retval) 601return retval; 602} 603return0; 604} 605 606/* 607 * Call fn for each reference in the union of dir1 and dir2, in order 608 * by refname. Recurse into subdirectories. If a value entry appears 609 * in both dir1 and dir2, then only process the version that is in 610 * dir2. The input dirs must already be sorted, but subdirs will be 611 * sorted as needed. fn is called for all references, including 612 * broken ones. 613 */ 614static intdo_for_each_entry_in_dirs(struct ref_dir *dir1, 615struct ref_dir *dir2, 616 each_ref_entry_fn fn,void*cb_data) 617{ 618int retval; 619int i1 =0, i2 =0; 620 621assert(dir1->sorted == dir1->nr); 622assert(dir2->sorted == dir2->nr); 623while(1) { 624struct ref_entry *e1, *e2; 625int cmp; 626if(i1 == dir1->nr) { 627returndo_for_each_entry_in_dir(dir2, i2, fn, cb_data); 628} 629if(i2 == dir2->nr) { 630returndo_for_each_entry_in_dir(dir1, i1, fn, cb_data); 631} 632 e1 = dir1->entries[i1]; 633 e2 = dir2->entries[i2]; 634 cmp =strcmp(e1->name, e2->name); 635if(cmp ==0) { 636if((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { 637/* Both are directories; descend them in parallel. */ 638struct ref_dir *subdir1 =get_ref_dir(e1); 639struct ref_dir *subdir2 =get_ref_dir(e2); 640sort_ref_dir(subdir1); 641sort_ref_dir(subdir2); 642 retval =do_for_each_entry_in_dirs( 643 subdir1, subdir2, fn, cb_data); 644 i1++; 645 i2++; 646}else if(!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { 647/* Both are references; ignore the one from dir1. */ 648 retval =fn(e2, cb_data); 649 i1++; 650 i2++; 651}else{ 652die("conflict between reference and directory:%s", 653 e1->name); 654} 655}else{ 656struct ref_entry *e; 657if(cmp <0) { 658 e = e1; 659 i1++; 660}else{ 661 e = e2; 662 i2++; 663} 664if(e->flag & REF_DIR) { 665struct ref_dir *subdir =get_ref_dir(e); 666sort_ref_dir(subdir); 667 retval =do_for_each_entry_in_dir( 668 subdir,0, fn, cb_data); 669}else{ 670 retval =fn(e, cb_data); 671} 672} 673if(retval) 674return retval; 675} 676} 677 678/* 679 * Load all of the refs from the dir into our in-memory cache. The hard work 680 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 681 * through all of the sub-directories. We do not even need to care about 682 * sorting, as traversal order does not matter to us. 683 */ 684static voidprime_ref_dir(struct ref_dir *dir) 685{ 686int i; 687for(i =0; i < dir->nr; i++) { 688struct ref_entry *entry = dir->entries[i]; 689if(entry->flag & REF_DIR) 690prime_ref_dir(get_ref_dir(entry)); 691} 692} 693 694struct nonmatching_ref_data { 695const struct string_list *skip; 696const char*conflicting_refname; 697}; 698 699static intnonmatching_ref_fn(struct ref_entry *entry,void*vdata) 700{ 701struct nonmatching_ref_data *data = vdata; 702 703if(data->skip &&string_list_has_string(data->skip, entry->name)) 704return0; 705 706 data->conflicting_refname = entry->name; 707return1; 708} 709 710/* 711 * Return 0 if a reference named refname could be created without 712 * conflicting with the name of an existing reference in dir. 713 * See verify_refname_available for more information. 714 */ 715static intverify_refname_available_dir(const char*refname, 716const struct string_list *extras, 717const struct string_list *skip, 718struct ref_dir *dir, 719struct strbuf *err) 720{ 721const char*slash; 722const char*extra_refname; 723int pos; 724struct strbuf dirname = STRBUF_INIT; 725int ret = -1; 726 727/* 728 * For the sake of comments in this function, suppose that 729 * refname is "refs/foo/bar". 730 */ 731 732assert(err); 733 734strbuf_grow(&dirname,strlen(refname) +1); 735for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 736/* Expand dirname to the new prefix, not including the trailing slash: */ 737strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 738 739/* 740 * We are still at a leading dir of the refname (e.g., 741 * "refs/foo"; if there is a reference with that name, 742 * it is a conflict, *unless* it is in skip. 743 */ 744if(dir) { 745 pos =search_ref_dir(dir, dirname.buf, dirname.len); 746if(pos >=0&& 747(!skip || !string_list_has_string(skip, dirname.buf))) { 748/* 749 * We found a reference whose name is 750 * a proper prefix of refname; e.g., 751 * "refs/foo", and is not in skip. 752 */ 753strbuf_addf(err,"'%s' exists; cannot create '%s'", 754 dirname.buf, refname); 755goto cleanup; 756} 757} 758 759if(extras &&string_list_has_string(extras, dirname.buf) && 760(!skip || !string_list_has_string(skip, dirname.buf))) { 761strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 762 refname, dirname.buf); 763goto cleanup; 764} 765 766/* 767 * Otherwise, we can try to continue our search with 768 * the next component. So try to look up the 769 * directory, e.g., "refs/foo/". If we come up empty, 770 * we know there is nothing under this whole prefix, 771 * but even in that case we still have to continue the 772 * search for conflicts with extras. 773 */ 774strbuf_addch(&dirname,'/'); 775if(dir) { 776 pos =search_ref_dir(dir, dirname.buf, dirname.len); 777if(pos <0) { 778/* 779 * There was no directory "refs/foo/", 780 * so there is nothing under this 781 * whole prefix. So there is no need 782 * to continue looking for conflicting 783 * references. But we need to continue 784 * looking for conflicting extras. 785 */ 786 dir = NULL; 787}else{ 788 dir =get_ref_dir(dir->entries[pos]); 789} 790} 791} 792 793/* 794 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 795 * There is no point in searching for a reference with that 796 * name, because a refname isn't considered to conflict with 797 * itself. But we still need to check for references whose 798 * names are in the "refs/foo/bar/" namespace, because they 799 * *do* conflict. 800 */ 801strbuf_addstr(&dirname, refname + dirname.len); 802strbuf_addch(&dirname,'/'); 803 804if(dir) { 805 pos =search_ref_dir(dir, dirname.buf, dirname.len); 806 807if(pos >=0) { 808/* 809 * We found a directory named "$refname/" 810 * (e.g., "refs/foo/bar/"). It is a problem 811 * iff it contains any ref that is not in 812 * "skip". 813 */ 814struct nonmatching_ref_data data; 815 816 data.skip = skip; 817 data.conflicting_refname = NULL; 818 dir =get_ref_dir(dir->entries[pos]); 819sort_ref_dir(dir); 820if(do_for_each_entry_in_dir(dir,0, nonmatching_ref_fn, &data)) { 821strbuf_addf(err,"'%s' exists; cannot create '%s'", 822 data.conflicting_refname, refname); 823goto cleanup; 824} 825} 826} 827 828 extra_refname =find_descendant_ref(dirname.buf, extras, skip); 829if(extra_refname) 830strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 831 refname, extra_refname); 832else 833 ret =0; 834 835cleanup: 836strbuf_release(&dirname); 837return ret; 838} 839 840struct packed_ref_cache { 841struct ref_entry *root; 842 843/* 844 * Count of references to the data structure in this instance, 845 * including the pointer from ref_cache::packed if any. The 846 * data will not be freed as long as the reference count is 847 * nonzero. 848 */ 849unsigned int referrers; 850 851/* 852 * Iff the packed-refs file associated with this instance is 853 * currently locked for writing, this points at the associated 854 * lock (which is owned by somebody else). The referrer count 855 * is also incremented when the file is locked and decremented 856 * when it is unlocked. 857 */ 858struct lock_file *lock; 859 860/* The metadata from when this packed-refs cache was read */ 861struct stat_validity validity; 862}; 863 864/* 865 * Future: need to be in "struct repository" 866 * when doing a full libification. 867 */ 868static struct ref_cache { 869struct ref_cache *next; 870struct ref_entry *loose; 871struct packed_ref_cache *packed; 872/* 873 * The submodule name, or "" for the main repo. We allocate 874 * length 1 rather than FLEX_ARRAY so that the main ref_cache 875 * is initialized correctly. 876 */ 877char name[1]; 878} ref_cache, *submodule_ref_caches; 879 880/* Lock used for the main packed-refs file: */ 881static struct lock_file packlock; 882 883/* 884 * Increment the reference count of *packed_refs. 885 */ 886static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 887{ 888 packed_refs->referrers++; 889} 890 891/* 892 * Decrease the reference count of *packed_refs. If it goes to zero, 893 * free *packed_refs and return true; otherwise return false. 894 */ 895static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs) 896{ 897if(!--packed_refs->referrers) { 898free_ref_entry(packed_refs->root); 899stat_validity_clear(&packed_refs->validity); 900free(packed_refs); 901return1; 902}else{ 903return0; 904} 905} 906 907static voidclear_packed_ref_cache(struct ref_cache *refs) 908{ 909if(refs->packed) { 910struct packed_ref_cache *packed_refs = refs->packed; 911 912if(packed_refs->lock) 913die("internal error: packed-ref cache cleared while locked"); 914 refs->packed = NULL; 915release_packed_ref_cache(packed_refs); 916} 917} 918 919static voidclear_loose_ref_cache(struct ref_cache *refs) 920{ 921if(refs->loose) { 922free_ref_entry(refs->loose); 923 refs->loose = NULL; 924} 925} 926 927/* 928 * Create a new submodule ref cache and add it to the internal 929 * set of caches. 930 */ 931static struct ref_cache *create_ref_cache(const char*submodule) 932{ 933struct ref_cache *refs; 934if(!submodule) 935 submodule =""; 936FLEX_ALLOC_STR(refs, name, submodule); 937 refs->next = submodule_ref_caches; 938 submodule_ref_caches = refs; 939return refs; 940} 941 942static struct ref_cache *lookup_ref_cache(const char*submodule) 943{ 944struct ref_cache *refs; 945 946if(!submodule || !*submodule) 947return&ref_cache; 948 949for(refs = submodule_ref_caches; refs; refs = refs->next) 950if(!strcmp(submodule, refs->name)) 951return refs; 952return NULL; 953} 954 955/* 956 * Return a pointer to a ref_cache for the specified submodule. For 957 * the main repository, use submodule==NULL. The returned structure 958 * will be allocated and initialized but not necessarily populated; it 959 * should not be freed. 960 */ 961static struct ref_cache *get_ref_cache(const char*submodule) 962{ 963struct ref_cache *refs =lookup_ref_cache(submodule); 964if(!refs) 965 refs =create_ref_cache(submodule); 966return refs; 967} 968 969/* The length of a peeled reference line in packed-refs, including EOL: */ 970#define PEELED_LINE_LENGTH 42 971 972/* 973 * The packed-refs header line that we write out. Perhaps other 974 * traits will be added later. The trailing space is required. 975 */ 976static const char PACKED_REFS_HEADER[] = 977"# pack-refs with: peeled fully-peeled\n"; 978 979/* 980 * Parse one line from a packed-refs file. Write the SHA1 to sha1. 981 * Return a pointer to the refname within the line (null-terminated), 982 * or NULL if there was a problem. 983 */ 984static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1) 985{ 986const char*ref; 987 988/* 989 * 42: the answer to everything. 990 * 991 * In this case, it happens to be the answer to 992 * 40 (length of sha1 hex representation) 993 * +1 (space in between hex and name) 994 * +1 (newline at the end of the line) 995 */ 996if(line->len <=42) 997return NULL; 998 999if(get_sha1_hex(line->buf, sha1) <0)1000return NULL;1001if(!isspace(line->buf[40]))1002return NULL;10031004 ref = line->buf +41;1005if(isspace(*ref))1006return NULL;10071008if(line->buf[line->len -1] !='\n')1009return NULL;1010 line->buf[--line->len] =0;10111012return ref;1013}10141015/*1016 * Read f, which is a packed-refs file, into dir.1017 *1018 * A comment line of the form "# pack-refs with: " may contain zero or1019 * more traits. We interpret the traits as follows:1020 *1021 * No traits:1022 *1023 * Probably no references are peeled. But if the file contains a1024 * peeled value for a reference, we will use it.1025 *1026 * peeled:1027 *1028 * References under "refs/tags/", if they *can* be peeled, *are*1029 * peeled in this file. References outside of "refs/tags/" are1030 * probably not peeled even if they could have been, but if we find1031 * a peeled value for such a reference we will use it.1032 *1033 * fully-peeled:1034 *1035 * All references in the file that can be peeled are peeled.1036 * Inversely (and this is more important), any references in the1037 * file for which no peeled value is recorded is not peelable. This1038 * trait should typically be written alongside "peeled" for1039 * compatibility with older clients, but we do not require it1040 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1041 */1042static voidread_packed_refs(FILE*f,struct ref_dir *dir)1043{1044struct ref_entry *last = NULL;1045struct strbuf line = STRBUF_INIT;1046enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;10471048while(strbuf_getwholeline(&line, f,'\n') != EOF) {1049unsigned char sha1[20];1050const char*refname;1051const char*traits;10521053if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1054if(strstr(traits," fully-peeled "))1055 peeled = PEELED_FULLY;1056else if(strstr(traits," peeled "))1057 peeled = PEELED_TAGS;1058/* perhaps other traits later as well */1059continue;1060}10611062 refname =parse_ref_line(&line, sha1);1063if(refname) {1064int flag = REF_ISPACKED;10651066if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1067if(!refname_is_safe(refname))1068die("packed refname is dangerous:%s", refname);1069hashclr(sha1);1070 flag |= REF_BAD_NAME | REF_ISBROKEN;1071}1072 last =create_ref_entry(refname, sha1, flag,0);1073if(peeled == PEELED_FULLY ||1074(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1075 last->flag |= REF_KNOWS_PEELED;1076add_ref(dir, last);1077continue;1078}1079if(last &&1080 line.buf[0] =='^'&&1081 line.len == PEELED_LINE_LENGTH &&1082 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1083!get_sha1_hex(line.buf +1, sha1)) {1084hashcpy(last->u.value.peeled.hash, sha1);1085/*1086 * Regardless of what the file header said,1087 * we definitely know the value of *this*1088 * reference:1089 */1090 last->flag |= REF_KNOWS_PEELED;1091}1092}10931094strbuf_release(&line);1095}10961097/*1098 * Get the packed_ref_cache for the specified ref_cache, creating it1099 * if necessary.1100 */1101static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1102{1103char*packed_refs_file;11041105if(*refs->name)1106 packed_refs_file =git_pathdup_submodule(refs->name,"packed-refs");1107else1108 packed_refs_file =git_pathdup("packed-refs");11091110if(refs->packed &&1111!stat_validity_check(&refs->packed->validity, packed_refs_file))1112clear_packed_ref_cache(refs);11131114if(!refs->packed) {1115FILE*f;11161117 refs->packed =xcalloc(1,sizeof(*refs->packed));1118acquire_packed_ref_cache(refs->packed);1119 refs->packed->root =create_dir_entry(refs,"",0,0);1120 f =fopen(packed_refs_file,"r");1121if(f) {1122stat_validity_update(&refs->packed->validity,fileno(f));1123read_packed_refs(f,get_ref_dir(refs->packed->root));1124fclose(f);1125}1126}1127free(packed_refs_file);1128return refs->packed;1129}11301131static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1132{1133returnget_ref_dir(packed_ref_cache->root);1134}11351136static struct ref_dir *get_packed_refs(struct ref_cache *refs)1137{1138returnget_packed_ref_dir(get_packed_ref_cache(refs));1139}11401141/*1142 * Add a reference to the in-memory packed reference cache. This may1143 * only be called while the packed-refs file is locked (see1144 * lock_packed_refs()). To actually write the packed-refs file, call1145 * commit_packed_refs().1146 */1147static voidadd_packed_ref(const char*refname,const unsigned char*sha1)1148{1149struct packed_ref_cache *packed_ref_cache =1150get_packed_ref_cache(&ref_cache);11511152if(!packed_ref_cache->lock)1153die("internal error: packed refs not locked");1154add_ref(get_packed_ref_dir(packed_ref_cache),1155create_ref_entry(refname, sha1, REF_ISPACKED,1));1156}11571158/*1159 * Read the loose references from the namespace dirname into dir1160 * (without recursing). dirname must end with '/'. dir must be the1161 * directory entry corresponding to dirname.1162 */1163static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1164{1165struct ref_cache *refs = dir->ref_cache;1166DIR*d;1167struct dirent *de;1168int dirnamelen =strlen(dirname);1169struct strbuf refname;1170struct strbuf path = STRBUF_INIT;1171size_t path_baselen;11721173if(*refs->name)1174strbuf_git_path_submodule(&path, refs->name,"%s", dirname);1175else1176strbuf_git_path(&path,"%s", dirname);1177 path_baselen = path.len;11781179 d =opendir(path.buf);1180if(!d) {1181strbuf_release(&path);1182return;1183}11841185strbuf_init(&refname, dirnamelen +257);1186strbuf_add(&refname, dirname, dirnamelen);11871188while((de =readdir(d)) != NULL) {1189unsigned char sha1[20];1190struct stat st;1191int flag;11921193if(de->d_name[0] =='.')1194continue;1195if(ends_with(de->d_name,".lock"))1196continue;1197strbuf_addstr(&refname, de->d_name);1198strbuf_addstr(&path, de->d_name);1199if(stat(path.buf, &st) <0) {1200;/* silently ignore */1201}else if(S_ISDIR(st.st_mode)) {1202strbuf_addch(&refname,'/');1203add_entry_to_dir(dir,1204create_dir_entry(refs, refname.buf,1205 refname.len,1));1206}else{1207int read_ok;12081209if(*refs->name) {1210hashclr(sha1);1211 flag =0;1212 read_ok = !resolve_gitlink_ref(refs->name,1213 refname.buf, sha1);1214}else{1215 read_ok = !read_ref_full(refname.buf,1216 RESOLVE_REF_READING,1217 sha1, &flag);1218}12191220if(!read_ok) {1221hashclr(sha1);1222 flag |= REF_ISBROKEN;1223}else if(is_null_sha1(sha1)) {1224/*1225 * It is so astronomically unlikely1226 * that NULL_SHA1 is the SHA-1 of an1227 * actual object that we consider its1228 * appearance in a loose reference1229 * file to be repo corruption1230 * (probably due to a software bug).1231 */1232 flag |= REF_ISBROKEN;1233}12341235if(check_refname_format(refname.buf,1236 REFNAME_ALLOW_ONELEVEL)) {1237if(!refname_is_safe(refname.buf))1238die("loose refname is dangerous:%s", refname.buf);1239hashclr(sha1);1240 flag |= REF_BAD_NAME | REF_ISBROKEN;1241}1242add_entry_to_dir(dir,1243create_ref_entry(refname.buf, sha1, flag,0));1244}1245strbuf_setlen(&refname, dirnamelen);1246strbuf_setlen(&path, path_baselen);1247}1248strbuf_release(&refname);1249strbuf_release(&path);1250closedir(d);1251}12521253static struct ref_dir *get_loose_refs(struct ref_cache *refs)1254{1255if(!refs->loose) {1256/*1257 * Mark the top-level directory complete because we1258 * are about to read the only subdirectory that can1259 * hold references:1260 */1261 refs->loose =create_dir_entry(refs,"",0,0);1262/*1263 * Create an incomplete entry for "refs/":1264 */1265add_entry_to_dir(get_ref_dir(refs->loose),1266create_dir_entry(refs,"refs/",5,1));1267}1268returnget_ref_dir(refs->loose);1269}12701271#define MAXREFLEN (1024)12721273/*1274 * Called by resolve_gitlink_ref_recursive() after it failed to read1275 * from the loose refs in ref_cache refs. Find <refname> in the1276 * packed-refs file for the submodule.1277 */1278static intresolve_gitlink_packed_ref(struct ref_cache *refs,1279const char*refname,unsigned char*sha1)1280{1281struct ref_entry *ref;1282struct ref_dir *dir =get_packed_refs(refs);12831284 ref =find_ref(dir, refname);1285if(ref == NULL)1286return-1;12871288hashcpy(sha1, ref->u.value.oid.hash);1289return0;1290}12911292static intresolve_gitlink_ref_recursive(struct ref_cache *refs,1293const char*refname,unsigned char*sha1,1294int recursion)1295{1296int fd, len;1297char buffer[128], *p;1298char*path;12991300if(recursion > SYMREF_MAXDEPTH ||strlen(refname) > MAXREFLEN)1301return-1;1302 path = *refs->name1303?git_pathdup_submodule(refs->name,"%s", refname)1304:git_pathdup("%s", refname);1305 fd =open(path, O_RDONLY);1306free(path);1307if(fd <0)1308returnresolve_gitlink_packed_ref(refs, refname, sha1);13091310 len =read(fd, buffer,sizeof(buffer)-1);1311close(fd);1312if(len <0)1313return-1;1314while(len &&isspace(buffer[len-1]))1315 len--;1316 buffer[len] =0;13171318/* Was it a detached head or an old-fashioned symlink? */1319if(!get_sha1_hex(buffer, sha1))1320return0;13211322/* Symref? */1323if(strncmp(buffer,"ref:",4))1324return-1;1325 p = buffer +4;1326while(isspace(*p))1327 p++;13281329returnresolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1330}13311332intresolve_gitlink_ref(const char*path,const char*refname,unsigned char*sha1)1333{1334int len =strlen(path), retval;1335struct strbuf submodule = STRBUF_INIT;1336struct ref_cache *refs;13371338while(len && path[len-1] =='/')1339 len--;1340if(!len)1341return-1;13421343strbuf_add(&submodule, path, len);1344 refs =lookup_ref_cache(submodule.buf);1345if(!refs) {1346if(!is_nonbare_repository_dir(&submodule)) {1347strbuf_release(&submodule);1348return-1;1349}1350 refs =create_ref_cache(submodule.buf);1351}1352strbuf_release(&submodule);13531354 retval =resolve_gitlink_ref_recursive(refs, refname, sha1,0);1355return retval;1356}13571358/*1359 * Return the ref_entry for the given refname from the packed1360 * references. If it does not exist, return NULL.1361 */1362static struct ref_entry *get_packed_ref(const char*refname)1363{1364returnfind_ref(get_packed_refs(&ref_cache), refname);1365}13661367/*1368 * A loose ref file doesn't exist; check for a packed ref.1369 */1370static intresolve_missing_loose_ref(const char*refname,1371unsigned char*sha1,1372unsigned int*flags)1373{1374struct ref_entry *entry;13751376/*1377 * The loose reference file does not exist; check for a packed1378 * reference.1379 */1380 entry =get_packed_ref(refname);1381if(entry) {1382hashcpy(sha1, entry->u.value.oid.hash);1383*flags |= REF_ISPACKED;1384return0;1385}1386/* refname is not a packed reference. */1387return-1;1388}13891390intread_raw_ref(const char*refname,unsigned char*sha1,1391struct strbuf *referent,unsigned int*type)1392{1393struct strbuf sb_contents = STRBUF_INIT;1394struct strbuf sb_path = STRBUF_INIT;1395const char*path;1396const char*buf;1397struct stat st;1398int fd;1399int ret = -1;1400int save_errno;14011402*type =0;1403strbuf_reset(&sb_path);1404strbuf_git_path(&sb_path,"%s", refname);1405 path = sb_path.buf;14061407stat_ref:1408/*1409 * We might have to loop back here to avoid a race1410 * condition: first we lstat() the file, then we try1411 * to read it as a link or as a file. But if somebody1412 * changes the type of the file (file <-> directory1413 * <-> symlink) between the lstat() and reading, then1414 * we don't want to report that as an error but rather1415 * try again starting with the lstat().1416 */14171418if(lstat(path, &st) <0) {1419if(errno != ENOENT)1420goto out;1421if(resolve_missing_loose_ref(refname, sha1, type)) {1422 errno = ENOENT;1423goto out;1424}1425 ret =0;1426goto out;1427}14281429/* Follow "normalized" - ie "refs/.." symlinks by hand */1430if(S_ISLNK(st.st_mode)) {1431strbuf_reset(&sb_contents);1432if(strbuf_readlink(&sb_contents, path,0) <0) {1433if(errno == ENOENT || errno == EINVAL)1434/* inconsistent with lstat; retry */1435goto stat_ref;1436else1437goto out;1438}1439if(starts_with(sb_contents.buf,"refs/") &&1440!check_refname_format(sb_contents.buf,0)) {1441strbuf_swap(&sb_contents, referent);1442*type |= REF_ISSYMREF;1443 ret =0;1444goto out;1445}1446}14471448/* Is it a directory? */1449if(S_ISDIR(st.st_mode)) {1450/*1451 * Even though there is a directory where the loose1452 * ref is supposed to be, there could still be a1453 * packed ref:1454 */1455if(resolve_missing_loose_ref(refname, sha1, type)) {1456 errno = EISDIR;1457goto out;1458}1459 ret =0;1460goto out;1461}14621463/*1464 * Anything else, just open it and try to use it as1465 * a ref1466 */1467 fd =open(path, O_RDONLY);1468if(fd <0) {1469if(errno == ENOENT)1470/* inconsistent with lstat; retry */1471goto stat_ref;1472else1473goto out;1474}1475strbuf_reset(&sb_contents);1476if(strbuf_read(&sb_contents, fd,256) <0) {1477int save_errno = errno;1478close(fd);1479 errno = save_errno;1480goto out;1481}1482close(fd);1483strbuf_rtrim(&sb_contents);1484 buf = sb_contents.buf;1485if(starts_with(buf,"ref:")) {1486 buf +=4;1487while(isspace(*buf))1488 buf++;14891490strbuf_reset(referent);1491strbuf_addstr(referent, buf);1492*type |= REF_ISSYMREF;1493 ret =0;1494goto out;1495}14961497/*1498 * Please note that FETCH_HEAD has additional1499 * data after the sha.1500 */1501if(get_sha1_hex(buf, sha1) ||1502(buf[40] !='\0'&& !isspace(buf[40]))) {1503*type |= REF_ISBROKEN;1504 errno = EINVAL;1505goto out;1506}15071508 ret =0;15091510out:1511 save_errno = errno;1512strbuf_release(&sb_path);1513strbuf_release(&sb_contents);1514 errno = save_errno;1515return ret;1516}15171518static voidunlock_ref(struct ref_lock *lock)1519{1520/* Do not free lock->lk -- atexit() still looks at them */1521if(lock->lk)1522rollback_lock_file(lock->lk);1523free(lock->ref_name);1524free(lock);1525}15261527/*1528 * Lock refname, without following symrefs, and set *lock_p to point1529 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1530 * and type similarly to read_raw_ref().1531 *1532 * The caller must verify that refname is a "safe" reference name (in1533 * the sense of refname_is_safe()) before calling this function.1534 *1535 * If the reference doesn't already exist, verify that refname doesn't1536 * have a D/F conflict with any existing references. extras and skip1537 * are passed to verify_refname_available_dir() for this check.1538 *1539 * If mustexist is not set and the reference is not found or is1540 * broken, lock the reference anyway but clear sha1.1541 *1542 * Return 0 on success. On failure, write an error message to err and1543 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1544 *1545 * Implementation note: This function is basically1546 *1547 * lock reference1548 * read_raw_ref()1549 *1550 * but it includes a lot more code to1551 * - Deal with possible races with other processes1552 * - Avoid calling verify_refname_available_dir() when it can be1553 * avoided, namely if we were successfully able to read the ref1554 * - Generate informative error messages in the case of failure1555 */1556static intlock_raw_ref(const char*refname,int mustexist,1557const struct string_list *extras,1558const struct string_list *skip,1559struct ref_lock **lock_p,1560struct strbuf *referent,1561unsigned int*type,1562struct strbuf *err)1563{1564struct ref_lock *lock;1565struct strbuf ref_file = STRBUF_INIT;1566int attempts_remaining =3;1567int ret = TRANSACTION_GENERIC_ERROR;15681569assert(err);1570*type =0;15711572/* First lock the file so it can't change out from under us. */15731574*lock_p = lock =xcalloc(1,sizeof(*lock));15751576 lock->ref_name =xstrdup(refname);1577strbuf_git_path(&ref_file,"%s", refname);15781579retry:1580switch(safe_create_leading_directories(ref_file.buf)) {1581case SCLD_OK:1582break;/* success */1583case SCLD_EXISTS:1584/*1585 * Suppose refname is "refs/foo/bar". We just failed1586 * to create the containing directory, "refs/foo",1587 * because there was a non-directory in the way. This1588 * indicates a D/F conflict, probably because of1589 * another reference such as "refs/foo". There is no1590 * reason to expect this error to be transitory.1591 */1592if(verify_refname_available(refname, extras, skip, err)) {1593if(mustexist) {1594/*1595 * To the user the relevant error is1596 * that the "mustexist" reference is1597 * missing:1598 */1599strbuf_reset(err);1600strbuf_addf(err,"unable to resolve reference '%s'",1601 refname);1602}else{1603/*1604 * The error message set by1605 * verify_refname_available_dir() is OK.1606 */1607 ret = TRANSACTION_NAME_CONFLICT;1608}1609}else{1610/*1611 * The file that is in the way isn't a loose1612 * reference. Report it as a low-level1613 * failure.1614 */1615strbuf_addf(err,"unable to create lock file%s.lock; "1616"non-directory in the way",1617 ref_file.buf);1618}1619goto error_return;1620case SCLD_VANISHED:1621/* Maybe another process was tidying up. Try again. */1622if(--attempts_remaining >0)1623goto retry;1624/* fall through */1625default:1626strbuf_addf(err,"unable to create directory for%s",1627 ref_file.buf);1628goto error_return;1629}16301631if(!lock->lk)1632 lock->lk =xcalloc(1,sizeof(struct lock_file));16331634if(hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) <0) {1635if(errno == ENOENT && --attempts_remaining >0) {1636/*1637 * Maybe somebody just deleted one of the1638 * directories leading to ref_file. Try1639 * again:1640 */1641goto retry;1642}else{1643unable_to_lock_message(ref_file.buf, errno, err);1644goto error_return;1645}1646}16471648/*1649 * Now we hold the lock and can read the reference without1650 * fear that its value will change.1651 */16521653if(read_raw_ref(refname, lock->old_oid.hash, referent, type)) {1654if(errno == ENOENT) {1655if(mustexist) {1656/* Garden variety missing reference. */1657strbuf_addf(err,"unable to resolve reference '%s'",1658 refname);1659goto error_return;1660}else{1661/*1662 * Reference is missing, but that's OK. We1663 * know that there is not a conflict with1664 * another loose reference because1665 * (supposing that we are trying to lock1666 * reference "refs/foo/bar"):1667 *1668 * - We were successfully able to create1669 * the lockfile refs/foo/bar.lock, so we1670 * know there cannot be a loose reference1671 * named "refs/foo".1672 *1673 * - We got ENOENT and not EISDIR, so we1674 * know that there cannot be a loose1675 * reference named "refs/foo/bar/baz".1676 */1677}1678}else if(errno == EISDIR) {1679/*1680 * There is a directory in the way. It might have1681 * contained references that have been deleted. If1682 * we don't require that the reference already1683 * exists, try to remove the directory so that it1684 * doesn't cause trouble when we want to rename the1685 * lockfile into place later.1686 */1687if(mustexist) {1688/* Garden variety missing reference. */1689strbuf_addf(err,"unable to resolve reference '%s'",1690 refname);1691goto error_return;1692}else if(remove_dir_recursively(&ref_file,1693 REMOVE_DIR_EMPTY_ONLY)) {1694if(verify_refname_available_dir(1695 refname, extras, skip,1696get_loose_refs(&ref_cache),1697 err)) {1698/*1699 * The error message set by1700 * verify_refname_available() is OK.1701 */1702 ret = TRANSACTION_NAME_CONFLICT;1703goto error_return;1704}else{1705/*1706 * We can't delete the directory,1707 * but we also don't know of any1708 * references that it should1709 * contain.1710 */1711strbuf_addf(err,"there is a non-empty directory '%s' "1712"blocking reference '%s'",1713 ref_file.buf, refname);1714goto error_return;1715}1716}1717}else if(errno == EINVAL && (*type & REF_ISBROKEN)) {1718strbuf_addf(err,"unable to resolve reference '%s': "1719"reference broken", refname);1720goto error_return;1721}else{1722strbuf_addf(err,"unable to resolve reference '%s':%s",1723 refname,strerror(errno));1724goto error_return;1725}17261727/*1728 * If the ref did not exist and we are creating it,1729 * make sure there is no existing packed ref whose1730 * name begins with our refname, nor a packed ref1731 * whose name is a proper prefix of our refname.1732 */1733if(verify_refname_available_dir(1734 refname, extras, skip,1735get_packed_refs(&ref_cache),1736 err)) {1737goto error_return;1738}1739}17401741 ret =0;1742goto out;17431744error_return:1745unlock_ref(lock);1746*lock_p = NULL;17471748out:1749strbuf_release(&ref_file);1750return ret;1751}17521753/*1754 * Peel the entry (if possible) and return its new peel_status. If1755 * repeel is true, re-peel the entry even if there is an old peeled1756 * value that is already stored in it.1757 *1758 * It is OK to call this function with a packed reference entry that1759 * might be stale and might even refer to an object that has since1760 * been garbage-collected. In such a case, if the entry has1761 * REF_KNOWS_PEELED then leave the status unchanged and return1762 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1763 */1764static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1765{1766enum peel_status status;17671768if(entry->flag & REF_KNOWS_PEELED) {1769if(repeel) {1770 entry->flag &= ~REF_KNOWS_PEELED;1771oidclr(&entry->u.value.peeled);1772}else{1773returnis_null_oid(&entry->u.value.peeled) ?1774 PEEL_NON_TAG : PEEL_PEELED;1775}1776}1777if(entry->flag & REF_ISBROKEN)1778return PEEL_BROKEN;1779if(entry->flag & REF_ISSYMREF)1780return PEEL_IS_SYMREF;17811782 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1783if(status == PEEL_PEELED || status == PEEL_NON_TAG)1784 entry->flag |= REF_KNOWS_PEELED;1785return status;1786}17871788intpeel_ref(const char*refname,unsigned char*sha1)1789{1790int flag;1791unsigned char base[20];17921793if(current_ref && (current_ref->name == refname1794|| !strcmp(current_ref->name, refname))) {1795if(peel_entry(current_ref,0))1796return-1;1797hashcpy(sha1, current_ref->u.value.peeled.hash);1798return0;1799}18001801if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1802return-1;18031804/*1805 * If the reference is packed, read its ref_entry from the1806 * cache in the hope that we already know its peeled value.1807 * We only try this optimization on packed references because1808 * (a) forcing the filling of the loose reference cache could1809 * be expensive and (b) loose references anyway usually do not1810 * have REF_KNOWS_PEELED.1811 */1812if(flag & REF_ISPACKED) {1813struct ref_entry *r =get_packed_ref(refname);1814if(r) {1815if(peel_entry(r,0))1816return-1;1817hashcpy(sha1, r->u.value.peeled.hash);1818return0;1819}1820}18211822returnpeel_object(base, sha1);1823}18241825/*1826 * Call fn for each reference in the specified ref_cache, omitting1827 * references not in the containing_dir of base. fn is called for all1828 * references, including broken ones. If fn ever returns a non-zero1829 * value, stop the iteration and return that value; otherwise, return1830 * 0.1831 */1832static intdo_for_each_entry(struct ref_cache *refs,const char*base,1833 each_ref_entry_fn fn,void*cb_data)1834{1835struct packed_ref_cache *packed_ref_cache;1836struct ref_dir *loose_dir;1837struct ref_dir *packed_dir;1838int retval =0;18391840/*1841 * We must make sure that all loose refs are read before accessing the1842 * packed-refs file; this avoids a race condition in which loose refs1843 * are migrated to the packed-refs file by a simultaneous process, but1844 * our in-memory view is from before the migration. get_packed_ref_cache()1845 * takes care of making sure our view is up to date with what is on1846 * disk.1847 */1848 loose_dir =get_loose_refs(refs);1849if(base && *base) {1850 loose_dir =find_containing_dir(loose_dir, base,0);1851}1852if(loose_dir)1853prime_ref_dir(loose_dir);18541855 packed_ref_cache =get_packed_ref_cache(refs);1856acquire_packed_ref_cache(packed_ref_cache);1857 packed_dir =get_packed_ref_dir(packed_ref_cache);1858if(base && *base) {1859 packed_dir =find_containing_dir(packed_dir, base,0);1860}18611862if(packed_dir && loose_dir) {1863sort_ref_dir(packed_dir);1864sort_ref_dir(loose_dir);1865 retval =do_for_each_entry_in_dirs(1866 packed_dir, loose_dir, fn, cb_data);1867}else if(packed_dir) {1868sort_ref_dir(packed_dir);1869 retval =do_for_each_entry_in_dir(1870 packed_dir,0, fn, cb_data);1871}else if(loose_dir) {1872sort_ref_dir(loose_dir);1873 retval =do_for_each_entry_in_dir(1874 loose_dir,0, fn, cb_data);1875}18761877release_packed_ref_cache(packed_ref_cache);1878return retval;1879}18801881/*1882 * Call fn for each reference in the specified ref_cache for which the1883 * refname begins with base. If trim is non-zero, then trim that many1884 * characters off the beginning of each refname before passing the1885 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include1886 * broken references in the iteration. If fn ever returns a non-zero1887 * value, stop the iteration and return that value; otherwise, return1888 * 0.1889 */1890intdo_for_each_ref(const char*submodule,const char*base,1891 each_ref_fn fn,int trim,int flags,void*cb_data)1892{1893struct ref_entry_cb data;1894struct ref_cache *refs;18951896 refs =get_ref_cache(submodule);1897 data.base = base;1898 data.trim = trim;1899 data.flags = flags;1900 data.fn = fn;1901 data.cb_data = cb_data;19021903if(ref_paranoia <0)1904 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1905if(ref_paranoia)1906 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;19071908returndo_for_each_entry(refs, base, do_one_ref, &data);1909}19101911/*1912 * Verify that the reference locked by lock has the value old_sha1.1913 * Fail if the reference doesn't exist and mustexist is set. Return 01914 * on success. On error, write an error message to err, set errno, and1915 * return a negative value.1916 */1917static intverify_lock(struct ref_lock *lock,1918const unsigned char*old_sha1,int mustexist,1919struct strbuf *err)1920{1921assert(err);19221923if(read_ref_full(lock->ref_name,1924 mustexist ? RESOLVE_REF_READING :0,1925 lock->old_oid.hash, NULL)) {1926if(old_sha1) {1927int save_errno = errno;1928strbuf_addf(err,"can't verify ref '%s'", lock->ref_name);1929 errno = save_errno;1930return-1;1931}else{1932hashclr(lock->old_oid.hash);1933return0;1934}1935}1936if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {1937strbuf_addf(err,"ref '%s' is at%sbut expected%s",1938 lock->ref_name,1939sha1_to_hex(lock->old_oid.hash),1940sha1_to_hex(old_sha1));1941 errno = EBUSY;1942return-1;1943}1944return0;1945}19461947static intremove_empty_directories(struct strbuf *path)1948{1949/*1950 * we want to create a file but there is a directory there;1951 * if that is an empty directory (or a directory that contains1952 * only empty directories), remove them.1953 */1954returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);1955}19561957/*1958 * Locks a ref returning the lock on success and NULL on failure.1959 * On failure errno is set to something meaningful.1960 */1961static struct ref_lock *lock_ref_sha1_basic(const char*refname,1962const unsigned char*old_sha1,1963const struct string_list *extras,1964const struct string_list *skip,1965unsigned int flags,int*type,1966struct strbuf *err)1967{1968struct strbuf ref_file = STRBUF_INIT;1969struct ref_lock *lock;1970int last_errno =0;1971int lflags = LOCK_NO_DEREF;1972int mustexist = (old_sha1 && !is_null_sha1(old_sha1));1973int resolve_flags = RESOLVE_REF_NO_RECURSE;1974int attempts_remaining =3;1975int resolved;19761977assert(err);19781979 lock =xcalloc(1,sizeof(struct ref_lock));19801981if(mustexist)1982 resolve_flags |= RESOLVE_REF_READING;1983if(flags & REF_DELETING)1984 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;19851986strbuf_git_path(&ref_file,"%s", refname);1987 resolved = !!resolve_ref_unsafe(refname, resolve_flags,1988 lock->old_oid.hash, type);1989if(!resolved && errno == EISDIR) {1990/*1991 * we are trying to lock foo but we used to1992 * have foo/bar which now does not exist;1993 * it is normal for the empty directory 'foo'1994 * to remain.1995 */1996if(remove_empty_directories(&ref_file)) {1997 last_errno = errno;1998if(!verify_refname_available_dir(refname, extras, skip,1999get_loose_refs(&ref_cache), err))2000strbuf_addf(err,"there are still refs under '%s'",2001 refname);2002goto error_return;2003}2004 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2005 lock->old_oid.hash, type);2006}2007if(!resolved) {2008 last_errno = errno;2009if(last_errno != ENOTDIR ||2010!verify_refname_available_dir(refname, extras, skip,2011get_loose_refs(&ref_cache), err))2012strbuf_addf(err,"unable to resolve reference '%s':%s",2013 refname,strerror(last_errno));20142015goto error_return;2016}20172018/*2019 * If the ref did not exist and we are creating it, make sure2020 * there is no existing packed ref whose name begins with our2021 * refname, nor a packed ref whose name is a proper prefix of2022 * our refname.2023 */2024if(is_null_oid(&lock->old_oid) &&2025verify_refname_available_dir(refname, extras, skip,2026get_packed_refs(&ref_cache), err)) {2027 last_errno = ENOTDIR;2028goto error_return;2029}20302031 lock->lk =xcalloc(1,sizeof(struct lock_file));20322033 lock->ref_name =xstrdup(refname);20342035 retry:2036switch(safe_create_leading_directories_const(ref_file.buf)) {2037case SCLD_OK:2038break;/* success */2039case SCLD_VANISHED:2040if(--attempts_remaining >0)2041goto retry;2042/* fall through */2043default:2044 last_errno = errno;2045strbuf_addf(err,"unable to create directory for '%s'",2046 ref_file.buf);2047goto error_return;2048}20492050if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {2051 last_errno = errno;2052if(errno == ENOENT && --attempts_remaining >0)2053/*2054 * Maybe somebody just deleted one of the2055 * directories leading to ref_file. Try2056 * again:2057 */2058goto retry;2059else{2060unable_to_lock_message(ref_file.buf, errno, err);2061goto error_return;2062}2063}2064if(verify_lock(lock, old_sha1, mustexist, err)) {2065 last_errno = errno;2066goto error_return;2067}2068goto out;20692070 error_return:2071unlock_ref(lock);2072 lock = NULL;20732074 out:2075strbuf_release(&ref_file);2076 errno = last_errno;2077return lock;2078}20792080/*2081 * Write an entry to the packed-refs file for the specified refname.2082 * If peeled is non-NULL, write it as the entry's peeled value.2083 */2084static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2085unsigned char*peeled)2086{2087fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2088if(peeled)2089fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2090}20912092/*2093 * An each_ref_entry_fn that writes the entry to a packed-refs file.2094 */2095static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2096{2097enum peel_status peel_status =peel_entry(entry,0);20982099if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2100error("internal error:%sis not a valid packed reference!",2101 entry->name);2102write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2103 peel_status == PEEL_PEELED ?2104 entry->u.value.peeled.hash : NULL);2105return0;2106}21072108/*2109 * Lock the packed-refs file for writing. Flags is passed to2110 * hold_lock_file_for_update(). Return 0 on success. On errors, set2111 * errno appropriately and return a nonzero value.2112 */2113static intlock_packed_refs(int flags)2114{2115static int timeout_configured =0;2116static int timeout_value =1000;21172118struct packed_ref_cache *packed_ref_cache;21192120if(!timeout_configured) {2121git_config_get_int("core.packedrefstimeout", &timeout_value);2122 timeout_configured =1;2123}21242125if(hold_lock_file_for_update_timeout(2126&packlock,git_path("packed-refs"),2127 flags, timeout_value) <0)2128return-1;2129/*2130 * Get the current packed-refs while holding the lock. If the2131 * packed-refs file has been modified since we last read it,2132 * this will automatically invalidate the cache and re-read2133 * the packed-refs file.2134 */2135 packed_ref_cache =get_packed_ref_cache(&ref_cache);2136 packed_ref_cache->lock = &packlock;2137/* Increment the reference count to prevent it from being freed: */2138acquire_packed_ref_cache(packed_ref_cache);2139return0;2140}21412142/*2143 * Write the current version of the packed refs cache from memory to2144 * disk. The packed-refs file must already be locked for writing (see2145 * lock_packed_refs()). Return zero on success. On errors, set errno2146 * and return a nonzero value2147 */2148static intcommit_packed_refs(void)2149{2150struct packed_ref_cache *packed_ref_cache =2151get_packed_ref_cache(&ref_cache);2152int error =0;2153int save_errno =0;2154FILE*out;21552156if(!packed_ref_cache->lock)2157die("internal error: packed-refs not locked");21582159 out =fdopen_lock_file(packed_ref_cache->lock,"w");2160if(!out)2161die_errno("unable to fdopen packed-refs descriptor");21622163fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2164do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),21650, write_packed_entry_fn, out);21662167if(commit_lock_file(packed_ref_cache->lock)) {2168 save_errno = errno;2169 error = -1;2170}2171 packed_ref_cache->lock = NULL;2172release_packed_ref_cache(packed_ref_cache);2173 errno = save_errno;2174return error;2175}21762177/*2178 * Rollback the lockfile for the packed-refs file, and discard the2179 * in-memory packed reference cache. (The packed-refs file will be2180 * read anew if it is needed again after this function is called.)2181 */2182static voidrollback_packed_refs(void)2183{2184struct packed_ref_cache *packed_ref_cache =2185get_packed_ref_cache(&ref_cache);21862187if(!packed_ref_cache->lock)2188die("internal error: packed-refs not locked");2189rollback_lock_file(packed_ref_cache->lock);2190 packed_ref_cache->lock = NULL;2191release_packed_ref_cache(packed_ref_cache);2192clear_packed_ref_cache(&ref_cache);2193}21942195struct ref_to_prune {2196struct ref_to_prune *next;2197unsigned char sha1[20];2198char name[FLEX_ARRAY];2199};22002201struct pack_refs_cb_data {2202unsigned int flags;2203struct ref_dir *packed_refs;2204struct ref_to_prune *ref_to_prune;2205};22062207/*2208 * An each_ref_entry_fn that is run over loose references only. If2209 * the loose reference can be packed, add an entry in the packed ref2210 * cache. If the reference should be pruned, also add it to2211 * ref_to_prune in the pack_refs_cb_data.2212 */2213static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2214{2215struct pack_refs_cb_data *cb = cb_data;2216enum peel_status peel_status;2217struct ref_entry *packed_entry;2218int is_tag_ref =starts_with(entry->name,"refs/tags/");22192220/* Do not pack per-worktree refs: */2221if(ref_type(entry->name) != REF_TYPE_NORMAL)2222return0;22232224/* ALWAYS pack tags */2225if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2226return0;22272228/* Do not pack symbolic or broken refs: */2229if((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2230return0;22312232/* Add a packed ref cache entry equivalent to the loose entry. */2233 peel_status =peel_entry(entry,1);2234if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2235die("internal error peeling reference%s(%s)",2236 entry->name,oid_to_hex(&entry->u.value.oid));2237 packed_entry =find_ref(cb->packed_refs, entry->name);2238if(packed_entry) {2239/* Overwrite existing packed entry with info from loose entry */2240 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2241oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2242}else{2243 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2244 REF_ISPACKED | REF_KNOWS_PEELED,0);2245add_ref(cb->packed_refs, packed_entry);2246}2247oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);22482249/* Schedule the loose reference for pruning if requested. */2250if((cb->flags & PACK_REFS_PRUNE)) {2251struct ref_to_prune *n;2252FLEX_ALLOC_STR(n, name, entry->name);2253hashcpy(n->sha1, entry->u.value.oid.hash);2254 n->next = cb->ref_to_prune;2255 cb->ref_to_prune = n;2256}2257return0;2258}22592260/*2261 * Remove empty parents, but spare refs/ and immediate subdirs.2262 * Note: munges *name.2263 */2264static voidtry_remove_empty_parents(char*name)2265{2266char*p, *q;2267int i;2268 p = name;2269for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2270while(*p && *p !='/')2271 p++;2272/* tolerate duplicate slashes; see check_refname_format() */2273while(*p =='/')2274 p++;2275}2276for(q = p; *q; q++)2277;2278while(1) {2279while(q > p && *q !='/')2280 q--;2281while(q > p && *(q-1) =='/')2282 q--;2283if(q == p)2284break;2285*q ='\0';2286if(rmdir(git_path("%s", name)))2287break;2288}2289}22902291/* make sure nobody touched the ref, and unlink */2292static voidprune_ref(struct ref_to_prune *r)2293{2294struct ref_transaction *transaction;2295struct strbuf err = STRBUF_INIT;22962297if(check_refname_format(r->name,0))2298return;22992300 transaction =ref_transaction_begin(&err);2301if(!transaction ||2302ref_transaction_delete(transaction, r->name, r->sha1,2303 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2304ref_transaction_commit(transaction, &err)) {2305ref_transaction_free(transaction);2306error("%s", err.buf);2307strbuf_release(&err);2308return;2309}2310ref_transaction_free(transaction);2311strbuf_release(&err);2312try_remove_empty_parents(r->name);2313}23142315static voidprune_refs(struct ref_to_prune *r)2316{2317while(r) {2318prune_ref(r);2319 r = r->next;2320}2321}23222323intpack_refs(unsigned int flags)2324{2325struct pack_refs_cb_data cbdata;23262327memset(&cbdata,0,sizeof(cbdata));2328 cbdata.flags = flags;23292330lock_packed_refs(LOCK_DIE_ON_ERROR);2331 cbdata.packed_refs =get_packed_refs(&ref_cache);23322333do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2334 pack_if_possible_fn, &cbdata);23352336if(commit_packed_refs())2337die_errno("unable to overwrite old ref-pack file");23382339prune_refs(cbdata.ref_to_prune);2340return0;2341}23422343/*2344 * Rewrite the packed-refs file, omitting any refs listed in2345 * 'refnames'. On error, leave packed-refs unchanged, write an error2346 * message to 'err', and return a nonzero value.2347 *2348 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2349 */2350static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2351{2352struct ref_dir *packed;2353struct string_list_item *refname;2354int ret, needs_repacking =0, removed =0;23552356assert(err);23572358/* Look for a packed ref */2359for_each_string_list_item(refname, refnames) {2360if(get_packed_ref(refname->string)) {2361 needs_repacking =1;2362break;2363}2364}23652366/* Avoid locking if we have nothing to do */2367if(!needs_repacking)2368return0;/* no refname exists in packed refs */23692370if(lock_packed_refs(0)) {2371unable_to_lock_message(git_path("packed-refs"), errno, err);2372return-1;2373}2374 packed =get_packed_refs(&ref_cache);23752376/* Remove refnames from the cache */2377for_each_string_list_item(refname, refnames)2378if(remove_entry(packed, refname->string) != -1)2379 removed =1;2380if(!removed) {2381/*2382 * All packed entries disappeared while we were2383 * acquiring the lock.2384 */2385rollback_packed_refs();2386return0;2387}23882389/* Write what remains */2390 ret =commit_packed_refs();2391if(ret)2392strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2393strerror(errno));2394return ret;2395}23962397static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2398{2399assert(err);24002401if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2402/*2403 * loose. The loose file name is the same as the2404 * lockfile name, minus ".lock":2405 */2406char*loose_filename =get_locked_file_path(lock->lk);2407int res =unlink_or_msg(loose_filename, err);2408free(loose_filename);2409if(res)2410return1;2411}2412return0;2413}24142415intdelete_refs(struct string_list *refnames)2416{2417struct strbuf err = STRBUF_INIT;2418int i, result =0;24192420if(!refnames->nr)2421return0;24222423 result =repack_without_refs(refnames, &err);2424if(result) {2425/*2426 * If we failed to rewrite the packed-refs file, then2427 * it is unsafe to try to remove loose refs, because2428 * doing so might expose an obsolete packed value for2429 * a reference that might even point at an object that2430 * has been garbage collected.2431 */2432if(refnames->nr ==1)2433error(_("could not delete reference%s:%s"),2434 refnames->items[0].string, err.buf);2435else2436error(_("could not delete references:%s"), err.buf);24372438goto out;2439}24402441for(i =0; i < refnames->nr; i++) {2442const char*refname = refnames->items[i].string;24432444if(delete_ref(refname, NULL,0))2445 result |=error(_("could not remove reference%s"), refname);2446}24472448out:2449strbuf_release(&err);2450return result;2451}24522453/*2454 * People using contrib's git-new-workdir have .git/logs/refs ->2455 * /some/other/path/.git/logs/refs, and that may live on another device.2456 *2457 * IOW, to avoid cross device rename errors, the temporary renamed log must2458 * live into logs/refs.2459 */2460#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"24612462static intrename_tmp_log(const char*newrefname)2463{2464int attempts_remaining =4;2465struct strbuf path = STRBUF_INIT;2466int ret = -1;24672468 retry:2469strbuf_reset(&path);2470strbuf_git_path(&path,"logs/%s", newrefname);2471switch(safe_create_leading_directories_const(path.buf)) {2472case SCLD_OK:2473break;/* success */2474case SCLD_VANISHED:2475if(--attempts_remaining >0)2476goto retry;2477/* fall through */2478default:2479error("unable to create directory for%s", newrefname);2480goto out;2481}24822483if(rename(git_path(TMP_RENAMED_LOG), path.buf)) {2484if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2485/*2486 * rename(a, b) when b is an existing2487 * directory ought to result in ISDIR, but2488 * Solaris 5.8 gives ENOTDIR. Sheesh.2489 */2490if(remove_empty_directories(&path)) {2491error("Directory not empty: logs/%s", newrefname);2492goto out;2493}2494goto retry;2495}else if(errno == ENOENT && --attempts_remaining >0) {2496/*2497 * Maybe another process just deleted one of2498 * the directories in the path to newrefname.2499 * Try again from the beginning.2500 */2501goto retry;2502}else{2503error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2504 newrefname,strerror(errno));2505goto out;2506}2507}2508 ret =0;2509out:2510strbuf_release(&path);2511return ret;2512}25132514intverify_refname_available(const char*newname,2515const struct string_list *extras,2516const struct string_list *skip,2517struct strbuf *err)2518{2519struct ref_dir *packed_refs =get_packed_refs(&ref_cache);2520struct ref_dir *loose_refs =get_loose_refs(&ref_cache);25212522if(verify_refname_available_dir(newname, extras, skip,2523 packed_refs, err) ||2524verify_refname_available_dir(newname, extras, skip,2525 loose_refs, err))2526return-1;25272528return0;2529}25302531static intwrite_ref_to_lockfile(struct ref_lock *lock,2532const unsigned char*sha1,struct strbuf *err);2533static intcommit_ref_update(struct ref_lock *lock,2534const unsigned char*sha1,const char*logmsg,2535struct strbuf *err);25362537intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2538{2539unsigned char sha1[20], orig_sha1[20];2540int flag =0, logmoved =0;2541struct ref_lock *lock;2542struct stat loginfo;2543int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2544struct strbuf err = STRBUF_INIT;25452546if(log &&S_ISLNK(loginfo.st_mode))2547returnerror("reflog for%sis a symlink", oldrefname);25482549if(!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2550 orig_sha1, &flag))2551returnerror("refname%snot found", oldrefname);25522553if(flag & REF_ISSYMREF)2554returnerror("refname%sis a symbolic ref, renaming it is not supported",2555 oldrefname);2556if(!rename_ref_available(oldrefname, newrefname))2557return1;25582559if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2560returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2561 oldrefname,strerror(errno));25622563if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2564error("unable to delete old%s", oldrefname);2565goto rollback;2566}25672568/*2569 * Since we are doing a shallow lookup, sha1 is not the2570 * correct value to pass to delete_ref as old_sha1. But that2571 * doesn't matter, because an old_sha1 check wouldn't add to2572 * the safety anyway; we want to delete the reference whatever2573 * its current value.2574 */2575if(!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2576 sha1, NULL) &&2577delete_ref(newrefname, NULL, REF_NODEREF)) {2578if(errno==EISDIR) {2579struct strbuf path = STRBUF_INIT;2580int result;25812582strbuf_git_path(&path,"%s", newrefname);2583 result =remove_empty_directories(&path);2584strbuf_release(&path);25852586if(result) {2587error("Directory not empty:%s", newrefname);2588goto rollback;2589}2590}else{2591error("unable to delete existing%s", newrefname);2592goto rollback;2593}2594}25952596if(log &&rename_tmp_log(newrefname))2597goto rollback;25982599 logmoved = log;26002601 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, REF_NODEREF,2602 NULL, &err);2603if(!lock) {2604error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2605strbuf_release(&err);2606goto rollback;2607}2608hashcpy(lock->old_oid.hash, orig_sha1);26092610if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2611commit_ref_update(lock, orig_sha1, logmsg, &err)) {2612error("unable to write current sha1 into%s:%s", newrefname, err.buf);2613strbuf_release(&err);2614goto rollback;2615}26162617return0;26182619 rollback:2620 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, REF_NODEREF,2621 NULL, &err);2622if(!lock) {2623error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2624strbuf_release(&err);2625goto rollbacklog;2626}26272628 flag = log_all_ref_updates;2629 log_all_ref_updates =0;2630if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2631commit_ref_update(lock, orig_sha1, NULL, &err)) {2632error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2633strbuf_release(&err);2634}2635 log_all_ref_updates = flag;26362637 rollbacklog:2638if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2639error("unable to restore logfile%sfrom%s:%s",2640 oldrefname, newrefname,strerror(errno));2641if(!logmoved && log &&2642rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2643error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2644 oldrefname,strerror(errno));26452646return1;2647}26482649static intclose_ref(struct ref_lock *lock)2650{2651if(close_lock_file(lock->lk))2652return-1;2653return0;2654}26552656static intcommit_ref(struct ref_lock *lock)2657{2658char*path =get_locked_file_path(lock->lk);2659struct stat st;26602661if(!lstat(path, &st) &&S_ISDIR(st.st_mode)) {2662/*2663 * There is a directory at the path we want to rename2664 * the lockfile to. Hopefully it is empty; try to2665 * delete it.2666 */2667size_t len =strlen(path);2668struct strbuf sb_path = STRBUF_INIT;26692670strbuf_attach(&sb_path, path, len, len);26712672/*2673 * If this fails, commit_lock_file() will also fail2674 * and will report the problem.2675 */2676remove_empty_directories(&sb_path);2677strbuf_release(&sb_path);2678}else{2679free(path);2680}26812682if(commit_lock_file(lock->lk))2683return-1;2684return0;2685}26862687/*2688 * Create a reflog for a ref. If force_create = 0, the reflog will2689 * only be created for certain refs (those for which2690 * should_autocreate_reflog returns non-zero. Otherwise, create it2691 * regardless of the ref name. Fill in *err and return -1 on failure.2692 */2693static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)2694{2695int logfd, oflags = O_APPEND | O_WRONLY;26962697strbuf_git_path(logfile,"logs/%s", refname);2698if(force_create ||should_autocreate_reflog(refname)) {2699if(safe_create_leading_directories(logfile->buf) <0) {2700strbuf_addf(err,"unable to create directory for '%s': "2701"%s", logfile->buf,strerror(errno));2702return-1;2703}2704 oflags |= O_CREAT;2705}27062707 logfd =open(logfile->buf, oflags,0666);2708if(logfd <0) {2709if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2710return0;27112712if(errno == EISDIR) {2713if(remove_empty_directories(logfile)) {2714strbuf_addf(err,"there are still logs under "2715"'%s'", logfile->buf);2716return-1;2717}2718 logfd =open(logfile->buf, oflags,0666);2719}27202721if(logfd <0) {2722strbuf_addf(err,"unable to append to '%s':%s",2723 logfile->buf,strerror(errno));2724return-1;2725}2726}27272728adjust_shared_perm(logfile->buf);2729close(logfd);2730return0;2731}273227332734intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)2735{2736int ret;2737struct strbuf sb = STRBUF_INIT;27382739 ret =log_ref_setup(refname, &sb, err, force_create);2740strbuf_release(&sb);2741return ret;2742}27432744static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2745const unsigned char*new_sha1,2746const char*committer,const char*msg)2747{2748int msglen, written;2749unsigned maxlen, len;2750char*logrec;27512752 msglen = msg ?strlen(msg) :0;2753 maxlen =strlen(committer) + msglen +100;2754 logrec =xmalloc(maxlen);2755 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2756sha1_to_hex(old_sha1),2757sha1_to_hex(new_sha1),2758 committer);2759if(msglen)2760 len +=copy_reflog_msg(logrec + len -1, msg) -1;27612762 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2763free(logrec);2764if(written != len)2765return-1;27662767return0;2768}27692770static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,2771const unsigned char*new_sha1,const char*msg,2772struct strbuf *logfile,int flags,2773struct strbuf *err)2774{2775int logfd, result, oflags = O_APPEND | O_WRONLY;27762777if(log_all_ref_updates <0)2778 log_all_ref_updates = !is_bare_repository();27792780 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);27812782if(result)2783return result;27842785 logfd =open(logfile->buf, oflags);2786if(logfd <0)2787return0;2788 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2789git_committer_info(0), msg);2790if(result) {2791strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2792strerror(errno));2793close(logfd);2794return-1;2795}2796if(close(logfd)) {2797strbuf_addf(err,"unable to append to '%s':%s", logfile->buf,2798strerror(errno));2799return-1;2800}2801return0;2802}28032804static intlog_ref_write(const char*refname,const unsigned char*old_sha1,2805const unsigned char*new_sha1,const char*msg,2806int flags,struct strbuf *err)2807{2808returnfiles_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2809 err);2810}28112812intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2813const unsigned char*new_sha1,const char*msg,2814int flags,struct strbuf *err)2815{2816struct strbuf sb = STRBUF_INIT;2817int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2818 err);2819strbuf_release(&sb);2820return ret;2821}28222823/*2824 * Write sha1 into the open lockfile, then close the lockfile. On2825 * errors, rollback the lockfile, fill in *err and2826 * return -1.2827 */2828static intwrite_ref_to_lockfile(struct ref_lock *lock,2829const unsigned char*sha1,struct strbuf *err)2830{2831static char term ='\n';2832struct object *o;2833int fd;28342835 o =parse_object(sha1);2836if(!o) {2837strbuf_addf(err,2838"trying to write ref '%s' with nonexistent object%s",2839 lock->ref_name,sha1_to_hex(sha1));2840unlock_ref(lock);2841return-1;2842}2843if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2844strbuf_addf(err,2845"trying to write non-commit object%sto branch '%s'",2846sha1_to_hex(sha1), lock->ref_name);2847unlock_ref(lock);2848return-1;2849}2850 fd =get_lock_file_fd(lock->lk);2851if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2852write_in_full(fd, &term,1) !=1||2853close_ref(lock) <0) {2854strbuf_addf(err,2855"couldn't write '%s'",get_lock_file_path(lock->lk));2856unlock_ref(lock);2857return-1;2858}2859return0;2860}28612862/*2863 * Commit a change to a loose reference that has already been written2864 * to the loose reference lockfile. Also update the reflogs if2865 * necessary, using the specified lockmsg (which can be NULL).2866 */2867static intcommit_ref_update(struct ref_lock *lock,2868const unsigned char*sha1,const char*logmsg,2869struct strbuf *err)2870{2871clear_loose_ref_cache(&ref_cache);2872if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg,0, err)) {2873char*old_msg =strbuf_detach(err, NULL);2874strbuf_addf(err,"cannot update the ref '%s':%s",2875 lock->ref_name, old_msg);2876free(old_msg);2877unlock_ref(lock);2878return-1;2879}28802881if(strcmp(lock->ref_name,"HEAD") !=0) {2882/*2883 * Special hack: If a branch is updated directly and HEAD2884 * points to it (may happen on the remote side of a push2885 * for example) then logically the HEAD reflog should be2886 * updated too.2887 * A generic solution implies reverse symref information,2888 * but finding all symrefs pointing to the given branch2889 * would be rather costly for this rare event (the direct2890 * update of a branch) to be worth it. So let's cheat and2891 * check with HEAD only which should cover 99% of all usage2892 * scenarios (even 100% of the default ones).2893 */2894unsigned char head_sha1[20];2895int head_flag;2896const char*head_ref;28972898 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,2899 head_sha1, &head_flag);2900if(head_ref && (head_flag & REF_ISSYMREF) &&2901!strcmp(head_ref, lock->ref_name)) {2902struct strbuf log_err = STRBUF_INIT;2903if(log_ref_write("HEAD", lock->old_oid.hash, sha1,2904 logmsg,0, &log_err)) {2905error("%s", log_err.buf);2906strbuf_release(&log_err);2907}2908}2909}29102911if(commit_ref(lock)) {2912strbuf_addf(err,"couldn't set '%s'", lock->ref_name);2913unlock_ref(lock);2914return-1;2915}29162917unlock_ref(lock);2918return0;2919}29202921static intcreate_ref_symlink(struct ref_lock *lock,const char*target)2922{2923int ret = -1;2924#ifndef NO_SYMLINK_HEAD2925char*ref_path =get_locked_file_path(lock->lk);2926unlink(ref_path);2927 ret =symlink(target, ref_path);2928free(ref_path);29292930if(ret)2931fprintf(stderr,"no symlink - falling back to symbolic ref\n");2932#endif2933return ret;2934}29352936static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,2937const char*target,const char*logmsg)2938{2939struct strbuf err = STRBUF_INIT;2940unsigned char new_sha1[20];2941if(logmsg && !read_ref(target, new_sha1) &&2942log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg,0, &err)) {2943error("%s", err.buf);2944strbuf_release(&err);2945}2946}29472948static intcreate_symref_locked(struct ref_lock *lock,const char*refname,2949const char*target,const char*logmsg)2950{2951if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {2952update_symref_reflog(lock, refname, target, logmsg);2953return0;2954}29552956if(!fdopen_lock_file(lock->lk,"w"))2957returnerror("unable to fdopen%s:%s",2958 lock->lk->tempfile.filename.buf,strerror(errno));29592960update_symref_reflog(lock, refname, target, logmsg);29612962/* no error check; commit_ref will check ferror */2963fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);2964if(commit_ref(lock) <0)2965returnerror("unable to write symref for%s:%s", refname,2966strerror(errno));2967return0;2968}29692970intcreate_symref(const char*refname,const char*target,const char*logmsg)2971{2972struct strbuf err = STRBUF_INIT;2973struct ref_lock *lock;2974int ret;29752976 lock =lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,2977&err);2978if(!lock) {2979error("%s", err.buf);2980strbuf_release(&err);2981return-1;2982}29832984 ret =create_symref_locked(lock, refname, target, logmsg);2985unlock_ref(lock);2986return ret;2987}29882989intset_worktree_head_symref(const char*gitdir,const char*target)2990{2991static struct lock_file head_lock;2992struct ref_lock *lock;2993struct strbuf head_path = STRBUF_INIT;2994const char*head_rel;2995int ret;29962997strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));2998if(hold_lock_file_for_update(&head_lock, head_path.buf,2999 LOCK_NO_DEREF) <0) {3000struct strbuf err = STRBUF_INIT;3001unable_to_lock_message(head_path.buf, errno, &err);3002error("%s", err.buf);3003strbuf_release(&err);3004strbuf_release(&head_path);3005return-1;3006}30073008/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3009 linked trees */3010 head_rel =remove_leading_path(head_path.buf,3011absolute_path(get_git_common_dir()));3012/* to make use of create_symref_locked(), initialize ref_lock */3013 lock =xcalloc(1,sizeof(struct ref_lock));3014 lock->lk = &head_lock;3015 lock->ref_name =xstrdup(head_rel);30163017 ret =create_symref_locked(lock, head_rel, target, NULL);30183019unlock_ref(lock);/* will free lock */3020strbuf_release(&head_path);3021return ret;3022}30233024intreflog_exists(const char*refname)3025{3026struct stat st;30273028return!lstat(git_path("logs/%s", refname), &st) &&3029S_ISREG(st.st_mode);3030}30313032intdelete_reflog(const char*refname)3033{3034returnremove_path(git_path("logs/%s", refname));3035}30363037static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3038{3039unsigned char osha1[20], nsha1[20];3040char*email_end, *message;3041unsigned long timestamp;3042int tz;30433044/* old SP new SP name <email> SP time TAB msg LF */3045if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3046get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3047get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3048!(email_end =strchr(sb->buf +82,'>')) ||3049 email_end[1] !=' '||3050!(timestamp =strtoul(email_end +2, &message,10)) ||3051!message || message[0] !=' '||3052(message[1] !='+'&& message[1] !='-') ||3053!isdigit(message[2]) || !isdigit(message[3]) ||3054!isdigit(message[4]) || !isdigit(message[5]))3055return0;/* corrupt? */3056 email_end[1] ='\0';3057 tz =strtol(message +1, NULL,10);3058if(message[6] !='\t')3059 message +=6;3060else3061 message +=7;3062returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3063}30643065static char*find_beginning_of_line(char*bob,char*scan)3066{3067while(bob < scan && *(--scan) !='\n')3068;/* keep scanning backwards */3069/*3070 * Return either beginning of the buffer, or LF at the end of3071 * the previous line.3072 */3073return scan;3074}30753076intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)3077{3078struct strbuf sb = STRBUF_INIT;3079FILE*logfp;3080long pos;3081int ret =0, at_tail =1;30823083 logfp =fopen(git_path("logs/%s", refname),"r");3084if(!logfp)3085return-1;30863087/* Jump to the end */3088if(fseek(logfp,0, SEEK_END) <0)3089returnerror("cannot seek back reflog for%s:%s",3090 refname,strerror(errno));3091 pos =ftell(logfp);3092while(!ret &&0< pos) {3093int cnt;3094size_t nread;3095char buf[BUFSIZ];3096char*endp, *scanp;30973098/* Fill next block from the end */3099 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3100if(fseek(logfp, pos - cnt, SEEK_SET))3101returnerror("cannot seek back reflog for%s:%s",3102 refname,strerror(errno));3103 nread =fread(buf, cnt,1, logfp);3104if(nread !=1)3105returnerror("cannot read%dbytes from reflog for%s:%s",3106 cnt, refname,strerror(errno));3107 pos -= cnt;31083109 scanp = endp = buf + cnt;3110if(at_tail && scanp[-1] =='\n')3111/* Looking at the final LF at the end of the file */3112 scanp--;3113 at_tail =0;31143115while(buf < scanp) {3116/*3117 * terminating LF of the previous line, or the beginning3118 * of the buffer.3119 */3120char*bp;31213122 bp =find_beginning_of_line(buf, scanp);31233124if(*bp =='\n') {3125/*3126 * The newline is the end of the previous line,3127 * so we know we have complete line starting3128 * at (bp + 1). Prefix it onto any prior data3129 * we collected for the line and process it.3130 */3131strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3132 scanp = bp;3133 endp = bp +1;3134 ret =show_one_reflog_ent(&sb, fn, cb_data);3135strbuf_reset(&sb);3136if(ret)3137break;3138}else if(!pos) {3139/*3140 * We are at the start of the buffer, and the3141 * start of the file; there is no previous3142 * line, and we have everything for this one.3143 * Process it, and we can end the loop.3144 */3145strbuf_splice(&sb,0,0, buf, endp - buf);3146 ret =show_one_reflog_ent(&sb, fn, cb_data);3147strbuf_reset(&sb);3148break;3149}31503151if(bp == buf) {3152/*3153 * We are at the start of the buffer, and there3154 * is more file to read backwards. Which means3155 * we are in the middle of a line. Note that we3156 * may get here even if *bp was a newline; that3157 * just means we are at the exact end of the3158 * previous line, rather than some spot in the3159 * middle.3160 *3161 * Save away what we have to be combined with3162 * the data from the next read.3163 */3164strbuf_splice(&sb,0,0, buf, endp - buf);3165break;3166}3167}31683169}3170if(!ret && sb.len)3171die("BUG: reverse reflog parser had leftover data");31723173fclose(logfp);3174strbuf_release(&sb);3175return ret;3176}31773178intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3179{3180FILE*logfp;3181struct strbuf sb = STRBUF_INIT;3182int ret =0;31833184 logfp =fopen(git_path("logs/%s", refname),"r");3185if(!logfp)3186return-1;31873188while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3189 ret =show_one_reflog_ent(&sb, fn, cb_data);3190fclose(logfp);3191strbuf_release(&sb);3192return ret;3193}3194/*3195 * Call fn for each reflog in the namespace indicated by name. name3196 * must be empty or end with '/'. Name will be used as a scratch3197 * space, but its contents will be restored before return.3198 */3199static intdo_for_each_reflog(struct strbuf *name, each_ref_fn fn,void*cb_data)3200{3201DIR*d =opendir(git_path("logs/%s", name->buf));3202int retval =0;3203struct dirent *de;3204int oldlen = name->len;32053206if(!d)3207return name->len ? errno :0;32083209while((de =readdir(d)) != NULL) {3210struct stat st;32113212if(de->d_name[0] =='.')3213continue;3214if(ends_with(de->d_name,".lock"))3215continue;3216strbuf_addstr(name, de->d_name);3217if(stat(git_path("logs/%s", name->buf), &st) <0) {3218;/* silently ignore */3219}else{3220if(S_ISDIR(st.st_mode)) {3221strbuf_addch(name,'/');3222 retval =do_for_each_reflog(name, fn, cb_data);3223}else{3224struct object_id oid;32253226if(read_ref_full(name->buf,0, oid.hash, NULL))3227 retval =error("bad ref for%s", name->buf);3228else3229 retval =fn(name->buf, &oid,0, cb_data);3230}3231if(retval)3232break;3233}3234strbuf_setlen(name, oldlen);3235}3236closedir(d);3237return retval;3238}32393240intfor_each_reflog(each_ref_fn fn,void*cb_data)3241{3242int retval;3243struct strbuf name;3244strbuf_init(&name, PATH_MAX);3245 retval =do_for_each_reflog(&name, fn, cb_data);3246strbuf_release(&name);3247return retval;3248}32493250static intref_update_reject_duplicates(struct string_list *refnames,3251struct strbuf *err)3252{3253int i, n = refnames->nr;32543255assert(err);32563257for(i =1; i < n; i++)3258if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3259strbuf_addf(err,3260"multiple updates for ref '%s' not allowed.",3261 refnames->items[i].string);3262return1;3263}3264return0;3265}32663267/*3268 * If update is a direct update of head_ref (the reference pointed to3269 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3270 */3271static intsplit_head_update(struct ref_update *update,3272struct ref_transaction *transaction,3273const char*head_ref,3274struct string_list *affected_refnames,3275struct strbuf *err)3276{3277struct string_list_item *item;3278struct ref_update *new_update;32793280if((update->flags & REF_LOG_ONLY) ||3281(update->flags & REF_ISPRUNING) ||3282(update->flags & REF_UPDATE_VIA_HEAD))3283return0;32843285if(strcmp(update->refname, head_ref))3286return0;32873288/*3289 * First make sure that HEAD is not already in the3290 * transaction. This insertion is O(N) in the transaction3291 * size, but it happens at most once per transaction.3292 */3293 item =string_list_insert(affected_refnames,"HEAD");3294if(item->util) {3295/* An entry already existed */3296strbuf_addf(err,3297"multiple updates for 'HEAD' (including one "3298"via its referent '%s') are not allowed",3299 update->refname);3300return TRANSACTION_NAME_CONFLICT;3301}33023303 new_update =ref_transaction_add_update(3304 transaction,"HEAD",3305 update->flags | REF_LOG_ONLY | REF_NODEREF,3306 update->new_sha1, update->old_sha1,3307 update->msg);33083309 item->util = new_update;33103311return0;3312}33133314/*3315 * update is for a symref that points at referent and doesn't have3316 * REF_NODEREF set. Split it into two updates:3317 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3318 * - A new, separate update for the referent reference3319 * Note that the new update will itself be subject to splitting when3320 * the iteration gets to it.3321 */3322static intsplit_symref_update(struct ref_update *update,3323const char*referent,3324struct ref_transaction *transaction,3325struct string_list *affected_refnames,3326struct strbuf *err)3327{3328struct string_list_item *item;3329struct ref_update *new_update;3330unsigned int new_flags;33313332/*3333 * First make sure that referent is not already in the3334 * transaction. This insertion is O(N) in the transaction3335 * size, but it happens at most once per symref in a3336 * transaction.3337 */3338 item =string_list_insert(affected_refnames, referent);3339if(item->util) {3340/* An entry already existed */3341strbuf_addf(err,3342"multiple updates for '%s' (including one "3343"via symref '%s') are not allowed",3344 referent, update->refname);3345return TRANSACTION_NAME_CONFLICT;3346}33473348 new_flags = update->flags;3349if(!strcmp(update->refname,"HEAD")) {3350/*3351 * Record that the new update came via HEAD, so that3352 * when we process it, split_head_update() doesn't try3353 * to add another reflog update for HEAD. Note that3354 * this bit will be propagated if the new_update3355 * itself needs to be split.3356 */3357 new_flags |= REF_UPDATE_VIA_HEAD;3358}33593360 new_update =ref_transaction_add_update(3361 transaction, referent, new_flags,3362 update->new_sha1, update->old_sha1,3363 update->msg);33643365 new_update->parent_update = update;33663367/*3368 * Change the symbolic ref update to log only. Also, it3369 * doesn't need to check its old SHA-1 value, as that will be3370 * done when new_update is processed.3371 */3372 update->flags |= REF_LOG_ONLY | REF_NODEREF;3373 update->flags &= ~REF_HAVE_OLD;33743375 item->util = new_update;33763377return0;3378}33793380/*3381 * Return the refname under which update was originally requested.3382 */3383static const char*original_update_refname(struct ref_update *update)3384{3385while(update->parent_update)3386 update = update->parent_update;33873388return update->refname;3389}33903391/*3392 * Check whether the REF_HAVE_OLD and old_oid values stored in update3393 * are consistent with oid, which is the reference's current value. If3394 * everything is OK, return 0; otherwise, write an error message to3395 * err and return -1.3396 */3397static intcheck_old_oid(struct ref_update *update,struct object_id *oid,3398struct strbuf *err)3399{3400if(!(update->flags & REF_HAVE_OLD) ||3401!hashcmp(oid->hash, update->old_sha1))3402return0;34033404if(is_null_sha1(update->old_sha1))3405strbuf_addf(err,"cannot lock ref '%s': "3406"reference already exists",3407original_update_refname(update));3408else if(is_null_oid(oid))3409strbuf_addf(err,"cannot lock ref '%s': "3410"reference is missing but expected%s",3411original_update_refname(update),3412sha1_to_hex(update->old_sha1));3413else3414strbuf_addf(err,"cannot lock ref '%s': "3415"is at%sbut expected%s",3416original_update_refname(update),3417oid_to_hex(oid),3418sha1_to_hex(update->old_sha1));34193420return-1;3421}34223423/*3424 * Prepare for carrying out update:3425 * - Lock the reference referred to by update.3426 * - Read the reference under lock.3427 * - Check that its old SHA-1 value (if specified) is correct, and in3428 * any case record it in update->lock->old_oid for later use when3429 * writing the reflog.3430 * - If it is a symref update without REF_NODEREF, split it up into a3431 * REF_LOG_ONLY update of the symref and add a separate update for3432 * the referent to transaction.3433 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3434 * update of HEAD.3435 */3436static intlock_ref_for_update(struct ref_update *update,3437struct ref_transaction *transaction,3438const char*head_ref,3439struct string_list *affected_refnames,3440struct strbuf *err)3441{3442struct strbuf referent = STRBUF_INIT;3443int mustexist = (update->flags & REF_HAVE_OLD) &&3444!is_null_sha1(update->old_sha1);3445int ret;3446struct ref_lock *lock;34473448if((update->flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1))3449 update->flags |= REF_DELETING;34503451if(head_ref) {3452 ret =split_head_update(update, transaction, head_ref,3453 affected_refnames, err);3454if(ret)3455return ret;3456}34573458 ret =lock_raw_ref(update->refname, mustexist,3459 affected_refnames, NULL,3460&update->lock, &referent,3461&update->type, err);34623463if(ret) {3464char*reason;34653466 reason =strbuf_detach(err, NULL);3467strbuf_addf(err,"cannot lock ref '%s':%s",3468original_update_refname(update), reason);3469free(reason);3470return ret;3471}34723473 lock = update->lock;34743475if(update->type & REF_ISSYMREF) {3476if(update->flags & REF_NODEREF) {3477/*3478 * We won't be reading the referent as part of3479 * the transaction, so we have to read it here3480 * to record and possibly check old_sha1:3481 */3482if(read_ref_full(referent.buf,0,3483 lock->old_oid.hash, NULL)) {3484if(update->flags & REF_HAVE_OLD) {3485strbuf_addf(err,"cannot lock ref '%s': "3486"error reading reference",3487original_update_refname(update));3488return-1;3489}3490}else if(check_old_oid(update, &lock->old_oid, err)) {3491return TRANSACTION_GENERIC_ERROR;3492}3493}else{3494/*3495 * Create a new update for the reference this3496 * symref is pointing at. Also, we will record3497 * and verify old_sha1 for this update as part3498 * of processing the split-off update, so we3499 * don't have to do it here.3500 */3501 ret =split_symref_update(update, referent.buf, transaction,3502 affected_refnames, err);3503if(ret)3504return ret;3505}3506}else{3507struct ref_update *parent_update;35083509if(check_old_oid(update, &lock->old_oid, err))3510return TRANSACTION_GENERIC_ERROR;35113512/*3513 * If this update is happening indirectly because of a3514 * symref update, record the old SHA-1 in the parent3515 * update:3516 */3517for(parent_update = update->parent_update;3518 parent_update;3519 parent_update = parent_update->parent_update) {3520oidcpy(&parent_update->lock->old_oid, &lock->old_oid);3521}3522}35233524if((update->flags & REF_HAVE_NEW) &&3525!(update->flags & REF_DELETING) &&3526!(update->flags & REF_LOG_ONLY)) {3527if(!(update->type & REF_ISSYMREF) &&3528!hashcmp(lock->old_oid.hash, update->new_sha1)) {3529/*3530 * The reference already has the desired3531 * value, so we don't need to write it.3532 */3533}else if(write_ref_to_lockfile(lock, update->new_sha1,3534 err)) {3535char*write_err =strbuf_detach(err, NULL);35363537/*3538 * The lock was freed upon failure of3539 * write_ref_to_lockfile():3540 */3541 update->lock = NULL;3542strbuf_addf(err,3543"cannot update ref '%s':%s",3544 update->refname, write_err);3545free(write_err);3546return TRANSACTION_GENERIC_ERROR;3547}else{3548 update->flags |= REF_NEEDS_COMMIT;3549}3550}3551if(!(update->flags & REF_NEEDS_COMMIT)) {3552/*3553 * We didn't call write_ref_to_lockfile(), so3554 * the lockfile is still open. Close it to3555 * free up the file descriptor:3556 */3557if(close_ref(lock)) {3558strbuf_addf(err,"couldn't close '%s.lock'",3559 update->refname);3560return TRANSACTION_GENERIC_ERROR;3561}3562}3563return0;3564}35653566intref_transaction_commit(struct ref_transaction *transaction,3567struct strbuf *err)3568{3569int ret =0, i;3570struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3571struct string_list_item *ref_to_delete;3572struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3573char*head_ref = NULL;3574int head_type;3575struct object_id head_oid;35763577assert(err);35783579if(transaction->state != REF_TRANSACTION_OPEN)3580die("BUG: commit called for transaction that is not open");35813582if(!transaction->nr) {3583 transaction->state = REF_TRANSACTION_CLOSED;3584return0;3585}35863587/*3588 * Fail if a refname appears more than once in the3589 * transaction. (If we end up splitting up any updates using3590 * split_symref_update() or split_head_update(), those3591 * functions will check that the new updates don't have the3592 * same refname as any existing ones.)3593 */3594for(i =0; i < transaction->nr; i++) {3595struct ref_update *update = transaction->updates[i];3596struct string_list_item *item =3597string_list_append(&affected_refnames, update->refname);35983599/*3600 * We store a pointer to update in item->util, but at3601 * the moment we never use the value of this field3602 * except to check whether it is non-NULL.3603 */3604 item->util = update;3605}3606string_list_sort(&affected_refnames);3607if(ref_update_reject_duplicates(&affected_refnames, err)) {3608 ret = TRANSACTION_GENERIC_ERROR;3609goto cleanup;3610}36113612/*3613 * Special hack: If a branch is updated directly and HEAD3614 * points to it (may happen on the remote side of a push3615 * for example) then logically the HEAD reflog should be3616 * updated too.3617 *3618 * A generic solution would require reverse symref lookups,3619 * but finding all symrefs pointing to a given branch would be3620 * rather costly for this rare event (the direct update of a3621 * branch) to be worth it. So let's cheat and check with HEAD3622 * only, which should cover 99% of all usage scenarios (even3623 * 100% of the default ones).3624 *3625 * So if HEAD is a symbolic reference, then record the name of3626 * the reference that it points to. If we see an update of3627 * head_ref within the transaction, then split_head_update()3628 * arranges for the reflog of HEAD to be updated, too.3629 */3630 head_ref =resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3631 head_oid.hash, &head_type);36323633if(head_ref && !(head_type & REF_ISSYMREF)) {3634free(head_ref);3635 head_ref = NULL;3636}36373638/*3639 * Acquire all locks, verify old values if provided, check3640 * that new values are valid, and write new values to the3641 * lockfiles, ready to be activated. Only keep one lockfile3642 * open at a time to avoid running out of file descriptors.3643 */3644for(i =0; i < transaction->nr; i++) {3645struct ref_update *update = transaction->updates[i];36463647 ret =lock_ref_for_update(update, transaction, head_ref,3648&affected_refnames, err);3649if(ret)3650goto cleanup;3651}36523653/* Perform updates first so live commits remain referenced */3654for(i =0; i < transaction->nr; i++) {3655struct ref_update *update = transaction->updates[i];3656struct ref_lock *lock = update->lock;36573658if(update->flags & REF_NEEDS_COMMIT ||3659 update->flags & REF_LOG_ONLY) {3660if(log_ref_write(lock->ref_name, lock->old_oid.hash,3661 update->new_sha1,3662 update->msg, update->flags, err)) {3663char*old_msg =strbuf_detach(err, NULL);36643665strbuf_addf(err,"cannot update the ref '%s':%s",3666 lock->ref_name, old_msg);3667free(old_msg);3668unlock_ref(lock);3669 update->lock = NULL;3670 ret = TRANSACTION_GENERIC_ERROR;3671goto cleanup;3672}3673}3674if(update->flags & REF_NEEDS_COMMIT) {3675clear_loose_ref_cache(&ref_cache);3676if(commit_ref(lock)) {3677strbuf_addf(err,"couldn't set '%s'", lock->ref_name);3678unlock_ref(lock);3679 update->lock = NULL;3680 ret = TRANSACTION_GENERIC_ERROR;3681goto cleanup;3682}3683}3684}3685/* Perform deletes now that updates are safely completed */3686for(i =0; i < transaction->nr; i++) {3687struct ref_update *update = transaction->updates[i];36883689if(update->flags & REF_DELETING &&3690!(update->flags & REF_LOG_ONLY)) {3691if(delete_ref_loose(update->lock, update->type, err)) {3692 ret = TRANSACTION_GENERIC_ERROR;3693goto cleanup;3694}36953696if(!(update->flags & REF_ISPRUNING))3697string_list_append(&refs_to_delete,3698 update->lock->ref_name);3699}3700}37013702if(repack_without_refs(&refs_to_delete, err)) {3703 ret = TRANSACTION_GENERIC_ERROR;3704goto cleanup;3705}3706for_each_string_list_item(ref_to_delete, &refs_to_delete)3707unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3708clear_loose_ref_cache(&ref_cache);37093710cleanup:3711 transaction->state = REF_TRANSACTION_CLOSED;37123713for(i =0; i < transaction->nr; i++)3714if(transaction->updates[i]->lock)3715unlock_ref(transaction->updates[i]->lock);3716string_list_clear(&refs_to_delete,0);3717free(head_ref);3718string_list_clear(&affected_refnames,0);37193720return ret;3721}37223723static intref_present(const char*refname,3724const struct object_id *oid,int flags,void*cb_data)3725{3726struct string_list *affected_refnames = cb_data;37273728returnstring_list_has_string(affected_refnames, refname);3729}37303731intinitial_ref_transaction_commit(struct ref_transaction *transaction,3732struct strbuf *err)3733{3734int ret =0, i;3735struct string_list affected_refnames = STRING_LIST_INIT_NODUP;37363737assert(err);37383739if(transaction->state != REF_TRANSACTION_OPEN)3740die("BUG: commit called for transaction that is not open");37413742/* Fail if a refname appears more than once in the transaction: */3743for(i =0; i < transaction->nr; i++)3744string_list_append(&affected_refnames,3745 transaction->updates[i]->refname);3746string_list_sort(&affected_refnames);3747if(ref_update_reject_duplicates(&affected_refnames, err)) {3748 ret = TRANSACTION_GENERIC_ERROR;3749goto cleanup;3750}37513752/*3753 * It's really undefined to call this function in an active3754 * repository or when there are existing references: we are3755 * only locking and changing packed-refs, so (1) any3756 * simultaneous processes might try to change a reference at3757 * the same time we do, and (2) any existing loose versions of3758 * the references that we are setting would have precedence3759 * over our values. But some remote helpers create the remote3760 * "HEAD" and "master" branches before calling this function,3761 * so here we really only check that none of the references3762 * that we are creating already exists.3763 */3764if(for_each_rawref(ref_present, &affected_refnames))3765die("BUG: initial ref transaction called with existing refs");37663767for(i =0; i < transaction->nr; i++) {3768struct ref_update *update = transaction->updates[i];37693770if((update->flags & REF_HAVE_OLD) &&3771!is_null_sha1(update->old_sha1))3772die("BUG: initial ref transaction with old_sha1 set");3773if(verify_refname_available(update->refname,3774&affected_refnames, NULL,3775 err)) {3776 ret = TRANSACTION_NAME_CONFLICT;3777goto cleanup;3778}3779}37803781if(lock_packed_refs(0)) {3782strbuf_addf(err,"unable to lock packed-refs file:%s",3783strerror(errno));3784 ret = TRANSACTION_GENERIC_ERROR;3785goto cleanup;3786}37873788for(i =0; i < transaction->nr; i++) {3789struct ref_update *update = transaction->updates[i];37903791if((update->flags & REF_HAVE_NEW) &&3792!is_null_sha1(update->new_sha1))3793add_packed_ref(update->refname, update->new_sha1);3794}37953796if(commit_packed_refs()) {3797strbuf_addf(err,"unable to commit packed-refs file:%s",3798strerror(errno));3799 ret = TRANSACTION_GENERIC_ERROR;3800goto cleanup;3801}38023803cleanup:3804 transaction->state = REF_TRANSACTION_CLOSED;3805string_list_clear(&affected_refnames,0);3806return ret;3807}38083809struct expire_reflog_cb {3810unsigned int flags;3811 reflog_expiry_should_prune_fn *should_prune_fn;3812void*policy_cb;3813FILE*newlog;3814unsigned char last_kept_sha1[20];3815};38163817static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3818const char*email,unsigned long timestamp,int tz,3819const char*message,void*cb_data)3820{3821struct expire_reflog_cb *cb = cb_data;3822struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;38233824if(cb->flags & EXPIRE_REFLOGS_REWRITE)3825 osha1 = cb->last_kept_sha1;38263827if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3828 message, policy_cb)) {3829if(!cb->newlog)3830printf("would prune%s", message);3831else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3832printf("prune%s", message);3833}else{3834if(cb->newlog) {3835fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3836sha1_to_hex(osha1),sha1_to_hex(nsha1),3837 email, timestamp, tz, message);3838hashcpy(cb->last_kept_sha1, nsha1);3839}3840if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3841printf("keep%s", message);3842}3843return0;3844}38453846intreflog_expire(const char*refname,const unsigned char*sha1,3847unsigned int flags,3848 reflog_expiry_prepare_fn prepare_fn,3849 reflog_expiry_should_prune_fn should_prune_fn,3850 reflog_expiry_cleanup_fn cleanup_fn,3851void*policy_cb_data)3852{3853static struct lock_file reflog_lock;3854struct expire_reflog_cb cb;3855struct ref_lock *lock;3856char*log_file;3857int status =0;3858int type;3859struct strbuf err = STRBUF_INIT;38603861memset(&cb,0,sizeof(cb));3862 cb.flags = flags;3863 cb.policy_cb = policy_cb_data;3864 cb.should_prune_fn = should_prune_fn;38653866/*3867 * The reflog file is locked by holding the lock on the3868 * reference itself, plus we might need to update the3869 * reference if --updateref was specified:3870 */3871 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,3872&type, &err);3873if(!lock) {3874error("cannot lock ref '%s':%s", refname, err.buf);3875strbuf_release(&err);3876return-1;3877}3878if(!reflog_exists(refname)) {3879unlock_ref(lock);3880return0;3881}38823883 log_file =git_pathdup("logs/%s", refname);3884if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3885/*3886 * Even though holding $GIT_DIR/logs/$reflog.lock has3887 * no locking implications, we use the lock_file3888 * machinery here anyway because it does a lot of the3889 * work we need, including cleaning up if the program3890 * exits unexpectedly.3891 */3892if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {3893struct strbuf err = STRBUF_INIT;3894unable_to_lock_message(log_file, errno, &err);3895error("%s", err.buf);3896strbuf_release(&err);3897goto failure;3898}3899 cb.newlog =fdopen_lock_file(&reflog_lock,"w");3900if(!cb.newlog) {3901error("cannot fdopen%s(%s)",3902get_lock_file_path(&reflog_lock),strerror(errno));3903goto failure;3904}3905}39063907(*prepare_fn)(refname, sha1, cb.policy_cb);3908for_each_reflog_ent(refname, expire_reflog_ent, &cb);3909(*cleanup_fn)(cb.policy_cb);39103911if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3912/*3913 * It doesn't make sense to adjust a reference pointed3914 * to by a symbolic ref based on expiring entries in3915 * the symbolic reference's reflog. Nor can we update3916 * a reference if there are no remaining reflog3917 * entries.3918 */3919int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&3920!(type & REF_ISSYMREF) &&3921!is_null_sha1(cb.last_kept_sha1);39223923if(close_lock_file(&reflog_lock)) {3924 status |=error("couldn't write%s:%s", log_file,3925strerror(errno));3926}else if(update &&3927(write_in_full(get_lock_file_fd(lock->lk),3928sha1_to_hex(cb.last_kept_sha1),40) !=40||3929write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||3930close_ref(lock) <0)) {3931 status |=error("couldn't write%s",3932get_lock_file_path(lock->lk));3933rollback_lock_file(&reflog_lock);3934}else if(commit_lock_file(&reflog_lock)) {3935 status |=error("unable to write reflog '%s' (%s)",3936 log_file,strerror(errno));3937}else if(update &&commit_ref(lock)) {3938 status |=error("couldn't set%s", lock->ref_name);3939}3940}3941free(log_file);3942unlock_ref(lock);3943return status;39443945 failure:3946rollback_lock_file(&reflog_lock);3947free(log_file);3948unlock_ref(lock);3949return-1;3950}