1#include"../cache.h" 2#include"../refs.h" 3#include"refs-internal.h" 4#include"../lockfile.h" 5#include"../object.h" 6#include"../dir.h" 7 8struct ref_lock { 9char*ref_name; 10char*orig_ref_name; 11struct lock_file *lk; 12struct object_id old_oid; 13}; 14 15struct ref_entry; 16 17/* 18 * Information used (along with the information in ref_entry) to 19 * describe a single cached reference. This data structure only 20 * occurs embedded in a union in struct ref_entry, and only when 21 * (ref_entry->flag & REF_DIR) is zero. 22 */ 23struct ref_value { 24/* 25 * The name of the object to which this reference resolves 26 * (which may be a tag object). If REF_ISBROKEN, this is 27 * null. If REF_ISSYMREF, then this is the name of the object 28 * referred to by the last reference in the symlink chain. 29 */ 30struct object_id oid; 31 32/* 33 * If REF_KNOWS_PEELED, then this field holds the peeled value 34 * of this reference, or null if the reference is known not to 35 * be peelable. See the documentation for peel_ref() for an 36 * exact definition of "peelable". 37 */ 38struct object_id peeled; 39}; 40 41struct ref_cache; 42 43/* 44 * Information used (along with the information in ref_entry) to 45 * describe a level in the hierarchy of references. This data 46 * structure only occurs embedded in a union in struct ref_entry, and 47 * only when (ref_entry.flag & REF_DIR) is set. In that case, 48 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 49 * in the directory have already been read: 50 * 51 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 52 * or packed references, already read. 53 * 54 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 55 * references that hasn't been read yet (nor has any of its 56 * subdirectories). 57 * 58 * Entries within a directory are stored within a growable array of 59 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 60 * sorted are sorted by their component name in strcmp() order and the 61 * remaining entries are unsorted. 62 * 63 * Loose references are read lazily, one directory at a time. When a 64 * directory of loose references is read, then all of the references 65 * in that directory are stored, and REF_INCOMPLETE stubs are created 66 * for any subdirectories, but the subdirectories themselves are not 67 * read. The reading is triggered by get_ref_dir(). 68 */ 69struct ref_dir { 70int nr, alloc; 71 72/* 73 * Entries with index 0 <= i < sorted are sorted by name. New 74 * entries are appended to the list unsorted, and are sorted 75 * only when required; thus we avoid the need to sort the list 76 * after the addition of every reference. 77 */ 78int sorted; 79 80/* A pointer to the ref_cache that contains this ref_dir. */ 81struct ref_cache *ref_cache; 82 83struct ref_entry **entries; 84}; 85 86/* 87 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 88 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 89 * public values; see refs.h. 90 */ 91 92/* 93 * The field ref_entry->u.value.peeled of this value entry contains 94 * the correct peeled value for the reference, which might be 95 * null_sha1 if the reference is not a tag or if it is broken. 96 */ 97#define REF_KNOWS_PEELED 0x10 98 99/* ref_entry represents a directory of references */ 100#define REF_DIR 0x20 101 102/* 103 * Entry has not yet been read from disk (used only for REF_DIR 104 * entries representing loose references) 105 */ 106#define REF_INCOMPLETE 0x40 107 108/* 109 * A ref_entry represents either a reference or a "subdirectory" of 110 * references. 111 * 112 * Each directory in the reference namespace is represented by a 113 * ref_entry with (flags & REF_DIR) set and containing a subdir member 114 * that holds the entries in that directory that have been read so 115 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 116 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 117 * used for loose reference directories. 118 * 119 * References are represented by a ref_entry with (flags & REF_DIR) 120 * unset and a value member that describes the reference's value. The 121 * flag member is at the ref_entry level, but it is also needed to 122 * interpret the contents of the value field (in other words, a 123 * ref_value object is not very much use without the enclosing 124 * ref_entry). 125 * 126 * Reference names cannot end with slash and directories' names are 127 * always stored with a trailing slash (except for the top-level 128 * directory, which is always denoted by ""). This has two nice 129 * consequences: (1) when the entries in each subdir are sorted 130 * lexicographically by name (as they usually are), the references in 131 * a whole tree can be generated in lexicographic order by traversing 132 * the tree in left-to-right, depth-first order; (2) the names of 133 * references and subdirectories cannot conflict, and therefore the 134 * presence of an empty subdirectory does not block the creation of a 135 * similarly-named reference. (The fact that reference names with the 136 * same leading components can conflict *with each other* is a 137 * separate issue that is regulated by verify_refname_available().) 138 * 139 * Please note that the name field contains the fully-qualified 140 * reference (or subdirectory) name. Space could be saved by only 141 * storing the relative names. But that would require the full names 142 * to be generated on the fly when iterating in do_for_each_ref(), and 143 * would break callback functions, who have always been able to assume 144 * that the name strings that they are passed will not be freed during 145 * the iteration. 146 */ 147struct ref_entry { 148unsigned char flag;/* ISSYMREF? ISPACKED? */ 149union{ 150struct ref_value value;/* if not (flags&REF_DIR) */ 151struct ref_dir subdir;/* if (flags&REF_DIR) */ 152} u; 153/* 154 * The full name of the reference (e.g., "refs/heads/master") 155 * or the full name of the directory with a trailing slash 156 * (e.g., "refs/heads/"): 157 */ 158char name[FLEX_ARRAY]; 159}; 160 161static voidread_loose_refs(const char*dirname,struct ref_dir *dir); 162static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len); 163static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 164const char*dirname,size_t len, 165int incomplete); 166static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry); 167 168static struct ref_dir *get_ref_dir(struct ref_entry *entry) 169{ 170struct ref_dir *dir; 171assert(entry->flag & REF_DIR); 172 dir = &entry->u.subdir; 173if(entry->flag & REF_INCOMPLETE) { 174read_loose_refs(entry->name, dir); 175 176/* 177 * Manually add refs/bisect, which, being 178 * per-worktree, might not appear in the directory 179 * listing for refs/ in the main repo. 180 */ 181if(!strcmp(entry->name,"refs/")) { 182int pos =search_ref_dir(dir,"refs/bisect/",12); 183if(pos <0) { 184struct ref_entry *child_entry; 185 child_entry =create_dir_entry(dir->ref_cache, 186"refs/bisect/", 18712,1); 188add_entry_to_dir(dir, child_entry); 189read_loose_refs("refs/bisect", 190&child_entry->u.subdir); 191} 192} 193 entry->flag &= ~REF_INCOMPLETE; 194} 195return dir; 196} 197 198static struct ref_entry *create_ref_entry(const char*refname, 199const unsigned char*sha1,int flag, 200int check_name) 201{ 202struct ref_entry *ref; 203 204if(check_name && 205check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 206die("Reference has invalid format: '%s'", refname); 207FLEX_ALLOC_STR(ref, name, refname); 208hashcpy(ref->u.value.oid.hash, sha1); 209oidclr(&ref->u.value.peeled); 210 ref->flag = flag; 211return ref; 212} 213 214static voidclear_ref_dir(struct ref_dir *dir); 215 216static voidfree_ref_entry(struct ref_entry *entry) 217{ 218if(entry->flag & REF_DIR) { 219/* 220 * Do not use get_ref_dir() here, as that might 221 * trigger the reading of loose refs. 222 */ 223clear_ref_dir(&entry->u.subdir); 224} 225free(entry); 226} 227 228/* 229 * Add a ref_entry to the end of dir (unsorted). Entry is always 230 * stored directly in dir; no recursion into subdirectories is 231 * done. 232 */ 233static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry) 234{ 235ALLOC_GROW(dir->entries, dir->nr +1, dir->alloc); 236 dir->entries[dir->nr++] = entry; 237/* optimize for the case that entries are added in order */ 238if(dir->nr ==1|| 239(dir->nr == dir->sorted +1&& 240strcmp(dir->entries[dir->nr -2]->name, 241 dir->entries[dir->nr -1]->name) <0)) 242 dir->sorted = dir->nr; 243} 244 245/* 246 * Clear and free all entries in dir, recursively. 247 */ 248static voidclear_ref_dir(struct ref_dir *dir) 249{ 250int i; 251for(i =0; i < dir->nr; i++) 252free_ref_entry(dir->entries[i]); 253free(dir->entries); 254 dir->sorted = dir->nr = dir->alloc =0; 255 dir->entries = NULL; 256} 257 258/* 259 * Create a struct ref_entry object for the specified dirname. 260 * dirname is the name of the directory with a trailing slash (e.g., 261 * "refs/heads/") or "" for the top-level directory. 262 */ 263static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 264const char*dirname,size_t len, 265int incomplete) 266{ 267struct ref_entry *direntry; 268FLEX_ALLOC_MEM(direntry, name, dirname, len); 269 direntry->u.subdir.ref_cache = ref_cache; 270 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE :0); 271return direntry; 272} 273 274static intref_entry_cmp(const void*a,const void*b) 275{ 276struct ref_entry *one = *(struct ref_entry **)a; 277struct ref_entry *two = *(struct ref_entry **)b; 278returnstrcmp(one->name, two->name); 279} 280 281static voidsort_ref_dir(struct ref_dir *dir); 282 283struct string_slice { 284size_t len; 285const char*str; 286}; 287 288static intref_entry_cmp_sslice(const void*key_,const void*ent_) 289{ 290const struct string_slice *key = key_; 291const struct ref_entry *ent = *(const struct ref_entry *const*)ent_; 292int cmp =strncmp(key->str, ent->name, key->len); 293if(cmp) 294return cmp; 295return'\0'- (unsigned char)ent->name[key->len]; 296} 297 298/* 299 * Return the index of the entry with the given refname from the 300 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 301 * no such entry is found. dir must already be complete. 302 */ 303static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len) 304{ 305struct ref_entry **r; 306struct string_slice key; 307 308if(refname == NULL || !dir->nr) 309return-1; 310 311sort_ref_dir(dir); 312 key.len = len; 313 key.str = refname; 314 r =bsearch(&key, dir->entries, dir->nr,sizeof(*dir->entries), 315 ref_entry_cmp_sslice); 316 317if(r == NULL) 318return-1; 319 320return r - dir->entries; 321} 322 323/* 324 * Search for a directory entry directly within dir (without 325 * recursing). Sort dir if necessary. subdirname must be a directory 326 * name (i.e., end in '/'). If mkdir is set, then create the 327 * directory if it is missing; otherwise, return NULL if the desired 328 * directory cannot be found. dir must already be complete. 329 */ 330static struct ref_dir *search_for_subdir(struct ref_dir *dir, 331const char*subdirname,size_t len, 332int mkdir) 333{ 334int entry_index =search_ref_dir(dir, subdirname, len); 335struct ref_entry *entry; 336if(entry_index == -1) { 337if(!mkdir) 338return NULL; 339/* 340 * Since dir is complete, the absence of a subdir 341 * means that the subdir really doesn't exist; 342 * therefore, create an empty record for it but mark 343 * the record complete. 344 */ 345 entry =create_dir_entry(dir->ref_cache, subdirname, len,0); 346add_entry_to_dir(dir, entry); 347}else{ 348 entry = dir->entries[entry_index]; 349} 350returnget_ref_dir(entry); 351} 352 353/* 354 * If refname is a reference name, find the ref_dir within the dir 355 * tree that should hold refname. If refname is a directory name 356 * (i.e., ends in '/'), then return that ref_dir itself. dir must 357 * represent the top-level directory and must already be complete. 358 * Sort ref_dirs and recurse into subdirectories as necessary. If 359 * mkdir is set, then create any missing directories; otherwise, 360 * return NULL if the desired directory cannot be found. 361 */ 362static struct ref_dir *find_containing_dir(struct ref_dir *dir, 363const char*refname,int mkdir) 364{ 365const char*slash; 366for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 367size_t dirnamelen = slash - refname +1; 368struct ref_dir *subdir; 369 subdir =search_for_subdir(dir, refname, dirnamelen, mkdir); 370if(!subdir) { 371 dir = NULL; 372break; 373} 374 dir = subdir; 375} 376 377return dir; 378} 379 380/* 381 * Find the value entry with the given name in dir, sorting ref_dirs 382 * and recursing into subdirectories as necessary. If the name is not 383 * found or it corresponds to a directory entry, return NULL. 384 */ 385static struct ref_entry *find_ref(struct ref_dir *dir,const char*refname) 386{ 387int entry_index; 388struct ref_entry *entry; 389 dir =find_containing_dir(dir, refname,0); 390if(!dir) 391return NULL; 392 entry_index =search_ref_dir(dir, refname,strlen(refname)); 393if(entry_index == -1) 394return NULL; 395 entry = dir->entries[entry_index]; 396return(entry->flag & REF_DIR) ? NULL : entry; 397} 398 399/* 400 * Remove the entry with the given name from dir, recursing into 401 * subdirectories as necessary. If refname is the name of a directory 402 * (i.e., ends with '/'), then remove the directory and its contents. 403 * If the removal was successful, return the number of entries 404 * remaining in the directory entry that contained the deleted entry. 405 * If the name was not found, return -1. Please note that this 406 * function only deletes the entry from the cache; it does not delete 407 * it from the filesystem or ensure that other cache entries (which 408 * might be symbolic references to the removed entry) are updated. 409 * Nor does it remove any containing dir entries that might be made 410 * empty by the removal. dir must represent the top-level directory 411 * and must already be complete. 412 */ 413static intremove_entry(struct ref_dir *dir,const char*refname) 414{ 415int refname_len =strlen(refname); 416int entry_index; 417struct ref_entry *entry; 418int is_dir = refname[refname_len -1] =='/'; 419if(is_dir) { 420/* 421 * refname represents a reference directory. Remove 422 * the trailing slash; otherwise we will get the 423 * directory *representing* refname rather than the 424 * one *containing* it. 425 */ 426char*dirname =xmemdupz(refname, refname_len -1); 427 dir =find_containing_dir(dir, dirname,0); 428free(dirname); 429}else{ 430 dir =find_containing_dir(dir, refname,0); 431} 432if(!dir) 433return-1; 434 entry_index =search_ref_dir(dir, refname, refname_len); 435if(entry_index == -1) 436return-1; 437 entry = dir->entries[entry_index]; 438 439memmove(&dir->entries[entry_index], 440&dir->entries[entry_index +1], 441(dir->nr - entry_index -1) *sizeof(*dir->entries) 442); 443 dir->nr--; 444if(dir->sorted > entry_index) 445 dir->sorted--; 446free_ref_entry(entry); 447return dir->nr; 448} 449 450/* 451 * Add a ref_entry to the ref_dir (unsorted), recursing into 452 * subdirectories as necessary. dir must represent the top-level 453 * directory. Return 0 on success. 454 */ 455static intadd_ref(struct ref_dir *dir,struct ref_entry *ref) 456{ 457 dir =find_containing_dir(dir, ref->name,1); 458if(!dir) 459return-1; 460add_entry_to_dir(dir, ref); 461return0; 462} 463 464/* 465 * Emit a warning and return true iff ref1 and ref2 have the same name 466 * and the same sha1. Die if they have the same name but different 467 * sha1s. 468 */ 469static intis_dup_ref(const struct ref_entry *ref1,const struct ref_entry *ref2) 470{ 471if(strcmp(ref1->name, ref2->name)) 472return0; 473 474/* Duplicate name; make sure that they don't conflict: */ 475 476if((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 477/* This is impossible by construction */ 478die("Reference directory conflict:%s", ref1->name); 479 480if(oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 481die("Duplicated ref, and SHA1s don't match:%s", ref1->name); 482 483warning("Duplicated ref:%s", ref1->name); 484return1; 485} 486 487/* 488 * Sort the entries in dir non-recursively (if they are not already 489 * sorted) and remove any duplicate entries. 490 */ 491static voidsort_ref_dir(struct ref_dir *dir) 492{ 493int i, j; 494struct ref_entry *last = NULL; 495 496/* 497 * This check also prevents passing a zero-length array to qsort(), 498 * which is a problem on some platforms. 499 */ 500if(dir->sorted == dir->nr) 501return; 502 503qsort(dir->entries, dir->nr,sizeof(*dir->entries), ref_entry_cmp); 504 505/* Remove any duplicates: */ 506for(i =0, j =0; j < dir->nr; j++) { 507struct ref_entry *entry = dir->entries[j]; 508if(last &&is_dup_ref(last, entry)) 509free_ref_entry(entry); 510else 511 last = dir->entries[i++] = entry; 512} 513 dir->sorted = dir->nr = i; 514} 515 516/* 517 * Return true iff the reference described by entry can be resolved to 518 * an object in the database. Emit a warning if the referred-to 519 * object does not exist. 520 */ 521static intref_resolves_to_object(struct ref_entry *entry) 522{ 523if(entry->flag & REF_ISBROKEN) 524return0; 525if(!has_sha1_file(entry->u.value.oid.hash)) { 526error("%sdoes not point to a valid object!", entry->name); 527return0; 528} 529return1; 530} 531 532/* 533 * current_ref is a performance hack: when iterating over references 534 * using the for_each_ref*() functions, current_ref is set to the 535 * current reference's entry before calling the callback function. If 536 * the callback function calls peel_ref(), then peel_ref() first 537 * checks whether the reference to be peeled is the current reference 538 * (it usually is) and if so, returns that reference's peeled version 539 * if it is available. This avoids a refname lookup in a common case. 540 */ 541static struct ref_entry *current_ref; 542 543typedefinteach_ref_entry_fn(struct ref_entry *entry,void*cb_data); 544 545struct ref_entry_cb { 546const char*base; 547int trim; 548int flags; 549 each_ref_fn *fn; 550void*cb_data; 551}; 552 553/* 554 * Handle one reference in a do_for_each_ref*()-style iteration, 555 * calling an each_ref_fn for each entry. 556 */ 557static intdo_one_ref(struct ref_entry *entry,void*cb_data) 558{ 559struct ref_entry_cb *data = cb_data; 560struct ref_entry *old_current_ref; 561int retval; 562 563if(!starts_with(entry->name, data->base)) 564return0; 565 566if(!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && 567!ref_resolves_to_object(entry)) 568return0; 569 570/* Store the old value, in case this is a recursive call: */ 571 old_current_ref = current_ref; 572 current_ref = entry; 573 retval = data->fn(entry->name + data->trim, &entry->u.value.oid, 574 entry->flag, data->cb_data); 575 current_ref = old_current_ref; 576return retval; 577} 578 579/* 580 * Call fn for each reference in dir that has index in the range 581 * offset <= index < dir->nr. Recurse into subdirectories that are in 582 * that index range, sorting them before iterating. This function 583 * does not sort dir itself; it should be sorted beforehand. fn is 584 * called for all references, including broken ones. 585 */ 586static intdo_for_each_entry_in_dir(struct ref_dir *dir,int offset, 587 each_ref_entry_fn fn,void*cb_data) 588{ 589int i; 590assert(dir->sorted == dir->nr); 591for(i = offset; i < dir->nr; i++) { 592struct ref_entry *entry = dir->entries[i]; 593int retval; 594if(entry->flag & REF_DIR) { 595struct ref_dir *subdir =get_ref_dir(entry); 596sort_ref_dir(subdir); 597 retval =do_for_each_entry_in_dir(subdir,0, fn, cb_data); 598}else{ 599 retval =fn(entry, cb_data); 600} 601if(retval) 602return retval; 603} 604return0; 605} 606 607/* 608 * Call fn for each reference in the union of dir1 and dir2, in order 609 * by refname. Recurse into subdirectories. If a value entry appears 610 * in both dir1 and dir2, then only process the version that is in 611 * dir2. The input dirs must already be sorted, but subdirs will be 612 * sorted as needed. fn is called for all references, including 613 * broken ones. 614 */ 615static intdo_for_each_entry_in_dirs(struct ref_dir *dir1, 616struct ref_dir *dir2, 617 each_ref_entry_fn fn,void*cb_data) 618{ 619int retval; 620int i1 =0, i2 =0; 621 622assert(dir1->sorted == dir1->nr); 623assert(dir2->sorted == dir2->nr); 624while(1) { 625struct ref_entry *e1, *e2; 626int cmp; 627if(i1 == dir1->nr) { 628returndo_for_each_entry_in_dir(dir2, i2, fn, cb_data); 629} 630if(i2 == dir2->nr) { 631returndo_for_each_entry_in_dir(dir1, i1, fn, cb_data); 632} 633 e1 = dir1->entries[i1]; 634 e2 = dir2->entries[i2]; 635 cmp =strcmp(e1->name, e2->name); 636if(cmp ==0) { 637if((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { 638/* Both are directories; descend them in parallel. */ 639struct ref_dir *subdir1 =get_ref_dir(e1); 640struct ref_dir *subdir2 =get_ref_dir(e2); 641sort_ref_dir(subdir1); 642sort_ref_dir(subdir2); 643 retval =do_for_each_entry_in_dirs( 644 subdir1, subdir2, fn, cb_data); 645 i1++; 646 i2++; 647}else if(!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { 648/* Both are references; ignore the one from dir1. */ 649 retval =fn(e2, cb_data); 650 i1++; 651 i2++; 652}else{ 653die("conflict between reference and directory:%s", 654 e1->name); 655} 656}else{ 657struct ref_entry *e; 658if(cmp <0) { 659 e = e1; 660 i1++; 661}else{ 662 e = e2; 663 i2++; 664} 665if(e->flag & REF_DIR) { 666struct ref_dir *subdir =get_ref_dir(e); 667sort_ref_dir(subdir); 668 retval =do_for_each_entry_in_dir( 669 subdir,0, fn, cb_data); 670}else{ 671 retval =fn(e, cb_data); 672} 673} 674if(retval) 675return retval; 676} 677} 678 679/* 680 * Load all of the refs from the dir into our in-memory cache. The hard work 681 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 682 * through all of the sub-directories. We do not even need to care about 683 * sorting, as traversal order does not matter to us. 684 */ 685static voidprime_ref_dir(struct ref_dir *dir) 686{ 687int i; 688for(i =0; i < dir->nr; i++) { 689struct ref_entry *entry = dir->entries[i]; 690if(entry->flag & REF_DIR) 691prime_ref_dir(get_ref_dir(entry)); 692} 693} 694 695struct nonmatching_ref_data { 696const struct string_list *skip; 697const char*conflicting_refname; 698}; 699 700static intnonmatching_ref_fn(struct ref_entry *entry,void*vdata) 701{ 702struct nonmatching_ref_data *data = vdata; 703 704if(data->skip &&string_list_has_string(data->skip, entry->name)) 705return0; 706 707 data->conflicting_refname = entry->name; 708return1; 709} 710 711/* 712 * Return 0 if a reference named refname could be created without 713 * conflicting with the name of an existing reference in dir. 714 * See verify_refname_available for more information. 715 */ 716static intverify_refname_available_dir(const char*refname, 717const struct string_list *extras, 718const struct string_list *skip, 719struct ref_dir *dir, 720struct strbuf *err) 721{ 722const char*slash; 723const char*extra_refname; 724int pos; 725struct strbuf dirname = STRBUF_INIT; 726int ret = -1; 727 728/* 729 * For the sake of comments in this function, suppose that 730 * refname is "refs/foo/bar". 731 */ 732 733assert(err); 734 735strbuf_grow(&dirname,strlen(refname) +1); 736for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 737/* Expand dirname to the new prefix, not including the trailing slash: */ 738strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 739 740/* 741 * We are still at a leading dir of the refname (e.g., 742 * "refs/foo"; if there is a reference with that name, 743 * it is a conflict, *unless* it is in skip. 744 */ 745if(dir) { 746 pos =search_ref_dir(dir, dirname.buf, dirname.len); 747if(pos >=0&& 748(!skip || !string_list_has_string(skip, dirname.buf))) { 749/* 750 * We found a reference whose name is 751 * a proper prefix of refname; e.g., 752 * "refs/foo", and is not in skip. 753 */ 754strbuf_addf(err,"'%s' exists; cannot create '%s'", 755 dirname.buf, refname); 756goto cleanup; 757} 758} 759 760if(extras &&string_list_has_string(extras, dirname.buf) && 761(!skip || !string_list_has_string(skip, dirname.buf))) { 762strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 763 refname, dirname.buf); 764goto cleanup; 765} 766 767/* 768 * Otherwise, we can try to continue our search with 769 * the next component. So try to look up the 770 * directory, e.g., "refs/foo/". If we come up empty, 771 * we know there is nothing under this whole prefix, 772 * but even in that case we still have to continue the 773 * search for conflicts with extras. 774 */ 775strbuf_addch(&dirname,'/'); 776if(dir) { 777 pos =search_ref_dir(dir, dirname.buf, dirname.len); 778if(pos <0) { 779/* 780 * There was no directory "refs/foo/", 781 * so there is nothing under this 782 * whole prefix. So there is no need 783 * to continue looking for conflicting 784 * references. But we need to continue 785 * looking for conflicting extras. 786 */ 787 dir = NULL; 788}else{ 789 dir =get_ref_dir(dir->entries[pos]); 790} 791} 792} 793 794/* 795 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 796 * There is no point in searching for a reference with that 797 * name, because a refname isn't considered to conflict with 798 * itself. But we still need to check for references whose 799 * names are in the "refs/foo/bar/" namespace, because they 800 * *do* conflict. 801 */ 802strbuf_addstr(&dirname, refname + dirname.len); 803strbuf_addch(&dirname,'/'); 804 805if(dir) { 806 pos =search_ref_dir(dir, dirname.buf, dirname.len); 807 808if(pos >=0) { 809/* 810 * We found a directory named "$refname/" 811 * (e.g., "refs/foo/bar/"). It is a problem 812 * iff it contains any ref that is not in 813 * "skip". 814 */ 815struct nonmatching_ref_data data; 816 817 data.skip = skip; 818 data.conflicting_refname = NULL; 819 dir =get_ref_dir(dir->entries[pos]); 820sort_ref_dir(dir); 821if(do_for_each_entry_in_dir(dir,0, nonmatching_ref_fn, &data)) { 822strbuf_addf(err,"'%s' exists; cannot create '%s'", 823 data.conflicting_refname, refname); 824goto cleanup; 825} 826} 827} 828 829 extra_refname =find_descendant_ref(dirname.buf, extras, skip); 830if(extra_refname) 831strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 832 refname, extra_refname); 833else 834 ret =0; 835 836cleanup: 837strbuf_release(&dirname); 838return ret; 839} 840 841struct packed_ref_cache { 842struct ref_entry *root; 843 844/* 845 * Count of references to the data structure in this instance, 846 * including the pointer from ref_cache::packed if any. The 847 * data will not be freed as long as the reference count is 848 * nonzero. 849 */ 850unsigned int referrers; 851 852/* 853 * Iff the packed-refs file associated with this instance is 854 * currently locked for writing, this points at the associated 855 * lock (which is owned by somebody else). The referrer count 856 * is also incremented when the file is locked and decremented 857 * when it is unlocked. 858 */ 859struct lock_file *lock; 860 861/* The metadata from when this packed-refs cache was read */ 862struct stat_validity validity; 863}; 864 865/* 866 * Future: need to be in "struct repository" 867 * when doing a full libification. 868 */ 869static struct ref_cache { 870struct ref_cache *next; 871struct ref_entry *loose; 872struct packed_ref_cache *packed; 873/* 874 * The submodule name, or "" for the main repo. We allocate 875 * length 1 rather than FLEX_ARRAY so that the main ref_cache 876 * is initialized correctly. 877 */ 878char name[1]; 879} ref_cache, *submodule_ref_caches; 880 881/* Lock used for the main packed-refs file: */ 882static struct lock_file packlock; 883 884/* 885 * Increment the reference count of *packed_refs. 886 */ 887static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 888{ 889 packed_refs->referrers++; 890} 891 892/* 893 * Decrease the reference count of *packed_refs. If it goes to zero, 894 * free *packed_refs and return true; otherwise return false. 895 */ 896static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs) 897{ 898if(!--packed_refs->referrers) { 899free_ref_entry(packed_refs->root); 900stat_validity_clear(&packed_refs->validity); 901free(packed_refs); 902return1; 903}else{ 904return0; 905} 906} 907 908static voidclear_packed_ref_cache(struct ref_cache *refs) 909{ 910if(refs->packed) { 911struct packed_ref_cache *packed_refs = refs->packed; 912 913if(packed_refs->lock) 914die("internal error: packed-ref cache cleared while locked"); 915 refs->packed = NULL; 916release_packed_ref_cache(packed_refs); 917} 918} 919 920static voidclear_loose_ref_cache(struct ref_cache *refs) 921{ 922if(refs->loose) { 923free_ref_entry(refs->loose); 924 refs->loose = NULL; 925} 926} 927 928/* 929 * Create a new submodule ref cache and add it to the internal 930 * set of caches. 931 */ 932static struct ref_cache *create_ref_cache(const char*submodule) 933{ 934struct ref_cache *refs; 935if(!submodule) 936 submodule =""; 937FLEX_ALLOC_STR(refs, name, submodule); 938 refs->next = submodule_ref_caches; 939 submodule_ref_caches = refs; 940return refs; 941} 942 943static struct ref_cache *lookup_ref_cache(const char*submodule) 944{ 945struct ref_cache *refs; 946 947if(!submodule || !*submodule) 948return&ref_cache; 949 950for(refs = submodule_ref_caches; refs; refs = refs->next) 951if(!strcmp(submodule, refs->name)) 952return refs; 953return NULL; 954} 955 956/* 957 * Return a pointer to a ref_cache for the specified submodule. For 958 * the main repository, use submodule==NULL. The returned structure 959 * will be allocated and initialized but not necessarily populated; it 960 * should not be freed. 961 */ 962static struct ref_cache *get_ref_cache(const char*submodule) 963{ 964struct ref_cache *refs =lookup_ref_cache(submodule); 965if(!refs) 966 refs =create_ref_cache(submodule); 967return refs; 968} 969 970/* The length of a peeled reference line in packed-refs, including EOL: */ 971#define PEELED_LINE_LENGTH 42 972 973/* 974 * The packed-refs header line that we write out. Perhaps other 975 * traits will be added later. The trailing space is required. 976 */ 977static const char PACKED_REFS_HEADER[] = 978"# pack-refs with: peeled fully-peeled\n"; 979 980/* 981 * Parse one line from a packed-refs file. Write the SHA1 to sha1. 982 * Return a pointer to the refname within the line (null-terminated), 983 * or NULL if there was a problem. 984 */ 985static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1) 986{ 987const char*ref; 988 989/* 990 * 42: the answer to everything. 991 * 992 * In this case, it happens to be the answer to 993 * 40 (length of sha1 hex representation) 994 * +1 (space in between hex and name) 995 * +1 (newline at the end of the line) 996 */ 997if(line->len <=42) 998return NULL; 9991000if(get_sha1_hex(line->buf, sha1) <0)1001return NULL;1002if(!isspace(line->buf[40]))1003return NULL;10041005 ref = line->buf +41;1006if(isspace(*ref))1007return NULL;10081009if(line->buf[line->len -1] !='\n')1010return NULL;1011 line->buf[--line->len] =0;10121013return ref;1014}10151016/*1017 * Read f, which is a packed-refs file, into dir.1018 *1019 * A comment line of the form "# pack-refs with: " may contain zero or1020 * more traits. We interpret the traits as follows:1021 *1022 * No traits:1023 *1024 * Probably no references are peeled. But if the file contains a1025 * peeled value for a reference, we will use it.1026 *1027 * peeled:1028 *1029 * References under "refs/tags/", if they *can* be peeled, *are*1030 * peeled in this file. References outside of "refs/tags/" are1031 * probably not peeled even if they could have been, but if we find1032 * a peeled value for such a reference we will use it.1033 *1034 * fully-peeled:1035 *1036 * All references in the file that can be peeled are peeled.1037 * Inversely (and this is more important), any references in the1038 * file for which no peeled value is recorded is not peelable. This1039 * trait should typically be written alongside "peeled" for1040 * compatibility with older clients, but we do not require it1041 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1042 */1043static voidread_packed_refs(FILE*f,struct ref_dir *dir)1044{1045struct ref_entry *last = NULL;1046struct strbuf line = STRBUF_INIT;1047enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;10481049while(strbuf_getwholeline(&line, f,'\n') != EOF) {1050unsigned char sha1[20];1051const char*refname;1052const char*traits;10531054if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1055if(strstr(traits," fully-peeled "))1056 peeled = PEELED_FULLY;1057else if(strstr(traits," peeled "))1058 peeled = PEELED_TAGS;1059/* perhaps other traits later as well */1060continue;1061}10621063 refname =parse_ref_line(&line, sha1);1064if(refname) {1065int flag = REF_ISPACKED;10661067if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1068if(!refname_is_safe(refname))1069die("packed refname is dangerous:%s", refname);1070hashclr(sha1);1071 flag |= REF_BAD_NAME | REF_ISBROKEN;1072}1073 last =create_ref_entry(refname, sha1, flag,0);1074if(peeled == PEELED_FULLY ||1075(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1076 last->flag |= REF_KNOWS_PEELED;1077add_ref(dir, last);1078continue;1079}1080if(last &&1081 line.buf[0] =='^'&&1082 line.len == PEELED_LINE_LENGTH &&1083 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1084!get_sha1_hex(line.buf +1, sha1)) {1085hashcpy(last->u.value.peeled.hash, sha1);1086/*1087 * Regardless of what the file header said,1088 * we definitely know the value of *this*1089 * reference:1090 */1091 last->flag |= REF_KNOWS_PEELED;1092}1093}10941095strbuf_release(&line);1096}10971098/*1099 * Get the packed_ref_cache for the specified ref_cache, creating it1100 * if necessary.1101 */1102static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1103{1104char*packed_refs_file;11051106if(*refs->name)1107 packed_refs_file =git_pathdup_submodule(refs->name,"packed-refs");1108else1109 packed_refs_file =git_pathdup("packed-refs");11101111if(refs->packed &&1112!stat_validity_check(&refs->packed->validity, packed_refs_file))1113clear_packed_ref_cache(refs);11141115if(!refs->packed) {1116FILE*f;11171118 refs->packed =xcalloc(1,sizeof(*refs->packed));1119acquire_packed_ref_cache(refs->packed);1120 refs->packed->root =create_dir_entry(refs,"",0,0);1121 f =fopen(packed_refs_file,"r");1122if(f) {1123stat_validity_update(&refs->packed->validity,fileno(f));1124read_packed_refs(f,get_ref_dir(refs->packed->root));1125fclose(f);1126}1127}1128free(packed_refs_file);1129return refs->packed;1130}11311132static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1133{1134returnget_ref_dir(packed_ref_cache->root);1135}11361137static struct ref_dir *get_packed_refs(struct ref_cache *refs)1138{1139returnget_packed_ref_dir(get_packed_ref_cache(refs));1140}11411142/*1143 * Add a reference to the in-memory packed reference cache. This may1144 * only be called while the packed-refs file is locked (see1145 * lock_packed_refs()). To actually write the packed-refs file, call1146 * commit_packed_refs().1147 */1148static voidadd_packed_ref(const char*refname,const unsigned char*sha1)1149{1150struct packed_ref_cache *packed_ref_cache =1151get_packed_ref_cache(&ref_cache);11521153if(!packed_ref_cache->lock)1154die("internal error: packed refs not locked");1155add_ref(get_packed_ref_dir(packed_ref_cache),1156create_ref_entry(refname, sha1, REF_ISPACKED,1));1157}11581159/*1160 * Read the loose references from the namespace dirname into dir1161 * (without recursing). dirname must end with '/'. dir must be the1162 * directory entry corresponding to dirname.1163 */1164static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1165{1166struct ref_cache *refs = dir->ref_cache;1167DIR*d;1168struct dirent *de;1169int dirnamelen =strlen(dirname);1170struct strbuf refname;1171struct strbuf path = STRBUF_INIT;1172size_t path_baselen;11731174if(*refs->name)1175strbuf_git_path_submodule(&path, refs->name,"%s", dirname);1176else1177strbuf_git_path(&path,"%s", dirname);1178 path_baselen = path.len;11791180 d =opendir(path.buf);1181if(!d) {1182strbuf_release(&path);1183return;1184}11851186strbuf_init(&refname, dirnamelen +257);1187strbuf_add(&refname, dirname, dirnamelen);11881189while((de =readdir(d)) != NULL) {1190unsigned char sha1[20];1191struct stat st;1192int flag;11931194if(de->d_name[0] =='.')1195continue;1196if(ends_with(de->d_name,".lock"))1197continue;1198strbuf_addstr(&refname, de->d_name);1199strbuf_addstr(&path, de->d_name);1200if(stat(path.buf, &st) <0) {1201;/* silently ignore */1202}else if(S_ISDIR(st.st_mode)) {1203strbuf_addch(&refname,'/');1204add_entry_to_dir(dir,1205create_dir_entry(refs, refname.buf,1206 refname.len,1));1207}else{1208int read_ok;12091210if(*refs->name) {1211hashclr(sha1);1212 flag =0;1213 read_ok = !resolve_gitlink_ref(refs->name,1214 refname.buf, sha1);1215}else{1216 read_ok = !read_ref_full(refname.buf,1217 RESOLVE_REF_READING,1218 sha1, &flag);1219}12201221if(!read_ok) {1222hashclr(sha1);1223 flag |= REF_ISBROKEN;1224}else if(is_null_sha1(sha1)) {1225/*1226 * It is so astronomically unlikely1227 * that NULL_SHA1 is the SHA-1 of an1228 * actual object that we consider its1229 * appearance in a loose reference1230 * file to be repo corruption1231 * (probably due to a software bug).1232 */1233 flag |= REF_ISBROKEN;1234}12351236if(check_refname_format(refname.buf,1237 REFNAME_ALLOW_ONELEVEL)) {1238if(!refname_is_safe(refname.buf))1239die("loose refname is dangerous:%s", refname.buf);1240hashclr(sha1);1241 flag |= REF_BAD_NAME | REF_ISBROKEN;1242}1243add_entry_to_dir(dir,1244create_ref_entry(refname.buf, sha1, flag,0));1245}1246strbuf_setlen(&refname, dirnamelen);1247strbuf_setlen(&path, path_baselen);1248}1249strbuf_release(&refname);1250strbuf_release(&path);1251closedir(d);1252}12531254static struct ref_dir *get_loose_refs(struct ref_cache *refs)1255{1256if(!refs->loose) {1257/*1258 * Mark the top-level directory complete because we1259 * are about to read the only subdirectory that can1260 * hold references:1261 */1262 refs->loose =create_dir_entry(refs,"",0,0);1263/*1264 * Create an incomplete entry for "refs/":1265 */1266add_entry_to_dir(get_ref_dir(refs->loose),1267create_dir_entry(refs,"refs/",5,1));1268}1269returnget_ref_dir(refs->loose);1270}12711272#define MAXREFLEN (1024)12731274/*1275 * Called by resolve_gitlink_ref_recursive() after it failed to read1276 * from the loose refs in ref_cache refs. Find <refname> in the1277 * packed-refs file for the submodule.1278 */1279static intresolve_gitlink_packed_ref(struct ref_cache *refs,1280const char*refname,unsigned char*sha1)1281{1282struct ref_entry *ref;1283struct ref_dir *dir =get_packed_refs(refs);12841285 ref =find_ref(dir, refname);1286if(ref == NULL)1287return-1;12881289hashcpy(sha1, ref->u.value.oid.hash);1290return0;1291}12921293static intresolve_gitlink_ref_recursive(struct ref_cache *refs,1294const char*refname,unsigned char*sha1,1295int recursion)1296{1297int fd, len;1298char buffer[128], *p;1299char*path;13001301if(recursion > SYMREF_MAXDEPTH ||strlen(refname) > MAXREFLEN)1302return-1;1303 path = *refs->name1304?git_pathdup_submodule(refs->name,"%s", refname)1305:git_pathdup("%s", refname);1306 fd =open(path, O_RDONLY);1307free(path);1308if(fd <0)1309returnresolve_gitlink_packed_ref(refs, refname, sha1);13101311 len =read(fd, buffer,sizeof(buffer)-1);1312close(fd);1313if(len <0)1314return-1;1315while(len &&isspace(buffer[len-1]))1316 len--;1317 buffer[len] =0;13181319/* Was it a detached head or an old-fashioned symlink? */1320if(!get_sha1_hex(buffer, sha1))1321return0;13221323/* Symref? */1324if(strncmp(buffer,"ref:",4))1325return-1;1326 p = buffer +4;1327while(isspace(*p))1328 p++;13291330returnresolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1331}13321333intresolve_gitlink_ref(const char*path,const char*refname,unsigned char*sha1)1334{1335int len =strlen(path), retval;1336struct strbuf submodule = STRBUF_INIT;1337struct ref_cache *refs;13381339while(len && path[len-1] =='/')1340 len--;1341if(!len)1342return-1;13431344strbuf_add(&submodule, path, len);1345 refs =lookup_ref_cache(submodule.buf);1346if(!refs) {1347if(!is_nonbare_repository_dir(&submodule)) {1348strbuf_release(&submodule);1349return-1;1350}1351 refs =create_ref_cache(submodule.buf);1352}1353strbuf_release(&submodule);13541355 retval =resolve_gitlink_ref_recursive(refs, refname, sha1,0);1356return retval;1357}13581359/*1360 * Return the ref_entry for the given refname from the packed1361 * references. If it does not exist, return NULL.1362 */1363static struct ref_entry *get_packed_ref(const char*refname)1364{1365returnfind_ref(get_packed_refs(&ref_cache), refname);1366}13671368/*1369 * A loose ref file doesn't exist; check for a packed ref.1370 */1371static intresolve_missing_loose_ref(const char*refname,1372unsigned char*sha1,1373unsigned int*flags)1374{1375struct ref_entry *entry;13761377/*1378 * The loose reference file does not exist; check for a packed1379 * reference.1380 */1381 entry =get_packed_ref(refname);1382if(entry) {1383hashcpy(sha1, entry->u.value.oid.hash);1384*flags |= REF_ISPACKED;1385return0;1386}1387/* refname is not a packed reference. */1388return-1;1389}13901391/*1392 * Read a raw ref from the filesystem or packed refs file.1393 *1394 * If the ref is a sha1, fill in sha1 and return 0.1395 *1396 * If the ref is symbolic, fill in *symref with the referrent1397 * (e.g. "refs/heads/master") and return 0. The caller is responsible1398 * for validating the referrent. Set REF_ISSYMREF in flags.1399 *1400 * If the ref doesn't exist, set errno to ENOENT and return -1.1401 *1402 * If the ref exists but is neither a symbolic ref nor a sha1, it is1403 * broken. Set REF_ISBROKEN in flags, set errno to EINVAL, and return1404 * -1.1405 *1406 * If there is another error reading the ref, set errno appropriately and1407 * return -1.1408 *1409 * Backend-specific flags might be set in flags as well, regardless of1410 * outcome.1411 *1412 * sb_path is workspace: the caller should allocate and free it.1413 *1414 * It is OK for refname to point into symref. In this case:1415 * - if the function succeeds with REF_ISSYMREF, symref will be1416 * overwritten and the memory pointed to by refname might be changed1417 * or even freed.1418 * - in all other cases, symref will be untouched, and therefore1419 * refname will still be valid and unchanged.1420 */1421intread_raw_ref(const char*refname,unsigned char*sha1,1422struct strbuf *symref,unsigned int*flags)1423{1424struct strbuf sb_contents = STRBUF_INIT;1425struct strbuf sb_path = STRBUF_INIT;1426const char*path;1427const char*buf;1428struct stat st;1429int fd;1430int ret = -1;1431int save_errno;14321433strbuf_reset(&sb_path);1434strbuf_git_path(&sb_path,"%s", refname);1435 path = sb_path.buf;14361437stat_ref:1438/*1439 * We might have to loop back here to avoid a race1440 * condition: first we lstat() the file, then we try1441 * to read it as a link or as a file. But if somebody1442 * changes the type of the file (file <-> directory1443 * <-> symlink) between the lstat() and reading, then1444 * we don't want to report that as an error but rather1445 * try again starting with the lstat().1446 */14471448if(lstat(path, &st) <0) {1449if(errno != ENOENT)1450goto out;1451if(resolve_missing_loose_ref(refname, sha1, flags)) {1452 errno = ENOENT;1453goto out;1454}1455 ret =0;1456goto out;1457}14581459/* Follow "normalized" - ie "refs/.." symlinks by hand */1460if(S_ISLNK(st.st_mode)) {1461strbuf_reset(&sb_contents);1462if(strbuf_readlink(&sb_contents, path,0) <0) {1463if(errno == ENOENT || errno == EINVAL)1464/* inconsistent with lstat; retry */1465goto stat_ref;1466else1467goto out;1468}1469if(starts_with(sb_contents.buf,"refs/") &&1470!check_refname_format(sb_contents.buf,0)) {1471strbuf_swap(&sb_contents, symref);1472*flags |= REF_ISSYMREF;1473 ret =0;1474goto out;1475}1476}14771478/* Is it a directory? */1479if(S_ISDIR(st.st_mode)) {1480 errno = EISDIR;1481goto out;1482}14831484/*1485 * Anything else, just open it and try to use it as1486 * a ref1487 */1488 fd =open(path, O_RDONLY);1489if(fd <0) {1490if(errno == ENOENT)1491/* inconsistent with lstat; retry */1492goto stat_ref;1493else1494goto out;1495}1496strbuf_reset(&sb_contents);1497if(strbuf_read(&sb_contents, fd,256) <0) {1498int save_errno = errno;1499close(fd);1500 errno = save_errno;1501goto out;1502}1503close(fd);1504strbuf_rtrim(&sb_contents);1505 buf = sb_contents.buf;1506if(starts_with(buf,"ref:")) {1507 buf +=4;1508while(isspace(*buf))1509 buf++;15101511strbuf_reset(symref);1512strbuf_addstr(symref, buf);1513*flags |= REF_ISSYMREF;1514 ret =0;1515goto out;1516}15171518/*1519 * Please note that FETCH_HEAD has additional1520 * data after the sha.1521 */1522if(get_sha1_hex(buf, sha1) ||1523(buf[40] !='\0'&& !isspace(buf[40]))) {1524*flags |= REF_ISBROKEN;1525 errno = EINVAL;1526goto out;1527}15281529 ret =0;15301531out:1532 save_errno = errno;1533strbuf_release(&sb_path);1534strbuf_release(&sb_contents);1535 errno = save_errno;1536return ret;1537}15381539/*1540 * Peel the entry (if possible) and return its new peel_status. If1541 * repeel is true, re-peel the entry even if there is an old peeled1542 * value that is already stored in it.1543 *1544 * It is OK to call this function with a packed reference entry that1545 * might be stale and might even refer to an object that has since1546 * been garbage-collected. In such a case, if the entry has1547 * REF_KNOWS_PEELED then leave the status unchanged and return1548 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1549 */1550static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1551{1552enum peel_status status;15531554if(entry->flag & REF_KNOWS_PEELED) {1555if(repeel) {1556 entry->flag &= ~REF_KNOWS_PEELED;1557oidclr(&entry->u.value.peeled);1558}else{1559returnis_null_oid(&entry->u.value.peeled) ?1560 PEEL_NON_TAG : PEEL_PEELED;1561}1562}1563if(entry->flag & REF_ISBROKEN)1564return PEEL_BROKEN;1565if(entry->flag & REF_ISSYMREF)1566return PEEL_IS_SYMREF;15671568 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1569if(status == PEEL_PEELED || status == PEEL_NON_TAG)1570 entry->flag |= REF_KNOWS_PEELED;1571return status;1572}15731574intpeel_ref(const char*refname,unsigned char*sha1)1575{1576int flag;1577unsigned char base[20];15781579if(current_ref && (current_ref->name == refname1580|| !strcmp(current_ref->name, refname))) {1581if(peel_entry(current_ref,0))1582return-1;1583hashcpy(sha1, current_ref->u.value.peeled.hash);1584return0;1585}15861587if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1588return-1;15891590/*1591 * If the reference is packed, read its ref_entry from the1592 * cache in the hope that we already know its peeled value.1593 * We only try this optimization on packed references because1594 * (a) forcing the filling of the loose reference cache could1595 * be expensive and (b) loose references anyway usually do not1596 * have REF_KNOWS_PEELED.1597 */1598if(flag & REF_ISPACKED) {1599struct ref_entry *r =get_packed_ref(refname);1600if(r) {1601if(peel_entry(r,0))1602return-1;1603hashcpy(sha1, r->u.value.peeled.hash);1604return0;1605}1606}16071608returnpeel_object(base, sha1);1609}16101611/*1612 * Call fn for each reference in the specified ref_cache, omitting1613 * references not in the containing_dir of base. fn is called for all1614 * references, including broken ones. If fn ever returns a non-zero1615 * value, stop the iteration and return that value; otherwise, return1616 * 0.1617 */1618static intdo_for_each_entry(struct ref_cache *refs,const char*base,1619 each_ref_entry_fn fn,void*cb_data)1620{1621struct packed_ref_cache *packed_ref_cache;1622struct ref_dir *loose_dir;1623struct ref_dir *packed_dir;1624int retval =0;16251626/*1627 * We must make sure that all loose refs are read before accessing the1628 * packed-refs file; this avoids a race condition in which loose refs1629 * are migrated to the packed-refs file by a simultaneous process, but1630 * our in-memory view is from before the migration. get_packed_ref_cache()1631 * takes care of making sure our view is up to date with what is on1632 * disk.1633 */1634 loose_dir =get_loose_refs(refs);1635if(base && *base) {1636 loose_dir =find_containing_dir(loose_dir, base,0);1637}1638if(loose_dir)1639prime_ref_dir(loose_dir);16401641 packed_ref_cache =get_packed_ref_cache(refs);1642acquire_packed_ref_cache(packed_ref_cache);1643 packed_dir =get_packed_ref_dir(packed_ref_cache);1644if(base && *base) {1645 packed_dir =find_containing_dir(packed_dir, base,0);1646}16471648if(packed_dir && loose_dir) {1649sort_ref_dir(packed_dir);1650sort_ref_dir(loose_dir);1651 retval =do_for_each_entry_in_dirs(1652 packed_dir, loose_dir, fn, cb_data);1653}else if(packed_dir) {1654sort_ref_dir(packed_dir);1655 retval =do_for_each_entry_in_dir(1656 packed_dir,0, fn, cb_data);1657}else if(loose_dir) {1658sort_ref_dir(loose_dir);1659 retval =do_for_each_entry_in_dir(1660 loose_dir,0, fn, cb_data);1661}16621663release_packed_ref_cache(packed_ref_cache);1664return retval;1665}16661667/*1668 * Call fn for each reference in the specified ref_cache for which the1669 * refname begins with base. If trim is non-zero, then trim that many1670 * characters off the beginning of each refname before passing the1671 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include1672 * broken references in the iteration. If fn ever returns a non-zero1673 * value, stop the iteration and return that value; otherwise, return1674 * 0.1675 */1676intdo_for_each_ref(const char*submodule,const char*base,1677 each_ref_fn fn,int trim,int flags,void*cb_data)1678{1679struct ref_entry_cb data;1680struct ref_cache *refs;16811682 refs =get_ref_cache(submodule);1683 data.base = base;1684 data.trim = trim;1685 data.flags = flags;1686 data.fn = fn;1687 data.cb_data = cb_data;16881689if(ref_paranoia <0)1690 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1691if(ref_paranoia)1692 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;16931694returndo_for_each_entry(refs, base, do_one_ref, &data);1695}16961697static voidunlock_ref(struct ref_lock *lock)1698{1699/* Do not free lock->lk -- atexit() still looks at them */1700if(lock->lk)1701rollback_lock_file(lock->lk);1702free(lock->ref_name);1703free(lock->orig_ref_name);1704free(lock);1705}17061707/*1708 * Verify that the reference locked by lock has the value old_sha1.1709 * Fail if the reference doesn't exist and mustexist is set. Return 01710 * on success. On error, write an error message to err, set errno, and1711 * return a negative value.1712 */1713static intverify_lock(struct ref_lock *lock,1714const unsigned char*old_sha1,int mustexist,1715struct strbuf *err)1716{1717assert(err);17181719if(read_ref_full(lock->ref_name,1720 mustexist ? RESOLVE_REF_READING :0,1721 lock->old_oid.hash, NULL)) {1722if(old_sha1) {1723int save_errno = errno;1724strbuf_addf(err,"can't verify ref%s", lock->ref_name);1725 errno = save_errno;1726return-1;1727}else{1728hashclr(lock->old_oid.hash);1729return0;1730}1731}1732if(old_sha1 &&hashcmp(lock->old_oid.hash, old_sha1)) {1733strbuf_addf(err,"ref%sis at%sbut expected%s",1734 lock->ref_name,1735sha1_to_hex(lock->old_oid.hash),1736sha1_to_hex(old_sha1));1737 errno = EBUSY;1738return-1;1739}1740return0;1741}17421743static intremove_empty_directories(struct strbuf *path)1744{1745/*1746 * we want to create a file but there is a directory there;1747 * if that is an empty directory (or a directory that contains1748 * only empty directories), remove them.1749 */1750returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);1751}17521753/*1754 * Locks a ref returning the lock on success and NULL on failure.1755 * On failure errno is set to something meaningful.1756 */1757static struct ref_lock *lock_ref_sha1_basic(const char*refname,1758const unsigned char*old_sha1,1759const struct string_list *extras,1760const struct string_list *skip,1761unsigned int flags,int*type_p,1762struct strbuf *err)1763{1764struct strbuf ref_file = STRBUF_INIT;1765struct strbuf orig_ref_file = STRBUF_INIT;1766const char*orig_refname = refname;1767struct ref_lock *lock;1768int last_errno =0;1769int type;1770int lflags =0;1771int mustexist = (old_sha1 && !is_null_sha1(old_sha1));1772int resolve_flags =0;1773int attempts_remaining =3;17741775assert(err);17761777 lock =xcalloc(1,sizeof(struct ref_lock));17781779if(mustexist)1780 resolve_flags |= RESOLVE_REF_READING;1781if(flags & REF_DELETING)1782 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;1783if(flags & REF_NODEREF) {1784 resolve_flags |= RESOLVE_REF_NO_RECURSE;1785 lflags |= LOCK_NO_DEREF;1786}17871788 refname =resolve_ref_unsafe(refname, resolve_flags,1789 lock->old_oid.hash, &type);1790if(!refname && errno == EISDIR) {1791/*1792 * we are trying to lock foo but we used to1793 * have foo/bar which now does not exist;1794 * it is normal for the empty directory 'foo'1795 * to remain.1796 */1797strbuf_git_path(&orig_ref_file,"%s", orig_refname);1798if(remove_empty_directories(&orig_ref_file)) {1799 last_errno = errno;1800if(!verify_refname_available_dir(orig_refname, extras, skip,1801get_loose_refs(&ref_cache), err))1802strbuf_addf(err,"there are still refs under '%s'",1803 orig_refname);1804goto error_return;1805}1806 refname =resolve_ref_unsafe(orig_refname, resolve_flags,1807 lock->old_oid.hash, &type);1808}1809if(type_p)1810*type_p = type;1811if(!refname) {1812 last_errno = errno;1813if(last_errno != ENOTDIR ||1814!verify_refname_available_dir(orig_refname, extras, skip,1815get_loose_refs(&ref_cache), err))1816strbuf_addf(err,"unable to resolve reference%s:%s",1817 orig_refname,strerror(last_errno));18181819goto error_return;1820}18211822if(flags & REF_NODEREF)1823 refname = orig_refname;18241825/*1826 * If the ref did not exist and we are creating it, make sure1827 * there is no existing packed ref whose name begins with our1828 * refname, nor a packed ref whose name is a proper prefix of1829 * our refname.1830 */1831if(is_null_oid(&lock->old_oid) &&1832verify_refname_available_dir(refname, extras, skip,1833get_packed_refs(&ref_cache), err)) {1834 last_errno = ENOTDIR;1835goto error_return;1836}18371838 lock->lk =xcalloc(1,sizeof(struct lock_file));18391840 lock->ref_name =xstrdup(refname);1841 lock->orig_ref_name =xstrdup(orig_refname);1842strbuf_git_path(&ref_file,"%s", refname);18431844 retry:1845switch(safe_create_leading_directories_const(ref_file.buf)) {1846case SCLD_OK:1847break;/* success */1848case SCLD_VANISHED:1849if(--attempts_remaining >0)1850goto retry;1851/* fall through */1852default:1853 last_errno = errno;1854strbuf_addf(err,"unable to create directory for%s",1855 ref_file.buf);1856goto error_return;1857}18581859if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {1860 last_errno = errno;1861if(errno == ENOENT && --attempts_remaining >0)1862/*1863 * Maybe somebody just deleted one of the1864 * directories leading to ref_file. Try1865 * again:1866 */1867goto retry;1868else{1869unable_to_lock_message(ref_file.buf, errno, err);1870goto error_return;1871}1872}1873if(verify_lock(lock, old_sha1, mustexist, err)) {1874 last_errno = errno;1875goto error_return;1876}1877goto out;18781879 error_return:1880unlock_ref(lock);1881 lock = NULL;18821883 out:1884strbuf_release(&ref_file);1885strbuf_release(&orig_ref_file);1886 errno = last_errno;1887return lock;1888}18891890/*1891 * Write an entry to the packed-refs file for the specified refname.1892 * If peeled is non-NULL, write it as the entry's peeled value.1893 */1894static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,1895unsigned char*peeled)1896{1897fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);1898if(peeled)1899fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));1900}19011902/*1903 * An each_ref_entry_fn that writes the entry to a packed-refs file.1904 */1905static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)1906{1907enum peel_status peel_status =peel_entry(entry,0);19081909if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)1910error("internal error:%sis not a valid packed reference!",1911 entry->name);1912write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,1913 peel_status == PEEL_PEELED ?1914 entry->u.value.peeled.hash : NULL);1915return0;1916}19171918/*1919 * Lock the packed-refs file for writing. Flags is passed to1920 * hold_lock_file_for_update(). Return 0 on success. On errors, set1921 * errno appropriately and return a nonzero value.1922 */1923static intlock_packed_refs(int flags)1924{1925static int timeout_configured =0;1926static int timeout_value =1000;19271928struct packed_ref_cache *packed_ref_cache;19291930if(!timeout_configured) {1931git_config_get_int("core.packedrefstimeout", &timeout_value);1932 timeout_configured =1;1933}19341935if(hold_lock_file_for_update_timeout(1936&packlock,git_path("packed-refs"),1937 flags, timeout_value) <0)1938return-1;1939/*1940 * Get the current packed-refs while holding the lock. If the1941 * packed-refs file has been modified since we last read it,1942 * this will automatically invalidate the cache and re-read1943 * the packed-refs file.1944 */1945 packed_ref_cache =get_packed_ref_cache(&ref_cache);1946 packed_ref_cache->lock = &packlock;1947/* Increment the reference count to prevent it from being freed: */1948acquire_packed_ref_cache(packed_ref_cache);1949return0;1950}19511952/*1953 * Write the current version of the packed refs cache from memory to1954 * disk. The packed-refs file must already be locked for writing (see1955 * lock_packed_refs()). Return zero on success. On errors, set errno1956 * and return a nonzero value1957 */1958static intcommit_packed_refs(void)1959{1960struct packed_ref_cache *packed_ref_cache =1961get_packed_ref_cache(&ref_cache);1962int error =0;1963int save_errno =0;1964FILE*out;19651966if(!packed_ref_cache->lock)1967die("internal error: packed-refs not locked");19681969 out =fdopen_lock_file(packed_ref_cache->lock,"w");1970if(!out)1971die_errno("unable to fdopen packed-refs descriptor");19721973fprintf_or_die(out,"%s", PACKED_REFS_HEADER);1974do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),19750, write_packed_entry_fn, out);19761977if(commit_lock_file(packed_ref_cache->lock)) {1978 save_errno = errno;1979 error = -1;1980}1981 packed_ref_cache->lock = NULL;1982release_packed_ref_cache(packed_ref_cache);1983 errno = save_errno;1984return error;1985}19861987/*1988 * Rollback the lockfile for the packed-refs file, and discard the1989 * in-memory packed reference cache. (The packed-refs file will be1990 * read anew if it is needed again after this function is called.)1991 */1992static voidrollback_packed_refs(void)1993{1994struct packed_ref_cache *packed_ref_cache =1995get_packed_ref_cache(&ref_cache);19961997if(!packed_ref_cache->lock)1998die("internal error: packed-refs not locked");1999rollback_lock_file(packed_ref_cache->lock);2000 packed_ref_cache->lock = NULL;2001release_packed_ref_cache(packed_ref_cache);2002clear_packed_ref_cache(&ref_cache);2003}20042005struct ref_to_prune {2006struct ref_to_prune *next;2007unsigned char sha1[20];2008char name[FLEX_ARRAY];2009};20102011struct pack_refs_cb_data {2012unsigned int flags;2013struct ref_dir *packed_refs;2014struct ref_to_prune *ref_to_prune;2015};20162017/*2018 * An each_ref_entry_fn that is run over loose references only. If2019 * the loose reference can be packed, add an entry in the packed ref2020 * cache. If the reference should be pruned, also add it to2021 * ref_to_prune in the pack_refs_cb_data.2022 */2023static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2024{2025struct pack_refs_cb_data *cb = cb_data;2026enum peel_status peel_status;2027struct ref_entry *packed_entry;2028int is_tag_ref =starts_with(entry->name,"refs/tags/");20292030/* Do not pack per-worktree refs: */2031if(ref_type(entry->name) != REF_TYPE_NORMAL)2032return0;20332034/* ALWAYS pack tags */2035if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2036return0;20372038/* Do not pack symbolic or broken refs: */2039if((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2040return0;20412042/* Add a packed ref cache entry equivalent to the loose entry. */2043 peel_status =peel_entry(entry,1);2044if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2045die("internal error peeling reference%s(%s)",2046 entry->name,oid_to_hex(&entry->u.value.oid));2047 packed_entry =find_ref(cb->packed_refs, entry->name);2048if(packed_entry) {2049/* Overwrite existing packed entry with info from loose entry */2050 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2051oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2052}else{2053 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2054 REF_ISPACKED | REF_KNOWS_PEELED,0);2055add_ref(cb->packed_refs, packed_entry);2056}2057oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);20582059/* Schedule the loose reference for pruning if requested. */2060if((cb->flags & PACK_REFS_PRUNE)) {2061struct ref_to_prune *n;2062FLEX_ALLOC_STR(n, name, entry->name);2063hashcpy(n->sha1, entry->u.value.oid.hash);2064 n->next = cb->ref_to_prune;2065 cb->ref_to_prune = n;2066}2067return0;2068}20692070/*2071 * Remove empty parents, but spare refs/ and immediate subdirs.2072 * Note: munges *name.2073 */2074static voidtry_remove_empty_parents(char*name)2075{2076char*p, *q;2077int i;2078 p = name;2079for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2080while(*p && *p !='/')2081 p++;2082/* tolerate duplicate slashes; see check_refname_format() */2083while(*p =='/')2084 p++;2085}2086for(q = p; *q; q++)2087;2088while(1) {2089while(q > p && *q !='/')2090 q--;2091while(q > p && *(q-1) =='/')2092 q--;2093if(q == p)2094break;2095*q ='\0';2096if(rmdir(git_path("%s", name)))2097break;2098}2099}21002101/* make sure nobody touched the ref, and unlink */2102static voidprune_ref(struct ref_to_prune *r)2103{2104struct ref_transaction *transaction;2105struct strbuf err = STRBUF_INIT;21062107if(check_refname_format(r->name,0))2108return;21092110 transaction =ref_transaction_begin(&err);2111if(!transaction ||2112ref_transaction_delete(transaction, r->name, r->sha1,2113 REF_ISPRUNING, NULL, &err) ||2114ref_transaction_commit(transaction, &err)) {2115ref_transaction_free(transaction);2116error("%s", err.buf);2117strbuf_release(&err);2118return;2119}2120ref_transaction_free(transaction);2121strbuf_release(&err);2122try_remove_empty_parents(r->name);2123}21242125static voidprune_refs(struct ref_to_prune *r)2126{2127while(r) {2128prune_ref(r);2129 r = r->next;2130}2131}21322133intpack_refs(unsigned int flags)2134{2135struct pack_refs_cb_data cbdata;21362137memset(&cbdata,0,sizeof(cbdata));2138 cbdata.flags = flags;21392140lock_packed_refs(LOCK_DIE_ON_ERROR);2141 cbdata.packed_refs =get_packed_refs(&ref_cache);21422143do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2144 pack_if_possible_fn, &cbdata);21452146if(commit_packed_refs())2147die_errno("unable to overwrite old ref-pack file");21482149prune_refs(cbdata.ref_to_prune);2150return0;2151}21522153/*2154 * Rewrite the packed-refs file, omitting any refs listed in2155 * 'refnames'. On error, leave packed-refs unchanged, write an error2156 * message to 'err', and return a nonzero value.2157 *2158 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2159 */2160static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2161{2162struct ref_dir *packed;2163struct string_list_item *refname;2164int ret, needs_repacking =0, removed =0;21652166assert(err);21672168/* Look for a packed ref */2169for_each_string_list_item(refname, refnames) {2170if(get_packed_ref(refname->string)) {2171 needs_repacking =1;2172break;2173}2174}21752176/* Avoid locking if we have nothing to do */2177if(!needs_repacking)2178return0;/* no refname exists in packed refs */21792180if(lock_packed_refs(0)) {2181unable_to_lock_message(git_path("packed-refs"), errno, err);2182return-1;2183}2184 packed =get_packed_refs(&ref_cache);21852186/* Remove refnames from the cache */2187for_each_string_list_item(refname, refnames)2188if(remove_entry(packed, refname->string) != -1)2189 removed =1;2190if(!removed) {2191/*2192 * All packed entries disappeared while we were2193 * acquiring the lock.2194 */2195rollback_packed_refs();2196return0;2197}21982199/* Write what remains */2200 ret =commit_packed_refs();2201if(ret)2202strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2203strerror(errno));2204return ret;2205}22062207static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2208{2209assert(err);22102211if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2212/*2213 * loose. The loose file name is the same as the2214 * lockfile name, minus ".lock":2215 */2216char*loose_filename =get_locked_file_path(lock->lk);2217int res =unlink_or_msg(loose_filename, err);2218free(loose_filename);2219if(res)2220return1;2221}2222return0;2223}22242225intdelete_refs(struct string_list *refnames)2226{2227struct strbuf err = STRBUF_INIT;2228int i, result =0;22292230if(!refnames->nr)2231return0;22322233 result =repack_without_refs(refnames, &err);2234if(result) {2235/*2236 * If we failed to rewrite the packed-refs file, then2237 * it is unsafe to try to remove loose refs, because2238 * doing so might expose an obsolete packed value for2239 * a reference that might even point at an object that2240 * has been garbage collected.2241 */2242if(refnames->nr ==1)2243error(_("could not delete reference%s:%s"),2244 refnames->items[0].string, err.buf);2245else2246error(_("could not delete references:%s"), err.buf);22472248goto out;2249}22502251for(i =0; i < refnames->nr; i++) {2252const char*refname = refnames->items[i].string;22532254if(delete_ref(refname, NULL,0))2255 result |=error(_("could not remove reference%s"), refname);2256}22572258out:2259strbuf_release(&err);2260return result;2261}22622263/*2264 * People using contrib's git-new-workdir have .git/logs/refs ->2265 * /some/other/path/.git/logs/refs, and that may live on another device.2266 *2267 * IOW, to avoid cross device rename errors, the temporary renamed log must2268 * live into logs/refs.2269 */2270#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"22712272static intrename_tmp_log(const char*newrefname)2273{2274int attempts_remaining =4;2275struct strbuf path = STRBUF_INIT;2276int ret = -1;22772278 retry:2279strbuf_reset(&path);2280strbuf_git_path(&path,"logs/%s", newrefname);2281switch(safe_create_leading_directories_const(path.buf)) {2282case SCLD_OK:2283break;/* success */2284case SCLD_VANISHED:2285if(--attempts_remaining >0)2286goto retry;2287/* fall through */2288default:2289error("unable to create directory for%s", newrefname);2290goto out;2291}22922293if(rename(git_path(TMP_RENAMED_LOG), path.buf)) {2294if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2295/*2296 * rename(a, b) when b is an existing2297 * directory ought to result in ISDIR, but2298 * Solaris 5.8 gives ENOTDIR. Sheesh.2299 */2300if(remove_empty_directories(&path)) {2301error("Directory not empty: logs/%s", newrefname);2302goto out;2303}2304goto retry;2305}else if(errno == ENOENT && --attempts_remaining >0) {2306/*2307 * Maybe another process just deleted one of2308 * the directories in the path to newrefname.2309 * Try again from the beginning.2310 */2311goto retry;2312}else{2313error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2314 newrefname,strerror(errno));2315goto out;2316}2317}2318 ret =0;2319out:2320strbuf_release(&path);2321return ret;2322}23232324intverify_refname_available(const char*newname,2325struct string_list *extras,2326struct string_list *skip,2327struct strbuf *err)2328{2329struct ref_dir *packed_refs =get_packed_refs(&ref_cache);2330struct ref_dir *loose_refs =get_loose_refs(&ref_cache);23312332if(verify_refname_available_dir(newname, extras, skip,2333 packed_refs, err) ||2334verify_refname_available_dir(newname, extras, skip,2335 loose_refs, err))2336return-1;23372338return0;2339}23402341static intwrite_ref_to_lockfile(struct ref_lock *lock,2342const unsigned char*sha1,struct strbuf *err);2343static intcommit_ref_update(struct ref_lock *lock,2344const unsigned char*sha1,const char*logmsg,2345int flags,struct strbuf *err);23462347intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2348{2349unsigned char sha1[20], orig_sha1[20];2350int flag =0, logmoved =0;2351struct ref_lock *lock;2352struct stat loginfo;2353int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2354const char*symref = NULL;2355struct strbuf err = STRBUF_INIT;23562357if(log &&S_ISLNK(loginfo.st_mode))2358returnerror("reflog for%sis a symlink", oldrefname);23592360 symref =resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,2361 orig_sha1, &flag);2362if(flag & REF_ISSYMREF)2363returnerror("refname%sis a symbolic ref, renaming it is not supported",2364 oldrefname);2365if(!symref)2366returnerror("refname%snot found", oldrefname);23672368if(!rename_ref_available(oldrefname, newrefname))2369return1;23702371if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2372returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2373 oldrefname,strerror(errno));23742375if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2376error("unable to delete old%s", oldrefname);2377goto rollback;2378}23792380if(!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&2381delete_ref(newrefname, sha1, REF_NODEREF)) {2382if(errno==EISDIR) {2383struct strbuf path = STRBUF_INIT;2384int result;23852386strbuf_git_path(&path,"%s", newrefname);2387 result =remove_empty_directories(&path);2388strbuf_release(&path);23892390if(result) {2391error("Directory not empty:%s", newrefname);2392goto rollback;2393}2394}else{2395error("unable to delete existing%s", newrefname);2396goto rollback;2397}2398}23992400if(log &&rename_tmp_log(newrefname))2401goto rollback;24022403 logmoved = log;24042405 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL,0, NULL, &err);2406if(!lock) {2407error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);2408strbuf_release(&err);2409goto rollback;2410}2411hashcpy(lock->old_oid.hash, orig_sha1);24122413if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2414commit_ref_update(lock, orig_sha1, logmsg,0, &err)) {2415error("unable to write current sha1 into%s:%s", newrefname, err.buf);2416strbuf_release(&err);2417goto rollback;2418}24192420return0;24212422 rollback:2423 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL,0, NULL, &err);2424if(!lock) {2425error("unable to lock%sfor rollback:%s", oldrefname, err.buf);2426strbuf_release(&err);2427goto rollbacklog;2428}24292430 flag = log_all_ref_updates;2431 log_all_ref_updates =0;2432if(write_ref_to_lockfile(lock, orig_sha1, &err) ||2433commit_ref_update(lock, orig_sha1, NULL,0, &err)) {2434error("unable to write current sha1 into%s:%s", oldrefname, err.buf);2435strbuf_release(&err);2436}2437 log_all_ref_updates = flag;24382439 rollbacklog:2440if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2441error("unable to restore logfile%sfrom%s:%s",2442 oldrefname, newrefname,strerror(errno));2443if(!logmoved && log &&2444rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2445error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2446 oldrefname,strerror(errno));24472448return1;2449}24502451static intclose_ref(struct ref_lock *lock)2452{2453if(close_lock_file(lock->lk))2454return-1;2455return0;2456}24572458static intcommit_ref(struct ref_lock *lock)2459{2460if(commit_lock_file(lock->lk))2461return-1;2462return0;2463}24642465/*2466 * Create a reflog for a ref. If force_create = 0, the reflog will2467 * only be created for certain refs (those for which2468 * should_autocreate_reflog returns non-zero. Otherwise, create it2469 * regardless of the ref name. Fill in *err and return -1 on failure.2470 */2471static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)2472{2473int logfd, oflags = O_APPEND | O_WRONLY;24742475strbuf_git_path(logfile,"logs/%s", refname);2476if(force_create ||should_autocreate_reflog(refname)) {2477if(safe_create_leading_directories(logfile->buf) <0) {2478strbuf_addf(err,"unable to create directory for%s: "2479"%s", logfile->buf,strerror(errno));2480return-1;2481}2482 oflags |= O_CREAT;2483}24842485 logfd =open(logfile->buf, oflags,0666);2486if(logfd <0) {2487if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2488return0;24892490if(errno == EISDIR) {2491if(remove_empty_directories(logfile)) {2492strbuf_addf(err,"There are still logs under "2493"'%s'", logfile->buf);2494return-1;2495}2496 logfd =open(logfile->buf, oflags,0666);2497}24982499if(logfd <0) {2500strbuf_addf(err,"unable to append to%s:%s",2501 logfile->buf,strerror(errno));2502return-1;2503}2504}25052506adjust_shared_perm(logfile->buf);2507close(logfd);2508return0;2509}251025112512intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)2513{2514int ret;2515struct strbuf sb = STRBUF_INIT;25162517 ret =log_ref_setup(refname, &sb, err, force_create);2518strbuf_release(&sb);2519return ret;2520}25212522static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2523const unsigned char*new_sha1,2524const char*committer,const char*msg)2525{2526int msglen, written;2527unsigned maxlen, len;2528char*logrec;25292530 msglen = msg ?strlen(msg) :0;2531 maxlen =strlen(committer) + msglen +100;2532 logrec =xmalloc(maxlen);2533 len =xsnprintf(logrec, maxlen,"%s %s %s\n",2534sha1_to_hex(old_sha1),2535sha1_to_hex(new_sha1),2536 committer);2537if(msglen)2538 len +=copy_reflog_msg(logrec + len -1, msg) -1;25392540 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2541free(logrec);2542if(written != len)2543return-1;25442545return0;2546}25472548static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,2549const unsigned char*new_sha1,const char*msg,2550struct strbuf *logfile,int flags,2551struct strbuf *err)2552{2553int logfd, result, oflags = O_APPEND | O_WRONLY;25542555if(log_all_ref_updates <0)2556 log_all_ref_updates = !is_bare_repository();25572558 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);25592560if(result)2561return result;25622563 logfd =open(logfile->buf, oflags);2564if(logfd <0)2565return0;2566 result =log_ref_write_fd(logfd, old_sha1, new_sha1,2567git_committer_info(0), msg);2568if(result) {2569strbuf_addf(err,"unable to append to%s:%s", logfile->buf,2570strerror(errno));2571close(logfd);2572return-1;2573}2574if(close(logfd)) {2575strbuf_addf(err,"unable to append to%s:%s", logfile->buf,2576strerror(errno));2577return-1;2578}2579return0;2580}25812582static intlog_ref_write(const char*refname,const unsigned char*old_sha1,2583const unsigned char*new_sha1,const char*msg,2584int flags,struct strbuf *err)2585{2586returnfiles_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2587 err);2588}25892590intfiles_log_ref_write(const char*refname,const unsigned char*old_sha1,2591const unsigned char*new_sha1,const char*msg,2592int flags,struct strbuf *err)2593{2594struct strbuf sb = STRBUF_INIT;2595int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2596 err);2597strbuf_release(&sb);2598return ret;2599}26002601/*2602 * Write sha1 into the open lockfile, then close the lockfile. On2603 * errors, rollback the lockfile, fill in *err and2604 * return -1.2605 */2606static intwrite_ref_to_lockfile(struct ref_lock *lock,2607const unsigned char*sha1,struct strbuf *err)2608{2609static char term ='\n';2610struct object *o;2611int fd;26122613 o =parse_object(sha1);2614if(!o) {2615strbuf_addf(err,2616"Trying to write ref%swith nonexistent object%s",2617 lock->ref_name,sha1_to_hex(sha1));2618unlock_ref(lock);2619return-1;2620}2621if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {2622strbuf_addf(err,2623"Trying to write non-commit object%sto branch%s",2624sha1_to_hex(sha1), lock->ref_name);2625unlock_ref(lock);2626return-1;2627}2628 fd =get_lock_file_fd(lock->lk);2629if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||2630write_in_full(fd, &term,1) !=1||2631close_ref(lock) <0) {2632strbuf_addf(err,2633"Couldn't write%s",get_lock_file_path(lock->lk));2634unlock_ref(lock);2635return-1;2636}2637return0;2638}26392640/*2641 * Commit a change to a loose reference that has already been written2642 * to the loose reference lockfile. Also update the reflogs if2643 * necessary, using the specified lockmsg (which can be NULL).2644 */2645static intcommit_ref_update(struct ref_lock *lock,2646const unsigned char*sha1,const char*logmsg,2647int flags,struct strbuf *err)2648{2649clear_loose_ref_cache(&ref_cache);2650if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0||2651(strcmp(lock->ref_name, lock->orig_ref_name) &&2652log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0)) {2653char*old_msg =strbuf_detach(err, NULL);2654strbuf_addf(err,"Cannot update the ref '%s':%s",2655 lock->ref_name, old_msg);2656free(old_msg);2657unlock_ref(lock);2658return-1;2659}2660if(strcmp(lock->orig_ref_name,"HEAD") !=0) {2661/*2662 * Special hack: If a branch is updated directly and HEAD2663 * points to it (may happen on the remote side of a push2664 * for example) then logically the HEAD reflog should be2665 * updated too.2666 * A generic solution implies reverse symref information,2667 * but finding all symrefs pointing to the given branch2668 * would be rather costly for this rare event (the direct2669 * update of a branch) to be worth it. So let's cheat and2670 * check with HEAD only which should cover 99% of all usage2671 * scenarios (even 100% of the default ones).2672 */2673unsigned char head_sha1[20];2674int head_flag;2675const char*head_ref;2676 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,2677 head_sha1, &head_flag);2678if(head_ref && (head_flag & REF_ISSYMREF) &&2679!strcmp(head_ref, lock->ref_name)) {2680struct strbuf log_err = STRBUF_INIT;2681if(log_ref_write("HEAD", lock->old_oid.hash, sha1,2682 logmsg,0, &log_err)) {2683error("%s", log_err.buf);2684strbuf_release(&log_err);2685}2686}2687}2688if(commit_ref(lock)) {2689error("Couldn't set%s", lock->ref_name);2690unlock_ref(lock);2691return-1;2692}26932694unlock_ref(lock);2695return0;2696}26972698static intcreate_ref_symlink(struct ref_lock *lock,const char*target)2699{2700int ret = -1;2701#ifndef NO_SYMLINK_HEAD2702char*ref_path =get_locked_file_path(lock->lk);2703unlink(ref_path);2704 ret =symlink(target, ref_path);2705free(ref_path);27062707if(ret)2708fprintf(stderr,"no symlink - falling back to symbolic ref\n");2709#endif2710return ret;2711}27122713static voidupdate_symref_reflog(struct ref_lock *lock,const char*refname,2714const char*target,const char*logmsg)2715{2716struct strbuf err = STRBUF_INIT;2717unsigned char new_sha1[20];2718if(logmsg && !read_ref(target, new_sha1) &&2719log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg,0, &err)) {2720error("%s", err.buf);2721strbuf_release(&err);2722}2723}27242725static intcreate_symref_locked(struct ref_lock *lock,const char*refname,2726const char*target,const char*logmsg)2727{2728if(prefer_symlink_refs && !create_ref_symlink(lock, target)) {2729update_symref_reflog(lock, refname, target, logmsg);2730return0;2731}27322733if(!fdopen_lock_file(lock->lk,"w"))2734returnerror("unable to fdopen%s:%s",2735 lock->lk->tempfile.filename.buf,strerror(errno));27362737update_symref_reflog(lock, refname, target, logmsg);27382739/* no error check; commit_ref will check ferror */2740fprintf(lock->lk->tempfile.fp,"ref:%s\n", target);2741if(commit_ref(lock) <0)2742returnerror("unable to write symref for%s:%s", refname,2743strerror(errno));2744return0;2745}27462747intcreate_symref(const char*refname,const char*target,const char*logmsg)2748{2749struct strbuf err = STRBUF_INIT;2750struct ref_lock *lock;2751int ret;27522753 lock =lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,2754&err);2755if(!lock) {2756error("%s", err.buf);2757strbuf_release(&err);2758return-1;2759}27602761 ret =create_symref_locked(lock, refname, target, logmsg);2762unlock_ref(lock);2763return ret;2764}27652766intset_worktree_head_symref(const char*gitdir,const char*target)2767{2768static struct lock_file head_lock;2769struct ref_lock *lock;2770struct strbuf head_path = STRBUF_INIT;2771const char*head_rel;2772int ret;27732774strbuf_addf(&head_path,"%s/HEAD",absolute_path(gitdir));2775if(hold_lock_file_for_update(&head_lock, head_path.buf,2776 LOCK_NO_DEREF) <0) {2777struct strbuf err = STRBUF_INIT;2778unable_to_lock_message(head_path.buf, errno, &err);2779error("%s", err.buf);2780strbuf_release(&err);2781strbuf_release(&head_path);2782return-1;2783}27842785/* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for2786 linked trees */2787 head_rel =remove_leading_path(head_path.buf,2788absolute_path(get_git_common_dir()));2789/* to make use of create_symref_locked(), initialize ref_lock */2790 lock =xcalloc(1,sizeof(struct ref_lock));2791 lock->lk = &head_lock;2792 lock->ref_name =xstrdup(head_rel);2793 lock->orig_ref_name =xstrdup(head_rel);27942795 ret =create_symref_locked(lock, head_rel, target, NULL);27962797unlock_ref(lock);/* will free lock */2798strbuf_release(&head_path);2799return ret;2800}28012802intreflog_exists(const char*refname)2803{2804struct stat st;28052806return!lstat(git_path("logs/%s", refname), &st) &&2807S_ISREG(st.st_mode);2808}28092810intdelete_reflog(const char*refname)2811{2812returnremove_path(git_path("logs/%s", refname));2813}28142815static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)2816{2817unsigned char osha1[20], nsha1[20];2818char*email_end, *message;2819unsigned long timestamp;2820int tz;28212822/* old SP new SP name <email> SP time TAB msg LF */2823if(sb->len <83|| sb->buf[sb->len -1] !='\n'||2824get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||2825get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||2826!(email_end =strchr(sb->buf +82,'>')) ||2827 email_end[1] !=' '||2828!(timestamp =strtoul(email_end +2, &message,10)) ||2829!message || message[0] !=' '||2830(message[1] !='+'&& message[1] !='-') ||2831!isdigit(message[2]) || !isdigit(message[3]) ||2832!isdigit(message[4]) || !isdigit(message[5]))2833return0;/* corrupt? */2834 email_end[1] ='\0';2835 tz =strtol(message +1, NULL,10);2836if(message[6] !='\t')2837 message +=6;2838else2839 message +=7;2840returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);2841}28422843static char*find_beginning_of_line(char*bob,char*scan)2844{2845while(bob < scan && *(--scan) !='\n')2846;/* keep scanning backwards */2847/*2848 * Return either beginning of the buffer, or LF at the end of2849 * the previous line.2850 */2851return scan;2852}28532854intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)2855{2856struct strbuf sb = STRBUF_INIT;2857FILE*logfp;2858long pos;2859int ret =0, at_tail =1;28602861 logfp =fopen(git_path("logs/%s", refname),"r");2862if(!logfp)2863return-1;28642865/* Jump to the end */2866if(fseek(logfp,0, SEEK_END) <0)2867returnerror("cannot seek back reflog for%s:%s",2868 refname,strerror(errno));2869 pos =ftell(logfp);2870while(!ret &&0< pos) {2871int cnt;2872size_t nread;2873char buf[BUFSIZ];2874char*endp, *scanp;28752876/* Fill next block from the end */2877 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;2878if(fseek(logfp, pos - cnt, SEEK_SET))2879returnerror("cannot seek back reflog for%s:%s",2880 refname,strerror(errno));2881 nread =fread(buf, cnt,1, logfp);2882if(nread !=1)2883returnerror("cannot read%dbytes from reflog for%s:%s",2884 cnt, refname,strerror(errno));2885 pos -= cnt;28862887 scanp = endp = buf + cnt;2888if(at_tail && scanp[-1] =='\n')2889/* Looking at the final LF at the end of the file */2890 scanp--;2891 at_tail =0;28922893while(buf < scanp) {2894/*2895 * terminating LF of the previous line, or the beginning2896 * of the buffer.2897 */2898char*bp;28992900 bp =find_beginning_of_line(buf, scanp);29012902if(*bp =='\n') {2903/*2904 * The newline is the end of the previous line,2905 * so we know we have complete line starting2906 * at (bp + 1). Prefix it onto any prior data2907 * we collected for the line and process it.2908 */2909strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));2910 scanp = bp;2911 endp = bp +1;2912 ret =show_one_reflog_ent(&sb, fn, cb_data);2913strbuf_reset(&sb);2914if(ret)2915break;2916}else if(!pos) {2917/*2918 * We are at the start of the buffer, and the2919 * start of the file; there is no previous2920 * line, and we have everything for this one.2921 * Process it, and we can end the loop.2922 */2923strbuf_splice(&sb,0,0, buf, endp - buf);2924 ret =show_one_reflog_ent(&sb, fn, cb_data);2925strbuf_reset(&sb);2926break;2927}29282929if(bp == buf) {2930/*2931 * We are at the start of the buffer, and there2932 * is more file to read backwards. Which means2933 * we are in the middle of a line. Note that we2934 * may get here even if *bp was a newline; that2935 * just means we are at the exact end of the2936 * previous line, rather than some spot in the2937 * middle.2938 *2939 * Save away what we have to be combined with2940 * the data from the next read.2941 */2942strbuf_splice(&sb,0,0, buf, endp - buf);2943break;2944}2945}29462947}2948if(!ret && sb.len)2949die("BUG: reverse reflog parser had leftover data");29502951fclose(logfp);2952strbuf_release(&sb);2953return ret;2954}29552956intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)2957{2958FILE*logfp;2959struct strbuf sb = STRBUF_INIT;2960int ret =0;29612962 logfp =fopen(git_path("logs/%s", refname),"r");2963if(!logfp)2964return-1;29652966while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))2967 ret =show_one_reflog_ent(&sb, fn, cb_data);2968fclose(logfp);2969strbuf_release(&sb);2970return ret;2971}2972/*2973 * Call fn for each reflog in the namespace indicated by name. name2974 * must be empty or end with '/'. Name will be used as a scratch2975 * space, but its contents will be restored before return.2976 */2977static intdo_for_each_reflog(struct strbuf *name, each_ref_fn fn,void*cb_data)2978{2979DIR*d =opendir(git_path("logs/%s", name->buf));2980int retval =0;2981struct dirent *de;2982int oldlen = name->len;29832984if(!d)2985return name->len ? errno :0;29862987while((de =readdir(d)) != NULL) {2988struct stat st;29892990if(de->d_name[0] =='.')2991continue;2992if(ends_with(de->d_name,".lock"))2993continue;2994strbuf_addstr(name, de->d_name);2995if(stat(git_path("logs/%s", name->buf), &st) <0) {2996;/* silently ignore */2997}else{2998if(S_ISDIR(st.st_mode)) {2999strbuf_addch(name,'/');3000 retval =do_for_each_reflog(name, fn, cb_data);3001}else{3002struct object_id oid;30033004if(read_ref_full(name->buf,0, oid.hash, NULL))3005 retval =error("bad ref for%s", name->buf);3006else3007 retval =fn(name->buf, &oid,0, cb_data);3008}3009if(retval)3010break;3011}3012strbuf_setlen(name, oldlen);3013}3014closedir(d);3015return retval;3016}30173018intfor_each_reflog(each_ref_fn fn,void*cb_data)3019{3020int retval;3021struct strbuf name;3022strbuf_init(&name, PATH_MAX);3023 retval =do_for_each_reflog(&name, fn, cb_data);3024strbuf_release(&name);3025return retval;3026}30273028static intref_update_reject_duplicates(struct string_list *refnames,3029struct strbuf *err)3030{3031int i, n = refnames->nr;30323033assert(err);30343035for(i =1; i < n; i++)3036if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3037strbuf_addf(err,3038"Multiple updates for ref '%s' not allowed.",3039 refnames->items[i].string);3040return1;3041}3042return0;3043}30443045intref_transaction_commit(struct ref_transaction *transaction,3046struct strbuf *err)3047{3048int ret =0, i;3049int n = transaction->nr;3050struct ref_update **updates = transaction->updates;3051struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3052struct string_list_item *ref_to_delete;3053struct string_list affected_refnames = STRING_LIST_INIT_NODUP;30543055assert(err);30563057if(transaction->state != REF_TRANSACTION_OPEN)3058die("BUG: commit called for transaction that is not open");30593060if(!n) {3061 transaction->state = REF_TRANSACTION_CLOSED;3062return0;3063}30643065/* Fail if a refname appears more than once in the transaction: */3066for(i =0; i < n; i++)3067string_list_append(&affected_refnames, updates[i]->refname);3068string_list_sort(&affected_refnames);3069if(ref_update_reject_duplicates(&affected_refnames, err)) {3070 ret = TRANSACTION_GENERIC_ERROR;3071goto cleanup;3072}30733074/*3075 * Acquire all locks, verify old values if provided, check3076 * that new values are valid, and write new values to the3077 * lockfiles, ready to be activated. Only keep one lockfile3078 * open at a time to avoid running out of file descriptors.3079 */3080for(i =0; i < n; i++) {3081struct ref_update *update = updates[i];30823083if((update->flags & REF_HAVE_NEW) &&3084is_null_sha1(update->new_sha1))3085 update->flags |= REF_DELETING;3086 update->lock =lock_ref_sha1_basic(3087 update->refname,3088((update->flags & REF_HAVE_OLD) ?3089 update->old_sha1 : NULL),3090&affected_refnames, NULL,3091 update->flags,3092&update->type,3093 err);3094if(!update->lock) {3095char*reason;30963097 ret = (errno == ENOTDIR)3098? TRANSACTION_NAME_CONFLICT3099: TRANSACTION_GENERIC_ERROR;3100 reason =strbuf_detach(err, NULL);3101strbuf_addf(err,"cannot lock ref '%s':%s",3102 update->refname, reason);3103free(reason);3104goto cleanup;3105}3106if((update->flags & REF_HAVE_NEW) &&3107!(update->flags & REF_DELETING)) {3108int overwriting_symref = ((update->type & REF_ISSYMREF) &&3109(update->flags & REF_NODEREF));31103111if(!overwriting_symref &&3112!hashcmp(update->lock->old_oid.hash, update->new_sha1)) {3113/*3114 * The reference already has the desired3115 * value, so we don't need to write it.3116 */3117}else if(write_ref_to_lockfile(update->lock,3118 update->new_sha1,3119 err)) {3120char*write_err =strbuf_detach(err, NULL);31213122/*3123 * The lock was freed upon failure of3124 * write_ref_to_lockfile():3125 */3126 update->lock = NULL;3127strbuf_addf(err,3128"cannot update the ref '%s':%s",3129 update->refname, write_err);3130free(write_err);3131 ret = TRANSACTION_GENERIC_ERROR;3132goto cleanup;3133}else{3134 update->flags |= REF_NEEDS_COMMIT;3135}3136}3137if(!(update->flags & REF_NEEDS_COMMIT)) {3138/*3139 * We didn't have to write anything to the lockfile.3140 * Close it to free up the file descriptor:3141 */3142if(close_ref(update->lock)) {3143strbuf_addf(err,"Couldn't close%s.lock",3144 update->refname);3145goto cleanup;3146}3147}3148}31493150/* Perform updates first so live commits remain referenced */3151for(i =0; i < n; i++) {3152struct ref_update *update = updates[i];31533154if(update->flags & REF_NEEDS_COMMIT) {3155if(commit_ref_update(update->lock,3156 update->new_sha1, update->msg,3157 update->flags, err)) {3158/* freed by commit_ref_update(): */3159 update->lock = NULL;3160 ret = TRANSACTION_GENERIC_ERROR;3161goto cleanup;3162}else{3163/* freed by commit_ref_update(): */3164 update->lock = NULL;3165}3166}3167}31683169/* Perform deletes now that updates are safely completed */3170for(i =0; i < n; i++) {3171struct ref_update *update = updates[i];31723173if(update->flags & REF_DELETING) {3174if(delete_ref_loose(update->lock, update->type, err)) {3175 ret = TRANSACTION_GENERIC_ERROR;3176goto cleanup;3177}31783179if(!(update->flags & REF_ISPRUNING))3180string_list_append(&refs_to_delete,3181 update->lock->ref_name);3182}3183}31843185if(repack_without_refs(&refs_to_delete, err)) {3186 ret = TRANSACTION_GENERIC_ERROR;3187goto cleanup;3188}3189for_each_string_list_item(ref_to_delete, &refs_to_delete)3190unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3191clear_loose_ref_cache(&ref_cache);31923193cleanup:3194 transaction->state = REF_TRANSACTION_CLOSED;31953196for(i =0; i < n; i++)3197if(updates[i]->lock)3198unlock_ref(updates[i]->lock);3199string_list_clear(&refs_to_delete,0);3200string_list_clear(&affected_refnames,0);3201return ret;3202}32033204static intref_present(const char*refname,3205const struct object_id *oid,int flags,void*cb_data)3206{3207struct string_list *affected_refnames = cb_data;32083209returnstring_list_has_string(affected_refnames, refname);3210}32113212intinitial_ref_transaction_commit(struct ref_transaction *transaction,3213struct strbuf *err)3214{3215int ret =0, i;3216int n = transaction->nr;3217struct ref_update **updates = transaction->updates;3218struct string_list affected_refnames = STRING_LIST_INIT_NODUP;32193220assert(err);32213222if(transaction->state != REF_TRANSACTION_OPEN)3223die("BUG: commit called for transaction that is not open");32243225/* Fail if a refname appears more than once in the transaction: */3226for(i =0; i < n; i++)3227string_list_append(&affected_refnames, updates[i]->refname);3228string_list_sort(&affected_refnames);3229if(ref_update_reject_duplicates(&affected_refnames, err)) {3230 ret = TRANSACTION_GENERIC_ERROR;3231goto cleanup;3232}32333234/*3235 * It's really undefined to call this function in an active3236 * repository or when there are existing references: we are3237 * only locking and changing packed-refs, so (1) any3238 * simultaneous processes might try to change a reference at3239 * the same time we do, and (2) any existing loose versions of3240 * the references that we are setting would have precedence3241 * over our values. But some remote helpers create the remote3242 * "HEAD" and "master" branches before calling this function,3243 * so here we really only check that none of the references3244 * that we are creating already exists.3245 */3246if(for_each_rawref(ref_present, &affected_refnames))3247die("BUG: initial ref transaction called with existing refs");32483249for(i =0; i < n; i++) {3250struct ref_update *update = updates[i];32513252if((update->flags & REF_HAVE_OLD) &&3253!is_null_sha1(update->old_sha1))3254die("BUG: initial ref transaction with old_sha1 set");3255if(verify_refname_available(update->refname,3256&affected_refnames, NULL,3257 err)) {3258 ret = TRANSACTION_NAME_CONFLICT;3259goto cleanup;3260}3261}32623263if(lock_packed_refs(0)) {3264strbuf_addf(err,"unable to lock packed-refs file:%s",3265strerror(errno));3266 ret = TRANSACTION_GENERIC_ERROR;3267goto cleanup;3268}32693270for(i =0; i < n; i++) {3271struct ref_update *update = updates[i];32723273if((update->flags & REF_HAVE_NEW) &&3274!is_null_sha1(update->new_sha1))3275add_packed_ref(update->refname, update->new_sha1);3276}32773278if(commit_packed_refs()) {3279strbuf_addf(err,"unable to commit packed-refs file:%s",3280strerror(errno));3281 ret = TRANSACTION_GENERIC_ERROR;3282goto cleanup;3283}32843285cleanup:3286 transaction->state = REF_TRANSACTION_CLOSED;3287string_list_clear(&affected_refnames,0);3288return ret;3289}32903291struct expire_reflog_cb {3292unsigned int flags;3293 reflog_expiry_should_prune_fn *should_prune_fn;3294void*policy_cb;3295FILE*newlog;3296unsigned char last_kept_sha1[20];3297};32983299static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,3300const char*email,unsigned long timestamp,int tz,3301const char*message,void*cb_data)3302{3303struct expire_reflog_cb *cb = cb_data;3304struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;33053306if(cb->flags & EXPIRE_REFLOGS_REWRITE)3307 osha1 = cb->last_kept_sha1;33083309if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3310 message, policy_cb)) {3311if(!cb->newlog)3312printf("would prune%s", message);3313else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3314printf("prune%s", message);3315}else{3316if(cb->newlog) {3317fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",3318sha1_to_hex(osha1),sha1_to_hex(nsha1),3319 email, timestamp, tz, message);3320hashcpy(cb->last_kept_sha1, nsha1);3321}3322if(cb->flags & EXPIRE_REFLOGS_VERBOSE)3323printf("keep%s", message);3324}3325return0;3326}33273328intreflog_expire(const char*refname,const unsigned char*sha1,3329unsigned int flags,3330 reflog_expiry_prepare_fn prepare_fn,3331 reflog_expiry_should_prune_fn should_prune_fn,3332 reflog_expiry_cleanup_fn cleanup_fn,3333void*policy_cb_data)3334{3335static struct lock_file reflog_lock;3336struct expire_reflog_cb cb;3337struct ref_lock *lock;3338char*log_file;3339int status =0;3340int type;3341struct strbuf err = STRBUF_INIT;33423343memset(&cb,0,sizeof(cb));3344 cb.flags = flags;3345 cb.policy_cb = policy_cb_data;3346 cb.should_prune_fn = should_prune_fn;33473348/*3349 * The reflog file is locked by holding the lock on the3350 * reference itself, plus we might need to update the3351 * reference if --updateref was specified:3352 */3353 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,3354&type, &err);3355if(!lock) {3356error("cannot lock ref '%s':%s", refname, err.buf);3357strbuf_release(&err);3358return-1;3359}3360if(!reflog_exists(refname)) {3361unlock_ref(lock);3362return0;3363}33643365 log_file =git_pathdup("logs/%s", refname);3366if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3367/*3368 * Even though holding $GIT_DIR/logs/$reflog.lock has3369 * no locking implications, we use the lock_file3370 * machinery here anyway because it does a lot of the3371 * work we need, including cleaning up if the program3372 * exits unexpectedly.3373 */3374if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {3375struct strbuf err = STRBUF_INIT;3376unable_to_lock_message(log_file, errno, &err);3377error("%s", err.buf);3378strbuf_release(&err);3379goto failure;3380}3381 cb.newlog =fdopen_lock_file(&reflog_lock,"w");3382if(!cb.newlog) {3383error("cannot fdopen%s(%s)",3384get_lock_file_path(&reflog_lock),strerror(errno));3385goto failure;3386}3387}33883389(*prepare_fn)(refname, sha1, cb.policy_cb);3390for_each_reflog_ent(refname, expire_reflog_ent, &cb);3391(*cleanup_fn)(cb.policy_cb);33923393if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3394/*3395 * It doesn't make sense to adjust a reference pointed3396 * to by a symbolic ref based on expiring entries in3397 * the symbolic reference's reflog. Nor can we update3398 * a reference if there are no remaining reflog3399 * entries.3400 */3401int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&3402!(type & REF_ISSYMREF) &&3403!is_null_sha1(cb.last_kept_sha1);34043405if(close_lock_file(&reflog_lock)) {3406 status |=error("couldn't write%s:%s", log_file,3407strerror(errno));3408}else if(update &&3409(write_in_full(get_lock_file_fd(lock->lk),3410sha1_to_hex(cb.last_kept_sha1),40) !=40||3411write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||3412close_ref(lock) <0)) {3413 status |=error("couldn't write%s",3414get_lock_file_path(lock->lk));3415rollback_lock_file(&reflog_lock);3416}else if(commit_lock_file(&reflog_lock)) {3417 status |=error("unable to write reflog '%s' (%s)",3418 log_file,strerror(errno));3419}else if(update &&commit_ref(lock)) {3420 status |=error("couldn't set%s", lock->ref_name);3421}3422}3423free(log_file);3424unlock_ref(lock);3425return status;34263427 failure:3428rollback_lock_file(&reflog_lock);3429free(log_file);3430unlock_ref(lock);3431return-1;3432}