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{1291const char*packed_refs_file;12921293if(*refs->name)1294 packed_refs_file =git_path_submodule(refs->name,"packed-refs");1295else1296 packed_refs_file =git_path("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}1315return refs->packed;1316}13171318static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1319{1320returnget_ref_dir(packed_ref_cache->root);1321}13221323static struct ref_dir *get_packed_refs(struct ref_cache *refs)1324{1325returnget_packed_ref_dir(get_packed_ref_cache(refs));1326}13271328/*1329 * Add a reference to the in-memory packed reference cache. This may1330 * only be called while the packed-refs file is locked (see1331 * lock_packed_refs()). To actually write the packed-refs file, call1332 * commit_packed_refs().1333 */1334static voidadd_packed_ref(const char*refname,const unsigned char*sha1)1335{1336struct packed_ref_cache *packed_ref_cache =1337get_packed_ref_cache(&ref_cache);13381339if(!packed_ref_cache->lock)1340die("internal error: packed refs not locked");1341add_ref(get_packed_ref_dir(packed_ref_cache),1342create_ref_entry(refname, sha1, REF_ISPACKED,1));1343}13441345/*1346 * Read the loose references from the namespace dirname into dir1347 * (without recursing). dirname must end with '/'. dir must be the1348 * directory entry corresponding to dirname.1349 */1350static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1351{1352struct ref_cache *refs = dir->ref_cache;1353DIR*d;1354const char*path;1355struct dirent *de;1356int dirnamelen =strlen(dirname);1357struct strbuf refname;13581359if(*refs->name)1360 path =git_path_submodule(refs->name,"%s", dirname);1361else1362 path =git_path("%s", dirname);13631364 d =opendir(path);1365if(!d)1366return;13671368strbuf_init(&refname, dirnamelen +257);1369strbuf_add(&refname, dirname, dirnamelen);13701371while((de =readdir(d)) != NULL) {1372unsigned char sha1[20];1373struct stat st;1374int flag;1375const char*refdir;13761377if(de->d_name[0] =='.')1378continue;1379if(ends_with(de->d_name,".lock"))1380continue;1381strbuf_addstr(&refname, de->d_name);1382 refdir = *refs->name1383?git_path_submodule(refs->name,"%s", refname.buf)1384:git_path("%s", refname.buf);1385if(stat(refdir, &st) <0) {1386;/* silently ignore */1387}else if(S_ISDIR(st.st_mode)) {1388strbuf_addch(&refname,'/');1389add_entry_to_dir(dir,1390create_dir_entry(refs, refname.buf,1391 refname.len,1));1392}else{1393int read_ok;13941395if(*refs->name) {1396hashclr(sha1);1397 flag =0;1398 read_ok = !resolve_gitlink_ref(refs->name,1399 refname.buf, sha1);1400}else{1401 read_ok = !read_ref_full(refname.buf,1402 RESOLVE_REF_READING,1403 sha1, &flag);1404}14051406if(!read_ok) {1407hashclr(sha1);1408 flag |= REF_ISBROKEN;1409}else if(is_null_sha1(sha1)) {1410/*1411 * It is so astronomically unlikely1412 * that NULL_SHA1 is the SHA-1 of an1413 * actual object that we consider its1414 * appearance in a loose reference1415 * file to be repo corruption1416 * (probably due to a software bug).1417 */1418 flag |= REF_ISBROKEN;1419}14201421if(check_refname_format(refname.buf,1422 REFNAME_ALLOW_ONELEVEL)) {1423if(!refname_is_safe(refname.buf))1424die("loose refname is dangerous:%s", refname.buf);1425hashclr(sha1);1426 flag |= REF_BAD_NAME | REF_ISBROKEN;1427}1428add_entry_to_dir(dir,1429create_ref_entry(refname.buf, sha1, flag,0));1430}1431strbuf_setlen(&refname, dirnamelen);1432}1433strbuf_release(&refname);1434closedir(d);1435}14361437static struct ref_dir *get_loose_refs(struct ref_cache *refs)1438{1439if(!refs->loose) {1440/*1441 * Mark the top-level directory complete because we1442 * are about to read the only subdirectory that can1443 * hold references:1444 */1445 refs->loose =create_dir_entry(refs,"",0,0);1446/*1447 * Create an incomplete entry for "refs/":1448 */1449add_entry_to_dir(get_ref_dir(refs->loose),1450create_dir_entry(refs,"refs/",5,1));1451}1452returnget_ref_dir(refs->loose);1453}14541455/* We allow "recursive" symbolic refs. Only within reason, though */1456#define MAXDEPTH 51457#define MAXREFLEN (1024)14581459/*1460 * Called by resolve_gitlink_ref_recursive() after it failed to read1461 * from the loose refs in ref_cache refs. Find <refname> in the1462 * packed-refs file for the submodule.1463 */1464static intresolve_gitlink_packed_ref(struct ref_cache *refs,1465const char*refname,unsigned char*sha1)1466{1467struct ref_entry *ref;1468struct ref_dir *dir =get_packed_refs(refs);14691470 ref =find_ref(dir, refname);1471if(ref == NULL)1472return-1;14731474hashcpy(sha1, ref->u.value.oid.hash);1475return0;1476}14771478static intresolve_gitlink_ref_recursive(struct ref_cache *refs,1479const char*refname,unsigned char*sha1,1480int recursion)1481{1482int fd, len;1483char buffer[128], *p;1484const char*path;14851486if(recursion > MAXDEPTH ||strlen(refname) > MAXREFLEN)1487return-1;1488 path = *refs->name1489?git_path_submodule(refs->name,"%s", refname)1490:git_path("%s", refname);1491 fd =open(path, O_RDONLY);1492if(fd <0)1493returnresolve_gitlink_packed_ref(refs, refname, sha1);14941495 len =read(fd, buffer,sizeof(buffer)-1);1496close(fd);1497if(len <0)1498return-1;1499while(len &&isspace(buffer[len-1]))1500 len--;1501 buffer[len] =0;15021503/* Was it a detached head or an old-fashioned symlink? */1504if(!get_sha1_hex(buffer, sha1))1505return0;15061507/* Symref? */1508if(strncmp(buffer,"ref:",4))1509return-1;1510 p = buffer +4;1511while(isspace(*p))1512 p++;15131514returnresolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1515}15161517intresolve_gitlink_ref(const char*path,const char*refname,unsigned char*sha1)1518{1519int len =strlen(path), retval;1520char*submodule;1521struct ref_cache *refs;15221523while(len && path[len-1] =='/')1524 len--;1525if(!len)1526return-1;1527 submodule =xstrndup(path, len);1528 refs =get_ref_cache(submodule);1529free(submodule);15301531 retval =resolve_gitlink_ref_recursive(refs, refname, sha1,0);1532return retval;1533}15341535/*1536 * Return the ref_entry for the given refname from the packed1537 * references. If it does not exist, return NULL.1538 */1539static struct ref_entry *get_packed_ref(const char*refname)1540{1541returnfind_ref(get_packed_refs(&ref_cache), refname);1542}15431544/*1545 * A loose ref file doesn't exist; check for a packed ref. The1546 * options are forwarded from resolve_safe_unsafe().1547 */1548static intresolve_missing_loose_ref(const char*refname,1549int resolve_flags,1550unsigned char*sha1,1551int*flags)1552{1553struct ref_entry *entry;15541555/*1556 * The loose reference file does not exist; check for a packed1557 * reference.1558 */1559 entry =get_packed_ref(refname);1560if(entry) {1561hashcpy(sha1, entry->u.value.oid.hash);1562if(flags)1563*flags |= REF_ISPACKED;1564return0;1565}1566/* The reference is not a packed reference, either. */1567if(resolve_flags & RESOLVE_REF_READING) {1568 errno = ENOENT;1569return-1;1570}else{1571hashclr(sha1);1572return0;1573}1574}15751576/* This function needs to return a meaningful errno on failure */1577static const char*resolve_ref_unsafe_1(const char*refname,1578int resolve_flags,1579unsigned char*sha1,1580int*flags,1581struct strbuf *sb_path)1582{1583int depth = MAXDEPTH;1584 ssize_t len;1585char buffer[256];1586static char refname_buffer[256];1587int bad_name =0;15881589if(flags)1590*flags =0;15911592if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1593if(flags)1594*flags |= REF_BAD_NAME;15951596if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1597!refname_is_safe(refname)) {1598 errno = EINVAL;1599return NULL;1600}1601/*1602 * dwim_ref() uses REF_ISBROKEN to distinguish between1603 * missing refs and refs that were present but invalid,1604 * to complain about the latter to stderr.1605 *1606 * We don't know whether the ref exists, so don't set1607 * REF_ISBROKEN yet.1608 */1609 bad_name =1;1610}1611for(;;) {1612const char*path;1613struct stat st;1614char*buf;1615int fd;16161617if(--depth <0) {1618 errno = ELOOP;1619return NULL;1620}16211622strbuf_reset(sb_path);1623strbuf_git_path(sb_path,"%s", refname);1624 path = sb_path->buf;16251626/*1627 * We might have to loop back here to avoid a race1628 * condition: first we lstat() the file, then we try1629 * to read it as a link or as a file. But if somebody1630 * changes the type of the file (file <-> directory1631 * <-> symlink) between the lstat() and reading, then1632 * we don't want to report that as an error but rather1633 * try again starting with the lstat().1634 */1635 stat_ref:1636if(lstat(path, &st) <0) {1637if(errno != ENOENT)1638return NULL;1639if(resolve_missing_loose_ref(refname, resolve_flags,1640 sha1, flags))1641return NULL;1642if(bad_name) {1643hashclr(sha1);1644if(flags)1645*flags |= REF_ISBROKEN;1646}1647return refname;1648}16491650/* Follow "normalized" - ie "refs/.." symlinks by hand */1651if(S_ISLNK(st.st_mode)) {1652 len =readlink(path, buffer,sizeof(buffer)-1);1653if(len <0) {1654if(errno == ENOENT || errno == EINVAL)1655/* inconsistent with lstat; retry */1656goto stat_ref;1657else1658return NULL;1659}1660 buffer[len] =0;1661if(starts_with(buffer,"refs/") &&1662!check_refname_format(buffer,0)) {1663strcpy(refname_buffer, buffer);1664 refname = refname_buffer;1665if(flags)1666*flags |= REF_ISSYMREF;1667if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1668hashclr(sha1);1669return refname;1670}1671continue;1672}1673}16741675/* Is it a directory? */1676if(S_ISDIR(st.st_mode)) {1677 errno = EISDIR;1678return NULL;1679}16801681/*1682 * Anything else, just open it and try to use it as1683 * a ref1684 */1685 fd =open(path, O_RDONLY);1686if(fd <0) {1687if(errno == ENOENT)1688/* inconsistent with lstat; retry */1689goto stat_ref;1690else1691return NULL;1692}1693 len =read_in_full(fd, buffer,sizeof(buffer)-1);1694if(len <0) {1695int save_errno = errno;1696close(fd);1697 errno = save_errno;1698return NULL;1699}1700close(fd);1701while(len &&isspace(buffer[len-1]))1702 len--;1703 buffer[len] ='\0';17041705/*1706 * Is it a symbolic ref?1707 */1708if(!starts_with(buffer,"ref:")) {1709/*1710 * Please note that FETCH_HEAD has a second1711 * line containing other data.1712 */1713if(get_sha1_hex(buffer, sha1) ||1714(buffer[40] !='\0'&& !isspace(buffer[40]))) {1715if(flags)1716*flags |= REF_ISBROKEN;1717 errno = EINVAL;1718return NULL;1719}1720if(bad_name) {1721hashclr(sha1);1722if(flags)1723*flags |= REF_ISBROKEN;1724}1725return refname;1726}1727if(flags)1728*flags |= REF_ISSYMREF;1729 buf = buffer +4;1730while(isspace(*buf))1731 buf++;1732 refname =strcpy(refname_buffer, buf);1733if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1734hashclr(sha1);1735return refname;1736}1737if(check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {1738if(flags)1739*flags |= REF_ISBROKEN;17401741if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1742!refname_is_safe(buf)) {1743 errno = EINVAL;1744return NULL;1745}1746 bad_name =1;1747}1748}1749}17501751const char*resolve_ref_unsafe(const char*refname,int resolve_flags,1752unsigned char*sha1,int*flags)1753{1754struct strbuf sb_path = STRBUF_INIT;1755const char*ret =resolve_ref_unsafe_1(refname, resolve_flags,1756 sha1, flags, &sb_path);1757strbuf_release(&sb_path);1758return ret;1759}17601761char*resolve_refdup(const char*refname,int resolve_flags,1762unsigned char*sha1,int*flags)1763{1764returnxstrdup_or_null(resolve_ref_unsafe(refname, resolve_flags,1765 sha1, flags));1766}17671768/* The argument to filter_refs */1769struct ref_filter {1770const char*pattern;1771 each_ref_fn *fn;1772void*cb_data;1773};17741775intread_ref_full(const char*refname,int resolve_flags,unsigned char*sha1,int*flags)1776{1777if(resolve_ref_unsafe(refname, resolve_flags, sha1, flags))1778return0;1779return-1;1780}17811782intread_ref(const char*refname,unsigned char*sha1)1783{1784returnread_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);1785}17861787intref_exists(const char*refname)1788{1789unsigned char sha1[20];1790return!!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);1791}17921793static intfilter_refs(const char*refname,const struct object_id *oid,1794int flags,void*data)1795{1796struct ref_filter *filter = (struct ref_filter *)data;17971798if(wildmatch(filter->pattern, refname,0, NULL))1799return0;1800return filter->fn(refname, oid, flags, filter->cb_data);1801}18021803enum peel_status {1804/* object was peeled successfully: */1805 PEEL_PEELED =0,18061807/*1808 * object cannot be peeled because the named object (or an1809 * object referred to by a tag in the peel chain), does not1810 * exist.1811 */1812 PEEL_INVALID = -1,18131814/* object cannot be peeled because it is not a tag: */1815 PEEL_NON_TAG = -2,18161817/* ref_entry contains no peeled value because it is a symref: */1818 PEEL_IS_SYMREF = -3,18191820/*1821 * ref_entry cannot be peeled because it is broken (i.e., the1822 * symbolic reference cannot even be resolved to an object1823 * name):1824 */1825 PEEL_BROKEN = -41826};18271828/*1829 * Peel the named object; i.e., if the object is a tag, resolve the1830 * tag recursively until a non-tag is found. If successful, store the1831 * result to sha1 and return PEEL_PEELED. If the object is not a tag1832 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,1833 * and leave sha1 unchanged.1834 */1835static enum peel_status peel_object(const unsigned char*name,unsigned char*sha1)1836{1837struct object *o =lookup_unknown_object(name);18381839if(o->type == OBJ_NONE) {1840int type =sha1_object_info(name, NULL);1841if(type <0|| !object_as_type(o, type,0))1842return PEEL_INVALID;1843}18441845if(o->type != OBJ_TAG)1846return PEEL_NON_TAG;18471848 o =deref_tag_noverify(o);1849if(!o)1850return PEEL_INVALID;18511852hashcpy(sha1, o->sha1);1853return PEEL_PEELED;1854}18551856/*1857 * Peel the entry (if possible) and return its new peel_status. If1858 * repeel is true, re-peel the entry even if there is an old peeled1859 * value that is already stored in it.1860 *1861 * It is OK to call this function with a packed reference entry that1862 * might be stale and might even refer to an object that has since1863 * been garbage-collected. In such a case, if the entry has1864 * REF_KNOWS_PEELED then leave the status unchanged and return1865 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1866 */1867static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1868{1869enum peel_status status;18701871if(entry->flag & REF_KNOWS_PEELED) {1872if(repeel) {1873 entry->flag &= ~REF_KNOWS_PEELED;1874oidclr(&entry->u.value.peeled);1875}else{1876returnis_null_oid(&entry->u.value.peeled) ?1877 PEEL_NON_TAG : PEEL_PEELED;1878}1879}1880if(entry->flag & REF_ISBROKEN)1881return PEEL_BROKEN;1882if(entry->flag & REF_ISSYMREF)1883return PEEL_IS_SYMREF;18841885 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1886if(status == PEEL_PEELED || status == PEEL_NON_TAG)1887 entry->flag |= REF_KNOWS_PEELED;1888return status;1889}18901891intpeel_ref(const char*refname,unsigned char*sha1)1892{1893int flag;1894unsigned char base[20];18951896if(current_ref && (current_ref->name == refname1897|| !strcmp(current_ref->name, refname))) {1898if(peel_entry(current_ref,0))1899return-1;1900hashcpy(sha1, current_ref->u.value.peeled.hash);1901return0;1902}19031904if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1905return-1;19061907/*1908 * If the reference is packed, read its ref_entry from the1909 * cache in the hope that we already know its peeled value.1910 * We only try this optimization on packed references because1911 * (a) forcing the filling of the loose reference cache could1912 * be expensive and (b) loose references anyway usually do not1913 * have REF_KNOWS_PEELED.1914 */1915if(flag & REF_ISPACKED) {1916struct ref_entry *r =get_packed_ref(refname);1917if(r) {1918if(peel_entry(r,0))1919return-1;1920hashcpy(sha1, r->u.value.peeled.hash);1921return0;1922}1923}19241925returnpeel_object(base, sha1);1926}19271928struct warn_if_dangling_data {1929FILE*fp;1930const char*refname;1931const struct string_list *refnames;1932const char*msg_fmt;1933};19341935static intwarn_if_dangling_symref(const char*refname,const struct object_id *oid,1936int flags,void*cb_data)1937{1938struct warn_if_dangling_data *d = cb_data;1939const char*resolves_to;1940struct object_id junk;19411942if(!(flags & REF_ISSYMREF))1943return0;19441945 resolves_to =resolve_ref_unsafe(refname,0, junk.hash, NULL);1946if(!resolves_to1947|| (d->refname1948?strcmp(resolves_to, d->refname)1949: !string_list_has_string(d->refnames, resolves_to))) {1950return0;1951}19521953fprintf(d->fp, d->msg_fmt, refname);1954fputc('\n', d->fp);1955return0;1956}19571958voidwarn_dangling_symref(FILE*fp,const char*msg_fmt,const char*refname)1959{1960struct warn_if_dangling_data data;19611962 data.fp = fp;1963 data.refname = refname;1964 data.refnames = NULL;1965 data.msg_fmt = msg_fmt;1966for_each_rawref(warn_if_dangling_symref, &data);1967}19681969voidwarn_dangling_symrefs(FILE*fp,const char*msg_fmt,const struct string_list *refnames)1970{1971struct warn_if_dangling_data data;19721973 data.fp = fp;1974 data.refname = NULL;1975 data.refnames = refnames;1976 data.msg_fmt = msg_fmt;1977for_each_rawref(warn_if_dangling_symref, &data);1978}19791980/*1981 * Call fn for each reference in the specified ref_cache, omitting1982 * references not in the containing_dir of base. fn is called for all1983 * references, including broken ones. If fn ever returns a non-zero1984 * value, stop the iteration and return that value; otherwise, return1985 * 0.1986 */1987static intdo_for_each_entry(struct ref_cache *refs,const char*base,1988 each_ref_entry_fn fn,void*cb_data)1989{1990struct packed_ref_cache *packed_ref_cache;1991struct ref_dir *loose_dir;1992struct ref_dir *packed_dir;1993int retval =0;19941995/*1996 * We must make sure that all loose refs are read before accessing the1997 * packed-refs file; this avoids a race condition in which loose refs1998 * are migrated to the packed-refs file by a simultaneous process, but1999 * our in-memory view is from before the migration. get_packed_ref_cache()2000 * takes care of making sure our view is up to date with what is on2001 * disk.2002 */2003 loose_dir =get_loose_refs(refs);2004if(base && *base) {2005 loose_dir =find_containing_dir(loose_dir, base,0);2006}2007if(loose_dir)2008prime_ref_dir(loose_dir);20092010 packed_ref_cache =get_packed_ref_cache(refs);2011acquire_packed_ref_cache(packed_ref_cache);2012 packed_dir =get_packed_ref_dir(packed_ref_cache);2013if(base && *base) {2014 packed_dir =find_containing_dir(packed_dir, base,0);2015}20162017if(packed_dir && loose_dir) {2018sort_ref_dir(packed_dir);2019sort_ref_dir(loose_dir);2020 retval =do_for_each_entry_in_dirs(2021 packed_dir, loose_dir, fn, cb_data);2022}else if(packed_dir) {2023sort_ref_dir(packed_dir);2024 retval =do_for_each_entry_in_dir(2025 packed_dir,0, fn, cb_data);2026}else if(loose_dir) {2027sort_ref_dir(loose_dir);2028 retval =do_for_each_entry_in_dir(2029 loose_dir,0, fn, cb_data);2030}20312032release_packed_ref_cache(packed_ref_cache);2033return retval;2034}20352036/*2037 * Call fn for each reference in the specified ref_cache for which the2038 * refname begins with base. If trim is non-zero, then trim that many2039 * characters off the beginning of each refname before passing the2040 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include2041 * broken references in the iteration. If fn ever returns a non-zero2042 * value, stop the iteration and return that value; otherwise, return2043 * 0.2044 */2045static intdo_for_each_ref(struct ref_cache *refs,const char*base,2046 each_ref_fn fn,int trim,int flags,void*cb_data)2047{2048struct ref_entry_cb data;2049 data.base = base;2050 data.trim = trim;2051 data.flags = flags;2052 data.fn = fn;2053 data.cb_data = cb_data;20542055if(ref_paranoia <0)2056 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);2057if(ref_paranoia)2058 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;20592060returndo_for_each_entry(refs, base, do_one_ref, &data);2061}20622063static intdo_head_ref(const char*submodule, each_ref_fn fn,void*cb_data)2064{2065struct object_id oid;2066int flag;20672068if(submodule) {2069if(resolve_gitlink_ref(submodule,"HEAD", oid.hash) ==0)2070returnfn("HEAD", &oid,0, cb_data);20712072return0;2073}20742075if(!read_ref_full("HEAD", RESOLVE_REF_READING, oid.hash, &flag))2076returnfn("HEAD", &oid, flag, cb_data);20772078return0;2079}20802081inthead_ref(each_ref_fn fn,void*cb_data)2082{2083returndo_head_ref(NULL, fn, cb_data);2084}20852086inthead_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2087{2088returndo_head_ref(submodule, fn, cb_data);2089}20902091intfor_each_ref(each_ref_fn fn,void*cb_data)2092{2093returndo_for_each_ref(&ref_cache,"", fn,0,0, cb_data);2094}20952096intfor_each_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2097{2098returndo_for_each_ref(get_ref_cache(submodule),"", fn,0,0, cb_data);2099}21002101intfor_each_ref_in(const char*prefix, each_ref_fn fn,void*cb_data)2102{2103returndo_for_each_ref(&ref_cache, prefix, fn,strlen(prefix),0, cb_data);2104}21052106intfor_each_ref_in_submodule(const char*submodule,const char*prefix,2107 each_ref_fn fn,void*cb_data)2108{2109returndo_for_each_ref(get_ref_cache(submodule), prefix, fn,strlen(prefix),0, cb_data);2110}21112112intfor_each_tag_ref(each_ref_fn fn,void*cb_data)2113{2114returnfor_each_ref_in("refs/tags/", fn, cb_data);2115}21162117intfor_each_tag_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2118{2119returnfor_each_ref_in_submodule(submodule,"refs/tags/", fn, cb_data);2120}21212122intfor_each_branch_ref(each_ref_fn fn,void*cb_data)2123{2124returnfor_each_ref_in("refs/heads/", fn, cb_data);2125}21262127intfor_each_branch_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2128{2129returnfor_each_ref_in_submodule(submodule,"refs/heads/", fn, cb_data);2130}21312132intfor_each_remote_ref(each_ref_fn fn,void*cb_data)2133{2134returnfor_each_ref_in("refs/remotes/", fn, cb_data);2135}21362137intfor_each_remote_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2138{2139returnfor_each_ref_in_submodule(submodule,"refs/remotes/", fn, cb_data);2140}21412142intfor_each_replace_ref(each_ref_fn fn,void*cb_data)2143{2144returndo_for_each_ref(&ref_cache, git_replace_ref_base, fn,2145strlen(git_replace_ref_base),0, cb_data);2146}21472148inthead_ref_namespaced(each_ref_fn fn,void*cb_data)2149{2150struct strbuf buf = STRBUF_INIT;2151int ret =0;2152struct object_id oid;2153int flag;21542155strbuf_addf(&buf,"%sHEAD",get_git_namespace());2156if(!read_ref_full(buf.buf, RESOLVE_REF_READING, oid.hash, &flag))2157 ret =fn(buf.buf, &oid, flag, cb_data);2158strbuf_release(&buf);21592160return ret;2161}21622163intfor_each_namespaced_ref(each_ref_fn fn,void*cb_data)2164{2165struct strbuf buf = STRBUF_INIT;2166int ret;2167strbuf_addf(&buf,"%srefs/",get_git_namespace());2168 ret =do_for_each_ref(&ref_cache, buf.buf, fn,0,0, cb_data);2169strbuf_release(&buf);2170return ret;2171}21722173intfor_each_glob_ref_in(each_ref_fn fn,const char*pattern,2174const char*prefix,void*cb_data)2175{2176struct strbuf real_pattern = STRBUF_INIT;2177struct ref_filter filter;2178int ret;21792180if(!prefix && !starts_with(pattern,"refs/"))2181strbuf_addstr(&real_pattern,"refs/");2182else if(prefix)2183strbuf_addstr(&real_pattern, prefix);2184strbuf_addstr(&real_pattern, pattern);21852186if(!has_glob_specials(pattern)) {2187/* Append implied '/' '*' if not present. */2188if(real_pattern.buf[real_pattern.len -1] !='/')2189strbuf_addch(&real_pattern,'/');2190/* No need to check for '*', there is none. */2191strbuf_addch(&real_pattern,'*');2192}21932194 filter.pattern = real_pattern.buf;2195 filter.fn = fn;2196 filter.cb_data = cb_data;2197 ret =for_each_ref(filter_refs, &filter);21982199strbuf_release(&real_pattern);2200return ret;2201}22022203intfor_each_glob_ref(each_ref_fn fn,const char*pattern,void*cb_data)2204{2205returnfor_each_glob_ref_in(fn, pattern, NULL, cb_data);2206}22072208intfor_each_rawref(each_ref_fn fn,void*cb_data)2209{2210returndo_for_each_ref(&ref_cache,"", fn,0,2211 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);2212}22132214const char*prettify_refname(const char*name)2215{2216return name + (2217starts_with(name,"refs/heads/") ?11:2218starts_with(name,"refs/tags/") ?10:2219starts_with(name,"refs/remotes/") ?13:22200);2221}22222223static const char*ref_rev_parse_rules[] = {2224"%.*s",2225"refs/%.*s",2226"refs/tags/%.*s",2227"refs/heads/%.*s",2228"refs/remotes/%.*s",2229"refs/remotes/%.*s/HEAD",2230 NULL2231};22322233intrefname_match(const char*abbrev_name,const char*full_name)2234{2235const char**p;2236const int abbrev_name_len =strlen(abbrev_name);22372238for(p = ref_rev_parse_rules; *p; p++) {2239if(!strcmp(full_name,mkpath(*p, abbrev_name_len, abbrev_name))) {2240return1;2241}2242}22432244return0;2245}22462247static voidunlock_ref(struct ref_lock *lock)2248{2249/* Do not free lock->lk -- atexit() still looks at them */2250if(lock->lk)2251rollback_lock_file(lock->lk);2252free(lock->ref_name);2253free(lock->orig_ref_name);2254free(lock);2255}22562257/*2258 * Verify that the reference locked by lock has the value old_sha1.2259 * Fail if the reference doesn't exist and mustexist is set. Return 02260 * on success. On error, write an error message to err, set errno, and2261 * return a negative value.2262 */2263static intverify_lock(struct ref_lock *lock,2264const unsigned char*old_sha1,int mustexist,2265struct strbuf *err)2266{2267assert(err);22682269if(read_ref_full(lock->ref_name,2270 mustexist ? RESOLVE_REF_READING :0,2271 lock->old_oid.hash, NULL)) {2272int save_errno = errno;2273strbuf_addf(err,"can't verify ref%s", lock->ref_name);2274 errno = save_errno;2275return-1;2276}2277if(hashcmp(lock->old_oid.hash, old_sha1)) {2278strbuf_addf(err,"ref%sis at%sbut expected%s",2279 lock->ref_name,2280sha1_to_hex(lock->old_oid.hash),2281sha1_to_hex(old_sha1));2282 errno = EBUSY;2283return-1;2284}2285return0;2286}22872288static intremove_empty_directories(const char*file)2289{2290/* we want to create a file but there is a directory there;2291 * if that is an empty directory (or a directory that contains2292 * only empty directories), remove them.2293 */2294struct strbuf path;2295int result, save_errno;22962297strbuf_init(&path,20);2298strbuf_addstr(&path, file);22992300 result =remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);2301 save_errno = errno;23022303strbuf_release(&path);2304 errno = save_errno;23052306return result;2307}23082309/*2310 * *string and *len will only be substituted, and *string returned (for2311 * later free()ing) if the string passed in is a magic short-hand form2312 * to name a branch.2313 */2314static char*substitute_branch_name(const char**string,int*len)2315{2316struct strbuf buf = STRBUF_INIT;2317int ret =interpret_branch_name(*string, *len, &buf);23182319if(ret == *len) {2320size_t size;2321*string =strbuf_detach(&buf, &size);2322*len = size;2323return(char*)*string;2324}23252326return NULL;2327}23282329intdwim_ref(const char*str,int len,unsigned char*sha1,char**ref)2330{2331char*last_branch =substitute_branch_name(&str, &len);2332const char**p, *r;2333int refs_found =0;23342335*ref = NULL;2336for(p = ref_rev_parse_rules; *p; p++) {2337char fullref[PATH_MAX];2338unsigned char sha1_from_ref[20];2339unsigned char*this_result;2340int flag;23412342 this_result = refs_found ? sha1_from_ref : sha1;2343mksnpath(fullref,sizeof(fullref), *p, len, str);2344 r =resolve_ref_unsafe(fullref, RESOLVE_REF_READING,2345 this_result, &flag);2346if(r) {2347if(!refs_found++)2348*ref =xstrdup(r);2349if(!warn_ambiguous_refs)2350break;2351}else if((flag & REF_ISSYMREF) &&strcmp(fullref,"HEAD")) {2352warning("ignoring dangling symref%s.", fullref);2353}else if((flag & REF_ISBROKEN) &&strchr(fullref,'/')) {2354warning("ignoring broken ref%s.", fullref);2355}2356}2357free(last_branch);2358return refs_found;2359}23602361intdwim_log(const char*str,int len,unsigned char*sha1,char**log)2362{2363char*last_branch =substitute_branch_name(&str, &len);2364const char**p;2365int logs_found =0;23662367*log = NULL;2368for(p = ref_rev_parse_rules; *p; p++) {2369unsigned char hash[20];2370char path[PATH_MAX];2371const char*ref, *it;23722373mksnpath(path,sizeof(path), *p, len, str);2374 ref =resolve_ref_unsafe(path, RESOLVE_REF_READING,2375 hash, NULL);2376if(!ref)2377continue;2378if(reflog_exists(path))2379 it = path;2380else if(strcmp(ref, path) &&reflog_exists(ref))2381 it = ref;2382else2383continue;2384if(!logs_found++) {2385*log =xstrdup(it);2386hashcpy(sha1, hash);2387}2388if(!warn_ambiguous_refs)2389break;2390}2391free(last_branch);2392return logs_found;2393}23942395/*2396 * Locks a ref returning the lock on success and NULL on failure.2397 * On failure errno is set to something meaningful.2398 */2399static struct ref_lock *lock_ref_sha1_basic(const char*refname,2400const unsigned char*old_sha1,2401const struct string_list *extras,2402const struct string_list *skip,2403unsigned int flags,int*type_p,2404struct strbuf *err)2405{2406const char*ref_file;2407const char*orig_refname = refname;2408struct ref_lock *lock;2409int last_errno =0;2410int type, lflags;2411int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2412int resolve_flags =0;2413int attempts_remaining =3;24142415assert(err);24162417 lock =xcalloc(1,sizeof(struct ref_lock));24182419if(mustexist)2420 resolve_flags |= RESOLVE_REF_READING;2421if(flags & REF_DELETING) {2422 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;2423if(flags & REF_NODEREF)2424 resolve_flags |= RESOLVE_REF_NO_RECURSE;2425}24262427 refname =resolve_ref_unsafe(refname, resolve_flags,2428 lock->old_oid.hash, &type);2429if(!refname && errno == EISDIR) {2430/* we are trying to lock foo but we used to2431 * have foo/bar which now does not exist;2432 * it is normal for the empty directory 'foo'2433 * to remain.2434 */2435 ref_file =git_path("%s", orig_refname);2436if(remove_empty_directories(ref_file)) {2437 last_errno = errno;24382439if(!verify_refname_available(orig_refname, extras, skip,2440get_loose_refs(&ref_cache), err))2441strbuf_addf(err,"there are still refs under '%s'",2442 orig_refname);24432444goto error_return;2445}2446 refname =resolve_ref_unsafe(orig_refname, resolve_flags,2447 lock->old_oid.hash, &type);2448}2449if(type_p)2450*type_p = type;2451if(!refname) {2452 last_errno = errno;2453if(last_errno != ENOTDIR ||2454!verify_refname_available(orig_refname, extras, skip,2455get_loose_refs(&ref_cache), err))2456strbuf_addf(err,"unable to resolve reference%s:%s",2457 orig_refname,strerror(last_errno));24582459goto error_return;2460}2461/*2462 * If the ref did not exist and we are creating it, make sure2463 * there is no existing packed ref whose name begins with our2464 * refname, nor a packed ref whose name is a proper prefix of2465 * our refname.2466 */2467if(is_null_oid(&lock->old_oid) &&2468verify_refname_available(refname, extras, skip,2469get_packed_refs(&ref_cache), err)) {2470 last_errno = ENOTDIR;2471goto error_return;2472}24732474 lock->lk =xcalloc(1,sizeof(struct lock_file));24752476 lflags =0;2477if(flags & REF_NODEREF) {2478 refname = orig_refname;2479 lflags |= LOCK_NO_DEREF;2480}2481 lock->ref_name =xstrdup(refname);2482 lock->orig_ref_name =xstrdup(orig_refname);2483 ref_file =git_path("%s", refname);24842485 retry:2486switch(safe_create_leading_directories_const(ref_file)) {2487case SCLD_OK:2488break;/* success */2489case SCLD_VANISHED:2490if(--attempts_remaining >0)2491goto retry;2492/* fall through */2493default:2494 last_errno = errno;2495strbuf_addf(err,"unable to create directory for%s", ref_file);2496goto error_return;2497}24982499if(hold_lock_file_for_update(lock->lk, ref_file, lflags) <0) {2500 last_errno = errno;2501if(errno == ENOENT && --attempts_remaining >0)2502/*2503 * Maybe somebody just deleted one of the2504 * directories leading to ref_file. Try2505 * again:2506 */2507goto retry;2508else{2509unable_to_lock_message(ref_file, errno, err);2510goto error_return;2511}2512}2513if(old_sha1 &&verify_lock(lock, old_sha1, mustexist, err)) {2514 last_errno = errno;2515goto error_return;2516}2517return lock;25182519 error_return:2520unlock_ref(lock);2521 errno = last_errno;2522return NULL;2523}25242525/*2526 * Write an entry to the packed-refs file for the specified refname.2527 * If peeled is non-NULL, write it as the entry's peeled value.2528 */2529static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2530unsigned char*peeled)2531{2532fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2533if(peeled)2534fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2535}25362537/*2538 * An each_ref_entry_fn that writes the entry to a packed-refs file.2539 */2540static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2541{2542enum peel_status peel_status =peel_entry(entry,0);25432544if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2545error("internal error:%sis not a valid packed reference!",2546 entry->name);2547write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2548 peel_status == PEEL_PEELED ?2549 entry->u.value.peeled.hash : NULL);2550return0;2551}25522553/*2554 * Lock the packed-refs file for writing. Flags is passed to2555 * hold_lock_file_for_update(). Return 0 on success. On errors, set2556 * errno appropriately and return a nonzero value.2557 */2558static intlock_packed_refs(int flags)2559{2560static int timeout_configured =0;2561static int timeout_value =1000;25622563struct packed_ref_cache *packed_ref_cache;25642565if(!timeout_configured) {2566git_config_get_int("core.packedrefstimeout", &timeout_value);2567 timeout_configured =1;2568}25692570if(hold_lock_file_for_update_timeout(2571&packlock,git_path("packed-refs"),2572 flags, timeout_value) <0)2573return-1;2574/*2575 * Get the current packed-refs while holding the lock. If the2576 * packed-refs file has been modified since we last read it,2577 * this will automatically invalidate the cache and re-read2578 * the packed-refs file.2579 */2580 packed_ref_cache =get_packed_ref_cache(&ref_cache);2581 packed_ref_cache->lock = &packlock;2582/* Increment the reference count to prevent it from being freed: */2583acquire_packed_ref_cache(packed_ref_cache);2584return0;2585}25862587/*2588 * Write the current version of the packed refs cache from memory to2589 * disk. The packed-refs file must already be locked for writing (see2590 * lock_packed_refs()). Return zero on success. On errors, set errno2591 * and return a nonzero value2592 */2593static intcommit_packed_refs(void)2594{2595struct packed_ref_cache *packed_ref_cache =2596get_packed_ref_cache(&ref_cache);2597int error =0;2598int save_errno =0;2599FILE*out;26002601if(!packed_ref_cache->lock)2602die("internal error: packed-refs not locked");26032604 out =fdopen_lock_file(packed_ref_cache->lock,"w");2605if(!out)2606die_errno("unable to fdopen packed-refs descriptor");26072608fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2609do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),26100, write_packed_entry_fn, out);26112612if(commit_lock_file(packed_ref_cache->lock)) {2613 save_errno = errno;2614 error = -1;2615}2616 packed_ref_cache->lock = NULL;2617release_packed_ref_cache(packed_ref_cache);2618 errno = save_errno;2619return error;2620}26212622/*2623 * Rollback the lockfile for the packed-refs file, and discard the2624 * in-memory packed reference cache. (The packed-refs file will be2625 * read anew if it is needed again after this function is called.)2626 */2627static voidrollback_packed_refs(void)2628{2629struct packed_ref_cache *packed_ref_cache =2630get_packed_ref_cache(&ref_cache);26312632if(!packed_ref_cache->lock)2633die("internal error: packed-refs not locked");2634rollback_lock_file(packed_ref_cache->lock);2635 packed_ref_cache->lock = NULL;2636release_packed_ref_cache(packed_ref_cache);2637clear_packed_ref_cache(&ref_cache);2638}26392640struct ref_to_prune {2641struct ref_to_prune *next;2642unsigned char sha1[20];2643char name[FLEX_ARRAY];2644};26452646struct pack_refs_cb_data {2647unsigned int flags;2648struct ref_dir *packed_refs;2649struct ref_to_prune *ref_to_prune;2650};26512652/*2653 * An each_ref_entry_fn that is run over loose references only. If2654 * the loose reference can be packed, add an entry in the packed ref2655 * cache. If the reference should be pruned, also add it to2656 * ref_to_prune in the pack_refs_cb_data.2657 */2658static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2659{2660struct pack_refs_cb_data *cb = cb_data;2661enum peel_status peel_status;2662struct ref_entry *packed_entry;2663int is_tag_ref =starts_with(entry->name,"refs/tags/");26642665/* ALWAYS pack tags */2666if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2667return0;26682669/* Do not pack symbolic or broken refs: */2670if((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2671return0;26722673/* Add a packed ref cache entry equivalent to the loose entry. */2674 peel_status =peel_entry(entry,1);2675if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2676die("internal error peeling reference%s(%s)",2677 entry->name,oid_to_hex(&entry->u.value.oid));2678 packed_entry =find_ref(cb->packed_refs, entry->name);2679if(packed_entry) {2680/* Overwrite existing packed entry with info from loose entry */2681 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2682oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2683}else{2684 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2685 REF_ISPACKED | REF_KNOWS_PEELED,0);2686add_ref(cb->packed_refs, packed_entry);2687}2688oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);26892690/* Schedule the loose reference for pruning if requested. */2691if((cb->flags & PACK_REFS_PRUNE)) {2692int namelen =strlen(entry->name) +1;2693struct ref_to_prune *n =xcalloc(1,sizeof(*n) + namelen);2694hashcpy(n->sha1, entry->u.value.oid.hash);2695strcpy(n->name, entry->name);2696 n->next = cb->ref_to_prune;2697 cb->ref_to_prune = n;2698}2699return0;2700}27012702/*2703 * Remove empty parents, but spare refs/ and immediate subdirs.2704 * Note: munges *name.2705 */2706static voidtry_remove_empty_parents(char*name)2707{2708char*p, *q;2709int i;2710 p = name;2711for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2712while(*p && *p !='/')2713 p++;2714/* tolerate duplicate slashes; see check_refname_format() */2715while(*p =='/')2716 p++;2717}2718for(q = p; *q; q++)2719;2720while(1) {2721while(q > p && *q !='/')2722 q--;2723while(q > p && *(q-1) =='/')2724 q--;2725if(q == p)2726break;2727*q ='\0';2728if(rmdir(git_path("%s", name)))2729break;2730}2731}27322733/* make sure nobody touched the ref, and unlink */2734static voidprune_ref(struct ref_to_prune *r)2735{2736struct ref_transaction *transaction;2737struct strbuf err = STRBUF_INIT;27382739if(check_refname_format(r->name,0))2740return;27412742 transaction =ref_transaction_begin(&err);2743if(!transaction ||2744ref_transaction_delete(transaction, r->name, r->sha1,2745 REF_ISPRUNING, NULL, &err) ||2746ref_transaction_commit(transaction, &err)) {2747ref_transaction_free(transaction);2748error("%s", err.buf);2749strbuf_release(&err);2750return;2751}2752ref_transaction_free(transaction);2753strbuf_release(&err);2754try_remove_empty_parents(r->name);2755}27562757static voidprune_refs(struct ref_to_prune *r)2758{2759while(r) {2760prune_ref(r);2761 r = r->next;2762}2763}27642765intpack_refs(unsigned int flags)2766{2767struct pack_refs_cb_data cbdata;27682769memset(&cbdata,0,sizeof(cbdata));2770 cbdata.flags = flags;27712772lock_packed_refs(LOCK_DIE_ON_ERROR);2773 cbdata.packed_refs =get_packed_refs(&ref_cache);27742775do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2776 pack_if_possible_fn, &cbdata);27772778if(commit_packed_refs())2779die_errno("unable to overwrite old ref-pack file");27802781prune_refs(cbdata.ref_to_prune);2782return0;2783}27842785/*2786 * Rewrite the packed-refs file, omitting any refs listed in2787 * 'refnames'. On error, leave packed-refs unchanged, write an error2788 * message to 'err', and return a nonzero value.2789 *2790 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2791 */2792static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2793{2794struct ref_dir *packed;2795struct string_list_item *refname;2796int ret, needs_repacking =0, removed =0;27972798assert(err);27992800/* Look for a packed ref */2801for_each_string_list_item(refname, refnames) {2802if(get_packed_ref(refname->string)) {2803 needs_repacking =1;2804break;2805}2806}28072808/* Avoid locking if we have nothing to do */2809if(!needs_repacking)2810return0;/* no refname exists in packed refs */28112812if(lock_packed_refs(0)) {2813unable_to_lock_message(git_path("packed-refs"), errno, err);2814return-1;2815}2816 packed =get_packed_refs(&ref_cache);28172818/* Remove refnames from the cache */2819for_each_string_list_item(refname, refnames)2820if(remove_entry(packed, refname->string) != -1)2821 removed =1;2822if(!removed) {2823/*2824 * All packed entries disappeared while we were2825 * acquiring the lock.2826 */2827rollback_packed_refs();2828return0;2829}28302831/* Write what remains */2832 ret =commit_packed_refs();2833if(ret)2834strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2835strerror(errno));2836return ret;2837}28382839static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2840{2841assert(err);28422843if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2844/*2845 * loose. The loose file name is the same as the2846 * lockfile name, minus ".lock":2847 */2848char*loose_filename =get_locked_file_path(lock->lk);2849int res =unlink_or_msg(loose_filename, err);2850free(loose_filename);2851if(res)2852return1;2853}2854return0;2855}28562857intdelete_ref(const char*refname,const unsigned char*old_sha1,2858unsigned int flags)2859{2860struct ref_transaction *transaction;2861struct strbuf err = STRBUF_INIT;28622863 transaction =ref_transaction_begin(&err);2864if(!transaction ||2865ref_transaction_delete(transaction, refname, old_sha1,2866 flags, NULL, &err) ||2867ref_transaction_commit(transaction, &err)) {2868error("%s", err.buf);2869ref_transaction_free(transaction);2870strbuf_release(&err);2871return1;2872}2873ref_transaction_free(transaction);2874strbuf_release(&err);2875return0;2876}28772878intdelete_refs(struct string_list *refnames)2879{2880struct strbuf err = STRBUF_INIT;2881int i, result =0;28822883if(!refnames->nr)2884return0;28852886 result =repack_without_refs(refnames, &err);2887if(result) {2888/*2889 * If we failed to rewrite the packed-refs file, then2890 * it is unsafe to try to remove loose refs, because2891 * doing so might expose an obsolete packed value for2892 * a reference that might even point at an object that2893 * has been garbage collected.2894 */2895if(refnames->nr ==1)2896error(_("could not delete reference%s:%s"),2897 refnames->items[0].string, err.buf);2898else2899error(_("could not delete references:%s"), err.buf);29002901goto out;2902}29032904for(i =0; i < refnames->nr; i++) {2905const char*refname = refnames->items[i].string;29062907if(delete_ref(refname, NULL,0))2908 result |=error(_("could not remove reference%s"), refname);2909}29102911out:2912strbuf_release(&err);2913return result;2914}29152916/*2917 * People using contrib's git-new-workdir have .git/logs/refs ->2918 * /some/other/path/.git/logs/refs, and that may live on another device.2919 *2920 * IOW, to avoid cross device rename errors, the temporary renamed log must2921 * live into logs/refs.2922 */2923#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"29242925static intrename_tmp_log(const char*newrefname)2926{2927int attempts_remaining =4;29282929 retry:2930switch(safe_create_leading_directories_const(git_path("logs/%s", newrefname))) {2931case SCLD_OK:2932break;/* success */2933case SCLD_VANISHED:2934if(--attempts_remaining >0)2935goto retry;2936/* fall through */2937default:2938error("unable to create directory for%s", newrefname);2939return-1;2940}29412942if(rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", newrefname))) {2943if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2944/*2945 * rename(a, b) when b is an existing2946 * directory ought to result in ISDIR, but2947 * Solaris 5.8 gives ENOTDIR. Sheesh.2948 */2949if(remove_empty_directories(git_path("logs/%s", newrefname))) {2950error("Directory not empty: logs/%s", newrefname);2951return-1;2952}2953goto retry;2954}else if(errno == ENOENT && --attempts_remaining >0) {2955/*2956 * Maybe another process just deleted one of2957 * the directories in the path to newrefname.2958 * Try again from the beginning.2959 */2960goto retry;2961}else{2962error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2963 newrefname,strerror(errno));2964return-1;2965}2966}2967return0;2968}29692970static intrename_ref_available(const char*oldname,const char*newname)2971{2972struct string_list skip = STRING_LIST_INIT_NODUP;2973struct strbuf err = STRBUF_INIT;2974int ret;29752976string_list_insert(&skip, oldname);2977 ret = !verify_refname_available(newname, NULL, &skip,2978get_packed_refs(&ref_cache), &err)2979&& !verify_refname_available(newname, NULL, &skip,2980get_loose_refs(&ref_cache), &err);2981if(!ret)2982error("%s", err.buf);29832984string_list_clear(&skip,0);2985strbuf_release(&err);2986return ret;2987}29882989static intwrite_ref_to_lockfile(struct ref_lock *lock,2990const unsigned char*sha1,struct strbuf *err);2991static intcommit_ref_update(struct ref_lock *lock,2992const unsigned char*sha1,const char*logmsg,2993int flags,struct strbuf *err);29942995intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2996{2997unsigned char sha1[20], orig_sha1[20];2998int flag =0, logmoved =0;2999struct ref_lock *lock;3000struct stat loginfo;3001int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);3002const char*symref = NULL;3003struct strbuf err = STRBUF_INIT;30043005if(log &&S_ISLNK(loginfo.st_mode))3006returnerror("reflog for%sis a symlink", oldrefname);30073008 symref =resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,3009 orig_sha1, &flag);3010if(flag & REF_ISSYMREF)3011returnerror("refname%sis a symbolic ref, renaming it is not supported",3012 oldrefname);3013if(!symref)3014returnerror("refname%snot found", oldrefname);30153016if(!rename_ref_available(oldrefname, newrefname))3017return1;30183019if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))3020returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",3021 oldrefname,strerror(errno));30223023if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {3024error("unable to delete old%s", oldrefname);3025goto rollback;3026}30273028if(!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&3029delete_ref(newrefname, sha1, REF_NODEREF)) {3030if(errno==EISDIR) {3031if(remove_empty_directories(git_path("%s", newrefname))) {3032error("Directory not empty:%s", newrefname);3033goto rollback;3034}3035}else{3036error("unable to delete existing%s", newrefname);3037goto rollback;3038}3039}30403041if(log &&rename_tmp_log(newrefname))3042goto rollback;30433044 logmoved = log;30453046 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL,0, NULL, &err);3047if(!lock) {3048error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);3049strbuf_release(&err);3050goto rollback;3051}3052hashcpy(lock->old_oid.hash, orig_sha1);30533054if(write_ref_to_lockfile(lock, orig_sha1, &err) ||3055commit_ref_update(lock, orig_sha1, logmsg,0, &err)) {3056error("unable to write current sha1 into%s:%s", newrefname, err.buf);3057strbuf_release(&err);3058goto rollback;3059}30603061return0;30623063 rollback:3064 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL,0, NULL, &err);3065if(!lock) {3066error("unable to lock%sfor rollback:%s", oldrefname, err.buf);3067strbuf_release(&err);3068goto rollbacklog;3069}30703071 flag = log_all_ref_updates;3072 log_all_ref_updates =0;3073if(write_ref_to_lockfile(lock, orig_sha1, &err) ||3074commit_ref_update(lock, orig_sha1, NULL,0, &err)) {3075error("unable to write current sha1 into%s:%s", oldrefname, err.buf);3076strbuf_release(&err);3077}3078 log_all_ref_updates = flag;30793080 rollbacklog:3081if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))3082error("unable to restore logfile%sfrom%s:%s",3083 oldrefname, newrefname,strerror(errno));3084if(!logmoved && log &&3085rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))3086error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",3087 oldrefname,strerror(errno));30883089return1;3090}30913092static intclose_ref(struct ref_lock *lock)3093{3094if(close_lock_file(lock->lk))3095return-1;3096return0;3097}30983099static intcommit_ref(struct ref_lock *lock)3100{3101if(commit_lock_file(lock->lk))3102return-1;3103return0;3104}31053106/*3107 * copy the reflog message msg to buf, which has been allocated sufficiently3108 * large, while cleaning up the whitespaces. Especially, convert LF to space,3109 * because reflog file is one line per entry.3110 */3111static intcopy_msg(char*buf,const char*msg)3112{3113char*cp = buf;3114char c;3115int wasspace =1;31163117*cp++ ='\t';3118while((c = *msg++)) {3119if(wasspace &&isspace(c))3120continue;3121 wasspace =isspace(c);3122if(wasspace)3123 c =' ';3124*cp++ = c;3125}3126while(buf < cp &&isspace(cp[-1]))3127 cp--;3128*cp++ ='\n';3129return cp - buf;3130}31313132static intshould_autocreate_reflog(const char*refname)3133{3134if(!log_all_ref_updates)3135return0;3136returnstarts_with(refname,"refs/heads/") ||3137starts_with(refname,"refs/remotes/") ||3138starts_with(refname,"refs/notes/") ||3139!strcmp(refname,"HEAD");3140}31413142/*3143 * Create a reflog for a ref. If force_create = 0, the reflog will3144 * only be created for certain refs (those for which3145 * should_autocreate_reflog returns non-zero. Otherwise, create it3146 * regardless of the ref name. Fill in *err and return -1 on failure.3147 */3148static intlog_ref_setup(const char*refname,struct strbuf *sb_logfile,struct strbuf *err,int force_create)3149{3150int logfd, oflags = O_APPEND | O_WRONLY;3151char*logfile;31523153strbuf_git_path(sb_logfile,"logs/%s", refname);3154 logfile = sb_logfile->buf;3155/* make sure the rest of the function can't change "logfile" */3156 sb_logfile = NULL;3157if(force_create ||should_autocreate_reflog(refname)) {3158if(safe_create_leading_directories(logfile) <0) {3159strbuf_addf(err,"unable to create directory for%s: "3160"%s", logfile,strerror(errno));3161return-1;3162}3163 oflags |= O_CREAT;3164}31653166 logfd =open(logfile, oflags,0666);3167if(logfd <0) {3168if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))3169return0;31703171if(errno == EISDIR) {3172if(remove_empty_directories(logfile)) {3173strbuf_addf(err,"There are still logs under "3174"'%s'", logfile);3175return-1;3176}3177 logfd =open(logfile, oflags,0666);3178}31793180if(logfd <0) {3181strbuf_addf(err,"unable to append to%s:%s",3182 logfile,strerror(errno));3183return-1;3184}3185}31863187adjust_shared_perm(logfile);3188close(logfd);3189return0;3190}319131923193intsafe_create_reflog(const char*refname,int force_create,struct strbuf *err)3194{3195int ret;3196struct strbuf sb = STRBUF_INIT;31973198 ret =log_ref_setup(refname, &sb, err, force_create);3199strbuf_release(&sb);3200return ret;3201}32023203static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,3204const unsigned char*new_sha1,3205const char*committer,const char*msg)3206{3207int msglen, written;3208unsigned maxlen, len;3209char*logrec;32103211 msglen = msg ?strlen(msg) :0;3212 maxlen =strlen(committer) + msglen +100;3213 logrec =xmalloc(maxlen);3214 len =sprintf(logrec,"%s %s %s\n",3215sha1_to_hex(old_sha1),3216sha1_to_hex(new_sha1),3217 committer);3218if(msglen)3219 len +=copy_msg(logrec + len -1, msg) -1;32203221 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;3222free(logrec);3223if(written != len)3224return-1;32253226return0;3227}32283229static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,3230const unsigned char*new_sha1,const char*msg,3231struct strbuf *sb_log_file,int flags,3232struct strbuf *err)3233{3234int logfd, result, oflags = O_APPEND | O_WRONLY;3235char*log_file;32363237if(log_all_ref_updates <0)3238 log_all_ref_updates = !is_bare_repository();32393240 result =log_ref_setup(refname, sb_log_file, err, flags & REF_FORCE_CREATE_REFLOG);32413242if(result)3243return result;3244 log_file = sb_log_file->buf;3245/* make sure the rest of the function can't change "log_file" */3246 sb_log_file = NULL;32473248 logfd =open(log_file, oflags);3249if(logfd <0)3250return0;3251 result =log_ref_write_fd(logfd, old_sha1, new_sha1,3252git_committer_info(0), msg);3253if(result) {3254strbuf_addf(err,"unable to append to%s:%s", log_file,3255strerror(errno));3256close(logfd);3257return-1;3258}3259if(close(logfd)) {3260strbuf_addf(err,"unable to append to%s:%s", log_file,3261strerror(errno));3262return-1;3263}3264return0;3265}32663267static intlog_ref_write(const char*refname,const unsigned char*old_sha1,3268const unsigned char*new_sha1,const char*msg,3269int flags,struct strbuf *err)3270{3271struct strbuf sb = STRBUF_INIT;3272int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,3273 err);3274strbuf_release(&sb);3275return ret;3276}32773278intis_branch(const char*refname)3279{3280return!strcmp(refname,"HEAD") ||starts_with(refname,"refs/heads/");3281}32823283/*3284 * Write sha1 into the open lockfile, then close the lockfile. On3285 * errors, rollback the lockfile, fill in *err and3286 * return -1.3287 */3288static intwrite_ref_to_lockfile(struct ref_lock *lock,3289const unsigned char*sha1,struct strbuf *err)3290{3291static char term ='\n';3292struct object *o;32933294 o =parse_object(sha1);3295if(!o) {3296strbuf_addf(err,3297"Trying to write ref%swith nonexistent object%s",3298 lock->ref_name,sha1_to_hex(sha1));3299unlock_ref(lock);3300return-1;3301}3302if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {3303strbuf_addf(err,3304"Trying to write non-commit object%sto branch%s",3305sha1_to_hex(sha1), lock->ref_name);3306unlock_ref(lock);3307return-1;3308}3309if(write_in_full(lock->lk->fd,sha1_to_hex(sha1),40) !=40||3310write_in_full(lock->lk->fd, &term,1) !=1||3311close_ref(lock) <0) {3312strbuf_addf(err,3313"Couldn't write%s", lock->lk->filename.buf);3314unlock_ref(lock);3315return-1;3316}3317return0;3318}33193320/*3321 * Commit a change to a loose reference that has already been written3322 * to the loose reference lockfile. Also update the reflogs if3323 * necessary, using the specified lockmsg (which can be NULL).3324 */3325static intcommit_ref_update(struct ref_lock *lock,3326const unsigned char*sha1,const char*logmsg,3327int flags,struct strbuf *err)3328{3329clear_loose_ref_cache(&ref_cache);3330if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0||3331(strcmp(lock->ref_name, lock->orig_ref_name) &&3332log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) <0)) {3333char*old_msg =strbuf_detach(err, NULL);3334strbuf_addf(err,"Cannot update the ref '%s':%s",3335 lock->ref_name, old_msg);3336free(old_msg);3337unlock_ref(lock);3338return-1;3339}3340if(strcmp(lock->orig_ref_name,"HEAD") !=0) {3341/*3342 * Special hack: If a branch is updated directly and HEAD3343 * points to it (may happen on the remote side of a push3344 * for example) then logically the HEAD reflog should be3345 * updated too.3346 * A generic solution implies reverse symref information,3347 * but finding all symrefs pointing to the given branch3348 * would be rather costly for this rare event (the direct3349 * update of a branch) to be worth it. So let's cheat and3350 * check with HEAD only which should cover 99% of all usage3351 * scenarios (even 100% of the default ones).3352 */3353unsigned char head_sha1[20];3354int head_flag;3355const char*head_ref;3356 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3357 head_sha1, &head_flag);3358if(head_ref && (head_flag & REF_ISSYMREF) &&3359!strcmp(head_ref, lock->ref_name)) {3360struct strbuf log_err = STRBUF_INIT;3361if(log_ref_write("HEAD", lock->old_oid.hash, sha1,3362 logmsg,0, &log_err)) {3363error("%s", log_err.buf);3364strbuf_release(&log_err);3365}3366}3367}3368if(commit_ref(lock)) {3369error("Couldn't set%s", lock->ref_name);3370unlock_ref(lock);3371return-1;3372}33733374unlock_ref(lock);3375return0;3376}33773378intcreate_symref(const char*ref_target,const char*refs_heads_master,3379const char*logmsg)3380{3381const char*lockpath;3382char ref[1000];3383int fd, len, written;3384char*git_HEAD =git_pathdup("%s", ref_target);3385unsigned char old_sha1[20], new_sha1[20];3386struct strbuf err = STRBUF_INIT;33873388if(logmsg &&read_ref(ref_target, old_sha1))3389hashclr(old_sha1);33903391if(safe_create_leading_directories(git_HEAD) <0)3392returnerror("unable to create directory for%s", git_HEAD);33933394#ifndef NO_SYMLINK_HEAD3395if(prefer_symlink_refs) {3396unlink(git_HEAD);3397if(!symlink(refs_heads_master, git_HEAD))3398goto done;3399fprintf(stderr,"no symlink - falling back to symbolic ref\n");3400}3401#endif34023403 len =snprintf(ref,sizeof(ref),"ref:%s\n", refs_heads_master);3404if(sizeof(ref) <= len) {3405error("refname too long:%s", refs_heads_master);3406goto error_free_return;3407}3408 lockpath =mkpath("%s.lock", git_HEAD);3409 fd =open(lockpath, O_CREAT | O_EXCL | O_WRONLY,0666);3410if(fd <0) {3411error("Unable to open%sfor writing", lockpath);3412goto error_free_return;3413}3414 written =write_in_full(fd, ref, len);3415if(close(fd) !=0|| written != len) {3416error("Unable to write to%s", lockpath);3417goto error_unlink_return;3418}3419if(rename(lockpath, git_HEAD) <0) {3420error("Unable to create%s", git_HEAD);3421goto error_unlink_return;3422}3423if(adjust_shared_perm(git_HEAD)) {3424error("Unable to fix permissions on%s", lockpath);3425 error_unlink_return:3426unlink_or_warn(lockpath);3427 error_free_return:3428free(git_HEAD);3429return-1;3430}34313432#ifndef NO_SYMLINK_HEAD3433 done:3434#endif3435if(logmsg && !read_ref(refs_heads_master, new_sha1) &&3436log_ref_write(ref_target, old_sha1, new_sha1, logmsg,0, &err)) {3437error("%s", err.buf);3438strbuf_release(&err);3439}34403441free(git_HEAD);3442return0;3443}34443445struct read_ref_at_cb {3446const char*refname;3447unsigned long at_time;3448int cnt;3449int reccnt;3450unsigned char*sha1;3451int found_it;34523453unsigned char osha1[20];3454unsigned char nsha1[20];3455int tz;3456unsigned long date;3457char**msg;3458unsigned long*cutoff_time;3459int*cutoff_tz;3460int*cutoff_cnt;3461};34623463static intread_ref_at_ent(unsigned char*osha1,unsigned char*nsha1,3464const char*email,unsigned long timestamp,int tz,3465const char*message,void*cb_data)3466{3467struct read_ref_at_cb *cb = cb_data;34683469 cb->reccnt++;3470 cb->tz = tz;3471 cb->date = timestamp;34723473if(timestamp <= cb->at_time || cb->cnt ==0) {3474if(cb->msg)3475*cb->msg =xstrdup(message);3476if(cb->cutoff_time)3477*cb->cutoff_time = timestamp;3478if(cb->cutoff_tz)3479*cb->cutoff_tz = tz;3480if(cb->cutoff_cnt)3481*cb->cutoff_cnt = cb->reccnt -1;3482/*3483 * we have not yet updated cb->[n|o]sha1 so they still3484 * hold the values for the previous record.3485 */3486if(!is_null_sha1(cb->osha1)) {3487hashcpy(cb->sha1, nsha1);3488if(hashcmp(cb->osha1, nsha1))3489warning("Log for ref%shas gap after%s.",3490 cb->refname,show_date(cb->date, cb->tz,DATE_MODE(RFC2822)));3491}3492else if(cb->date == cb->at_time)3493hashcpy(cb->sha1, nsha1);3494else if(hashcmp(nsha1, cb->sha1))3495warning("Log for ref%sunexpectedly ended on%s.",3496 cb->refname,show_date(cb->date, cb->tz,3497DATE_MODE(RFC2822)));3498hashcpy(cb->osha1, osha1);3499hashcpy(cb->nsha1, nsha1);3500 cb->found_it =1;3501return1;3502}3503hashcpy(cb->osha1, osha1);3504hashcpy(cb->nsha1, nsha1);3505if(cb->cnt >0)3506 cb->cnt--;3507return0;3508}35093510static intread_ref_at_ent_oldest(unsigned char*osha1,unsigned char*nsha1,3511const char*email,unsigned long timestamp,3512int tz,const char*message,void*cb_data)3513{3514struct read_ref_at_cb *cb = cb_data;35153516if(cb->msg)3517*cb->msg =xstrdup(message);3518if(cb->cutoff_time)3519*cb->cutoff_time = timestamp;3520if(cb->cutoff_tz)3521*cb->cutoff_tz = tz;3522if(cb->cutoff_cnt)3523*cb->cutoff_cnt = cb->reccnt;3524hashcpy(cb->sha1, osha1);3525if(is_null_sha1(cb->sha1))3526hashcpy(cb->sha1, nsha1);3527/* We just want the first entry */3528return1;3529}35303531intread_ref_at(const char*refname,unsigned int flags,unsigned long at_time,int cnt,3532unsigned char*sha1,char**msg,3533unsigned long*cutoff_time,int*cutoff_tz,int*cutoff_cnt)3534{3535struct read_ref_at_cb cb;35363537memset(&cb,0,sizeof(cb));3538 cb.refname = refname;3539 cb.at_time = at_time;3540 cb.cnt = cnt;3541 cb.msg = msg;3542 cb.cutoff_time = cutoff_time;3543 cb.cutoff_tz = cutoff_tz;3544 cb.cutoff_cnt = cutoff_cnt;3545 cb.sha1 = sha1;35463547for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);35483549if(!cb.reccnt) {3550if(flags & GET_SHA1_QUIETLY)3551exit(128);3552else3553die("Log for%sis empty.", refname);3554}3555if(cb.found_it)3556return0;35573558for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);35593560return1;3561}35623563intreflog_exists(const char*refname)3564{3565struct stat st;35663567return!lstat(git_path("logs/%s", refname), &st) &&3568S_ISREG(st.st_mode);3569}35703571intdelete_reflog(const char*refname)3572{3573returnremove_path(git_path("logs/%s", refname));3574}35753576static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3577{3578unsigned char osha1[20], nsha1[20];3579char*email_end, *message;3580unsigned long timestamp;3581int tz;35823583/* old SP new SP name <email> SP time TAB msg LF */3584if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3585get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3586get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3587!(email_end =strchr(sb->buf +82,'>')) ||3588 email_end[1] !=' '||3589!(timestamp =strtoul(email_end +2, &message,10)) ||3590!message || message[0] !=' '||3591(message[1] !='+'&& message[1] !='-') ||3592!isdigit(message[2]) || !isdigit(message[3]) ||3593!isdigit(message[4]) || !isdigit(message[5]))3594return0;/* corrupt? */3595 email_end[1] ='\0';3596 tz =strtol(message +1, NULL,10);3597if(message[6] !='\t')3598 message +=6;3599else3600 message +=7;3601returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3602}36033604static char*find_beginning_of_line(char*bob,char*scan)3605{3606while(bob < scan && *(--scan) !='\n')3607;/* keep scanning backwards */3608/*3609 * Return either beginning of the buffer, or LF at the end of3610 * the previous line.3611 */3612return scan;3613}36143615intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)3616{3617struct strbuf sb = STRBUF_INIT;3618FILE*logfp;3619long pos;3620int ret =0, at_tail =1;36213622 logfp =fopen(git_path("logs/%s", refname),"r");3623if(!logfp)3624return-1;36253626/* Jump to the end */3627if(fseek(logfp,0, SEEK_END) <0)3628returnerror("cannot seek back reflog for%s:%s",3629 refname,strerror(errno));3630 pos =ftell(logfp);3631while(!ret &&0< pos) {3632int cnt;3633size_t nread;3634char buf[BUFSIZ];3635char*endp, *scanp;36363637/* Fill next block from the end */3638 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3639if(fseek(logfp, pos - cnt, SEEK_SET))3640returnerror("cannot seek back reflog for%s:%s",3641 refname,strerror(errno));3642 nread =fread(buf, cnt,1, logfp);3643if(nread !=1)3644returnerror("cannot read%dbytes from reflog for%s:%s",3645 cnt, refname,strerror(errno));3646 pos -= cnt;36473648 scanp = endp = buf + cnt;3649if(at_tail && scanp[-1] =='\n')3650/* Looking at the final LF at the end of the file */3651 scanp--;3652 at_tail =0;36533654while(buf < scanp) {3655/*3656 * terminating LF of the previous line, or the beginning3657 * of the buffer.3658 */3659char*bp;36603661 bp =find_beginning_of_line(buf, scanp);36623663if(*bp =='\n') {3664/*3665 * The newline is the end of the previous line,3666 * so we know we have complete line starting3667 * at (bp + 1). Prefix it onto any prior data3668 * we collected for the line and process it.3669 */3670strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3671 scanp = bp;3672 endp = bp +1;3673 ret =show_one_reflog_ent(&sb, fn, cb_data);3674strbuf_reset(&sb);3675if(ret)3676break;3677}else if(!pos) {3678/*3679 * We are at the start of the buffer, and the3680 * start of the file; there is no previous3681 * line, and we have everything for this one.3682 * Process it, and we can end the loop.3683 */3684strbuf_splice(&sb,0,0, buf, endp - buf);3685 ret =show_one_reflog_ent(&sb, fn, cb_data);3686strbuf_reset(&sb);3687break;3688}36893690if(bp == buf) {3691/*3692 * We are at the start of the buffer, and there3693 * is more file to read backwards. Which means3694 * we are in the middle of a line. Note that we3695 * may get here even if *bp was a newline; that3696 * just means we are at the exact end of the3697 * previous line, rather than some spot in the3698 * middle.3699 *3700 * Save away what we have to be combined with3701 * the data from the next read.3702 */3703strbuf_splice(&sb,0,0, buf, endp - buf);3704break;3705}3706}37073708}3709if(!ret && sb.len)3710die("BUG: reverse reflog parser had leftover data");37113712fclose(logfp);3713strbuf_release(&sb);3714return ret;3715}37163717intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3718{3719FILE*logfp;3720struct strbuf sb = STRBUF_INIT;3721int ret =0;37223723 logfp =fopen(git_path("logs/%s", refname),"r");3724if(!logfp)3725return-1;37263727while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3728 ret =show_one_reflog_ent(&sb, fn, cb_data);3729fclose(logfp);3730strbuf_release(&sb);3731return ret;3732}3733/*3734 * Call fn for each reflog in the namespace indicated by name. name3735 * must be empty or end with '/'. Name will be used as a scratch3736 * space, but its contents will be restored before return.3737 */3738static intdo_for_each_reflog(struct strbuf *name, each_ref_fn fn,void*cb_data)3739{3740DIR*d =opendir(git_path("logs/%s", name->buf));3741int retval =0;3742struct dirent *de;3743int oldlen = name->len;37443745if(!d)3746return name->len ? errno :0;37473748while((de =readdir(d)) != NULL) {3749struct stat st;37503751if(de->d_name[0] =='.')3752continue;3753if(ends_with(de->d_name,".lock"))3754continue;3755strbuf_addstr(name, de->d_name);3756if(stat(git_path("logs/%s", name->buf), &st) <0) {3757;/* silently ignore */3758}else{3759if(S_ISDIR(st.st_mode)) {3760strbuf_addch(name,'/');3761 retval =do_for_each_reflog(name, fn, cb_data);3762}else{3763struct object_id oid;37643765if(read_ref_full(name->buf,0, oid.hash, NULL))3766 retval =error("bad ref for%s", name->buf);3767else3768 retval =fn(name->buf, &oid,0, cb_data);3769}3770if(retval)3771break;3772}3773strbuf_setlen(name, oldlen);3774}3775closedir(d);3776return retval;3777}37783779intfor_each_reflog(each_ref_fn fn,void*cb_data)3780{3781int retval;3782struct strbuf name;3783strbuf_init(&name, PATH_MAX);3784 retval =do_for_each_reflog(&name, fn, cb_data);3785strbuf_release(&name);3786return retval;3787}37883789/**3790 * Information needed for a single ref update. Set new_sha1 to the new3791 * value or to null_sha1 to delete the ref. To check the old value3792 * while the ref is locked, set (flags & REF_HAVE_OLD) and set3793 * old_sha1 to the old value, or to null_sha1 to ensure the ref does3794 * not exist before update.3795 */3796struct ref_update {3797/*3798 * If (flags & REF_HAVE_NEW), set the reference to this value:3799 */3800unsigned char new_sha1[20];3801/*3802 * If (flags & REF_HAVE_OLD), check that the reference3803 * previously had this value:3804 */3805unsigned char old_sha1[20];3806/*3807 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,3808 * REF_DELETING, and REF_ISPRUNING:3809 */3810unsigned int flags;3811struct ref_lock *lock;3812int type;3813char*msg;3814const char refname[FLEX_ARRAY];3815};38163817/*3818 * Transaction states.3819 * OPEN: The transaction is in a valid state and can accept new updates.3820 * An OPEN transaction can be committed.3821 * CLOSED: A closed transaction is no longer active and no other operations3822 * than free can be used on it in this state.3823 * A transaction can either become closed by successfully committing3824 * an active transaction or if there is a failure while building3825 * the transaction thus rendering it failed/inactive.3826 */3827enum ref_transaction_state {3828 REF_TRANSACTION_OPEN =0,3829 REF_TRANSACTION_CLOSED =13830};38313832/*3833 * Data structure for holding a reference transaction, which can3834 * consist of checks and updates to multiple references, carried out3835 * as atomically as possible. This structure is opaque to callers.3836 */3837struct ref_transaction {3838struct ref_update **updates;3839size_t alloc;3840size_t nr;3841enum ref_transaction_state state;3842};38433844struct ref_transaction *ref_transaction_begin(struct strbuf *err)3845{3846assert(err);38473848returnxcalloc(1,sizeof(struct ref_transaction));3849}38503851voidref_transaction_free(struct ref_transaction *transaction)3852{3853int i;38543855if(!transaction)3856return;38573858for(i =0; i < transaction->nr; i++) {3859free(transaction->updates[i]->msg);3860free(transaction->updates[i]);3861}3862free(transaction->updates);3863free(transaction);3864}38653866static struct ref_update *add_update(struct ref_transaction *transaction,3867const char*refname)3868{3869size_t len =strlen(refname);3870struct ref_update *update =xcalloc(1,sizeof(*update) + len +1);38713872strcpy((char*)update->refname, refname);3873ALLOC_GROW(transaction->updates, transaction->nr +1, transaction->alloc);3874 transaction->updates[transaction->nr++] = update;3875return update;3876}38773878intref_transaction_update(struct ref_transaction *transaction,3879const char*refname,3880const unsigned char*new_sha1,3881const unsigned char*old_sha1,3882unsigned int flags,const char*msg,3883struct strbuf *err)3884{3885struct ref_update *update;38863887assert(err);38883889if(transaction->state != REF_TRANSACTION_OPEN)3890die("BUG: update called for transaction that is not open");38913892if(new_sha1 && !is_null_sha1(new_sha1) &&3893check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {3894strbuf_addf(err,"refusing to update ref with bad name%s",3895 refname);3896return-1;3897}38983899 update =add_update(transaction, refname);3900if(new_sha1) {3901hashcpy(update->new_sha1, new_sha1);3902 flags |= REF_HAVE_NEW;3903}3904if(old_sha1) {3905hashcpy(update->old_sha1, old_sha1);3906 flags |= REF_HAVE_OLD;3907}3908 update->flags = flags;3909if(msg)3910 update->msg =xstrdup(msg);3911return0;3912}39133914intref_transaction_create(struct ref_transaction *transaction,3915const char*refname,3916const unsigned char*new_sha1,3917unsigned int flags,const char*msg,3918struct strbuf *err)3919{3920if(!new_sha1 ||is_null_sha1(new_sha1))3921die("BUG: create called without valid new_sha1");3922returnref_transaction_update(transaction, refname, new_sha1,3923 null_sha1, flags, msg, err);3924}39253926intref_transaction_delete(struct ref_transaction *transaction,3927const char*refname,3928const unsigned char*old_sha1,3929unsigned int flags,const char*msg,3930struct strbuf *err)3931{3932if(old_sha1 &&is_null_sha1(old_sha1))3933die("BUG: delete called with old_sha1 set to zeros");3934returnref_transaction_update(transaction, refname,3935 null_sha1, old_sha1,3936 flags, msg, err);3937}39383939intref_transaction_verify(struct ref_transaction *transaction,3940const char*refname,3941const unsigned char*old_sha1,3942unsigned int flags,3943struct strbuf *err)3944{3945if(!old_sha1)3946die("BUG: verify called with old_sha1 set to NULL");3947returnref_transaction_update(transaction, refname,3948 NULL, old_sha1,3949 flags, NULL, err);3950}39513952intupdate_ref(const char*msg,const char*refname,3953const unsigned char*new_sha1,const unsigned char*old_sha1,3954unsigned int flags,enum action_on_err onerr)3955{3956struct ref_transaction *t;3957struct strbuf err = STRBUF_INIT;39583959 t =ref_transaction_begin(&err);3960if(!t ||3961ref_transaction_update(t, refname, new_sha1, old_sha1,3962 flags, msg, &err) ||3963ref_transaction_commit(t, &err)) {3964const char*str ="update_ref failed for ref '%s':%s";39653966ref_transaction_free(t);3967switch(onerr) {3968case UPDATE_REFS_MSG_ON_ERR:3969error(str, refname, err.buf);3970break;3971case UPDATE_REFS_DIE_ON_ERR:3972die(str, refname, err.buf);3973break;3974case UPDATE_REFS_QUIET_ON_ERR:3975break;3976}3977strbuf_release(&err);3978return1;3979}3980strbuf_release(&err);3981ref_transaction_free(t);3982return0;3983}39843985static intref_update_reject_duplicates(struct string_list *refnames,3986struct strbuf *err)3987{3988int i, n = refnames->nr;39893990assert(err);39913992for(i =1; i < n; i++)3993if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3994strbuf_addf(err,3995"Multiple updates for ref '%s' not allowed.",3996 refnames->items[i].string);3997return1;3998}3999return0;4000}40014002intref_transaction_commit(struct ref_transaction *transaction,4003struct strbuf *err)4004{4005int ret =0, i;4006int n = transaction->nr;4007struct ref_update **updates = transaction->updates;4008struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;4009struct string_list_item *ref_to_delete;4010struct string_list affected_refnames = STRING_LIST_INIT_NODUP;40114012assert(err);40134014if(transaction->state != REF_TRANSACTION_OPEN)4015die("BUG: commit called for transaction that is not open");40164017if(!n) {4018 transaction->state = REF_TRANSACTION_CLOSED;4019return0;4020}40214022/* Fail if a refname appears more than once in the transaction: */4023for(i =0; i < n; i++)4024string_list_append(&affected_refnames, updates[i]->refname);4025string_list_sort(&affected_refnames);4026if(ref_update_reject_duplicates(&affected_refnames, err)) {4027 ret = TRANSACTION_GENERIC_ERROR;4028goto cleanup;4029}40304031/*4032 * Acquire all locks, verify old values if provided, check4033 * that new values are valid, and write new values to the4034 * lockfiles, ready to be activated. Only keep one lockfile4035 * open at a time to avoid running out of file descriptors.4036 */4037for(i =0; i < n; i++) {4038struct ref_update *update = updates[i];40394040if((update->flags & REF_HAVE_NEW) &&4041is_null_sha1(update->new_sha1))4042 update->flags |= REF_DELETING;4043 update->lock =lock_ref_sha1_basic(4044 update->refname,4045((update->flags & REF_HAVE_OLD) ?4046 update->old_sha1 : NULL),4047&affected_refnames, NULL,4048 update->flags,4049&update->type,4050 err);4051if(!update->lock) {4052char*reason;40534054 ret = (errno == ENOTDIR)4055? TRANSACTION_NAME_CONFLICT4056: TRANSACTION_GENERIC_ERROR;4057 reason =strbuf_detach(err, NULL);4058strbuf_addf(err,"cannot lock ref '%s':%s",4059 update->refname, reason);4060free(reason);4061goto cleanup;4062}4063if((update->flags & REF_HAVE_NEW) &&4064!(update->flags & REF_DELETING)) {4065int overwriting_symref = ((update->type & REF_ISSYMREF) &&4066(update->flags & REF_NODEREF));40674068if(!overwriting_symref &&4069!hashcmp(update->lock->old_oid.hash, update->new_sha1)) {4070/*4071 * The reference already has the desired4072 * value, so we don't need to write it.4073 */4074}else if(write_ref_to_lockfile(update->lock,4075 update->new_sha1,4076 err)) {4077char*write_err =strbuf_detach(err, NULL);40784079/*4080 * The lock was freed upon failure of4081 * write_ref_to_lockfile():4082 */4083 update->lock = NULL;4084strbuf_addf(err,4085"cannot update the ref '%s':%s",4086 update->refname, write_err);4087free(write_err);4088 ret = TRANSACTION_GENERIC_ERROR;4089goto cleanup;4090}else{4091 update->flags |= REF_NEEDS_COMMIT;4092}4093}4094if(!(update->flags & REF_NEEDS_COMMIT)) {4095/*4096 * We didn't have to write anything to the lockfile.4097 * Close it to free up the file descriptor:4098 */4099if(close_ref(update->lock)) {4100strbuf_addf(err,"Couldn't close%s.lock",4101 update->refname);4102goto cleanup;4103}4104}4105}41064107/* Perform updates first so live commits remain referenced */4108for(i =0; i < n; i++) {4109struct ref_update *update = updates[i];41104111if(update->flags & REF_NEEDS_COMMIT) {4112if(commit_ref_update(update->lock,4113 update->new_sha1, update->msg,4114 update->flags, err)) {4115/* freed by commit_ref_update(): */4116 update->lock = NULL;4117 ret = TRANSACTION_GENERIC_ERROR;4118goto cleanup;4119}else{4120/* freed by commit_ref_update(): */4121 update->lock = NULL;4122}4123}4124}41254126/* Perform deletes now that updates are safely completed */4127for(i =0; i < n; i++) {4128struct ref_update *update = updates[i];41294130if(update->flags & REF_DELETING) {4131if(delete_ref_loose(update->lock, update->type, err)) {4132 ret = TRANSACTION_GENERIC_ERROR;4133goto cleanup;4134}41354136if(!(update->flags & REF_ISPRUNING))4137string_list_append(&refs_to_delete,4138 update->lock->ref_name);4139}4140}41414142if(repack_without_refs(&refs_to_delete, err)) {4143 ret = TRANSACTION_GENERIC_ERROR;4144goto cleanup;4145}4146for_each_string_list_item(ref_to_delete, &refs_to_delete)4147unlink_or_warn(git_path("logs/%s", ref_to_delete->string));4148clear_loose_ref_cache(&ref_cache);41494150cleanup:4151 transaction->state = REF_TRANSACTION_CLOSED;41524153for(i =0; i < n; i++)4154if(updates[i]->lock)4155unlock_ref(updates[i]->lock);4156string_list_clear(&refs_to_delete,0);4157string_list_clear(&affected_refnames,0);4158return ret;4159}41604161static intref_present(const char*refname,4162const struct object_id *oid,int flags,void*cb_data)4163{4164struct string_list *affected_refnames = cb_data;41654166returnstring_list_has_string(affected_refnames, refname);4167}41684169intinitial_ref_transaction_commit(struct ref_transaction *transaction,4170struct strbuf *err)4171{4172struct ref_dir *loose_refs =get_loose_refs(&ref_cache);4173struct ref_dir *packed_refs =get_packed_refs(&ref_cache);4174int ret =0, i;4175int n = transaction->nr;4176struct ref_update **updates = transaction->updates;4177struct string_list affected_refnames = STRING_LIST_INIT_NODUP;41784179assert(err);41804181if(transaction->state != REF_TRANSACTION_OPEN)4182die("BUG: commit called for transaction that is not open");41834184/* Fail if a refname appears more than once in the transaction: */4185for(i =0; i < n; i++)4186string_list_append(&affected_refnames, updates[i]->refname);4187string_list_sort(&affected_refnames);4188if(ref_update_reject_duplicates(&affected_refnames, err)) {4189 ret = TRANSACTION_GENERIC_ERROR;4190goto cleanup;4191}41924193/*4194 * It's really undefined to call this function in an active4195 * repository or when there are existing references: we are4196 * only locking and changing packed-refs, so (1) any4197 * simultaneous processes might try to change a reference at4198 * the same time we do, and (2) any existing loose versions of4199 * the references that we are setting would have precedence4200 * over our values. But some remote helpers create the remote4201 * "HEAD" and "master" branches before calling this function,4202 * so here we really only check that none of the references4203 * that we are creating already exists.4204 */4205if(for_each_rawref(ref_present, &affected_refnames))4206die("BUG: initial ref transaction called with existing refs");42074208for(i =0; i < n; i++) {4209struct ref_update *update = updates[i];42104211if((update->flags & REF_HAVE_OLD) &&4212!is_null_sha1(update->old_sha1))4213die("BUG: initial ref transaction with old_sha1 set");4214if(verify_refname_available(update->refname,4215&affected_refnames, NULL,4216 loose_refs, err) ||4217verify_refname_available(update->refname,4218&affected_refnames, NULL,4219 packed_refs, err)) {4220 ret = TRANSACTION_NAME_CONFLICT;4221goto cleanup;4222}4223}42244225if(lock_packed_refs(0)) {4226strbuf_addf(err,"unable to lock packed-refs file:%s",4227strerror(errno));4228 ret = TRANSACTION_GENERIC_ERROR;4229goto cleanup;4230}42314232for(i =0; i < n; i++) {4233struct ref_update *update = updates[i];42344235if((update->flags & REF_HAVE_NEW) &&4236!is_null_sha1(update->new_sha1))4237add_packed_ref(update->refname, update->new_sha1);4238}42394240if(commit_packed_refs()) {4241strbuf_addf(err,"unable to commit packed-refs file:%s",4242strerror(errno));4243 ret = TRANSACTION_GENERIC_ERROR;4244goto cleanup;4245}42464247cleanup:4248 transaction->state = REF_TRANSACTION_CLOSED;4249string_list_clear(&affected_refnames,0);4250return ret;4251}42524253char*shorten_unambiguous_ref(const char*refname,int strict)4254{4255int i;4256static char**scanf_fmts;4257static int nr_rules;4258char*short_name;42594260if(!nr_rules) {4261/*4262 * Pre-generate scanf formats from ref_rev_parse_rules[].4263 * Generate a format suitable for scanf from a4264 * ref_rev_parse_rules rule by interpolating "%s" at the4265 * location of the "%.*s".4266 */4267size_t total_len =0;4268size_t offset =0;42694270/* the rule list is NULL terminated, count them first */4271for(nr_rules =0; ref_rev_parse_rules[nr_rules]; nr_rules++)4272/* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */4273 total_len +=strlen(ref_rev_parse_rules[nr_rules]) -2+1;42744275 scanf_fmts =xmalloc(nr_rules *sizeof(char*) + total_len);42764277 offset =0;4278for(i =0; i < nr_rules; i++) {4279assert(offset < total_len);4280 scanf_fmts[i] = (char*)&scanf_fmts[nr_rules] + offset;4281 offset +=snprintf(scanf_fmts[i], total_len - offset,4282 ref_rev_parse_rules[i],2,"%s") +1;4283}4284}42854286/* bail out if there are no rules */4287if(!nr_rules)4288returnxstrdup(refname);42894290/* buffer for scanf result, at most refname must fit */4291 short_name =xstrdup(refname);42924293/* skip first rule, it will always match */4294for(i = nr_rules -1; i >0; --i) {4295int j;4296int rules_to_fail = i;4297int short_name_len;42984299if(1!=sscanf(refname, scanf_fmts[i], short_name))4300continue;43014302 short_name_len =strlen(short_name);43034304/*4305 * in strict mode, all (except the matched one) rules4306 * must fail to resolve to a valid non-ambiguous ref4307 */4308if(strict)4309 rules_to_fail = nr_rules;43104311/*4312 * check if the short name resolves to a valid ref,4313 * but use only rules prior to the matched one4314 */4315for(j =0; j < rules_to_fail; j++) {4316const char*rule = ref_rev_parse_rules[j];4317char refname[PATH_MAX];43184319/* skip matched rule */4320if(i == j)4321continue;43224323/*4324 * the short name is ambiguous, if it resolves4325 * (with this previous rule) to a valid ref4326 * read_ref() returns 0 on success4327 */4328mksnpath(refname,sizeof(refname),4329 rule, short_name_len, short_name);4330if(ref_exists(refname))4331break;4332}43334334/*4335 * short name is non-ambiguous if all previous rules4336 * haven't resolved to a valid ref4337 */4338if(j == rules_to_fail)4339return short_name;4340}43414342free(short_name);4343returnxstrdup(refname);4344}43454346static struct string_list *hide_refs;43474348intparse_hide_refs_config(const char*var,const char*value,const char*section)4349{4350if(!strcmp("transfer.hiderefs", var) ||4351/* NEEDSWORK: use parse_config_key() once both are merged */4352(starts_with(var, section) && var[strlen(section)] =='.'&&4353!strcmp(var +strlen(section),".hiderefs"))) {4354char*ref;4355int len;43564357if(!value)4358returnconfig_error_nonbool(var);4359 ref =xstrdup(value);4360 len =strlen(ref);4361while(len && ref[len -1] =='/')4362 ref[--len] ='\0';4363if(!hide_refs) {4364 hide_refs =xcalloc(1,sizeof(*hide_refs));4365 hide_refs->strdup_strings =1;4366}4367string_list_append(hide_refs, ref);4368}4369return0;4370}43714372intref_is_hidden(const char*refname)4373{4374struct string_list_item *item;43754376if(!hide_refs)4377return0;4378for_each_string_list_item(item, hide_refs) {4379int len;4380if(!starts_with(refname, item->string))4381continue;4382 len =strlen(item->string);4383if(!refname[len] || refname[len] =='/')4384return1;4385}4386return0;4387}43884389struct expire_reflog_cb {4390unsigned int flags;4391 reflog_expiry_should_prune_fn *should_prune_fn;4392void*policy_cb;4393FILE*newlog;4394unsigned char last_kept_sha1[20];4395};43964397static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,4398const char*email,unsigned long timestamp,int tz,4399const char*message,void*cb_data)4400{4401struct expire_reflog_cb *cb = cb_data;4402struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;44034404if(cb->flags & EXPIRE_REFLOGS_REWRITE)4405 osha1 = cb->last_kept_sha1;44064407if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,4408 message, policy_cb)) {4409if(!cb->newlog)4410printf("would prune%s", message);4411else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4412printf("prune%s", message);4413}else{4414if(cb->newlog) {4415fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",4416sha1_to_hex(osha1),sha1_to_hex(nsha1),4417 email, timestamp, tz, message);4418hashcpy(cb->last_kept_sha1, nsha1);4419}4420if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4421printf("keep%s", message);4422}4423return0;4424}44254426intreflog_expire(const char*refname,const unsigned char*sha1,4427unsigned int flags,4428 reflog_expiry_prepare_fn prepare_fn,4429 reflog_expiry_should_prune_fn should_prune_fn,4430 reflog_expiry_cleanup_fn cleanup_fn,4431void*policy_cb_data)4432{4433static struct lock_file reflog_lock;4434struct expire_reflog_cb cb;4435struct ref_lock *lock;4436char*log_file;4437int status =0;4438int type;4439struct strbuf err = STRBUF_INIT;44404441memset(&cb,0,sizeof(cb));4442 cb.flags = flags;4443 cb.policy_cb = policy_cb_data;4444 cb.should_prune_fn = should_prune_fn;44454446/*4447 * The reflog file is locked by holding the lock on the4448 * reference itself, plus we might need to update the4449 * reference if --updateref was specified:4450 */4451 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL,0, &type, &err);4452if(!lock) {4453error("cannot lock ref '%s':%s", refname, err.buf);4454strbuf_release(&err);4455return-1;4456}4457if(!reflog_exists(refname)) {4458unlock_ref(lock);4459return0;4460}44614462 log_file =git_pathdup("logs/%s", refname);4463if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4464/*4465 * Even though holding $GIT_DIR/logs/$reflog.lock has4466 * no locking implications, we use the lock_file4467 * machinery here anyway because it does a lot of the4468 * work we need, including cleaning up if the program4469 * exits unexpectedly.4470 */4471if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4472struct strbuf err = STRBUF_INIT;4473unable_to_lock_message(log_file, errno, &err);4474error("%s", err.buf);4475strbuf_release(&err);4476goto failure;4477}4478 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4479if(!cb.newlog) {4480error("cannot fdopen%s(%s)",4481 reflog_lock.filename.buf,strerror(errno));4482goto failure;4483}4484}44854486(*prepare_fn)(refname, sha1, cb.policy_cb);4487for_each_reflog_ent(refname, expire_reflog_ent, &cb);4488(*cleanup_fn)(cb.policy_cb);44894490if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4491/*4492 * It doesn't make sense to adjust a reference pointed4493 * to by a symbolic ref based on expiring entries in4494 * the symbolic reference's reflog. Nor can we update4495 * a reference if there are no remaining reflog4496 * entries.4497 */4498int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4499!(type & REF_ISSYMREF) &&4500!is_null_sha1(cb.last_kept_sha1);45014502if(close_lock_file(&reflog_lock)) {4503 status |=error("couldn't write%s:%s", log_file,4504strerror(errno));4505}else if(update &&4506(write_in_full(lock->lk->fd,4507sha1_to_hex(cb.last_kept_sha1),40) !=40||4508write_str_in_full(lock->lk->fd,"\n") !=1||4509close_ref(lock) <0)) {4510 status |=error("couldn't write%s",4511 lock->lk->filename.buf);4512rollback_lock_file(&reflog_lock);4513}else if(commit_lock_file(&reflog_lock)) {4514 status |=error("unable to commit reflog '%s' (%s)",4515 log_file,strerror(errno));4516}else if(update &&commit_ref(lock)) {4517 status |=error("couldn't set%s", lock->ref_name);4518}4519}4520free(log_file);4521unlock_ref(lock);4522return status;45234524 failure:4525rollback_lock_file(&reflog_lock);4526free(log_file);4527unlock_ref(lock);4528return-1;4529}