1#include"cache.h" 2#include"lockfile.h" 3#include"refs.h" 4#include"object.h" 5#include"tag.h" 6#include"dir.h" 7#include"string-list.h" 8 9struct ref_lock { 10char*ref_name; 11char*orig_ref_name; 12struct lock_file *lk; 13struct object_id old_oid; 14}; 15 16/* 17 * How to handle various characters in refnames: 18 * 0: An acceptable character for refs 19 * 1: End-of-component 20 * 2: ., look for a preceding . to reject .. in refs 21 * 3: {, look for a preceding @ to reject @{ in refs 22 * 4: A bad character: ASCII control characters, and 23 * ":", "?", "[", "\", "^", "~", SP, or TAB 24 * 5: *, reject unless REFNAME_REFSPEC_PATTERN is set 25 */ 26static unsigned char refname_disposition[256] = { 271,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, 284,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, 294,0,0,0,0,0,0,0,0,0,5,0,0,0,2,1, 300,0,0,0,0,0,0,0,0,0,4,0,0,0,0,4, 310,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 320,0,0,0,0,0,0,0,0,0,0,4,4,0,4,0, 330,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 340,0,0,0,0,0,0,0,0,0,0,3,0,0,4,4 35}; 36 37/* 38 * Flag passed to lock_ref_sha1_basic() telling it to tolerate broken 39 * refs (i.e., because the reference is about to be deleted anyway). 40 */ 41#define REF_DELETING 0x02 42 43/* 44 * Used as a flag in ref_update::flags when a loose ref is being 45 * pruned. 46 */ 47#define REF_ISPRUNING 0x04 48 49/* 50 * Used as a flag in ref_update::flags when the reference should be 51 * updated to new_sha1. 52 */ 53#define REF_HAVE_NEW 0x08 54 55/* 56 * Used as a flag in ref_update::flags when old_sha1 should be 57 * checked. 58 */ 59#define REF_HAVE_OLD 0x10 60 61/* 62 * Used as a flag in ref_update::flags when the lockfile needs to be 63 * committed. 64 */ 65#define REF_NEEDS_COMMIT 0x20 66 67/* 68 * 0x40 is REF_FORCE_CREATE_REFLOG, so skip it if you're adding a 69 * value to ref_update::flags 70 */ 71 72/* 73 * Try to read one refname component from the front of refname. 74 * Return the length of the component found, or -1 if the component is 75 * not legal. It is legal if it is something reasonable to have under 76 * ".git/refs/"; We do not like it if: 77 * 78 * - any path component of it begins with ".", or 79 * - it has double dots "..", or 80 * - it has ASCII control characters, or 81 * - it has ":", "?", "[", "\", "^", "~", SP, or TAB anywhere, or 82 * - it has "*" anywhere unless REFNAME_REFSPEC_PATTERN is set, or 83 * - it ends with a "/", or 84 * - it ends with ".lock", or 85 * - it contains a "@{" portion 86 */ 87static intcheck_refname_component(const char*refname,int*flags) 88{ 89const char*cp; 90char last ='\0'; 91 92for(cp = refname; ; cp++) { 93int ch = *cp &255; 94unsigned char disp = refname_disposition[ch]; 95switch(disp) { 96case1: 97goto out; 98case2: 99if(last =='.') 100return-1;/* Refname contains "..". */ 101break; 102case3: 103if(last =='@') 104return-1;/* Refname contains "@{". */ 105break; 106case4: 107return-1; 108case5: 109if(!(*flags & REFNAME_REFSPEC_PATTERN)) 110return-1;/* refspec can't be a pattern */ 111 112/* 113 * Unset the pattern flag so that we only accept 114 * a single asterisk for one side of refspec. 115 */ 116*flags &= ~ REFNAME_REFSPEC_PATTERN; 117break; 118} 119 last = ch; 120} 121out: 122if(cp == refname) 123return0;/* Component has zero length. */ 124if(refname[0] =='.') 125return-1;/* Component starts with '.'. */ 126if(cp - refname >= LOCK_SUFFIX_LEN && 127!memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN)) 128return-1;/* Refname ends with ".lock". */ 129return cp - refname; 130} 131 132intcheck_refname_format(const char*refname,int flags) 133{ 134int component_len, component_count =0; 135 136if(!strcmp(refname,"@")) 137/* Refname is a single character '@'. */ 138return-1; 139 140while(1) { 141/* We are at the start of a path component. */ 142 component_len =check_refname_component(refname, &flags); 143if(component_len <=0) 144return-1; 145 146 component_count++; 147if(refname[component_len] =='\0') 148break; 149/* Skip to next component. */ 150 refname += component_len +1; 151} 152 153if(refname[component_len -1] =='.') 154return-1;/* Refname ends with '.'. */ 155if(!(flags & REFNAME_ALLOW_ONELEVEL) && component_count <2) 156return-1;/* Refname has only one component. */ 157return0; 158} 159 160struct ref_entry; 161 162/* 163 * Information used (along with the information in ref_entry) to 164 * describe a single cached reference. This data structure only 165 * occurs embedded in a union in struct ref_entry, and only when 166 * (ref_entry->flag & REF_DIR) is zero. 167 */ 168struct ref_value { 169/* 170 * The name of the object to which this reference resolves 171 * (which may be a tag object). If REF_ISBROKEN, this is 172 * null. If REF_ISSYMREF, then this is the name of the object 173 * referred to by the last reference in the symlink chain. 174 */ 175struct object_id oid; 176 177/* 178 * If REF_KNOWS_PEELED, then this field holds the peeled value 179 * of this reference, or null if the reference is known not to 180 * be peelable. See the documentation for peel_ref() for an 181 * exact definition of "peelable". 182 */ 183struct object_id peeled; 184}; 185 186struct ref_cache; 187 188/* 189 * Information used (along with the information in ref_entry) to 190 * describe a level in the hierarchy of references. This data 191 * structure only occurs embedded in a union in struct ref_entry, and 192 * only when (ref_entry.flag & REF_DIR) is set. In that case, 193 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 194 * in the directory have already been read: 195 * 196 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 197 * or packed references, already read. 198 * 199 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 200 * references that hasn't been read yet (nor has any of its 201 * subdirectories). 202 * 203 * Entries within a directory are stored within a growable array of 204 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 205 * sorted are sorted by their component name in strcmp() order and the 206 * remaining entries are unsorted. 207 * 208 * Loose references are read lazily, one directory at a time. When a 209 * directory of loose references is read, then all of the references 210 * in that directory are stored, and REF_INCOMPLETE stubs are created 211 * for any subdirectories, but the subdirectories themselves are not 212 * read. The reading is triggered by get_ref_dir(). 213 */ 214struct ref_dir { 215int nr, alloc; 216 217/* 218 * Entries with index 0 <= i < sorted are sorted by name. New 219 * entries are appended to the list unsorted, and are sorted 220 * only when required; thus we avoid the need to sort the list 221 * after the addition of every reference. 222 */ 223int sorted; 224 225/* A pointer to the ref_cache that contains this ref_dir. */ 226struct ref_cache *ref_cache; 227 228struct ref_entry **entries; 229}; 230 231/* 232 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 233 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 234 * public values; see refs.h. 235 */ 236 237/* 238 * The field ref_entry->u.value.peeled of this value entry contains 239 * the correct peeled value for the reference, which might be 240 * null_sha1 if the reference is not a tag or if it is broken. 241 */ 242#define REF_KNOWS_PEELED 0x10 243 244/* ref_entry represents a directory of references */ 245#define REF_DIR 0x20 246 247/* 248 * Entry has not yet been read from disk (used only for REF_DIR 249 * entries representing loose references) 250 */ 251#define REF_INCOMPLETE 0x40 252 253/* 254 * A ref_entry represents either a reference or a "subdirectory" of 255 * references. 256 * 257 * Each directory in the reference namespace is represented by a 258 * ref_entry with (flags & REF_DIR) set and containing a subdir member 259 * that holds the entries in that directory that have been read so 260 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 261 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 262 * used for loose reference directories. 263 * 264 * References are represented by a ref_entry with (flags & REF_DIR) 265 * unset and a value member that describes the reference's value. The 266 * flag member is at the ref_entry level, but it is also needed to 267 * interpret the contents of the value field (in other words, a 268 * ref_value object is not very much use without the enclosing 269 * ref_entry). 270 * 271 * Reference names cannot end with slash and directories' names are 272 * always stored with a trailing slash (except for the top-level 273 * directory, which is always denoted by ""). This has two nice 274 * consequences: (1) when the entries in each subdir are sorted 275 * lexicographically by name (as they usually are), the references in 276 * a whole tree can be generated in lexicographic order by traversing 277 * the tree in left-to-right, depth-first order; (2) the names of 278 * references and subdirectories cannot conflict, and therefore the 279 * presence of an empty subdirectory does not block the creation of a 280 * similarly-named reference. (The fact that reference names with the 281 * same leading components can conflict *with each other* is a 282 * separate issue that is regulated by verify_refname_available().) 283 * 284 * Please note that the name field contains the fully-qualified 285 * reference (or subdirectory) name. Space could be saved by only 286 * storing the relative names. But that would require the full names 287 * to be generated on the fly when iterating in do_for_each_ref(), and 288 * would break callback functions, who have always been able to assume 289 * that the name strings that they are passed will not be freed during 290 * the iteration. 291 */ 292struct ref_entry { 293unsigned char flag;/* ISSYMREF? ISPACKED? */ 294union{ 295struct ref_value value;/* if not (flags&REF_DIR) */ 296struct ref_dir subdir;/* if (flags&REF_DIR) */ 297} u; 298/* 299 * The full name of the reference (e.g., "refs/heads/master") 300 * or the full name of the directory with a trailing slash 301 * (e.g., "refs/heads/"): 302 */ 303char name[FLEX_ARRAY]; 304}; 305 306static voidread_loose_refs(const char*dirname,struct ref_dir *dir); 307 308static struct ref_dir *get_ref_dir(struct ref_entry *entry) 309{ 310struct ref_dir *dir; 311assert(entry->flag & REF_DIR); 312 dir = &entry->u.subdir; 313if(entry->flag & REF_INCOMPLETE) { 314read_loose_refs(entry->name, dir); 315 entry->flag &= ~REF_INCOMPLETE; 316} 317return dir; 318} 319 320/* 321 * Check if a refname is safe. 322 * For refs that start with "refs/" we consider it safe as long they do 323 * not try to resolve to outside of refs/. 324 * 325 * For all other refs we only consider them safe iff they only contain 326 * upper case characters and '_' (like "HEAD" AND "MERGE_HEAD", and not like 327 * "config"). 328 */ 329static intrefname_is_safe(const char*refname) 330{ 331if(starts_with(refname,"refs/")) { 332char*buf; 333int result; 334 335 buf =xmalloc(strlen(refname) +1); 336/* 337 * Does the refname try to escape refs/? 338 * For example: refs/foo/../bar is safe but refs/foo/../../bar 339 * is not. 340 */ 341 result = !normalize_path_copy(buf, refname +strlen("refs/")); 342free(buf); 343return result; 344} 345while(*refname) { 346if(!isupper(*refname) && *refname !='_') 347return0; 348 refname++; 349} 350return1; 351} 352 353static struct ref_entry *create_ref_entry(const char*refname, 354const unsigned char*sha1,int flag, 355int check_name) 356{ 357int len; 358struct ref_entry *ref; 359 360if(check_name && 361check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 362die("Reference has invalid format: '%s'", refname); 363 len =strlen(refname) +1; 364 ref =xmalloc(sizeof(struct ref_entry) + len); 365hashcpy(ref->u.value.oid.hash, sha1); 366oidclr(&ref->u.value.peeled); 367memcpy(ref->name, refname, len); 368 ref->flag = flag; 369return ref; 370} 371 372static voidclear_ref_dir(struct ref_dir *dir); 373 374static voidfree_ref_entry(struct ref_entry *entry) 375{ 376if(entry->flag & REF_DIR) { 377/* 378 * Do not use get_ref_dir() here, as that might 379 * trigger the reading of loose refs. 380 */ 381clear_ref_dir(&entry->u.subdir); 382} 383free(entry); 384} 385 386/* 387 * Add a ref_entry to the end of dir (unsorted). Entry is always 388 * stored directly in dir; no recursion into subdirectories is 389 * done. 390 */ 391static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry) 392{ 393ALLOC_GROW(dir->entries, dir->nr +1, dir->alloc); 394 dir->entries[dir->nr++] = entry; 395/* optimize for the case that entries are added in order */ 396if(dir->nr ==1|| 397(dir->nr == dir->sorted +1&& 398strcmp(dir->entries[dir->nr -2]->name, 399 dir->entries[dir->nr -1]->name) <0)) 400 dir->sorted = dir->nr; 401} 402 403/* 404 * Clear and free all entries in dir, recursively. 405 */ 406static voidclear_ref_dir(struct ref_dir *dir) 407{ 408int i; 409for(i =0; i < dir->nr; i++) 410free_ref_entry(dir->entries[i]); 411free(dir->entries); 412 dir->sorted = dir->nr = dir->alloc =0; 413 dir->entries = NULL; 414} 415 416/* 417 * Create a struct ref_entry object for the specified dirname. 418 * dirname is the name of the directory with a trailing slash (e.g., 419 * "refs/heads/") or "" for the top-level directory. 420 */ 421static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 422const char*dirname,size_t len, 423int incomplete) 424{ 425struct ref_entry *direntry; 426 direntry =xcalloc(1,sizeof(struct ref_entry) + len +1); 427memcpy(direntry->name, dirname, len); 428 direntry->name[len] ='\0'; 429 direntry->u.subdir.ref_cache = ref_cache; 430 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE :0); 431return direntry; 432} 433 434static intref_entry_cmp(const void*a,const void*b) 435{ 436struct ref_entry *one = *(struct ref_entry **)a; 437struct ref_entry *two = *(struct ref_entry **)b; 438returnstrcmp(one->name, two->name); 439} 440 441static voidsort_ref_dir(struct ref_dir *dir); 442 443struct string_slice { 444size_t len; 445const char*str; 446}; 447 448static intref_entry_cmp_sslice(const void*key_,const void*ent_) 449{ 450const struct string_slice *key = key_; 451const struct ref_entry *ent = *(const struct ref_entry *const*)ent_; 452int cmp =strncmp(key->str, ent->name, key->len); 453if(cmp) 454return cmp; 455return'\0'- (unsigned char)ent->name[key->len]; 456} 457 458/* 459 * Return the index of the entry with the given refname from the 460 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 461 * no such entry is found. dir must already be complete. 462 */ 463static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len) 464{ 465struct ref_entry **r; 466struct string_slice key; 467 468if(refname == NULL || !dir->nr) 469return-1; 470 471sort_ref_dir(dir); 472 key.len = len; 473 key.str = refname; 474 r =bsearch(&key, dir->entries, dir->nr,sizeof(*dir->entries), 475 ref_entry_cmp_sslice); 476 477if(r == NULL) 478return-1; 479 480return r - dir->entries; 481} 482 483/* 484 * Search for a directory entry directly within dir (without 485 * recursing). Sort dir if necessary. subdirname must be a directory 486 * name (i.e., end in '/'). If mkdir is set, then create the 487 * directory if it is missing; otherwise, return NULL if the desired 488 * directory cannot be found. dir must already be complete. 489 */ 490static struct ref_dir *search_for_subdir(struct ref_dir *dir, 491const char*subdirname,size_t len, 492int mkdir) 493{ 494int entry_index =search_ref_dir(dir, subdirname, len); 495struct ref_entry *entry; 496if(entry_index == -1) { 497if(!mkdir) 498return NULL; 499/* 500 * Since dir is complete, the absence of a subdir 501 * means that the subdir really doesn't exist; 502 * therefore, create an empty record for it but mark 503 * the record complete. 504 */ 505 entry =create_dir_entry(dir->ref_cache, subdirname, len,0); 506add_entry_to_dir(dir, entry); 507}else{ 508 entry = dir->entries[entry_index]; 509} 510returnget_ref_dir(entry); 511} 512 513/* 514 * If refname is a reference name, find the ref_dir within the dir 515 * tree that should hold refname. If refname is a directory name 516 * (i.e., ends in '/'), then return that ref_dir itself. dir must 517 * represent the top-level directory and must already be complete. 518 * Sort ref_dirs and recurse into subdirectories as necessary. If 519 * mkdir is set, then create any missing directories; otherwise, 520 * return NULL if the desired directory cannot be found. 521 */ 522static struct ref_dir *find_containing_dir(struct ref_dir *dir, 523const char*refname,int mkdir) 524{ 525const char*slash; 526for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 527size_t dirnamelen = slash - refname +1; 528struct ref_dir *subdir; 529 subdir =search_for_subdir(dir, refname, dirnamelen, mkdir); 530if(!subdir) { 531 dir = NULL; 532break; 533} 534 dir = subdir; 535} 536 537return dir; 538} 539 540/* 541 * Find the value entry with the given name in dir, sorting ref_dirs 542 * and recursing into subdirectories as necessary. If the name is not 543 * found or it corresponds to a directory entry, return NULL. 544 */ 545static struct ref_entry *find_ref(struct ref_dir *dir,const char*refname) 546{ 547int entry_index; 548struct ref_entry *entry; 549 dir =find_containing_dir(dir, refname,0); 550if(!dir) 551return NULL; 552 entry_index =search_ref_dir(dir, refname,strlen(refname)); 553if(entry_index == -1) 554return NULL; 555 entry = dir->entries[entry_index]; 556return(entry->flag & REF_DIR) ? NULL : entry; 557} 558 559/* 560 * Remove the entry with the given name from dir, recursing into 561 * subdirectories as necessary. If refname is the name of a directory 562 * (i.e., ends with '/'), then remove the directory and its contents. 563 * If the removal was successful, return the number of entries 564 * remaining in the directory entry that contained the deleted entry. 565 * If the name was not found, return -1. Please note that this 566 * function only deletes the entry from the cache; it does not delete 567 * it from the filesystem or ensure that other cache entries (which 568 * might be symbolic references to the removed entry) are updated. 569 * Nor does it remove any containing dir entries that might be made 570 * empty by the removal. dir must represent the top-level directory 571 * and must already be complete. 572 */ 573static intremove_entry(struct ref_dir *dir,const char*refname) 574{ 575int refname_len =strlen(refname); 576int entry_index; 577struct ref_entry *entry; 578int is_dir = refname[refname_len -1] =='/'; 579if(is_dir) { 580/* 581 * refname represents a reference directory. Remove 582 * the trailing slash; otherwise we will get the 583 * directory *representing* refname rather than the 584 * one *containing* it. 585 */ 586char*dirname =xmemdupz(refname, refname_len -1); 587 dir =find_containing_dir(dir, dirname,0); 588free(dirname); 589}else{ 590 dir =find_containing_dir(dir, refname,0); 591} 592if(!dir) 593return-1; 594 entry_index =search_ref_dir(dir, refname, refname_len); 595if(entry_index == -1) 596return-1; 597 entry = dir->entries[entry_index]; 598 599memmove(&dir->entries[entry_index], 600&dir->entries[entry_index +1], 601(dir->nr - entry_index -1) *sizeof(*dir->entries) 602); 603 dir->nr--; 604if(dir->sorted > entry_index) 605 dir->sorted--; 606free_ref_entry(entry); 607return dir->nr; 608} 609 610/* 611 * Add a ref_entry to the ref_dir (unsorted), recursing into 612 * subdirectories as necessary. dir must represent the top-level 613 * directory. Return 0 on success. 614 */ 615static intadd_ref(struct ref_dir *dir,struct ref_entry *ref) 616{ 617 dir =find_containing_dir(dir, ref->name,1); 618if(!dir) 619return-1; 620add_entry_to_dir(dir, ref); 621return0; 622} 623 624/* 625 * Emit a warning and return true iff ref1 and ref2 have the same name 626 * and the same sha1. Die if they have the same name but different 627 * sha1s. 628 */ 629static intis_dup_ref(const struct ref_entry *ref1,const struct ref_entry *ref2) 630{ 631if(strcmp(ref1->name, ref2->name)) 632return0; 633 634/* Duplicate name; make sure that they don't conflict: */ 635 636if((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 637/* This is impossible by construction */ 638die("Reference directory conflict:%s", ref1->name); 639 640if(oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 641die("Duplicated ref, and SHA1s don't match:%s", ref1->name); 642 643warning("Duplicated ref:%s", ref1->name); 644return1; 645} 646 647/* 648 * Sort the entries in dir non-recursively (if they are not already 649 * sorted) and remove any duplicate entries. 650 */ 651static voidsort_ref_dir(struct ref_dir *dir) 652{ 653int i, j; 654struct ref_entry *last = NULL; 655 656/* 657 * This check also prevents passing a zero-length array to qsort(), 658 * which is a problem on some platforms. 659 */ 660if(dir->sorted == dir->nr) 661return; 662 663qsort(dir->entries, dir->nr,sizeof(*dir->entries), ref_entry_cmp); 664 665/* Remove any duplicates: */ 666for(i =0, j =0; j < dir->nr; j++) { 667struct ref_entry *entry = dir->entries[j]; 668if(last &&is_dup_ref(last, entry)) 669free_ref_entry(entry); 670else 671 last = dir->entries[i++] = entry; 672} 673 dir->sorted = dir->nr = i; 674} 675 676/* Include broken references in a do_for_each_ref*() iteration: */ 677#define DO_FOR_EACH_INCLUDE_BROKEN 0x01 678 679/* 680 * Return true iff the reference described by entry can be resolved to 681 * an object in the database. Emit a warning if the referred-to 682 * object does not exist. 683 */ 684static intref_resolves_to_object(struct ref_entry *entry) 685{ 686if(entry->flag & REF_ISBROKEN) 687return0; 688if(!has_sha1_file(entry->u.value.oid.hash)) { 689error("%sdoes not point to a valid object!", entry->name); 690return0; 691} 692return1; 693} 694 695/* 696 * current_ref is a performance hack: when iterating over references 697 * using the for_each_ref*() functions, current_ref is set to the 698 * current reference's entry before calling the callback function. If 699 * the callback function calls peel_ref(), then peel_ref() first 700 * checks whether the reference to be peeled is the current reference 701 * (it usually is) and if so, returns that reference's peeled version 702 * if it is available. This avoids a refname lookup in a common case. 703 */ 704static struct ref_entry *current_ref; 705 706typedefinteach_ref_entry_fn(struct ref_entry *entry,void*cb_data); 707 708struct ref_entry_cb { 709const char*base; 710int trim; 711int flags; 712 each_ref_fn *fn; 713void*cb_data; 714}; 715 716/* 717 * Handle one reference in a do_for_each_ref*()-style iteration, 718 * calling an each_ref_fn for each entry. 719 */ 720static intdo_one_ref(struct ref_entry *entry,void*cb_data) 721{ 722struct ref_entry_cb *data = cb_data; 723struct ref_entry *old_current_ref; 724int retval; 725 726if(!starts_with(entry->name, data->base)) 727return0; 728 729if(!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && 730!ref_resolves_to_object(entry)) 731return0; 732 733/* Store the old value, in case this is a recursive call: */ 734 old_current_ref = current_ref; 735 current_ref = entry; 736 retval = data->fn(entry->name + data->trim, &entry->u.value.oid, 737 entry->flag, data->cb_data); 738 current_ref = old_current_ref; 739return retval; 740} 741 742/* 743 * Call fn for each reference in dir that has index in the range 744 * offset <= index < dir->nr. Recurse into subdirectories that are in 745 * that index range, sorting them before iterating. This function 746 * does not sort dir itself; it should be sorted beforehand. fn is 747 * called for all references, including broken ones. 748 */ 749static intdo_for_each_entry_in_dir(struct ref_dir *dir,int offset, 750 each_ref_entry_fn fn,void*cb_data) 751{ 752int i; 753assert(dir->sorted == dir->nr); 754for(i = offset; i < dir->nr; i++) { 755struct ref_entry *entry = dir->entries[i]; 756int retval; 757if(entry->flag & REF_DIR) { 758struct ref_dir *subdir =get_ref_dir(entry); 759sort_ref_dir(subdir); 760 retval =do_for_each_entry_in_dir(subdir,0, fn, cb_data); 761}else{ 762 retval =fn(entry, cb_data); 763} 764if(retval) 765return retval; 766} 767return0; 768} 769 770/* 771 * Call fn for each reference in the union of dir1 and dir2, in order 772 * by refname. Recurse into subdirectories. If a value entry appears 773 * in both dir1 and dir2, then only process the version that is in 774 * dir2. The input dirs must already be sorted, but subdirs will be 775 * sorted as needed. fn is called for all references, including 776 * broken ones. 777 */ 778static intdo_for_each_entry_in_dirs(struct ref_dir *dir1, 779struct ref_dir *dir2, 780 each_ref_entry_fn fn,void*cb_data) 781{ 782int retval; 783int i1 =0, i2 =0; 784 785assert(dir1->sorted == dir1->nr); 786assert(dir2->sorted == dir2->nr); 787while(1) { 788struct ref_entry *e1, *e2; 789int cmp; 790if(i1 == dir1->nr) { 791returndo_for_each_entry_in_dir(dir2, i2, fn, cb_data); 792} 793if(i2 == dir2->nr) { 794returndo_for_each_entry_in_dir(dir1, i1, fn, cb_data); 795} 796 e1 = dir1->entries[i1]; 797 e2 = dir2->entries[i2]; 798 cmp =strcmp(e1->name, e2->name); 799if(cmp ==0) { 800if((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { 801/* Both are directories; descend them in parallel. */ 802struct ref_dir *subdir1 =get_ref_dir(e1); 803struct ref_dir *subdir2 =get_ref_dir(e2); 804sort_ref_dir(subdir1); 805sort_ref_dir(subdir2); 806 retval =do_for_each_entry_in_dirs( 807 subdir1, subdir2, fn, cb_data); 808 i1++; 809 i2++; 810}else if(!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { 811/* Both are references; ignore the one from dir1. */ 812 retval =fn(e2, cb_data); 813 i1++; 814 i2++; 815}else{ 816die("conflict between reference and directory:%s", 817 e1->name); 818} 819}else{ 820struct ref_entry *e; 821if(cmp <0) { 822 e = e1; 823 i1++; 824}else{ 825 e = e2; 826 i2++; 827} 828if(e->flag & REF_DIR) { 829struct ref_dir *subdir =get_ref_dir(e); 830sort_ref_dir(subdir); 831 retval =do_for_each_entry_in_dir( 832 subdir,0, fn, cb_data); 833}else{ 834 retval =fn(e, cb_data); 835} 836} 837if(retval) 838return retval; 839} 840} 841 842/* 843 * Load all of the refs from the dir into our in-memory cache. The hard work 844 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 845 * through all of the sub-directories. We do not even need to care about 846 * sorting, as traversal order does not matter to us. 847 */ 848static voidprime_ref_dir(struct ref_dir *dir) 849{ 850int i; 851for(i =0; i < dir->nr; i++) { 852struct ref_entry *entry = dir->entries[i]; 853if(entry->flag & REF_DIR) 854prime_ref_dir(get_ref_dir(entry)); 855} 856} 857 858struct nonmatching_ref_data { 859const struct string_list *skip; 860const char*conflicting_refname; 861}; 862 863static intnonmatching_ref_fn(struct ref_entry *entry,void*vdata) 864{ 865struct nonmatching_ref_data *data = vdata; 866 867if(data->skip &&string_list_has_string(data->skip, entry->name)) 868return0; 869 870 data->conflicting_refname = entry->name; 871return1; 872} 873 874/* 875 * Return 0 if a reference named refname could be created without 876 * conflicting with the name of an existing reference in dir. 877 * Otherwise, return a negative value and write an explanation to err. 878 * If extras is non-NULL, it is a list of additional refnames with 879 * which refname is not allowed to conflict. If skip is non-NULL, 880 * ignore potential conflicts with refs in skip (e.g., because they 881 * are scheduled for deletion in the same operation). Behavior is 882 * undefined if the same name is listed in both extras and skip. 883 * 884 * Two reference names conflict if one of them exactly matches the 885 * leading components of the other; e.g., "refs/foo/bar" conflicts 886 * with both "refs/foo" and with "refs/foo/bar/baz" but not with 887 * "refs/foo/bar" or "refs/foo/barbados". 888 * 889 * extras and skip must be sorted. 890 */ 891static intverify_refname_available(const char*refname, 892const struct string_list *extras, 893const struct string_list *skip, 894struct ref_dir *dir, 895struct strbuf *err) 896{ 897const char*slash; 898int pos; 899struct strbuf dirname = STRBUF_INIT; 900int ret = -1; 901 902/* 903 * For the sake of comments in this function, suppose that 904 * refname is "refs/foo/bar". 905 */ 906 907assert(err); 908 909strbuf_grow(&dirname,strlen(refname) +1); 910for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 911/* Expand dirname to the new prefix, not including the trailing slash: */ 912strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 913 914/* 915 * We are still at a leading dir of the refname (e.g., 916 * "refs/foo"; if there is a reference with that name, 917 * it is a conflict, *unless* it is in skip. 918 */ 919if(dir) { 920 pos =search_ref_dir(dir, dirname.buf, dirname.len); 921if(pos >=0&& 922(!skip || !string_list_has_string(skip, dirname.buf))) { 923/* 924 * We found a reference whose name is 925 * a proper prefix of refname; e.g., 926 * "refs/foo", and is not in skip. 927 */ 928strbuf_addf(err,"'%s' exists; cannot create '%s'", 929 dirname.buf, refname); 930goto cleanup; 931} 932} 933 934if(extras &&string_list_has_string(extras, dirname.buf) && 935(!skip || !string_list_has_string(skip, dirname.buf))) { 936strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 937 refname, dirname.buf); 938goto cleanup; 939} 940 941/* 942 * Otherwise, we can try to continue our search with 943 * the next component. So try to look up the 944 * directory, e.g., "refs/foo/". If we come up empty, 945 * we know there is nothing under this whole prefix, 946 * but even in that case we still have to continue the 947 * search for conflicts with extras. 948 */ 949strbuf_addch(&dirname,'/'); 950if(dir) { 951 pos =search_ref_dir(dir, dirname.buf, dirname.len); 952if(pos <0) { 953/* 954 * There was no directory "refs/foo/", 955 * so there is nothing under this 956 * whole prefix. So there is no need 957 * to continue looking for conflicting 958 * references. But we need to continue 959 * looking for conflicting extras. 960 */ 961 dir = NULL; 962}else{ 963 dir =get_ref_dir(dir->entries[pos]); 964} 965} 966} 967 968/* 969 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 970 * There is no point in searching for a reference with that 971 * name, because a refname isn't considered to conflict with 972 * itself. But we still need to check for references whose 973 * names are in the "refs/foo/bar/" namespace, because they 974 * *do* conflict. 975 */ 976strbuf_addstr(&dirname, refname + dirname.len); 977strbuf_addch(&dirname,'/'); 978 979if(dir) { 980 pos =search_ref_dir(dir, dirname.buf, dirname.len); 981 982if(pos >=0) { 983/* 984 * We found a directory named "$refname/" 985 * (e.g., "refs/foo/bar/"). It is a problem 986 * iff it contains any ref that is not in 987 * "skip". 988 */ 989struct nonmatching_ref_data data; 990 991 data.skip = skip; 992 data.conflicting_refname = NULL; 993 dir =get_ref_dir(dir->entries[pos]); 994sort_ref_dir(dir); 995if(do_for_each_entry_in_dir(dir,0, nonmatching_ref_fn, &data)) { 996strbuf_addf(err,"'%s' exists; cannot create '%s'", 997 data.conflicting_refname, refname); 998goto cleanup; 999}1000}1001}10021003if(extras) {1004/*1005 * Check for entries in extras that start with1006 * "$refname/". We do that by looking for the place1007 * where "$refname/" would be inserted in extras. If1008 * there is an entry at that position that starts with1009 * "$refname/" and is not in skip, then we have a1010 * conflict.1011 */1012for(pos =string_list_find_insert_index(extras, dirname.buf,0);1013 pos < extras->nr; pos++) {1014const char*extra_refname = extras->items[pos].string;10151016if(!starts_with(extra_refname, dirname.buf))1017break;10181019if(!skip || !string_list_has_string(skip, extra_refname)) {1020strbuf_addf(err,"cannot process '%s' and '%s' at the same time",1021 refname, extra_refname);1022goto cleanup;1023}1024}1025}10261027/* No conflicts were found */1028 ret =0;10291030cleanup:1031strbuf_release(&dirname);1032return ret;1033}10341035struct packed_ref_cache {1036struct ref_entry *root;10371038/*1039 * Count of references to the data structure in this instance,1040 * including the pointer from ref_cache::packed if any. The1041 * data will not be freed as long as the reference count is1042 * nonzero.1043 */1044unsigned int referrers;10451046/*1047 * Iff the packed-refs file associated with this instance is1048 * currently locked for writing, this points at the associated1049 * lock (which is owned by somebody else). The referrer count1050 * is also incremented when the file is locked and decremented1051 * when it is unlocked.1052 */1053struct lock_file *lock;10541055/* The metadata from when this packed-refs cache was read */1056struct stat_validity validity;1057};10581059/*1060 * Future: need to be in "struct repository"1061 * when doing a full libification.1062 */1063static struct ref_cache {1064struct ref_cache *next;1065struct ref_entry *loose;1066struct packed_ref_cache *packed;1067/*1068 * The submodule name, or "" for the main repo. We allocate1069 * length 1 rather than FLEX_ARRAY so that the main ref_cache1070 * is initialized correctly.1071 */1072char name[1];1073} ref_cache, *submodule_ref_caches;10741075/* Lock used for the main packed-refs file: */1076static struct lock_file packlock;10771078/*1079 * Increment the reference count of *packed_refs.1080 */1081static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs)1082{1083 packed_refs->referrers++;1084}10851086/*1087 * Decrease the reference count of *packed_refs. If it goes to zero,1088 * free *packed_refs and return true; otherwise return false.1089 */1090static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs)1091{1092if(!--packed_refs->referrers) {1093free_ref_entry(packed_refs->root);1094stat_validity_clear(&packed_refs->validity);1095free(packed_refs);1096return1;1097}else{1098return0;1099}1100}11011102static voidclear_packed_ref_cache(struct ref_cache *refs)1103{1104if(refs->packed) {1105struct packed_ref_cache *packed_refs = refs->packed;11061107if(packed_refs->lock)1108die("internal error: packed-ref cache cleared while locked");1109 refs->packed = NULL;1110release_packed_ref_cache(packed_refs);1111}1112}11131114static voidclear_loose_ref_cache(struct ref_cache *refs)1115{1116if(refs->loose) {1117free_ref_entry(refs->loose);1118 refs->loose = NULL;1119}1120}11211122static struct ref_cache *create_ref_cache(const char*submodule)1123{1124int len;1125struct ref_cache *refs;1126if(!submodule)1127 submodule ="";1128 len =strlen(submodule) +1;1129 refs =xcalloc(1,sizeof(struct ref_cache) + len);1130memcpy(refs->name, submodule, len);1131return refs;1132}11331134/*1135 * Return a pointer to a ref_cache for the specified submodule. For1136 * the main repository, use submodule==NULL. The returned structure1137 * will be allocated and initialized but not necessarily populated; it1138 * should not be freed.1139 */1140static struct ref_cache *get_ref_cache(const char*submodule)1141{1142struct ref_cache *refs;11431144if(!submodule || !*submodule)1145return&ref_cache;11461147for(refs = submodule_ref_caches; refs; refs = refs->next)1148if(!strcmp(submodule, refs->name))1149return refs;11501151 refs =create_ref_cache(submodule);1152 refs->next = submodule_ref_caches;1153 submodule_ref_caches = refs;1154return refs;1155}11561157/* The length of a peeled reference line in packed-refs, including EOL: */1158#define PEELED_LINE_LENGTH 4211591160/*1161 * The packed-refs header line that we write out. Perhaps other1162 * traits will be added later. The trailing space is required.1163 */1164static const char PACKED_REFS_HEADER[] =1165"# pack-refs with: peeled fully-peeled\n";11661167/*1168 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1169 * Return a pointer to the refname within the line (null-terminated),1170 * or NULL if there was a problem.1171 */1172static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1)1173{1174const char*ref;11751176/*1177 * 42: the answer to everything.1178 *1179 * In this case, it happens to be the answer to1180 * 40 (length of sha1 hex representation)1181 * +1 (space in between hex and name)1182 * +1 (newline at the end of the line)1183 */1184if(line->len <=42)1185return NULL;11861187if(get_sha1_hex(line->buf, sha1) <0)1188return NULL;1189if(!isspace(line->buf[40]))1190return NULL;11911192 ref = line->buf +41;1193if(isspace(*ref))1194return NULL;11951196if(line->buf[line->len -1] !='\n')1197return NULL;1198 line->buf[--line->len] =0;11991200return ref;1201}12021203/*1204 * Read f, which is a packed-refs file, into dir.1205 *1206 * A comment line of the form "# pack-refs with: " may contain zero or1207 * more traits. We interpret the traits as follows:1208 *1209 * No traits:1210 *1211 * Probably no references are peeled. But if the file contains a1212 * peeled value for a reference, we will use it.1213 *1214 * peeled:1215 *1216 * References under "refs/tags/", if they *can* be peeled, *are*1217 * peeled in this file. References outside of "refs/tags/" are1218 * probably not peeled even if they could have been, but if we find1219 * a peeled value for such a reference we will use it.1220 *1221 * fully-peeled:1222 *1223 * All references in the file that can be peeled are peeled.1224 * Inversely (and this is more important), any references in the1225 * file for which no peeled value is recorded is not peelable. This1226 * trait should typically be written alongside "peeled" for1227 * compatibility with older clients, but we do not require it1228 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1229 */1230static voidread_packed_refs(FILE*f,struct ref_dir *dir)1231{1232struct ref_entry *last = NULL;1233struct strbuf line = STRBUF_INIT;1234enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;12351236while(strbuf_getwholeline(&line, f,'\n') != EOF) {1237unsigned char sha1[20];1238const char*refname;1239const char*traits;12401241if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1242if(strstr(traits," fully-peeled "))1243 peeled = PEELED_FULLY;1244else if(strstr(traits," peeled "))1245 peeled = PEELED_TAGS;1246/* perhaps other traits later as well */1247continue;1248}12491250 refname =parse_ref_line(&line, sha1);1251if(refname) {1252int flag = REF_ISPACKED;12531254if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1255if(!refname_is_safe(refname))1256die("packed refname is dangerous:%s", refname);1257hashclr(sha1);1258 flag |= REF_BAD_NAME | REF_ISBROKEN;1259}1260 last =create_ref_entry(refname, sha1, flag,0);1261if(peeled == PEELED_FULLY ||1262(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1263 last->flag |= REF_KNOWS_PEELED;1264add_ref(dir, last);1265continue;1266}1267if(last &&1268 line.buf[0] =='^'&&1269 line.len == PEELED_LINE_LENGTH &&1270 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1271!get_sha1_hex(line.buf +1, sha1)) {1272hashcpy(last->u.value.peeled.hash, sha1);1273/*1274 * Regardless of what the file header said,1275 * we definitely know the value of *this*1276 * reference:1277 */1278 last->flag |= REF_KNOWS_PEELED;1279}1280}12811282strbuf_release(&line);1283}12841285/*1286 * Get the packed_ref_cache for the specified ref_cache, creating it1287 * if necessary.1288 */1289static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1290{1291char*packed_refs_file;12921293if(*refs->name)1294 packed_refs_file =git_pathdup_submodule(refs->name,"packed-refs");1295else1296 packed_refs_file =git_pathdup("packed-refs");12971298if(refs->packed &&1299!stat_validity_check(&refs->packed->validity, packed_refs_file))1300clear_packed_ref_cache(refs);13011302if(!refs->packed) {1303FILE*f;13041305 refs->packed =xcalloc(1,sizeof(*refs->packed));1306acquire_packed_ref_cache(refs->packed);1307 refs->packed->root =create_dir_entry(refs,"",0,0);1308 f =fopen(packed_refs_file,"r");1309if(f) {1310stat_validity_update(&refs->packed->validity,fileno(f));1311read_packed_refs(f,get_ref_dir(refs->packed->root));1312fclose(f);1313}1314}1315free(packed_refs_file);1316return refs->packed;1317}13181319static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1320{1321returnget_ref_dir(packed_ref_cache->root);1322}13231324static struct ref_dir *get_packed_refs(struct ref_cache *refs)1325{1326returnget_packed_ref_dir(get_packed_ref_cache(refs));1327}13281329/*1330 * Add a reference to the in-memory packed reference cache. This may1331 * only be called while the packed-refs file is locked (see1332 * lock_packed_refs()). To actually write the packed-refs file, call1333 * commit_packed_refs().1334 */1335static voidadd_packed_ref(const char*refname,const unsigned char*sha1)1336{1337struct packed_ref_cache *packed_ref_cache =1338get_packed_ref_cache(&ref_cache);13391340if(!packed_ref_cache->lock)1341die("internal error: packed refs not locked");1342add_ref(get_packed_ref_dir(packed_ref_cache),1343create_ref_entry(refname, sha1, REF_ISPACKED,1));1344}13451346/*1347 * Read the loose references from the namespace dirname into dir1348 * (without recursing). dirname must end with '/'. dir must be the1349 * directory entry corresponding to dirname.1350 */1351static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1352{1353struct ref_cache *refs = dir->ref_cache;1354DIR*d;1355struct dirent *de;1356int dirnamelen =strlen(dirname);1357struct strbuf refname;1358struct strbuf path = STRBUF_INIT;1359size_t path_baselen;13601361if(*refs->name)1362strbuf_git_path_submodule(&path, refs->name,"%s", dirname);1363else1364strbuf_git_path(&path,"%s", dirname);1365 path_baselen = path.len;13661367 d =opendir(path.buf);1368if(!d) {1369strbuf_release(&path);1370return;1371}13721373strbuf_init(&refname, dirnamelen +257);1374strbuf_add(&refname, dirname, dirnamelen);13751376while((de =readdir(d)) != NULL) {1377unsigned char sha1[20];1378struct stat st;1379int flag;13801381if(de->d_name[0] =='.')1382continue;1383if(ends_with(de->d_name,".lock"))1384continue;1385strbuf_addstr(&refname, de->d_name);1386strbuf_addstr(&path, de->d_name);1387if(stat(path.buf, &st) <0) {1388;/* silently ignore */1389}else if(S_ISDIR(st.st_mode)) {1390strbuf_addch(&refname,'/');1391add_entry_to_dir(dir,1392create_dir_entry(refs, refname.buf,1393 refname.len,1));1394}else{1395int read_ok;13961397if(*refs->name) {1398hashclr(sha1);1399 flag =0;1400 read_ok = !resolve_gitlink_ref(refs->name,1401 refname.buf, sha1);1402}else{1403 read_ok = !read_ref_full(refname.buf,1404 RESOLVE_REF_READING,1405 sha1, &flag);1406}14071408if(!read_ok) {1409hashclr(sha1);1410 flag |= REF_ISBROKEN;1411}else if(is_null_sha1(sha1)) {1412/*1413 * It is so astronomically unlikely1414 * that NULL_SHA1 is the SHA-1 of an1415 * actual object that we consider its1416 * appearance in a loose reference1417 * file to be repo corruption1418 * (probably due to a software bug).1419 */1420 flag |= REF_ISBROKEN;1421}14221423if(check_refname_format(refname.buf,1424 REFNAME_ALLOW_ONELEVEL)) {1425if(!refname_is_safe(refname.buf))1426die("loose refname is dangerous:%s", refname.buf);1427hashclr(sha1);1428 flag |= REF_BAD_NAME | REF_ISBROKEN;1429}1430add_entry_to_dir(dir,1431create_ref_entry(refname.buf, sha1, flag,0));1432}1433strbuf_setlen(&refname, dirnamelen);1434strbuf_setlen(&path, path_baselen);1435}1436strbuf_release(&refname);1437strbuf_release(&path);1438closedir(d);1439}14401441static struct ref_dir *get_loose_refs(struct ref_cache *refs)1442{1443if(!refs->loose) {1444/*1445 * Mark the top-level directory complete because we1446 * are about to read the only subdirectory that can1447 * hold references:1448 */1449 refs->loose =create_dir_entry(refs,"",0,0);1450/*1451 * Create an incomplete entry for "refs/":1452 */1453add_entry_to_dir(get_ref_dir(refs->loose),1454create_dir_entry(refs,"refs/",5,1));1455}1456returnget_ref_dir(refs->loose);1457}14581459/* We allow "recursive" symbolic refs. Only within reason, though */1460#define MAXDEPTH 51461#define MAXREFLEN (1024)14621463/*1464 * Called by resolve_gitlink_ref_recursive() after it failed to read1465 * from the loose refs in ref_cache refs. Find <refname> in the1466 * packed-refs file for the submodule.1467 */1468static intresolve_gitlink_packed_ref(struct ref_cache *refs,1469const char*refname,unsigned char*sha1)1470{1471struct ref_entry *ref;1472struct ref_dir *dir =get_packed_refs(refs);14731474 ref =find_ref(dir, refname);1475if(ref == NULL)1476return-1;14771478hashcpy(sha1, ref->u.value.oid.hash);1479return0;1480}14811482static intresolve_gitlink_ref_recursive(struct ref_cache *refs,1483const char*refname,unsigned char*sha1,1484int recursion)1485{1486int fd, len;1487char buffer[128], *p;1488char*path;14891490if(recursion > MAXDEPTH ||strlen(refname) > MAXREFLEN)1491return-1;1492 path = *refs->name1493?git_pathdup_submodule(refs->name,"%s", refname)1494:git_pathdup("%s", refname);1495 fd =open(path, O_RDONLY);1496free(path);1497if(fd <0)1498returnresolve_gitlink_packed_ref(refs, refname, sha1);14991500 len =read(fd, buffer,sizeof(buffer)-1);1501close(fd);1502if(len <0)1503return-1;1504while(len &&isspace(buffer[len-1]))1505 len--;1506 buffer[len] =0;15071508/* Was it a detached head or an old-fashioned symlink? */1509if(!get_sha1_hex(buffer, sha1))1510return0;15111512/* Symref? */1513if(strncmp(buffer,"ref:",4))1514return-1;1515 p = buffer +4;1516while(isspace(*p))1517 p++;15181519returnresolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1520}15211522intresolve_gitlink_ref(const char*path,const char*refname,unsigned char*sha1)1523{1524int len =strlen(path), retval;1525char*submodule;1526struct ref_cache *refs;15271528while(len && path[len-1] =='/')1529 len--;1530if(!len)1531return-1;1532 submodule =xstrndup(path, len);1533 refs =get_ref_cache(submodule);1534free(submodule);15351536 retval =resolve_gitlink_ref_recursive(refs, refname, sha1,0);1537return retval;1538}15391540/*1541 * Return the ref_entry for the given refname from the packed1542 * references. If it does not exist, return NULL.1543 */1544static struct ref_entry *get_packed_ref(const char*refname)1545{1546returnfind_ref(get_packed_refs(&ref_cache), refname);1547}15481549/*1550 * A loose ref file doesn't exist; check for a packed ref. The1551 * options are forwarded from resolve_safe_unsafe().1552 */1553static intresolve_missing_loose_ref(const char*refname,1554int resolve_flags,1555unsigned char*sha1,1556int*flags)1557{1558struct ref_entry *entry;15591560/*1561 * The loose reference file does not exist; check for a packed1562 * reference.1563 */1564 entry =get_packed_ref(refname);1565if(entry) {1566hashcpy(sha1, entry->u.value.oid.hash);1567if(flags)1568*flags |= REF_ISPACKED;1569return0;1570}1571/* The reference is not a packed reference, either. */1572if(resolve_flags & RESOLVE_REF_READING) {1573 errno = ENOENT;1574return-1;1575}else{1576hashclr(sha1);1577return0;1578}1579}15801581/* This function needs to return a meaningful errno on failure */1582static const char*resolve_ref_1(const char*refname,1583int resolve_flags,1584unsigned char*sha1,1585int*flags,1586struct strbuf *sb_refname,1587struct strbuf *sb_path,1588struct strbuf *sb_contents)1589{1590int depth = MAXDEPTH;1591int bad_name =0;15921593if(flags)1594*flags =0;15951596if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1597if(flags)1598*flags |= REF_BAD_NAME;15991600if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1601!refname_is_safe(refname)) {1602 errno = EINVAL;1603return NULL;1604}1605/*1606 * dwim_ref() uses REF_ISBROKEN to distinguish between1607 * missing refs and refs that were present but invalid,1608 * to complain about the latter to stderr.1609 *1610 * We don't know whether the ref exists, so don't set1611 * REF_ISBROKEN yet.1612 */1613 bad_name =1;1614}1615for(;;) {1616const char*path;1617struct stat st;1618char*buf;1619int fd;16201621if(--depth <0) {1622 errno = ELOOP;1623return NULL;1624}16251626strbuf_reset(sb_path);1627strbuf_git_path(sb_path,"%s", refname);1628 path = sb_path->buf;16291630/*1631 * We might have to loop back here to avoid a race1632 * condition: first we lstat() the file, then we try1633 * to read it as a link or as a file. But if somebody1634 * changes the type of the file (file <-> directory1635 * <-> symlink) between the lstat() and reading, then1636 * we don't want to report that as an error but rather1637 * try again starting with the lstat().1638 */1639 stat_ref:1640if(lstat(path, &st) <0) {1641if(errno != ENOENT)1642return NULL;1643if(resolve_missing_loose_ref(refname, resolve_flags,1644 sha1, flags))1645return NULL;1646if(bad_name) {1647hashclr(sha1);1648if(flags)1649*flags |= REF_ISBROKEN;1650}1651return refname;1652}16531654/* Follow "normalized" - ie "refs/.." symlinks by hand */1655if(S_ISLNK(st.st_mode)) {1656strbuf_reset(sb_contents);1657if(strbuf_readlink(sb_contents, path,0) <0) {1658if(errno == ENOENT || errno == EINVAL)1659/* inconsistent with lstat; retry */1660goto stat_ref;1661else1662return NULL;1663}1664if(starts_with(sb_contents->buf,"refs/") &&1665!check_refname_format(sb_contents->buf,0)) {1666strbuf_swap(sb_refname, sb_contents);1667 refname = sb_refname->buf;1668if(flags)1669*flags |= REF_ISSYMREF;1670if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1671hashclr(sha1);1672return refname;1673}1674continue;1675}1676}16771678/* Is it a directory? */1679if(S_ISDIR(st.st_mode)) {1680 errno = EISDIR;1681return NULL;1682}16831684/*1685 * Anything else, just open it and try to use it as1686 * a ref1687 */1688 fd =open(path, O_RDONLY);1689if(fd <0) {1690if(errno == ENOENT)1691/* inconsistent with lstat; retry */1692goto stat_ref;1693else1694return NULL;1695}1696strbuf_reset(sb_contents);1697if(strbuf_read(sb_contents, fd,256) <0) {1698int save_errno = errno;1699close(fd);1700 errno = save_errno;1701return NULL;1702}1703close(fd);1704strbuf_rtrim(sb_contents);17051706/*1707 * Is it a symbolic ref?1708 */1709if(!starts_with(sb_contents->buf,"ref:")) {1710/*1711 * Please note that FETCH_HEAD has a second1712 * line containing other data.1713 */1714if(get_sha1_hex(sb_contents->buf, sha1) ||1715(sb_contents->buf[40] !='\0'&& !isspace(sb_contents->buf[40]))) {1716if(flags)1717*flags |= REF_ISBROKEN;1718 errno = EINVAL;1719return NULL;1720}1721if(bad_name) {1722hashclr(sha1);1723if(flags)1724*flags |= REF_ISBROKEN;1725}1726return refname;1727}1728if(flags)1729*flags |= REF_ISSYMREF;1730 buf = sb_contents->buf +4;1731while(isspace(*buf))1732 buf++;1733strbuf_reset(sb_refname);1734strbuf_addstr(sb_refname, buf);1735 refname = sb_refname->buf;1736if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1737hashclr(sha1);1738return refname;1739}1740if(check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {1741if(flags)1742*flags |= REF_ISBROKEN;17431744if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1745!refname_is_safe(buf)) {1746 errno = EINVAL;1747return NULL;1748}1749 bad_name =1;1750}1751}1752}17531754const char*resolve_ref_unsafe(const char*refname,int resolve_flags,1755unsigned char*sha1,int*flags)1756{1757static struct strbuf sb_refname = STRBUF_INIT;1758struct strbuf sb_contents = STRBUF_INIT;1759struct strbuf sb_path = STRBUF_INIT;1760const char*ret;17611762 ret =resolve_ref_1(refname, resolve_flags, sha1, flags,1763&sb_refname, &sb_path, &sb_contents);1764strbuf_release(&sb_path);1765strbuf_release(&sb_contents);1766return ret;1767}17681769char*resolve_refdup(const char*refname,int resolve_flags,1770unsigned char*sha1,int*flags)1771{1772returnxstrdup_or_null(resolve_ref_unsafe(refname, resolve_flags,1773 sha1, flags));1774}17751776/* The argument to filter_refs */1777struct ref_filter {1778const char*pattern;1779 each_ref_fn *fn;1780void*cb_data;1781};17821783intread_ref_full(const char*refname,int resolve_flags,unsigned char*sha1,int*flags)1784{1785if(resolve_ref_unsafe(refname, resolve_flags, sha1, flags))1786return0;1787return-1;1788}17891790intread_ref(const char*refname,unsigned char*sha1)1791{1792returnread_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);1793}17941795intref_exists(const char*refname)1796{1797unsigned char sha1[20];1798return!!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);1799}18001801static intfilter_refs(const char*refname,const struct object_id *oid,1802int flags,void*data)1803{1804struct ref_filter *filter = (struct ref_filter *)data;18051806if(wildmatch(filter->pattern, refname,0, NULL))1807return0;1808return filter->fn(refname, oid, flags, filter->cb_data);1809}18101811enum peel_status {1812/* object was peeled successfully: */1813 PEEL_PEELED =0,18141815/*1816 * object cannot be peeled because the named object (or an1817 * object referred to by a tag in the peel chain), does not1818 * exist.1819 */1820 PEEL_INVALID = -1,18211822/* object cannot be peeled because it is not a tag: */1823 PEEL_NON_TAG = -2,18241825/* ref_entry contains no peeled value because it is a symref: */1826 PEEL_IS_SYMREF = -3,18271828/*1829 * ref_entry cannot be peeled because it is broken (i.e., the1830 * symbolic reference cannot even be resolved to an object1831 * name):1832 */1833 PEEL_BROKEN = -41834};18351836/*1837 * Peel the named object; i.e., if the object is a tag, resolve the1838 * tag recursively until a non-tag is found. If successful, store the1839 * result to sha1 and return PEEL_PEELED. If the object is not a tag1840 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,1841 * and leave sha1 unchanged.1842 */1843static enum peel_status peel_object(const unsigned char*name,unsigned char*sha1)1844{1845struct object *o =lookup_unknown_object(name);18461847if(o->type == OBJ_NONE) {1848int type =sha1_object_info(name, NULL);1849if(type <0|| !object_as_type(o, type,0))1850return PEEL_INVALID;1851}18521853if(o->type != OBJ_TAG)1854return PEEL_NON_TAG;18551856 o =deref_tag_noverify(o);1857if(!o)1858return PEEL_INVALID;18591860hashcpy(sha1, o->sha1);1861return PEEL_PEELED;1862}18631864/*1865 * Peel the entry (if possible) and return its new peel_status. If1866 * repeel is true, re-peel the entry even if there is an old peeled1867 * value that is already stored in it.1868 *1869 * It is OK to call this function with a packed reference entry that1870 * might be stale and might even refer to an object that has since1871 * been garbage-collected. In such a case, if the entry has1872 * REF_KNOWS_PEELED then leave the status unchanged and return1873 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1874 */1875static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1876{1877enum peel_status status;18781879if(entry->flag & REF_KNOWS_PEELED) {1880if(repeel) {1881 entry->flag &= ~REF_KNOWS_PEELED;1882oidclr(&entry->u.value.peeled);1883}else{1884returnis_null_oid(&entry->u.value.peeled) ?1885 PEEL_NON_TAG : PEEL_PEELED;1886}1887}1888if(entry->flag & REF_ISBROKEN)1889return PEEL_BROKEN;1890if(entry->flag & REF_ISSYMREF)1891return PEEL_IS_SYMREF;18921893 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1894if(status == PEEL_PEELED || status == PEEL_NON_TAG)1895 entry->flag |= REF_KNOWS_PEELED;1896return status;1897}18981899intpeel_ref(const char*refname,unsigned char*sha1)1900{1901int flag;1902unsigned char base[20];19031904if(current_ref && (current_ref->name == refname1905|| !strcmp(current_ref->name, refname))) {1906if(peel_entry(current_ref,0))1907return-1;1908hashcpy(sha1, current_ref->u.value.peeled.hash);1909return0;1910}19111912if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1913return-1;19141915/*1916 * If the reference is packed, read its ref_entry from the1917 * cache in the hope that we already know its peeled value.1918 * We only try this optimization on packed references because1919 * (a) forcing the filling of the loose reference cache could1920 * be expensive and (b) loose references anyway usually do not1921 * have REF_KNOWS_PEELED.1922 */1923if(flag & REF_ISPACKED) {1924struct ref_entry *r =get_packed_ref(refname);1925if(r) {1926if(peel_entry(r,0))1927return-1;1928hashcpy(sha1, r->u.value.peeled.hash);1929return0;1930}1931}19321933returnpeel_object(base, sha1);1934}19351936struct warn_if_dangling_data {1937FILE*fp;1938const char*refname;1939const struct string_list *refnames;1940const char*msg_fmt;1941};19421943static intwarn_if_dangling_symref(const char*refname,const struct object_id *oid,1944int flags,void*cb_data)1945{1946struct warn_if_dangling_data *d = cb_data;1947const char*resolves_to;1948struct object_id junk;19491950if(!(flags & REF_ISSYMREF))1951return0;19521953 resolves_to =resolve_ref_unsafe(refname,0, junk.hash, NULL);1954if(!resolves_to1955|| (d->refname1956?strcmp(resolves_to, d->refname)1957: !string_list_has_string(d->refnames, resolves_to))) {1958return0;1959}19601961fprintf(d->fp, d->msg_fmt, refname);1962fputc('\n', d->fp);1963return0;1964}19651966voidwarn_dangling_symref(FILE*fp,const char*msg_fmt,const char*refname)1967{1968struct warn_if_dangling_data data;19691970 data.fp = fp;1971 data.refname = refname;1972 data.refnames = NULL;1973 data.msg_fmt = msg_fmt;1974for_each_rawref(warn_if_dangling_symref, &data);1975}19761977voidwarn_dangling_symrefs(FILE*fp,const char*msg_fmt,const struct string_list *refnames)1978{1979struct warn_if_dangling_data data;19801981 data.fp = fp;1982 data.refname = NULL;1983 data.refnames = refnames;1984 data.msg_fmt = msg_fmt;1985for_each_rawref(warn_if_dangling_symref, &data);1986}19871988/*1989 * Call fn for each reference in the specified ref_cache, omitting1990 * references not in the containing_dir of base. fn is called for all1991 * references, including broken ones. If fn ever returns a non-zero1992 * value, stop the iteration and return that value; otherwise, return1993 * 0.1994 */1995static intdo_for_each_entry(struct ref_cache *refs,const char*base,1996 each_ref_entry_fn fn,void*cb_data)1997{1998struct packed_ref_cache *packed_ref_cache;1999struct ref_dir *loose_dir;2000struct ref_dir *packed_dir;2001int retval =0;20022003/*2004 * We must make sure that all loose refs are read before accessing the2005 * packed-refs file; this avoids a race condition in which loose refs2006 * are migrated to the packed-refs file by a simultaneous process, but2007 * our in-memory view is from before the migration. get_packed_ref_cache()2008 * takes care of making sure our view is up to date with what is on2009 * disk.2010 */2011 loose_dir =get_loose_refs(refs);2012if(base && *base) {2013 loose_dir =find_containing_dir(loose_dir, base,0);2014}2015if(loose_dir)2016prime_ref_dir(loose_dir);20172018 packed_ref_cache =get_packed_ref_cache(refs);2019acquire_packed_ref_cache(packed_ref_cache);2020 packed_dir =get_packed_ref_dir(packed_ref_cache);2021if(base && *base) {2022 packed_dir =find_containing_dir(packed_dir, base,0);2023}20242025if(packed_dir && loose_dir) {2026sort_ref_dir(packed_dir);2027sort_ref_dir(loose_dir);2028 retval =do_for_each_entry_in_dirs(2029 packed_dir, loose_dir, fn, cb_data);2030}else if(packed_dir) {2031sort_ref_dir(packed_dir);2032 retval =do_for_each_entry_in_dir(2033 packed_dir,0, fn, cb_data);2034}else if(loose_dir) {2035sort_ref_dir(loose_dir);2036 retval =do_for_each_entry_in_dir(2037 loose_dir,0, fn, cb_data);2038}20392040release_packed_ref_cache(packed_ref_cache);2041return retval;2042}20432044/*2045 * Call fn for each reference in the specified ref_cache for which the2046 * refname begins with base. If trim is non-zero, then trim that many2047 * characters off the beginning of each refname before passing the2048 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include2049 * broken references in the iteration. If fn ever returns a non-zero2050 * value, stop the iteration and return that value; otherwise, return2051 * 0.2052 */2053static intdo_for_each_ref(struct ref_cache *refs,const char*base,2054 each_ref_fn fn,int trim,int flags,void*cb_data)2055{2056struct ref_entry_cb data;2057 data.base = base;2058 data.trim = trim;2059 data.flags = flags;2060 data.fn = fn;2061 data.cb_data = cb_data;20622063if(ref_paranoia <0)2064 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);2065if(ref_paranoia)2066 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;20672068returndo_for_each_entry(refs, base, do_one_ref, &data);2069}20702071static intdo_head_ref(const char*submodule, each_ref_fn fn,void*cb_data)2072{2073struct object_id oid;2074int flag;20752076if(submodule) {2077if(resolve_gitlink_ref(submodule,"HEAD", oid.hash) ==0)2078returnfn("HEAD", &oid,0, cb_data);20792080return0;2081}20822083if(!read_ref_full("HEAD", RESOLVE_REF_READING, oid.hash, &flag))2084returnfn("HEAD", &oid, flag, cb_data);20852086return0;2087}20882089inthead_ref(each_ref_fn fn,void*cb_data)2090{2091returndo_head_ref(NULL, fn, cb_data);2092}20932094inthead_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2095{2096returndo_head_ref(submodule, fn, cb_data);2097}20982099intfor_each_ref(each_ref_fn fn,void*cb_data)2100{2101returndo_for_each_ref(&ref_cache,"", fn,0,0, cb_data);2102}21032104intfor_each_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2105{2106returndo_for_each_ref(get_ref_cache(submodule),"", fn,0,0, cb_data);2107}21082109intfor_each_ref_in(const char*prefix, each_ref_fn fn,void*cb_data)2110{2111returndo_for_each_ref(&ref_cache, prefix, fn,strlen(prefix),0, cb_data);2112}21132114intfor_each_ref_in_submodule(const char*submodule,const char*prefix,2115 each_ref_fn fn,void*cb_data)2116{2117returndo_for_each_ref(get_ref_cache(submodule), prefix, fn,strlen(prefix),0, cb_data);2118}21192120intfor_each_tag_ref(each_ref_fn fn,void*cb_data)2121{2122returnfor_each_ref_in("refs/tags/", fn, cb_data);2123}21242125intfor_each_tag_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2126{2127returnfor_each_ref_in_submodule(submodule,"refs/tags/", fn, cb_data);2128}21292130intfor_each_branch_ref(each_ref_fn fn,void*cb_data)2131{2132returnfor_each_ref_in("refs/heads/", fn, cb_data);2133}21342135intfor_each_branch_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2136{2137returnfor_each_ref_in_submodule(submodule,"refs/heads/", fn, cb_data);2138}21392140intfor_each_remote_ref(each_ref_fn fn,void*cb_data)2141{2142returnfor_each_ref_in("refs/remotes/", fn, cb_data);2143}21442145intfor_each_remote_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2146{2147returnfor_each_ref_in_submodule(submodule,"refs/remotes/", fn, cb_data);2148}21492150intfor_each_replace_ref(each_ref_fn fn,void*cb_data)2151{2152returndo_for_each_ref(&ref_cache, git_replace_ref_base, fn,2153strlen(git_replace_ref_base),0, cb_data);2154}21552156inthead_ref_namespaced(each_ref_fn fn,void*cb_data)2157{2158struct strbuf buf = STRBUF_INIT;2159int ret =0;2160struct object_id oid;2161int flag;21622163strbuf_addf(&buf,"%sHEAD",get_git_namespace());2164if(!read_ref_full(buf.buf, RESOLVE_REF_READING, oid.hash, &flag))2165 ret =fn(buf.buf, &oid, flag, cb_data);2166strbuf_release(&buf);21672168return ret;2169}21702171intfor_each_namespaced_ref(each_ref_fn fn,void*cb_data)2172{2173struct strbuf buf = STRBUF_INIT;2174int ret;2175strbuf_addf(&buf,"%srefs/",get_git_namespace());2176 ret =do_for_each_ref(&ref_cache, buf.buf, fn,0,0, cb_data);2177strbuf_release(&buf);2178return ret;2179}21802181intfor_each_glob_ref_in(each_ref_fn fn,const char*pattern,2182const char*prefix,void*cb_data)2183{2184struct strbuf real_pattern = STRBUF_INIT;2185struct ref_filter filter;2186int ret;21872188if(!prefix && !starts_with(pattern,"refs/"))2189strbuf_addstr(&real_pattern,"refs/");2190else if(prefix)2191strbuf_addstr(&real_pattern, prefix);2192strbuf_addstr(&real_pattern, pattern);21932194if(!has_glob_specials(pattern)) {2195/* Append implied '/' '*' if not present. */2196if(real_pattern.buf[real_pattern.len -1] !='/')2197strbuf_addch(&real_pattern,'/');2198/* No need to check for '*', there is none. */2199strbuf_addch(&real_pattern,'*');2200}22012202 filter.pattern = real_pattern.buf;2203 filter.fn = fn;2204 filter.cb_data = cb_data;2205 ret =for_each_ref(filter_refs, &filter);22062207strbuf_release(&real_pattern);2208return ret;2209}22102211intfor_each_glob_ref(each_ref_fn fn,const char*pattern,void*cb_data)2212{2213returnfor_each_glob_ref_in(fn, pattern, NULL, cb_data);2214}22152216intfor_each_rawref(each_ref_fn fn,void*cb_data)2217{2218returndo_for_each_ref(&ref_cache,"", fn,0,2219 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);2220}22212222const char*prettify_refname(const char*name)2223{2224return name + (2225starts_with(name,"refs/heads/") ?11:2226starts_with(name,"refs/tags/") ?10:2227starts_with(name,"refs/remotes/") ?13:22280);2229}22302231static const char*ref_rev_parse_rules[] = {2232"%.*s",2233"refs/%.*s",2234"refs/tags/%.*s",2235"refs/heads/%.*s",2236"refs/remotes/%.*s",2237"refs/remotes/%.*s/HEAD",2238 NULL2239};22402241intrefname_match(const char*abbrev_name,const char*full_name)2242{2243const char**p;2244const int abbrev_name_len =strlen(abbrev_name);22452246for(p = ref_rev_parse_rules; *p; p++) {2247if(!strcmp(full_name,mkpath(*p, abbrev_name_len, abbrev_name))) {2248return1;2249}2250}22512252return0;2253}22542255static voidunlock_ref(struct ref_lock *lock)2256{2257/* Do not free lock->lk -- atexit() still looks at them */2258if(lock->lk)2259rollback_lock_file(lock->lk);2260free(lock->ref_name);2261free(lock->orig_ref_name);2262free(lock);2263}22642265/*2266 * Verify that the reference locked by lock has the value old_sha1.2267 * Fail if the reference doesn't exist and mustexist is set. Return 02268 * on success. On error, write an error message to err, set errno, and2269 * return a negative value.2270 */2271static intverify_lock(struct ref_lock *lock,2272const unsigned char*old_sha1,int mustexist,2273struct strbuf *err)2274{2275assert(err);22762277if(read_ref_full(lock->ref_name,2278 mustexist ? RESOLVE_REF_READING :0,2279 lock->old_oid.hash, NULL)) {2280int save_errno = errno;2281strbuf_addf(err,"can't verify ref%s", lock->ref_name);2282 errno = save_errno;2283return-1;2284}2285if(hashcmp(lock->old_oid.hash, old_sha1)) {2286strbuf_addf(err,"ref%sis at%sbut expected%s",2287 lock->ref_name,2288sha1_to_hex(lock->old_oid.hash),2289sha1_to_hex(old_sha1));2290 errno = EBUSY;2291return-1;2292}2293return0;2294}22952296static intremove_empty_directories(struct strbuf *path)2297{2298/*2299 * we want to create a file but there is a directory there;2300 * if that is an empty directory (or a directory that contains2301 * only empty directories), remove them.2302 */2303returnremove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);2304}23052306/*2307 * *string and *len will only be substituted, and *string returned (for2308 * later free()ing) if the string passed in is a magic short-hand form2309 * to name a branch.2310 */2311static char*substitute_branch_name(const char**string,int*len)2312{2313struct strbuf buf = STRBUF_INIT;2314int ret =interpret_branch_name(*string, *len, &buf);23152316if(ret == *len) {2317size_t size;2318*string =strbuf_detach(&buf, &size);2319*len = size;2320return(char*)*string;2321}23222323return NULL;2324}23252326intdwim_ref(const char*str,int len,unsigned char*sha1,char**ref)2327{2328char*last_branch =substitute_branch_name(&str, &len);2329const char**p, *r;2330int refs_found =0;23312332*ref = NULL;2333for(p = ref_rev_parse_rules; *p; p++) {2334char fullref[PATH_MAX];2335unsigned char sha1_from_ref[20];2336unsigned char*this_result;2337int flag;23382339 this_result = refs_found ? sha1_from_ref : sha1;2340mksnpath(fullref,sizeof(fullref), *p, len, str);2341 r =resolve_ref_unsafe(fullref, RESOLVE_REF_READING,2342 this_result, &flag);2343if(r) {2344if(!refs_found++)2345*ref =xstrdup(r);2346if(!warn_ambiguous_refs)2347break;2348}else if((flag & REF_ISSYMREF) &&strcmp(fullref,"HEAD")) {2349warning("ignoring dangling symref%s.", fullref);2350}else if((flag & REF_ISBROKEN) &&strchr(fullref,'/')) {2351warning("ignoring broken ref%s.", fullref);2352}2353}2354free(last_branch);2355return refs_found;2356}23572358intdwim_log(const char*str,int len,unsigned char*sha1,char**log)2359{2360char*last_branch =substitute_branch_name(&str, &len);2361const char**p;2362int logs_found =0;23632364*log = NULL;2365for(p = ref_rev_parse_rules; *p; p++) {2366unsigned char hash[20];2367char path[PATH_MAX];2368const char*ref, *it;23692370mksnpath(path,sizeof(path), *p, len, str);2371 ref =resolve_ref_unsafe(path, RESOLVE_REF_READING,2372 hash, NULL);2373if(!ref)2374continue;2375if(reflog_exists(path))2376 it = path;2377else if(strcmp(ref, path) &&reflog_exists(ref))2378 it = ref;2379else2380continue;2381if(!logs_found++) {2382*log =xstrdup(it);2383hashcpy(sha1, hash);2384}2385if(!warn_ambiguous_refs)2386break;2387}2388free(last_branch);2389return logs_found;2390}23912392/*2393 * Locks a ref returning the lock on success and NULL on failure.2394 * On failure errno is set to something meaningful.2395 */2396static struct ref_lock *lock_ref_sha1_basic(const char*refname,2397const unsigned char*old_sha1,2398const struct string_list *extras,2399const struct string_list *skip,2400unsigned int flags,int*type_p,2401struct strbuf *err)2402{2403struct strbuf ref_file = STRBUF_INIT;2404struct strbuf orig_ref_file = STRBUF_INIT;2405const char*orig_refname = refname;2406struct ref_lock *lock;2407int last_errno =0;2408int type, lflags;2409int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2410int resolve_flags =0;2411int attempts_remaining =3;24122413assert(err);24142415 lock =xcalloc(1,sizeof(struct ref_lock));24162417if(mustexist)2418 resolve_flags |= RESOLVE_REF_READING;2419if(flags & REF_DELETING) {2420 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;2421if(flags & REF_NODEREF)2422 resolve_flags |= RESOLVE_REF_NO_RECURSE;2423}24242425 refname =resolve_ref_unsafe(refname, resolve_flags,2426 lock->old_oid.hash, &type);2427if(!refname && errno == EISDIR) {2428/*2429 * we are trying to lock foo but we used to2430 * have foo/bar which now does not exist;2431 * it is normal for the empty directory 'foo'2432 * to remain.2433 */2434strbuf_git_path(&orig_ref_file,"%s", orig_refname);2435if(remove_empty_directories(&orig_ref_file)) {2436 last_errno = errno;2437if(!verify_refname_available(orig_refname, extras, skip,2438get_loose_refs(&ref_cache), err))2439strbuf_addf(err,"there are still refs under '%s'",2440 orig_refname);2441goto error_return;2442}2443 refname =resolve_ref_unsafe(orig_refname, resolve_flags,2444 lock->old_oid.hash, &type);2445}2446if(type_p)2447*type_p = type;2448if(!refname) {2449 last_errno = errno;2450if(last_errno != ENOTDIR ||2451!verify_refname_available(orig_refname, extras, skip,2452get_loose_refs(&ref_cache), err))2453strbuf_addf(err,"unable to resolve reference%s:%s",2454 orig_refname,strerror(last_errno));24552456goto error_return;2457}2458/*2459 * If the ref did not exist and we are creating it, make sure2460 * there is no existing packed ref whose name begins with our2461 * refname, nor a packed ref whose name is a proper prefix of2462 * our refname.2463 */2464if(is_null_oid(&lock->old_oid) &&2465verify_refname_available(refname, extras, skip,2466get_packed_refs(&ref_cache), err)) {2467 last_errno = ENOTDIR;2468goto error_return;2469}24702471 lock->lk =xcalloc(1,sizeof(struct lock_file));24722473 lflags =0;2474if(flags & REF_NODEREF) {2475 refname = orig_refname;2476 lflags |= LOCK_NO_DEREF;2477}2478 lock->ref_name =xstrdup(refname);2479 lock->orig_ref_name =xstrdup(orig_refname);2480strbuf_git_path(&ref_file,"%s", refname);24812482 retry:2483switch(safe_create_leading_directories_const(ref_file.buf)) {2484case SCLD_OK:2485break;/* success */2486case SCLD_VANISHED:2487if(--attempts_remaining >0)2488goto retry;2489/* fall through */2490default:2491 last_errno = errno;2492strbuf_addf(err,"unable to create directory for%s",2493 ref_file.buf);2494goto error_return;2495}24962497if(hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) <0) {2498 last_errno = errno;2499if(errno == ENOENT && --attempts_remaining >0)2500/*2501 * Maybe somebody just deleted one of the2502 * directories leading to ref_file. Try2503 * again:2504 */2505goto retry;2506else{2507unable_to_lock_message(ref_file.buf, errno, err);2508goto error_return;2509}2510}2511if(old_sha1 &&verify_lock(lock, old_sha1, mustexist, err)) {2512 last_errno = errno;2513goto error_return;2514}2515goto out;25162517 error_return:2518unlock_ref(lock);2519 lock = NULL;25202521 out:2522strbuf_release(&ref_file);2523strbuf_release(&orig_ref_file);2524 errno = last_errno;2525return lock;2526}25272528/*2529 * Write an entry to the packed-refs file for the specified refname.2530 * If peeled is non-NULL, write it as the entry's peeled value.2531 */2532static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2533unsigned char*peeled)2534{2535fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2536if(peeled)2537fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2538}25392540/*2541 * An each_ref_entry_fn that writes the entry to a packed-refs file.2542 */2543static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2544{2545enum peel_status peel_status =peel_entry(entry,0);25462547if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2548error("internal error:%sis not a valid packed reference!",2549 entry->name);2550write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2551 peel_status == PEEL_PEELED ?2552 entry->u.value.peeled.hash : NULL);2553return0;2554}25552556/*2557 * Lock the packed-refs file for writing. Flags is passed to2558 * hold_lock_file_for_update(). Return 0 on success. On errors, set2559 * errno appropriately and return a nonzero value.2560 */2561static intlock_packed_refs(int flags)2562{2563static int timeout_configured =0;2564static int timeout_value =1000;25652566struct packed_ref_cache *packed_ref_cache;25672568if(!timeout_configured) {2569git_config_get_int("core.packedrefstimeout", &timeout_value);2570 timeout_configured =1;2571}25722573if(hold_lock_file_for_update_timeout(2574&packlock,git_path("packed-refs"),2575 flags, timeout_value) <0)2576return-1;2577/*2578 * Get the current packed-refs while holding the lock. If the2579 * packed-refs file has been modified since we last read it,2580 * this will automatically invalidate the cache and re-read2581 * the packed-refs file.2582 */2583 packed_ref_cache =get_packed_ref_cache(&ref_cache);2584 packed_ref_cache->lock = &packlock;2585/* Increment the reference count to prevent it from being freed: */2586acquire_packed_ref_cache(packed_ref_cache);2587return0;2588}25892590/*2591 * Write the current version of the packed refs cache from memory to2592 * disk. The packed-refs file must already be locked for writing (see2593 * lock_packed_refs()). Return zero on success. On errors, set errno2594 * and return a nonzero value2595 */2596static intcommit_packed_refs(void)2597{2598struct packed_ref_cache *packed_ref_cache =2599get_packed_ref_cache(&ref_cache);2600int error =0;2601int save_errno =0;2602FILE*out;26032604if(!packed_ref_cache->lock)2605die("internal error: packed-refs not locked");26062607 out =fdopen_lock_file(packed_ref_cache->lock,"w");2608if(!out)2609die_errno("unable to fdopen packed-refs descriptor");26102611fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2612do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),26130, write_packed_entry_fn, out);26142615if(commit_lock_file(packed_ref_cache->lock)) {2616 save_errno = errno;2617 error = -1;2618}2619 packed_ref_cache->lock = NULL;2620release_packed_ref_cache(packed_ref_cache);2621 errno = save_errno;2622return error;2623}26242625/*2626 * Rollback the lockfile for the packed-refs file, and discard the2627 * in-memory packed reference cache. (The packed-refs file will be2628 * read anew if it is needed again after this function is called.)2629 */2630static voidrollback_packed_refs(void)2631{2632struct packed_ref_cache *packed_ref_cache =2633get_packed_ref_cache(&ref_cache);26342635if(!packed_ref_cache->lock)2636die("internal error: packed-refs not locked");2637rollback_lock_file(packed_ref_cache->lock);2638 packed_ref_cache->lock = NULL;2639release_packed_ref_cache(packed_ref_cache);2640clear_packed_ref_cache(&ref_cache);2641}26422643struct ref_to_prune {2644struct ref_to_prune *next;2645unsigned char sha1[20];2646char name[FLEX_ARRAY];2647};26482649struct pack_refs_cb_data {2650unsigned int flags;2651struct ref_dir *packed_refs;2652struct ref_to_prune *ref_to_prune;2653};26542655/*2656 * An each_ref_entry_fn that is run over loose references only. If2657 * the loose reference can be packed, add an entry in the packed ref2658 * cache. If the reference should be pruned, also add it to2659 * ref_to_prune in the pack_refs_cb_data.2660 */2661static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2662{2663struct pack_refs_cb_data *cb = cb_data;2664enum peel_status peel_status;2665struct ref_entry *packed_entry;2666int is_tag_ref =starts_with(entry->name,"refs/tags/");26672668/* ALWAYS pack tags */2669if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2670return0;26712672/* Do not pack symbolic or broken refs: */2673if((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2674return0;26752676/* Add a packed ref cache entry equivalent to the loose entry. */2677 peel_status =peel_entry(entry,1);2678if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2679die("internal error peeling reference%s(%s)",2680 entry->name,oid_to_hex(&entry->u.value.oid));2681 packed_entry =find_ref(cb->packed_refs, entry->name);2682if(packed_entry) {2683/* Overwrite existing packed entry with info from loose entry */2684 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2685oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2686}else{2687 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2688 REF_ISPACKED | REF_KNOWS_PEELED,0);2689add_ref(cb->packed_refs, packed_entry);2690}2691oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);26922693/* Schedule the loose reference for pruning if requested. */2694if((cb->flags & PACK_REFS_PRUNE)) {2695int namelen =strlen(entry->name) +1;2696struct ref_to_prune *n =xcalloc(1,sizeof(*n) + namelen);2697hashcpy(n->sha1, entry->u.value.oid.hash);2698strcpy(n->name, entry->name);2699 n->next = cb->ref_to_prune;2700 cb->ref_to_prune = n;2701}2702return0;2703}27042705/*2706 * Remove empty parents, but spare refs/ and immediate subdirs.2707 * Note: munges *name.2708 */2709static voidtry_remove_empty_parents(char*name)2710{2711char*p, *q;2712int i;2713 p = name;2714for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2715while(*p && *p !='/')2716 p++;2717/* tolerate duplicate slashes; see check_refname_format() */2718while(*p =='/')2719 p++;2720}2721for(q = p; *q; q++)2722;2723while(1) {2724while(q > p && *q !='/')2725 q--;2726while(q > p && *(q-1) =='/')2727 q--;2728if(q == p)2729break;2730*q ='\0';2731if(rmdir(git_path("%s", name)))2732break;2733}2734}27352736/* make sure nobody touched the ref, and unlink */2737static voidprune_ref(struct ref_to_prune *r)2738{2739struct ref_transaction *transaction;2740struct strbuf err = STRBUF_INIT;27412742if(check_refname_format(r->name,0))2743return;27442745 transaction =ref_transaction_begin(&err);2746if(!transaction ||2747ref_transaction_delete(transaction, r->name, r->sha1,2748 REF_ISPRUNING, NULL, &err) ||2749ref_transaction_commit(transaction, &err)) {2750ref_transaction_free(transaction);2751error("%s", err.buf);2752strbuf_release(&err);2753return;2754}2755ref_transaction_free(transaction);2756strbuf_release(&err);2757try_remove_empty_parents(r->name);2758}27592760static voidprune_refs(struct ref_to_prune *r)2761{2762while(r) {2763prune_ref(r);2764 r = r->next;2765}2766}27672768intpack_refs(unsigned int flags)2769{2770struct pack_refs_cb_data cbdata;27712772memset(&cbdata,0,sizeof(cbdata));2773 cbdata.flags = flags;27742775lock_packed_refs(LOCK_DIE_ON_ERROR);2776 cbdata.packed_refs =get_packed_refs(&ref_cache);27772778do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2779 pack_if_possible_fn, &cbdata);27802781if(commit_packed_refs())2782die_errno("unable to overwrite old ref-pack file");27832784prune_refs(cbdata.ref_to_prune);2785return0;2786}27872788/*2789 * Rewrite the packed-refs file, omitting any refs listed in2790 * 'refnames'. On error, leave packed-refs unchanged, write an error2791 * message to 'err', and return a nonzero value.2792 *2793 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2794 */2795static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2796{2797struct ref_dir *packed;2798struct string_list_item *refname;2799int ret, needs_repacking =0, removed =0;28002801assert(err);28022803/* Look for a packed ref */2804for_each_string_list_item(refname, refnames) {2805if(get_packed_ref(refname->string)) {2806 needs_repacking =1;2807break;2808}2809}28102811/* Avoid locking if we have nothing to do */2812if(!needs_repacking)2813return0;/* no refname exists in packed refs */28142815if(lock_packed_refs(0)) {2816unable_to_lock_message(git_path("packed-refs"), errno, err);2817return-1;2818}2819 packed =get_packed_refs(&ref_cache);28202821/* Remove refnames from the cache */2822for_each_string_list_item(refname, refnames)2823if(remove_entry(packed, refname->string) != -1)2824 removed =1;2825if(!removed) {2826/*2827 * All packed entries disappeared while we were2828 * acquiring the lock.2829 */2830rollback_packed_refs();2831return0;2832}28332834/* Write what remains */2835 ret =commit_packed_refs();2836if(ret)2837strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2838strerror(errno));2839return ret;2840}28412842static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2843{2844assert(err);28452846if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2847/*2848 * loose. The loose file name is the same as the2849 * lockfile name, minus ".lock":2850 */2851char*loose_filename =get_locked_file_path(lock->lk);2852int res =unlink_or_msg(loose_filename, err);2853free(loose_filename);2854if(res)2855return1;2856}2857return0;2858}28592860static intis_per_worktree_ref(const char*refname)2861{2862return!strcmp(refname,"HEAD");2863}28642865static intis_pseudoref_syntax(const char*refname)2866{2867const char*c;28682869for(c = refname; *c; c++) {2870if(!isupper(*c) && *c !='-'&& *c !='_')2871return0;2872}28732874return1;2875}28762877enum ref_type ref_type(const char*refname)2878{2879if(is_per_worktree_ref(refname))2880return REF_TYPE_PER_WORKTREE;2881if(is_pseudoref_syntax(refname))2882return REF_TYPE_PSEUDOREF;2883return REF_TYPE_NORMAL;2884}28852886static intwrite_pseudoref(const char*pseudoref,const unsigned char*sha1,2887const unsigned char*old_sha1,struct strbuf *err)2888{2889const char*filename;2890int fd;2891static struct lock_file lock;2892struct strbuf buf = STRBUF_INIT;2893int ret = -1;28942895strbuf_addf(&buf,"%s\n",sha1_to_hex(sha1));28962897 filename =git_path("%s", pseudoref);2898 fd =hold_lock_file_for_update(&lock, filename, LOCK_DIE_ON_ERROR);2899if(fd <0) {2900strbuf_addf(err,"Could not open '%s' for writing:%s",2901 filename,strerror(errno));2902return-1;2903}29042905if(old_sha1) {2906unsigned char actual_old_sha1[20];29072908if(read_ref(pseudoref, actual_old_sha1))2909die("could not read ref '%s'", pseudoref);2910if(hashcmp(actual_old_sha1, old_sha1)) {2911strbuf_addf(err,"Unexpected sha1 when writing%s", pseudoref);2912rollback_lock_file(&lock);2913goto done;2914}2915}29162917if(write_in_full(fd, buf.buf, buf.len) != buf.len) {2918strbuf_addf(err,"Could not write to '%s'", filename);2919rollback_lock_file(&lock);2920goto done;2921}29222923commit_lock_file(&lock);2924 ret =0;2925done:2926strbuf_release(&buf);2927return ret;2928}29292930static intdelete_pseudoref(const char*pseudoref,const unsigned char*old_sha1)2931{2932static struct lock_file lock;2933const char*filename;29342935 filename =git_path("%s", pseudoref);29362937if(old_sha1 && !is_null_sha1(old_sha1)) {2938int fd;2939unsigned char actual_old_sha1[20];29402941 fd =hold_lock_file_for_update(&lock, filename,2942 LOCK_DIE_ON_ERROR);2943if(fd <0)2944die_errno(_("Could not open '%s' for writing"), filename);2945if(read_ref(pseudoref, actual_old_sha1))2946die("could not read ref '%s'", pseudoref);2947if(hashcmp(actual_old_sha1, old_sha1)) {2948warning("Unexpected sha1 when deleting%s", pseudoref);2949rollback_lock_file(&lock);2950return-1;2951}29522953unlink(filename);2954rollback_lock_file(&lock);2955}else{2956unlink(filename);2957}29582959return0;2960}29612962intdelete_ref(const char*refname,const unsigned char*old_sha1,2963unsigned int flags)2964{2965struct ref_transaction *transaction;2966struct strbuf err = STRBUF_INIT;29672968if(ref_type(refname) == REF_TYPE_PSEUDOREF)2969returndelete_pseudoref(refname, old_sha1);29702971 transaction =ref_transaction_begin(&err);2972if(!transaction ||2973ref_transaction_delete(transaction, refname, old_sha1,2974 flags, NULL, &err) ||2975ref_transaction_commit(transaction, &err)) {2976error("%s", err.buf);2977ref_transaction_free(transaction);2978strbuf_release(&err);2979return1;2980}2981ref_transaction_free(transaction);2982strbuf_release(&err);2983return0;2984}29852986intdelete_refs(struct string_list *refnames)2987{2988struct strbuf err = STRBUF_INIT;2989int i, result =0;29902991if(!refnames->nr)2992return0;29932994 result =repack_without_refs(refnames, &err);2995if(result) {2996/*2997 * If we failed to rewrite the packed-refs file, then2998 * it is unsafe to try to remove loose refs, because2999 * doing so might expose an obsolete packed value for3000 * a reference that might even point at an object that3001 * has been garbage collected.3002 */3003if(refnames->nr ==1)3004error(_("could not delete reference%s:%s"),3005 refnames->items[0].string, err.buf);3006else3007error(_("could not delete references:%s"), err.buf);30083009goto out;3010}30113012for(i =0; i < refnames->nr; i++) {3013const char*refname = refnames->items[i].string;30143015if(delete_ref(refname, NULL,0))3016 result |=error(_("could not remove reference%s"), refname);3017}30183019out:3020strbuf_release(&err);3021return result;3022}30233024/*3025 * People using contrib's git-new-workdir have .git/logs/refs ->3026 * /some/other/path/.git/logs/refs, and that may live on another device.3027 *3028 * IOW, to avoid cross device rename errors, the temporary renamed log must3029 * live into logs/refs.3030 */3031#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"30323033static intrename_tmp_log(const char*newrefname)3034{3035int attempts_remaining =4;3036struct strbuf path = STRBUF_INIT;3037int ret = -1;30383039 retry:3040strbuf_reset(&path);3041strbuf_git_path(&path,"logs/%s", newrefname);3042switch(safe_create_leading_directories_const(path.buf)) {3043case SCLD_OK:3044break;/* success */3045case SCLD_VANISHED:3046if(--attempts_remaining >0)3047goto retry;3048/* fall through */3049default:3050error("unable to create directory for%s", newrefname);3051goto out;3052}30533054if(rename(git_path(TMP_RENAMED_LOG), path.buf)) {3055if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {3056/*3057 * rename(a, b) when b is an existing3058 * directory ought to result in ISDIR, but3059 * Solaris 5.8 gives ENOTDIR. Sheesh.3060 */3061if(remove_empty_directories(&path)) {3062error("Directory not empty: logs/%s", newrefname);3063goto out;3064}3065goto retry;3066}else if(errno == ENOENT && --attempts_remaining >0) {3067/*3068 * Maybe another process just deleted one of3069 * the directories in the path to newrefname.3070 * Try again from the beginning.3071 */3072goto retry;3073}else{3074error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",3075 newrefname,strerror(errno));3076goto out;3077}3078}3079 ret =0;3080out:3081strbuf_release(&path);3082return ret;3083}30843085static intrename_ref_available(const char*oldname,const char*newname)3086{3087struct string_list skip = STRING_LIST_INIT_NODUP;3088struct strbuf err = STRBUF_INIT;3089int ret;30903091string_list_insert(&skip, oldname);3092 ret = !verify_refname_available(newname, NULL, &skip,3093get_packed_refs(&ref_cache), &err)3094&& !verify_refname_available(newname, NULL, &skip,3095get_loose_refs(&ref_cache), &err);3096if(!ret)3097error("%s", err.buf);30983099string_list_clear(&skip,0);3100strbuf_release(&err);3101return ret;3102}31033104static intwrite_ref_to_lockfile(struct ref_lock *lock,3105const unsigned char*sha1,struct strbuf *err);3106static intcommit_ref_update(struct ref_lock *lock,3107const unsigned char*sha1,const char*logmsg,3108int flags,struct strbuf *err);31093110intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)3111{3112unsigned char sha1[20], orig_sha1[20];3113int flag =0, logmoved =0;3114struct ref_lock *lock;3115struct stat loginfo;3116int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);3117const char*symref = NULL;3118struct strbuf err = STRBUF_INIT;31193120if(log &&S_ISLNK(loginfo.st_mode))3121returnerror("reflog for%sis a symlink", oldrefname);31223123 symref =resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,3124 orig_sha1, &flag);3125if(flag & REF_ISSYMREF)3126returnerror("refname%sis a symbolic ref, renaming it is not supported",3127 oldrefname);3128if(!symref)3129returnerror("refname%snot found", oldrefname);31303131if(!rename_ref_available(oldrefname, newrefname))3132return1;31333134if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))3135returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",3136 oldrefname,strerror(errno));31373138if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {3139error("unable to delete old%s", oldrefname);3140goto rollback;3141}31423143if(!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&3144delete_ref(newrefname, sha1, REF_NODEREF)) {3145if(errno==EISDIR) {3146struct strbuf path = STRBUF_INIT;3147int result;31483149strbuf_git_path(&path,"%s", newrefname);3150 result =remove_empty_directories(&path);3151strbuf_release(&path);31523153if(result) {3154error("Directory not empty:%s", newrefname);3155goto rollback;3156}3157}else{3158error("unable to delete existing%s", newrefname);3159goto rollback;3160}3161}31623163if(log &&rename_tmp_log(newrefname))3164goto rollback;31653166 logmoved = log;31673168 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL,0, NULL, &err);3169if(!lock) {3170error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);3171strbuf_release(&err);3172goto rollback;3173}3174hashcpy(lock->old_oid.hash, orig_sha1);31753176if(write_ref_to_lockfile(lock, orig_sha1, &err) ||3177commit_ref_update(lock, orig_sha1, logmsg,0, &err)) {3178error("unable to write current sha1 into%s:%s", newrefname, err.buf);3179strbuf_release(&err);3180goto rollback;3181}31823183return0;31843185 rollback:3186 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL,0, NULL, &err);3187if(!lock) {3188error("unable to lock%sfor rollback:%s", oldrefname, err.buf);3189strbuf_release(&err);3190goto rollbacklog;3191}31923193 flag = log_all_ref_updates;3194 log_all_ref_updates =0;3195if(write_ref_to_lockfile(lock, orig_sha1, &err) ||3196commit_ref_update(lock, orig_sha1, NULL,0, &err)) {3197error("unable to write current sha1 into%s:%s", oldrefname, err.buf);3198strbuf_release(&err);3199}3200 log_all_ref_updates = flag;32013202 rollbacklog:3203if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))3204error("unable to restore logfile%sfrom%s:%s",3205 oldrefname, newrefname,strerror(errno));3206if(!logmoved && log &&3207rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))3208error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",3209 oldrefname,strerror(errno));32103211return1;3212}32133214static intclose_ref(struct ref_lock *lock)3215{3216if(close_lock_file(lock->lk))3217return-1;3218return0;3219}32203221static intcommit_ref(struct ref_lock *lock)3222{3223if(commit_lock_file(lock->lk))3224return-1;3225return0;3226}32273228/*3229 * copy the reflog message msg to buf, which has been allocated sufficiently3230 * large, while cleaning up the whitespaces. Especially, convert LF to space,3231 * because reflog file is one line per entry.3232 */3233static intcopy_msg(char*buf,const char*msg)3234{3235char*cp = buf;3236char c;3237int wasspace =1;32383239*cp++ ='\t';3240while((c = *msg++)) {3241if(wasspace &&isspace(c))3242continue;3243 wasspace =isspace(c);3244if(wasspace)3245 c =' ';3246*cp++ = c;3247}3248while(buf < cp &&isspace(cp[-1]))3249 cp--;3250*cp++ ='\n';3251return cp - buf;3252}32533254static intshould_autocreate_reflog(const char*refname)3255{3256if(!log_all_ref_updates)3257return0;3258returnstarts_with(refname,"refs/heads/") ||3259starts_with(refname,"refs/remotes/") ||3260starts_with(refname,"refs/notes/") ||3261!strcmp(refname,"HEAD");3262}32633264/*3265 * Create a reflog for a ref. If force_create = 0, the reflog will3266 * only be created for certain refs (those for which3267 * should_autocreate_reflog returns non-zero. Otherwise, create it3268 * regardless of the ref name. Fill in *err and return -1 on failure.3269 */3270static intlog_ref_setup(const char*refname,struct strbuf *logfile,struct strbuf *err,int force_create)3271{3272int logfd, oflags = O_APPEND | O_WRONLY;32733274strbuf_git_path(logfile,"logs/%s", refname);3275if(force_create ||should_autocreate_reflog(refname)) {3276if(safe_create_leading_directories(logfile->buf) <0) {3277strbuf_addf(err,"unable to create directory for%s: "3278"%s", logfile->buf,strerror(errno));3279return-1;3280}3281 oflags |= O_CREAT;3282}32833284 logfd =open(logfile->buf, oflags,0666);3285if(logfd <0) {3286if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))3287return0;32883289if(errno == EISDIR) {3290if(remove_empty_directories(logfile)) {3291strbuf_addf(err,"There are still logs under "3292"'%s'", logfile->buf);3293return-1;3294}3295 logfd =open(logfile->buf, oflags,0666);3296}32973298if(logfd <0) {3299strbuf_addf(err,"unable to append to%s:%s",3300 logfile->buf,strerror(errno));3301return-1;3302}3303}33043305adjust_shared_perm(logfile->buf);3306close(logfd);3307return0;3308}330933103311intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)3312{3313int ret;3314struct strbuf sb = STRBUF_INIT;33153316 ret =log_ref_setup(refname, &sb, err, force_create);3317strbuf_release(&sb);3318return ret;3319}33203321static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,3322const unsigned char*new_sha1,3323const char*committer,const char*msg)3324{3325int msglen, written;3326unsigned maxlen, len;3327char*logrec;33283329 msglen = msg ?strlen(msg) :0;3330 maxlen =strlen(committer) + msglen +100;3331 logrec =xmalloc(maxlen);3332 len =xsnprintf(logrec, maxlen,"%s %s %s\n",3333sha1_to_hex(old_sha1),3334sha1_to_hex(new_sha1),3335 committer);3336if(msglen)3337 len +=copy_msg(logrec + len -1, msg) -1;33383339 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;3340free(logrec);3341if(written != len)3342return-1;33433344return0;3345}33463347static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,3348const unsigned char*new_sha1,const char*msg,3349struct strbuf *logfile,int flags,3350struct strbuf *err)3351{3352int logfd, result, oflags = O_APPEND | O_WRONLY;33533354if(log_all_ref_updates <0)3355 log_all_ref_updates = !is_bare_repository();33563357 result =log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);33583359if(result)3360return result;33613362 logfd =open(logfile->buf, oflags);3363if(logfd <0)3364return0;3365 result =log_ref_write_fd(logfd, old_sha1, new_sha1,3366git_committer_info(0), msg);3367if(result) {3368strbuf_addf(err,"unable to append to%s:%s", logfile->buf,3369strerror(errno));3370close(logfd);3371return-1;3372}3373if(close(logfd)) {3374strbuf_addf(err,"unable to append to%s:%s", logfile->buf,3375strerror(errno));3376return-1;3377}3378return0;3379}33803381static intlog_ref_write(const char*refname,const unsigned char*old_sha1,3382const unsigned char*new_sha1,const char*msg,3383int flags,struct strbuf *err)3384{3385struct strbuf sb = STRBUF_INIT;3386int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,3387 err);3388strbuf_release(&sb);3389return ret;3390}33913392intis_branch(const char*refname)3393{3394return!strcmp(refname,"HEAD") ||starts_with(refname,"refs/heads/");3395}33963397/*3398 * Write sha1 into the open lockfile, then close the lockfile. On3399 * errors, rollback the lockfile, fill in *err and3400 * return -1.3401 */3402static intwrite_ref_to_lockfile(struct ref_lock *lock,3403const unsigned char*sha1,struct strbuf *err)3404{3405static char term ='\n';3406struct object *o;3407int fd;34083409 o =parse_object(sha1);3410if(!o) {3411strbuf_addf(err,3412"Trying to write ref%swith nonexistent object%s",3413 lock->ref_name,sha1_to_hex(sha1));3414unlock_ref(lock);3415return-1;3416}3417if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {3418strbuf_addf(err,3419"Trying to write non-commit object%sto branch%s",3420sha1_to_hex(sha1), lock->ref_name);3421unlock_ref(lock);3422return-1;3423}3424 fd =get_lock_file_fd(lock->lk);3425if(write_in_full(fd,sha1_to_hex(sha1),40) !=40||3426write_in_full(fd, &term,1) !=1||3427close_ref(lock) <0) {3428strbuf_addf(err,3429"Couldn't write%s",get_lock_file_path(lock->lk));3430unlock_ref(lock);3431return-1;3432}3433return0;3434}34353436/*3437 * Commit a change to a loose reference that has already been written3438 * to the loose reference lockfile. Also update the reflogs if3439 * necessary, using the specified lockmsg (which can be NULL).3440 */3441static intcommit_ref_update(struct ref_lock *lock,3442const unsigned char*sha1,const char*logmsg,3443int flags,struct strbuf *err)3444{3445clear_loose_ref_cache(&ref_cache);3446if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0||3447(strcmp(lock->ref_name, lock->orig_ref_name) &&3448log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0)) {3449char*old_msg =strbuf_detach(err, NULL);3450strbuf_addf(err,"Cannot update the ref '%s':%s",3451 lock->ref_name, old_msg);3452free(old_msg);3453unlock_ref(lock);3454return-1;3455}3456if(strcmp(lock->orig_ref_name,"HEAD") !=0) {3457/*3458 * Special hack: If a branch is updated directly and HEAD3459 * points to it (may happen on the remote side of a push3460 * for example) then logically the HEAD reflog should be3461 * updated too.3462 * A generic solution implies reverse symref information,3463 * but finding all symrefs pointing to the given branch3464 * would be rather costly for this rare event (the direct3465 * update of a branch) to be worth it. So let's cheat and3466 * check with HEAD only which should cover 99% of all usage3467 * scenarios (even 100% of the default ones).3468 */3469unsigned char head_sha1[20];3470int head_flag;3471const char*head_ref;3472 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3473 head_sha1, &head_flag);3474if(head_ref && (head_flag & REF_ISSYMREF) &&3475!strcmp(head_ref, lock->ref_name)) {3476struct strbuf log_err = STRBUF_INIT;3477if(log_ref_write("HEAD", lock->old_oid.hash, sha1,3478 logmsg,0, &log_err)) {3479error("%s", log_err.buf);3480strbuf_release(&log_err);3481}3482}3483}3484if(commit_ref(lock)) {3485error("Couldn't set%s", lock->ref_name);3486unlock_ref(lock);3487return-1;3488}34893490unlock_ref(lock);3491return0;3492}34933494intcreate_symref(const char*ref_target,const char*refs_heads_master,3495const char*logmsg)3496{3497char*lockpath = NULL;3498char ref[1000];3499int fd, len, written;3500char*git_HEAD =git_pathdup("%s", ref_target);3501unsigned char old_sha1[20], new_sha1[20];3502struct strbuf err = STRBUF_INIT;35033504if(logmsg &&read_ref(ref_target, old_sha1))3505hashclr(old_sha1);35063507if(safe_create_leading_directories(git_HEAD) <0)3508returnerror("unable to create directory for%s", git_HEAD);35093510#ifndef NO_SYMLINK_HEAD3511if(prefer_symlink_refs) {3512unlink(git_HEAD);3513if(!symlink(refs_heads_master, git_HEAD))3514goto done;3515fprintf(stderr,"no symlink - falling back to symbolic ref\n");3516}3517#endif35183519 len =snprintf(ref,sizeof(ref),"ref:%s\n", refs_heads_master);3520if(sizeof(ref) <= len) {3521error("refname too long:%s", refs_heads_master);3522goto error_free_return;3523}3524 lockpath =mkpathdup("%s.lock", git_HEAD);3525 fd =open(lockpath, O_CREAT | O_EXCL | O_WRONLY,0666);3526if(fd <0) {3527error("Unable to open%sfor writing", lockpath);3528goto error_free_return;3529}3530 written =write_in_full(fd, ref, len);3531if(close(fd) !=0|| written != len) {3532error("Unable to write to%s", lockpath);3533goto error_unlink_return;3534}3535if(rename(lockpath, git_HEAD) <0) {3536error("Unable to create%s", git_HEAD);3537goto error_unlink_return;3538}3539if(adjust_shared_perm(git_HEAD)) {3540error("Unable to fix permissions on%s", lockpath);3541 error_unlink_return:3542unlink_or_warn(lockpath);3543 error_free_return:3544free(lockpath);3545free(git_HEAD);3546return-1;3547}3548free(lockpath);35493550#ifndef NO_SYMLINK_HEAD3551 done:3552#endif3553if(logmsg && !read_ref(refs_heads_master, new_sha1) &&3554log_ref_write(ref_target, old_sha1, new_sha1, logmsg,0, &err)) {3555error("%s", err.buf);3556strbuf_release(&err);3557}35583559free(git_HEAD);3560return0;3561}35623563struct read_ref_at_cb {3564const char*refname;3565unsigned long at_time;3566int cnt;3567int reccnt;3568unsigned char*sha1;3569int found_it;35703571unsigned char osha1[20];3572unsigned char nsha1[20];3573int tz;3574unsigned long date;3575char**msg;3576unsigned long*cutoff_time;3577int*cutoff_tz;3578int*cutoff_cnt;3579};35803581static intread_ref_at_ent(unsigned char*osha1,unsigned char*nsha1,3582const char*email,unsigned long timestamp,int tz,3583const char*message,void*cb_data)3584{3585struct read_ref_at_cb *cb = cb_data;35863587 cb->reccnt++;3588 cb->tz = tz;3589 cb->date = timestamp;35903591if(timestamp <= cb->at_time || cb->cnt ==0) {3592if(cb->msg)3593*cb->msg =xstrdup(message);3594if(cb->cutoff_time)3595*cb->cutoff_time = timestamp;3596if(cb->cutoff_tz)3597*cb->cutoff_tz = tz;3598if(cb->cutoff_cnt)3599*cb->cutoff_cnt = cb->reccnt -1;3600/*3601 * we have not yet updated cb->[n|o]sha1 so they still3602 * hold the values for the previous record.3603 */3604if(!is_null_sha1(cb->osha1)) {3605hashcpy(cb->sha1, nsha1);3606if(hashcmp(cb->osha1, nsha1))3607warning("Log for ref%shas gap after%s.",3608 cb->refname,show_date(cb->date, cb->tz,DATE_MODE(RFC2822)));3609}3610else if(cb->date == cb->at_time)3611hashcpy(cb->sha1, nsha1);3612else if(hashcmp(nsha1, cb->sha1))3613warning("Log for ref%sunexpectedly ended on%s.",3614 cb->refname,show_date(cb->date, cb->tz,3615DATE_MODE(RFC2822)));3616hashcpy(cb->osha1, osha1);3617hashcpy(cb->nsha1, nsha1);3618 cb->found_it =1;3619return1;3620}3621hashcpy(cb->osha1, osha1);3622hashcpy(cb->nsha1, nsha1);3623if(cb->cnt >0)3624 cb->cnt--;3625return0;3626}36273628static intread_ref_at_ent_oldest(unsigned char*osha1,unsigned char*nsha1,3629const char*email,unsigned long timestamp,3630int tz,const char*message,void*cb_data)3631{3632struct read_ref_at_cb *cb = cb_data;36333634if(cb->msg)3635*cb->msg =xstrdup(message);3636if(cb->cutoff_time)3637*cb->cutoff_time = timestamp;3638if(cb->cutoff_tz)3639*cb->cutoff_tz = tz;3640if(cb->cutoff_cnt)3641*cb->cutoff_cnt = cb->reccnt;3642hashcpy(cb->sha1, osha1);3643if(is_null_sha1(cb->sha1))3644hashcpy(cb->sha1, nsha1);3645/* We just want the first entry */3646return1;3647}36483649intread_ref_at(const char*refname,unsigned int flags,unsigned long at_time,int cnt,3650unsigned char*sha1,char**msg,3651unsigned long*cutoff_time,int*cutoff_tz,int*cutoff_cnt)3652{3653struct read_ref_at_cb cb;36543655memset(&cb,0,sizeof(cb));3656 cb.refname = refname;3657 cb.at_time = at_time;3658 cb.cnt = cnt;3659 cb.msg = msg;3660 cb.cutoff_time = cutoff_time;3661 cb.cutoff_tz = cutoff_tz;3662 cb.cutoff_cnt = cutoff_cnt;3663 cb.sha1 = sha1;36643665for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);36663667if(!cb.reccnt) {3668if(flags & GET_SHA1_QUIETLY)3669exit(128);3670else3671die("Log for%sis empty.", refname);3672}3673if(cb.found_it)3674return0;36753676for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);36773678return1;3679}36803681intreflog_exists(const char*refname)3682{3683struct stat st;36843685return!lstat(git_path("logs/%s", refname), &st) &&3686S_ISREG(st.st_mode);3687}36883689intdelete_reflog(const char*refname)3690{3691returnremove_path(git_path("logs/%s", refname));3692}36933694static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3695{3696unsigned char osha1[20], nsha1[20];3697char*email_end, *message;3698unsigned long timestamp;3699int tz;37003701/* old SP new SP name <email> SP time TAB msg LF */3702if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3703get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3704get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3705!(email_end =strchr(sb->buf +82,'>')) ||3706 email_end[1] !=' '||3707!(timestamp =strtoul(email_end +2, &message,10)) ||3708!message || message[0] !=' '||3709(message[1] !='+'&& message[1] !='-') ||3710!isdigit(message[2]) || !isdigit(message[3]) ||3711!isdigit(message[4]) || !isdigit(message[5]))3712return0;/* corrupt? */3713 email_end[1] ='\0';3714 tz =strtol(message +1, NULL,10);3715if(message[6] !='\t')3716 message +=6;3717else3718 message +=7;3719returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3720}37213722static char*find_beginning_of_line(char*bob,char*scan)3723{3724while(bob < scan && *(--scan) !='\n')3725;/* keep scanning backwards */3726/*3727 * Return either beginning of the buffer, or LF at the end of3728 * the previous line.3729 */3730return scan;3731}37323733intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)3734{3735struct strbuf sb = STRBUF_INIT;3736FILE*logfp;3737long pos;3738int ret =0, at_tail =1;37393740 logfp =fopen(git_path("logs/%s", refname),"r");3741if(!logfp)3742return-1;37433744/* Jump to the end */3745if(fseek(logfp,0, SEEK_END) <0)3746returnerror("cannot seek back reflog for%s:%s",3747 refname,strerror(errno));3748 pos =ftell(logfp);3749while(!ret &&0< pos) {3750int cnt;3751size_t nread;3752char buf[BUFSIZ];3753char*endp, *scanp;37543755/* Fill next block from the end */3756 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3757if(fseek(logfp, pos - cnt, SEEK_SET))3758returnerror("cannot seek back reflog for%s:%s",3759 refname,strerror(errno));3760 nread =fread(buf, cnt,1, logfp);3761if(nread !=1)3762returnerror("cannot read%dbytes from reflog for%s:%s",3763 cnt, refname,strerror(errno));3764 pos -= cnt;37653766 scanp = endp = buf + cnt;3767if(at_tail && scanp[-1] =='\n')3768/* Looking at the final LF at the end of the file */3769 scanp--;3770 at_tail =0;37713772while(buf < scanp) {3773/*3774 * terminating LF of the previous line, or the beginning3775 * of the buffer.3776 */3777char*bp;37783779 bp =find_beginning_of_line(buf, scanp);37803781if(*bp =='\n') {3782/*3783 * The newline is the end of the previous line,3784 * so we know we have complete line starting3785 * at (bp + 1). Prefix it onto any prior data3786 * we collected for the line and process it.3787 */3788strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3789 scanp = bp;3790 endp = bp +1;3791 ret =show_one_reflog_ent(&sb, fn, cb_data);3792strbuf_reset(&sb);3793if(ret)3794break;3795}else if(!pos) {3796/*3797 * We are at the start of the buffer, and the3798 * start of the file; there is no previous3799 * line, and we have everything for this one.3800 * Process it, and we can end the loop.3801 */3802strbuf_splice(&sb,0,0, buf, endp - buf);3803 ret =show_one_reflog_ent(&sb, fn, cb_data);3804strbuf_reset(&sb);3805break;3806}38073808if(bp == buf) {3809/*3810 * We are at the start of the buffer, and there3811 * is more file to read backwards. Which means3812 * we are in the middle of a line. Note that we3813 * may get here even if *bp was a newline; that3814 * just means we are at the exact end of the3815 * previous line, rather than some spot in the3816 * middle.3817 *3818 * Save away what we have to be combined with3819 * the data from the next read.3820 */3821strbuf_splice(&sb,0,0, buf, endp - buf);3822break;3823}3824}38253826}3827if(!ret && sb.len)3828die("BUG: reverse reflog parser had leftover data");38293830fclose(logfp);3831strbuf_release(&sb);3832return ret;3833}38343835intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3836{3837FILE*logfp;3838struct strbuf sb = STRBUF_INIT;3839int ret =0;38403841 logfp =fopen(git_path("logs/%s", refname),"r");3842if(!logfp)3843return-1;38443845while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3846 ret =show_one_reflog_ent(&sb, fn, cb_data);3847fclose(logfp);3848strbuf_release(&sb);3849return ret;3850}3851/*3852 * Call fn for each reflog in the namespace indicated by name. name3853 * must be empty or end with '/'. Name will be used as a scratch3854 * space, but its contents will be restored before return.3855 */3856static intdo_for_each_reflog(struct strbuf *name, each_ref_fn fn,void*cb_data)3857{3858DIR*d =opendir(git_path("logs/%s", name->buf));3859int retval =0;3860struct dirent *de;3861int oldlen = name->len;38623863if(!d)3864return name->len ? errno :0;38653866while((de =readdir(d)) != NULL) {3867struct stat st;38683869if(de->d_name[0] =='.')3870continue;3871if(ends_with(de->d_name,".lock"))3872continue;3873strbuf_addstr(name, de->d_name);3874if(stat(git_path("logs/%s", name->buf), &st) <0) {3875;/* silently ignore */3876}else{3877if(S_ISDIR(st.st_mode)) {3878strbuf_addch(name,'/');3879 retval =do_for_each_reflog(name, fn, cb_data);3880}else{3881struct object_id oid;38823883if(read_ref_full(name->buf,0, oid.hash, NULL))3884 retval =error("bad ref for%s", name->buf);3885else3886 retval =fn(name->buf, &oid,0, cb_data);3887}3888if(retval)3889break;3890}3891strbuf_setlen(name, oldlen);3892}3893closedir(d);3894return retval;3895}38963897intfor_each_reflog(each_ref_fn fn,void*cb_data)3898{3899int retval;3900struct strbuf name;3901strbuf_init(&name, PATH_MAX);3902 retval =do_for_each_reflog(&name, fn, cb_data);3903strbuf_release(&name);3904return retval;3905}39063907/**3908 * Information needed for a single ref update. Set new_sha1 to the new3909 * value or to null_sha1 to delete the ref. To check the old value3910 * while the ref is locked, set (flags & REF_HAVE_OLD) and set3911 * old_sha1 to the old value, or to null_sha1 to ensure the ref does3912 * not exist before update.3913 */3914struct ref_update {3915/*3916 * If (flags & REF_HAVE_NEW), set the reference to this value:3917 */3918unsigned char new_sha1[20];3919/*3920 * If (flags & REF_HAVE_OLD), check that the reference3921 * previously had this value:3922 */3923unsigned char old_sha1[20];3924/*3925 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,3926 * REF_DELETING, and REF_ISPRUNING:3927 */3928unsigned int flags;3929struct ref_lock *lock;3930int type;3931char*msg;3932const char refname[FLEX_ARRAY];3933};39343935/*3936 * Transaction states.3937 * OPEN: The transaction is in a valid state and can accept new updates.3938 * An OPEN transaction can be committed.3939 * CLOSED: A closed transaction is no longer active and no other operations3940 * than free can be used on it in this state.3941 * A transaction can either become closed by successfully committing3942 * an active transaction or if there is a failure while building3943 * the transaction thus rendering it failed/inactive.3944 */3945enum ref_transaction_state {3946 REF_TRANSACTION_OPEN =0,3947 REF_TRANSACTION_CLOSED =13948};39493950/*3951 * Data structure for holding a reference transaction, which can3952 * consist of checks and updates to multiple references, carried out3953 * as atomically as possible. This structure is opaque to callers.3954 */3955struct ref_transaction {3956struct ref_update **updates;3957size_t alloc;3958size_t nr;3959enum ref_transaction_state state;3960};39613962struct ref_transaction *ref_transaction_begin(struct strbuf *err)3963{3964assert(err);39653966returnxcalloc(1,sizeof(struct ref_transaction));3967}39683969voidref_transaction_free(struct ref_transaction *transaction)3970{3971int i;39723973if(!transaction)3974return;39753976for(i =0; i < transaction->nr; i++) {3977free(transaction->updates[i]->msg);3978free(transaction->updates[i]);3979}3980free(transaction->updates);3981free(transaction);3982}39833984static struct ref_update *add_update(struct ref_transaction *transaction,3985const char*refname)3986{3987size_t len =strlen(refname);3988struct ref_update *update =xcalloc(1,sizeof(*update) + len +1);39893990strcpy((char*)update->refname, refname);3991ALLOC_GROW(transaction->updates, transaction->nr +1, transaction->alloc);3992 transaction->updates[transaction->nr++] = update;3993return update;3994}39953996intref_transaction_update(struct ref_transaction *transaction,3997const char*refname,3998const unsigned char*new_sha1,3999const unsigned char*old_sha1,4000unsigned int flags,const char*msg,4001struct strbuf *err)4002{4003struct ref_update *update;40044005assert(err);40064007if(transaction->state != REF_TRANSACTION_OPEN)4008die("BUG: update called for transaction that is not open");40094010if(new_sha1 && !is_null_sha1(new_sha1) &&4011check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {4012strbuf_addf(err,"refusing to update ref with bad name%s",4013 refname);4014return-1;4015}40164017 update =add_update(transaction, refname);4018if(new_sha1) {4019hashcpy(update->new_sha1, new_sha1);4020 flags |= REF_HAVE_NEW;4021}4022if(old_sha1) {4023hashcpy(update->old_sha1, old_sha1);4024 flags |= REF_HAVE_OLD;4025}4026 update->flags = flags;4027if(msg)4028 update->msg =xstrdup(msg);4029return0;4030}40314032intref_transaction_create(struct ref_transaction *transaction,4033const char*refname,4034const unsigned char*new_sha1,4035unsigned int flags,const char*msg,4036struct strbuf *err)4037{4038if(!new_sha1 ||is_null_sha1(new_sha1))4039die("BUG: create called without valid new_sha1");4040returnref_transaction_update(transaction, refname, new_sha1,4041 null_sha1, flags, msg, err);4042}40434044intref_transaction_delete(struct ref_transaction *transaction,4045const char*refname,4046const unsigned char*old_sha1,4047unsigned int flags,const char*msg,4048struct strbuf *err)4049{4050if(old_sha1 &&is_null_sha1(old_sha1))4051die("BUG: delete called with old_sha1 set to zeros");4052returnref_transaction_update(transaction, refname,4053 null_sha1, old_sha1,4054 flags, msg, err);4055}40564057intref_transaction_verify(struct ref_transaction *transaction,4058const char*refname,4059const unsigned char*old_sha1,4060unsigned int flags,4061struct strbuf *err)4062{4063if(!old_sha1)4064die("BUG: verify called with old_sha1 set to NULL");4065returnref_transaction_update(transaction, refname,4066 NULL, old_sha1,4067 flags, NULL, err);4068}40694070intupdate_ref(const char*msg,const char*refname,4071const unsigned char*new_sha1,const unsigned char*old_sha1,4072unsigned int flags,enum action_on_err onerr)4073{4074struct ref_transaction *t = NULL;4075struct strbuf err = STRBUF_INIT;4076int ret =0;40774078if(ref_type(refname) == REF_TYPE_PSEUDOREF) {4079 ret =write_pseudoref(refname, new_sha1, old_sha1, &err);4080}else{4081 t =ref_transaction_begin(&err);4082if(!t ||4083ref_transaction_update(t, refname, new_sha1, old_sha1,4084 flags, msg, &err) ||4085ref_transaction_commit(t, &err)) {4086 ret =1;4087ref_transaction_free(t);4088}4089}4090if(ret) {4091const char*str ="update_ref failed for ref '%s':%s";40924093switch(onerr) {4094case UPDATE_REFS_MSG_ON_ERR:4095error(str, refname, err.buf);4096break;4097case UPDATE_REFS_DIE_ON_ERR:4098die(str, refname, err.buf);4099break;4100case UPDATE_REFS_QUIET_ON_ERR:4101break;4102}4103strbuf_release(&err);4104return1;4105}4106strbuf_release(&err);4107if(t)4108ref_transaction_free(t);4109return0;4110}41114112static intref_update_reject_duplicates(struct string_list *refnames,4113struct strbuf *err)4114{4115int i, n = refnames->nr;41164117assert(err);41184119for(i =1; i < n; i++)4120if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {4121strbuf_addf(err,4122"Multiple updates for ref '%s' not allowed.",4123 refnames->items[i].string);4124return1;4125}4126return0;4127}41284129intref_transaction_commit(struct ref_transaction *transaction,4130struct strbuf *err)4131{4132int ret =0, i;4133int n = transaction->nr;4134struct ref_update **updates = transaction->updates;4135struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;4136struct string_list_item *ref_to_delete;4137struct string_list affected_refnames = STRING_LIST_INIT_NODUP;41384139assert(err);41404141if(transaction->state != REF_TRANSACTION_OPEN)4142die("BUG: commit called for transaction that is not open");41434144if(!n) {4145 transaction->state = REF_TRANSACTION_CLOSED;4146return0;4147}41484149/* Fail if a refname appears more than once in the transaction: */4150for(i =0; i < n; i++)4151string_list_append(&affected_refnames, updates[i]->refname);4152string_list_sort(&affected_refnames);4153if(ref_update_reject_duplicates(&affected_refnames, err)) {4154 ret = TRANSACTION_GENERIC_ERROR;4155goto cleanup;4156}41574158/*4159 * Acquire all locks, verify old values if provided, check4160 * that new values are valid, and write new values to the4161 * lockfiles, ready to be activated. Only keep one lockfile4162 * open at a time to avoid running out of file descriptors.4163 */4164for(i =0; i < n; i++) {4165struct ref_update *update = updates[i];41664167if((update->flags & REF_HAVE_NEW) &&4168is_null_sha1(update->new_sha1))4169 update->flags |= REF_DELETING;4170 update->lock =lock_ref_sha1_basic(4171 update->refname,4172((update->flags & REF_HAVE_OLD) ?4173 update->old_sha1 : NULL),4174&affected_refnames, NULL,4175 update->flags,4176&update->type,4177 err);4178if(!update->lock) {4179char*reason;41804181 ret = (errno == ENOTDIR)4182? TRANSACTION_NAME_CONFLICT4183: TRANSACTION_GENERIC_ERROR;4184 reason =strbuf_detach(err, NULL);4185strbuf_addf(err,"cannot lock ref '%s':%s",4186 update->refname, reason);4187free(reason);4188goto cleanup;4189}4190if((update->flags & REF_HAVE_NEW) &&4191!(update->flags & REF_DELETING)) {4192int overwriting_symref = ((update->type & REF_ISSYMREF) &&4193(update->flags & REF_NODEREF));41944195if(!overwriting_symref &&4196!hashcmp(update->lock->old_oid.hash, update->new_sha1)) {4197/*4198 * The reference already has the desired4199 * value, so we don't need to write it.4200 */4201}else if(write_ref_to_lockfile(update->lock,4202 update->new_sha1,4203 err)) {4204char*write_err =strbuf_detach(err, NULL);42054206/*4207 * The lock was freed upon failure of4208 * write_ref_to_lockfile():4209 */4210 update->lock = NULL;4211strbuf_addf(err,4212"cannot update the ref '%s':%s",4213 update->refname, write_err);4214free(write_err);4215 ret = TRANSACTION_GENERIC_ERROR;4216goto cleanup;4217}else{4218 update->flags |= REF_NEEDS_COMMIT;4219}4220}4221if(!(update->flags & REF_NEEDS_COMMIT)) {4222/*4223 * We didn't have to write anything to the lockfile.4224 * Close it to free up the file descriptor:4225 */4226if(close_ref(update->lock)) {4227strbuf_addf(err,"Couldn't close%s.lock",4228 update->refname);4229goto cleanup;4230}4231}4232}42334234/* Perform updates first so live commits remain referenced */4235for(i =0; i < n; i++) {4236struct ref_update *update = updates[i];42374238if(update->flags & REF_NEEDS_COMMIT) {4239if(commit_ref_update(update->lock,4240 update->new_sha1, update->msg,4241 update->flags, err)) {4242/* freed by commit_ref_update(): */4243 update->lock = NULL;4244 ret = TRANSACTION_GENERIC_ERROR;4245goto cleanup;4246}else{4247/* freed by commit_ref_update(): */4248 update->lock = NULL;4249}4250}4251}42524253/* Perform deletes now that updates are safely completed */4254for(i =0; i < n; i++) {4255struct ref_update *update = updates[i];42564257if(update->flags & REF_DELETING) {4258if(delete_ref_loose(update->lock, update->type, err)) {4259 ret = TRANSACTION_GENERIC_ERROR;4260goto cleanup;4261}42624263if(!(update->flags & REF_ISPRUNING))4264string_list_append(&refs_to_delete,4265 update->lock->ref_name);4266}4267}42684269if(repack_without_refs(&refs_to_delete, err)) {4270 ret = TRANSACTION_GENERIC_ERROR;4271goto cleanup;4272}4273for_each_string_list_item(ref_to_delete, &refs_to_delete)4274unlink_or_warn(git_path("logs/%s", ref_to_delete->string));4275clear_loose_ref_cache(&ref_cache);42764277cleanup:4278 transaction->state = REF_TRANSACTION_CLOSED;42794280for(i =0; i < n; i++)4281if(updates[i]->lock)4282unlock_ref(updates[i]->lock);4283string_list_clear(&refs_to_delete,0);4284string_list_clear(&affected_refnames,0);4285return ret;4286}42874288static intref_present(const char*refname,4289const struct object_id *oid,int flags,void*cb_data)4290{4291struct string_list *affected_refnames = cb_data;42924293returnstring_list_has_string(affected_refnames, refname);4294}42954296intinitial_ref_transaction_commit(struct ref_transaction *transaction,4297struct strbuf *err)4298{4299struct ref_dir *loose_refs =get_loose_refs(&ref_cache);4300struct ref_dir *packed_refs =get_packed_refs(&ref_cache);4301int ret =0, i;4302int n = transaction->nr;4303struct ref_update **updates = transaction->updates;4304struct string_list affected_refnames = STRING_LIST_INIT_NODUP;43054306assert(err);43074308if(transaction->state != REF_TRANSACTION_OPEN)4309die("BUG: commit called for transaction that is not open");43104311/* Fail if a refname appears more than once in the transaction: */4312for(i =0; i < n; i++)4313string_list_append(&affected_refnames, updates[i]->refname);4314string_list_sort(&affected_refnames);4315if(ref_update_reject_duplicates(&affected_refnames, err)) {4316 ret = TRANSACTION_GENERIC_ERROR;4317goto cleanup;4318}43194320/*4321 * It's really undefined to call this function in an active4322 * repository or when there are existing references: we are4323 * only locking and changing packed-refs, so (1) any4324 * simultaneous processes might try to change a reference at4325 * the same time we do, and (2) any existing loose versions of4326 * the references that we are setting would have precedence4327 * over our values. But some remote helpers create the remote4328 * "HEAD" and "master" branches before calling this function,4329 * so here we really only check that none of the references4330 * that we are creating already exists.4331 */4332if(for_each_rawref(ref_present, &affected_refnames))4333die("BUG: initial ref transaction called with existing refs");43344335for(i =0; i < n; i++) {4336struct ref_update *update = updates[i];43374338if((update->flags & REF_HAVE_OLD) &&4339!is_null_sha1(update->old_sha1))4340die("BUG: initial ref transaction with old_sha1 set");4341if(verify_refname_available(update->refname,4342&affected_refnames, NULL,4343 loose_refs, err) ||4344verify_refname_available(update->refname,4345&affected_refnames, NULL,4346 packed_refs, err)) {4347 ret = TRANSACTION_NAME_CONFLICT;4348goto cleanup;4349}4350}43514352if(lock_packed_refs(0)) {4353strbuf_addf(err,"unable to lock packed-refs file:%s",4354strerror(errno));4355 ret = TRANSACTION_GENERIC_ERROR;4356goto cleanup;4357}43584359for(i =0; i < n; i++) {4360struct ref_update *update = updates[i];43614362if((update->flags & REF_HAVE_NEW) &&4363!is_null_sha1(update->new_sha1))4364add_packed_ref(update->refname, update->new_sha1);4365}43664367if(commit_packed_refs()) {4368strbuf_addf(err,"unable to commit packed-refs file:%s",4369strerror(errno));4370 ret = TRANSACTION_GENERIC_ERROR;4371goto cleanup;4372}43734374cleanup:4375 transaction->state = REF_TRANSACTION_CLOSED;4376string_list_clear(&affected_refnames,0);4377return ret;4378}43794380char*shorten_unambiguous_ref(const char*refname,int strict)4381{4382int i;4383static char**scanf_fmts;4384static int nr_rules;4385char*short_name;43864387if(!nr_rules) {4388/*4389 * Pre-generate scanf formats from ref_rev_parse_rules[].4390 * Generate a format suitable for scanf from a4391 * ref_rev_parse_rules rule by interpolating "%s" at the4392 * location of the "%.*s".4393 */4394size_t total_len =0;4395size_t offset =0;43964397/* the rule list is NULL terminated, count them first */4398for(nr_rules =0; ref_rev_parse_rules[nr_rules]; nr_rules++)4399/* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */4400 total_len +=strlen(ref_rev_parse_rules[nr_rules]) -2+1;44014402 scanf_fmts =xmalloc(nr_rules *sizeof(char*) + total_len);44034404 offset =0;4405for(i =0; i < nr_rules; i++) {4406assert(offset < total_len);4407 scanf_fmts[i] = (char*)&scanf_fmts[nr_rules] + offset;4408 offset +=snprintf(scanf_fmts[i], total_len - offset,4409 ref_rev_parse_rules[i],2,"%s") +1;4410}4411}44124413/* bail out if there are no rules */4414if(!nr_rules)4415returnxstrdup(refname);44164417/* buffer for scanf result, at most refname must fit */4418 short_name =xstrdup(refname);44194420/* skip first rule, it will always match */4421for(i = nr_rules -1; i >0; --i) {4422int j;4423int rules_to_fail = i;4424int short_name_len;44254426if(1!=sscanf(refname, scanf_fmts[i], short_name))4427continue;44284429 short_name_len =strlen(short_name);44304431/*4432 * in strict mode, all (except the matched one) rules4433 * must fail to resolve to a valid non-ambiguous ref4434 */4435if(strict)4436 rules_to_fail = nr_rules;44374438/*4439 * check if the short name resolves to a valid ref,4440 * but use only rules prior to the matched one4441 */4442for(j =0; j < rules_to_fail; j++) {4443const char*rule = ref_rev_parse_rules[j];4444char refname[PATH_MAX];44454446/* skip matched rule */4447if(i == j)4448continue;44494450/*4451 * the short name is ambiguous, if it resolves4452 * (with this previous rule) to a valid ref4453 * read_ref() returns 0 on success4454 */4455mksnpath(refname,sizeof(refname),4456 rule, short_name_len, short_name);4457if(ref_exists(refname))4458break;4459}44604461/*4462 * short name is non-ambiguous if all previous rules4463 * haven't resolved to a valid ref4464 */4465if(j == rules_to_fail)4466return short_name;4467}44684469free(short_name);4470returnxstrdup(refname);4471}44724473static struct string_list *hide_refs;44744475intparse_hide_refs_config(const char*var,const char*value,const char*section)4476{4477if(!strcmp("transfer.hiderefs", var) ||4478/* NEEDSWORK: use parse_config_key() once both are merged */4479(starts_with(var, section) && var[strlen(section)] =='.'&&4480!strcmp(var +strlen(section),".hiderefs"))) {4481char*ref;4482int len;44834484if(!value)4485returnconfig_error_nonbool(var);4486 ref =xstrdup(value);4487 len =strlen(ref);4488while(len && ref[len -1] =='/')4489 ref[--len] ='\0';4490if(!hide_refs) {4491 hide_refs =xcalloc(1,sizeof(*hide_refs));4492 hide_refs->strdup_strings =1;4493}4494string_list_append(hide_refs, ref);4495}4496return0;4497}44984499intref_is_hidden(const char*refname)4500{4501int i;45024503if(!hide_refs)4504return0;4505for(i = hide_refs->nr -1; i >=0; i--) {4506const char*match = hide_refs->items[i].string;4507int neg =0;4508int len;45094510if(*match =='!') {4511 neg =1;4512 match++;4513}45144515if(!starts_with(refname, match))4516continue;4517 len =strlen(match);4518if(!refname[len] || refname[len] =='/')4519return!neg;4520}4521return0;4522}45234524struct expire_reflog_cb {4525unsigned int flags;4526 reflog_expiry_should_prune_fn *should_prune_fn;4527void*policy_cb;4528FILE*newlog;4529unsigned char last_kept_sha1[20];4530};45314532static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,4533const char*email,unsigned long timestamp,int tz,4534const char*message,void*cb_data)4535{4536struct expire_reflog_cb *cb = cb_data;4537struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;45384539if(cb->flags & EXPIRE_REFLOGS_REWRITE)4540 osha1 = cb->last_kept_sha1;45414542if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,4543 message, policy_cb)) {4544if(!cb->newlog)4545printf("would prune%s", message);4546else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4547printf("prune%s", message);4548}else{4549if(cb->newlog) {4550fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",4551sha1_to_hex(osha1),sha1_to_hex(nsha1),4552 email, timestamp, tz, message);4553hashcpy(cb->last_kept_sha1, nsha1);4554}4555if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4556printf("keep%s", message);4557}4558return0;4559}45604561intreflog_expire(const char*refname,const unsigned char*sha1,4562unsigned int flags,4563 reflog_expiry_prepare_fn prepare_fn,4564 reflog_expiry_should_prune_fn should_prune_fn,4565 reflog_expiry_cleanup_fn cleanup_fn,4566void*policy_cb_data)4567{4568static struct lock_file reflog_lock;4569struct expire_reflog_cb cb;4570struct ref_lock *lock;4571char*log_file;4572int status =0;4573int type;4574struct strbuf err = STRBUF_INIT;45754576memset(&cb,0,sizeof(cb));4577 cb.flags = flags;4578 cb.policy_cb = policy_cb_data;4579 cb.should_prune_fn = should_prune_fn;45804581/*4582 * The reflog file is locked by holding the lock on the4583 * reference itself, plus we might need to update the4584 * reference if --updateref was specified:4585 */4586 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL,0, &type, &err);4587if(!lock) {4588error("cannot lock ref '%s':%s", refname, err.buf);4589strbuf_release(&err);4590return-1;4591}4592if(!reflog_exists(refname)) {4593unlock_ref(lock);4594return0;4595}45964597 log_file =git_pathdup("logs/%s", refname);4598if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4599/*4600 * Even though holding $GIT_DIR/logs/$reflog.lock has4601 * no locking implications, we use the lock_file4602 * machinery here anyway because it does a lot of the4603 * work we need, including cleaning up if the program4604 * exits unexpectedly.4605 */4606if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4607struct strbuf err = STRBUF_INIT;4608unable_to_lock_message(log_file, errno, &err);4609error("%s", err.buf);4610strbuf_release(&err);4611goto failure;4612}4613 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4614if(!cb.newlog) {4615error("cannot fdopen%s(%s)",4616get_lock_file_path(&reflog_lock),strerror(errno));4617goto failure;4618}4619}46204621(*prepare_fn)(refname, sha1, cb.policy_cb);4622for_each_reflog_ent(refname, expire_reflog_ent, &cb);4623(*cleanup_fn)(cb.policy_cb);46244625if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4626/*4627 * It doesn't make sense to adjust a reference pointed4628 * to by a symbolic ref based on expiring entries in4629 * the symbolic reference's reflog. Nor can we update4630 * a reference if there are no remaining reflog4631 * entries.4632 */4633int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4634!(type & REF_ISSYMREF) &&4635!is_null_sha1(cb.last_kept_sha1);46364637if(close_lock_file(&reflog_lock)) {4638 status |=error("couldn't write%s:%s", log_file,4639strerror(errno));4640}else if(update &&4641(write_in_full(get_lock_file_fd(lock->lk),4642sha1_to_hex(cb.last_kept_sha1),40) !=40||4643write_str_in_full(get_lock_file_fd(lock->lk),"\n") !=1||4644close_ref(lock) <0)) {4645 status |=error("couldn't write%s",4646get_lock_file_path(lock->lk));4647rollback_lock_file(&reflog_lock);4648}else if(commit_lock_file(&reflog_lock)) {4649 status |=error("unable to commit reflog '%s' (%s)",4650 log_file,strerror(errno));4651}else if(update &&commit_ref(lock)) {4652 status |=error("couldn't set%s", lock->ref_name);4653}4654}4655free(log_file);4656unlock_ref(lock);4657return status;46584659 failure:4660rollback_lock_file(&reflog_lock);4661free(log_file);4662unlock_ref(lock);4663return-1;4664}