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/* We allow "recursive" symbolic refs. Only within reason, though */1273#define MAXDEPTH 51274#define MAXREFLEN (1024)12751276/*1277 * Called by resolve_gitlink_ref_recursive() after it failed to read1278 * from the loose refs in ref_cache refs. Find <refname> in the1279 * packed-refs file for the submodule.1280 */1281static intresolve_gitlink_packed_ref(struct ref_cache *refs,1282const char*refname,unsigned char*sha1)1283{1284struct ref_entry *ref;1285struct ref_dir *dir =get_packed_refs(refs);12861287 ref =find_ref(dir, refname);1288if(ref == NULL)1289return-1;12901291hashcpy(sha1, ref->u.value.oid.hash);1292return0;1293}12941295static intresolve_gitlink_ref_recursive(struct ref_cache *refs,1296const char*refname,unsigned char*sha1,1297int recursion)1298{1299int fd, len;1300char buffer[128], *p;1301char*path;13021303if(recursion > MAXDEPTH ||strlen(refname) > MAXREFLEN)1304return-1;1305 path = *refs->name1306?git_pathdup_submodule(refs->name,"%s", refname)1307:git_pathdup("%s", refname);1308 fd =open(path, O_RDONLY);1309free(path);1310if(fd <0)1311returnresolve_gitlink_packed_ref(refs, refname, sha1);13121313 len =read(fd, buffer,sizeof(buffer)-1);1314close(fd);1315if(len <0)1316return-1;1317while(len &&isspace(buffer[len-1]))1318 len--;1319 buffer[len] =0;13201321/* Was it a detached head or an old-fashioned symlink? */1322if(!get_sha1_hex(buffer, sha1))1323return0;13241325/* Symref? */1326if(strncmp(buffer,"ref:",4))1327return-1;1328 p = buffer +4;1329while(isspace(*p))1330 p++;13311332returnresolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1333}13341335intresolve_gitlink_ref(const char*path,const char*refname,unsigned char*sha1)1336{1337int len =strlen(path), retval;1338struct strbuf submodule = STRBUF_INIT;1339struct ref_cache *refs;13401341while(len && path[len-1] =='/')1342 len--;1343if(!len)1344return-1;13451346strbuf_add(&submodule, path, len);1347 refs =lookup_ref_cache(submodule.buf);1348if(!refs) {1349if(!is_nonbare_repository_dir(&submodule)) {1350strbuf_release(&submodule);1351return-1;1352}1353 refs =create_ref_cache(submodule.buf);1354}1355strbuf_release(&submodule);13561357 retval =resolve_gitlink_ref_recursive(refs, refname, sha1,0);1358return retval;1359}13601361/*1362 * Return the ref_entry for the given refname from the packed1363 * references. If it does not exist, return NULL.1364 */1365static struct ref_entry *get_packed_ref(const char*refname)1366{1367returnfind_ref(get_packed_refs(&ref_cache), refname);1368}13691370/*1371 * A loose ref file doesn't exist; check for a packed ref.1372 */1373static intresolve_missing_loose_ref(const char*refname,1374unsigned char*sha1,1375int*flags)1376{1377struct ref_entry *entry;13781379/*1380 * The loose reference file does not exist; check for a packed1381 * reference.1382 */1383 entry =get_packed_ref(refname);1384if(entry) {1385hashcpy(sha1, entry->u.value.oid.hash);1386*flags |= REF_ISPACKED;1387return0;1388}1389/* refname is not a packed reference. */1390return-1;1391}13921393/*1394 * Read a raw ref from the filesystem or packed refs file.1395 *1396 * If the ref is a sha1, fill in sha1 and return 0.1397 *1398 * If the ref is symbolic, fill in *symref with the referrent1399 * (e.g. "refs/heads/master") and return 0. The caller is responsible1400 * for validating the referrent. Set REF_ISSYMREF in flags.1401 *1402 * If the ref doesn't exist, set errno to ENOENT and return -1.1403 *1404 * If the ref exists but is neither a symbolic ref nor a sha1, it is1405 * broken. Set REF_ISBROKEN in flags, set errno to EINVAL, and return1406 * -1.1407 *1408 * If there is another error reading the ref, set errno appropriately and1409 * return -1.1410 *1411 * Backend-specific flags might be set in flags as well, regardless of1412 * outcome.1413 *1414 * sb_path is workspace: the caller should allocate and free it.1415 *1416 * It is OK for refname to point into symref. In this case:1417 * - if the function succeeds with REF_ISSYMREF, symref will be1418 * overwritten and the memory pointed to by refname might be changed1419 * or even freed.1420 * - in all other cases, symref will be untouched, and therefore1421 * refname will still be valid and unchanged.1422 */1423static intread_raw_ref(const char*refname,unsigned char*sha1,1424struct strbuf *symref,int*flags)1425{1426struct strbuf sb_contents = STRBUF_INIT;1427struct strbuf sb_path = STRBUF_INIT;1428const char*path;1429const char*buf;1430struct stat st;1431int fd;1432int ret = -1;1433int save_errno;14341435strbuf_reset(&sb_path);1436strbuf_git_path(&sb_path,"%s", refname);1437 path = sb_path.buf;14381439stat_ref:1440/*1441 * We might have to loop back here to avoid a race1442 * condition: first we lstat() the file, then we try1443 * to read it as a link or as a file. But if somebody1444 * changes the type of the file (file <-> directory1445 * <-> symlink) between the lstat() and reading, then1446 * we don't want to report that as an error but rather1447 * try again starting with the lstat().1448 */14491450if(lstat(path, &st) <0) {1451if(errno != ENOENT)1452goto out;1453if(resolve_missing_loose_ref(refname, sha1, flags)) {1454 errno = ENOENT;1455goto out;1456}1457 ret =0;1458goto out;1459}14601461/* Follow "normalized" - ie "refs/.." symlinks by hand */1462if(S_ISLNK(st.st_mode)) {1463strbuf_reset(&sb_contents);1464if(strbuf_readlink(&sb_contents, path,0) <0) {1465if(errno == ENOENT || errno == EINVAL)1466/* inconsistent with lstat; retry */1467goto stat_ref;1468else1469goto out;1470}1471if(starts_with(sb_contents.buf,"refs/") &&1472!check_refname_format(sb_contents.buf,0)) {1473strbuf_swap(&sb_contents, symref);1474*flags |= REF_ISSYMREF;1475 ret =0;1476goto out;1477}1478}14791480/* Is it a directory? */1481if(S_ISDIR(st.st_mode)) {1482 errno = EISDIR;1483goto out;1484}14851486/*1487 * Anything else, just open it and try to use it as1488 * a ref1489 */1490 fd =open(path, O_RDONLY);1491if(fd <0) {1492if(errno == ENOENT)1493/* inconsistent with lstat; retry */1494goto stat_ref;1495else1496goto out;1497}1498strbuf_reset(&sb_contents);1499if(strbuf_read(&sb_contents, fd,256) <0) {1500int save_errno = errno;1501close(fd);1502 errno = save_errno;1503goto out;1504}1505close(fd);1506strbuf_rtrim(&sb_contents);1507 buf = sb_contents.buf;1508if(starts_with(buf,"ref:")) {1509 buf +=4;1510while(isspace(*buf))1511 buf++;15121513strbuf_reset(symref);1514strbuf_addstr(symref, buf);1515*flags |= REF_ISSYMREF;1516 ret =0;1517goto out;1518}15191520/*1521 * Please note that FETCH_HEAD has additional1522 * data after the sha.1523 */1524if(get_sha1_hex(buf, sha1) ||1525(buf[40] !='\0'&& !isspace(buf[40]))) {1526*flags |= REF_ISBROKEN;1527 errno = EINVAL;1528goto out;1529}15301531 ret =0;15321533out:1534 save_errno = errno;1535strbuf_release(&sb_path);1536strbuf_release(&sb_contents);1537 errno = save_errno;1538return ret;1539}15401541/* This function needs to return a meaningful errno on failure */1542static const char*resolve_ref_1(const char*refname,1543int resolve_flags,1544unsigned char*sha1,1545int*flags,1546struct strbuf *sb_refname)1547{1548int symref_count;15491550*flags =0;15511552if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1553if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1554!refname_is_safe(refname)) {1555 errno = EINVAL;1556return NULL;1557}15581559/*1560 * dwim_ref() uses REF_ISBROKEN to distinguish between1561 * missing refs and refs that were present but invalid,1562 * to complain about the latter to stderr.1563 *1564 * We don't know whether the ref exists, so don't set1565 * REF_ISBROKEN yet.1566 */1567*flags |= REF_BAD_NAME;1568}15691570for(symref_count =0; symref_count < MAXDEPTH; symref_count++) {1571int read_flags =0;15721573if(read_raw_ref(refname, sha1, sb_refname, &read_flags)) {1574*flags |= read_flags;1575if(errno != ENOENT || (resolve_flags & RESOLVE_REF_READING))1576return NULL;1577hashclr(sha1);1578if(*flags & REF_BAD_NAME)1579*flags |= REF_ISBROKEN;1580return refname;1581}15821583*flags |= read_flags;15841585if(!(read_flags & REF_ISSYMREF)) {1586if(*flags & REF_BAD_NAME) {1587hashclr(sha1);1588*flags |= REF_ISBROKEN;1589}1590return refname;1591}15921593 refname = sb_refname->buf;1594if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1595hashclr(sha1);1596return refname;1597}1598if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1599if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1600!refname_is_safe(refname)) {1601 errno = EINVAL;1602return NULL;1603}16041605*flags |= REF_ISBROKEN | REF_BAD_NAME;1606}1607}16081609 errno = ELOOP;1610return NULL;1611}16121613const char*resolve_ref_unsafe(const char*refname,int resolve_flags,1614unsigned char*sha1,int*flags)1615{1616static struct strbuf sb_refname = STRBUF_INIT;1617int unused_flags;1618const char*ret;16191620if(!flags)1621 flags = &unused_flags;16221623 ret =resolve_ref_1(refname, resolve_flags, sha1, flags,1624&sb_refname);1625return ret;1626}16271628/*1629 * Peel the entry (if possible) and return its new peel_status. If1630 * repeel is true, re-peel the entry even if there is an old peeled1631 * value that is already stored in it.1632 *1633 * It is OK to call this function with a packed reference entry that1634 * might be stale and might even refer to an object that has since1635 * been garbage-collected. In such a case, if the entry has1636 * REF_KNOWS_PEELED then leave the status unchanged and return1637 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1638 */1639static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1640{1641enum peel_status status;16421643if(entry->flag & REF_KNOWS_PEELED) {1644if(repeel) {1645 entry->flag &= ~REF_KNOWS_PEELED;1646oidclr(&entry->u.value.peeled);1647}else{1648returnis_null_oid(&entry->u.value.peeled) ?1649 PEEL_NON_TAG : PEEL_PEELED;1650}1651}1652if(entry->flag & REF_ISBROKEN)1653return PEEL_BROKEN;1654if(entry->flag & REF_ISSYMREF)1655return PEEL_IS_SYMREF;16561657 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1658if(status == PEEL_PEELED || status == PEEL_NON_TAG)1659 entry->flag |= REF_KNOWS_PEELED;1660return status;1661}16621663intpeel_ref(const char*refname,unsigned char*sha1)1664{1665int flag;1666unsigned char base[20];16671668if(current_ref && (current_ref->name == refname1669|| !strcmp(current_ref->name, refname))) {1670if(peel_entry(current_ref,0))1671return-1;1672hashcpy(sha1, current_ref->u.value.peeled.hash);1673return0;1674}16751676if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1677return-1;16781679/*1680 * If the reference is packed, read its ref_entry from the1681 * cache in the hope that we already know its peeled value.1682 * We only try this optimization on packed references because1683 * (a) forcing the filling of the loose reference cache could1684 * be expensive and (b) loose references anyway usually do not1685 * have REF_KNOWS_PEELED.1686 */1687if(flag & REF_ISPACKED) {1688struct ref_entry *r =get_packed_ref(refname);1689if(r) {1690if(peel_entry(r,0))1691return-1;1692hashcpy(sha1, r->u.value.peeled.hash);1693return0;1694}1695}16961697returnpeel_object(base, sha1);1698}16991700/*1701 * Call fn for each reference in the specified ref_cache, omitting1702 * references not in the containing_dir of base. fn is called for all1703 * references, including broken ones. If fn ever returns a non-zero1704 * value, stop the iteration and return that value; otherwise, return1705 * 0.1706 */1707static intdo_for_each_entry(struct ref_cache *refs,const char*base,1708 each_ref_entry_fn fn,void*cb_data)1709{1710struct packed_ref_cache *packed_ref_cache;1711struct ref_dir *loose_dir;1712struct ref_dir *packed_dir;1713int retval =0;17141715/*1716 * We must make sure that all loose refs are read before accessing the1717 * packed-refs file; this avoids a race condition in which loose refs1718 * are migrated to the packed-refs file by a simultaneous process, but1719 * our in-memory view is from before the migration. get_packed_ref_cache()1720 * takes care of making sure our view is up to date with what is on1721 * disk.1722 */1723 loose_dir =get_loose_refs(refs);1724if(base && *base) {1725 loose_dir =find_containing_dir(loose_dir, base,0);1726}1727if(loose_dir)1728prime_ref_dir(loose_dir);17291730 packed_ref_cache =get_packed_ref_cache(refs);1731acquire_packed_ref_cache(packed_ref_cache);1732 packed_dir =get_packed_ref_dir(packed_ref_cache);1733if(base && *base) {1734 packed_dir =find_containing_dir(packed_dir, base,0);1735}17361737if(packed_dir && loose_dir) {1738sort_ref_dir(packed_dir);1739sort_ref_dir(loose_dir);1740 retval =do_for_each_entry_in_dirs(1741 packed_dir, loose_dir, fn, cb_data);1742}else if(packed_dir) {1743sort_ref_dir(packed_dir);1744 retval =do_for_each_entry_in_dir(1745 packed_dir,0, fn, cb_data);1746}else if(loose_dir) {1747sort_ref_dir(loose_dir);1748 retval =do_for_each_entry_in_dir(1749 loose_dir,0, fn, cb_data);1750}17511752release_packed_ref_cache(packed_ref_cache);1753return retval;1754}17551756/*1757 * Call fn for each reference in the specified ref_cache for which the1758 * refname begins with base. If trim is non-zero, then trim that many1759 * characters off the beginning of each refname before passing the1760 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include1761 * broken references in the iteration. If fn ever returns a non-zero1762 * value, stop the iteration and return that value; otherwise, return1763 * 0.1764 */1765intdo_for_each_ref(const char*submodule,const char*base,1766 each_ref_fn fn,int trim,int flags,void*cb_data)1767{1768struct ref_entry_cb data;1769struct ref_cache *refs;17701771 refs =get_ref_cache(submodule);1772 data.base = base;1773 data.trim = trim;1774 data.flags = flags;1775 data.fn = fn;1776 data.cb_data = cb_data;17771778if(ref_paranoia <0)1779 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1780if(ref_paranoia)1781 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;17821783returndo_for_each_entry(refs, base, do_one_ref, &data);1784}17851786static voidunlock_ref(struct ref_lock *lock)1787{1788/* Do not free lock->lk -- atexit() still looks at them */1789if(lock->lk)1790rollback_lock_file(lock->lk);1791free(lock->ref_name);1792free(lock->orig_ref_name);1793free(lock);1794}17951796/*1797 * Verify that the reference locked by lock has the value old_sha1.1798 * Fail if the reference doesn't exist and mustexist is set. Return 01799 * on success. On error, write an error message to err, set errno, and1800 * return a negative value.1801 */1802static intverify_lock(struct ref_lock *lock,1803const unsigned char*old_sha1,int mustexist,1804struct strbuf *err)1805{1806assert(err);18071808if(read_ref_full(lock->ref_name,1809 mustexist ? RESOLVE_REF_READING :0,1810 lock->old_oid.hash, NULL)) {1811if(old_sha1) {1812int save_errno = errno;1813strbuf_addf(err,"can't verify ref%s", lock->ref_name);1814 errno = save_errno;1815return-1;1816}else{1817hashclr(lock->old_oid.hash);1818return0;1819}1820}1821if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {1822strbuf_addf(err,"ref%sis at%sbut expected%s",1823 lock->ref_name,1824sha1_to_hex(lock->old_oid.hash),1825sha1_to_hex(old_sha1));1826 errno = EBUSY;1827return-1;1828}1829return0;1830}18311832static intremove_empty_directories(struct strbuf *path)1833{1834/*1835 * we want to create a file but there is a directory there;1836 * if that is an empty directory (or a directory that contains1837 * only empty directories), remove them.1838 */1839returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);1840}18411842/*1843 * Locks a ref returning the lock on success and NULL on failure.1844 * On failure errno is set to something meaningful.1845 */1846static struct ref_lock *lock_ref_sha1_basic(const char*refname,1847const unsigned char*old_sha1,1848const struct string_list *extras,1849const struct string_list *skip,1850unsigned int flags,int*type_p,1851struct strbuf *err)1852{1853struct strbuf ref_file = STRBUF_INIT;1854struct strbuf orig_ref_file = STRBUF_INIT;1855const char*orig_refname = refname;1856struct ref_lock *lock;1857int last_errno =0;1858int type;1859int lflags =0;1860int mustexist = (old_sha1 && !is_null_sha1(old_sha1));1861int resolve_flags =0;1862int attempts_remaining =3;18631864assert(err);18651866 lock =xcalloc(1,sizeof(struct ref_lock));18671868if(mustexist)1869 resolve_flags |= RESOLVE_REF_READING;1870if(flags & REF_DELETING)1871 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;1872if(flags & REF_NODEREF) {1873 resolve_flags |= RESOLVE_REF_NO_RECURSE;1874 lflags |= LOCK_NO_DEREF;1875}18761877 refname =resolve_ref_unsafe(refname, resolve_flags,1878 lock->old_oid.hash, &type);1879if(!refname && errno == EISDIR) {1880/*1881 * we are trying to lock foo but we used to1882 * have foo/bar which now does not exist;1883 * it is normal for the empty directory 'foo'1884 * to remain.1885 */1886strbuf_git_path(&orig_ref_file,"%s", orig_refname);1887if(remove_empty_directories(&orig_ref_file)) {1888 last_errno = errno;1889if(!verify_refname_available_dir(orig_refname, extras, skip,1890get_loose_refs(&ref_cache), err))1891strbuf_addf(err,"there are still refs under '%s'",1892 orig_refname);1893goto error_return;1894}1895 refname =resolve_ref_unsafe(orig_refname, resolve_flags,1896 lock->old_oid.hash, &type);1897}1898if(type_p)1899*type_p = type;1900if(!refname) {1901 last_errno = errno;1902if(last_errno != ENOTDIR ||1903!verify_refname_available_dir(orig_refname, extras, skip,1904get_loose_refs(&ref_cache), err))1905strbuf_addf(err,"unable to resolve reference%s:%s",1906 orig_refname,strerror(last_errno));19071908goto error_return;1909}19101911if(flags & REF_NODEREF)1912 refname = orig_refname;19131914/*1915 * If the ref did not exist and we are creating it, make sure1916 * there is no existing packed ref whose name begins with our1917 * refname, nor a packed ref whose name is a proper prefix of1918 * our refname.1919 */1920if(is_null_oid(&lock->old_oid) &&1921verify_refname_available_dir(refname, extras, skip,1922get_packed_refs(&ref_cache), err)) {1923 last_errno = ENOTDIR;1924goto error_return;1925}19261927 lock->lk =xcalloc(1,sizeof(struct lock_file));19281929 lock->ref_name =xstrdup(refname);1930 lock->orig_ref_name =xstrdup(orig_refname);1931strbuf_git_path(&ref_file,"%s", refname);19321933 retry:1934switch(safe_create_leading_directories_const(ref_file.buf)) {1935case SCLD_OK:1936break;/* success */1937case SCLD_VANISHED:1938if(--attempts_remaining >0)1939goto retry;1940/* fall through */1941default:1942 last_errno = errno;1943strbuf_addf(err,"unable to create directory for%s",1944 ref_file.buf);1945goto error_return;1946}19471948if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {1949 last_errno = errno;1950if(errno == ENOENT && --attempts_remaining >0)1951/*1952 * Maybe somebody just deleted one of the1953 * directories leading to ref_file. Try1954 * again:1955 */1956goto retry;1957else{1958unable_to_lock_message(ref_file.buf, errno, err);1959goto error_return;1960}1961}1962if(verify_lock(lock, old_sha1, mustexist, err)) {1963 last_errno = errno;1964goto error_return;1965}1966goto out;19671968 error_return:1969unlock_ref(lock);1970 lock = NULL;19711972 out:1973strbuf_release(&ref_file);1974strbuf_release(&orig_ref_file);1975 errno = last_errno;1976return lock;1977}19781979/*1980 * Write an entry to the packed-refs file for the specified refname.1981 * If peeled is non-NULL, write it as the entry's peeled value.1982 */1983static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,1984unsigned char*peeled)1985{1986fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);1987if(peeled)1988fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));1989}19901991/*1992 * An each_ref_entry_fn that writes the entry to a packed-refs file.1993 */1994static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)1995{1996enum peel_status peel_status =peel_entry(entry,0);19971998if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)1999error("internal error:%sis not a valid packed reference!",2000 entry->name);2001write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2002 peel_status == PEEL_PEELED ?2003 entry->u.value.peeled.hash : NULL);2004return0;2005}20062007/*2008 * Lock the packed-refs file for writing. Flags is passed to2009 * hold_lock_file_for_update(). Return 0 on success. On errors, set2010 * errno appropriately and return a nonzero value.2011 */2012static intlock_packed_refs(int flags)2013{2014static int timeout_configured =0;2015static int timeout_value =1000;20162017struct packed_ref_cache *packed_ref_cache;20182019if(!timeout_configured) {2020git_config_get_int("core.packedrefstimeout", &timeout_value);2021 timeout_configured =1;2022}20232024if(hold_lock_file_for_update_timeout(2025&packlock,git_path("packed-refs"),2026 flags, timeout_value) <0)2027return-1;2028/*2029 * Get the current packed-refs while holding the lock. If the2030 * packed-refs file has been modified since we last read it,2031 * this will automatically invalidate the cache and re-read2032 * the packed-refs file.2033 */2034 packed_ref_cache =get_packed_ref_cache(&ref_cache);2035 packed_ref_cache->lock = &packlock;2036/* Increment the reference count to prevent it from being freed: */2037acquire_packed_ref_cache(packed_ref_cache);2038return0;2039}20402041/*2042 * Write the current version of the packed refs cache from memory to2043 * disk. The packed-refs file must already be locked for writing (see2044 * lock_packed_refs()). Return zero on success. On errors, set errno2045 * and return a nonzero value2046 */2047static intcommit_packed_refs(void)2048{2049struct packed_ref_cache *packed_ref_cache =2050get_packed_ref_cache(&ref_cache);2051int error =0;2052int save_errno =0;2053FILE*out;20542055if(!packed_ref_cache->lock)2056die("internal error: packed-refs not locked");20572058 out =fdopen_lock_file(packed_ref_cache->lock,"w");2059if(!out)2060die_errno("unable to fdopen packed-refs descriptor");20612062fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2063do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),20640, write_packed_entry_fn, out);20652066if(commit_lock_file(packed_ref_cache->lock)) {2067 save_errno = errno;2068 error = -1;2069}2070 packed_ref_cache->lock = NULL;2071release_packed_ref_cache(packed_ref_cache);2072 errno = save_errno;2073return error;2074}20752076/*2077 * Rollback the lockfile for the packed-refs file, and discard the2078 * in-memory packed reference cache. (The packed-refs file will be2079 * read anew if it is needed again after this function is called.)2080 */2081static voidrollback_packed_refs(void)2082{2083struct packed_ref_cache *packed_ref_cache =2084get_packed_ref_cache(&ref_cache);20852086if(!packed_ref_cache->lock)2087die("internal error: packed-refs not locked");2088rollback_lock_file(packed_ref_cache->lock);2089 packed_ref_cache->lock = NULL;2090release_packed_ref_cache(packed_ref_cache);2091clear_packed_ref_cache(&ref_cache);2092}20932094struct ref_to_prune {2095struct ref_to_prune *next;2096unsigned char sha1[20];2097char name[FLEX_ARRAY];2098};20992100struct pack_refs_cb_data {2101unsigned int flags;2102struct ref_dir *packed_refs;2103struct ref_to_prune *ref_to_prune;2104};21052106/*2107 * An each_ref_entry_fn that is run over loose references only. If2108 * the loose reference can be packed, add an entry in the packed ref2109 * cache. If the reference should be pruned, also add it to2110 * ref_to_prune in the pack_refs_cb_data.2111 */2112static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2113{2114struct pack_refs_cb_data *cb = cb_data;2115enum peel_status peel_status;2116struct ref_entry *packed_entry;2117int is_tag_ref =starts_with(entry->name,"refs/tags/");21182119/* Do not pack per-worktree refs: */2120if(ref_type(entry->name) != REF_TYPE_NORMAL)2121return0;21222123/* ALWAYS pack tags */2124if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2125return0;21262127/* Do not pack symbolic or broken refs: */2128if((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2129return0;21302131/* Add a packed ref cache entry equivalent to the loose entry. */2132 peel_status =peel_entry(entry,1);2133if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2134die("internal error peeling reference%s(%s)",2135 entry->name,oid_to_hex(&entry->u.value.oid));2136 packed_entry =find_ref(cb->packed_refs, entry->name);2137if(packed_entry) {2138/* Overwrite existing packed entry with info from loose entry */2139 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2140oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2141}else{2142 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2143 REF_ISPACKED | REF_KNOWS_PEELED,0);2144add_ref(cb->packed_refs, packed_entry);2145}2146oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);21472148/* Schedule the loose reference for pruning if requested. */2149if((cb->flags & PACK_REFS_PRUNE)) {2150struct ref_to_prune *n;2151FLEX_ALLOC_STR(n, name, entry->name);2152hashcpy(n->sha1, entry->u.value.oid.hash);2153 n->next = cb->ref_to_prune;2154 cb->ref_to_prune = n;2155}2156return0;2157}21582159/*2160 * Remove empty parents, but spare refs/ and immediate subdirs.2161 * Note: munges *name.2162 */2163static voidtry_remove_empty_parents(char*name)2164{2165char*p, *q;2166int i;2167 p = name;2168for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2169while(*p && *p !='/')2170 p++;2171/* tolerate duplicate slashes; see check_refname_format() */2172while(*p =='/')2173 p++;2174}2175for(q = p; *q; q++)2176;2177while(1) {2178while(q > p && *q !='/')2179 q--;2180while(q > p && *(q-1) =='/')2181 q--;2182if(q == p)2183break;2184*q ='\0';2185if(rmdir(git_path("%s", name)))2186break;2187}2188}21892190/* make sure nobody touched the ref, and unlink */2191static voidprune_ref(struct ref_to_prune *r)2192{2193struct ref_transaction *transaction;2194struct strbuf err = STRBUF_INIT;21952196if(check_refname_format(r->name,0))2197return;21982199 transaction =ref_transaction_begin(&err);2200if(!transaction ||2201ref_transaction_delete(transaction, r->name, r->sha1,2202 REF_ISPRUNING, NULL, &err) ||2203ref_transaction_commit(transaction, &err)) {2204ref_transaction_free(transaction);2205error("%s", err.buf);2206strbuf_release(&err);2207return;2208}2209ref_transaction_free(transaction);2210strbuf_release(&err);2211try_remove_empty_parents(r->name);2212}22132214static voidprune_refs(struct ref_to_prune *r)2215{2216while(r) {2217prune_ref(r);2218 r = r->next;2219}2220}22212222intpack_refs(unsigned int flags)2223{2224struct pack_refs_cb_data cbdata;22252226memset(&cbdata,0,sizeof(cbdata));2227 cbdata.flags = flags;22282229lock_packed_refs(LOCK_DIE_ON_ERROR);2230 cbdata.packed_refs =get_packed_refs(&ref_cache);22312232do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2233 pack_if_possible_fn, &cbdata);22342235if(commit_packed_refs())2236die_errno("unable to overwrite old ref-pack file");22372238prune_refs(cbdata.ref_to_prune);2239return0;2240}22412242/*2243 * Rewrite the packed-refs file, omitting any refs listed in2244 * 'refnames'. On error, leave packed-refs unchanged, write an error2245 * message to 'err', and return a nonzero value.2246 *2247 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2248 */2249static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2250{2251struct ref_dir *packed;2252struct string_list_item *refname;2253int ret, needs_repacking =0, removed =0;22542255assert(err);22562257/* Look for a packed ref */2258for_each_string_list_item(refname, refnames) {2259if(get_packed_ref(refname->string)) {2260 needs_repacking =1;2261break;2262}2263}22642265/* Avoid locking if we have nothing to do */2266if(!needs_repacking)2267return0;/* no refname exists in packed refs */22682269if(lock_packed_refs(0)) {2270unable_to_lock_message(git_path("packed-refs"), errno, err);2271return-1;2272}2273 packed =get_packed_refs(&ref_cache);22742275/* Remove refnames from the cache */2276for_each_string_list_item(refname, refnames)2277if(remove_entry(packed, refname->string) != -1)2278 removed =1;2279if(!removed) {2280/*2281 * All packed entries disappeared while we were2282 * acquiring the lock.2283 */2284rollback_packed_refs();2285return0;2286}22872288/* Write what remains */2289 ret =commit_packed_refs();2290if(ret)2291strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2292strerror(errno));2293return ret;2294}22952296static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2297{2298assert(err);22992300if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2301/*2302 * loose. The loose file name is the same as the2303 * lockfile name, minus ".lock":2304 */2305char*loose_filename =get_locked_file_path(lock->lk);2306int res =unlink_or_msg(loose_filename, err);2307free(loose_filename);2308if(res)2309return1;2310}2311return0;2312}23132314intdelete_refs(struct string_list *refnames)2315{2316struct strbuf err = STRBUF_INIT;2317int i, result =0;23182319if(!refnames->nr)2320return0;23212322 result =repack_without_refs(refnames, &err);2323if(result) {2324/*2325 * If we failed to rewrite the packed-refs file, then2326 * it is unsafe to try to remove loose refs, because2327 * doing so might expose an obsolete packed value for2328 * a reference that might even point at an object that2329 * has been garbage collected.2330 */2331if(refnames->nr ==1)2332error(_("could not delete reference%s:%s"),2333 refnames->items[0].string, err.buf);2334else2335error(_("could not delete references:%s"), err.buf);23362337goto out;2338}23392340for(i =0; i < refnames->nr; i++) {2341const char*refname = refnames->items[i].string;23422343if(delete_ref(refname, NULL,0))2344 result |=error(_("could not remove reference%s"), refname);2345}23462347out:2348strbuf_release(&err);2349return result;2350}23512352/*2353 * People using contrib's git-new-workdir have .git/logs/refs ->2354 * /some/other/path/.git/logs/refs, and that may live on another device.2355 *2356 * IOW, to avoid cross device rename errors, the temporary renamed log must2357 * live into logs/refs.2358 */2359#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"23602361static intrename_tmp_log(const char*newrefname)2362{2363int attempts_remaining =4;2364struct strbuf path = STRBUF_INIT;2365int ret = -1;23662367 retry:2368strbuf_reset(&path);2369strbuf_git_path(&path,"logs/%s", newrefname);2370switch(safe_create_leading_directories_const(path.buf)) {2371case SCLD_OK:2372break;/* success */2373case SCLD_VANISHED:2374if(--attempts_remaining >0)2375goto retry;2376/* fall through */2377default:2378error("unable to create directory for%s", newrefname);2379goto out;2380}23812382if(rename(git_path(TMP_RENAMED_LOG), path.buf)) {2383if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2384/*2385 * rename(a, b) when b is an existing2386 * directory ought to result in ISDIR, but2387 * Solaris 5.8 gives ENOTDIR. Sheesh.2388 */2389if(remove_empty_directories(&path)) {2390error("Directory not empty: logs/%s", newrefname);2391goto out;2392}2393goto retry;2394}else if(errno == ENOENT && --attempts_remaining >0) {2395/*2396 * Maybe another process just deleted one of2397 * the directories in the path to newrefname.2398 * Try again from the beginning.2399 */2400goto retry;2401}else{2402error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2403 newrefname,strerror(errno));2404goto out;2405}2406}2407 ret =0;2408out:2409strbuf_release(&path);2410return ret;2411}24122413intverify_refname_available(const char*newname,2414struct string_list *extras,2415struct string_list *skip,2416struct strbuf *err)2417{2418struct ref_dir *packed_refs =get_packed_refs(&ref_cache);2419struct ref_dir *loose_refs =get_loose_refs(&ref_cache);24202421if(verify_refname_available_dir(newname, extras, skip,2422 packed_refs, err) ||2423verify_refname_available_dir(newname, extras, skip,2424 loose_refs, err))2425return-1;24262427return0;2428}24292430static intwrite_ref_to_lockfile(struct ref_lock *lock,2431const unsigned char*sha1,struct strbuf *err);2432static intcommit_ref_update(struct ref_lock *lock,2433const unsigned char*sha1,const char*logmsg,2434int flags,struct strbuf *err);24352436intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2437{2438unsigned char sha1[20], orig_sha1[20];2439int flag =0, logmoved =0;2440struct ref_lock *lock;2441struct stat loginfo;2442int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2443const char*symref = NULL;2444struct strbuf err = STRBUF_INIT;24452446if(log &&S_ISLNK(loginfo.st_mode))2447returnerror("reflog for%sis a symlink", oldrefname);24482449 symref =resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,2450 orig_sha1, &flag);2451if(flag & REF_ISSYMREF)2452returnerror("refname%sis a symbolic ref, renaming it is not supported",2453 oldrefname);2454if(!symref)2455returnerror("refname%snot found", oldrefname);24562457if(!rename_ref_available(oldrefname, newrefname))2458return1;24592460if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2461returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2462 oldrefname,strerror(errno));24632464if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2465error("unable to delete old%s", oldrefname);2466goto rollback;2467}24682469if(!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&2470delete_ref(newrefname, sha1, REF_NODEREF)) {2471if(errno==EISDIR) {2472struct strbuf path = STRBUF_INIT;2473int result;24742475strbuf_git_path(&path,"%s", newrefname);2476 result =remove_empty_directories(&path);2477strbuf_release(&path);24782479if(result) {2480error("Directory not empty:%s", newrefname);2481goto rollback;2482}2483}else{2484error("unable to delete existing%s", newrefname);2485goto rollback;2486}2487}24882489if(log &&rename_tmp_log(newrefname))2490goto rollback;24912492 logmoved = log;24932494 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL,0, NULL, &err);2495if(!lock) {2496error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2497strbuf_release(&err);2498goto rollback;2499}2500hashcpy(lock->old_oid.hash, orig_sha1);25012502if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2503commit_ref_update(lock, orig_sha1, logmsg,0, &err)) {2504error("unable to write current sha1 into%s:%s", newrefname, err.buf);2505strbuf_release(&err);2506goto rollback;2507}25082509return0;25102511 rollback:2512 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL,0, NULL, &err);2513if(!lock) {2514error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2515strbuf_release(&err);2516goto rollbacklog;2517}25182519 flag = log_all_ref_updates;2520 log_all_ref_updates =0;2521if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2522commit_ref_update(lock, orig_sha1, NULL,0, &err)) {2523error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2524strbuf_release(&err);2525}2526 log_all_ref_updates = flag;25272528 rollbacklog:2529if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2530error("unable to restore logfile%sfrom%s:%s",2531 oldrefname, newrefname,strerror(errno));2532if(!logmoved && log &&2533rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2534error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2535 oldrefname,strerror(errno));25362537return1;2538}25392540static intclose_ref(struct ref_lock *lock)2541{2542if(close_lock_file(lock->lk))2543return-1;2544return0;2545}25462547static intcommit_ref(struct ref_lock *lock)2548{2549if(commit_lock_file(lock->lk))2550return-1;2551return0;2552}25532554/*2555 * Create a reflog for a ref. If force_create = 0, the reflog will2556 * only be created for certain refs (those for which2557 * should_autocreate_reflog returns non-zero. Otherwise, create it2558 * regardless of the ref name. Fill in *err and return -1 on failure.2559 */2560static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)2561{2562int logfd, oflags = O_APPEND | O_WRONLY;25632564strbuf_git_path(logfile,"logs/%s", refname);2565if(force_create ||should_autocreate_reflog(refname)) {2566if(safe_create_leading_directories(logfile->buf) <0) {2567strbuf_addf(err,"unable to create directory for%s: "2568"%s", logfile->buf,strerror(errno));2569return-1;2570}2571 oflags |= O_CREAT;2572}25732574 logfd =open(logfile->buf, oflags,0666);2575if(logfd <0) {2576if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2577return0;25782579if(errno == EISDIR) {2580if(remove_empty_directories(logfile)) {2581strbuf_addf(err,"There are still logs under "2582"'%s'", logfile->buf);2583return-1;2584}2585 logfd =open(logfile->buf, oflags,0666);2586}25872588if(logfd <0) {2589strbuf_addf(err,"unable to append to%s:%s",2590 logfile->buf,strerror(errno));2591return-1;2592}2593}25942595adjust_shared_perm(logfile->buf);2596close(logfd);2597return0;2598}259926002601intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)2602{2603int ret;2604struct strbuf sb = STRBUF_INIT;26052606 ret =log_ref_setup(refname, &sb, err, force_create);2607strbuf_release(&sb);2608return ret;2609}26102611static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2612const unsigned char*new_sha1,2613const char*committer,const char*msg)2614{2615int msglen, written;2616unsigned maxlen, len;2617char*logrec;26182619 msglen = msg ?strlen(msg) :0;2620 maxlen =strlen(committer) + msglen +100;2621 logrec =xmalloc(maxlen);2622 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2623sha1_to_hex(old_sha1),2624sha1_to_hex(new_sha1),2625 committer);2626if(msglen)2627 len +=copy_reflog_msg(logrec + len -1, msg) -1;26282629 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2630free(logrec);2631if(written != len)2632return-1;26332634return0;2635}26362637static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,2638const unsigned char*new_sha1,const char*msg,2639struct strbuf *logfile,int flags,2640struct strbuf *err)2641{2642int logfd, result, oflags = O_APPEND | O_WRONLY;26432644if(log_all_ref_updates <0)2645 log_all_ref_updates = !is_bare_repository();26462647 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);26482649if(result)2650return result;26512652 logfd =open(logfile->buf, oflags);2653if(logfd <0)2654return0;2655 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2656git_committer_info(0), msg);2657if(result) {2658strbuf_addf(err,"unable to append to%s:%s", logfile->buf,2659strerror(errno));2660close(logfd);2661return-1;2662}2663if(close(logfd)) {2664strbuf_addf(err,"unable to append to%s:%s", logfile->buf,2665strerror(errno));2666return-1;2667}2668return0;2669}26702671static intlog_ref_write(const char*refname,const unsigned char*old_sha1,2672const unsigned char*new_sha1,const char*msg,2673int flags,struct strbuf *err)2674{2675returnfiles_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2676 err);2677}26782679intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2680const unsigned char*new_sha1,const char*msg,2681int flags,struct strbuf *err)2682{2683struct strbuf sb = STRBUF_INIT;2684int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2685 err);2686strbuf_release(&sb);2687return ret;2688}26892690/*2691 * Write sha1 into the open lockfile, then close the lockfile. On2692 * errors, rollback the lockfile, fill in *err and2693 * return -1.2694 */2695static intwrite_ref_to_lockfile(struct ref_lock *lock,2696const unsigned char*sha1,struct strbuf *err)2697{2698static char term ='\n';2699struct object *o;2700int fd;27012702 o =parse_object(sha1);2703if(!o) {2704strbuf_addf(err,2705"Trying to write ref%swith nonexistent object%s",2706 lock->ref_name,sha1_to_hex(sha1));2707unlock_ref(lock);2708return-1;2709}2710if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2711strbuf_addf(err,2712"Trying to write non-commit object%sto branch%s",2713sha1_to_hex(sha1), lock->ref_name);2714unlock_ref(lock);2715return-1;2716}2717 fd =get_lock_file_fd(lock->lk);2718if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2719write_in_full(fd, &term,1) !=1||2720close_ref(lock) <0) {2721strbuf_addf(err,2722"Couldn't write%s",get_lock_file_path(lock->lk));2723unlock_ref(lock);2724return-1;2725}2726return0;2727}27282729/*2730 * Commit a change to a loose reference that has already been written2731 * to the loose reference lockfile. Also update the reflogs if2732 * necessary, using the specified lockmsg (which can be NULL).2733 */2734static intcommit_ref_update(struct ref_lock *lock,2735const unsigned char*sha1,const char*logmsg,2736int flags,struct strbuf *err)2737{2738clear_loose_ref_cache(&ref_cache);2739if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0||2740(strcmp(lock->ref_name, lock->orig_ref_name) &&2741log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0)) {2742char*old_msg =strbuf_detach(err, NULL);2743strbuf_addf(err,"Cannot update the ref '%s':%s",2744 lock->ref_name, old_msg);2745free(old_msg);2746unlock_ref(lock);2747return-1;2748}2749if(strcmp(lock->orig_ref_name,"HEAD") !=0) {2750/*2751 * Special hack: If a branch is updated directly and HEAD2752 * points to it (may happen on the remote side of a push2753 * for example) then logically the HEAD reflog should be2754 * updated too.2755 * A generic solution implies reverse symref information,2756 * but finding all symrefs pointing to the given branch2757 * would be rather costly for this rare event (the direct2758 * update of a branch) to be worth it. So let's cheat and2759 * check with HEAD only which should cover 99% of all usage2760 * scenarios (even 100% of the default ones).2761 */2762unsigned char head_sha1[20];2763int head_flag;2764const char*head_ref;2765 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,2766 head_sha1, &head_flag);2767if(head_ref && (head_flag & REF_ISSYMREF) &&2768!strcmp(head_ref, lock->ref_name)) {2769struct strbuf log_err = STRBUF_INIT;2770if(log_ref_write("HEAD", lock->old_oid.hash, sha1,2771 logmsg,0, &log_err)) {2772error("%s", log_err.buf);2773strbuf_release(&log_err);2774}2775}2776}2777if(commit_ref(lock)) {2778error("Couldn't set%s", lock->ref_name);2779unlock_ref(lock);2780return-1;2781}27822783unlock_ref(lock);2784return0;2785}27862787static intcreate_ref_symlink(struct ref_lock *lock,const char*target)2788{2789int ret = -1;2790#ifndef NO_SYMLINK_HEAD2791char*ref_path =get_locked_file_path(lock->lk);2792unlink(ref_path);2793 ret =symlink(target, ref_path);2794free(ref_path);27952796if(ret)2797fprintf(stderr,"no symlink - falling back to symbolic ref\n");2798#endif2799return ret;2800}28012802static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,2803const char*target,const char*logmsg)2804{2805struct strbuf err = STRBUF_INIT;2806unsigned char new_sha1[20];2807if(logmsg && !read_ref(target, new_sha1) &&2808log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg,0, &err)) {2809error("%s", err.buf);2810strbuf_release(&err);2811}2812}28132814static intcreate_symref_locked(struct ref_lock *lock,const char*refname,2815const char*target,const char*logmsg)2816{2817if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {2818update_symref_reflog(lock, refname, target, logmsg);2819return0;2820}28212822if(!fdopen_lock_file(lock->lk,"w"))2823returnerror("unable to fdopen%s:%s",2824 lock->lk->tempfile.filename.buf,strerror(errno));28252826update_symref_reflog(lock, refname, target, logmsg);28272828/* no error check; commit_ref will check ferror */2829fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);2830if(commit_ref(lock) <0)2831returnerror("unable to write symref for%s:%s", refname,2832strerror(errno));2833return0;2834}28352836intcreate_symref(const char*refname,const char*target,const char*logmsg)2837{2838struct strbuf err = STRBUF_INIT;2839struct ref_lock *lock;2840int ret;28412842 lock =lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,2843&err);2844if(!lock) {2845error("%s", err.buf);2846strbuf_release(&err);2847return-1;2848}28492850 ret =create_symref_locked(lock, refname, target, logmsg);2851unlock_ref(lock);2852return ret;2853}28542855intreflog_exists(const char*refname)2856{2857struct stat st;28582859return!lstat(git_path("logs/%s", refname), &st) &&2860S_ISREG(st.st_mode);2861}28622863intdelete_reflog(const char*refname)2864{2865returnremove_path(git_path("logs/%s", refname));2866}28672868static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)2869{2870unsigned char osha1[20], nsha1[20];2871char*email_end, *message;2872unsigned long timestamp;2873int tz;28742875/* old SP new SP name <email> SP time TAB msg LF */2876if(sb->len <83|| sb->buf[sb->len -1] !='\n'||2877get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||2878get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||2879!(email_end =strchr(sb->buf +82,'>')) ||2880 email_end[1] !=' '||2881!(timestamp =strtoul(email_end +2, &message,10)) ||2882!message || message[0] !=' '||2883(message[1] !='+'&& message[1] !='-') ||2884!isdigit(message[2]) || !isdigit(message[3]) ||2885!isdigit(message[4]) || !isdigit(message[5]))2886return0;/* corrupt? */2887 email_end[1] ='\0';2888 tz =strtol(message +1, NULL,10);2889if(message[6] !='\t')2890 message +=6;2891else2892 message +=7;2893returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);2894}28952896static char*find_beginning_of_line(char*bob,char*scan)2897{2898while(bob < scan && *(--scan) !='\n')2899;/* keep scanning backwards */2900/*2901 * Return either beginning of the buffer, or LF at the end of2902 * the previous line.2903 */2904return scan;2905}29062907intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)2908{2909struct strbuf sb = STRBUF_INIT;2910FILE*logfp;2911long pos;2912int ret =0, at_tail =1;29132914 logfp =fopen(git_path("logs/%s", refname),"r");2915if(!logfp)2916return-1;29172918/* Jump to the end */2919if(fseek(logfp,0, SEEK_END) <0)2920returnerror("cannot seek back reflog for%s:%s",2921 refname,strerror(errno));2922 pos =ftell(logfp);2923while(!ret &&0< pos) {2924int cnt;2925size_t nread;2926char buf[BUFSIZ];2927char*endp, *scanp;29282929/* Fill next block from the end */2930 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;2931if(fseek(logfp, pos - cnt, SEEK_SET))2932returnerror("cannot seek back reflog for%s:%s",2933 refname,strerror(errno));2934 nread =fread(buf, cnt,1, logfp);2935if(nread !=1)2936returnerror("cannot read%dbytes from reflog for%s:%s",2937 cnt, refname,strerror(errno));2938 pos -= cnt;29392940 scanp = endp = buf + cnt;2941if(at_tail && scanp[-1] =='\n')2942/* Looking at the final LF at the end of the file */2943 scanp--;2944 at_tail =0;29452946while(buf < scanp) {2947/*2948 * terminating LF of the previous line, or the beginning2949 * of the buffer.2950 */2951char*bp;29522953 bp =find_beginning_of_line(buf, scanp);29542955if(*bp =='\n') {2956/*2957 * The newline is the end of the previous line,2958 * so we know we have complete line starting2959 * at (bp + 1). Prefix it onto any prior data2960 * we collected for the line and process it.2961 */2962strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));2963 scanp = bp;2964 endp = bp +1;2965 ret =show_one_reflog_ent(&sb, fn, cb_data);2966strbuf_reset(&sb);2967if(ret)2968break;2969}else if(!pos) {2970/*2971 * We are at the start of the buffer, and the2972 * start of the file; there is no previous2973 * line, and we have everything for this one.2974 * Process it, and we can end the loop.2975 */2976strbuf_splice(&sb,0,0, buf, endp - buf);2977 ret =show_one_reflog_ent(&sb, fn, cb_data);2978strbuf_reset(&sb);2979break;2980}29812982if(bp == buf) {2983/*2984 * We are at the start of the buffer, and there2985 * is more file to read backwards. Which means2986 * we are in the middle of a line. Note that we2987 * may get here even if *bp was a newline; that2988 * just means we are at the exact end of the2989 * previous line, rather than some spot in the2990 * middle.2991 *2992 * Save away what we have to be combined with2993 * the data from the next read.2994 */2995strbuf_splice(&sb,0,0, buf, endp - buf);2996break;2997}2998}29993000}3001if(!ret && sb.len)3002die("BUG: reverse reflog parser had leftover data");30033004fclose(logfp);3005strbuf_release(&sb);3006return ret;3007}30083009intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3010{3011FILE*logfp;3012struct strbuf sb = STRBUF_INIT;3013int ret =0;30143015 logfp =fopen(git_path("logs/%s", refname),"r");3016if(!logfp)3017return-1;30183019while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3020 ret =show_one_reflog_ent(&sb, fn, cb_data);3021fclose(logfp);3022strbuf_release(&sb);3023return ret;3024}3025/*3026 * Call fn for each reflog in the namespace indicated by name. name3027 * must be empty or end with '/'. Name will be used as a scratch3028 * space, but its contents will be restored before return.3029 */3030static intdo_for_each_reflog(struct strbuf *name, each_ref_fn fn,void*cb_data)3031{3032DIR*d =opendir(git_path("logs/%s", name->buf));3033int retval =0;3034struct dirent *de;3035int oldlen = name->len;30363037if(!d)3038return name->len ? errno :0;30393040while((de =readdir(d)) != NULL) {3041struct stat st;30423043if(de->d_name[0] =='.')3044continue;3045if(ends_with(de->d_name,".lock"))3046continue;3047strbuf_addstr(name, de->d_name);3048if(stat(git_path("logs/%s", name->buf), &st) <0) {3049;/* silently ignore */3050}else{3051if(S_ISDIR(st.st_mode)) {3052strbuf_addch(name,'/');3053 retval =do_for_each_reflog(name, fn, cb_data);3054}else{3055struct object_id oid;30563057if(read_ref_full(name->buf,0, oid.hash, NULL))3058 retval =error("bad ref for%s", name->buf);3059else3060 retval =fn(name->buf, &oid,0, cb_data);3061}3062if(retval)3063break;3064}3065strbuf_setlen(name, oldlen);3066}3067closedir(d);3068return retval;3069}30703071intfor_each_reflog(each_ref_fn fn,void*cb_data)3072{3073int retval;3074struct strbuf name;3075strbuf_init(&name, PATH_MAX);3076 retval =do_for_each_reflog(&name, fn, cb_data);3077strbuf_release(&name);3078return retval;3079}30803081static intref_update_reject_duplicates(struct string_list *refnames,3082struct strbuf *err)3083{3084int i, n = refnames->nr;30853086assert(err);30873088for(i =1; i < n; i++)3089if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3090strbuf_addf(err,3091"Multiple updates for ref '%s' not allowed.",3092 refnames->items[i].string);3093return1;3094}3095return0;3096}30973098intref_transaction_commit(struct ref_transaction *transaction,3099struct strbuf *err)3100{3101int ret =0, i;3102int n = transaction->nr;3103struct ref_update **updates = transaction->updates;3104struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3105struct string_list_item *ref_to_delete;3106struct string_list affected_refnames = STRING_LIST_INIT_NODUP;31073108assert(err);31093110if(transaction->state != REF_TRANSACTION_OPEN)3111die("BUG: commit called for transaction that is not open");31123113if(!n) {3114 transaction->state = REF_TRANSACTION_CLOSED;3115return0;3116}31173118/* Fail if a refname appears more than once in the transaction: */3119for(i =0; i < n; i++)3120string_list_append(&affected_refnames, updates[i]->refname);3121string_list_sort(&affected_refnames);3122if(ref_update_reject_duplicates(&affected_refnames, err)) {3123 ret = TRANSACTION_GENERIC_ERROR;3124goto cleanup;3125}31263127/*3128 * Acquire all locks, verify old values if provided, check3129 * that new values are valid, and write new values to the3130 * lockfiles, ready to be activated. Only keep one lockfile3131 * open at a time to avoid running out of file descriptors.3132 */3133for(i =0; i < n; i++) {3134struct ref_update *update = updates[i];31353136if((update->flags & REF_HAVE_NEW) &&3137is_null_sha1(update->new_sha1))3138 update->flags |= REF_DELETING;3139 update->lock =lock_ref_sha1_basic(3140 update->refname,3141((update->flags & REF_HAVE_OLD) ?3142 update->old_sha1 : NULL),3143&affected_refnames, NULL,3144 update->flags,3145&update->type,3146 err);3147if(!update->lock) {3148char*reason;31493150 ret = (errno == ENOTDIR)3151? TRANSACTION_NAME_CONFLICT3152: TRANSACTION_GENERIC_ERROR;3153 reason =strbuf_detach(err, NULL);3154strbuf_addf(err,"cannot lock ref '%s':%s",3155 update->refname, reason);3156free(reason);3157goto cleanup;3158}3159if((update->flags & REF_HAVE_NEW) &&3160!(update->flags & REF_DELETING)) {3161int overwriting_symref = ((update->type & REF_ISSYMREF) &&3162(update->flags & REF_NODEREF));31633164if(!overwriting_symref &&3165!hashcmp(update->lock->old_oid.hash, update->new_sha1)) {3166/*3167 * The reference already has the desired3168 * value, so we don't need to write it.3169 */3170}else if(write_ref_to_lockfile(update->lock,3171 update->new_sha1,3172 err)) {3173char*write_err =strbuf_detach(err, NULL);31743175/*3176 * The lock was freed upon failure of3177 * write_ref_to_lockfile():3178 */3179 update->lock = NULL;3180strbuf_addf(err,3181"cannot update the ref '%s':%s",3182 update->refname, write_err);3183free(write_err);3184 ret = TRANSACTION_GENERIC_ERROR;3185goto cleanup;3186}else{3187 update->flags |= REF_NEEDS_COMMIT;3188}3189}3190if(!(update->flags & REF_NEEDS_COMMIT)) {3191/*3192 * We didn't have to write anything to the lockfile.3193 * Close it to free up the file descriptor:3194 */3195if(close_ref(update->lock)) {3196strbuf_addf(err,"Couldn't close%s.lock",3197 update->refname);3198goto cleanup;3199}3200}3201}32023203/* Perform updates first so live commits remain referenced */3204for(i =0; i < n; i++) {3205struct ref_update *update = updates[i];32063207if(update->flags & REF_NEEDS_COMMIT) {3208if(commit_ref_update(update->lock,3209 update->new_sha1, update->msg,3210 update->flags, err)) {3211/* freed by commit_ref_update(): */3212 update->lock = NULL;3213 ret = TRANSACTION_GENERIC_ERROR;3214goto cleanup;3215}else{3216/* freed by commit_ref_update(): */3217 update->lock = NULL;3218}3219}3220}32213222/* Perform deletes now that updates are safely completed */3223for(i =0; i < n; i++) {3224struct ref_update *update = updates[i];32253226if(update->flags & REF_DELETING) {3227if(delete_ref_loose(update->lock, update->type, err)) {3228 ret = TRANSACTION_GENERIC_ERROR;3229goto cleanup;3230}32313232if(!(update->flags & REF_ISPRUNING))3233string_list_append(&refs_to_delete,3234 update->lock->ref_name);3235}3236}32373238if(repack_without_refs(&refs_to_delete, err)) {3239 ret = TRANSACTION_GENERIC_ERROR;3240goto cleanup;3241}3242for_each_string_list_item(ref_to_delete, &refs_to_delete)3243unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3244clear_loose_ref_cache(&ref_cache);32453246cleanup:3247 transaction->state = REF_TRANSACTION_CLOSED;32483249for(i =0; i < n; i++)3250if(updates[i]->lock)3251unlock_ref(updates[i]->lock);3252string_list_clear(&refs_to_delete,0);3253string_list_clear(&affected_refnames,0);3254return ret;3255}32563257static intref_present(const char*refname,3258const struct object_id *oid,int flags,void*cb_data)3259{3260struct string_list *affected_refnames = cb_data;32613262returnstring_list_has_string(affected_refnames, refname);3263}32643265intinitial_ref_transaction_commit(struct ref_transaction *transaction,3266struct strbuf *err)3267{3268int ret =0, i;3269int n = transaction->nr;3270struct ref_update **updates = transaction->updates;3271struct string_list affected_refnames = STRING_LIST_INIT_NODUP;32723273assert(err);32743275if(transaction->state != REF_TRANSACTION_OPEN)3276die("BUG: commit called for transaction that is not open");32773278/* Fail if a refname appears more than once in the transaction: */3279for(i =0; i < n; i++)3280string_list_append(&affected_refnames, updates[i]->refname);3281string_list_sort(&affected_refnames);3282if(ref_update_reject_duplicates(&affected_refnames, err)) {3283 ret = TRANSACTION_GENERIC_ERROR;3284goto cleanup;3285}32863287/*3288 * It's really undefined to call this function in an active3289 * repository or when there are existing references: we are3290 * only locking and changing packed-refs, so (1) any3291 * simultaneous processes might try to change a reference at3292 * the same time we do, and (2) any existing loose versions of3293 * the references that we are setting would have precedence3294 * over our values. But some remote helpers create the remote3295 * "HEAD" and "master" branches before calling this function,3296 * so here we really only check that none of the references3297 * that we are creating already exists.3298 */3299if(for_each_rawref(ref_present, &affected_refnames))3300die("BUG: initial ref transaction called with existing refs");33013302for(i =0; i < n; i++) {3303struct ref_update *update = updates[i];33043305if((update->flags & REF_HAVE_OLD) &&3306!is_null_sha1(update->old_sha1))3307die("BUG: initial ref transaction with old_sha1 set");3308if(verify_refname_available(update->refname,3309&affected_refnames, NULL,3310 err)) {3311 ret = TRANSACTION_NAME_CONFLICT;3312goto cleanup;3313}3314}33153316if(lock_packed_refs(0)) {3317strbuf_addf(err,"unable to lock packed-refs file:%s",3318strerror(errno));3319 ret = TRANSACTION_GENERIC_ERROR;3320goto cleanup;3321}33223323for(i =0; i < n; i++) {3324struct ref_update *update = updates[i];33253326if((update->flags & REF_HAVE_NEW) &&3327!is_null_sha1(update->new_sha1))3328add_packed_ref(update->refname, update->new_sha1);3329}33303331if(commit_packed_refs()) {3332strbuf_addf(err,"unable to commit packed-refs file:%s",3333strerror(errno));3334 ret = TRANSACTION_GENERIC_ERROR;3335goto cleanup;3336}33373338cleanup:3339 transaction->state = REF_TRANSACTION_CLOSED;3340string_list_clear(&affected_refnames,0);3341return ret;3342}33433344struct expire_reflog_cb {3345unsigned int flags;3346 reflog_expiry_should_prune_fn *should_prune_fn;3347void*policy_cb;3348FILE*newlog;3349unsigned char last_kept_sha1[20];3350};33513352static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3353const char*email,unsigned long timestamp,int tz,3354const char*message,void*cb_data)3355{3356struct expire_reflog_cb *cb = cb_data;3357struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;33583359if(cb->flags & EXPIRE_REFLOGS_REWRITE)3360 osha1 = cb->last_kept_sha1;33613362if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3363 message, policy_cb)) {3364if(!cb->newlog)3365printf("would prune%s", message);3366else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3367printf("prune%s", message);3368}else{3369if(cb->newlog) {3370fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3371sha1_to_hex(osha1),sha1_to_hex(nsha1),3372 email, timestamp, tz, message);3373hashcpy(cb->last_kept_sha1, nsha1);3374}3375if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3376printf("keep%s", message);3377}3378return0;3379}33803381intreflog_expire(const char*refname,const unsigned char*sha1,3382unsigned int flags,3383 reflog_expiry_prepare_fn prepare_fn,3384 reflog_expiry_should_prune_fn should_prune_fn,3385 reflog_expiry_cleanup_fn cleanup_fn,3386void*policy_cb_data)3387{3388static struct lock_file reflog_lock;3389struct expire_reflog_cb cb;3390struct ref_lock *lock;3391char*log_file;3392int status =0;3393int type;3394struct strbuf err = STRBUF_INIT;33953396memset(&cb,0,sizeof(cb));3397 cb.flags = flags;3398 cb.policy_cb = policy_cb_data;3399 cb.should_prune_fn = should_prune_fn;34003401/*3402 * The reflog file is locked by holding the lock on the3403 * reference itself, plus we might need to update the3404 * reference if --updateref was specified:3405 */3406 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL,0, &type, &err);3407if(!lock) {3408error("cannot lock ref '%s':%s", refname, err.buf);3409strbuf_release(&err);3410return-1;3411}3412if(!reflog_exists(refname)) {3413unlock_ref(lock);3414return0;3415}34163417 log_file =git_pathdup("logs/%s", refname);3418if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3419/*3420 * Even though holding $GIT_DIR/logs/$reflog.lock has3421 * no locking implications, we use the lock_file3422 * machinery here anyway because it does a lot of the3423 * work we need, including cleaning up if the program3424 * exits unexpectedly.3425 */3426if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {3427struct strbuf err = STRBUF_INIT;3428unable_to_lock_message(log_file, errno, &err);3429error("%s", err.buf);3430strbuf_release(&err);3431goto failure;3432}3433 cb.newlog =fdopen_lock_file(&reflog_lock,"w");3434if(!cb.newlog) {3435error("cannot fdopen%s(%s)",3436get_lock_file_path(&reflog_lock),strerror(errno));3437goto failure;3438}3439}34403441(*prepare_fn)(refname, sha1, cb.policy_cb);3442for_each_reflog_ent(refname, expire_reflog_ent, &cb);3443(*cleanup_fn)(cb.policy_cb);34443445if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3446/*3447 * It doesn't make sense to adjust a reference pointed3448 * to by a symbolic ref based on expiring entries in3449 * the symbolic reference's reflog. Nor can we update3450 * a reference if there are no remaining reflog3451 * entries.3452 */3453int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&3454!(type & REF_ISSYMREF) &&3455!is_null_sha1(cb.last_kept_sha1);34563457if(close_lock_file(&reflog_lock)) {3458 status |=error("couldn't write%s:%s", log_file,3459strerror(errno));3460}else if(update &&3461(write_in_full(get_lock_file_fd(lock->lk),3462sha1_to_hex(cb.last_kept_sha1),40) !=40||3463write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||3464close_ref(lock) <0)) {3465 status |=error("couldn't write%s",3466get_lock_file_path(lock->lk));3467rollback_lock_file(&reflog_lock);3468}else if(commit_lock_file(&reflog_lock)) {3469 status |=error("unable to write reflog '%s' (%s)",3470 log_file,strerror(errno));3471}else if(update &&commit_ref(lock)) {3472 status |=error("couldn't set%s", lock->ref_name);3473}3474}3475free(log_file);3476unlock_ref(lock);3477return status;34783479 failure:3480rollback_lock_file(&reflog_lock);3481free(log_file);3482unlock_ref(lock);3483return-1;3484}