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; 10char*orig_ref_name; 11struct lock_file *lk; 12struct object_id old_oid; 13}; 14 15struct ref_entry; 16 17/* 18 * Information used (along with the information in ref_entry) to 19 * describe a single cached reference. This data structure only 20 * occurs embedded in a union in struct ref_entry, and only when 21 * (ref_entry->flag & REF_DIR) is zero. 22 */ 23struct ref_value { 24/* 25 * The name of the object to which this reference resolves 26 * (which may be a tag object). If REF_ISBROKEN, this is 27 * null. If REF_ISSYMREF, then this is the name of the object 28 * referred to by the last reference in the symlink chain. 29 */ 30struct object_id oid; 31 32/* 33 * If REF_KNOWS_PEELED, then this field holds the peeled value 34 * of this reference, or null if the reference is known not to 35 * be peelable. See the documentation for peel_ref() for an 36 * exact definition of "peelable". 37 */ 38struct object_id peeled; 39}; 40 41struct ref_cache; 42 43/* 44 * Information used (along with the information in ref_entry) to 45 * describe a level in the hierarchy of references. This data 46 * structure only occurs embedded in a union in struct ref_entry, and 47 * only when (ref_entry.flag & REF_DIR) is set. In that case, 48 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 49 * in the directory have already been read: 50 * 51 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 52 * or packed references, already read. 53 * 54 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 55 * references that hasn't been read yet (nor has any of its 56 * subdirectories). 57 * 58 * Entries within a directory are stored within a growable array of 59 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 60 * sorted are sorted by their component name in strcmp() order and the 61 * remaining entries are unsorted. 62 * 63 * Loose references are read lazily, one directory at a time. When a 64 * directory of loose references is read, then all of the references 65 * in that directory are stored, and REF_INCOMPLETE stubs are created 66 * for any subdirectories, but the subdirectories themselves are not 67 * read. The reading is triggered by get_ref_dir(). 68 */ 69struct ref_dir { 70int nr, alloc; 71 72/* 73 * Entries with index 0 <= i < sorted are sorted by name. New 74 * entries are appended to the list unsorted, and are sorted 75 * only when required; thus we avoid the need to sort the list 76 * after the addition of every reference. 77 */ 78int sorted; 79 80/* A pointer to the ref_cache that contains this ref_dir. */ 81struct ref_cache *ref_cache; 82 83struct ref_entry **entries; 84}; 85 86/* 87 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 88 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 89 * public values; see refs.h. 90 */ 91 92/* 93 * The field ref_entry->u.value.peeled of this value entry contains 94 * the correct peeled value for the reference, which might be 95 * null_sha1 if the reference is not a tag or if it is broken. 96 */ 97#define REF_KNOWS_PEELED 0x10 98 99/* ref_entry represents a directory of references */ 100#define REF_DIR 0x20 101 102/* 103 * Entry has not yet been read from disk (used only for REF_DIR 104 * entries representing loose references) 105 */ 106#define REF_INCOMPLETE 0x40 107 108/* 109 * A ref_entry represents either a reference or a "subdirectory" of 110 * references. 111 * 112 * Each directory in the reference namespace is represented by a 113 * ref_entry with (flags & REF_DIR) set and containing a subdir member 114 * that holds the entries in that directory that have been read so 115 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 116 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 117 * used for loose reference directories. 118 * 119 * References are represented by a ref_entry with (flags & REF_DIR) 120 * unset and a value member that describes the reference's value. The 121 * flag member is at the ref_entry level, but it is also needed to 122 * interpret the contents of the value field (in other words, a 123 * ref_value object is not very much use without the enclosing 124 * ref_entry). 125 * 126 * Reference names cannot end with slash and directories' names are 127 * always stored with a trailing slash (except for the top-level 128 * directory, which is always denoted by ""). This has two nice 129 * consequences: (1) when the entries in each subdir are sorted 130 * lexicographically by name (as they usually are), the references in 131 * a whole tree can be generated in lexicographic order by traversing 132 * the tree in left-to-right, depth-first order; (2) the names of 133 * references and subdirectories cannot conflict, and therefore the 134 * presence of an empty subdirectory does not block the creation of a 135 * similarly-named reference. (The fact that reference names with the 136 * same leading components can conflict *with each other* is a 137 * separate issue that is regulated by verify_refname_available().) 138 * 139 * Please note that the name field contains the fully-qualified 140 * reference (or subdirectory) name. Space could be saved by only 141 * storing the relative names. But that would require the full names 142 * to be generated on the fly when iterating in do_for_each_ref(), and 143 * would break callback functions, who have always been able to assume 144 * that the name strings that they are passed will not be freed during 145 * the iteration. 146 */ 147struct ref_entry { 148unsigned char flag;/* ISSYMREF? ISPACKED? */ 149union{ 150struct ref_value value;/* if not (flags&REF_DIR) */ 151struct ref_dir subdir;/* if (flags&REF_DIR) */ 152} u; 153/* 154 * The full name of the reference (e.g., "refs/heads/master") 155 * or the full name of the directory with a trailing slash 156 * (e.g., "refs/heads/"): 157 */ 158char name[FLEX_ARRAY]; 159}; 160 161static voidread_loose_refs(const char*dirname,struct ref_dir *dir); 162static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len); 163static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 164const char*dirname,size_t len, 165int incomplete); 166static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry); 167 168static struct ref_dir *get_ref_dir(struct ref_entry *entry) 169{ 170struct ref_dir *dir; 171assert(entry->flag & REF_DIR); 172 dir = &entry->u.subdir; 173if(entry->flag & REF_INCOMPLETE) { 174read_loose_refs(entry->name, dir); 175 176/* 177 * Manually add refs/bisect, which, being 178 * per-worktree, might not appear in the directory 179 * listing for refs/ in the main repo. 180 */ 181if(!strcmp(entry->name,"refs/")) { 182int pos =search_ref_dir(dir,"refs/bisect/",12); 183if(pos <0) { 184struct ref_entry *child_entry; 185 child_entry =create_dir_entry(dir->ref_cache, 186"refs/bisect/", 18712,1); 188add_entry_to_dir(dir, child_entry); 189read_loose_refs("refs/bisect", 190&child_entry->u.subdir); 191} 192} 193 entry->flag &= ~REF_INCOMPLETE; 194} 195return dir; 196} 197 198static struct ref_entry *create_ref_entry(const char*refname, 199const unsigned char*sha1,int flag, 200int check_name) 201{ 202struct ref_entry *ref; 203 204if(check_name && 205check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 206die("Reference has invalid format: '%s'", refname); 207FLEX_ALLOC_STR(ref, name, refname); 208hashcpy(ref->u.value.oid.hash, sha1); 209oidclr(&ref->u.value.peeled); 210 ref->flag = flag; 211return ref; 212} 213 214static voidclear_ref_dir(struct ref_dir *dir); 215 216static voidfree_ref_entry(struct ref_entry *entry) 217{ 218if(entry->flag & REF_DIR) { 219/* 220 * Do not use get_ref_dir() here, as that might 221 * trigger the reading of loose refs. 222 */ 223clear_ref_dir(&entry->u.subdir); 224} 225free(entry); 226} 227 228/* 229 * Add a ref_entry to the end of dir (unsorted). Entry is always 230 * stored directly in dir; no recursion into subdirectories is 231 * done. 232 */ 233static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry) 234{ 235ALLOC_GROW(dir->entries, dir->nr +1, dir->alloc); 236 dir->entries[dir->nr++] = entry; 237/* optimize for the case that entries are added in order */ 238if(dir->nr ==1|| 239(dir->nr == dir->sorted +1&& 240strcmp(dir->entries[dir->nr -2]->name, 241 dir->entries[dir->nr -1]->name) <0)) 242 dir->sorted = dir->nr; 243} 244 245/* 246 * Clear and free all entries in dir, recursively. 247 */ 248static voidclear_ref_dir(struct ref_dir *dir) 249{ 250int i; 251for(i =0; i < dir->nr; i++) 252free_ref_entry(dir->entries[i]); 253free(dir->entries); 254 dir->sorted = dir->nr = dir->alloc =0; 255 dir->entries = NULL; 256} 257 258/* 259 * Create a struct ref_entry object for the specified dirname. 260 * dirname is the name of the directory with a trailing slash (e.g., 261 * "refs/heads/") or "" for the top-level directory. 262 */ 263static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 264const char*dirname,size_t len, 265int incomplete) 266{ 267struct ref_entry *direntry; 268FLEX_ALLOC_MEM(direntry, name, dirname, len); 269 direntry->u.subdir.ref_cache = ref_cache; 270 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE :0); 271return direntry; 272} 273 274static intref_entry_cmp(const void*a,const void*b) 275{ 276struct ref_entry *one = *(struct ref_entry **)a; 277struct ref_entry *two = *(struct ref_entry **)b; 278returnstrcmp(one->name, two->name); 279} 280 281static voidsort_ref_dir(struct ref_dir *dir); 282 283struct string_slice { 284size_t len; 285const char*str; 286}; 287 288static intref_entry_cmp_sslice(const void*key_,const void*ent_) 289{ 290const struct string_slice *key = key_; 291const struct ref_entry *ent = *(const struct ref_entry *const*)ent_; 292int cmp =strncmp(key->str, ent->name, key->len); 293if(cmp) 294return cmp; 295return'\0'- (unsigned char)ent->name[key->len]; 296} 297 298/* 299 * Return the index of the entry with the given refname from the 300 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 301 * no such entry is found. dir must already be complete. 302 */ 303static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len) 304{ 305struct ref_entry **r; 306struct string_slice key; 307 308if(refname == NULL || !dir->nr) 309return-1; 310 311sort_ref_dir(dir); 312 key.len = len; 313 key.str = refname; 314 r =bsearch(&key, dir->entries, dir->nr,sizeof(*dir->entries), 315 ref_entry_cmp_sslice); 316 317if(r == NULL) 318return-1; 319 320return r - dir->entries; 321} 322 323/* 324 * Search for a directory entry directly within dir (without 325 * recursing). Sort dir if necessary. subdirname must be a directory 326 * name (i.e., end in '/'). If mkdir is set, then create the 327 * directory if it is missing; otherwise, return NULL if the desired 328 * directory cannot be found. dir must already be complete. 329 */ 330static struct ref_dir *search_for_subdir(struct ref_dir *dir, 331const char*subdirname,size_t len, 332int mkdir) 333{ 334int entry_index =search_ref_dir(dir, subdirname, len); 335struct ref_entry *entry; 336if(entry_index == -1) { 337if(!mkdir) 338return NULL; 339/* 340 * Since dir is complete, the absence of a subdir 341 * means that the subdir really doesn't exist; 342 * therefore, create an empty record for it but mark 343 * the record complete. 344 */ 345 entry =create_dir_entry(dir->ref_cache, subdirname, len,0); 346add_entry_to_dir(dir, entry); 347}else{ 348 entry = dir->entries[entry_index]; 349} 350returnget_ref_dir(entry); 351} 352 353/* 354 * If refname is a reference name, find the ref_dir within the dir 355 * tree that should hold refname. If refname is a directory name 356 * (i.e., ends in '/'), then return that ref_dir itself. dir must 357 * represent the top-level directory and must already be complete. 358 * Sort ref_dirs and recurse into subdirectories as necessary. If 359 * mkdir is set, then create any missing directories; otherwise, 360 * return NULL if the desired directory cannot be found. 361 */ 362static struct ref_dir *find_containing_dir(struct ref_dir *dir, 363const char*refname,int mkdir) 364{ 365const char*slash; 366for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 367size_t dirnamelen = slash - refname +1; 368struct ref_dir *subdir; 369 subdir =search_for_subdir(dir, refname, dirnamelen, mkdir); 370if(!subdir) { 371 dir = NULL; 372break; 373} 374 dir = subdir; 375} 376 377return dir; 378} 379 380/* 381 * Find the value entry with the given name in dir, sorting ref_dirs 382 * and recursing into subdirectories as necessary. If the name is not 383 * found or it corresponds to a directory entry, return NULL. 384 */ 385static struct ref_entry *find_ref(struct ref_dir *dir,const char*refname) 386{ 387int entry_index; 388struct ref_entry *entry; 389 dir =find_containing_dir(dir, refname,0); 390if(!dir) 391return NULL; 392 entry_index =search_ref_dir(dir, refname,strlen(refname)); 393if(entry_index == -1) 394return NULL; 395 entry = dir->entries[entry_index]; 396return(entry->flag & REF_DIR) ? NULL : entry; 397} 398 399/* 400 * Remove the entry with the given name from dir, recursing into 401 * subdirectories as necessary. If refname is the name of a directory 402 * (i.e., ends with '/'), then remove the directory and its contents. 403 * If the removal was successful, return the number of entries 404 * remaining in the directory entry that contained the deleted entry. 405 * If the name was not found, return -1. Please note that this 406 * function only deletes the entry from the cache; it does not delete 407 * it from the filesystem or ensure that other cache entries (which 408 * might be symbolic references to the removed entry) are updated. 409 * Nor does it remove any containing dir entries that might be made 410 * empty by the removal. dir must represent the top-level directory 411 * and must already be complete. 412 */ 413static intremove_entry(struct ref_dir *dir,const char*refname) 414{ 415int refname_len =strlen(refname); 416int entry_index; 417struct ref_entry *entry; 418int is_dir = refname[refname_len -1] =='/'; 419if(is_dir) { 420/* 421 * refname represents a reference directory. Remove 422 * the trailing slash; otherwise we will get the 423 * directory *representing* refname rather than the 424 * one *containing* it. 425 */ 426char*dirname =xmemdupz(refname, refname_len -1); 427 dir =find_containing_dir(dir, dirname,0); 428free(dirname); 429}else{ 430 dir =find_containing_dir(dir, refname,0); 431} 432if(!dir) 433return-1; 434 entry_index =search_ref_dir(dir, refname, refname_len); 435if(entry_index == -1) 436return-1; 437 entry = dir->entries[entry_index]; 438 439memmove(&dir->entries[entry_index], 440&dir->entries[entry_index +1], 441(dir->nr - entry_index -1) *sizeof(*dir->entries) 442); 443 dir->nr--; 444if(dir->sorted > entry_index) 445 dir->sorted--; 446free_ref_entry(entry); 447return dir->nr; 448} 449 450/* 451 * Add a ref_entry to the ref_dir (unsorted), recursing into 452 * subdirectories as necessary. dir must represent the top-level 453 * directory. Return 0 on success. 454 */ 455static intadd_ref(struct ref_dir *dir,struct ref_entry *ref) 456{ 457 dir =find_containing_dir(dir, ref->name,1); 458if(!dir) 459return-1; 460add_entry_to_dir(dir, ref); 461return0; 462} 463 464/* 465 * Emit a warning and return true iff ref1 and ref2 have the same name 466 * and the same sha1. Die if they have the same name but different 467 * sha1s. 468 */ 469static intis_dup_ref(const struct ref_entry *ref1,const struct ref_entry *ref2) 470{ 471if(strcmp(ref1->name, ref2->name)) 472return0; 473 474/* Duplicate name; make sure that they don't conflict: */ 475 476if((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 477/* This is impossible by construction */ 478die("Reference directory conflict:%s", ref1->name); 479 480if(oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 481die("Duplicated ref, and SHA1s don't match:%s", ref1->name); 482 483warning("Duplicated ref:%s", ref1->name); 484return1; 485} 486 487/* 488 * Sort the entries in dir non-recursively (if they are not already 489 * sorted) and remove any duplicate entries. 490 */ 491static voidsort_ref_dir(struct ref_dir *dir) 492{ 493int i, j; 494struct ref_entry *last = NULL; 495 496/* 497 * This check also prevents passing a zero-length array to qsort(), 498 * which is a problem on some platforms. 499 */ 500if(dir->sorted == dir->nr) 501return; 502 503qsort(dir->entries, dir->nr,sizeof(*dir->entries), ref_entry_cmp); 504 505/* Remove any duplicates: */ 506for(i =0, j =0; j < dir->nr; j++) { 507struct ref_entry *entry = dir->entries[j]; 508if(last &&is_dup_ref(last, entry)) 509free_ref_entry(entry); 510else 511 last = dir->entries[i++] = entry; 512} 513 dir->sorted = dir->nr = i; 514} 515 516/* 517 * Return true iff the reference described by entry can be resolved to 518 * an object in the database. Emit a warning if the referred-to 519 * object does not exist. 520 */ 521static intref_resolves_to_object(struct ref_entry *entry) 522{ 523if(entry->flag & REF_ISBROKEN) 524return0; 525if(!has_sha1_file(entry->u.value.oid.hash)) { 526error("%sdoes not point to a valid object!", entry->name); 527return0; 528} 529return1; 530} 531 532/* 533 * current_ref is a performance hack: when iterating over references 534 * using the for_each_ref*() functions, current_ref is set to the 535 * current reference's entry before calling the callback function. If 536 * the callback function calls peel_ref(), then peel_ref() first 537 * checks whether the reference to be peeled is the current reference 538 * (it usually is) and if so, returns that reference's peeled version 539 * if it is available. This avoids a refname lookup in a common case. 540 */ 541static struct ref_entry *current_ref; 542 543typedefinteach_ref_entry_fn(struct ref_entry *entry,void*cb_data); 544 545struct ref_entry_cb { 546const char*base; 547int trim; 548int flags; 549 each_ref_fn *fn; 550void*cb_data; 551}; 552 553/* 554 * Handle one reference in a do_for_each_ref*()-style iteration, 555 * calling an each_ref_fn for each entry. 556 */ 557static intdo_one_ref(struct ref_entry *entry,void*cb_data) 558{ 559struct ref_entry_cb *data = cb_data; 560struct ref_entry *old_current_ref; 561int retval; 562 563if(!starts_with(entry->name, data->base)) 564return0; 565 566if(!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && 567!ref_resolves_to_object(entry)) 568return0; 569 570/* Store the old value, in case this is a recursive call: */ 571 old_current_ref = current_ref; 572 current_ref = entry; 573 retval = data->fn(entry->name + data->trim, &entry->u.value.oid, 574 entry->flag, data->cb_data); 575 current_ref = old_current_ref; 576return retval; 577} 578 579/* 580 * Call fn for each reference in dir that has index in the range 581 * offset <= index < dir->nr. Recurse into subdirectories that are in 582 * that index range, sorting them before iterating. This function 583 * does not sort dir itself; it should be sorted beforehand. fn is 584 * called for all references, including broken ones. 585 */ 586static intdo_for_each_entry_in_dir(struct ref_dir *dir,int offset, 587 each_ref_entry_fn fn,void*cb_data) 588{ 589int i; 590assert(dir->sorted == dir->nr); 591for(i = offset; i < dir->nr; i++) { 592struct ref_entry *entry = dir->entries[i]; 593int retval; 594if(entry->flag & REF_DIR) { 595struct ref_dir *subdir =get_ref_dir(entry); 596sort_ref_dir(subdir); 597 retval =do_for_each_entry_in_dir(subdir,0, fn, cb_data); 598}else{ 599 retval =fn(entry, cb_data); 600} 601if(retval) 602return retval; 603} 604return0; 605} 606 607/* 608 * Call fn for each reference in the union of dir1 and dir2, in order 609 * by refname. Recurse into subdirectories. If a value entry appears 610 * in both dir1 and dir2, then only process the version that is in 611 * dir2. The input dirs must already be sorted, but subdirs will be 612 * sorted as needed. fn is called for all references, including 613 * broken ones. 614 */ 615static intdo_for_each_entry_in_dirs(struct ref_dir *dir1, 616struct ref_dir *dir2, 617 each_ref_entry_fn fn,void*cb_data) 618{ 619int retval; 620int i1 =0, i2 =0; 621 622assert(dir1->sorted == dir1->nr); 623assert(dir2->sorted == dir2->nr); 624while(1) { 625struct ref_entry *e1, *e2; 626int cmp; 627if(i1 == dir1->nr) { 628returndo_for_each_entry_in_dir(dir2, i2, fn, cb_data); 629} 630if(i2 == dir2->nr) { 631returndo_for_each_entry_in_dir(dir1, i1, fn, cb_data); 632} 633 e1 = dir1->entries[i1]; 634 e2 = dir2->entries[i2]; 635 cmp =strcmp(e1->name, e2->name); 636if(cmp ==0) { 637if((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { 638/* Both are directories; descend them in parallel. */ 639struct ref_dir *subdir1 =get_ref_dir(e1); 640struct ref_dir *subdir2 =get_ref_dir(e2); 641sort_ref_dir(subdir1); 642sort_ref_dir(subdir2); 643 retval =do_for_each_entry_in_dirs( 644 subdir1, subdir2, fn, cb_data); 645 i1++; 646 i2++; 647}else if(!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { 648/* Both are references; ignore the one from dir1. */ 649 retval =fn(e2, cb_data); 650 i1++; 651 i2++; 652}else{ 653die("conflict between reference and directory:%s", 654 e1->name); 655} 656}else{ 657struct ref_entry *e; 658if(cmp <0) { 659 e = e1; 660 i1++; 661}else{ 662 e = e2; 663 i2++; 664} 665if(e->flag & REF_DIR) { 666struct ref_dir *subdir =get_ref_dir(e); 667sort_ref_dir(subdir); 668 retval =do_for_each_entry_in_dir( 669 subdir,0, fn, cb_data); 670}else{ 671 retval =fn(e, cb_data); 672} 673} 674if(retval) 675return retval; 676} 677} 678 679/* 680 * Load all of the refs from the dir into our in-memory cache. The hard work 681 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 682 * through all of the sub-directories. We do not even need to care about 683 * sorting, as traversal order does not matter to us. 684 */ 685static voidprime_ref_dir(struct ref_dir *dir) 686{ 687int i; 688for(i =0; i < dir->nr; i++) { 689struct ref_entry *entry = dir->entries[i]; 690if(entry->flag & REF_DIR) 691prime_ref_dir(get_ref_dir(entry)); 692} 693} 694 695struct nonmatching_ref_data { 696const struct string_list *skip; 697const char*conflicting_refname; 698}; 699 700static intnonmatching_ref_fn(struct ref_entry *entry,void*vdata) 701{ 702struct nonmatching_ref_data *data = vdata; 703 704if(data->skip &&string_list_has_string(data->skip, entry->name)) 705return0; 706 707 data->conflicting_refname = entry->name; 708return1; 709} 710 711/* 712 * Return 0 if a reference named refname could be created without 713 * conflicting with the name of an existing reference in dir. 714 * See verify_refname_available for more information. 715 */ 716static intverify_refname_available_dir(const char*refname, 717const struct string_list *extras, 718const struct string_list *skip, 719struct ref_dir *dir, 720struct strbuf *err) 721{ 722const char*slash; 723const char*extra_refname; 724int pos; 725struct strbuf dirname = STRBUF_INIT; 726int ret = -1; 727 728/* 729 * For the sake of comments in this function, suppose that 730 * refname is "refs/foo/bar". 731 */ 732 733assert(err); 734 735strbuf_grow(&dirname,strlen(refname) +1); 736for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 737/* Expand dirname to the new prefix, not including the trailing slash: */ 738strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 739 740/* 741 * We are still at a leading dir of the refname (e.g., 742 * "refs/foo"; if there is a reference with that name, 743 * it is a conflict, *unless* it is in skip. 744 */ 745if(dir) { 746 pos =search_ref_dir(dir, dirname.buf, dirname.len); 747if(pos >=0&& 748(!skip || !string_list_has_string(skip, dirname.buf))) { 749/* 750 * We found a reference whose name is 751 * a proper prefix of refname; e.g., 752 * "refs/foo", and is not in skip. 753 */ 754strbuf_addf(err,"'%s' exists; cannot create '%s'", 755 dirname.buf, refname); 756goto cleanup; 757} 758} 759 760if(extras &&string_list_has_string(extras, dirname.buf) && 761(!skip || !string_list_has_string(skip, dirname.buf))) { 762strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 763 refname, dirname.buf); 764goto cleanup; 765} 766 767/* 768 * Otherwise, we can try to continue our search with 769 * the next component. So try to look up the 770 * directory, e.g., "refs/foo/". If we come up empty, 771 * we know there is nothing under this whole prefix, 772 * but even in that case we still have to continue the 773 * search for conflicts with extras. 774 */ 775strbuf_addch(&dirname,'/'); 776if(dir) { 777 pos =search_ref_dir(dir, dirname.buf, dirname.len); 778if(pos <0) { 779/* 780 * There was no directory "refs/foo/", 781 * so there is nothing under this 782 * whole prefix. So there is no need 783 * to continue looking for conflicting 784 * references. But we need to continue 785 * looking for conflicting extras. 786 */ 787 dir = NULL; 788}else{ 789 dir =get_ref_dir(dir->entries[pos]); 790} 791} 792} 793 794/* 795 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 796 * There is no point in searching for a reference with that 797 * name, because a refname isn't considered to conflict with 798 * itself. But we still need to check for references whose 799 * names are in the "refs/foo/bar/" namespace, because they 800 * *do* conflict. 801 */ 802strbuf_addstr(&dirname, refname + dirname.len); 803strbuf_addch(&dirname,'/'); 804 805if(dir) { 806 pos =search_ref_dir(dir, dirname.buf, dirname.len); 807 808if(pos >=0) { 809/* 810 * We found a directory named "$refname/" 811 * (e.g., "refs/foo/bar/"). It is a problem 812 * iff it contains any ref that is not in 813 * "skip". 814 */ 815struct nonmatching_ref_data data; 816 817 data.skip = skip; 818 data.conflicting_refname = NULL; 819 dir =get_ref_dir(dir->entries[pos]); 820sort_ref_dir(dir); 821if(do_for_each_entry_in_dir(dir,0, nonmatching_ref_fn, &data)) { 822strbuf_addf(err,"'%s' exists; cannot create '%s'", 823 data.conflicting_refname, refname); 824goto cleanup; 825} 826} 827} 828 829 extra_refname =find_descendant_ref(dirname.buf, extras, skip); 830if(extra_refname) 831strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 832 refname, extra_refname); 833else 834 ret =0; 835 836cleanup: 837strbuf_release(&dirname); 838return ret; 839} 840 841struct packed_ref_cache { 842struct ref_entry *root; 843 844/* 845 * Count of references to the data structure in this instance, 846 * including the pointer from ref_cache::packed if any. The 847 * data will not be freed as long as the reference count is 848 * nonzero. 849 */ 850unsigned int referrers; 851 852/* 853 * Iff the packed-refs file associated with this instance is 854 * currently locked for writing, this points at the associated 855 * lock (which is owned by somebody else). The referrer count 856 * is also incremented when the file is locked and decremented 857 * when it is unlocked. 858 */ 859struct lock_file *lock; 860 861/* The metadata from when this packed-refs cache was read */ 862struct stat_validity validity; 863}; 864 865/* 866 * Future: need to be in "struct repository" 867 * when doing a full libification. 868 */ 869static struct ref_cache { 870struct ref_cache *next; 871struct ref_entry *loose; 872struct packed_ref_cache *packed; 873/* 874 * The submodule name, or "" for the main repo. We allocate 875 * length 1 rather than FLEX_ARRAY so that the main ref_cache 876 * is initialized correctly. 877 */ 878char name[1]; 879} ref_cache, *submodule_ref_caches; 880 881/* Lock used for the main packed-refs file: */ 882static struct lock_file packlock; 883 884/* 885 * Increment the reference count of *packed_refs. 886 */ 887static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 888{ 889 packed_refs->referrers++; 890} 891 892/* 893 * Decrease the reference count of *packed_refs. If it goes to zero, 894 * free *packed_refs and return true; otherwise return false. 895 */ 896static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs) 897{ 898if(!--packed_refs->referrers) { 899free_ref_entry(packed_refs->root); 900stat_validity_clear(&packed_refs->validity); 901free(packed_refs); 902return1; 903}else{ 904return0; 905} 906} 907 908static voidclear_packed_ref_cache(struct ref_cache *refs) 909{ 910if(refs->packed) { 911struct packed_ref_cache *packed_refs = refs->packed; 912 913if(packed_refs->lock) 914die("internal error: packed-ref cache cleared while locked"); 915 refs->packed = NULL; 916release_packed_ref_cache(packed_refs); 917} 918} 919 920static voidclear_loose_ref_cache(struct ref_cache *refs) 921{ 922if(refs->loose) { 923free_ref_entry(refs->loose); 924 refs->loose = NULL; 925} 926} 927 928/* 929 * Create a new submodule ref cache and add it to the internal 930 * set of caches. 931 */ 932static struct ref_cache *create_ref_cache(const char*submodule) 933{ 934struct ref_cache *refs; 935if(!submodule) 936 submodule =""; 937FLEX_ALLOC_STR(refs, name, submodule); 938 refs->next = submodule_ref_caches; 939 submodule_ref_caches = refs; 940return refs; 941} 942 943static struct ref_cache *lookup_ref_cache(const char*submodule) 944{ 945struct ref_cache *refs; 946 947if(!submodule || !*submodule) 948return&ref_cache; 949 950for(refs = submodule_ref_caches; refs; refs = refs->next) 951if(!strcmp(submodule, refs->name)) 952return refs; 953return NULL; 954} 955 956/* 957 * Return a pointer to a ref_cache for the specified submodule. For 958 * the main repository, use submodule==NULL. The returned structure 959 * will be allocated and initialized but not necessarily populated; it 960 * should not be freed. 961 */ 962static struct ref_cache *get_ref_cache(const char*submodule) 963{ 964struct ref_cache *refs =lookup_ref_cache(submodule); 965if(!refs) 966 refs =create_ref_cache(submodule); 967return refs; 968} 969 970/* The length of a peeled reference line in packed-refs, including EOL: */ 971#define PEELED_LINE_LENGTH 42 972 973/* 974 * The packed-refs header line that we write out. Perhaps other 975 * traits will be added later. The trailing space is required. 976 */ 977static const char PACKED_REFS_HEADER[] = 978"# pack-refs with: peeled fully-peeled\n"; 979 980/* 981 * Parse one line from a packed-refs file. Write the SHA1 to sha1. 982 * Return a pointer to the refname within the line (null-terminated), 983 * or NULL if there was a problem. 984 */ 985static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1) 986{ 987const char*ref; 988 989/* 990 * 42: the answer to everything. 991 * 992 * In this case, it happens to be the answer to 993 * 40 (length of sha1 hex representation) 994 * +1 (space in between hex and name) 995 * +1 (newline at the end of the line) 996 */ 997if(line->len <=42) 998return NULL; 9991000if(get_sha1_hex(line->buf, sha1) <0)1001return NULL;1002if(!isspace(line->buf[40]))1003return NULL;10041005 ref = line->buf +41;1006if(isspace(*ref))1007return NULL;10081009if(line->buf[line->len -1] !='\n')1010return NULL;1011 line->buf[--line->len] =0;10121013return ref;1014}10151016/*1017 * Read f, which is a packed-refs file, into dir.1018 *1019 * A comment line of the form "# pack-refs with: " may contain zero or1020 * more traits. We interpret the traits as follows:1021 *1022 * No traits:1023 *1024 * Probably no references are peeled. But if the file contains a1025 * peeled value for a reference, we will use it.1026 *1027 * peeled:1028 *1029 * References under "refs/tags/", if they *can* be peeled, *are*1030 * peeled in this file. References outside of "refs/tags/" are1031 * probably not peeled even if they could have been, but if we find1032 * a peeled value for such a reference we will use it.1033 *1034 * fully-peeled:1035 *1036 * All references in the file that can be peeled are peeled.1037 * Inversely (and this is more important), any references in the1038 * file for which no peeled value is recorded is not peelable. This1039 * trait should typically be written alongside "peeled" for1040 * compatibility with older clients, but we do not require it1041 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1042 */1043static voidread_packed_refs(FILE*f,struct ref_dir *dir)1044{1045struct ref_entry *last = NULL;1046struct strbuf line = STRBUF_INIT;1047enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;10481049while(strbuf_getwholeline(&line, f,'\n') != EOF) {1050unsigned char sha1[20];1051const char*refname;1052const char*traits;10531054if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1055if(strstr(traits," fully-peeled "))1056 peeled = PEELED_FULLY;1057else if(strstr(traits," peeled "))1058 peeled = PEELED_TAGS;1059/* perhaps other traits later as well */1060continue;1061}10621063 refname =parse_ref_line(&line, sha1);1064if(refname) {1065int flag = REF_ISPACKED;10661067if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1068if(!refname_is_safe(refname))1069die("packed refname is dangerous:%s", refname);1070hashclr(sha1);1071 flag |= REF_BAD_NAME | REF_ISBROKEN;1072}1073 last =create_ref_entry(refname, sha1, flag,0);1074if(peeled == PEELED_FULLY ||1075(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1076 last->flag |= REF_KNOWS_PEELED;1077add_ref(dir, last);1078continue;1079}1080if(last &&1081 line.buf[0] =='^'&&1082 line.len == PEELED_LINE_LENGTH &&1083 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1084!get_sha1_hex(line.buf +1, sha1)) {1085hashcpy(last->u.value.peeled.hash, sha1);1086/*1087 * Regardless of what the file header said,1088 * we definitely know the value of *this*1089 * reference:1090 */1091 last->flag |= REF_KNOWS_PEELED;1092}1093}10941095strbuf_release(&line);1096}10971098/*1099 * Get the packed_ref_cache for the specified ref_cache, creating it1100 * if necessary.1101 */1102static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1103{1104char*packed_refs_file;11051106if(*refs->name)1107 packed_refs_file =git_pathdup_submodule(refs->name,"packed-refs");1108else1109 packed_refs_file =git_pathdup("packed-refs");11101111if(refs->packed &&1112!stat_validity_check(&refs->packed->validity, packed_refs_file))1113clear_packed_ref_cache(refs);11141115if(!refs->packed) {1116FILE*f;11171118 refs->packed =xcalloc(1,sizeof(*refs->packed));1119acquire_packed_ref_cache(refs->packed);1120 refs->packed->root =create_dir_entry(refs,"",0,0);1121 f =fopen(packed_refs_file,"r");1122if(f) {1123stat_validity_update(&refs->packed->validity,fileno(f));1124read_packed_refs(f,get_ref_dir(refs->packed->root));1125fclose(f);1126}1127}1128free(packed_refs_file);1129return refs->packed;1130}11311132static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1133{1134returnget_ref_dir(packed_ref_cache->root);1135}11361137static struct ref_dir *get_packed_refs(struct ref_cache *refs)1138{1139returnget_packed_ref_dir(get_packed_ref_cache(refs));1140}11411142/*1143 * Add a reference to the in-memory packed reference cache. This may1144 * only be called while the packed-refs file is locked (see1145 * lock_packed_refs()). To actually write the packed-refs file, call1146 * commit_packed_refs().1147 */1148static voidadd_packed_ref(const char*refname,const unsigned char*sha1)1149{1150struct packed_ref_cache *packed_ref_cache =1151get_packed_ref_cache(&ref_cache);11521153if(!packed_ref_cache->lock)1154die("internal error: packed refs not locked");1155add_ref(get_packed_ref_dir(packed_ref_cache),1156create_ref_entry(refname, sha1, REF_ISPACKED,1));1157}11581159/*1160 * Read the loose references from the namespace dirname into dir1161 * (without recursing). dirname must end with '/'. dir must be the1162 * directory entry corresponding to dirname.1163 */1164static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1165{1166struct ref_cache *refs = dir->ref_cache;1167DIR*d;1168struct dirent *de;1169int dirnamelen =strlen(dirname);1170struct strbuf refname;1171struct strbuf path = STRBUF_INIT;1172size_t path_baselen;11731174if(*refs->name)1175strbuf_git_path_submodule(&path, refs->name,"%s", dirname);1176else1177strbuf_git_path(&path,"%s", dirname);1178 path_baselen = path.len;11791180 d =opendir(path.buf);1181if(!d) {1182strbuf_release(&path);1183return;1184}11851186strbuf_init(&refname, dirnamelen +257);1187strbuf_add(&refname, dirname, dirnamelen);11881189while((de =readdir(d)) != NULL) {1190unsigned char sha1[20];1191struct stat st;1192int flag;11931194if(de->d_name[0] =='.')1195continue;1196if(ends_with(de->d_name,".lock"))1197continue;1198strbuf_addstr(&refname, de->d_name);1199strbuf_addstr(&path, de->d_name);1200if(stat(path.buf, &st) <0) {1201;/* silently ignore */1202}else if(S_ISDIR(st.st_mode)) {1203strbuf_addch(&refname,'/');1204add_entry_to_dir(dir,1205create_dir_entry(refs, refname.buf,1206 refname.len,1));1207}else{1208int read_ok;12091210if(*refs->name) {1211hashclr(sha1);1212 flag =0;1213 read_ok = !resolve_gitlink_ref(refs->name,1214 refname.buf, sha1);1215}else{1216 read_ok = !read_ref_full(refname.buf,1217 RESOLVE_REF_READING,1218 sha1, &flag);1219}12201221if(!read_ok) {1222hashclr(sha1);1223 flag |= REF_ISBROKEN;1224}else if(is_null_sha1(sha1)) {1225/*1226 * It is so astronomically unlikely1227 * that NULL_SHA1 is the SHA-1 of an1228 * actual object that we consider its1229 * appearance in a loose reference1230 * file to be repo corruption1231 * (probably due to a software bug).1232 */1233 flag |= REF_ISBROKEN;1234}12351236if(check_refname_format(refname.buf,1237 REFNAME_ALLOW_ONELEVEL)) {1238if(!refname_is_safe(refname.buf))1239die("loose refname is dangerous:%s", refname.buf);1240hashclr(sha1);1241 flag |= REF_BAD_NAME | REF_ISBROKEN;1242}1243add_entry_to_dir(dir,1244create_ref_entry(refname.buf, sha1, flag,0));1245}1246strbuf_setlen(&refname, dirnamelen);1247strbuf_setlen(&path, path_baselen);1248}1249strbuf_release(&refname);1250strbuf_release(&path);1251closedir(d);1252}12531254static struct ref_dir *get_loose_refs(struct ref_cache *refs)1255{1256if(!refs->loose) {1257/*1258 * Mark the top-level directory complete because we1259 * are about to read the only subdirectory that can1260 * hold references:1261 */1262 refs->loose =create_dir_entry(refs,"",0,0);1263/*1264 * Create an incomplete entry for "refs/":1265 */1266add_entry_to_dir(get_ref_dir(refs->loose),1267create_dir_entry(refs,"refs/",5,1));1268}1269returnget_ref_dir(refs->loose);1270}12711272#define MAXREFLEN (1024)12731274/*1275 * Called by resolve_gitlink_ref_recursive() after it failed to read1276 * from the loose refs in ref_cache refs. Find <refname> in the1277 * packed-refs file for the submodule.1278 */1279static intresolve_gitlink_packed_ref(struct ref_cache *refs,1280const char*refname,unsigned char*sha1)1281{1282struct ref_entry *ref;1283struct ref_dir *dir =get_packed_refs(refs);12841285 ref =find_ref(dir, refname);1286if(ref == NULL)1287return-1;12881289hashcpy(sha1, ref->u.value.oid.hash);1290return0;1291}12921293static intresolve_gitlink_ref_recursive(struct ref_cache *refs,1294const char*refname,unsigned char*sha1,1295int recursion)1296{1297int fd, len;1298char buffer[128], *p;1299char*path;13001301if(recursion > SYMREF_MAXDEPTH ||strlen(refname) > MAXREFLEN)1302return-1;1303 path = *refs->name1304?git_pathdup_submodule(refs->name,"%s", refname)1305:git_pathdup("%s", refname);1306 fd =open(path, O_RDONLY);1307free(path);1308if(fd <0)1309returnresolve_gitlink_packed_ref(refs, refname, sha1);13101311 len =read(fd, buffer,sizeof(buffer)-1);1312close(fd);1313if(len <0)1314return-1;1315while(len &&isspace(buffer[len-1]))1316 len--;1317 buffer[len] =0;13181319/* Was it a detached head or an old-fashioned symlink? */1320if(!get_sha1_hex(buffer, sha1))1321return0;13221323/* Symref? */1324if(strncmp(buffer,"ref:",4))1325return-1;1326 p = buffer +4;1327while(isspace(*p))1328 p++;13291330returnresolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1331}13321333intresolve_gitlink_ref(const char*path,const char*refname,unsigned char*sha1)1334{1335int len =strlen(path), retval;1336struct strbuf submodule = STRBUF_INIT;1337struct ref_cache *refs;13381339while(len && path[len-1] =='/')1340 len--;1341if(!len)1342return-1;13431344strbuf_add(&submodule, path, len);1345 refs =lookup_ref_cache(submodule.buf);1346if(!refs) {1347if(!is_nonbare_repository_dir(&submodule)) {1348strbuf_release(&submodule);1349return-1;1350}1351 refs =create_ref_cache(submodule.buf);1352}1353strbuf_release(&submodule);13541355 retval =resolve_gitlink_ref_recursive(refs, refname, sha1,0);1356return retval;1357}13581359/*1360 * Return the ref_entry for the given refname from the packed1361 * references. If it does not exist, return NULL.1362 */1363static struct ref_entry *get_packed_ref(const char*refname)1364{1365returnfind_ref(get_packed_refs(&ref_cache), refname);1366}13671368/*1369 * A loose ref file doesn't exist; check for a packed ref.1370 */1371static intresolve_missing_loose_ref(const char*refname,1372unsigned char*sha1,1373unsigned int*flags)1374{1375struct ref_entry *entry;13761377/*1378 * The loose reference file does not exist; check for a packed1379 * reference.1380 */1381 entry =get_packed_ref(refname);1382if(entry) {1383hashcpy(sha1, entry->u.value.oid.hash);1384*flags |= REF_ISPACKED;1385return0;1386}1387/* refname is not a packed reference. */1388return-1;1389}13901391/*1392 * Read a raw ref from the filesystem or packed refs file.1393 *1394 * If the ref is a sha1, fill in sha1 and return 0.1395 *1396 * If the ref is symbolic, fill in *symref with the referrent1397 * (e.g. "refs/heads/master") and return 0. The caller is responsible1398 * for validating the referrent. Set REF_ISSYMREF in flags.1399 *1400 * If the ref doesn't exist, set errno to ENOENT and return -1.1401 *1402 * If the ref exists but is neither a symbolic ref nor a sha1, it is1403 * broken. Set REF_ISBROKEN in flags, set errno to EINVAL, and return1404 * -1.1405 *1406 * If there is another error reading the ref, set errno appropriately and1407 * return -1.1408 *1409 * Backend-specific flags might be set in flags as well, regardless of1410 * outcome.1411 *1412 * sb_path is workspace: the caller should allocate and free it.1413 *1414 * It is OK for refname to point into symref. In this case:1415 * - if the function succeeds with REF_ISSYMREF, symref will be1416 * overwritten and the memory pointed to by refname might be changed1417 * or even freed.1418 * - in all other cases, symref will be untouched, and therefore1419 * refname will still be valid and unchanged.1420 */1421intread_raw_ref(const char*refname,unsigned char*sha1,1422struct strbuf *symref,unsigned int*flags)1423{1424struct strbuf sb_contents = STRBUF_INIT;1425struct strbuf sb_path = STRBUF_INIT;1426const char*path;1427const char*buf;1428struct stat st;1429int fd;1430int ret = -1;1431int save_errno;14321433strbuf_reset(&sb_path);1434strbuf_git_path(&sb_path,"%s", refname);1435 path = sb_path.buf;14361437stat_ref:1438/*1439 * We might have to loop back here to avoid a race1440 * condition: first we lstat() the file, then we try1441 * to read it as a link or as a file. But if somebody1442 * changes the type of the file (file <-> directory1443 * <-> symlink) between the lstat() and reading, then1444 * we don't want to report that as an error but rather1445 * try again starting with the lstat().1446 */14471448if(lstat(path, &st) <0) {1449if(errno != ENOENT)1450goto out;1451if(resolve_missing_loose_ref(refname, sha1, flags)) {1452 errno = ENOENT;1453goto out;1454}1455 ret =0;1456goto out;1457}14581459/* Follow "normalized" - ie "refs/.." symlinks by hand */1460if(S_ISLNK(st.st_mode)) {1461strbuf_reset(&sb_contents);1462if(strbuf_readlink(&sb_contents, path,0) <0) {1463if(errno == ENOENT || errno == EINVAL)1464/* inconsistent with lstat; retry */1465goto stat_ref;1466else1467goto out;1468}1469if(starts_with(sb_contents.buf,"refs/") &&1470!check_refname_format(sb_contents.buf,0)) {1471strbuf_swap(&sb_contents, symref);1472*flags |= REF_ISSYMREF;1473 ret =0;1474goto out;1475}1476}14771478/* Is it a directory? */1479if(S_ISDIR(st.st_mode)) {1480/*1481 * Even though there is a directory where the loose1482 * ref is supposed to be, there could still be a1483 * packed ref:1484 */1485if(resolve_missing_loose_ref(refname, sha1, flags)) {1486 errno = EISDIR;1487goto out;1488}1489 ret =0;1490goto out;1491}14921493/*1494 * Anything else, just open it and try to use it as1495 * a ref1496 */1497 fd =open(path, O_RDONLY);1498if(fd <0) {1499if(errno == ENOENT)1500/* inconsistent with lstat; retry */1501goto stat_ref;1502else1503goto out;1504}1505strbuf_reset(&sb_contents);1506if(strbuf_read(&sb_contents, fd,256) <0) {1507int save_errno = errno;1508close(fd);1509 errno = save_errno;1510goto out;1511}1512close(fd);1513strbuf_rtrim(&sb_contents);1514 buf = sb_contents.buf;1515if(starts_with(buf,"ref:")) {1516 buf +=4;1517while(isspace(*buf))1518 buf++;15191520strbuf_reset(symref);1521strbuf_addstr(symref, buf);1522*flags |= REF_ISSYMREF;1523 ret =0;1524goto out;1525}15261527/*1528 * Please note that FETCH_HEAD has additional1529 * data after the sha.1530 */1531if(get_sha1_hex(buf, sha1) ||1532(buf[40] !='\0'&& !isspace(buf[40]))) {1533*flags |= REF_ISBROKEN;1534 errno = EINVAL;1535goto out;1536}15371538 ret =0;15391540out:1541 save_errno = errno;1542strbuf_release(&sb_path);1543strbuf_release(&sb_contents);1544 errno = save_errno;1545return ret;1546}15471548/*1549 * Peel the entry (if possible) and return its new peel_status. If1550 * repeel is true, re-peel the entry even if there is an old peeled1551 * value that is already stored in it.1552 *1553 * It is OK to call this function with a packed reference entry that1554 * might be stale and might even refer to an object that has since1555 * been garbage-collected. In such a case, if the entry has1556 * REF_KNOWS_PEELED then leave the status unchanged and return1557 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1558 */1559static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1560{1561enum peel_status status;15621563if(entry->flag & REF_KNOWS_PEELED) {1564if(repeel) {1565 entry->flag &= ~REF_KNOWS_PEELED;1566oidclr(&entry->u.value.peeled);1567}else{1568returnis_null_oid(&entry->u.value.peeled) ?1569 PEEL_NON_TAG : PEEL_PEELED;1570}1571}1572if(entry->flag & REF_ISBROKEN)1573return PEEL_BROKEN;1574if(entry->flag & REF_ISSYMREF)1575return PEEL_IS_SYMREF;15761577 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1578if(status == PEEL_PEELED || status == PEEL_NON_TAG)1579 entry->flag |= REF_KNOWS_PEELED;1580return status;1581}15821583intpeel_ref(const char*refname,unsigned char*sha1)1584{1585int flag;1586unsigned char base[20];15871588if(current_ref && (current_ref->name == refname1589|| !strcmp(current_ref->name, refname))) {1590if(peel_entry(current_ref,0))1591return-1;1592hashcpy(sha1, current_ref->u.value.peeled.hash);1593return0;1594}15951596if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1597return-1;15981599/*1600 * If the reference is packed, read its ref_entry from the1601 * cache in the hope that we already know its peeled value.1602 * We only try this optimization on packed references because1603 * (a) forcing the filling of the loose reference cache could1604 * be expensive and (b) loose references anyway usually do not1605 * have REF_KNOWS_PEELED.1606 */1607if(flag & REF_ISPACKED) {1608struct ref_entry *r =get_packed_ref(refname);1609if(r) {1610if(peel_entry(r,0))1611return-1;1612hashcpy(sha1, r->u.value.peeled.hash);1613return0;1614}1615}16161617returnpeel_object(base, sha1);1618}16191620/*1621 * Call fn for each reference in the specified ref_cache, omitting1622 * references not in the containing_dir of base. fn is called for all1623 * references, including broken ones. If fn ever returns a non-zero1624 * value, stop the iteration and return that value; otherwise, return1625 * 0.1626 */1627static intdo_for_each_entry(struct ref_cache *refs,const char*base,1628 each_ref_entry_fn fn,void*cb_data)1629{1630struct packed_ref_cache *packed_ref_cache;1631struct ref_dir *loose_dir;1632struct ref_dir *packed_dir;1633int retval =0;16341635/*1636 * We must make sure that all loose refs are read before accessing the1637 * packed-refs file; this avoids a race condition in which loose refs1638 * are migrated to the packed-refs file by a simultaneous process, but1639 * our in-memory view is from before the migration. get_packed_ref_cache()1640 * takes care of making sure our view is up to date with what is on1641 * disk.1642 */1643 loose_dir =get_loose_refs(refs);1644if(base && *base) {1645 loose_dir =find_containing_dir(loose_dir, base,0);1646}1647if(loose_dir)1648prime_ref_dir(loose_dir);16491650 packed_ref_cache =get_packed_ref_cache(refs);1651acquire_packed_ref_cache(packed_ref_cache);1652 packed_dir =get_packed_ref_dir(packed_ref_cache);1653if(base && *base) {1654 packed_dir =find_containing_dir(packed_dir, base,0);1655}16561657if(packed_dir && loose_dir) {1658sort_ref_dir(packed_dir);1659sort_ref_dir(loose_dir);1660 retval =do_for_each_entry_in_dirs(1661 packed_dir, loose_dir, fn, cb_data);1662}else if(packed_dir) {1663sort_ref_dir(packed_dir);1664 retval =do_for_each_entry_in_dir(1665 packed_dir,0, fn, cb_data);1666}else if(loose_dir) {1667sort_ref_dir(loose_dir);1668 retval =do_for_each_entry_in_dir(1669 loose_dir,0, fn, cb_data);1670}16711672release_packed_ref_cache(packed_ref_cache);1673return retval;1674}16751676/*1677 * Call fn for each reference in the specified ref_cache for which the1678 * refname begins with base. If trim is non-zero, then trim that many1679 * characters off the beginning of each refname before passing the1680 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include1681 * broken references in the iteration. If fn ever returns a non-zero1682 * value, stop the iteration and return that value; otherwise, return1683 * 0.1684 */1685intdo_for_each_ref(const char*submodule,const char*base,1686 each_ref_fn fn,int trim,int flags,void*cb_data)1687{1688struct ref_entry_cb data;1689struct ref_cache *refs;16901691 refs =get_ref_cache(submodule);1692 data.base = base;1693 data.trim = trim;1694 data.flags = flags;1695 data.fn = fn;1696 data.cb_data = cb_data;16971698if(ref_paranoia <0)1699 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1700if(ref_paranoia)1701 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;17021703returndo_for_each_entry(refs, base, do_one_ref, &data);1704}17051706static voidunlock_ref(struct ref_lock *lock)1707{1708/* Do not free lock->lk -- atexit() still looks at them */1709if(lock->lk)1710rollback_lock_file(lock->lk);1711free(lock->ref_name);1712free(lock->orig_ref_name);1713free(lock);1714}17151716/*1717 * Verify that the reference locked by lock has the value old_sha1.1718 * Fail if the reference doesn't exist and mustexist is set. Return 01719 * on success. On error, write an error message to err, set errno, and1720 * return a negative value.1721 */1722static intverify_lock(struct ref_lock *lock,1723const unsigned char*old_sha1,int mustexist,1724struct strbuf *err)1725{1726assert(err);17271728if(read_ref_full(lock->ref_name,1729 mustexist ? RESOLVE_REF_READING :0,1730 lock->old_oid.hash, NULL)) {1731if(old_sha1) {1732int save_errno = errno;1733strbuf_addf(err,"can't verify ref%s", lock->ref_name);1734 errno = save_errno;1735return-1;1736}else{1737hashclr(lock->old_oid.hash);1738return0;1739}1740}1741if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {1742strbuf_addf(err,"ref%sis at%sbut expected%s",1743 lock->ref_name,1744sha1_to_hex(lock->old_oid.hash),1745sha1_to_hex(old_sha1));1746 errno = EBUSY;1747return-1;1748}1749return0;1750}17511752static intremove_empty_directories(struct strbuf *path)1753{1754/*1755 * we want to create a file but there is a directory there;1756 * if that is an empty directory (or a directory that contains1757 * only empty directories), remove them.1758 */1759returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);1760}17611762/*1763 * Locks a ref returning the lock on success and NULL on failure.1764 * On failure errno is set to something meaningful.1765 */1766static struct ref_lock *lock_ref_sha1_basic(const char*refname,1767const unsigned char*old_sha1,1768const struct string_list *extras,1769const struct string_list *skip,1770unsigned int flags,int*type_p,1771struct strbuf *err)1772{1773struct strbuf ref_file = STRBUF_INIT;1774struct strbuf orig_ref_file = STRBUF_INIT;1775const char*orig_refname = refname;1776struct ref_lock *lock;1777int last_errno =0;1778int type;1779int lflags =0;1780int mustexist = (old_sha1 && !is_null_sha1(old_sha1));1781int resolve_flags =0;1782int attempts_remaining =3;17831784assert(err);17851786 lock =xcalloc(1,sizeof(struct ref_lock));17871788if(mustexist)1789 resolve_flags |= RESOLVE_REF_READING;1790if(flags & REF_DELETING)1791 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;1792if(flags & REF_NODEREF) {1793 resolve_flags |= RESOLVE_REF_NO_RECURSE;1794 lflags |= LOCK_NO_DEREF;1795}17961797 refname =resolve_ref_unsafe(refname, resolve_flags,1798 lock->old_oid.hash, &type);1799if(!refname && errno == EISDIR) {1800/*1801 * we are trying to lock foo but we used to1802 * have foo/bar which now does not exist;1803 * it is normal for the empty directory 'foo'1804 * to remain.1805 */1806strbuf_git_path(&orig_ref_file,"%s", orig_refname);1807if(remove_empty_directories(&orig_ref_file)) {1808 last_errno = errno;1809if(!verify_refname_available_dir(orig_refname, extras, skip,1810get_loose_refs(&ref_cache), err))1811strbuf_addf(err,"there are still refs under '%s'",1812 orig_refname);1813goto error_return;1814}1815 refname =resolve_ref_unsafe(orig_refname, resolve_flags,1816 lock->old_oid.hash, &type);1817}1818if(type_p)1819*type_p = type;1820if(!refname) {1821 last_errno = errno;1822if(last_errno != ENOTDIR ||1823!verify_refname_available_dir(orig_refname, extras, skip,1824get_loose_refs(&ref_cache), err))1825strbuf_addf(err,"unable to resolve reference%s:%s",1826 orig_refname,strerror(last_errno));18271828goto error_return;1829}18301831if(flags & REF_NODEREF)1832 refname = orig_refname;18331834/*1835 * If the ref did not exist and we are creating it, make sure1836 * there is no existing packed ref whose name begins with our1837 * refname, nor a packed ref whose name is a proper prefix of1838 * our refname.1839 */1840if(is_null_oid(&lock->old_oid) &&1841verify_refname_available_dir(refname, extras, skip,1842get_packed_refs(&ref_cache), err)) {1843 last_errno = ENOTDIR;1844goto error_return;1845}18461847 lock->lk =xcalloc(1,sizeof(struct lock_file));18481849 lock->ref_name =xstrdup(refname);1850 lock->orig_ref_name =xstrdup(orig_refname);1851strbuf_git_path(&ref_file,"%s", refname);18521853 retry:1854switch(safe_create_leading_directories_const(ref_file.buf)) {1855case SCLD_OK:1856break;/* success */1857case SCLD_VANISHED:1858if(--attempts_remaining >0)1859goto retry;1860/* fall through */1861default:1862 last_errno = errno;1863strbuf_addf(err,"unable to create directory for%s",1864 ref_file.buf);1865goto error_return;1866}18671868if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {1869 last_errno = errno;1870if(errno == ENOENT && --attempts_remaining >0)1871/*1872 * Maybe somebody just deleted one of the1873 * directories leading to ref_file. Try1874 * again:1875 */1876goto retry;1877else{1878unable_to_lock_message(ref_file.buf, errno, err);1879goto error_return;1880}1881}1882if(verify_lock(lock, old_sha1, mustexist, err)) {1883 last_errno = errno;1884goto error_return;1885}1886goto out;18871888 error_return:1889unlock_ref(lock);1890 lock = NULL;18911892 out:1893strbuf_release(&ref_file);1894strbuf_release(&orig_ref_file);1895 errno = last_errno;1896return lock;1897}18981899/*1900 * Write an entry to the packed-refs file for the specified refname.1901 * If peeled is non-NULL, write it as the entry's peeled value.1902 */1903static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,1904unsigned char*peeled)1905{1906fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);1907if(peeled)1908fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));1909}19101911/*1912 * An each_ref_entry_fn that writes the entry to a packed-refs file.1913 */1914static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)1915{1916enum peel_status peel_status =peel_entry(entry,0);19171918if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)1919error("internal error:%sis not a valid packed reference!",1920 entry->name);1921write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,1922 peel_status == PEEL_PEELED ?1923 entry->u.value.peeled.hash : NULL);1924return0;1925}19261927/*1928 * Lock the packed-refs file for writing. Flags is passed to1929 * hold_lock_file_for_update(). Return 0 on success. On errors, set1930 * errno appropriately and return a nonzero value.1931 */1932static intlock_packed_refs(int flags)1933{1934static int timeout_configured =0;1935static int timeout_value =1000;19361937struct packed_ref_cache *packed_ref_cache;19381939if(!timeout_configured) {1940git_config_get_int("core.packedrefstimeout", &timeout_value);1941 timeout_configured =1;1942}19431944if(hold_lock_file_for_update_timeout(1945&packlock,git_path("packed-refs"),1946 flags, timeout_value) <0)1947return-1;1948/*1949 * Get the current packed-refs while holding the lock. If the1950 * packed-refs file has been modified since we last read it,1951 * this will automatically invalidate the cache and re-read1952 * the packed-refs file.1953 */1954 packed_ref_cache =get_packed_ref_cache(&ref_cache);1955 packed_ref_cache->lock = &packlock;1956/* Increment the reference count to prevent it from being freed: */1957acquire_packed_ref_cache(packed_ref_cache);1958return0;1959}19601961/*1962 * Write the current version of the packed refs cache from memory to1963 * disk. The packed-refs file must already be locked for writing (see1964 * lock_packed_refs()). Return zero on success. On errors, set errno1965 * and return a nonzero value1966 */1967static intcommit_packed_refs(void)1968{1969struct packed_ref_cache *packed_ref_cache =1970get_packed_ref_cache(&ref_cache);1971int error =0;1972int save_errno =0;1973FILE*out;19741975if(!packed_ref_cache->lock)1976die("internal error: packed-refs not locked");19771978 out =fdopen_lock_file(packed_ref_cache->lock,"w");1979if(!out)1980die_errno("unable to fdopen packed-refs descriptor");19811982fprintf_or_die(out,"%s", PACKED_REFS_HEADER);1983do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),19840, write_packed_entry_fn, out);19851986if(commit_lock_file(packed_ref_cache->lock)) {1987 save_errno = errno;1988 error = -1;1989}1990 packed_ref_cache->lock = NULL;1991release_packed_ref_cache(packed_ref_cache);1992 errno = save_errno;1993return error;1994}19951996/*1997 * Rollback the lockfile for the packed-refs file, and discard the1998 * in-memory packed reference cache. (The packed-refs file will be1999 * read anew if it is needed again after this function is called.)2000 */2001static voidrollback_packed_refs(void)2002{2003struct packed_ref_cache *packed_ref_cache =2004get_packed_ref_cache(&ref_cache);20052006if(!packed_ref_cache->lock)2007die("internal error: packed-refs not locked");2008rollback_lock_file(packed_ref_cache->lock);2009 packed_ref_cache->lock = NULL;2010release_packed_ref_cache(packed_ref_cache);2011clear_packed_ref_cache(&ref_cache);2012}20132014struct ref_to_prune {2015struct ref_to_prune *next;2016unsigned char sha1[20];2017char name[FLEX_ARRAY];2018};20192020struct pack_refs_cb_data {2021unsigned int flags;2022struct ref_dir *packed_refs;2023struct ref_to_prune *ref_to_prune;2024};20252026/*2027 * An each_ref_entry_fn that is run over loose references only. If2028 * the loose reference can be packed, add an entry in the packed ref2029 * cache. If the reference should be pruned, also add it to2030 * ref_to_prune in the pack_refs_cb_data.2031 */2032static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2033{2034struct pack_refs_cb_data *cb = cb_data;2035enum peel_status peel_status;2036struct ref_entry *packed_entry;2037int is_tag_ref =starts_with(entry->name,"refs/tags/");20382039/* Do not pack per-worktree refs: */2040if(ref_type(entry->name) != REF_TYPE_NORMAL)2041return0;20422043/* ALWAYS pack tags */2044if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2045return0;20462047/* Do not pack symbolic or broken refs: */2048if((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2049return0;20502051/* Add a packed ref cache entry equivalent to the loose entry. */2052 peel_status =peel_entry(entry,1);2053if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2054die("internal error peeling reference%s(%s)",2055 entry->name,oid_to_hex(&entry->u.value.oid));2056 packed_entry =find_ref(cb->packed_refs, entry->name);2057if(packed_entry) {2058/* Overwrite existing packed entry with info from loose entry */2059 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2060oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2061}else{2062 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2063 REF_ISPACKED | REF_KNOWS_PEELED,0);2064add_ref(cb->packed_refs, packed_entry);2065}2066oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);20672068/* Schedule the loose reference for pruning if requested. */2069if((cb->flags & PACK_REFS_PRUNE)) {2070struct ref_to_prune *n;2071FLEX_ALLOC_STR(n, name, entry->name);2072hashcpy(n->sha1, entry->u.value.oid.hash);2073 n->next = cb->ref_to_prune;2074 cb->ref_to_prune = n;2075}2076return0;2077}20782079/*2080 * Remove empty parents, but spare refs/ and immediate subdirs.2081 * Note: munges *name.2082 */2083static voidtry_remove_empty_parents(char*name)2084{2085char*p, *q;2086int i;2087 p = name;2088for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2089while(*p && *p !='/')2090 p++;2091/* tolerate duplicate slashes; see check_refname_format() */2092while(*p =='/')2093 p++;2094}2095for(q = p; *q; q++)2096;2097while(1) {2098while(q > p && *q !='/')2099 q--;2100while(q > p && *(q-1) =='/')2101 q--;2102if(q == p)2103break;2104*q ='\0';2105if(rmdir(git_path("%s", name)))2106break;2107}2108}21092110/* make sure nobody touched the ref, and unlink */2111static voidprune_ref(struct ref_to_prune *r)2112{2113struct ref_transaction *transaction;2114struct strbuf err = STRBUF_INIT;21152116if(check_refname_format(r->name,0))2117return;21182119 transaction =ref_transaction_begin(&err);2120if(!transaction ||2121ref_transaction_delete(transaction, r->name, r->sha1,2122 REF_ISPRUNING, NULL, &err) ||2123ref_transaction_commit(transaction, &err)) {2124ref_transaction_free(transaction);2125error("%s", err.buf);2126strbuf_release(&err);2127return;2128}2129ref_transaction_free(transaction);2130strbuf_release(&err);2131try_remove_empty_parents(r->name);2132}21332134static voidprune_refs(struct ref_to_prune *r)2135{2136while(r) {2137prune_ref(r);2138 r = r->next;2139}2140}21412142intpack_refs(unsigned int flags)2143{2144struct pack_refs_cb_data cbdata;21452146memset(&cbdata,0,sizeof(cbdata));2147 cbdata.flags = flags;21482149lock_packed_refs(LOCK_DIE_ON_ERROR);2150 cbdata.packed_refs =get_packed_refs(&ref_cache);21512152do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2153 pack_if_possible_fn, &cbdata);21542155if(commit_packed_refs())2156die_errno("unable to overwrite old ref-pack file");21572158prune_refs(cbdata.ref_to_prune);2159return0;2160}21612162/*2163 * Rewrite the packed-refs file, omitting any refs listed in2164 * 'refnames'. On error, leave packed-refs unchanged, write an error2165 * message to 'err', and return a nonzero value.2166 *2167 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2168 */2169static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2170{2171struct ref_dir *packed;2172struct string_list_item *refname;2173int ret, needs_repacking =0, removed =0;21742175assert(err);21762177/* Look for a packed ref */2178for_each_string_list_item(refname, refnames) {2179if(get_packed_ref(refname->string)) {2180 needs_repacking =1;2181break;2182}2183}21842185/* Avoid locking if we have nothing to do */2186if(!needs_repacking)2187return0;/* no refname exists in packed refs */21882189if(lock_packed_refs(0)) {2190unable_to_lock_message(git_path("packed-refs"), errno, err);2191return-1;2192}2193 packed =get_packed_refs(&ref_cache);21942195/* Remove refnames from the cache */2196for_each_string_list_item(refname, refnames)2197if(remove_entry(packed, refname->string) != -1)2198 removed =1;2199if(!removed) {2200/*2201 * All packed entries disappeared while we were2202 * acquiring the lock.2203 */2204rollback_packed_refs();2205return0;2206}22072208/* Write what remains */2209 ret =commit_packed_refs();2210if(ret)2211strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2212strerror(errno));2213return ret;2214}22152216static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2217{2218assert(err);22192220if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2221/*2222 * loose. The loose file name is the same as the2223 * lockfile name, minus ".lock":2224 */2225char*loose_filename =get_locked_file_path(lock->lk);2226int res =unlink_or_msg(loose_filename, err);2227free(loose_filename);2228if(res)2229return1;2230}2231return0;2232}22332234intdelete_refs(struct string_list *refnames)2235{2236struct strbuf err = STRBUF_INIT;2237int i, result =0;22382239if(!refnames->nr)2240return0;22412242 result =repack_without_refs(refnames, &err);2243if(result) {2244/*2245 * If we failed to rewrite the packed-refs file, then2246 * it is unsafe to try to remove loose refs, because2247 * doing so might expose an obsolete packed value for2248 * a reference that might even point at an object that2249 * has been garbage collected.2250 */2251if(refnames->nr ==1)2252error(_("could not delete reference%s:%s"),2253 refnames->items[0].string, err.buf);2254else2255error(_("could not delete references:%s"), err.buf);22562257goto out;2258}22592260for(i =0; i < refnames->nr; i++) {2261const char*refname = refnames->items[i].string;22622263if(delete_ref(refname, NULL,0))2264 result |=error(_("could not remove reference%s"), refname);2265}22662267out:2268strbuf_release(&err);2269return result;2270}22712272/*2273 * People using contrib's git-new-workdir have .git/logs/refs ->2274 * /some/other/path/.git/logs/refs, and that may live on another device.2275 *2276 * IOW, to avoid cross device rename errors, the temporary renamed log must2277 * live into logs/refs.2278 */2279#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"22802281static intrename_tmp_log(const char*newrefname)2282{2283int attempts_remaining =4;2284struct strbuf path = STRBUF_INIT;2285int ret = -1;22862287 retry:2288strbuf_reset(&path);2289strbuf_git_path(&path,"logs/%s", newrefname);2290switch(safe_create_leading_directories_const(path.buf)) {2291case SCLD_OK:2292break;/* success */2293case SCLD_VANISHED:2294if(--attempts_remaining >0)2295goto retry;2296/* fall through */2297default:2298error("unable to create directory for%s", newrefname);2299goto out;2300}23012302if(rename(git_path(TMP_RENAMED_LOG), path.buf)) {2303if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2304/*2305 * rename(a, b) when b is an existing2306 * directory ought to result in ISDIR, but2307 * Solaris 5.8 gives ENOTDIR. Sheesh.2308 */2309if(remove_empty_directories(&path)) {2310error("Directory not empty: logs/%s", newrefname);2311goto out;2312}2313goto retry;2314}else if(errno == ENOENT && --attempts_remaining >0) {2315/*2316 * Maybe another process just deleted one of2317 * the directories in the path to newrefname.2318 * Try again from the beginning.2319 */2320goto retry;2321}else{2322error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2323 newrefname,strerror(errno));2324goto out;2325}2326}2327 ret =0;2328out:2329strbuf_release(&path);2330return ret;2331}23322333intverify_refname_available(const char*newname,2334struct string_list *extras,2335struct string_list *skip,2336struct strbuf *err)2337{2338struct ref_dir *packed_refs =get_packed_refs(&ref_cache);2339struct ref_dir *loose_refs =get_loose_refs(&ref_cache);23402341if(verify_refname_available_dir(newname, extras, skip,2342 packed_refs, err) ||2343verify_refname_available_dir(newname, extras, skip,2344 loose_refs, err))2345return-1;23462347return0;2348}23492350static intwrite_ref_to_lockfile(struct ref_lock *lock,2351const unsigned char*sha1,struct strbuf *err);2352static intcommit_ref_update(struct ref_lock *lock,2353const unsigned char*sha1,const char*logmsg,2354int flags,struct strbuf *err);23552356intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2357{2358unsigned char sha1[20], orig_sha1[20];2359int flag =0, logmoved =0;2360struct ref_lock *lock;2361struct stat loginfo;2362int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2363const char*symref = NULL;2364struct strbuf err = STRBUF_INIT;23652366if(log &&S_ISLNK(loginfo.st_mode))2367returnerror("reflog for%sis a symlink", oldrefname);23682369 symref =resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,2370 orig_sha1, &flag);2371if(flag & REF_ISSYMREF)2372returnerror("refname%sis a symbolic ref, renaming it is not supported",2373 oldrefname);2374if(!symref)2375returnerror("refname%snot found", oldrefname);23762377if(!rename_ref_available(oldrefname, newrefname))2378return1;23792380if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2381returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2382 oldrefname,strerror(errno));23832384if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2385error("unable to delete old%s", oldrefname);2386goto rollback;2387}23882389if(!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&2390delete_ref(newrefname, sha1, REF_NODEREF)) {2391if(errno==EISDIR) {2392struct strbuf path = STRBUF_INIT;2393int result;23942395strbuf_git_path(&path,"%s", newrefname);2396 result =remove_empty_directories(&path);2397strbuf_release(&path);23982399if(result) {2400error("Directory not empty:%s", newrefname);2401goto rollback;2402}2403}else{2404error("unable to delete existing%s", newrefname);2405goto rollback;2406}2407}24082409if(log &&rename_tmp_log(newrefname))2410goto rollback;24112412 logmoved = log;24132414 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL,0, NULL, &err);2415if(!lock) {2416error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2417strbuf_release(&err);2418goto rollback;2419}2420hashcpy(lock->old_oid.hash, orig_sha1);24212422if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2423commit_ref_update(lock, orig_sha1, logmsg,0, &err)) {2424error("unable to write current sha1 into%s:%s", newrefname, err.buf);2425strbuf_release(&err);2426goto rollback;2427}24282429return0;24302431 rollback:2432 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL,0, NULL, &err);2433if(!lock) {2434error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2435strbuf_release(&err);2436goto rollbacklog;2437}24382439 flag = log_all_ref_updates;2440 log_all_ref_updates =0;2441if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2442commit_ref_update(lock, orig_sha1, NULL,0, &err)) {2443error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2444strbuf_release(&err);2445}2446 log_all_ref_updates = flag;24472448 rollbacklog:2449if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2450error("unable to restore logfile%sfrom%s:%s",2451 oldrefname, newrefname,strerror(errno));2452if(!logmoved && log &&2453rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2454error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2455 oldrefname,strerror(errno));24562457return1;2458}24592460static intclose_ref(struct ref_lock *lock)2461{2462if(close_lock_file(lock->lk))2463return-1;2464return0;2465}24662467static intcommit_ref(struct ref_lock *lock)2468{2469char*path =get_locked_file_path(lock->lk);2470struct stat st;24712472if(!lstat(path, &st) &&S_ISDIR(st.st_mode)) {2473/*2474 * There is a directory at the path we want to rename2475 * the lockfile to. Hopefully it is empty; try to2476 * delete it.2477 */2478size_t len =strlen(path);2479struct strbuf sb_path = STRBUF_INIT;24802481strbuf_attach(&sb_path, path, len, len);24822483/*2484 * If this fails, commit_lock_file() will also fail2485 * and will report the problem.2486 */2487remove_empty_directories(&sb_path);2488strbuf_release(&sb_path);2489}else{2490free(path);2491}24922493if(commit_lock_file(lock->lk))2494return-1;2495return0;2496}24972498/*2499 * Create a reflog for a ref. If force_create = 0, the reflog will2500 * only be created for certain refs (those for which2501 * should_autocreate_reflog returns non-zero. Otherwise, create it2502 * regardless of the ref name. Fill in *err and return -1 on failure.2503 */2504static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)2505{2506int logfd, oflags = O_APPEND | O_WRONLY;25072508strbuf_git_path(logfile,"logs/%s", refname);2509if(force_create ||should_autocreate_reflog(refname)) {2510if(safe_create_leading_directories(logfile->buf) <0) {2511strbuf_addf(err,"unable to create directory for%s: "2512"%s", logfile->buf,strerror(errno));2513return-1;2514}2515 oflags |= O_CREAT;2516}25172518 logfd =open(logfile->buf, oflags,0666);2519if(logfd <0) {2520if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2521return0;25222523if(errno == EISDIR) {2524if(remove_empty_directories(logfile)) {2525strbuf_addf(err,"There are still logs under "2526"'%s'", logfile->buf);2527return-1;2528}2529 logfd =open(logfile->buf, oflags,0666);2530}25312532if(logfd <0) {2533strbuf_addf(err,"unable to append to%s:%s",2534 logfile->buf,strerror(errno));2535return-1;2536}2537}25382539adjust_shared_perm(logfile->buf);2540close(logfd);2541return0;2542}254325442545intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)2546{2547int ret;2548struct strbuf sb = STRBUF_INIT;25492550 ret =log_ref_setup(refname, &sb, err, force_create);2551strbuf_release(&sb);2552return ret;2553}25542555static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2556const unsigned char*new_sha1,2557const char*committer,const char*msg)2558{2559int msglen, written;2560unsigned maxlen, len;2561char*logrec;25622563 msglen = msg ?strlen(msg) :0;2564 maxlen =strlen(committer) + msglen +100;2565 logrec =xmalloc(maxlen);2566 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2567sha1_to_hex(old_sha1),2568sha1_to_hex(new_sha1),2569 committer);2570if(msglen)2571 len +=copy_reflog_msg(logrec + len -1, msg) -1;25722573 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2574free(logrec);2575if(written != len)2576return-1;25772578return0;2579}25802581static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,2582const unsigned char*new_sha1,const char*msg,2583struct strbuf *logfile,int flags,2584struct strbuf *err)2585{2586int logfd, result, oflags = O_APPEND | O_WRONLY;25872588if(log_all_ref_updates <0)2589 log_all_ref_updates = !is_bare_repository();25902591 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);25922593if(result)2594return result;25952596 logfd =open(logfile->buf, oflags);2597if(logfd <0)2598return0;2599 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2600git_committer_info(0), msg);2601if(result) {2602strbuf_addf(err,"unable to append to%s:%s", logfile->buf,2603strerror(errno));2604close(logfd);2605return-1;2606}2607if(close(logfd)) {2608strbuf_addf(err,"unable to append to%s:%s", logfile->buf,2609strerror(errno));2610return-1;2611}2612return0;2613}26142615static intlog_ref_write(const char*refname,const unsigned char*old_sha1,2616const unsigned char*new_sha1,const char*msg,2617int flags,struct strbuf *err)2618{2619returnfiles_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2620 err);2621}26222623intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2624const unsigned char*new_sha1,const char*msg,2625int flags,struct strbuf *err)2626{2627struct strbuf sb = STRBUF_INIT;2628int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2629 err);2630strbuf_release(&sb);2631return ret;2632}26332634/*2635 * Write sha1 into the open lockfile, then close the lockfile. On2636 * errors, rollback the lockfile, fill in *err and2637 * return -1.2638 */2639static intwrite_ref_to_lockfile(struct ref_lock *lock,2640const unsigned char*sha1,struct strbuf *err)2641{2642static char term ='\n';2643struct object *o;2644int fd;26452646 o =parse_object(sha1);2647if(!o) {2648strbuf_addf(err,2649"Trying to write ref%swith nonexistent object%s",2650 lock->ref_name,sha1_to_hex(sha1));2651unlock_ref(lock);2652return-1;2653}2654if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2655strbuf_addf(err,2656"Trying to write non-commit object%sto branch%s",2657sha1_to_hex(sha1), lock->ref_name);2658unlock_ref(lock);2659return-1;2660}2661 fd =get_lock_file_fd(lock->lk);2662if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2663write_in_full(fd, &term,1) !=1||2664close_ref(lock) <0) {2665strbuf_addf(err,2666"Couldn't write%s",get_lock_file_path(lock->lk));2667unlock_ref(lock);2668return-1;2669}2670return0;2671}26722673/*2674 * Commit a change to a loose reference that has already been written2675 * to the loose reference lockfile. Also update the reflogs if2676 * necessary, using the specified lockmsg (which can be NULL).2677 */2678static intcommit_ref_update(struct ref_lock *lock,2679const unsigned char*sha1,const char*logmsg,2680int flags,struct strbuf *err)2681{2682clear_loose_ref_cache(&ref_cache);2683if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0||2684(strcmp(lock->ref_name, lock->orig_ref_name) &&2685log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0)) {2686char*old_msg =strbuf_detach(err, NULL);2687strbuf_addf(err,"Cannot update the ref '%s':%s",2688 lock->ref_name, old_msg);2689free(old_msg);2690unlock_ref(lock);2691return-1;2692}2693if(strcmp(lock->orig_ref_name,"HEAD") !=0) {2694/*2695 * Special hack: If a branch is updated directly and HEAD2696 * points to it (may happen on the remote side of a push2697 * for example) then logically the HEAD reflog should be2698 * updated too.2699 * A generic solution implies reverse symref information,2700 * but finding all symrefs pointing to the given branch2701 * would be rather costly for this rare event (the direct2702 * update of a branch) to be worth it. So let's cheat and2703 * check with HEAD only which should cover 99% of all usage2704 * scenarios (even 100% of the default ones).2705 */2706unsigned char head_sha1[20];2707int head_flag;2708const char*head_ref;2709 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,2710 head_sha1, &head_flag);2711if(head_ref && (head_flag & REF_ISSYMREF) &&2712!strcmp(head_ref, lock->ref_name)) {2713struct strbuf log_err = STRBUF_INIT;2714if(log_ref_write("HEAD", lock->old_oid.hash, sha1,2715 logmsg,0, &log_err)) {2716error("%s", log_err.buf);2717strbuf_release(&log_err);2718}2719}2720}2721if(commit_ref(lock)) {2722error("Couldn't set%s", lock->ref_name);2723unlock_ref(lock);2724return-1;2725}27262727unlock_ref(lock);2728return0;2729}27302731static intcreate_ref_symlink(struct ref_lock *lock,const char*target)2732{2733int ret = -1;2734#ifndef NO_SYMLINK_HEAD2735char*ref_path =get_locked_file_path(lock->lk);2736unlink(ref_path);2737 ret =symlink(target, ref_path);2738free(ref_path);27392740if(ret)2741fprintf(stderr,"no symlink - falling back to symbolic ref\n");2742#endif2743return ret;2744}27452746static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,2747const char*target,const char*logmsg)2748{2749struct strbuf err = STRBUF_INIT;2750unsigned char new_sha1[20];2751if(logmsg && !read_ref(target, new_sha1) &&2752log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg,0, &err)) {2753error("%s", err.buf);2754strbuf_release(&err);2755}2756}27572758static intcreate_symref_locked(struct ref_lock *lock,const char*refname,2759const char*target,const char*logmsg)2760{2761if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {2762update_symref_reflog(lock, refname, target, logmsg);2763return0;2764}27652766if(!fdopen_lock_file(lock->lk,"w"))2767returnerror("unable to fdopen%s:%s",2768 lock->lk->tempfile.filename.buf,strerror(errno));27692770update_symref_reflog(lock, refname, target, logmsg);27712772/* no error check; commit_ref will check ferror */2773fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);2774if(commit_ref(lock) <0)2775returnerror("unable to write symref for%s:%s", refname,2776strerror(errno));2777return0;2778}27792780intcreate_symref(const char*refname,const char*target,const char*logmsg)2781{2782struct strbuf err = STRBUF_INIT;2783struct ref_lock *lock;2784int ret;27852786 lock =lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,2787&err);2788if(!lock) {2789error("%s", err.buf);2790strbuf_release(&err);2791return-1;2792}27932794 ret =create_symref_locked(lock, refname, target, logmsg);2795unlock_ref(lock);2796return ret;2797}27982799intset_worktree_head_symref(const char*gitdir,const char*target)2800{2801static struct lock_file head_lock;2802struct ref_lock *lock;2803struct strbuf head_path = STRBUF_INIT;2804const char*head_rel;2805int ret;28062807strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));2808if(hold_lock_file_for_update(&head_lock, head_path.buf,2809 LOCK_NO_DEREF) <0) {2810struct strbuf err = STRBUF_INIT;2811unable_to_lock_message(head_path.buf, errno, &err);2812error("%s", err.buf);2813strbuf_release(&err);2814strbuf_release(&head_path);2815return-1;2816}28172818/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for2819 linked trees */2820 head_rel =remove_leading_path(head_path.buf,2821absolute_path(get_git_common_dir()));2822/* to make use of create_symref_locked(), initialize ref_lock */2823 lock =xcalloc(1,sizeof(struct ref_lock));2824 lock->lk = &head_lock;2825 lock->ref_name =xstrdup(head_rel);2826 lock->orig_ref_name =xstrdup(head_rel);28272828 ret =create_symref_locked(lock, head_rel, target, NULL);28292830unlock_ref(lock);/* will free lock */2831strbuf_release(&head_path);2832return ret;2833}28342835intreflog_exists(const char*refname)2836{2837struct stat st;28382839return!lstat(git_path("logs/%s", refname), &st) &&2840S_ISREG(st.st_mode);2841}28422843intdelete_reflog(const char*refname)2844{2845returnremove_path(git_path("logs/%s", refname));2846}28472848static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)2849{2850unsigned char osha1[20], nsha1[20];2851char*email_end, *message;2852unsigned long timestamp;2853int tz;28542855/* old SP new SP name <email> SP time TAB msg LF */2856if(sb->len <83|| sb->buf[sb->len -1] !='\n'||2857get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||2858get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||2859!(email_end =strchr(sb->buf +82,'>')) ||2860 email_end[1] !=' '||2861!(timestamp =strtoul(email_end +2, &message,10)) ||2862!message || message[0] !=' '||2863(message[1] !='+'&& message[1] !='-') ||2864!isdigit(message[2]) || !isdigit(message[3]) ||2865!isdigit(message[4]) || !isdigit(message[5]))2866return0;/* corrupt? */2867 email_end[1] ='\0';2868 tz =strtol(message +1, NULL,10);2869if(message[6] !='\t')2870 message +=6;2871else2872 message +=7;2873returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);2874}28752876static char*find_beginning_of_line(char*bob,char*scan)2877{2878while(bob < scan && *(--scan) !='\n')2879;/* keep scanning backwards */2880/*2881 * Return either beginning of the buffer, or LF at the end of2882 * the previous line.2883 */2884return scan;2885}28862887intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)2888{2889struct strbuf sb = STRBUF_INIT;2890FILE*logfp;2891long pos;2892int ret =0, at_tail =1;28932894 logfp =fopen(git_path("logs/%s", refname),"r");2895if(!logfp)2896return-1;28972898/* Jump to the end */2899if(fseek(logfp,0, SEEK_END) <0)2900returnerror("cannot seek back reflog for%s:%s",2901 refname,strerror(errno));2902 pos =ftell(logfp);2903while(!ret &&0< pos) {2904int cnt;2905size_t nread;2906char buf[BUFSIZ];2907char*endp, *scanp;29082909/* Fill next block from the end */2910 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;2911if(fseek(logfp, pos - cnt, SEEK_SET))2912returnerror("cannot seek back reflog for%s:%s",2913 refname,strerror(errno));2914 nread =fread(buf, cnt,1, logfp);2915if(nread !=1)2916returnerror("cannot read%dbytes from reflog for%s:%s",2917 cnt, refname,strerror(errno));2918 pos -= cnt;29192920 scanp = endp = buf + cnt;2921if(at_tail && scanp[-1] =='\n')2922/* Looking at the final LF at the end of the file */2923 scanp--;2924 at_tail =0;29252926while(buf < scanp) {2927/*2928 * terminating LF of the previous line, or the beginning2929 * of the buffer.2930 */2931char*bp;29322933 bp =find_beginning_of_line(buf, scanp);29342935if(*bp =='\n') {2936/*2937 * The newline is the end of the previous line,2938 * so we know we have complete line starting2939 * at (bp + 1). Prefix it onto any prior data2940 * we collected for the line and process it.2941 */2942strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));2943 scanp = bp;2944 endp = bp +1;2945 ret =show_one_reflog_ent(&sb, fn, cb_data);2946strbuf_reset(&sb);2947if(ret)2948break;2949}else if(!pos) {2950/*2951 * We are at the start of the buffer, and the2952 * start of the file; there is no previous2953 * line, and we have everything for this one.2954 * Process it, and we can end the loop.2955 */2956strbuf_splice(&sb,0,0, buf, endp - buf);2957 ret =show_one_reflog_ent(&sb, fn, cb_data);2958strbuf_reset(&sb);2959break;2960}29612962if(bp == buf) {2963/*2964 * We are at the start of the buffer, and there2965 * is more file to read backwards. Which means2966 * we are in the middle of a line. Note that we2967 * may get here even if *bp was a newline; that2968 * just means we are at the exact end of the2969 * previous line, rather than some spot in the2970 * middle.2971 *2972 * Save away what we have to be combined with2973 * the data from the next read.2974 */2975strbuf_splice(&sb,0,0, buf, endp - buf);2976break;2977}2978}29792980}2981if(!ret && sb.len)2982die("BUG: reverse reflog parser had leftover data");29832984fclose(logfp);2985strbuf_release(&sb);2986return ret;2987}29882989intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)2990{2991FILE*logfp;2992struct strbuf sb = STRBUF_INIT;2993int ret =0;29942995 logfp =fopen(git_path("logs/%s", refname),"r");2996if(!logfp)2997return-1;29982999while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3000 ret =show_one_reflog_ent(&sb, fn, cb_data);3001fclose(logfp);3002strbuf_release(&sb);3003return ret;3004}3005/*3006 * Call fn for each reflog in the namespace indicated by name. name3007 * must be empty or end with '/'. Name will be used as a scratch3008 * space, but its contents will be restored before return.3009 */3010static intdo_for_each_reflog(struct strbuf *name, each_ref_fn fn,void*cb_data)3011{3012DIR*d =opendir(git_path("logs/%s", name->buf));3013int retval =0;3014struct dirent *de;3015int oldlen = name->len;30163017if(!d)3018return name->len ? errno :0;30193020while((de =readdir(d)) != NULL) {3021struct stat st;30223023if(de->d_name[0] =='.')3024continue;3025if(ends_with(de->d_name,".lock"))3026continue;3027strbuf_addstr(name, de->d_name);3028if(stat(git_path("logs/%s", name->buf), &st) <0) {3029;/* silently ignore */3030}else{3031if(S_ISDIR(st.st_mode)) {3032strbuf_addch(name,'/');3033 retval =do_for_each_reflog(name, fn, cb_data);3034}else{3035struct object_id oid;30363037if(read_ref_full(name->buf,0, oid.hash, NULL))3038 retval =error("bad ref for%s", name->buf);3039else3040 retval =fn(name->buf, &oid,0, cb_data);3041}3042if(retval)3043break;3044}3045strbuf_setlen(name, oldlen);3046}3047closedir(d);3048return retval;3049}30503051intfor_each_reflog(each_ref_fn fn,void*cb_data)3052{3053int retval;3054struct strbuf name;3055strbuf_init(&name, PATH_MAX);3056 retval =do_for_each_reflog(&name, fn, cb_data);3057strbuf_release(&name);3058return retval;3059}30603061static intref_update_reject_duplicates(struct string_list *refnames,3062struct strbuf *err)3063{3064int i, n = refnames->nr;30653066assert(err);30673068for(i =1; i < n; i++)3069if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3070strbuf_addf(err,3071"Multiple updates for ref '%s' not allowed.",3072 refnames->items[i].string);3073return1;3074}3075return0;3076}30773078intref_transaction_commit(struct ref_transaction *transaction,3079struct strbuf *err)3080{3081int ret =0, i;3082int n = transaction->nr;3083struct ref_update **updates = transaction->updates;3084struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3085struct string_list_item *ref_to_delete;3086struct string_list affected_refnames = STRING_LIST_INIT_NODUP;30873088assert(err);30893090if(transaction->state != REF_TRANSACTION_OPEN)3091die("BUG: commit called for transaction that is not open");30923093if(!n) {3094 transaction->state = REF_TRANSACTION_CLOSED;3095return0;3096}30973098/* Fail if a refname appears more than once in the transaction: */3099for(i =0; i < n; i++)3100string_list_append(&affected_refnames, updates[i]->refname);3101string_list_sort(&affected_refnames);3102if(ref_update_reject_duplicates(&affected_refnames, err)) {3103 ret = TRANSACTION_GENERIC_ERROR;3104goto cleanup;3105}31063107/*3108 * Acquire all locks, verify old values if provided, check3109 * that new values are valid, and write new values to the3110 * lockfiles, ready to be activated. Only keep one lockfile3111 * open at a time to avoid running out of file descriptors.3112 */3113for(i =0; i < n; i++) {3114struct ref_update *update = updates[i];31153116if((update->flags & REF_HAVE_NEW) &&3117is_null_sha1(update->new_sha1))3118 update->flags |= REF_DELETING;3119 update->lock =lock_ref_sha1_basic(3120 update->refname,3121((update->flags & REF_HAVE_OLD) ?3122 update->old_sha1 : NULL),3123&affected_refnames, NULL,3124 update->flags,3125&update->type,3126 err);3127if(!update->lock) {3128char*reason;31293130 ret = (errno == ENOTDIR)3131? TRANSACTION_NAME_CONFLICT3132: TRANSACTION_GENERIC_ERROR;3133 reason =strbuf_detach(err, NULL);3134strbuf_addf(err,"cannot lock ref '%s':%s",3135 update->refname, reason);3136free(reason);3137goto cleanup;3138}3139if((update->flags & REF_HAVE_NEW) &&3140!(update->flags & REF_DELETING)) {3141int overwriting_symref = ((update->type & REF_ISSYMREF) &&3142(update->flags & REF_NODEREF));31433144if(!overwriting_symref &&3145!hashcmp(update->lock->old_oid.hash, update->new_sha1)) {3146/*3147 * The reference already has the desired3148 * value, so we don't need to write it.3149 */3150}else if(write_ref_to_lockfile(update->lock,3151 update->new_sha1,3152 err)) {3153char*write_err =strbuf_detach(err, NULL);31543155/*3156 * The lock was freed upon failure of3157 * write_ref_to_lockfile():3158 */3159 update->lock = NULL;3160strbuf_addf(err,3161"cannot update the ref '%s':%s",3162 update->refname, write_err);3163free(write_err);3164 ret = TRANSACTION_GENERIC_ERROR;3165goto cleanup;3166}else{3167 update->flags |= REF_NEEDS_COMMIT;3168}3169}3170if(!(update->flags & REF_NEEDS_COMMIT)) {3171/*3172 * We didn't have to write anything to the lockfile.3173 * Close it to free up the file descriptor:3174 */3175if(close_ref(update->lock)) {3176strbuf_addf(err,"Couldn't close%s.lock",3177 update->refname);3178goto cleanup;3179}3180}3181}31823183/* Perform updates first so live commits remain referenced */3184for(i =0; i < n; i++) {3185struct ref_update *update = updates[i];31863187if(update->flags & REF_NEEDS_COMMIT) {3188if(commit_ref_update(update->lock,3189 update->new_sha1, update->msg,3190 update->flags, err)) {3191/* freed by commit_ref_update(): */3192 update->lock = NULL;3193 ret = TRANSACTION_GENERIC_ERROR;3194goto cleanup;3195}else{3196/* freed by commit_ref_update(): */3197 update->lock = NULL;3198}3199}3200}32013202/* Perform deletes now that updates are safely completed */3203for(i =0; i < n; i++) {3204struct ref_update *update = updates[i];32053206if(update->flags & REF_DELETING) {3207if(delete_ref_loose(update->lock, update->type, err)) {3208 ret = TRANSACTION_GENERIC_ERROR;3209goto cleanup;3210}32113212if(!(update->flags & REF_ISPRUNING))3213string_list_append(&refs_to_delete,3214 update->lock->ref_name);3215}3216}32173218if(repack_without_refs(&refs_to_delete, err)) {3219 ret = TRANSACTION_GENERIC_ERROR;3220goto cleanup;3221}3222for_each_string_list_item(ref_to_delete, &refs_to_delete)3223unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3224clear_loose_ref_cache(&ref_cache);32253226cleanup:3227 transaction->state = REF_TRANSACTION_CLOSED;32283229for(i =0; i < n; i++)3230if(updates[i]->lock)3231unlock_ref(updates[i]->lock);3232string_list_clear(&refs_to_delete,0);3233string_list_clear(&affected_refnames,0);3234return ret;3235}32363237static intref_present(const char*refname,3238const struct object_id *oid,int flags,void*cb_data)3239{3240struct string_list *affected_refnames = cb_data;32413242returnstring_list_has_string(affected_refnames, refname);3243}32443245intinitial_ref_transaction_commit(struct ref_transaction *transaction,3246struct strbuf *err)3247{3248int ret =0, i;3249int n = transaction->nr;3250struct ref_update **updates = transaction->updates;3251struct string_list affected_refnames = STRING_LIST_INIT_NODUP;32523253assert(err);32543255if(transaction->state != REF_TRANSACTION_OPEN)3256die("BUG: commit called for transaction that is not open");32573258/* Fail if a refname appears more than once in the transaction: */3259for(i =0; i < n; i++)3260string_list_append(&affected_refnames, updates[i]->refname);3261string_list_sort(&affected_refnames);3262if(ref_update_reject_duplicates(&affected_refnames, err)) {3263 ret = TRANSACTION_GENERIC_ERROR;3264goto cleanup;3265}32663267/*3268 * It's really undefined to call this function in an active3269 * repository or when there are existing references: we are3270 * only locking and changing packed-refs, so (1) any3271 * simultaneous processes might try to change a reference at3272 * the same time we do, and (2) any existing loose versions of3273 * the references that we are setting would have precedence3274 * over our values. But some remote helpers create the remote3275 * "HEAD" and "master" branches before calling this function,3276 * so here we really only check that none of the references3277 * that we are creating already exists.3278 */3279if(for_each_rawref(ref_present, &affected_refnames))3280die("BUG: initial ref transaction called with existing refs");32813282for(i =0; i < n; i++) {3283struct ref_update *update = updates[i];32843285if((update->flags & REF_HAVE_OLD) &&3286!is_null_sha1(update->old_sha1))3287die("BUG: initial ref transaction with old_sha1 set");3288if(verify_refname_available(update->refname,3289&affected_refnames, NULL,3290 err)) {3291 ret = TRANSACTION_NAME_CONFLICT;3292goto cleanup;3293}3294}32953296if(lock_packed_refs(0)) {3297strbuf_addf(err,"unable to lock packed-refs file:%s",3298strerror(errno));3299 ret = TRANSACTION_GENERIC_ERROR;3300goto cleanup;3301}33023303for(i =0; i < n; i++) {3304struct ref_update *update = updates[i];33053306if((update->flags & REF_HAVE_NEW) &&3307!is_null_sha1(update->new_sha1))3308add_packed_ref(update->refname, update->new_sha1);3309}33103311if(commit_packed_refs()) {3312strbuf_addf(err,"unable to commit packed-refs file:%s",3313strerror(errno));3314 ret = TRANSACTION_GENERIC_ERROR;3315goto cleanup;3316}33173318cleanup:3319 transaction->state = REF_TRANSACTION_CLOSED;3320string_list_clear(&affected_refnames,0);3321return ret;3322}33233324struct expire_reflog_cb {3325unsigned int flags;3326 reflog_expiry_should_prune_fn *should_prune_fn;3327void*policy_cb;3328FILE*newlog;3329unsigned char last_kept_sha1[20];3330};33313332static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3333const char*email,unsigned long timestamp,int tz,3334const char*message,void*cb_data)3335{3336struct expire_reflog_cb *cb = cb_data;3337struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;33383339if(cb->flags & EXPIRE_REFLOGS_REWRITE)3340 osha1 = cb->last_kept_sha1;33413342if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3343 message, policy_cb)) {3344if(!cb->newlog)3345printf("would prune%s", message);3346else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3347printf("prune%s", message);3348}else{3349if(cb->newlog) {3350fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3351sha1_to_hex(osha1),sha1_to_hex(nsha1),3352 email, timestamp, tz, message);3353hashcpy(cb->last_kept_sha1, nsha1);3354}3355if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3356printf("keep%s", message);3357}3358return0;3359}33603361intreflog_expire(const char*refname,const unsigned char*sha1,3362unsigned int flags,3363 reflog_expiry_prepare_fn prepare_fn,3364 reflog_expiry_should_prune_fn should_prune_fn,3365 reflog_expiry_cleanup_fn cleanup_fn,3366void*policy_cb_data)3367{3368static struct lock_file reflog_lock;3369struct expire_reflog_cb cb;3370struct ref_lock *lock;3371char*log_file;3372int status =0;3373int type;3374struct strbuf err = STRBUF_INIT;33753376memset(&cb,0,sizeof(cb));3377 cb.flags = flags;3378 cb.policy_cb = policy_cb_data;3379 cb.should_prune_fn = should_prune_fn;33803381/*3382 * The reflog file is locked by holding the lock on the3383 * reference itself, plus we might need to update the3384 * reference if --updateref was specified:3385 */3386 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,3387&type, &err);3388if(!lock) {3389error("cannot lock ref '%s':%s", refname, err.buf);3390strbuf_release(&err);3391return-1;3392}3393if(!reflog_exists(refname)) {3394unlock_ref(lock);3395return0;3396}33973398 log_file =git_pathdup("logs/%s", refname);3399if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3400/*3401 * Even though holding $GIT_DIR/logs/$reflog.lock has3402 * no locking implications, we use the lock_file3403 * machinery here anyway because it does a lot of the3404 * work we need, including cleaning up if the program3405 * exits unexpectedly.3406 */3407if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {3408struct strbuf err = STRBUF_INIT;3409unable_to_lock_message(log_file, errno, &err);3410error("%s", err.buf);3411strbuf_release(&err);3412goto failure;3413}3414 cb.newlog =fdopen_lock_file(&reflog_lock,"w");3415if(!cb.newlog) {3416error("cannot fdopen%s(%s)",3417get_lock_file_path(&reflog_lock),strerror(errno));3418goto failure;3419}3420}34213422(*prepare_fn)(refname, sha1, cb.policy_cb);3423for_each_reflog_ent(refname, expire_reflog_ent, &cb);3424(*cleanup_fn)(cb.policy_cb);34253426if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3427/*3428 * It doesn't make sense to adjust a reference pointed3429 * to by a symbolic ref based on expiring entries in3430 * the symbolic reference's reflog. Nor can we update3431 * a reference if there are no remaining reflog3432 * entries.3433 */3434int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&3435!(type & REF_ISSYMREF) &&3436!is_null_sha1(cb.last_kept_sha1);34373438if(close_lock_file(&reflog_lock)) {3439 status |=error("couldn't write%s:%s", log_file,3440strerror(errno));3441}else if(update &&3442(write_in_full(get_lock_file_fd(lock->lk),3443sha1_to_hex(cb.last_kept_sha1),40) !=40||3444write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||3445close_ref(lock) <0)) {3446 status |=error("couldn't write%s",3447get_lock_file_path(lock->lk));3448rollback_lock_file(&reflog_lock);3449}else if(commit_lock_file(&reflog_lock)) {3450 status |=error("unable to write reflog '%s' (%s)",3451 log_file,strerror(errno));3452}else if(update &&commit_ref(lock)) {3453 status |=error("couldn't set%s", lock->ref_name);3454}3455}3456free(log_file);3457unlock_ref(lock);3458return status;34593460 failure:3461rollback_lock_file(&reflog_lock);3462free(log_file);3463unlock_ref(lock);3464return-1;3465}