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/* This function needs to return a meaningful errno on failure */1394static const char*resolve_ref_1(const char*refname,1395int resolve_flags,1396unsigned char*sha1,1397int*flags,1398struct strbuf *sb_refname,1399struct strbuf *sb_path,1400struct strbuf *sb_contents)1401{1402int bad_name =0;1403int symref_count;14041405*flags =0;14061407if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1408*flags |= REF_BAD_NAME;14091410if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1411!refname_is_safe(refname)) {1412 errno = EINVAL;1413return NULL;1414}1415/*1416 * dwim_ref() uses REF_ISBROKEN to distinguish between1417 * missing refs and refs that were present but invalid,1418 * to complain about the latter to stderr.1419 *1420 * We don't know whether the ref exists, so don't set1421 * REF_ISBROKEN yet.1422 */1423 bad_name =1;1424}14251426for(symref_count =0; symref_count < MAXDEPTH; symref_count++) {1427const char*path;1428struct stat st;1429int fd;14301431strbuf_reset(sb_path);1432strbuf_git_path(sb_path,"%s", refname);1433 path = sb_path->buf;14341435/*1436 * We might have to loop back here to avoid a race1437 * condition: first we lstat() the file, then we try1438 * to read it as a link or as a file. But if somebody1439 * changes the type of the file (file <-> directory1440 * <-> symlink) between the lstat() and reading, then1441 * we don't want to report that as an error but rather1442 * try again starting with the lstat().1443 */1444 stat_ref:1445if(lstat(path, &st) <0) {1446if(errno != ENOENT)1447return NULL;1448if(resolve_missing_loose_ref(refname, sha1, flags)) {1449if(resolve_flags & RESOLVE_REF_READING) {1450 errno = ENOENT;1451return NULL;1452}1453hashclr(sha1);1454}1455if(bad_name) {1456hashclr(sha1);1457*flags |= REF_ISBROKEN;1458}1459return refname;1460}14611462/* Follow "normalized" - ie "refs/.." symlinks by hand */1463if(S_ISLNK(st.st_mode)) {1464strbuf_reset(sb_contents);1465if(strbuf_readlink(sb_contents, path,0) <0) {1466if(errno == ENOENT || errno == EINVAL)1467/* inconsistent with lstat; retry */1468goto stat_ref;1469else1470return NULL;1471}1472if(starts_with(sb_contents->buf,"refs/") &&1473!check_refname_format(sb_contents->buf,0)) {1474strbuf_swap(sb_refname, sb_contents);1475 refname = sb_refname->buf;1476*flags |= REF_ISSYMREF;1477if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1478hashclr(sha1);1479return refname;1480}1481continue;1482}1483}14841485/* Is it a directory? */1486if(S_ISDIR(st.st_mode)) {1487 errno = EISDIR;1488return NULL;1489}14901491/*1492 * Anything else, just open it and try to use it as1493 * a ref1494 */1495 fd =open(path, O_RDONLY);1496if(fd <0) {1497if(errno == ENOENT)1498/* inconsistent with lstat; retry */1499goto stat_ref;1500else1501return NULL;1502}1503strbuf_reset(sb_contents);1504if(strbuf_read(sb_contents, fd,256) <0) {1505int save_errno = errno;1506close(fd);1507 errno = save_errno;1508return NULL;1509}1510close(fd);1511strbuf_rtrim(sb_contents);15121513/*1514 * Is it a symbolic ref?1515 */1516if(!starts_with(sb_contents->buf,"ref:")) {1517/*1518 * Please note that FETCH_HEAD has a second1519 * line containing other data.1520 */1521if(get_sha1_hex(sb_contents->buf, sha1) ||1522(sb_contents->buf[40] !='\0'&& !isspace(sb_contents->buf[40]))) {1523*flags |= REF_ISBROKEN;1524 errno = EINVAL;1525return NULL;1526}1527if(bad_name) {1528hashclr(sha1);1529*flags |= REF_ISBROKEN;1530}1531return refname;1532}1533*flags |= REF_ISSYMREF;1534 refname = sb_contents->buf +4;1535while(isspace(*refname))1536 refname++;1537strbuf_reset(sb_refname);1538strbuf_addstr(sb_refname, refname);1539 refname = sb_refname->buf;1540if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1541hashclr(sha1);1542return refname;1543}1544if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1545*flags |= REF_ISBROKEN;15461547if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1548!refname_is_safe(refname)) {1549 errno = EINVAL;1550return NULL;1551}1552 bad_name =1;1553}1554}15551556 errno = ELOOP;1557return NULL;1558}15591560const char*resolve_ref_unsafe(const char*refname,int resolve_flags,1561unsigned char*sha1,int*flags)1562{1563static struct strbuf sb_refname = STRBUF_INIT;1564struct strbuf sb_contents = STRBUF_INIT;1565struct strbuf sb_path = STRBUF_INIT;1566int unused_flags;1567const char*ret;15681569if(!flags)1570 flags = &unused_flags;15711572 ret =resolve_ref_1(refname, resolve_flags, sha1, flags,1573&sb_refname, &sb_path, &sb_contents);1574strbuf_release(&sb_path);1575strbuf_release(&sb_contents);1576return ret;1577}15781579/*1580 * Peel the entry (if possible) and return its new peel_status. If1581 * repeel is true, re-peel the entry even if there is an old peeled1582 * value that is already stored in it.1583 *1584 * It is OK to call this function with a packed reference entry that1585 * might be stale and might even refer to an object that has since1586 * been garbage-collected. In such a case, if the entry has1587 * REF_KNOWS_PEELED then leave the status unchanged and return1588 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1589 */1590static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1591{1592enum peel_status status;15931594if(entry->flag & REF_KNOWS_PEELED) {1595if(repeel) {1596 entry->flag &= ~REF_KNOWS_PEELED;1597oidclr(&entry->u.value.peeled);1598}else{1599returnis_null_oid(&entry->u.value.peeled) ?1600 PEEL_NON_TAG : PEEL_PEELED;1601}1602}1603if(entry->flag & REF_ISBROKEN)1604return PEEL_BROKEN;1605if(entry->flag & REF_ISSYMREF)1606return PEEL_IS_SYMREF;16071608 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1609if(status == PEEL_PEELED || status == PEEL_NON_TAG)1610 entry->flag |= REF_KNOWS_PEELED;1611return status;1612}16131614intpeel_ref(const char*refname,unsigned char*sha1)1615{1616int flag;1617unsigned char base[20];16181619if(current_ref && (current_ref->name == refname1620|| !strcmp(current_ref->name, refname))) {1621if(peel_entry(current_ref,0))1622return-1;1623hashcpy(sha1, current_ref->u.value.peeled.hash);1624return0;1625}16261627if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1628return-1;16291630/*1631 * If the reference is packed, read its ref_entry from the1632 * cache in the hope that we already know its peeled value.1633 * We only try this optimization on packed references because1634 * (a) forcing the filling of the loose reference cache could1635 * be expensive and (b) loose references anyway usually do not1636 * have REF_KNOWS_PEELED.1637 */1638if(flag & REF_ISPACKED) {1639struct ref_entry *r =get_packed_ref(refname);1640if(r) {1641if(peel_entry(r,0))1642return-1;1643hashcpy(sha1, r->u.value.peeled.hash);1644return0;1645}1646}16471648returnpeel_object(base, sha1);1649}16501651/*1652 * Call fn for each reference in the specified ref_cache, omitting1653 * references not in the containing_dir of base. fn is called for all1654 * references, including broken ones. If fn ever returns a non-zero1655 * value, stop the iteration and return that value; otherwise, return1656 * 0.1657 */1658static intdo_for_each_entry(struct ref_cache *refs,const char*base,1659 each_ref_entry_fn fn,void*cb_data)1660{1661struct packed_ref_cache *packed_ref_cache;1662struct ref_dir *loose_dir;1663struct ref_dir *packed_dir;1664int retval =0;16651666/*1667 * We must make sure that all loose refs are read before accessing the1668 * packed-refs file; this avoids a race condition in which loose refs1669 * are migrated to the packed-refs file by a simultaneous process, but1670 * our in-memory view is from before the migration. get_packed_ref_cache()1671 * takes care of making sure our view is up to date with what is on1672 * disk.1673 */1674 loose_dir =get_loose_refs(refs);1675if(base && *base) {1676 loose_dir =find_containing_dir(loose_dir, base,0);1677}1678if(loose_dir)1679prime_ref_dir(loose_dir);16801681 packed_ref_cache =get_packed_ref_cache(refs);1682acquire_packed_ref_cache(packed_ref_cache);1683 packed_dir =get_packed_ref_dir(packed_ref_cache);1684if(base && *base) {1685 packed_dir =find_containing_dir(packed_dir, base,0);1686}16871688if(packed_dir && loose_dir) {1689sort_ref_dir(packed_dir);1690sort_ref_dir(loose_dir);1691 retval =do_for_each_entry_in_dirs(1692 packed_dir, loose_dir, fn, cb_data);1693}else if(packed_dir) {1694sort_ref_dir(packed_dir);1695 retval =do_for_each_entry_in_dir(1696 packed_dir,0, fn, cb_data);1697}else if(loose_dir) {1698sort_ref_dir(loose_dir);1699 retval =do_for_each_entry_in_dir(1700 loose_dir,0, fn, cb_data);1701}17021703release_packed_ref_cache(packed_ref_cache);1704return retval;1705}17061707/*1708 * Call fn for each reference in the specified ref_cache for which the1709 * refname begins with base. If trim is non-zero, then trim that many1710 * characters off the beginning of each refname before passing the1711 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include1712 * broken references in the iteration. If fn ever returns a non-zero1713 * value, stop the iteration and return that value; otherwise, return1714 * 0.1715 */1716intdo_for_each_ref(const char*submodule,const char*base,1717 each_ref_fn fn,int trim,int flags,void*cb_data)1718{1719struct ref_entry_cb data;1720struct ref_cache *refs;17211722 refs =get_ref_cache(submodule);1723 data.base = base;1724 data.trim = trim;1725 data.flags = flags;1726 data.fn = fn;1727 data.cb_data = cb_data;17281729if(ref_paranoia <0)1730 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1731if(ref_paranoia)1732 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;17331734returndo_for_each_entry(refs, base, do_one_ref, &data);1735}17361737static voidunlock_ref(struct ref_lock *lock)1738{1739/* Do not free lock->lk -- atexit() still looks at them */1740if(lock->lk)1741rollback_lock_file(lock->lk);1742free(lock->ref_name);1743free(lock->orig_ref_name);1744free(lock);1745}17461747/*1748 * Verify that the reference locked by lock has the value old_sha1.1749 * Fail if the reference doesn't exist and mustexist is set. Return 01750 * on success. On error, write an error message to err, set errno, and1751 * return a negative value.1752 */1753static intverify_lock(struct ref_lock *lock,1754const unsigned char*old_sha1,int mustexist,1755struct strbuf *err)1756{1757assert(err);17581759if(read_ref_full(lock->ref_name,1760 mustexist ? RESOLVE_REF_READING :0,1761 lock->old_oid.hash, NULL)) {1762if(old_sha1) {1763int save_errno = errno;1764strbuf_addf(err,"can't verify ref%s", lock->ref_name);1765 errno = save_errno;1766return-1;1767}else{1768hashclr(lock->old_oid.hash);1769return0;1770}1771}1772if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {1773strbuf_addf(err,"ref%sis at%sbut expected%s",1774 lock->ref_name,1775sha1_to_hex(lock->old_oid.hash),1776sha1_to_hex(old_sha1));1777 errno = EBUSY;1778return-1;1779}1780return0;1781}17821783static intremove_empty_directories(struct strbuf *path)1784{1785/*1786 * we want to create a file but there is a directory there;1787 * if that is an empty directory (or a directory that contains1788 * only empty directories), remove them.1789 */1790returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);1791}17921793/*1794 * Locks a ref returning the lock on success and NULL on failure.1795 * On failure errno is set to something meaningful.1796 */1797static struct ref_lock *lock_ref_sha1_basic(const char*refname,1798const unsigned char*old_sha1,1799const struct string_list *extras,1800const struct string_list *skip,1801unsigned int flags,int*type_p,1802struct strbuf *err)1803{1804struct strbuf ref_file = STRBUF_INIT;1805struct strbuf orig_ref_file = STRBUF_INIT;1806const char*orig_refname = refname;1807struct ref_lock *lock;1808int last_errno =0;1809int type;1810int lflags =0;1811int mustexist = (old_sha1 && !is_null_sha1(old_sha1));1812int resolve_flags =0;1813int attempts_remaining =3;18141815assert(err);18161817 lock =xcalloc(1,sizeof(struct ref_lock));18181819if(mustexist)1820 resolve_flags |= RESOLVE_REF_READING;1821if(flags & REF_DELETING)1822 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;1823if(flags & REF_NODEREF) {1824 resolve_flags |= RESOLVE_REF_NO_RECURSE;1825 lflags |= LOCK_NO_DEREF;1826}18271828 refname =resolve_ref_unsafe(refname, resolve_flags,1829 lock->old_oid.hash, &type);1830if(!refname && errno == EISDIR) {1831/*1832 * we are trying to lock foo but we used to1833 * have foo/bar which now does not exist;1834 * it is normal for the empty directory 'foo'1835 * to remain.1836 */1837strbuf_git_path(&orig_ref_file,"%s", orig_refname);1838if(remove_empty_directories(&orig_ref_file)) {1839 last_errno = errno;1840if(!verify_refname_available_dir(orig_refname, extras, skip,1841get_loose_refs(&ref_cache), err))1842strbuf_addf(err,"there are still refs under '%s'",1843 orig_refname);1844goto error_return;1845}1846 refname =resolve_ref_unsafe(orig_refname, resolve_flags,1847 lock->old_oid.hash, &type);1848}1849if(type_p)1850*type_p = type;1851if(!refname) {1852 last_errno = errno;1853if(last_errno != ENOTDIR ||1854!verify_refname_available_dir(orig_refname, extras, skip,1855get_loose_refs(&ref_cache), err))1856strbuf_addf(err,"unable to resolve reference%s:%s",1857 orig_refname,strerror(last_errno));18581859goto error_return;1860}18611862if(flags & REF_NODEREF)1863 refname = orig_refname;18641865/*1866 * If the ref did not exist and we are creating it, make sure1867 * there is no existing packed ref whose name begins with our1868 * refname, nor a packed ref whose name is a proper prefix of1869 * our refname.1870 */1871if(is_null_oid(&lock->old_oid) &&1872verify_refname_available_dir(refname, extras, skip,1873get_packed_refs(&ref_cache), err)) {1874 last_errno = ENOTDIR;1875goto error_return;1876}18771878 lock->lk =xcalloc(1,sizeof(struct lock_file));18791880 lock->ref_name =xstrdup(refname);1881 lock->orig_ref_name =xstrdup(orig_refname);1882strbuf_git_path(&ref_file,"%s", refname);18831884 retry:1885switch(safe_create_leading_directories_const(ref_file.buf)) {1886case SCLD_OK:1887break;/* success */1888case SCLD_VANISHED:1889if(--attempts_remaining >0)1890goto retry;1891/* fall through */1892default:1893 last_errno = errno;1894strbuf_addf(err,"unable to create directory for%s",1895 ref_file.buf);1896goto error_return;1897}18981899if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {1900 last_errno = errno;1901if(errno == ENOENT && --attempts_remaining >0)1902/*1903 * Maybe somebody just deleted one of the1904 * directories leading to ref_file. Try1905 * again:1906 */1907goto retry;1908else{1909unable_to_lock_message(ref_file.buf, errno, err);1910goto error_return;1911}1912}1913if(verify_lock(lock, old_sha1, mustexist, err)) {1914 last_errno = errno;1915goto error_return;1916}1917goto out;19181919 error_return:1920unlock_ref(lock);1921 lock = NULL;19221923 out:1924strbuf_release(&ref_file);1925strbuf_release(&orig_ref_file);1926 errno = last_errno;1927return lock;1928}19291930/*1931 * Write an entry to the packed-refs file for the specified refname.1932 * If peeled is non-NULL, write it as the entry's peeled value.1933 */1934static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,1935unsigned char*peeled)1936{1937fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);1938if(peeled)1939fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));1940}19411942/*1943 * An each_ref_entry_fn that writes the entry to a packed-refs file.1944 */1945static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)1946{1947enum peel_status peel_status =peel_entry(entry,0);19481949if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)1950error("internal error:%sis not a valid packed reference!",1951 entry->name);1952write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,1953 peel_status == PEEL_PEELED ?1954 entry->u.value.peeled.hash : NULL);1955return0;1956}19571958/*1959 * Lock the packed-refs file for writing. Flags is passed to1960 * hold_lock_file_for_update(). Return 0 on success. On errors, set1961 * errno appropriately and return a nonzero value.1962 */1963static intlock_packed_refs(int flags)1964{1965static int timeout_configured =0;1966static int timeout_value =1000;19671968struct packed_ref_cache *packed_ref_cache;19691970if(!timeout_configured) {1971git_config_get_int("core.packedrefstimeout", &timeout_value);1972 timeout_configured =1;1973}19741975if(hold_lock_file_for_update_timeout(1976&packlock,git_path("packed-refs"),1977 flags, timeout_value) <0)1978return-1;1979/*1980 * Get the current packed-refs while holding the lock. If the1981 * packed-refs file has been modified since we last read it,1982 * this will automatically invalidate the cache and re-read1983 * the packed-refs file.1984 */1985 packed_ref_cache =get_packed_ref_cache(&ref_cache);1986 packed_ref_cache->lock = &packlock;1987/* Increment the reference count to prevent it from being freed: */1988acquire_packed_ref_cache(packed_ref_cache);1989return0;1990}19911992/*1993 * Write the current version of the packed refs cache from memory to1994 * disk. The packed-refs file must already be locked for writing (see1995 * lock_packed_refs()). Return zero on success. On errors, set errno1996 * and return a nonzero value1997 */1998static intcommit_packed_refs(void)1999{2000struct packed_ref_cache *packed_ref_cache =2001get_packed_ref_cache(&ref_cache);2002int error =0;2003int save_errno =0;2004FILE*out;20052006if(!packed_ref_cache->lock)2007die("internal error: packed-refs not locked");20082009 out =fdopen_lock_file(packed_ref_cache->lock,"w");2010if(!out)2011die_errno("unable to fdopen packed-refs descriptor");20122013fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2014do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),20150, write_packed_entry_fn, out);20162017if(commit_lock_file(packed_ref_cache->lock)) {2018 save_errno = errno;2019 error = -1;2020}2021 packed_ref_cache->lock = NULL;2022release_packed_ref_cache(packed_ref_cache);2023 errno = save_errno;2024return error;2025}20262027/*2028 * Rollback the lockfile for the packed-refs file, and discard the2029 * in-memory packed reference cache. (The packed-refs file will be2030 * read anew if it is needed again after this function is called.)2031 */2032static voidrollback_packed_refs(void)2033{2034struct packed_ref_cache *packed_ref_cache =2035get_packed_ref_cache(&ref_cache);20362037if(!packed_ref_cache->lock)2038die("internal error: packed-refs not locked");2039rollback_lock_file(packed_ref_cache->lock);2040 packed_ref_cache->lock = NULL;2041release_packed_ref_cache(packed_ref_cache);2042clear_packed_ref_cache(&ref_cache);2043}20442045struct ref_to_prune {2046struct ref_to_prune *next;2047unsigned char sha1[20];2048char name[FLEX_ARRAY];2049};20502051struct pack_refs_cb_data {2052unsigned int flags;2053struct ref_dir *packed_refs;2054struct ref_to_prune *ref_to_prune;2055};20562057/*2058 * An each_ref_entry_fn that is run over loose references only. If2059 * the loose reference can be packed, add an entry in the packed ref2060 * cache. If the reference should be pruned, also add it to2061 * ref_to_prune in the pack_refs_cb_data.2062 */2063static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2064{2065struct pack_refs_cb_data *cb = cb_data;2066enum peel_status peel_status;2067struct ref_entry *packed_entry;2068int is_tag_ref =starts_with(entry->name,"refs/tags/");20692070/* Do not pack per-worktree refs: */2071if(ref_type(entry->name) != REF_TYPE_NORMAL)2072return0;20732074/* ALWAYS pack tags */2075if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2076return0;20772078/* Do not pack symbolic or broken refs: */2079if((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2080return0;20812082/* Add a packed ref cache entry equivalent to the loose entry. */2083 peel_status =peel_entry(entry,1);2084if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2085die("internal error peeling reference%s(%s)",2086 entry->name,oid_to_hex(&entry->u.value.oid));2087 packed_entry =find_ref(cb->packed_refs, entry->name);2088if(packed_entry) {2089/* Overwrite existing packed entry with info from loose entry */2090 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2091oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2092}else{2093 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2094 REF_ISPACKED | REF_KNOWS_PEELED,0);2095add_ref(cb->packed_refs, packed_entry);2096}2097oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);20982099/* Schedule the loose reference for pruning if requested. */2100if((cb->flags & PACK_REFS_PRUNE)) {2101struct ref_to_prune *n;2102FLEX_ALLOC_STR(n, name, entry->name);2103hashcpy(n->sha1, entry->u.value.oid.hash);2104 n->next = cb->ref_to_prune;2105 cb->ref_to_prune = n;2106}2107return0;2108}21092110/*2111 * Remove empty parents, but spare refs/ and immediate subdirs.2112 * Note: munges *name.2113 */2114static voidtry_remove_empty_parents(char*name)2115{2116char*p, *q;2117int i;2118 p = name;2119for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2120while(*p && *p !='/')2121 p++;2122/* tolerate duplicate slashes; see check_refname_format() */2123while(*p =='/')2124 p++;2125}2126for(q = p; *q; q++)2127;2128while(1) {2129while(q > p && *q !='/')2130 q--;2131while(q > p && *(q-1) =='/')2132 q--;2133if(q == p)2134break;2135*q ='\0';2136if(rmdir(git_path("%s", name)))2137break;2138}2139}21402141/* make sure nobody touched the ref, and unlink */2142static voidprune_ref(struct ref_to_prune *r)2143{2144struct ref_transaction *transaction;2145struct strbuf err = STRBUF_INIT;21462147if(check_refname_format(r->name,0))2148return;21492150 transaction =ref_transaction_begin(&err);2151if(!transaction ||2152ref_transaction_delete(transaction, r->name, r->sha1,2153 REF_ISPRUNING, NULL, &err) ||2154ref_transaction_commit(transaction, &err)) {2155ref_transaction_free(transaction);2156error("%s", err.buf);2157strbuf_release(&err);2158return;2159}2160ref_transaction_free(transaction);2161strbuf_release(&err);2162try_remove_empty_parents(r->name);2163}21642165static voidprune_refs(struct ref_to_prune *r)2166{2167while(r) {2168prune_ref(r);2169 r = r->next;2170}2171}21722173intpack_refs(unsigned int flags)2174{2175struct pack_refs_cb_data cbdata;21762177memset(&cbdata,0,sizeof(cbdata));2178 cbdata.flags = flags;21792180lock_packed_refs(LOCK_DIE_ON_ERROR);2181 cbdata.packed_refs =get_packed_refs(&ref_cache);21822183do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2184 pack_if_possible_fn, &cbdata);21852186if(commit_packed_refs())2187die_errno("unable to overwrite old ref-pack file");21882189prune_refs(cbdata.ref_to_prune);2190return0;2191}21922193/*2194 * Rewrite the packed-refs file, omitting any refs listed in2195 * 'refnames'. On error, leave packed-refs unchanged, write an error2196 * message to 'err', and return a nonzero value.2197 *2198 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2199 */2200static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2201{2202struct ref_dir *packed;2203struct string_list_item *refname;2204int ret, needs_repacking =0, removed =0;22052206assert(err);22072208/* Look for a packed ref */2209for_each_string_list_item(refname, refnames) {2210if(get_packed_ref(refname->string)) {2211 needs_repacking =1;2212break;2213}2214}22152216/* Avoid locking if we have nothing to do */2217if(!needs_repacking)2218return0;/* no refname exists in packed refs */22192220if(lock_packed_refs(0)) {2221unable_to_lock_message(git_path("packed-refs"), errno, err);2222return-1;2223}2224 packed =get_packed_refs(&ref_cache);22252226/* Remove refnames from the cache */2227for_each_string_list_item(refname, refnames)2228if(remove_entry(packed, refname->string) != -1)2229 removed =1;2230if(!removed) {2231/*2232 * All packed entries disappeared while we were2233 * acquiring the lock.2234 */2235rollback_packed_refs();2236return0;2237}22382239/* Write what remains */2240 ret =commit_packed_refs();2241if(ret)2242strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2243strerror(errno));2244return ret;2245}22462247static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2248{2249assert(err);22502251if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2252/*2253 * loose. The loose file name is the same as the2254 * lockfile name, minus ".lock":2255 */2256char*loose_filename =get_locked_file_path(lock->lk);2257int res =unlink_or_msg(loose_filename, err);2258free(loose_filename);2259if(res)2260return1;2261}2262return0;2263}22642265intdelete_refs(struct string_list *refnames)2266{2267struct strbuf err = STRBUF_INIT;2268int i, result =0;22692270if(!refnames->nr)2271return0;22722273 result =repack_without_refs(refnames, &err);2274if(result) {2275/*2276 * If we failed to rewrite the packed-refs file, then2277 * it is unsafe to try to remove loose refs, because2278 * doing so might expose an obsolete packed value for2279 * a reference that might even point at an object that2280 * has been garbage collected.2281 */2282if(refnames->nr ==1)2283error(_("could not delete reference%s:%s"),2284 refnames->items[0].string, err.buf);2285else2286error(_("could not delete references:%s"), err.buf);22872288goto out;2289}22902291for(i =0; i < refnames->nr; i++) {2292const char*refname = refnames->items[i].string;22932294if(delete_ref(refname, NULL,0))2295 result |=error(_("could not remove reference%s"), refname);2296}22972298out:2299strbuf_release(&err);2300return result;2301}23022303/*2304 * People using contrib's git-new-workdir have .git/logs/refs ->2305 * /some/other/path/.git/logs/refs, and that may live on another device.2306 *2307 * IOW, to avoid cross device rename errors, the temporary renamed log must2308 * live into logs/refs.2309 */2310#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"23112312static intrename_tmp_log(const char*newrefname)2313{2314int attempts_remaining =4;2315struct strbuf path = STRBUF_INIT;2316int ret = -1;23172318 retry:2319strbuf_reset(&path);2320strbuf_git_path(&path,"logs/%s", newrefname);2321switch(safe_create_leading_directories_const(path.buf)) {2322case SCLD_OK:2323break;/* success */2324case SCLD_VANISHED:2325if(--attempts_remaining >0)2326goto retry;2327/* fall through */2328default:2329error("unable to create directory for%s", newrefname);2330goto out;2331}23322333if(rename(git_path(TMP_RENAMED_LOG), path.buf)) {2334if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2335/*2336 * rename(a, b) when b is an existing2337 * directory ought to result in ISDIR, but2338 * Solaris 5.8 gives ENOTDIR. Sheesh.2339 */2340if(remove_empty_directories(&path)) {2341error("Directory not empty: logs/%s", newrefname);2342goto out;2343}2344goto retry;2345}else if(errno == ENOENT && --attempts_remaining >0) {2346/*2347 * Maybe another process just deleted one of2348 * the directories in the path to newrefname.2349 * Try again from the beginning.2350 */2351goto retry;2352}else{2353error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2354 newrefname,strerror(errno));2355goto out;2356}2357}2358 ret =0;2359out:2360strbuf_release(&path);2361return ret;2362}23632364intverify_refname_available(const char*newname,2365struct string_list *extras,2366struct string_list *skip,2367struct strbuf *err)2368{2369struct ref_dir *packed_refs =get_packed_refs(&ref_cache);2370struct ref_dir *loose_refs =get_loose_refs(&ref_cache);23712372if(verify_refname_available_dir(newname, extras, skip,2373 packed_refs, err) ||2374verify_refname_available_dir(newname, extras, skip,2375 loose_refs, err))2376return-1;23772378return0;2379}23802381static intwrite_ref_to_lockfile(struct ref_lock *lock,2382const unsigned char*sha1,struct strbuf *err);2383static intcommit_ref_update(struct ref_lock *lock,2384const unsigned char*sha1,const char*logmsg,2385int flags,struct strbuf *err);23862387intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2388{2389unsigned char sha1[20], orig_sha1[20];2390int flag =0, logmoved =0;2391struct ref_lock *lock;2392struct stat loginfo;2393int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2394const char*symref = NULL;2395struct strbuf err = STRBUF_INIT;23962397if(log &&S_ISLNK(loginfo.st_mode))2398returnerror("reflog for%sis a symlink", oldrefname);23992400 symref =resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,2401 orig_sha1, &flag);2402if(flag & REF_ISSYMREF)2403returnerror("refname%sis a symbolic ref, renaming it is not supported",2404 oldrefname);2405if(!symref)2406returnerror("refname%snot found", oldrefname);24072408if(!rename_ref_available(oldrefname, newrefname))2409return1;24102411if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2412returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2413 oldrefname,strerror(errno));24142415if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2416error("unable to delete old%s", oldrefname);2417goto rollback;2418}24192420if(!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&2421delete_ref(newrefname, sha1, REF_NODEREF)) {2422if(errno==EISDIR) {2423struct strbuf path = STRBUF_INIT;2424int result;24252426strbuf_git_path(&path,"%s", newrefname);2427 result =remove_empty_directories(&path);2428strbuf_release(&path);24292430if(result) {2431error("Directory not empty:%s", newrefname);2432goto rollback;2433}2434}else{2435error("unable to delete existing%s", newrefname);2436goto rollback;2437}2438}24392440if(log &&rename_tmp_log(newrefname))2441goto rollback;24422443 logmoved = log;24442445 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL,0, NULL, &err);2446if(!lock) {2447error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2448strbuf_release(&err);2449goto rollback;2450}2451hashcpy(lock->old_oid.hash, orig_sha1);24522453if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2454commit_ref_update(lock, orig_sha1, logmsg,0, &err)) {2455error("unable to write current sha1 into%s:%s", newrefname, err.buf);2456strbuf_release(&err);2457goto rollback;2458}24592460return0;24612462 rollback:2463 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL,0, NULL, &err);2464if(!lock) {2465error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2466strbuf_release(&err);2467goto rollbacklog;2468}24692470 flag = log_all_ref_updates;2471 log_all_ref_updates =0;2472if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2473commit_ref_update(lock, orig_sha1, NULL,0, &err)) {2474error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2475strbuf_release(&err);2476}2477 log_all_ref_updates = flag;24782479 rollbacklog:2480if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2481error("unable to restore logfile%sfrom%s:%s",2482 oldrefname, newrefname,strerror(errno));2483if(!logmoved && log &&2484rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2485error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2486 oldrefname,strerror(errno));24872488return1;2489}24902491static intclose_ref(struct ref_lock *lock)2492{2493if(close_lock_file(lock->lk))2494return-1;2495return0;2496}24972498static intcommit_ref(struct ref_lock *lock)2499{2500if(commit_lock_file(lock->lk))2501return-1;2502return0;2503}25042505/*2506 * Create a reflog for a ref. If force_create = 0, the reflog will2507 * only be created for certain refs (those for which2508 * should_autocreate_reflog returns non-zero. Otherwise, create it2509 * regardless of the ref name. Fill in *err and return -1 on failure.2510 */2511static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)2512{2513int logfd, oflags = O_APPEND | O_WRONLY;25142515strbuf_git_path(logfile,"logs/%s", refname);2516if(force_create ||should_autocreate_reflog(refname)) {2517if(safe_create_leading_directories(logfile->buf) <0) {2518strbuf_addf(err,"unable to create directory for%s: "2519"%s", logfile->buf,strerror(errno));2520return-1;2521}2522 oflags |= O_CREAT;2523}25242525 logfd =open(logfile->buf, oflags,0666);2526if(logfd <0) {2527if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2528return0;25292530if(errno == EISDIR) {2531if(remove_empty_directories(logfile)) {2532strbuf_addf(err,"There are still logs under "2533"'%s'", logfile->buf);2534return-1;2535}2536 logfd =open(logfile->buf, oflags,0666);2537}25382539if(logfd <0) {2540strbuf_addf(err,"unable to append to%s:%s",2541 logfile->buf,strerror(errno));2542return-1;2543}2544}25452546adjust_shared_perm(logfile->buf);2547close(logfd);2548return0;2549}255025512552intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)2553{2554int ret;2555struct strbuf sb = STRBUF_INIT;25562557 ret =log_ref_setup(refname, &sb, err, force_create);2558strbuf_release(&sb);2559return ret;2560}25612562static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2563const unsigned char*new_sha1,2564const char*committer,const char*msg)2565{2566int msglen, written;2567unsigned maxlen, len;2568char*logrec;25692570 msglen = msg ?strlen(msg) :0;2571 maxlen =strlen(committer) + msglen +100;2572 logrec =xmalloc(maxlen);2573 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2574sha1_to_hex(old_sha1),2575sha1_to_hex(new_sha1),2576 committer);2577if(msglen)2578 len +=copy_reflog_msg(logrec + len -1, msg) -1;25792580 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2581free(logrec);2582if(written != len)2583return-1;25842585return0;2586}25872588static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,2589const unsigned char*new_sha1,const char*msg,2590struct strbuf *logfile,int flags,2591struct strbuf *err)2592{2593int logfd, result, oflags = O_APPEND | O_WRONLY;25942595if(log_all_ref_updates <0)2596 log_all_ref_updates = !is_bare_repository();25972598 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);25992600if(result)2601return result;26022603 logfd =open(logfile->buf, oflags);2604if(logfd <0)2605return0;2606 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2607git_committer_info(0), msg);2608if(result) {2609strbuf_addf(err,"unable to append to%s:%s", logfile->buf,2610strerror(errno));2611close(logfd);2612return-1;2613}2614if(close(logfd)) {2615strbuf_addf(err,"unable to append to%s:%s", logfile->buf,2616strerror(errno));2617return-1;2618}2619return0;2620}26212622static intlog_ref_write(const char*refname,const unsigned char*old_sha1,2623const unsigned char*new_sha1,const char*msg,2624int flags,struct strbuf *err)2625{2626returnfiles_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2627 err);2628}26292630intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2631const unsigned char*new_sha1,const char*msg,2632int flags,struct strbuf *err)2633{2634struct strbuf sb = STRBUF_INIT;2635int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2636 err);2637strbuf_release(&sb);2638return ret;2639}26402641/*2642 * Write sha1 into the open lockfile, then close the lockfile. On2643 * errors, rollback the lockfile, fill in *err and2644 * return -1.2645 */2646static intwrite_ref_to_lockfile(struct ref_lock *lock,2647const unsigned char*sha1,struct strbuf *err)2648{2649static char term ='\n';2650struct object *o;2651int fd;26522653 o =parse_object(sha1);2654if(!o) {2655strbuf_addf(err,2656"Trying to write ref%swith nonexistent object%s",2657 lock->ref_name,sha1_to_hex(sha1));2658unlock_ref(lock);2659return-1;2660}2661if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2662strbuf_addf(err,2663"Trying to write non-commit object%sto branch%s",2664sha1_to_hex(sha1), lock->ref_name);2665unlock_ref(lock);2666return-1;2667}2668 fd =get_lock_file_fd(lock->lk);2669if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2670write_in_full(fd, &term,1) !=1||2671close_ref(lock) <0) {2672strbuf_addf(err,2673"Couldn't write%s",get_lock_file_path(lock->lk));2674unlock_ref(lock);2675return-1;2676}2677return0;2678}26792680/*2681 * Commit a change to a loose reference that has already been written2682 * to the loose reference lockfile. Also update the reflogs if2683 * necessary, using the specified lockmsg (which can be NULL).2684 */2685static intcommit_ref_update(struct ref_lock *lock,2686const unsigned char*sha1,const char*logmsg,2687int flags,struct strbuf *err)2688{2689clear_loose_ref_cache(&ref_cache);2690if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0||2691(strcmp(lock->ref_name, lock->orig_ref_name) &&2692log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0)) {2693char*old_msg =strbuf_detach(err, NULL);2694strbuf_addf(err,"Cannot update the ref '%s':%s",2695 lock->ref_name, old_msg);2696free(old_msg);2697unlock_ref(lock);2698return-1;2699}2700if(strcmp(lock->orig_ref_name,"HEAD") !=0) {2701/*2702 * Special hack: If a branch is updated directly and HEAD2703 * points to it (may happen on the remote side of a push2704 * for example) then logically the HEAD reflog should be2705 * updated too.2706 * A generic solution implies reverse symref information,2707 * but finding all symrefs pointing to the given branch2708 * would be rather costly for this rare event (the direct2709 * update of a branch) to be worth it. So let's cheat and2710 * check with HEAD only which should cover 99% of all usage2711 * scenarios (even 100% of the default ones).2712 */2713unsigned char head_sha1[20];2714int head_flag;2715const char*head_ref;2716 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,2717 head_sha1, &head_flag);2718if(head_ref && (head_flag & REF_ISSYMREF) &&2719!strcmp(head_ref, lock->ref_name)) {2720struct strbuf log_err = STRBUF_INIT;2721if(log_ref_write("HEAD", lock->old_oid.hash, sha1,2722 logmsg,0, &log_err)) {2723error("%s", log_err.buf);2724strbuf_release(&log_err);2725}2726}2727}2728if(commit_ref(lock)) {2729error("Couldn't set%s", lock->ref_name);2730unlock_ref(lock);2731return-1;2732}27332734unlock_ref(lock);2735return0;2736}27372738static intcreate_ref_symlink(struct ref_lock *lock,const char*target)2739{2740int ret = -1;2741#ifndef NO_SYMLINK_HEAD2742char*ref_path =get_locked_file_path(lock->lk);2743unlink(ref_path);2744 ret =symlink(target, ref_path);2745free(ref_path);27462747if(ret)2748fprintf(stderr,"no symlink - falling back to symbolic ref\n");2749#endif2750return ret;2751}27522753static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,2754const char*target,const char*logmsg)2755{2756struct strbuf err = STRBUF_INIT;2757unsigned char new_sha1[20];2758if(logmsg && !read_ref(target, new_sha1) &&2759log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg,0, &err)) {2760error("%s", err.buf);2761strbuf_release(&err);2762}2763}27642765static intcreate_symref_locked(struct ref_lock *lock,const char*refname,2766const char*target,const char*logmsg)2767{2768if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {2769update_symref_reflog(lock, refname, target, logmsg);2770return0;2771}27722773if(!fdopen_lock_file(lock->lk,"w"))2774returnerror("unable to fdopen%s:%s",2775 lock->lk->tempfile.filename.buf,strerror(errno));27762777update_symref_reflog(lock, refname, target, logmsg);27782779/* no error check; commit_ref will check ferror */2780fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);2781if(commit_ref(lock) <0)2782returnerror("unable to write symref for%s:%s", refname,2783strerror(errno));2784return0;2785}27862787intcreate_symref(const char*refname,const char*target,const char*logmsg)2788{2789struct strbuf err = STRBUF_INIT;2790struct ref_lock *lock;2791int ret;27922793 lock =lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,2794&err);2795if(!lock) {2796error("%s", err.buf);2797strbuf_release(&err);2798return-1;2799}28002801 ret =create_symref_locked(lock, refname, target, logmsg);2802unlock_ref(lock);2803return ret;2804}28052806intreflog_exists(const char*refname)2807{2808struct stat st;28092810return!lstat(git_path("logs/%s", refname), &st) &&2811S_ISREG(st.st_mode);2812}28132814intdelete_reflog(const char*refname)2815{2816returnremove_path(git_path("logs/%s", refname));2817}28182819static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)2820{2821unsigned char osha1[20], nsha1[20];2822char*email_end, *message;2823unsigned long timestamp;2824int tz;28252826/* old SP new SP name <email> SP time TAB msg LF */2827if(sb->len <83|| sb->buf[sb->len -1] !='\n'||2828get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||2829get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||2830!(email_end =strchr(sb->buf +82,'>')) ||2831 email_end[1] !=' '||2832!(timestamp =strtoul(email_end +2, &message,10)) ||2833!message || message[0] !=' '||2834(message[1] !='+'&& message[1] !='-') ||2835!isdigit(message[2]) || !isdigit(message[3]) ||2836!isdigit(message[4]) || !isdigit(message[5]))2837return0;/* corrupt? */2838 email_end[1] ='\0';2839 tz =strtol(message +1, NULL,10);2840if(message[6] !='\t')2841 message +=6;2842else2843 message +=7;2844returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);2845}28462847static char*find_beginning_of_line(char*bob,char*scan)2848{2849while(bob < scan && *(--scan) !='\n')2850;/* keep scanning backwards */2851/*2852 * Return either beginning of the buffer, or LF at the end of2853 * the previous line.2854 */2855return scan;2856}28572858intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)2859{2860struct strbuf sb = STRBUF_INIT;2861FILE*logfp;2862long pos;2863int ret =0, at_tail =1;28642865 logfp =fopen(git_path("logs/%s", refname),"r");2866if(!logfp)2867return-1;28682869/* Jump to the end */2870if(fseek(logfp,0, SEEK_END) <0)2871returnerror("cannot seek back reflog for%s:%s",2872 refname,strerror(errno));2873 pos =ftell(logfp);2874while(!ret &&0< pos) {2875int cnt;2876size_t nread;2877char buf[BUFSIZ];2878char*endp, *scanp;28792880/* Fill next block from the end */2881 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;2882if(fseek(logfp, pos - cnt, SEEK_SET))2883returnerror("cannot seek back reflog for%s:%s",2884 refname,strerror(errno));2885 nread =fread(buf, cnt,1, logfp);2886if(nread !=1)2887returnerror("cannot read%dbytes from reflog for%s:%s",2888 cnt, refname,strerror(errno));2889 pos -= cnt;28902891 scanp = endp = buf + cnt;2892if(at_tail && scanp[-1] =='\n')2893/* Looking at the final LF at the end of the file */2894 scanp--;2895 at_tail =0;28962897while(buf < scanp) {2898/*2899 * terminating LF of the previous line, or the beginning2900 * of the buffer.2901 */2902char*bp;29032904 bp =find_beginning_of_line(buf, scanp);29052906if(*bp =='\n') {2907/*2908 * The newline is the end of the previous line,2909 * so we know we have complete line starting2910 * at (bp + 1). Prefix it onto any prior data2911 * we collected for the line and process it.2912 */2913strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));2914 scanp = bp;2915 endp = bp +1;2916 ret =show_one_reflog_ent(&sb, fn, cb_data);2917strbuf_reset(&sb);2918if(ret)2919break;2920}else if(!pos) {2921/*2922 * We are at the start of the buffer, and the2923 * start of the file; there is no previous2924 * line, and we have everything for this one.2925 * Process it, and we can end the loop.2926 */2927strbuf_splice(&sb,0,0, buf, endp - buf);2928 ret =show_one_reflog_ent(&sb, fn, cb_data);2929strbuf_reset(&sb);2930break;2931}29322933if(bp == buf) {2934/*2935 * We are at the start of the buffer, and there2936 * is more file to read backwards. Which means2937 * we are in the middle of a line. Note that we2938 * may get here even if *bp was a newline; that2939 * just means we are at the exact end of the2940 * previous line, rather than some spot in the2941 * middle.2942 *2943 * Save away what we have to be combined with2944 * the data from the next read.2945 */2946strbuf_splice(&sb,0,0, buf, endp - buf);2947break;2948}2949}29502951}2952if(!ret && sb.len)2953die("BUG: reverse reflog parser had leftover data");29542955fclose(logfp);2956strbuf_release(&sb);2957return ret;2958}29592960intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)2961{2962FILE*logfp;2963struct strbuf sb = STRBUF_INIT;2964int ret =0;29652966 logfp =fopen(git_path("logs/%s", refname),"r");2967if(!logfp)2968return-1;29692970while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))2971 ret =show_one_reflog_ent(&sb, fn, cb_data);2972fclose(logfp);2973strbuf_release(&sb);2974return ret;2975}2976/*2977 * Call fn for each reflog in the namespace indicated by name. name2978 * must be empty or end with '/'. Name will be used as a scratch2979 * space, but its contents will be restored before return.2980 */2981static intdo_for_each_reflog(struct strbuf *name, each_ref_fn fn,void*cb_data)2982{2983DIR*d =opendir(git_path("logs/%s", name->buf));2984int retval =0;2985struct dirent *de;2986int oldlen = name->len;29872988if(!d)2989return name->len ? errno :0;29902991while((de =readdir(d)) != NULL) {2992struct stat st;29932994if(de->d_name[0] =='.')2995continue;2996if(ends_with(de->d_name,".lock"))2997continue;2998strbuf_addstr(name, de->d_name);2999if(stat(git_path("logs/%s", name->buf), &st) <0) {3000;/* silently ignore */3001}else{3002if(S_ISDIR(st.st_mode)) {3003strbuf_addch(name,'/');3004 retval =do_for_each_reflog(name, fn, cb_data);3005}else{3006struct object_id oid;30073008if(read_ref_full(name->buf,0, oid.hash, NULL))3009 retval =error("bad ref for%s", name->buf);3010else3011 retval =fn(name->buf, &oid,0, cb_data);3012}3013if(retval)3014break;3015}3016strbuf_setlen(name, oldlen);3017}3018closedir(d);3019return retval;3020}30213022intfor_each_reflog(each_ref_fn fn,void*cb_data)3023{3024int retval;3025struct strbuf name;3026strbuf_init(&name, PATH_MAX);3027 retval =do_for_each_reflog(&name, fn, cb_data);3028strbuf_release(&name);3029return retval;3030}30313032static intref_update_reject_duplicates(struct string_list *refnames,3033struct strbuf *err)3034{3035int i, n = refnames->nr;30363037assert(err);30383039for(i =1; i < n; i++)3040if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3041strbuf_addf(err,3042"Multiple updates for ref '%s' not allowed.",3043 refnames->items[i].string);3044return1;3045}3046return0;3047}30483049intref_transaction_commit(struct ref_transaction *transaction,3050struct strbuf *err)3051{3052int ret =0, i;3053int n = transaction->nr;3054struct ref_update **updates = transaction->updates;3055struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3056struct string_list_item *ref_to_delete;3057struct string_list affected_refnames = STRING_LIST_INIT_NODUP;30583059assert(err);30603061if(transaction->state != REF_TRANSACTION_OPEN)3062die("BUG: commit called for transaction that is not open");30633064if(!n) {3065 transaction->state = REF_TRANSACTION_CLOSED;3066return0;3067}30683069/* Fail if a refname appears more than once in the transaction: */3070for(i =0; i < n; i++)3071string_list_append(&affected_refnames, updates[i]->refname);3072string_list_sort(&affected_refnames);3073if(ref_update_reject_duplicates(&affected_refnames, err)) {3074 ret = TRANSACTION_GENERIC_ERROR;3075goto cleanup;3076}30773078/*3079 * Acquire all locks, verify old values if provided, check3080 * that new values are valid, and write new values to the3081 * lockfiles, ready to be activated. Only keep one lockfile3082 * open at a time to avoid running out of file descriptors.3083 */3084for(i =0; i < n; i++) {3085struct ref_update *update = updates[i];30863087if((update->flags & REF_HAVE_NEW) &&3088is_null_sha1(update->new_sha1))3089 update->flags |= REF_DELETING;3090 update->lock =lock_ref_sha1_basic(3091 update->refname,3092((update->flags & REF_HAVE_OLD) ?3093 update->old_sha1 : NULL),3094&affected_refnames, NULL,3095 update->flags,3096&update->type,3097 err);3098if(!update->lock) {3099char*reason;31003101 ret = (errno == ENOTDIR)3102? TRANSACTION_NAME_CONFLICT3103: TRANSACTION_GENERIC_ERROR;3104 reason =strbuf_detach(err, NULL);3105strbuf_addf(err,"cannot lock ref '%s':%s",3106 update->refname, reason);3107free(reason);3108goto cleanup;3109}3110if((update->flags & REF_HAVE_NEW) &&3111!(update->flags & REF_DELETING)) {3112int overwriting_symref = ((update->type & REF_ISSYMREF) &&3113(update->flags & REF_NODEREF));31143115if(!overwriting_symref &&3116!hashcmp(update->lock->old_oid.hash, update->new_sha1)) {3117/*3118 * The reference already has the desired3119 * value, so we don't need to write it.3120 */3121}else if(write_ref_to_lockfile(update->lock,3122 update->new_sha1,3123 err)) {3124char*write_err =strbuf_detach(err, NULL);31253126/*3127 * The lock was freed upon failure of3128 * write_ref_to_lockfile():3129 */3130 update->lock = NULL;3131strbuf_addf(err,3132"cannot update the ref '%s':%s",3133 update->refname, write_err);3134free(write_err);3135 ret = TRANSACTION_GENERIC_ERROR;3136goto cleanup;3137}else{3138 update->flags |= REF_NEEDS_COMMIT;3139}3140}3141if(!(update->flags & REF_NEEDS_COMMIT)) {3142/*3143 * We didn't have to write anything to the lockfile.3144 * Close it to free up the file descriptor:3145 */3146if(close_ref(update->lock)) {3147strbuf_addf(err,"Couldn't close%s.lock",3148 update->refname);3149goto cleanup;3150}3151}3152}31533154/* Perform updates first so live commits remain referenced */3155for(i =0; i < n; i++) {3156struct ref_update *update = updates[i];31573158if(update->flags & REF_NEEDS_COMMIT) {3159if(commit_ref_update(update->lock,3160 update->new_sha1, update->msg,3161 update->flags, err)) {3162/* freed by commit_ref_update(): */3163 update->lock = NULL;3164 ret = TRANSACTION_GENERIC_ERROR;3165goto cleanup;3166}else{3167/* freed by commit_ref_update(): */3168 update->lock = NULL;3169}3170}3171}31723173/* Perform deletes now that updates are safely completed */3174for(i =0; i < n; i++) {3175struct ref_update *update = updates[i];31763177if(update->flags & REF_DELETING) {3178if(delete_ref_loose(update->lock, update->type, err)) {3179 ret = TRANSACTION_GENERIC_ERROR;3180goto cleanup;3181}31823183if(!(update->flags & REF_ISPRUNING))3184string_list_append(&refs_to_delete,3185 update->lock->ref_name);3186}3187}31883189if(repack_without_refs(&refs_to_delete, err)) {3190 ret = TRANSACTION_GENERIC_ERROR;3191goto cleanup;3192}3193for_each_string_list_item(ref_to_delete, &refs_to_delete)3194unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3195clear_loose_ref_cache(&ref_cache);31963197cleanup:3198 transaction->state = REF_TRANSACTION_CLOSED;31993200for(i =0; i < n; i++)3201if(updates[i]->lock)3202unlock_ref(updates[i]->lock);3203string_list_clear(&refs_to_delete,0);3204string_list_clear(&affected_refnames,0);3205return ret;3206}32073208static intref_present(const char*refname,3209const struct object_id *oid,int flags,void*cb_data)3210{3211struct string_list *affected_refnames = cb_data;32123213returnstring_list_has_string(affected_refnames, refname);3214}32153216intinitial_ref_transaction_commit(struct ref_transaction *transaction,3217struct strbuf *err)3218{3219int ret =0, i;3220int n = transaction->nr;3221struct ref_update **updates = transaction->updates;3222struct string_list affected_refnames = STRING_LIST_INIT_NODUP;32233224assert(err);32253226if(transaction->state != REF_TRANSACTION_OPEN)3227die("BUG: commit called for transaction that is not open");32283229/* Fail if a refname appears more than once in the transaction: */3230for(i =0; i < n; i++)3231string_list_append(&affected_refnames, updates[i]->refname);3232string_list_sort(&affected_refnames);3233if(ref_update_reject_duplicates(&affected_refnames, err)) {3234 ret = TRANSACTION_GENERIC_ERROR;3235goto cleanup;3236}32373238/*3239 * It's really undefined to call this function in an active3240 * repository or when there are existing references: we are3241 * only locking and changing packed-refs, so (1) any3242 * simultaneous processes might try to change a reference at3243 * the same time we do, and (2) any existing loose versions of3244 * the references that we are setting would have precedence3245 * over our values. But some remote helpers create the remote3246 * "HEAD" and "master" branches before calling this function,3247 * so here we really only check that none of the references3248 * that we are creating already exists.3249 */3250if(for_each_rawref(ref_present, &affected_refnames))3251die("BUG: initial ref transaction called with existing refs");32523253for(i =0; i < n; i++) {3254struct ref_update *update = updates[i];32553256if((update->flags & REF_HAVE_OLD) &&3257!is_null_sha1(update->old_sha1))3258die("BUG: initial ref transaction with old_sha1 set");3259if(verify_refname_available(update->refname,3260&affected_refnames, NULL,3261 err)) {3262 ret = TRANSACTION_NAME_CONFLICT;3263goto cleanup;3264}3265}32663267if(lock_packed_refs(0)) {3268strbuf_addf(err,"unable to lock packed-refs file:%s",3269strerror(errno));3270 ret = TRANSACTION_GENERIC_ERROR;3271goto cleanup;3272}32733274for(i =0; i < n; i++) {3275struct ref_update *update = updates[i];32763277if((update->flags & REF_HAVE_NEW) &&3278!is_null_sha1(update->new_sha1))3279add_packed_ref(update->refname, update->new_sha1);3280}32813282if(commit_packed_refs()) {3283strbuf_addf(err,"unable to commit packed-refs file:%s",3284strerror(errno));3285 ret = TRANSACTION_GENERIC_ERROR;3286goto cleanup;3287}32883289cleanup:3290 transaction->state = REF_TRANSACTION_CLOSED;3291string_list_clear(&affected_refnames,0);3292return ret;3293}32943295struct expire_reflog_cb {3296unsigned int flags;3297 reflog_expiry_should_prune_fn *should_prune_fn;3298void*policy_cb;3299FILE*newlog;3300unsigned char last_kept_sha1[20];3301};33023303static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3304const char*email,unsigned long timestamp,int tz,3305const char*message,void*cb_data)3306{3307struct expire_reflog_cb *cb = cb_data;3308struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;33093310if(cb->flags & EXPIRE_REFLOGS_REWRITE)3311 osha1 = cb->last_kept_sha1;33123313if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3314 message, policy_cb)) {3315if(!cb->newlog)3316printf("would prune%s", message);3317else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3318printf("prune%s", message);3319}else{3320if(cb->newlog) {3321fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3322sha1_to_hex(osha1),sha1_to_hex(nsha1),3323 email, timestamp, tz, message);3324hashcpy(cb->last_kept_sha1, nsha1);3325}3326if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3327printf("keep%s", message);3328}3329return0;3330}33313332intreflog_expire(const char*refname,const unsigned char*sha1,3333unsigned int flags,3334 reflog_expiry_prepare_fn prepare_fn,3335 reflog_expiry_should_prune_fn should_prune_fn,3336 reflog_expiry_cleanup_fn cleanup_fn,3337void*policy_cb_data)3338{3339static struct lock_file reflog_lock;3340struct expire_reflog_cb cb;3341struct ref_lock *lock;3342char*log_file;3343int status =0;3344int type;3345struct strbuf err = STRBUF_INIT;33463347memset(&cb,0,sizeof(cb));3348 cb.flags = flags;3349 cb.policy_cb = policy_cb_data;3350 cb.should_prune_fn = should_prune_fn;33513352/*3353 * The reflog file is locked by holding the lock on the3354 * reference itself, plus we might need to update the3355 * reference if --updateref was specified:3356 */3357 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL,0, &type, &err);3358if(!lock) {3359error("cannot lock ref '%s':%s", refname, err.buf);3360strbuf_release(&err);3361return-1;3362}3363if(!reflog_exists(refname)) {3364unlock_ref(lock);3365return0;3366}33673368 log_file =git_pathdup("logs/%s", refname);3369if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3370/*3371 * Even though holding $GIT_DIR/logs/$reflog.lock has3372 * no locking implications, we use the lock_file3373 * machinery here anyway because it does a lot of the3374 * work we need, including cleaning up if the program3375 * exits unexpectedly.3376 */3377if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {3378struct strbuf err = STRBUF_INIT;3379unable_to_lock_message(log_file, errno, &err);3380error("%s", err.buf);3381strbuf_release(&err);3382goto failure;3383}3384 cb.newlog =fdopen_lock_file(&reflog_lock,"w");3385if(!cb.newlog) {3386error("cannot fdopen%s(%s)",3387get_lock_file_path(&reflog_lock),strerror(errno));3388goto failure;3389}3390}33913392(*prepare_fn)(refname, sha1, cb.policy_cb);3393for_each_reflog_ent(refname, expire_reflog_ent, &cb);3394(*cleanup_fn)(cb.policy_cb);33953396if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3397/*3398 * It doesn't make sense to adjust a reference pointed3399 * to by a symbolic ref based on expiring entries in3400 * the symbolic reference's reflog. Nor can we update3401 * a reference if there are no remaining reflog3402 * entries.3403 */3404int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&3405!(type & REF_ISSYMREF) &&3406!is_null_sha1(cb.last_kept_sha1);34073408if(close_lock_file(&reflog_lock)) {3409 status |=error("couldn't write%s:%s", log_file,3410strerror(errno));3411}else if(update &&3412(write_in_full(get_lock_file_fd(lock->lk),3413sha1_to_hex(cb.last_kept_sha1),40) !=40||3414write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||3415close_ref(lock) <0)) {3416 status |=error("couldn't write%s",3417get_lock_file_path(lock->lk));3418rollback_lock_file(&reflog_lock);3419}else if(commit_lock_file(&reflog_lock)) {3420 status |=error("unable to write reflog '%s' (%s)",3421 log_file,strerror(errno));3422}else if(update &&commit_ref(lock)) {3423 status |=error("couldn't set%s", lock->ref_name);3424}3425}3426free(log_file);3427unlock_ref(lock);3428return status;34293430 failure:3431rollback_lock_file(&reflog_lock);3432free(log_file);3433unlock_ref(lock);3434return-1;3435}