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; 13unsigned char old_sha1[20]; 14int lock_fd; 15}; 16 17/* 18 * How to handle various characters in refnames: 19 * 0: An acceptable character for refs 20 * 1: End-of-component 21 * 2: ., look for a preceding . to reject .. in refs 22 * 3: {, look for a preceding @ to reject @{ in refs 23 * 4: A bad character: ASCII control characters, "~", "^", ":" or SP 24 */ 25static unsigned char refname_disposition[256] = { 261,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, 274,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, 284,0,0,0,0,0,0,0,0,0,4,0,0,0,2,1, 290,0,0,0,0,0,0,0,0,0,4,0,0,0,0,4, 300,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 310,0,0,0,0,0,0,0,0,0,0,4,4,0,4,0, 320,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 330,0,0,0,0,0,0,0,0,0,0,3,0,0,4,4 34}; 35 36/* 37 * Flag passed to lock_ref_sha1_basic() telling it to tolerate broken 38 * refs (i.e., because the reference is about to be deleted anyway). 39 */ 40#define REF_DELETING 0x02 41 42/* 43 * Used as a flag in ref_update::flags when a loose ref is being 44 * pruned. 45 */ 46#define REF_ISPRUNING 0x04 47 48/* 49 * Used as a flag in ref_update::flags when the reference should be 50 * updated to new_sha1. 51 */ 52#define REF_HAVE_NEW 0x08 53 54/* 55 * Used as a flag in ref_update::flags when old_sha1 should be 56 * checked. 57 */ 58#define REF_HAVE_OLD 0x10 59 60/* 61 * Try to read one refname component from the front of refname. 62 * Return the length of the component found, or -1 if the component is 63 * not legal. It is legal if it is something reasonable to have under 64 * ".git/refs/"; We do not like it if: 65 * 66 * - any path component of it begins with ".", or 67 * - it has double dots "..", or 68 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or 69 * - it ends with a "/". 70 * - it ends with ".lock" 71 * - it contains a "\" (backslash) 72 */ 73static intcheck_refname_component(const char*refname,int flags) 74{ 75const char*cp; 76char last ='\0'; 77 78for(cp = refname; ; cp++) { 79int ch = *cp &255; 80unsigned char disp = refname_disposition[ch]; 81switch(disp) { 82case1: 83goto out; 84case2: 85if(last =='.') 86return-1;/* Refname contains "..". */ 87break; 88case3: 89if(last =='@') 90return-1;/* Refname contains "@{". */ 91break; 92case4: 93return-1; 94} 95 last = ch; 96} 97out: 98if(cp == refname) 99return0;/* Component has zero length. */ 100if(refname[0] =='.') 101return-1;/* Component starts with '.'. */ 102if(cp - refname >= LOCK_SUFFIX_LEN && 103!memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN)) 104return-1;/* Refname ends with ".lock". */ 105return cp - refname; 106} 107 108intcheck_refname_format(const char*refname,int flags) 109{ 110int component_len, component_count =0; 111 112if(!strcmp(refname,"@")) 113/* Refname is a single character '@'. */ 114return-1; 115 116while(1) { 117/* We are at the start of a path component. */ 118 component_len =check_refname_component(refname, flags); 119if(component_len <=0) { 120if((flags & REFNAME_REFSPEC_PATTERN) && 121 refname[0] =='*'&& 122(refname[1] =='\0'|| refname[1] =='/')) { 123/* Accept one wildcard as a full refname component. */ 124 flags &= ~REFNAME_REFSPEC_PATTERN; 125 component_len =1; 126}else{ 127return-1; 128} 129} 130 component_count++; 131if(refname[component_len] =='\0') 132break; 133/* Skip to next component. */ 134 refname += component_len +1; 135} 136 137if(refname[component_len -1] =='.') 138return-1;/* Refname ends with '.'. */ 139if(!(flags & REFNAME_ALLOW_ONELEVEL) && component_count <2) 140return-1;/* Refname has only one component. */ 141return0; 142} 143 144struct ref_entry; 145 146/* 147 * Information used (along with the information in ref_entry) to 148 * describe a single cached reference. This data structure only 149 * occurs embedded in a union in struct ref_entry, and only when 150 * (ref_entry->flag & REF_DIR) is zero. 151 */ 152struct ref_value { 153/* 154 * The name of the object to which this reference resolves 155 * (which may be a tag object). If REF_ISBROKEN, this is 156 * null. If REF_ISSYMREF, then this is the name of the object 157 * referred to by the last reference in the symlink chain. 158 */ 159unsigned char sha1[20]; 160 161/* 162 * If REF_KNOWS_PEELED, then this field holds the peeled value 163 * of this reference, or null if the reference is known not to 164 * be peelable. See the documentation for peel_ref() for an 165 * exact definition of "peelable". 166 */ 167unsigned char peeled[20]; 168}; 169 170struct ref_cache; 171 172/* 173 * Information used (along with the information in ref_entry) to 174 * describe a level in the hierarchy of references. This data 175 * structure only occurs embedded in a union in struct ref_entry, and 176 * only when (ref_entry.flag & REF_DIR) is set. In that case, 177 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 178 * in the directory have already been read: 179 * 180 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 181 * or packed references, already read. 182 * 183 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 184 * references that hasn't been read yet (nor has any of its 185 * subdirectories). 186 * 187 * Entries within a directory are stored within a growable array of 188 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 189 * sorted are sorted by their component name in strcmp() order and the 190 * remaining entries are unsorted. 191 * 192 * Loose references are read lazily, one directory at a time. When a 193 * directory of loose references is read, then all of the references 194 * in that directory are stored, and REF_INCOMPLETE stubs are created 195 * for any subdirectories, but the subdirectories themselves are not 196 * read. The reading is triggered by get_ref_dir(). 197 */ 198struct ref_dir { 199int nr, alloc; 200 201/* 202 * Entries with index 0 <= i < sorted are sorted by name. New 203 * entries are appended to the list unsorted, and are sorted 204 * only when required; thus we avoid the need to sort the list 205 * after the addition of every reference. 206 */ 207int sorted; 208 209/* A pointer to the ref_cache that contains this ref_dir. */ 210struct ref_cache *ref_cache; 211 212struct ref_entry **entries; 213}; 214 215/* 216 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 217 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 218 * public values; see refs.h. 219 */ 220 221/* 222 * The field ref_entry->u.value.peeled of this value entry contains 223 * the correct peeled value for the reference, which might be 224 * null_sha1 if the reference is not a tag or if it is broken. 225 */ 226#define REF_KNOWS_PEELED 0x10 227 228/* ref_entry represents a directory of references */ 229#define REF_DIR 0x20 230 231/* 232 * Entry has not yet been read from disk (used only for REF_DIR 233 * entries representing loose references) 234 */ 235#define REF_INCOMPLETE 0x40 236 237/* 238 * A ref_entry represents either a reference or a "subdirectory" of 239 * references. 240 * 241 * Each directory in the reference namespace is represented by a 242 * ref_entry with (flags & REF_DIR) set and containing a subdir member 243 * that holds the entries in that directory that have been read so 244 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 245 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 246 * used for loose reference directories. 247 * 248 * References are represented by a ref_entry with (flags & REF_DIR) 249 * unset and a value member that describes the reference's value. The 250 * flag member is at the ref_entry level, but it is also needed to 251 * interpret the contents of the value field (in other words, a 252 * ref_value object is not very much use without the enclosing 253 * ref_entry). 254 * 255 * Reference names cannot end with slash and directories' names are 256 * always stored with a trailing slash (except for the top-level 257 * directory, which is always denoted by ""). This has two nice 258 * consequences: (1) when the entries in each subdir are sorted 259 * lexicographically by name (as they usually are), the references in 260 * a whole tree can be generated in lexicographic order by traversing 261 * the tree in left-to-right, depth-first order; (2) the names of 262 * references and subdirectories cannot conflict, and therefore the 263 * presence of an empty subdirectory does not block the creation of a 264 * similarly-named reference. (The fact that reference names with the 265 * same leading components can conflict *with each other* is a 266 * separate issue that is regulated by is_refname_available().) 267 * 268 * Please note that the name field contains the fully-qualified 269 * reference (or subdirectory) name. Space could be saved by only 270 * storing the relative names. But that would require the full names 271 * to be generated on the fly when iterating in do_for_each_ref(), and 272 * would break callback functions, who have always been able to assume 273 * that the name strings that they are passed will not be freed during 274 * the iteration. 275 */ 276struct ref_entry { 277unsigned char flag;/* ISSYMREF? ISPACKED? */ 278union{ 279struct ref_value value;/* if not (flags&REF_DIR) */ 280struct ref_dir subdir;/* if (flags&REF_DIR) */ 281} u; 282/* 283 * The full name of the reference (e.g., "refs/heads/master") 284 * or the full name of the directory with a trailing slash 285 * (e.g., "refs/heads/"): 286 */ 287char name[FLEX_ARRAY]; 288}; 289 290static voidread_loose_refs(const char*dirname,struct ref_dir *dir); 291 292static struct ref_dir *get_ref_dir(struct ref_entry *entry) 293{ 294struct ref_dir *dir; 295assert(entry->flag & REF_DIR); 296 dir = &entry->u.subdir; 297if(entry->flag & REF_INCOMPLETE) { 298read_loose_refs(entry->name, dir); 299 entry->flag &= ~REF_INCOMPLETE; 300} 301return dir; 302} 303 304/* 305 * Check if a refname is safe. 306 * For refs that start with "refs/" we consider it safe as long they do 307 * not try to resolve to outside of refs/. 308 * 309 * For all other refs we only consider them safe iff they only contain 310 * upper case characters and '_' (like "HEAD" AND "MERGE_HEAD", and not like 311 * "config"). 312 */ 313static intrefname_is_safe(const char*refname) 314{ 315if(starts_with(refname,"refs/")) { 316char*buf; 317int result; 318 319 buf =xmalloc(strlen(refname) +1); 320/* 321 * Does the refname try to escape refs/? 322 * For example: refs/foo/../bar is safe but refs/foo/../../bar 323 * is not. 324 */ 325 result = !normalize_path_copy(buf, refname +strlen("refs/")); 326free(buf); 327return result; 328} 329while(*refname) { 330if(!isupper(*refname) && *refname !='_') 331return0; 332 refname++; 333} 334return1; 335} 336 337static struct ref_entry *create_ref_entry(const char*refname, 338const unsigned char*sha1,int flag, 339int check_name) 340{ 341int len; 342struct ref_entry *ref; 343 344if(check_name && 345check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 346die("Reference has invalid format: '%s'", refname); 347if(!check_name && !refname_is_safe(refname)) 348die("Reference has invalid name: '%s'", refname); 349 len =strlen(refname) +1; 350 ref =xmalloc(sizeof(struct ref_entry) + len); 351hashcpy(ref->u.value.sha1, sha1); 352hashclr(ref->u.value.peeled); 353memcpy(ref->name, refname, len); 354 ref->flag = flag; 355return ref; 356} 357 358static voidclear_ref_dir(struct ref_dir *dir); 359 360static voidfree_ref_entry(struct ref_entry *entry) 361{ 362if(entry->flag & REF_DIR) { 363/* 364 * Do not use get_ref_dir() here, as that might 365 * trigger the reading of loose refs. 366 */ 367clear_ref_dir(&entry->u.subdir); 368} 369free(entry); 370} 371 372/* 373 * Add a ref_entry to the end of dir (unsorted). Entry is always 374 * stored directly in dir; no recursion into subdirectories is 375 * done. 376 */ 377static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry) 378{ 379ALLOC_GROW(dir->entries, dir->nr +1, dir->alloc); 380 dir->entries[dir->nr++] = entry; 381/* optimize for the case that entries are added in order */ 382if(dir->nr ==1|| 383(dir->nr == dir->sorted +1&& 384strcmp(dir->entries[dir->nr -2]->name, 385 dir->entries[dir->nr -1]->name) <0)) 386 dir->sorted = dir->nr; 387} 388 389/* 390 * Clear and free all entries in dir, recursively. 391 */ 392static voidclear_ref_dir(struct ref_dir *dir) 393{ 394int i; 395for(i =0; i < dir->nr; i++) 396free_ref_entry(dir->entries[i]); 397free(dir->entries); 398 dir->sorted = dir->nr = dir->alloc =0; 399 dir->entries = NULL; 400} 401 402/* 403 * Create a struct ref_entry object for the specified dirname. 404 * dirname is the name of the directory with a trailing slash (e.g., 405 * "refs/heads/") or "" for the top-level directory. 406 */ 407static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 408const char*dirname,size_t len, 409int incomplete) 410{ 411struct ref_entry *direntry; 412 direntry =xcalloc(1,sizeof(struct ref_entry) + len +1); 413memcpy(direntry->name, dirname, len); 414 direntry->name[len] ='\0'; 415 direntry->u.subdir.ref_cache = ref_cache; 416 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE :0); 417return direntry; 418} 419 420static intref_entry_cmp(const void*a,const void*b) 421{ 422struct ref_entry *one = *(struct ref_entry **)a; 423struct ref_entry *two = *(struct ref_entry **)b; 424returnstrcmp(one->name, two->name); 425} 426 427static voidsort_ref_dir(struct ref_dir *dir); 428 429struct string_slice { 430size_t len; 431const char*str; 432}; 433 434static intref_entry_cmp_sslice(const void*key_,const void*ent_) 435{ 436const struct string_slice *key = key_; 437const struct ref_entry *ent = *(const struct ref_entry *const*)ent_; 438int cmp =strncmp(key->str, ent->name, key->len); 439if(cmp) 440return cmp; 441return'\0'- (unsigned char)ent->name[key->len]; 442} 443 444/* 445 * Return the index of the entry with the given refname from the 446 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 447 * no such entry is found. dir must already be complete. 448 */ 449static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len) 450{ 451struct ref_entry **r; 452struct string_slice key; 453 454if(refname == NULL || !dir->nr) 455return-1; 456 457sort_ref_dir(dir); 458 key.len = len; 459 key.str = refname; 460 r =bsearch(&key, dir->entries, dir->nr,sizeof(*dir->entries), 461 ref_entry_cmp_sslice); 462 463if(r == NULL) 464return-1; 465 466return r - dir->entries; 467} 468 469/* 470 * Search for a directory entry directly within dir (without 471 * recursing). Sort dir if necessary. subdirname must be a directory 472 * name (i.e., end in '/'). If mkdir is set, then create the 473 * directory if it is missing; otherwise, return NULL if the desired 474 * directory cannot be found. dir must already be complete. 475 */ 476static struct ref_dir *search_for_subdir(struct ref_dir *dir, 477const char*subdirname,size_t len, 478int mkdir) 479{ 480int entry_index =search_ref_dir(dir, subdirname, len); 481struct ref_entry *entry; 482if(entry_index == -1) { 483if(!mkdir) 484return NULL; 485/* 486 * Since dir is complete, the absence of a subdir 487 * means that the subdir really doesn't exist; 488 * therefore, create an empty record for it but mark 489 * the record complete. 490 */ 491 entry =create_dir_entry(dir->ref_cache, subdirname, len,0); 492add_entry_to_dir(dir, entry); 493}else{ 494 entry = dir->entries[entry_index]; 495} 496returnget_ref_dir(entry); 497} 498 499/* 500 * If refname is a reference name, find the ref_dir within the dir 501 * tree that should hold refname. If refname is a directory name 502 * (i.e., ends in '/'), then return that ref_dir itself. dir must 503 * represent the top-level directory and must already be complete. 504 * Sort ref_dirs and recurse into subdirectories as necessary. If 505 * mkdir is set, then create any missing directories; otherwise, 506 * return NULL if the desired directory cannot be found. 507 */ 508static struct ref_dir *find_containing_dir(struct ref_dir *dir, 509const char*refname,int mkdir) 510{ 511const char*slash; 512for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 513size_t dirnamelen = slash - refname +1; 514struct ref_dir *subdir; 515 subdir =search_for_subdir(dir, refname, dirnamelen, mkdir); 516if(!subdir) { 517 dir = NULL; 518break; 519} 520 dir = subdir; 521} 522 523return dir; 524} 525 526/* 527 * Find the value entry with the given name in dir, sorting ref_dirs 528 * and recursing into subdirectories as necessary. If the name is not 529 * found or it corresponds to a directory entry, return NULL. 530 */ 531static struct ref_entry *find_ref(struct ref_dir *dir,const char*refname) 532{ 533int entry_index; 534struct ref_entry *entry; 535 dir =find_containing_dir(dir, refname,0); 536if(!dir) 537return NULL; 538 entry_index =search_ref_dir(dir, refname,strlen(refname)); 539if(entry_index == -1) 540return NULL; 541 entry = dir->entries[entry_index]; 542return(entry->flag & REF_DIR) ? NULL : entry; 543} 544 545/* 546 * Remove the entry with the given name from dir, recursing into 547 * subdirectories as necessary. If refname is the name of a directory 548 * (i.e., ends with '/'), then remove the directory and its contents. 549 * If the removal was successful, return the number of entries 550 * remaining in the directory entry that contained the deleted entry. 551 * If the name was not found, return -1. Please note that this 552 * function only deletes the entry from the cache; it does not delete 553 * it from the filesystem or ensure that other cache entries (which 554 * might be symbolic references to the removed entry) are updated. 555 * Nor does it remove any containing dir entries that might be made 556 * empty by the removal. dir must represent the top-level directory 557 * and must already be complete. 558 */ 559static intremove_entry(struct ref_dir *dir,const char*refname) 560{ 561int refname_len =strlen(refname); 562int entry_index; 563struct ref_entry *entry; 564int is_dir = refname[refname_len -1] =='/'; 565if(is_dir) { 566/* 567 * refname represents a reference directory. Remove 568 * the trailing slash; otherwise we will get the 569 * directory *representing* refname rather than the 570 * one *containing* it. 571 */ 572char*dirname =xmemdupz(refname, refname_len -1); 573 dir =find_containing_dir(dir, dirname,0); 574free(dirname); 575}else{ 576 dir =find_containing_dir(dir, refname,0); 577} 578if(!dir) 579return-1; 580 entry_index =search_ref_dir(dir, refname, refname_len); 581if(entry_index == -1) 582return-1; 583 entry = dir->entries[entry_index]; 584 585memmove(&dir->entries[entry_index], 586&dir->entries[entry_index +1], 587(dir->nr - entry_index -1) *sizeof(*dir->entries) 588); 589 dir->nr--; 590if(dir->sorted > entry_index) 591 dir->sorted--; 592free_ref_entry(entry); 593return dir->nr; 594} 595 596/* 597 * Add a ref_entry to the ref_dir (unsorted), recursing into 598 * subdirectories as necessary. dir must represent the top-level 599 * directory. Return 0 on success. 600 */ 601static intadd_ref(struct ref_dir *dir,struct ref_entry *ref) 602{ 603 dir =find_containing_dir(dir, ref->name,1); 604if(!dir) 605return-1; 606add_entry_to_dir(dir, ref); 607return0; 608} 609 610/* 611 * Emit a warning and return true iff ref1 and ref2 have the same name 612 * and the same sha1. Die if they have the same name but different 613 * sha1s. 614 */ 615static intis_dup_ref(const struct ref_entry *ref1,const struct ref_entry *ref2) 616{ 617if(strcmp(ref1->name, ref2->name)) 618return0; 619 620/* Duplicate name; make sure that they don't conflict: */ 621 622if((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 623/* This is impossible by construction */ 624die("Reference directory conflict:%s", ref1->name); 625 626if(hashcmp(ref1->u.value.sha1, ref2->u.value.sha1)) 627die("Duplicated ref, and SHA1s don't match:%s", ref1->name); 628 629warning("Duplicated ref:%s", ref1->name); 630return1; 631} 632 633/* 634 * Sort the entries in dir non-recursively (if they are not already 635 * sorted) and remove any duplicate entries. 636 */ 637static voidsort_ref_dir(struct ref_dir *dir) 638{ 639int i, j; 640struct ref_entry *last = NULL; 641 642/* 643 * This check also prevents passing a zero-length array to qsort(), 644 * which is a problem on some platforms. 645 */ 646if(dir->sorted == dir->nr) 647return; 648 649qsort(dir->entries, dir->nr,sizeof(*dir->entries), ref_entry_cmp); 650 651/* Remove any duplicates: */ 652for(i =0, j =0; j < dir->nr; j++) { 653struct ref_entry *entry = dir->entries[j]; 654if(last &&is_dup_ref(last, entry)) 655free_ref_entry(entry); 656else 657 last = dir->entries[i++] = entry; 658} 659 dir->sorted = dir->nr = i; 660} 661 662/* Include broken references in a do_for_each_ref*() iteration: */ 663#define DO_FOR_EACH_INCLUDE_BROKEN 0x01 664 665/* 666 * Return true iff the reference described by entry can be resolved to 667 * an object in the database. Emit a warning if the referred-to 668 * object does not exist. 669 */ 670static intref_resolves_to_object(struct ref_entry *entry) 671{ 672if(entry->flag & REF_ISBROKEN) 673return0; 674if(!has_sha1_file(entry->u.value.sha1)) { 675error("%sdoes not point to a valid object!", entry->name); 676return0; 677} 678return1; 679} 680 681/* 682 * current_ref is a performance hack: when iterating over references 683 * using the for_each_ref*() functions, current_ref is set to the 684 * current reference's entry before calling the callback function. If 685 * the callback function calls peel_ref(), then peel_ref() first 686 * checks whether the reference to be peeled is the current reference 687 * (it usually is) and if so, returns that reference's peeled version 688 * if it is available. This avoids a refname lookup in a common case. 689 */ 690static struct ref_entry *current_ref; 691 692typedefinteach_ref_entry_fn(struct ref_entry *entry,void*cb_data); 693 694struct ref_entry_cb { 695const char*base; 696int trim; 697int flags; 698 each_ref_fn *fn; 699void*cb_data; 700}; 701 702/* 703 * Handle one reference in a do_for_each_ref*()-style iteration, 704 * calling an each_ref_fn for each entry. 705 */ 706static intdo_one_ref(struct ref_entry *entry,void*cb_data) 707{ 708struct ref_entry_cb *data = cb_data; 709struct ref_entry *old_current_ref; 710int retval; 711 712if(!starts_with(entry->name, data->base)) 713return0; 714 715if(!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && 716!ref_resolves_to_object(entry)) 717return0; 718 719/* Store the old value, in case this is a recursive call: */ 720 old_current_ref = current_ref; 721 current_ref = entry; 722 retval = data->fn(entry->name + data->trim, entry->u.value.sha1, 723 entry->flag, data->cb_data); 724 current_ref = old_current_ref; 725return retval; 726} 727 728/* 729 * Call fn for each reference in dir that has index in the range 730 * offset <= index < dir->nr. Recurse into subdirectories that are in 731 * that index range, sorting them before iterating. This function 732 * does not sort dir itself; it should be sorted beforehand. fn is 733 * called for all references, including broken ones. 734 */ 735static intdo_for_each_entry_in_dir(struct ref_dir *dir,int offset, 736 each_ref_entry_fn fn,void*cb_data) 737{ 738int i; 739assert(dir->sorted == dir->nr); 740for(i = offset; i < dir->nr; i++) { 741struct ref_entry *entry = dir->entries[i]; 742int retval; 743if(entry->flag & REF_DIR) { 744struct ref_dir *subdir =get_ref_dir(entry); 745sort_ref_dir(subdir); 746 retval =do_for_each_entry_in_dir(subdir,0, fn, cb_data); 747}else{ 748 retval =fn(entry, cb_data); 749} 750if(retval) 751return retval; 752} 753return0; 754} 755 756/* 757 * Call fn for each reference in the union of dir1 and dir2, in order 758 * by refname. Recurse into subdirectories. If a value entry appears 759 * in both dir1 and dir2, then only process the version that is in 760 * dir2. The input dirs must already be sorted, but subdirs will be 761 * sorted as needed. fn is called for all references, including 762 * broken ones. 763 */ 764static intdo_for_each_entry_in_dirs(struct ref_dir *dir1, 765struct ref_dir *dir2, 766 each_ref_entry_fn fn,void*cb_data) 767{ 768int retval; 769int i1 =0, i2 =0; 770 771assert(dir1->sorted == dir1->nr); 772assert(dir2->sorted == dir2->nr); 773while(1) { 774struct ref_entry *e1, *e2; 775int cmp; 776if(i1 == dir1->nr) { 777returndo_for_each_entry_in_dir(dir2, i2, fn, cb_data); 778} 779if(i2 == dir2->nr) { 780returndo_for_each_entry_in_dir(dir1, i1, fn, cb_data); 781} 782 e1 = dir1->entries[i1]; 783 e2 = dir2->entries[i2]; 784 cmp =strcmp(e1->name, e2->name); 785if(cmp ==0) { 786if((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { 787/* Both are directories; descend them in parallel. */ 788struct ref_dir *subdir1 =get_ref_dir(e1); 789struct ref_dir *subdir2 =get_ref_dir(e2); 790sort_ref_dir(subdir1); 791sort_ref_dir(subdir2); 792 retval =do_for_each_entry_in_dirs( 793 subdir1, subdir2, fn, cb_data); 794 i1++; 795 i2++; 796}else if(!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { 797/* Both are references; ignore the one from dir1. */ 798 retval =fn(e2, cb_data); 799 i1++; 800 i2++; 801}else{ 802die("conflict between reference and directory:%s", 803 e1->name); 804} 805}else{ 806struct ref_entry *e; 807if(cmp <0) { 808 e = e1; 809 i1++; 810}else{ 811 e = e2; 812 i2++; 813} 814if(e->flag & REF_DIR) { 815struct ref_dir *subdir =get_ref_dir(e); 816sort_ref_dir(subdir); 817 retval =do_for_each_entry_in_dir( 818 subdir,0, fn, cb_data); 819}else{ 820 retval =fn(e, cb_data); 821} 822} 823if(retval) 824return retval; 825} 826} 827 828/* 829 * Load all of the refs from the dir into our in-memory cache. The hard work 830 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 831 * through all of the sub-directories. We do not even need to care about 832 * sorting, as traversal order does not matter to us. 833 */ 834static voidprime_ref_dir(struct ref_dir *dir) 835{ 836int i; 837for(i =0; i < dir->nr; i++) { 838struct ref_entry *entry = dir->entries[i]; 839if(entry->flag & REF_DIR) 840prime_ref_dir(get_ref_dir(entry)); 841} 842} 843 844static intentry_matches(struct ref_entry *entry,const struct string_list *list) 845{ 846return list &&string_list_has_string(list, entry->name); 847} 848 849struct nonmatching_ref_data { 850const struct string_list *skip; 851struct ref_entry *found; 852}; 853 854static intnonmatching_ref_fn(struct ref_entry *entry,void*vdata) 855{ 856struct nonmatching_ref_data *data = vdata; 857 858if(entry_matches(entry, data->skip)) 859return0; 860 861 data->found = entry; 862return1; 863} 864 865static voidreport_refname_conflict(struct ref_entry *entry, 866const char*refname) 867{ 868error("'%s' exists; cannot create '%s'", entry->name, refname); 869} 870 871/* 872 * Return true iff a reference named refname could be created without 873 * conflicting with the name of an existing reference in dir. If 874 * skip is non-NULL, ignore potential conflicts with refs in skip 875 * (e.g., because they are scheduled for deletion in the same 876 * operation). 877 * 878 * Two reference names conflict if one of them exactly matches the 879 * leading components of the other; e.g., "foo/bar" conflicts with 880 * both "foo" and with "foo/bar/baz" but not with "foo/bar" or 881 * "foo/barbados". 882 * 883 * skip must be sorted. 884 */ 885static intis_refname_available(const char*refname, 886const struct string_list *skip, 887struct ref_dir *dir) 888{ 889const char*slash; 890size_t len; 891int pos; 892char*dirname; 893 894for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 895/* 896 * We are still at a leading dir of the refname; we are 897 * looking for a conflict with a leaf entry. 898 * 899 * If we find one, we still must make sure it is 900 * not in "skip". 901 */ 902 pos =search_ref_dir(dir, refname, slash - refname); 903if(pos >=0) { 904struct ref_entry *entry = dir->entries[pos]; 905if(entry_matches(entry, skip)) 906return1; 907report_refname_conflict(entry, refname); 908return0; 909} 910 911 912/* 913 * Otherwise, we can try to continue our search with 914 * the next component; if we come up empty, we know 915 * there is nothing under this whole prefix. 916 */ 917 pos =search_ref_dir(dir, refname, slash +1- refname); 918if(pos <0) 919return1; 920 921 dir =get_ref_dir(dir->entries[pos]); 922} 923 924/* 925 * We are at the leaf of our refname; we want to 926 * make sure there are no directories which match it. 927 */ 928 len =strlen(refname); 929 dirname =xmallocz(len +1); 930sprintf(dirname,"%s/", refname); 931 pos =search_ref_dir(dir, dirname, len +1); 932free(dirname); 933 934if(pos >=0) { 935/* 936 * We found a directory named "refname". It is a 937 * problem iff it contains any ref that is not 938 * in "skip". 939 */ 940struct ref_entry *entry = dir->entries[pos]; 941struct ref_dir *dir =get_ref_dir(entry); 942struct nonmatching_ref_data data; 943 944 data.skip = skip; 945sort_ref_dir(dir); 946if(!do_for_each_entry_in_dir(dir,0, nonmatching_ref_fn, &data)) 947return1; 948 949report_refname_conflict(data.found, refname); 950return0; 951} 952 953/* 954 * There is no point in searching for another leaf 955 * node which matches it; such an entry would be the 956 * ref we are looking for, not a conflict. 957 */ 958return1; 959} 960 961struct packed_ref_cache { 962struct ref_entry *root; 963 964/* 965 * Count of references to the data structure in this instance, 966 * including the pointer from ref_cache::packed if any. The 967 * data will not be freed as long as the reference count is 968 * nonzero. 969 */ 970unsigned int referrers; 971 972/* 973 * Iff the packed-refs file associated with this instance is 974 * currently locked for writing, this points at the associated 975 * lock (which is owned by somebody else). The referrer count 976 * is also incremented when the file is locked and decremented 977 * when it is unlocked. 978 */ 979struct lock_file *lock; 980 981/* The metadata from when this packed-refs cache was read */ 982struct stat_validity validity; 983}; 984 985/* 986 * Future: need to be in "struct repository" 987 * when doing a full libification. 988 */ 989static struct ref_cache { 990struct ref_cache *next; 991struct ref_entry *loose; 992struct packed_ref_cache *packed; 993/* 994 * The submodule name, or "" for the main repo. We allocate 995 * length 1 rather than FLEX_ARRAY so that the main ref_cache 996 * is initialized correctly. 997 */ 998char name[1]; 999} ref_cache, *submodule_ref_caches;10001001/* Lock used for the main packed-refs file: */1002static struct lock_file packlock;10031004/*1005 * Increment the reference count of *packed_refs.1006 */1007static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs)1008{1009 packed_refs->referrers++;1010}10111012/*1013 * Decrease the reference count of *packed_refs. If it goes to zero,1014 * free *packed_refs and return true; otherwise return false.1015 */1016static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs)1017{1018if(!--packed_refs->referrers) {1019free_ref_entry(packed_refs->root);1020stat_validity_clear(&packed_refs->validity);1021free(packed_refs);1022return1;1023}else{1024return0;1025}1026}10271028static voidclear_packed_ref_cache(struct ref_cache *refs)1029{1030if(refs->packed) {1031struct packed_ref_cache *packed_refs = refs->packed;10321033if(packed_refs->lock)1034die("internal error: packed-ref cache cleared while locked");1035 refs->packed = NULL;1036release_packed_ref_cache(packed_refs);1037}1038}10391040static voidclear_loose_ref_cache(struct ref_cache *refs)1041{1042if(refs->loose) {1043free_ref_entry(refs->loose);1044 refs->loose = NULL;1045}1046}10471048static struct ref_cache *create_ref_cache(const char*submodule)1049{1050int len;1051struct ref_cache *refs;1052if(!submodule)1053 submodule ="";1054 len =strlen(submodule) +1;1055 refs =xcalloc(1,sizeof(struct ref_cache) + len);1056memcpy(refs->name, submodule, len);1057return refs;1058}10591060/*1061 * Return a pointer to a ref_cache for the specified submodule. For1062 * the main repository, use submodule==NULL. The returned structure1063 * will be allocated and initialized but not necessarily populated; it1064 * should not be freed.1065 */1066static struct ref_cache *get_ref_cache(const char*submodule)1067{1068struct ref_cache *refs;10691070if(!submodule || !*submodule)1071return&ref_cache;10721073for(refs = submodule_ref_caches; refs; refs = refs->next)1074if(!strcmp(submodule, refs->name))1075return refs;10761077 refs =create_ref_cache(submodule);1078 refs->next = submodule_ref_caches;1079 submodule_ref_caches = refs;1080return refs;1081}10821083/* The length of a peeled reference line in packed-refs, including EOL: */1084#define PEELED_LINE_LENGTH 4210851086/*1087 * The packed-refs header line that we write out. Perhaps other1088 * traits will be added later. The trailing space is required.1089 */1090static const char PACKED_REFS_HEADER[] =1091"# pack-refs with: peeled fully-peeled\n";10921093/*1094 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1095 * Return a pointer to the refname within the line (null-terminated),1096 * or NULL if there was a problem.1097 */1098static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1)1099{1100const char*ref;11011102/*1103 * 42: the answer to everything.1104 *1105 * In this case, it happens to be the answer to1106 * 40 (length of sha1 hex representation)1107 * +1 (space in between hex and name)1108 * +1 (newline at the end of the line)1109 */1110if(line->len <=42)1111return NULL;11121113if(get_sha1_hex(line->buf, sha1) <0)1114return NULL;1115if(!isspace(line->buf[40]))1116return NULL;11171118 ref = line->buf +41;1119if(isspace(*ref))1120return NULL;11211122if(line->buf[line->len -1] !='\n')1123return NULL;1124 line->buf[--line->len] =0;11251126return ref;1127}11281129/*1130 * Read f, which is a packed-refs file, into dir.1131 *1132 * A comment line of the form "# pack-refs with: " may contain zero or1133 * more traits. We interpret the traits as follows:1134 *1135 * No traits:1136 *1137 * Probably no references are peeled. But if the file contains a1138 * peeled value for a reference, we will use it.1139 *1140 * peeled:1141 *1142 * References under "refs/tags/", if they *can* be peeled, *are*1143 * peeled in this file. References outside of "refs/tags/" are1144 * probably not peeled even if they could have been, but if we find1145 * a peeled value for such a reference we will use it.1146 *1147 * fully-peeled:1148 *1149 * All references in the file that can be peeled are peeled.1150 * Inversely (and this is more important), any references in the1151 * file for which no peeled value is recorded is not peelable. This1152 * trait should typically be written alongside "peeled" for1153 * compatibility with older clients, but we do not require it1154 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1155 */1156static voidread_packed_refs(FILE*f,struct ref_dir *dir)1157{1158struct ref_entry *last = NULL;1159struct strbuf line = STRBUF_INIT;1160enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;11611162while(strbuf_getwholeline(&line, f,'\n') != EOF) {1163unsigned char sha1[20];1164const char*refname;1165const char*traits;11661167if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1168if(strstr(traits," fully-peeled "))1169 peeled = PEELED_FULLY;1170else if(strstr(traits," peeled "))1171 peeled = PEELED_TAGS;1172/* perhaps other traits later as well */1173continue;1174}11751176 refname =parse_ref_line(&line, sha1);1177if(refname) {1178int flag = REF_ISPACKED;11791180if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1181hashclr(sha1);1182 flag |= REF_BAD_NAME | REF_ISBROKEN;1183}1184 last =create_ref_entry(refname, sha1, flag,0);1185if(peeled == PEELED_FULLY ||1186(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1187 last->flag |= REF_KNOWS_PEELED;1188add_ref(dir, last);1189continue;1190}1191if(last &&1192 line.buf[0] =='^'&&1193 line.len == PEELED_LINE_LENGTH &&1194 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1195!get_sha1_hex(line.buf +1, sha1)) {1196hashcpy(last->u.value.peeled, sha1);1197/*1198 * Regardless of what the file header said,1199 * we definitely know the value of *this*1200 * reference:1201 */1202 last->flag |= REF_KNOWS_PEELED;1203}1204}12051206strbuf_release(&line);1207}12081209/*1210 * Get the packed_ref_cache for the specified ref_cache, creating it1211 * if necessary.1212 */1213static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1214{1215const char*packed_refs_file;12161217if(*refs->name)1218 packed_refs_file =git_path_submodule(refs->name,"packed-refs");1219else1220 packed_refs_file =git_path("packed-refs");12211222if(refs->packed &&1223!stat_validity_check(&refs->packed->validity, packed_refs_file))1224clear_packed_ref_cache(refs);12251226if(!refs->packed) {1227FILE*f;12281229 refs->packed =xcalloc(1,sizeof(*refs->packed));1230acquire_packed_ref_cache(refs->packed);1231 refs->packed->root =create_dir_entry(refs,"",0,0);1232 f =fopen(packed_refs_file,"r");1233if(f) {1234stat_validity_update(&refs->packed->validity,fileno(f));1235read_packed_refs(f,get_ref_dir(refs->packed->root));1236fclose(f);1237}1238}1239return refs->packed;1240}12411242static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1243{1244returnget_ref_dir(packed_ref_cache->root);1245}12461247static struct ref_dir *get_packed_refs(struct ref_cache *refs)1248{1249returnget_packed_ref_dir(get_packed_ref_cache(refs));1250}12511252voidadd_packed_ref(const char*refname,const unsigned char*sha1)1253{1254struct packed_ref_cache *packed_ref_cache =1255get_packed_ref_cache(&ref_cache);12561257if(!packed_ref_cache->lock)1258die("internal error: packed refs not locked");1259add_ref(get_packed_ref_dir(packed_ref_cache),1260create_ref_entry(refname, sha1, REF_ISPACKED,1));1261}12621263/*1264 * Read the loose references from the namespace dirname into dir1265 * (without recursing). dirname must end with '/'. dir must be the1266 * directory entry corresponding to dirname.1267 */1268static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1269{1270struct ref_cache *refs = dir->ref_cache;1271DIR*d;1272const char*path;1273struct dirent *de;1274int dirnamelen =strlen(dirname);1275struct strbuf refname;12761277if(*refs->name)1278 path =git_path_submodule(refs->name,"%s", dirname);1279else1280 path =git_path("%s", dirname);12811282 d =opendir(path);1283if(!d)1284return;12851286strbuf_init(&refname, dirnamelen +257);1287strbuf_add(&refname, dirname, dirnamelen);12881289while((de =readdir(d)) != NULL) {1290unsigned char sha1[20];1291struct stat st;1292int flag;1293const char*refdir;12941295if(de->d_name[0] =='.')1296continue;1297if(ends_with(de->d_name,".lock"))1298continue;1299strbuf_addstr(&refname, de->d_name);1300 refdir = *refs->name1301?git_path_submodule(refs->name,"%s", refname.buf)1302:git_path("%s", refname.buf);1303if(stat(refdir, &st) <0) {1304;/* silently ignore */1305}else if(S_ISDIR(st.st_mode)) {1306strbuf_addch(&refname,'/');1307add_entry_to_dir(dir,1308create_dir_entry(refs, refname.buf,1309 refname.len,1));1310}else{1311if(*refs->name) {1312hashclr(sha1);1313 flag =0;1314if(resolve_gitlink_ref(refs->name, refname.buf, sha1) <0) {1315hashclr(sha1);1316 flag |= REF_ISBROKEN;1317}1318}else if(read_ref_full(refname.buf,1319 RESOLVE_REF_READING,1320 sha1, &flag)) {1321hashclr(sha1);1322 flag |= REF_ISBROKEN;1323}1324if(check_refname_format(refname.buf,1325 REFNAME_ALLOW_ONELEVEL)) {1326hashclr(sha1);1327 flag |= REF_BAD_NAME | REF_ISBROKEN;1328}1329add_entry_to_dir(dir,1330create_ref_entry(refname.buf, sha1, flag,0));1331}1332strbuf_setlen(&refname, dirnamelen);1333}1334strbuf_release(&refname);1335closedir(d);1336}13371338static struct ref_dir *get_loose_refs(struct ref_cache *refs)1339{1340if(!refs->loose) {1341/*1342 * Mark the top-level directory complete because we1343 * are about to read the only subdirectory that can1344 * hold references:1345 */1346 refs->loose =create_dir_entry(refs,"",0,0);1347/*1348 * Create an incomplete entry for "refs/":1349 */1350add_entry_to_dir(get_ref_dir(refs->loose),1351create_dir_entry(refs,"refs/",5,1));1352}1353returnget_ref_dir(refs->loose);1354}13551356/* We allow "recursive" symbolic refs. Only within reason, though */1357#define MAXDEPTH 51358#define MAXREFLEN (1024)13591360/*1361 * Called by resolve_gitlink_ref_recursive() after it failed to read1362 * from the loose refs in ref_cache refs. Find <refname> in the1363 * packed-refs file for the submodule.1364 */1365static intresolve_gitlink_packed_ref(struct ref_cache *refs,1366const char*refname,unsigned char*sha1)1367{1368struct ref_entry *ref;1369struct ref_dir *dir =get_packed_refs(refs);13701371 ref =find_ref(dir, refname);1372if(ref == NULL)1373return-1;13741375hashcpy(sha1, ref->u.value.sha1);1376return0;1377}13781379static intresolve_gitlink_ref_recursive(struct ref_cache *refs,1380const char*refname,unsigned char*sha1,1381int recursion)1382{1383int fd, len;1384char buffer[128], *p;1385const char*path;13861387if(recursion > MAXDEPTH ||strlen(refname) > MAXREFLEN)1388return-1;1389 path = *refs->name1390?git_path_submodule(refs->name,"%s", refname)1391:git_path("%s", refname);1392 fd =open(path, O_RDONLY);1393if(fd <0)1394returnresolve_gitlink_packed_ref(refs, refname, sha1);13951396 len =read(fd, buffer,sizeof(buffer)-1);1397close(fd);1398if(len <0)1399return-1;1400while(len &&isspace(buffer[len-1]))1401 len--;1402 buffer[len] =0;14031404/* Was it a detached head or an old-fashioned symlink? */1405if(!get_sha1_hex(buffer, sha1))1406return0;14071408/* Symref? */1409if(strncmp(buffer,"ref:",4))1410return-1;1411 p = buffer +4;1412while(isspace(*p))1413 p++;14141415returnresolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1416}14171418intresolve_gitlink_ref(const char*path,const char*refname,unsigned char*sha1)1419{1420int len =strlen(path), retval;1421char*submodule;1422struct ref_cache *refs;14231424while(len && path[len-1] =='/')1425 len--;1426if(!len)1427return-1;1428 submodule =xstrndup(path, len);1429 refs =get_ref_cache(submodule);1430free(submodule);14311432 retval =resolve_gitlink_ref_recursive(refs, refname, sha1,0);1433return retval;1434}14351436/*1437 * Return the ref_entry for the given refname from the packed1438 * references. If it does not exist, return NULL.1439 */1440static struct ref_entry *get_packed_ref(const char*refname)1441{1442returnfind_ref(get_packed_refs(&ref_cache), refname);1443}14441445/*1446 * A loose ref file doesn't exist; check for a packed ref. The1447 * options are forwarded from resolve_safe_unsafe().1448 */1449static intresolve_missing_loose_ref(const char*refname,1450int resolve_flags,1451unsigned char*sha1,1452int*flags)1453{1454struct ref_entry *entry;14551456/*1457 * The loose reference file does not exist; check for a packed1458 * reference.1459 */1460 entry =get_packed_ref(refname);1461if(entry) {1462hashcpy(sha1, entry->u.value.sha1);1463if(flags)1464*flags |= REF_ISPACKED;1465return0;1466}1467/* The reference is not a packed reference, either. */1468if(resolve_flags & RESOLVE_REF_READING) {1469 errno = ENOENT;1470return-1;1471}else{1472hashclr(sha1);1473return0;1474}1475}14761477/* This function needs to return a meaningful errno on failure */1478static const char*resolve_ref_unsafe_1(const char*refname,1479int resolve_flags,1480unsigned char*sha1,1481int*flags,1482struct strbuf *sb_path)1483{1484int depth = MAXDEPTH;1485 ssize_t len;1486char buffer[256];1487static char refname_buffer[256];1488int bad_name =0;14891490if(flags)1491*flags =0;14921493if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1494if(flags)1495*flags |= REF_BAD_NAME;14961497if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1498!refname_is_safe(refname)) {1499 errno = EINVAL;1500return NULL;1501}1502/*1503 * dwim_ref() uses REF_ISBROKEN to distinguish between1504 * missing refs and refs that were present but invalid,1505 * to complain about the latter to stderr.1506 *1507 * We don't know whether the ref exists, so don't set1508 * REF_ISBROKEN yet.1509 */1510 bad_name =1;1511}1512for(;;) {1513const char*path;1514struct stat st;1515char*buf;1516int fd;15171518if(--depth <0) {1519 errno = ELOOP;1520return NULL;1521}15221523strbuf_reset(sb_path);1524strbuf_git_path(sb_path,"%s", refname);1525 path = sb_path->buf;15261527/*1528 * We might have to loop back here to avoid a race1529 * condition: first we lstat() the file, then we try1530 * to read it as a link or as a file. But if somebody1531 * changes the type of the file (file <-> directory1532 * <-> symlink) between the lstat() and reading, then1533 * we don't want to report that as an error but rather1534 * try again starting with the lstat().1535 */1536 stat_ref:1537if(lstat(path, &st) <0) {1538if(errno != ENOENT)1539return NULL;1540if(resolve_missing_loose_ref(refname, resolve_flags,1541 sha1, flags))1542return NULL;1543if(bad_name) {1544hashclr(sha1);1545if(flags)1546*flags |= REF_ISBROKEN;1547}1548return refname;1549}15501551/* Follow "normalized" - ie "refs/.." symlinks by hand */1552if(S_ISLNK(st.st_mode)) {1553 len =readlink(path, buffer,sizeof(buffer)-1);1554if(len <0) {1555if(errno == ENOENT || errno == EINVAL)1556/* inconsistent with lstat; retry */1557goto stat_ref;1558else1559return NULL;1560}1561 buffer[len] =0;1562if(starts_with(buffer,"refs/") &&1563!check_refname_format(buffer,0)) {1564strcpy(refname_buffer, buffer);1565 refname = refname_buffer;1566if(flags)1567*flags |= REF_ISSYMREF;1568if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1569hashclr(sha1);1570return refname;1571}1572continue;1573}1574}15751576/* Is it a directory? */1577if(S_ISDIR(st.st_mode)) {1578 errno = EISDIR;1579return NULL;1580}15811582/*1583 * Anything else, just open it and try to use it as1584 * a ref1585 */1586 fd =open(path, O_RDONLY);1587if(fd <0) {1588if(errno == ENOENT)1589/* inconsistent with lstat; retry */1590goto stat_ref;1591else1592return NULL;1593}1594 len =read_in_full(fd, buffer,sizeof(buffer)-1);1595if(len <0) {1596int save_errno = errno;1597close(fd);1598 errno = save_errno;1599return NULL;1600}1601close(fd);1602while(len &&isspace(buffer[len-1]))1603 len--;1604 buffer[len] ='\0';16051606/*1607 * Is it a symbolic ref?1608 */1609if(!starts_with(buffer,"ref:")) {1610/*1611 * Please note that FETCH_HEAD has a second1612 * line containing other data.1613 */1614if(get_sha1_hex(buffer, sha1) ||1615(buffer[40] !='\0'&& !isspace(buffer[40]))) {1616if(flags)1617*flags |= REF_ISBROKEN;1618 errno = EINVAL;1619return NULL;1620}1621if(bad_name) {1622hashclr(sha1);1623if(flags)1624*flags |= REF_ISBROKEN;1625}1626return refname;1627}1628if(flags)1629*flags |= REF_ISSYMREF;1630 buf = buffer +4;1631while(isspace(*buf))1632 buf++;1633 refname =strcpy(refname_buffer, buf);1634if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1635hashclr(sha1);1636return refname;1637}1638if(check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {1639if(flags)1640*flags |= REF_ISBROKEN;16411642if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1643!refname_is_safe(buf)) {1644 errno = EINVAL;1645return NULL;1646}1647 bad_name =1;1648}1649}1650}16511652const char*resolve_ref_unsafe(const char*refname,int resolve_flags,1653unsigned char*sha1,int*flags)1654{1655struct strbuf sb_path = STRBUF_INIT;1656const char*ret =resolve_ref_unsafe_1(refname, resolve_flags,1657 sha1, flags, &sb_path);1658strbuf_release(&sb_path);1659return ret;1660}16611662char*resolve_refdup(const char*ref,int resolve_flags,unsigned char*sha1,int*flags)1663{1664returnxstrdup_or_null(resolve_ref_unsafe(ref, resolve_flags, sha1, flags));1665}16661667/* The argument to filter_refs */1668struct ref_filter {1669const char*pattern;1670 each_ref_fn *fn;1671void*cb_data;1672};16731674intread_ref_full(const char*refname,int resolve_flags,unsigned char*sha1,int*flags)1675{1676if(resolve_ref_unsafe(refname, resolve_flags, sha1, flags))1677return0;1678return-1;1679}16801681intread_ref(const char*refname,unsigned char*sha1)1682{1683returnread_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);1684}16851686intref_exists(const char*refname)1687{1688unsigned char sha1[20];1689return!!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);1690}16911692static intfilter_refs(const char*refname,const unsigned char*sha1,int flags,1693void*data)1694{1695struct ref_filter *filter = (struct ref_filter *)data;1696if(wildmatch(filter->pattern, refname,0, NULL))1697return0;1698return filter->fn(refname, sha1, flags, filter->cb_data);1699}17001701enum peel_status {1702/* object was peeled successfully: */1703 PEEL_PEELED =0,17041705/*1706 * object cannot be peeled because the named object (or an1707 * object referred to by a tag in the peel chain), does not1708 * exist.1709 */1710 PEEL_INVALID = -1,17111712/* object cannot be peeled because it is not a tag: */1713 PEEL_NON_TAG = -2,17141715/* ref_entry contains no peeled value because it is a symref: */1716 PEEL_IS_SYMREF = -3,17171718/*1719 * ref_entry cannot be peeled because it is broken (i.e., the1720 * symbolic reference cannot even be resolved to an object1721 * name):1722 */1723 PEEL_BROKEN = -41724};17251726/*1727 * Peel the named object; i.e., if the object is a tag, resolve the1728 * tag recursively until a non-tag is found. If successful, store the1729 * result to sha1 and return PEEL_PEELED. If the object is not a tag1730 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,1731 * and leave sha1 unchanged.1732 */1733static enum peel_status peel_object(const unsigned char*name,unsigned char*sha1)1734{1735struct object *o =lookup_unknown_object(name);17361737if(o->type == OBJ_NONE) {1738int type =sha1_object_info(name, NULL);1739if(type <0|| !object_as_type(o, type,0))1740return PEEL_INVALID;1741}17421743if(o->type != OBJ_TAG)1744return PEEL_NON_TAG;17451746 o =deref_tag_noverify(o);1747if(!o)1748return PEEL_INVALID;17491750hashcpy(sha1, o->sha1);1751return PEEL_PEELED;1752}17531754/*1755 * Peel the entry (if possible) and return its new peel_status. If1756 * repeel is true, re-peel the entry even if there is an old peeled1757 * value that is already stored in it.1758 *1759 * It is OK to call this function with a packed reference entry that1760 * might be stale and might even refer to an object that has since1761 * been garbage-collected. In such a case, if the entry has1762 * REF_KNOWS_PEELED then leave the status unchanged and return1763 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1764 */1765static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1766{1767enum peel_status status;17681769if(entry->flag & REF_KNOWS_PEELED) {1770if(repeel) {1771 entry->flag &= ~REF_KNOWS_PEELED;1772hashclr(entry->u.value.peeled);1773}else{1774returnis_null_sha1(entry->u.value.peeled) ?1775 PEEL_NON_TAG : PEEL_PEELED;1776}1777}1778if(entry->flag & REF_ISBROKEN)1779return PEEL_BROKEN;1780if(entry->flag & REF_ISSYMREF)1781return PEEL_IS_SYMREF;17821783 status =peel_object(entry->u.value.sha1, entry->u.value.peeled);1784if(status == PEEL_PEELED || status == PEEL_NON_TAG)1785 entry->flag |= REF_KNOWS_PEELED;1786return status;1787}17881789intpeel_ref(const char*refname,unsigned char*sha1)1790{1791int flag;1792unsigned char base[20];17931794if(current_ref && (current_ref->name == refname1795|| !strcmp(current_ref->name, refname))) {1796if(peel_entry(current_ref,0))1797return-1;1798hashcpy(sha1, current_ref->u.value.peeled);1799return0;1800}18011802if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1803return-1;18041805/*1806 * If the reference is packed, read its ref_entry from the1807 * cache in the hope that we already know its peeled value.1808 * We only try this optimization on packed references because1809 * (a) forcing the filling of the loose reference cache could1810 * be expensive and (b) loose references anyway usually do not1811 * have REF_KNOWS_PEELED.1812 */1813if(flag & REF_ISPACKED) {1814struct ref_entry *r =get_packed_ref(refname);1815if(r) {1816if(peel_entry(r,0))1817return-1;1818hashcpy(sha1, r->u.value.peeled);1819return0;1820}1821}18221823returnpeel_object(base, sha1);1824}18251826struct warn_if_dangling_data {1827FILE*fp;1828const char*refname;1829const struct string_list *refnames;1830const char*msg_fmt;1831};18321833static intwarn_if_dangling_symref(const char*refname,const unsigned char*sha1,1834int flags,void*cb_data)1835{1836struct warn_if_dangling_data *d = cb_data;1837const char*resolves_to;1838unsigned char junk[20];18391840if(!(flags & REF_ISSYMREF))1841return0;18421843 resolves_to =resolve_ref_unsafe(refname,0, junk, NULL);1844if(!resolves_to1845|| (d->refname1846?strcmp(resolves_to, d->refname)1847: !string_list_has_string(d->refnames, resolves_to))) {1848return0;1849}18501851fprintf(d->fp, d->msg_fmt, refname);1852fputc('\n', d->fp);1853return0;1854}18551856voidwarn_dangling_symref(FILE*fp,const char*msg_fmt,const char*refname)1857{1858struct warn_if_dangling_data data;18591860 data.fp = fp;1861 data.refname = refname;1862 data.refnames = NULL;1863 data.msg_fmt = msg_fmt;1864for_each_rawref(warn_if_dangling_symref, &data);1865}18661867voidwarn_dangling_symrefs(FILE*fp,const char*msg_fmt,const struct string_list *refnames)1868{1869struct warn_if_dangling_data data;18701871 data.fp = fp;1872 data.refname = NULL;1873 data.refnames = refnames;1874 data.msg_fmt = msg_fmt;1875for_each_rawref(warn_if_dangling_symref, &data);1876}18771878/*1879 * Call fn for each reference in the specified ref_cache, omitting1880 * references not in the containing_dir of base. fn is called for all1881 * references, including broken ones. If fn ever returns a non-zero1882 * value, stop the iteration and return that value; otherwise, return1883 * 0.1884 */1885static intdo_for_each_entry(struct ref_cache *refs,const char*base,1886 each_ref_entry_fn fn,void*cb_data)1887{1888struct packed_ref_cache *packed_ref_cache;1889struct ref_dir *loose_dir;1890struct ref_dir *packed_dir;1891int retval =0;18921893/*1894 * We must make sure that all loose refs are read before accessing the1895 * packed-refs file; this avoids a race condition in which loose refs1896 * are migrated to the packed-refs file by a simultaneous process, but1897 * our in-memory view is from before the migration. get_packed_ref_cache()1898 * takes care of making sure our view is up to date with what is on1899 * disk.1900 */1901 loose_dir =get_loose_refs(refs);1902if(base && *base) {1903 loose_dir =find_containing_dir(loose_dir, base,0);1904}1905if(loose_dir)1906prime_ref_dir(loose_dir);19071908 packed_ref_cache =get_packed_ref_cache(refs);1909acquire_packed_ref_cache(packed_ref_cache);1910 packed_dir =get_packed_ref_dir(packed_ref_cache);1911if(base && *base) {1912 packed_dir =find_containing_dir(packed_dir, base,0);1913}19141915if(packed_dir && loose_dir) {1916sort_ref_dir(packed_dir);1917sort_ref_dir(loose_dir);1918 retval =do_for_each_entry_in_dirs(1919 packed_dir, loose_dir, fn, cb_data);1920}else if(packed_dir) {1921sort_ref_dir(packed_dir);1922 retval =do_for_each_entry_in_dir(1923 packed_dir,0, fn, cb_data);1924}else if(loose_dir) {1925sort_ref_dir(loose_dir);1926 retval =do_for_each_entry_in_dir(1927 loose_dir,0, fn, cb_data);1928}19291930release_packed_ref_cache(packed_ref_cache);1931return retval;1932}19331934/*1935 * Call fn for each reference in the specified ref_cache for which the1936 * refname begins with base. If trim is non-zero, then trim that many1937 * characters off the beginning of each refname before passing the1938 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include1939 * broken references in the iteration. If fn ever returns a non-zero1940 * value, stop the iteration and return that value; otherwise, return1941 * 0.1942 */1943static intdo_for_each_ref(struct ref_cache *refs,const char*base,1944 each_ref_fn fn,int trim,int flags,void*cb_data)1945{1946struct ref_entry_cb data;1947 data.base = base;1948 data.trim = trim;1949 data.flags = flags;1950 data.fn = fn;1951 data.cb_data = cb_data;19521953if(ref_paranoia <0)1954 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);1955if(ref_paranoia)1956 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;19571958returndo_for_each_entry(refs, base, do_one_ref, &data);1959}19601961static intdo_head_ref(const char*submodule, each_ref_fn fn,void*cb_data)1962{1963unsigned char sha1[20];1964int flag;19651966if(submodule) {1967if(resolve_gitlink_ref(submodule,"HEAD", sha1) ==0)1968returnfn("HEAD", sha1,0, cb_data);19691970return0;1971}19721973if(!read_ref_full("HEAD", RESOLVE_REF_READING, sha1, &flag))1974returnfn("HEAD", sha1, flag, cb_data);19751976return0;1977}19781979inthead_ref(each_ref_fn fn,void*cb_data)1980{1981returndo_head_ref(NULL, fn, cb_data);1982}19831984inthead_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)1985{1986returndo_head_ref(submodule, fn, cb_data);1987}19881989intfor_each_ref(each_ref_fn fn,void*cb_data)1990{1991returndo_for_each_ref(&ref_cache,"", fn,0,0, cb_data);1992}19931994intfor_each_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)1995{1996returndo_for_each_ref(get_ref_cache(submodule),"", fn,0,0, cb_data);1997}19981999intfor_each_ref_in(const char*prefix, each_ref_fn fn,void*cb_data)2000{2001returndo_for_each_ref(&ref_cache, prefix, fn,strlen(prefix),0, cb_data);2002}20032004intfor_each_ref_in_submodule(const char*submodule,const char*prefix,2005 each_ref_fn fn,void*cb_data)2006{2007returndo_for_each_ref(get_ref_cache(submodule), prefix, fn,strlen(prefix),0, cb_data);2008}20092010intfor_each_tag_ref(each_ref_fn fn,void*cb_data)2011{2012returnfor_each_ref_in("refs/tags/", fn, cb_data);2013}20142015intfor_each_tag_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2016{2017returnfor_each_ref_in_submodule(submodule,"refs/tags/", fn, cb_data);2018}20192020intfor_each_branch_ref(each_ref_fn fn,void*cb_data)2021{2022returnfor_each_ref_in("refs/heads/", fn, cb_data);2023}20242025intfor_each_branch_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2026{2027returnfor_each_ref_in_submodule(submodule,"refs/heads/", fn, cb_data);2028}20292030intfor_each_remote_ref(each_ref_fn fn,void*cb_data)2031{2032returnfor_each_ref_in("refs/remotes/", fn, cb_data);2033}20342035intfor_each_remote_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2036{2037returnfor_each_ref_in_submodule(submodule,"refs/remotes/", fn, cb_data);2038}20392040intfor_each_replace_ref(each_ref_fn fn,void*cb_data)2041{2042returndo_for_each_ref(&ref_cache,"refs/replace/", fn,13,0, cb_data);2043}20442045inthead_ref_namespaced(each_ref_fn fn,void*cb_data)2046{2047struct strbuf buf = STRBUF_INIT;2048int ret =0;2049unsigned char sha1[20];2050int flag;20512052strbuf_addf(&buf,"%sHEAD",get_git_namespace());2053if(!read_ref_full(buf.buf, RESOLVE_REF_READING, sha1, &flag))2054 ret =fn(buf.buf, sha1, flag, cb_data);2055strbuf_release(&buf);20562057return ret;2058}20592060intfor_each_namespaced_ref(each_ref_fn fn,void*cb_data)2061{2062struct strbuf buf = STRBUF_INIT;2063int ret;2064strbuf_addf(&buf,"%srefs/",get_git_namespace());2065 ret =do_for_each_ref(&ref_cache, buf.buf, fn,0,0, cb_data);2066strbuf_release(&buf);2067return ret;2068}20692070intfor_each_glob_ref_in(each_ref_fn fn,const char*pattern,2071const char*prefix,void*cb_data)2072{2073struct strbuf real_pattern = STRBUF_INIT;2074struct ref_filter filter;2075int ret;20762077if(!prefix && !starts_with(pattern,"refs/"))2078strbuf_addstr(&real_pattern,"refs/");2079else if(prefix)2080strbuf_addstr(&real_pattern, prefix);2081strbuf_addstr(&real_pattern, pattern);20822083if(!has_glob_specials(pattern)) {2084/* Append implied '/' '*' if not present. */2085if(real_pattern.buf[real_pattern.len -1] !='/')2086strbuf_addch(&real_pattern,'/');2087/* No need to check for '*', there is none. */2088strbuf_addch(&real_pattern,'*');2089}20902091 filter.pattern = real_pattern.buf;2092 filter.fn = fn;2093 filter.cb_data = cb_data;2094 ret =for_each_ref(filter_refs, &filter);20952096strbuf_release(&real_pattern);2097return ret;2098}20992100intfor_each_glob_ref(each_ref_fn fn,const char*pattern,void*cb_data)2101{2102returnfor_each_glob_ref_in(fn, pattern, NULL, cb_data);2103}21042105intfor_each_rawref(each_ref_fn fn,void*cb_data)2106{2107returndo_for_each_ref(&ref_cache,"", fn,0,2108 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);2109}21102111const char*prettify_refname(const char*name)2112{2113return name + (2114starts_with(name,"refs/heads/") ?11:2115starts_with(name,"refs/tags/") ?10:2116starts_with(name,"refs/remotes/") ?13:21170);2118}21192120static const char*ref_rev_parse_rules[] = {2121"%.*s",2122"refs/%.*s",2123"refs/tags/%.*s",2124"refs/heads/%.*s",2125"refs/remotes/%.*s",2126"refs/remotes/%.*s/HEAD",2127 NULL2128};21292130intrefname_match(const char*abbrev_name,const char*full_name)2131{2132const char**p;2133const int abbrev_name_len =strlen(abbrev_name);21342135for(p = ref_rev_parse_rules; *p; p++) {2136if(!strcmp(full_name,mkpath(*p, abbrev_name_len, abbrev_name))) {2137return1;2138}2139}21402141return0;2142}21432144static voidunlock_ref(struct ref_lock *lock)2145{2146/* Do not free lock->lk -- atexit() still looks at them */2147if(lock->lk)2148rollback_lock_file(lock->lk);2149free(lock->ref_name);2150free(lock->orig_ref_name);2151free(lock);2152}21532154/* This function should make sure errno is meaningful on error */2155static struct ref_lock *verify_lock(struct ref_lock *lock,2156const unsigned char*old_sha1,int mustexist)2157{2158if(read_ref_full(lock->ref_name,2159 mustexist ? RESOLVE_REF_READING :0,2160 lock->old_sha1, NULL)) {2161int save_errno = errno;2162error("Can't verify ref%s", lock->ref_name);2163unlock_ref(lock);2164 errno = save_errno;2165return NULL;2166}2167if(hashcmp(lock->old_sha1, old_sha1)) {2168error("Ref%sis at%sbut expected%s", lock->ref_name,2169sha1_to_hex(lock->old_sha1),sha1_to_hex(old_sha1));2170unlock_ref(lock);2171 errno = EBUSY;2172return NULL;2173}2174return lock;2175}21762177static intremove_empty_directories(const char*file)2178{2179/* we want to create a file but there is a directory there;2180 * if that is an empty directory (or a directory that contains2181 * only empty directories), remove them.2182 */2183struct strbuf path;2184int result, save_errno;21852186strbuf_init(&path,20);2187strbuf_addstr(&path, file);21882189 result =remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);2190 save_errno = errno;21912192strbuf_release(&path);2193 errno = save_errno;21942195return result;2196}21972198/*2199 * *string and *len will only be substituted, and *string returned (for2200 * later free()ing) if the string passed in is a magic short-hand form2201 * to name a branch.2202 */2203static char*substitute_branch_name(const char**string,int*len)2204{2205struct strbuf buf = STRBUF_INIT;2206int ret =interpret_branch_name(*string, *len, &buf);22072208if(ret == *len) {2209size_t size;2210*string =strbuf_detach(&buf, &size);2211*len = size;2212return(char*)*string;2213}22142215return NULL;2216}22172218intdwim_ref(const char*str,int len,unsigned char*sha1,char**ref)2219{2220char*last_branch =substitute_branch_name(&str, &len);2221const char**p, *r;2222int refs_found =0;22232224*ref = NULL;2225for(p = ref_rev_parse_rules; *p; p++) {2226char fullref[PATH_MAX];2227unsigned char sha1_from_ref[20];2228unsigned char*this_result;2229int flag;22302231 this_result = refs_found ? sha1_from_ref : sha1;2232mksnpath(fullref,sizeof(fullref), *p, len, str);2233 r =resolve_ref_unsafe(fullref, RESOLVE_REF_READING,2234 this_result, &flag);2235if(r) {2236if(!refs_found++)2237*ref =xstrdup(r);2238if(!warn_ambiguous_refs)2239break;2240}else if((flag & REF_ISSYMREF) &&strcmp(fullref,"HEAD")) {2241warning("ignoring dangling symref%s.", fullref);2242}else if((flag & REF_ISBROKEN) &&strchr(fullref,'/')) {2243warning("ignoring broken ref%s.", fullref);2244}2245}2246free(last_branch);2247return refs_found;2248}22492250intdwim_log(const char*str,int len,unsigned char*sha1,char**log)2251{2252char*last_branch =substitute_branch_name(&str, &len);2253const char**p;2254int logs_found =0;22552256*log = NULL;2257for(p = ref_rev_parse_rules; *p; p++) {2258unsigned char hash[20];2259char path[PATH_MAX];2260const char*ref, *it;22612262mksnpath(path,sizeof(path), *p, len, str);2263 ref =resolve_ref_unsafe(path, RESOLVE_REF_READING,2264 hash, NULL);2265if(!ref)2266continue;2267if(reflog_exists(path))2268 it = path;2269else if(strcmp(ref, path) &&reflog_exists(ref))2270 it = ref;2271else2272continue;2273if(!logs_found++) {2274*log =xstrdup(it);2275hashcpy(sha1, hash);2276}2277if(!warn_ambiguous_refs)2278break;2279}2280free(last_branch);2281return logs_found;2282}22832284/*2285 * Locks a ref returning the lock on success and NULL on failure.2286 * On failure errno is set to something meaningful.2287 */2288static struct ref_lock *lock_ref_sha1_basic(const char*refname,2289const unsigned char*old_sha1,2290const struct string_list *skip,2291unsigned int flags,int*type_p)2292{2293const char*ref_file;2294const char*orig_refname = refname;2295struct ref_lock *lock;2296int last_errno =0;2297int type, lflags;2298int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2299int resolve_flags =0;2300int attempts_remaining =3;23012302 lock =xcalloc(1,sizeof(struct ref_lock));2303 lock->lock_fd = -1;23042305if(mustexist)2306 resolve_flags |= RESOLVE_REF_READING;2307if(flags & REF_DELETING) {2308 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;2309if(flags & REF_NODEREF)2310 resolve_flags |= RESOLVE_REF_NO_RECURSE;2311}23122313 refname =resolve_ref_unsafe(refname, resolve_flags,2314 lock->old_sha1, &type);2315if(!refname && errno == EISDIR) {2316/* we are trying to lock foo but we used to2317 * have foo/bar which now does not exist;2318 * it is normal for the empty directory 'foo'2319 * to remain.2320 */2321 ref_file =git_path("%s", orig_refname);2322if(remove_empty_directories(ref_file)) {2323 last_errno = errno;2324error("there are still refs under '%s'", orig_refname);2325goto error_return;2326}2327 refname =resolve_ref_unsafe(orig_refname, resolve_flags,2328 lock->old_sha1, &type);2329}2330if(type_p)2331*type_p = type;2332if(!refname) {2333 last_errno = errno;2334error("unable to resolve reference%s:%s",2335 orig_refname,strerror(errno));2336goto error_return;2337}2338/*2339 * If the ref did not exist and we are creating it, make sure2340 * there is no existing packed ref whose name begins with our2341 * refname, nor a packed ref whose name is a proper prefix of2342 * our refname.2343 */2344if(is_null_sha1(lock->old_sha1) &&2345!is_refname_available(refname, skip,get_packed_refs(&ref_cache))) {2346 last_errno = ENOTDIR;2347goto error_return;2348}23492350 lock->lk =xcalloc(1,sizeof(struct lock_file));23512352 lflags =0;2353if(flags & REF_NODEREF) {2354 refname = orig_refname;2355 lflags |= LOCK_NO_DEREF;2356}2357 lock->ref_name =xstrdup(refname);2358 lock->orig_ref_name =xstrdup(orig_refname);2359 ref_file =git_path("%s", refname);23602361 retry:2362switch(safe_create_leading_directories_const(ref_file)) {2363case SCLD_OK:2364break;/* success */2365case SCLD_VANISHED:2366if(--attempts_remaining >0)2367goto retry;2368/* fall through */2369default:2370 last_errno = errno;2371error("unable to create directory for%s", ref_file);2372goto error_return;2373}23742375 lock->lock_fd =hold_lock_file_for_update(lock->lk, ref_file, lflags);2376if(lock->lock_fd <0) {2377 last_errno = errno;2378if(errno == ENOENT && --attempts_remaining >0)2379/*2380 * Maybe somebody just deleted one of the2381 * directories leading to ref_file. Try2382 * again:2383 */2384goto retry;2385else{2386struct strbuf err = STRBUF_INIT;2387unable_to_lock_message(ref_file, errno, &err);2388error("%s", err.buf);2389strbuf_release(&err);2390goto error_return;2391}2392}2393return old_sha1 ?verify_lock(lock, old_sha1, mustexist) : lock;23942395 error_return:2396unlock_ref(lock);2397 errno = last_errno;2398return NULL;2399}24002401/*2402 * Write an entry to the packed-refs file for the specified refname.2403 * If peeled is non-NULL, write it as the entry's peeled value.2404 */2405static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2406unsigned char*peeled)2407{2408fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2409if(peeled)2410fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2411}24122413/*2414 * An each_ref_entry_fn that writes the entry to a packed-refs file.2415 */2416static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2417{2418enum peel_status peel_status =peel_entry(entry,0);24192420if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2421error("internal error:%sis not a valid packed reference!",2422 entry->name);2423write_packed_entry(cb_data, entry->name, entry->u.value.sha1,2424 peel_status == PEEL_PEELED ?2425 entry->u.value.peeled : NULL);2426return0;2427}24282429/* This should return a meaningful errno on failure */2430intlock_packed_refs(int flags)2431{2432struct packed_ref_cache *packed_ref_cache;24332434if(hold_lock_file_for_update(&packlock,git_path("packed-refs"), flags) <0)2435return-1;2436/*2437 * Get the current packed-refs while holding the lock. If the2438 * packed-refs file has been modified since we last read it,2439 * this will automatically invalidate the cache and re-read2440 * the packed-refs file.2441 */2442 packed_ref_cache =get_packed_ref_cache(&ref_cache);2443 packed_ref_cache->lock = &packlock;2444/* Increment the reference count to prevent it from being freed: */2445acquire_packed_ref_cache(packed_ref_cache);2446return0;2447}24482449/*2450 * Commit the packed refs changes.2451 * On error we must make sure that errno contains a meaningful value.2452 */2453intcommit_packed_refs(void)2454{2455struct packed_ref_cache *packed_ref_cache =2456get_packed_ref_cache(&ref_cache);2457int error =0;2458int save_errno =0;2459FILE*out;24602461if(!packed_ref_cache->lock)2462die("internal error: packed-refs not locked");24632464 out =fdopen_lock_file(packed_ref_cache->lock,"w");2465if(!out)2466die_errno("unable to fdopen packed-refs descriptor");24672468fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2469do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),24700, write_packed_entry_fn, out);24712472if(commit_lock_file(packed_ref_cache->lock)) {2473 save_errno = errno;2474 error = -1;2475}2476 packed_ref_cache->lock = NULL;2477release_packed_ref_cache(packed_ref_cache);2478 errno = save_errno;2479return error;2480}24812482voidrollback_packed_refs(void)2483{2484struct packed_ref_cache *packed_ref_cache =2485get_packed_ref_cache(&ref_cache);24862487if(!packed_ref_cache->lock)2488die("internal error: packed-refs not locked");2489rollback_lock_file(packed_ref_cache->lock);2490 packed_ref_cache->lock = NULL;2491release_packed_ref_cache(packed_ref_cache);2492clear_packed_ref_cache(&ref_cache);2493}24942495struct ref_to_prune {2496struct ref_to_prune *next;2497unsigned char sha1[20];2498char name[FLEX_ARRAY];2499};25002501struct pack_refs_cb_data {2502unsigned int flags;2503struct ref_dir *packed_refs;2504struct ref_to_prune *ref_to_prune;2505};25062507/*2508 * An each_ref_entry_fn that is run over loose references only. If2509 * the loose reference can be packed, add an entry in the packed ref2510 * cache. If the reference should be pruned, also add it to2511 * ref_to_prune in the pack_refs_cb_data.2512 */2513static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2514{2515struct pack_refs_cb_data *cb = cb_data;2516enum peel_status peel_status;2517struct ref_entry *packed_entry;2518int is_tag_ref =starts_with(entry->name,"refs/tags/");25192520/* ALWAYS pack tags */2521if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2522return0;25232524/* Do not pack symbolic or broken refs: */2525if((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2526return0;25272528/* Add a packed ref cache entry equivalent to the loose entry. */2529 peel_status =peel_entry(entry,1);2530if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2531die("internal error peeling reference%s(%s)",2532 entry->name,sha1_to_hex(entry->u.value.sha1));2533 packed_entry =find_ref(cb->packed_refs, entry->name);2534if(packed_entry) {2535/* Overwrite existing packed entry with info from loose entry */2536 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2537hashcpy(packed_entry->u.value.sha1, entry->u.value.sha1);2538}else{2539 packed_entry =create_ref_entry(entry->name, entry->u.value.sha1,2540 REF_ISPACKED | REF_KNOWS_PEELED,0);2541add_ref(cb->packed_refs, packed_entry);2542}2543hashcpy(packed_entry->u.value.peeled, entry->u.value.peeled);25442545/* Schedule the loose reference for pruning if requested. */2546if((cb->flags & PACK_REFS_PRUNE)) {2547int namelen =strlen(entry->name) +1;2548struct ref_to_prune *n =xcalloc(1,sizeof(*n) + namelen);2549hashcpy(n->sha1, entry->u.value.sha1);2550strcpy(n->name, entry->name);2551 n->next = cb->ref_to_prune;2552 cb->ref_to_prune = n;2553}2554return0;2555}25562557/*2558 * Remove empty parents, but spare refs/ and immediate subdirs.2559 * Note: munges *name.2560 */2561static voidtry_remove_empty_parents(char*name)2562{2563char*p, *q;2564int i;2565 p = name;2566for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2567while(*p && *p !='/')2568 p++;2569/* tolerate duplicate slashes; see check_refname_format() */2570while(*p =='/')2571 p++;2572}2573for(q = p; *q; q++)2574;2575while(1) {2576while(q > p && *q !='/')2577 q--;2578while(q > p && *(q-1) =='/')2579 q--;2580if(q == p)2581break;2582*q ='\0';2583if(rmdir(git_path("%s", name)))2584break;2585}2586}25872588/* make sure nobody touched the ref, and unlink */2589static voidprune_ref(struct ref_to_prune *r)2590{2591struct ref_transaction *transaction;2592struct strbuf err = STRBUF_INIT;25932594if(check_refname_format(r->name,0))2595return;25962597 transaction =ref_transaction_begin(&err);2598if(!transaction ||2599ref_transaction_delete(transaction, r->name, r->sha1,2600 REF_ISPRUNING, NULL, &err) ||2601ref_transaction_commit(transaction, &err)) {2602ref_transaction_free(transaction);2603error("%s", err.buf);2604strbuf_release(&err);2605return;2606}2607ref_transaction_free(transaction);2608strbuf_release(&err);2609try_remove_empty_parents(r->name);2610}26112612static voidprune_refs(struct ref_to_prune *r)2613{2614while(r) {2615prune_ref(r);2616 r = r->next;2617}2618}26192620intpack_refs(unsigned int flags)2621{2622struct pack_refs_cb_data cbdata;26232624memset(&cbdata,0,sizeof(cbdata));2625 cbdata.flags = flags;26262627lock_packed_refs(LOCK_DIE_ON_ERROR);2628 cbdata.packed_refs =get_packed_refs(&ref_cache);26292630do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2631 pack_if_possible_fn, &cbdata);26322633if(commit_packed_refs())2634die_errno("unable to overwrite old ref-pack file");26352636prune_refs(cbdata.ref_to_prune);2637return0;2638}26392640intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2641{2642struct ref_dir *packed;2643struct string_list_item *refname;2644int ret, needs_repacking =0, removed =0;26452646assert(err);26472648/* Look for a packed ref */2649for_each_string_list_item(refname, refnames) {2650if(get_packed_ref(refname->string)) {2651 needs_repacking =1;2652break;2653}2654}26552656/* Avoid locking if we have nothing to do */2657if(!needs_repacking)2658return0;/* no refname exists in packed refs */26592660if(lock_packed_refs(0)) {2661unable_to_lock_message(git_path("packed-refs"), errno, err);2662return-1;2663}2664 packed =get_packed_refs(&ref_cache);26652666/* Remove refnames from the cache */2667for_each_string_list_item(refname, refnames)2668if(remove_entry(packed, refname->string) != -1)2669 removed =1;2670if(!removed) {2671/*2672 * All packed entries disappeared while we were2673 * acquiring the lock.2674 */2675rollback_packed_refs();2676return0;2677}26782679/* Write what remains */2680 ret =commit_packed_refs();2681if(ret)2682strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2683strerror(errno));2684return ret;2685}26862687static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2688{2689assert(err);26902691if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2692/*2693 * loose. The loose file name is the same as the2694 * lockfile name, minus ".lock":2695 */2696char*loose_filename =get_locked_file_path(lock->lk);2697int res =unlink_or_msg(loose_filename, err);2698free(loose_filename);2699if(res)2700return1;2701}2702return0;2703}27042705intdelete_ref(const char*refname,const unsigned char*sha1,unsigned int flags)2706{2707struct ref_transaction *transaction;2708struct strbuf err = STRBUF_INIT;27092710 transaction =ref_transaction_begin(&err);2711if(!transaction ||2712ref_transaction_delete(transaction, refname,2713(sha1 && !is_null_sha1(sha1)) ? sha1 : NULL,2714 flags, NULL, &err) ||2715ref_transaction_commit(transaction, &err)) {2716error("%s", err.buf);2717ref_transaction_free(transaction);2718strbuf_release(&err);2719return1;2720}2721ref_transaction_free(transaction);2722strbuf_release(&err);2723return0;2724}27252726/*2727 * People using contrib's git-new-workdir have .git/logs/refs ->2728 * /some/other/path/.git/logs/refs, and that may live on another device.2729 *2730 * IOW, to avoid cross device rename errors, the temporary renamed log must2731 * live into logs/refs.2732 */2733#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"27342735static intrename_tmp_log(const char*newrefname)2736{2737int attempts_remaining =4;27382739 retry:2740switch(safe_create_leading_directories_const(git_path("logs/%s", newrefname))) {2741case SCLD_OK:2742break;/* success */2743case SCLD_VANISHED:2744if(--attempts_remaining >0)2745goto retry;2746/* fall through */2747default:2748error("unable to create directory for%s", newrefname);2749return-1;2750}27512752if(rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", newrefname))) {2753if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2754/*2755 * rename(a, b) when b is an existing2756 * directory ought to result in ISDIR, but2757 * Solaris 5.8 gives ENOTDIR. Sheesh.2758 */2759if(remove_empty_directories(git_path("logs/%s", newrefname))) {2760error("Directory not empty: logs/%s", newrefname);2761return-1;2762}2763goto retry;2764}else if(errno == ENOENT && --attempts_remaining >0) {2765/*2766 * Maybe another process just deleted one of2767 * the directories in the path to newrefname.2768 * Try again from the beginning.2769 */2770goto retry;2771}else{2772error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2773 newrefname,strerror(errno));2774return-1;2775}2776}2777return0;2778}27792780static intrename_ref_available(const char*oldname,const char*newname)2781{2782struct string_list skip = STRING_LIST_INIT_NODUP;2783int ret;27842785string_list_insert(&skip, oldname);2786 ret =is_refname_available(newname, &skip,get_packed_refs(&ref_cache))2787&&is_refname_available(newname, &skip,get_loose_refs(&ref_cache));2788string_list_clear(&skip,0);2789return ret;2790}27912792static intwrite_ref_sha1(struct ref_lock *lock,const unsigned char*sha1,2793const char*logmsg);27942795intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2796{2797unsigned char sha1[20], orig_sha1[20];2798int flag =0, logmoved =0;2799struct ref_lock *lock;2800struct stat loginfo;2801int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2802const char*symref = NULL;28032804if(log &&S_ISLNK(loginfo.st_mode))2805returnerror("reflog for%sis a symlink", oldrefname);28062807 symref =resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,2808 orig_sha1, &flag);2809if(flag & REF_ISSYMREF)2810returnerror("refname%sis a symbolic ref, renaming it is not supported",2811 oldrefname);2812if(!symref)2813returnerror("refname%snot found", oldrefname);28142815if(!rename_ref_available(oldrefname, newrefname))2816return1;28172818if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2819returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2820 oldrefname,strerror(errno));28212822if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2823error("unable to delete old%s", oldrefname);2824goto rollback;2825}28262827if(!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&2828delete_ref(newrefname, sha1, REF_NODEREF)) {2829if(errno==EISDIR) {2830if(remove_empty_directories(git_path("%s", newrefname))) {2831error("Directory not empty:%s", newrefname);2832goto rollback;2833}2834}else{2835error("unable to delete existing%s", newrefname);2836goto rollback;2837}2838}28392840if(log &&rename_tmp_log(newrefname))2841goto rollback;28422843 logmoved = log;28442845 lock =lock_ref_sha1_basic(newrefname, NULL, NULL,0, NULL);2846if(!lock) {2847error("unable to lock%sfor update", newrefname);2848goto rollback;2849}2850hashcpy(lock->old_sha1, orig_sha1);2851if(write_ref_sha1(lock, orig_sha1, logmsg)) {2852error("unable to write current sha1 into%s", newrefname);2853goto rollback;2854}28552856return0;28572858 rollback:2859 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL,0, NULL);2860if(!lock) {2861error("unable to lock%sfor rollback", oldrefname);2862goto rollbacklog;2863}28642865 flag = log_all_ref_updates;2866 log_all_ref_updates =0;2867if(write_ref_sha1(lock, orig_sha1, NULL))2868error("unable to write current sha1 into%s", oldrefname);2869 log_all_ref_updates = flag;28702871 rollbacklog:2872if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))2873error("unable to restore logfile%sfrom%s:%s",2874 oldrefname, newrefname,strerror(errno));2875if(!logmoved && log &&2876rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))2877error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",2878 oldrefname,strerror(errno));28792880return1;2881}28822883static intclose_ref(struct ref_lock *lock)2884{2885if(close_lock_file(lock->lk))2886return-1;2887 lock->lock_fd = -1;2888return0;2889}28902891static intcommit_ref(struct ref_lock *lock)2892{2893if(commit_lock_file(lock->lk))2894return-1;2895 lock->lock_fd = -1;2896return0;2897}28982899/*2900 * copy the reflog message msg to buf, which has been allocated sufficiently2901 * large, while cleaning up the whitespaces. Especially, convert LF to space,2902 * because reflog file is one line per entry.2903 */2904static intcopy_msg(char*buf,const char*msg)2905{2906char*cp = buf;2907char c;2908int wasspace =1;29092910*cp++ ='\t';2911while((c = *msg++)) {2912if(wasspace &&isspace(c))2913continue;2914 wasspace =isspace(c);2915if(wasspace)2916 c =' ';2917*cp++ = c;2918}2919while(buf < cp &&isspace(cp[-1]))2920 cp--;2921*cp++ ='\n';2922return cp - buf;2923}29242925/* This function must set a meaningful errno on failure */2926intlog_ref_setup(const char*refname,struct strbuf *sb_logfile)2927{2928int logfd, oflags = O_APPEND | O_WRONLY;2929char*logfile;29302931strbuf_git_path(sb_logfile,"logs/%s", refname);2932 logfile = sb_logfile->buf;2933/* make sure the rest of the function can't change "logfile" */2934 sb_logfile = NULL;2935if(log_all_ref_updates &&2936(starts_with(refname,"refs/heads/") ||2937starts_with(refname,"refs/remotes/") ||2938starts_with(refname,"refs/notes/") ||2939!strcmp(refname,"HEAD"))) {2940if(safe_create_leading_directories(logfile) <0) {2941int save_errno = errno;2942error("unable to create directory for%s", logfile);2943 errno = save_errno;2944return-1;2945}2946 oflags |= O_CREAT;2947}29482949 logfd =open(logfile, oflags,0666);2950if(logfd <0) {2951if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2952return0;29532954if(errno == EISDIR) {2955if(remove_empty_directories(logfile)) {2956int save_errno = errno;2957error("There are still logs under '%s'",2958 logfile);2959 errno = save_errno;2960return-1;2961}2962 logfd =open(logfile, oflags,0666);2963}29642965if(logfd <0) {2966int save_errno = errno;2967error("Unable to append to%s:%s", logfile,2968strerror(errno));2969 errno = save_errno;2970return-1;2971}2972}29732974adjust_shared_perm(logfile);2975close(logfd);2976return0;2977}29782979static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,2980const unsigned char*new_sha1,2981const char*committer,const char*msg)2982{2983int msglen, written;2984unsigned maxlen, len;2985char*logrec;29862987 msglen = msg ?strlen(msg) :0;2988 maxlen =strlen(committer) + msglen +100;2989 logrec =xmalloc(maxlen);2990 len =sprintf(logrec,"%s %s %s\n",2991sha1_to_hex(old_sha1),2992sha1_to_hex(new_sha1),2993 committer);2994if(msglen)2995 len +=copy_msg(logrec + len -1, msg) -1;29962997 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;2998free(logrec);2999if(written != len)3000return-1;30013002return0;3003}30043005static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,3006const unsigned char*new_sha1,const char*msg,3007struct strbuf *sb_log_file)3008{3009int logfd, result, oflags = O_APPEND | O_WRONLY;3010char*log_file;30113012if(log_all_ref_updates <0)3013 log_all_ref_updates = !is_bare_repository();30143015 result =log_ref_setup(refname, sb_log_file);3016if(result)3017return result;3018 log_file = sb_log_file->buf;3019/* make sure the rest of the function can't change "log_file" */3020 sb_log_file = NULL;30213022 logfd =open(log_file, oflags);3023if(logfd <0)3024return0;3025 result =log_ref_write_fd(logfd, old_sha1, new_sha1,3026git_committer_info(0), msg);3027if(result) {3028int save_errno = errno;3029close(logfd);3030error("Unable to append to%s", log_file);3031 errno = save_errno;3032return-1;3033}3034if(close(logfd)) {3035int save_errno = errno;3036error("Unable to append to%s", log_file);3037 errno = save_errno;3038return-1;3039}3040return0;3041}30423043static intlog_ref_write(const char*refname,const unsigned char*old_sha1,3044const unsigned char*new_sha1,const char*msg)3045{3046struct strbuf sb = STRBUF_INIT;3047int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb);3048strbuf_release(&sb);3049return ret;3050}30513052intis_branch(const char*refname)3053{3054return!strcmp(refname,"HEAD") ||starts_with(refname,"refs/heads/");3055}30563057/*3058 * Write sha1 into the ref specified by the lock. Make sure that errno3059 * is sane on error.3060 */3061static intwrite_ref_sha1(struct ref_lock *lock,3062const unsigned char*sha1,const char*logmsg)3063{3064static char term ='\n';3065struct object *o;30663067 o =parse_object(sha1);3068if(!o) {3069error("Trying to write ref%swith nonexistent object%s",3070 lock->ref_name,sha1_to_hex(sha1));3071unlock_ref(lock);3072 errno = EINVAL;3073return-1;3074}3075if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {3076error("Trying to write non-commit object%sto branch%s",3077sha1_to_hex(sha1), lock->ref_name);3078unlock_ref(lock);3079 errno = EINVAL;3080return-1;3081}3082if(write_in_full(lock->lock_fd,sha1_to_hex(sha1),40) !=40||3083write_in_full(lock->lock_fd, &term,1) !=1||3084close_ref(lock) <0) {3085int save_errno = errno;3086error("Couldn't write%s", lock->lk->filename.buf);3087unlock_ref(lock);3088 errno = save_errno;3089return-1;3090}3091clear_loose_ref_cache(&ref_cache);3092if(log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) <0||3093(strcmp(lock->ref_name, lock->orig_ref_name) &&3094log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) <0)) {3095unlock_ref(lock);3096return-1;3097}3098if(strcmp(lock->orig_ref_name,"HEAD") !=0) {3099/*3100 * Special hack: If a branch is updated directly and HEAD3101 * points to it (may happen on the remote side of a push3102 * for example) then logically the HEAD reflog should be3103 * updated too.3104 * A generic solution implies reverse symref information,3105 * but finding all symrefs pointing to the given branch3106 * would be rather costly for this rare event (the direct3107 * update of a branch) to be worth it. So let's cheat and3108 * check with HEAD only which should cover 99% of all usage3109 * scenarios (even 100% of the default ones).3110 */3111unsigned char head_sha1[20];3112int head_flag;3113const char*head_ref;3114 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3115 head_sha1, &head_flag);3116if(head_ref && (head_flag & REF_ISSYMREF) &&3117!strcmp(head_ref, lock->ref_name))3118log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);3119}3120if(commit_ref(lock)) {3121error("Couldn't set%s", lock->ref_name);3122unlock_ref(lock);3123return-1;3124}3125unlock_ref(lock);3126return0;3127}31283129intcreate_symref(const char*ref_target,const char*refs_heads_master,3130const char*logmsg)3131{3132const char*lockpath;3133char ref[1000];3134int fd, len, written;3135char*git_HEAD =git_pathdup("%s", ref_target);3136unsigned char old_sha1[20], new_sha1[20];31373138if(logmsg &&read_ref(ref_target, old_sha1))3139hashclr(old_sha1);31403141if(safe_create_leading_directories(git_HEAD) <0)3142returnerror("unable to create directory for%s", git_HEAD);31433144#ifndef NO_SYMLINK_HEAD3145if(prefer_symlink_refs) {3146unlink(git_HEAD);3147if(!symlink(refs_heads_master, git_HEAD))3148goto done;3149fprintf(stderr,"no symlink - falling back to symbolic ref\n");3150}3151#endif31523153 len =snprintf(ref,sizeof(ref),"ref:%s\n", refs_heads_master);3154if(sizeof(ref) <= len) {3155error("refname too long:%s", refs_heads_master);3156goto error_free_return;3157}3158 lockpath =mkpath("%s.lock", git_HEAD);3159 fd =open(lockpath, O_CREAT | O_EXCL | O_WRONLY,0666);3160if(fd <0) {3161error("Unable to open%sfor writing", lockpath);3162goto error_free_return;3163}3164 written =write_in_full(fd, ref, len);3165if(close(fd) !=0|| written != len) {3166error("Unable to write to%s", lockpath);3167goto error_unlink_return;3168}3169if(rename(lockpath, git_HEAD) <0) {3170error("Unable to create%s", git_HEAD);3171goto error_unlink_return;3172}3173if(adjust_shared_perm(git_HEAD)) {3174error("Unable to fix permissions on%s", lockpath);3175 error_unlink_return:3176unlink_or_warn(lockpath);3177 error_free_return:3178free(git_HEAD);3179return-1;3180}31813182#ifndef NO_SYMLINK_HEAD3183 done:3184#endif3185if(logmsg && !read_ref(refs_heads_master, new_sha1))3186log_ref_write(ref_target, old_sha1, new_sha1, logmsg);31873188free(git_HEAD);3189return0;3190}31913192struct read_ref_at_cb {3193const char*refname;3194unsigned long at_time;3195int cnt;3196int reccnt;3197unsigned char*sha1;3198int found_it;31993200unsigned char osha1[20];3201unsigned char nsha1[20];3202int tz;3203unsigned long date;3204char**msg;3205unsigned long*cutoff_time;3206int*cutoff_tz;3207int*cutoff_cnt;3208};32093210static intread_ref_at_ent(unsigned char*osha1,unsigned char*nsha1,3211const char*email,unsigned long timestamp,int tz,3212const char*message,void*cb_data)3213{3214struct read_ref_at_cb *cb = cb_data;32153216 cb->reccnt++;3217 cb->tz = tz;3218 cb->date = timestamp;32193220if(timestamp <= cb->at_time || cb->cnt ==0) {3221if(cb->msg)3222*cb->msg =xstrdup(message);3223if(cb->cutoff_time)3224*cb->cutoff_time = timestamp;3225if(cb->cutoff_tz)3226*cb->cutoff_tz = tz;3227if(cb->cutoff_cnt)3228*cb->cutoff_cnt = cb->reccnt -1;3229/*3230 * we have not yet updated cb->[n|o]sha1 so they still3231 * hold the values for the previous record.3232 */3233if(!is_null_sha1(cb->osha1)) {3234hashcpy(cb->sha1, nsha1);3235if(hashcmp(cb->osha1, nsha1))3236warning("Log for ref%shas gap after%s.",3237 cb->refname,show_date(cb->date, cb->tz, DATE_RFC2822));3238}3239else if(cb->date == cb->at_time)3240hashcpy(cb->sha1, nsha1);3241else if(hashcmp(nsha1, cb->sha1))3242warning("Log for ref%sunexpectedly ended on%s.",3243 cb->refname,show_date(cb->date, cb->tz,3244 DATE_RFC2822));3245hashcpy(cb->osha1, osha1);3246hashcpy(cb->nsha1, nsha1);3247 cb->found_it =1;3248return1;3249}3250hashcpy(cb->osha1, osha1);3251hashcpy(cb->nsha1, nsha1);3252if(cb->cnt >0)3253 cb->cnt--;3254return0;3255}32563257static intread_ref_at_ent_oldest(unsigned char*osha1,unsigned char*nsha1,3258const char*email,unsigned long timestamp,3259int tz,const char*message,void*cb_data)3260{3261struct read_ref_at_cb *cb = cb_data;32623263if(cb->msg)3264*cb->msg =xstrdup(message);3265if(cb->cutoff_time)3266*cb->cutoff_time = timestamp;3267if(cb->cutoff_tz)3268*cb->cutoff_tz = tz;3269if(cb->cutoff_cnt)3270*cb->cutoff_cnt = cb->reccnt;3271hashcpy(cb->sha1, osha1);3272if(is_null_sha1(cb->sha1))3273hashcpy(cb->sha1, nsha1);3274/* We just want the first entry */3275return1;3276}32773278intread_ref_at(const char*refname,unsigned int flags,unsigned long at_time,int cnt,3279unsigned char*sha1,char**msg,3280unsigned long*cutoff_time,int*cutoff_tz,int*cutoff_cnt)3281{3282struct read_ref_at_cb cb;32833284memset(&cb,0,sizeof(cb));3285 cb.refname = refname;3286 cb.at_time = at_time;3287 cb.cnt = cnt;3288 cb.msg = msg;3289 cb.cutoff_time = cutoff_time;3290 cb.cutoff_tz = cutoff_tz;3291 cb.cutoff_cnt = cutoff_cnt;3292 cb.sha1 = sha1;32933294for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);32953296if(!cb.reccnt) {3297if(flags & GET_SHA1_QUIETLY)3298exit(128);3299else3300die("Log for%sis empty.", refname);3301}3302if(cb.found_it)3303return0;33043305for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);33063307return1;3308}33093310intreflog_exists(const char*refname)3311{3312struct stat st;33133314return!lstat(git_path("logs/%s", refname), &st) &&3315S_ISREG(st.st_mode);3316}33173318intdelete_reflog(const char*refname)3319{3320returnremove_path(git_path("logs/%s", refname));3321}33223323static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3324{3325unsigned char osha1[20], nsha1[20];3326char*email_end, *message;3327unsigned long timestamp;3328int tz;33293330/* old SP new SP name <email> SP time TAB msg LF */3331if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3332get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3333get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3334!(email_end =strchr(sb->buf +82,'>')) ||3335 email_end[1] !=' '||3336!(timestamp =strtoul(email_end +2, &message,10)) ||3337!message || message[0] !=' '||3338(message[1] !='+'&& message[1] !='-') ||3339!isdigit(message[2]) || !isdigit(message[3]) ||3340!isdigit(message[4]) || !isdigit(message[5]))3341return0;/* corrupt? */3342 email_end[1] ='\0';3343 tz =strtol(message +1, NULL,10);3344if(message[6] !='\t')3345 message +=6;3346else3347 message +=7;3348returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3349}33503351static char*find_beginning_of_line(char*bob,char*scan)3352{3353while(bob < scan && *(--scan) !='\n')3354;/* keep scanning backwards */3355/*3356 * Return either beginning of the buffer, or LF at the end of3357 * the previous line.3358 */3359return scan;3360}33613362intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)3363{3364struct strbuf sb = STRBUF_INIT;3365FILE*logfp;3366long pos;3367int ret =0, at_tail =1;33683369 logfp =fopen(git_path("logs/%s", refname),"r");3370if(!logfp)3371return-1;33723373/* Jump to the end */3374if(fseek(logfp,0, SEEK_END) <0)3375returnerror("cannot seek back reflog for%s:%s",3376 refname,strerror(errno));3377 pos =ftell(logfp);3378while(!ret &&0< pos) {3379int cnt;3380size_t nread;3381char buf[BUFSIZ];3382char*endp, *scanp;33833384/* Fill next block from the end */3385 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3386if(fseek(logfp, pos - cnt, SEEK_SET))3387returnerror("cannot seek back reflog for%s:%s",3388 refname,strerror(errno));3389 nread =fread(buf, cnt,1, logfp);3390if(nread !=1)3391returnerror("cannot read%dbytes from reflog for%s:%s",3392 cnt, refname,strerror(errno));3393 pos -= cnt;33943395 scanp = endp = buf + cnt;3396if(at_tail && scanp[-1] =='\n')3397/* Looking at the final LF at the end of the file */3398 scanp--;3399 at_tail =0;34003401while(buf < scanp) {3402/*3403 * terminating LF of the previous line, or the beginning3404 * of the buffer.3405 */3406char*bp;34073408 bp =find_beginning_of_line(buf, scanp);34093410if(*bp =='\n') {3411/*3412 * The newline is the end of the previous line,3413 * so we know we have complete line starting3414 * at (bp + 1). Prefix it onto any prior data3415 * we collected for the line and process it.3416 */3417strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3418 scanp = bp;3419 endp = bp +1;3420 ret =show_one_reflog_ent(&sb, fn, cb_data);3421strbuf_reset(&sb);3422if(ret)3423break;3424}else if(!pos) {3425/*3426 * We are at the start of the buffer, and the3427 * start of the file; there is no previous3428 * line, and we have everything for this one.3429 * Process it, and we can end the loop.3430 */3431strbuf_splice(&sb,0,0, buf, endp - buf);3432 ret =show_one_reflog_ent(&sb, fn, cb_data);3433strbuf_reset(&sb);3434break;3435}34363437if(bp == buf) {3438/*3439 * We are at the start of the buffer, and there3440 * is more file to read backwards. Which means3441 * we are in the middle of a line. Note that we3442 * may get here even if *bp was a newline; that3443 * just means we are at the exact end of the3444 * previous line, rather than some spot in the3445 * middle.3446 *3447 * Save away what we have to be combined with3448 * the data from the next read.3449 */3450strbuf_splice(&sb,0,0, buf, endp - buf);3451break;3452}3453}34543455}3456if(!ret && sb.len)3457die("BUG: reverse reflog parser had leftover data");34583459fclose(logfp);3460strbuf_release(&sb);3461return ret;3462}34633464intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3465{3466FILE*logfp;3467struct strbuf sb = STRBUF_INIT;3468int ret =0;34693470 logfp =fopen(git_path("logs/%s", refname),"r");3471if(!logfp)3472return-1;34733474while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3475 ret =show_one_reflog_ent(&sb, fn, cb_data);3476fclose(logfp);3477strbuf_release(&sb);3478return ret;3479}3480/*3481 * Call fn for each reflog in the namespace indicated by name. name3482 * must be empty or end with '/'. Name will be used as a scratch3483 * space, but its contents will be restored before return.3484 */3485static intdo_for_each_reflog(struct strbuf *name, each_ref_fn fn,void*cb_data)3486{3487DIR*d =opendir(git_path("logs/%s", name->buf));3488int retval =0;3489struct dirent *de;3490int oldlen = name->len;34913492if(!d)3493return name->len ? errno :0;34943495while((de =readdir(d)) != NULL) {3496struct stat st;34973498if(de->d_name[0] =='.')3499continue;3500if(ends_with(de->d_name,".lock"))3501continue;3502strbuf_addstr(name, de->d_name);3503if(stat(git_path("logs/%s", name->buf), &st) <0) {3504;/* silently ignore */3505}else{3506if(S_ISDIR(st.st_mode)) {3507strbuf_addch(name,'/');3508 retval =do_for_each_reflog(name, fn, cb_data);3509}else{3510unsigned char sha1[20];3511if(read_ref_full(name->buf,0, sha1, NULL))3512 retval =error("bad ref for%s", name->buf);3513else3514 retval =fn(name->buf, sha1,0, cb_data);3515}3516if(retval)3517break;3518}3519strbuf_setlen(name, oldlen);3520}3521closedir(d);3522return retval;3523}35243525intfor_each_reflog(each_ref_fn fn,void*cb_data)3526{3527int retval;3528struct strbuf name;3529strbuf_init(&name, PATH_MAX);3530 retval =do_for_each_reflog(&name, fn, cb_data);3531strbuf_release(&name);3532return retval;3533}35343535/**3536 * Information needed for a single ref update. Set new_sha1 to the new3537 * value or to null_sha1 to delete the ref. To check the old value3538 * while the ref is locked, set (flags & REF_HAVE_OLD) and set3539 * old_sha1 to the old value, or to null_sha1 to ensure the ref does3540 * not exist before update.3541 */3542struct ref_update {3543/*3544 * If (flags & REF_HAVE_NEW), set the reference to this value:3545 */3546unsigned char new_sha1[20];3547/*3548 * If (flags & REF_HAVE_OLD), check that the reference3549 * previously had this value:3550 */3551unsigned char old_sha1[20];3552/*3553 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,3554 * REF_DELETING, and REF_ISPRUNING:3555 */3556unsigned int flags;3557struct ref_lock *lock;3558int type;3559char*msg;3560const char refname[FLEX_ARRAY];3561};35623563/*3564 * Transaction states.3565 * OPEN: The transaction is in a valid state and can accept new updates.3566 * An OPEN transaction can be committed.3567 * CLOSED: A closed transaction is no longer active and no other operations3568 * than free can be used on it in this state.3569 * A transaction can either become closed by successfully committing3570 * an active transaction or if there is a failure while building3571 * the transaction thus rendering it failed/inactive.3572 */3573enum ref_transaction_state {3574 REF_TRANSACTION_OPEN =0,3575 REF_TRANSACTION_CLOSED =13576};35773578/*3579 * Data structure for holding a reference transaction, which can3580 * consist of checks and updates to multiple references, carried out3581 * as atomically as possible. This structure is opaque to callers.3582 */3583struct ref_transaction {3584struct ref_update **updates;3585size_t alloc;3586size_t nr;3587enum ref_transaction_state state;3588};35893590struct ref_transaction *ref_transaction_begin(struct strbuf *err)3591{3592assert(err);35933594returnxcalloc(1,sizeof(struct ref_transaction));3595}35963597voidref_transaction_free(struct ref_transaction *transaction)3598{3599int i;36003601if(!transaction)3602return;36033604for(i =0; i < transaction->nr; i++) {3605free(transaction->updates[i]->msg);3606free(transaction->updates[i]);3607}3608free(transaction->updates);3609free(transaction);3610}36113612static struct ref_update *add_update(struct ref_transaction *transaction,3613const char*refname)3614{3615size_t len =strlen(refname);3616struct ref_update *update =xcalloc(1,sizeof(*update) + len +1);36173618strcpy((char*)update->refname, refname);3619ALLOC_GROW(transaction->updates, transaction->nr +1, transaction->alloc);3620 transaction->updates[transaction->nr++] = update;3621return update;3622}36233624intref_transaction_update(struct ref_transaction *transaction,3625const char*refname,3626const unsigned char*new_sha1,3627const unsigned char*old_sha1,3628unsigned int flags,const char*msg,3629struct strbuf *err)3630{3631struct ref_update *update;36323633assert(err);36343635if(transaction->state != REF_TRANSACTION_OPEN)3636die("BUG: update called for transaction that is not open");36373638if(new_sha1 && !is_null_sha1(new_sha1) &&3639check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {3640strbuf_addf(err,"refusing to update ref with bad name%s",3641 refname);3642return-1;3643}36443645 update =add_update(transaction, refname);3646if(new_sha1) {3647hashcpy(update->new_sha1, new_sha1);3648 flags |= REF_HAVE_NEW;3649}3650if(old_sha1) {3651hashcpy(update->old_sha1, old_sha1);3652 flags |= REF_HAVE_OLD;3653}3654 update->flags = flags;3655if(msg)3656 update->msg =xstrdup(msg);3657return0;3658}36593660intref_transaction_create(struct ref_transaction *transaction,3661const char*refname,3662const unsigned char*new_sha1,3663unsigned int flags,const char*msg,3664struct strbuf *err)3665{3666if(!new_sha1 ||is_null_sha1(new_sha1))3667die("BUG: create called without valid new_sha1");3668returnref_transaction_update(transaction, refname, new_sha1,3669 null_sha1, flags, msg, err);3670}36713672intref_transaction_delete(struct ref_transaction *transaction,3673const char*refname,3674const unsigned char*old_sha1,3675unsigned int flags,const char*msg,3676struct strbuf *err)3677{3678if(old_sha1 &&is_null_sha1(old_sha1))3679die("BUG: delete called with old_sha1 set to zeros");3680returnref_transaction_update(transaction, refname,3681 null_sha1, old_sha1,3682 flags, msg, err);3683}36843685intref_transaction_verify(struct ref_transaction *transaction,3686const char*refname,3687const unsigned char*old_sha1,3688unsigned int flags,3689struct strbuf *err)3690{3691if(!old_sha1)3692die("BUG: verify called with old_sha1 set to NULL");3693returnref_transaction_update(transaction, refname,3694 NULL, old_sha1,3695 flags, NULL, err);3696}36973698intupdate_ref(const char*msg,const char*refname,3699const unsigned char*new_sha1,const unsigned char*old_sha1,3700unsigned int flags,enum action_on_err onerr)3701{3702struct ref_transaction *t;3703struct strbuf err = STRBUF_INIT;37043705 t =ref_transaction_begin(&err);3706if(!t ||3707ref_transaction_update(t, refname, new_sha1, old_sha1,3708 flags, msg, &err) ||3709ref_transaction_commit(t, &err)) {3710const char*str ="update_ref failed for ref '%s':%s";37113712ref_transaction_free(t);3713switch(onerr) {3714case UPDATE_REFS_MSG_ON_ERR:3715error(str, refname, err.buf);3716break;3717case UPDATE_REFS_DIE_ON_ERR:3718die(str, refname, err.buf);3719break;3720case UPDATE_REFS_QUIET_ON_ERR:3721break;3722}3723strbuf_release(&err);3724return1;3725}3726strbuf_release(&err);3727ref_transaction_free(t);3728return0;3729}37303731static intref_update_compare(const void*r1,const void*r2)3732{3733const struct ref_update *const*u1 = r1;3734const struct ref_update *const*u2 = r2;3735returnstrcmp((*u1)->refname, (*u2)->refname);3736}37373738static intref_update_reject_duplicates(struct ref_update **updates,int n,3739struct strbuf *err)3740{3741int i;37423743assert(err);37443745for(i =1; i < n; i++)3746if(!strcmp(updates[i -1]->refname, updates[i]->refname)) {3747strbuf_addf(err,3748"Multiple updates for ref '%s' not allowed.",3749 updates[i]->refname);3750return1;3751}3752return0;3753}37543755intref_transaction_commit(struct ref_transaction *transaction,3756struct strbuf *err)3757{3758int ret =0, i;3759int n = transaction->nr;3760struct ref_update **updates = transaction->updates;3761struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3762struct string_list_item *ref_to_delete;37633764assert(err);37653766if(transaction->state != REF_TRANSACTION_OPEN)3767die("BUG: commit called for transaction that is not open");37683769if(!n) {3770 transaction->state = REF_TRANSACTION_CLOSED;3771return0;3772}37733774/* Copy, sort, and reject duplicate refs */3775qsort(updates, n,sizeof(*updates), ref_update_compare);3776if(ref_update_reject_duplicates(updates, n, err)) {3777 ret = TRANSACTION_GENERIC_ERROR;3778goto cleanup;3779}37803781/* Acquire all locks while verifying old values */3782for(i =0; i < n; i++) {3783struct ref_update *update = updates[i];3784unsigned int flags = update->flags;37853786if((flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1))3787 flags |= REF_DELETING;3788 update->lock =lock_ref_sha1_basic(3789 update->refname,3790((update->flags & REF_HAVE_OLD) ?3791 update->old_sha1 : NULL),3792 NULL,3793 flags,3794&update->type);3795if(!update->lock) {3796 ret = (errno == ENOTDIR)3797? TRANSACTION_NAME_CONFLICT3798: TRANSACTION_GENERIC_ERROR;3799strbuf_addf(err,"Cannot lock the ref '%s'.",3800 update->refname);3801goto cleanup;3802}3803}38043805/* Perform updates first so live commits remain referenced */3806for(i =0; i < n; i++) {3807struct ref_update *update = updates[i];3808int flags = update->flags;38093810if((flags & REF_HAVE_NEW) && !is_null_sha1(update->new_sha1)) {3811int overwriting_symref = ((update->type & REF_ISSYMREF) &&3812(update->flags & REF_NODEREF));38133814if(!overwriting_symref3815&& !hashcmp(update->lock->old_sha1, update->new_sha1)) {3816/*3817 * The reference already has the desired3818 * value, so we don't need to write it.3819 */3820unlock_ref(update->lock);3821 update->lock = NULL;3822}else if(write_ref_sha1(update->lock, update->new_sha1,3823 update->msg)) {3824 update->lock = NULL;/* freed by write_ref_sha1 */3825strbuf_addf(err,"Cannot update the ref '%s'.",3826 update->refname);3827 ret = TRANSACTION_GENERIC_ERROR;3828goto cleanup;3829}else{3830/* freed by write_ref_sha1(): */3831 update->lock = NULL;3832}3833}3834}38353836/* Perform deletes now that updates are safely completed */3837for(i =0; i < n; i++) {3838struct ref_update *update = updates[i];3839int flags = update->flags;38403841if((flags & REF_HAVE_NEW) &&is_null_sha1(update->new_sha1)) {3842if(delete_ref_loose(update->lock, update->type, err)) {3843 ret = TRANSACTION_GENERIC_ERROR;3844goto cleanup;3845}38463847if(!(flags & REF_ISPRUNING))3848string_list_append(&refs_to_delete,3849 update->lock->ref_name);3850}3851}38523853if(repack_without_refs(&refs_to_delete, err)) {3854 ret = TRANSACTION_GENERIC_ERROR;3855goto cleanup;3856}3857for_each_string_list_item(ref_to_delete, &refs_to_delete)3858unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3859clear_loose_ref_cache(&ref_cache);38603861cleanup:3862 transaction->state = REF_TRANSACTION_CLOSED;38633864for(i =0; i < n; i++)3865if(updates[i]->lock)3866unlock_ref(updates[i]->lock);3867string_list_clear(&refs_to_delete,0);3868return ret;3869}38703871char*shorten_unambiguous_ref(const char*refname,int strict)3872{3873int i;3874static char**scanf_fmts;3875static int nr_rules;3876char*short_name;38773878if(!nr_rules) {3879/*3880 * Pre-generate scanf formats from ref_rev_parse_rules[].3881 * Generate a format suitable for scanf from a3882 * ref_rev_parse_rules rule by interpolating "%s" at the3883 * location of the "%.*s".3884 */3885size_t total_len =0;3886size_t offset =0;38873888/* the rule list is NULL terminated, count them first */3889for(nr_rules =0; ref_rev_parse_rules[nr_rules]; nr_rules++)3890/* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */3891 total_len +=strlen(ref_rev_parse_rules[nr_rules]) -2+1;38923893 scanf_fmts =xmalloc(nr_rules *sizeof(char*) + total_len);38943895 offset =0;3896for(i =0; i < nr_rules; i++) {3897assert(offset < total_len);3898 scanf_fmts[i] = (char*)&scanf_fmts[nr_rules] + offset;3899 offset +=snprintf(scanf_fmts[i], total_len - offset,3900 ref_rev_parse_rules[i],2,"%s") +1;3901}3902}39033904/* bail out if there are no rules */3905if(!nr_rules)3906returnxstrdup(refname);39073908/* buffer for scanf result, at most refname must fit */3909 short_name =xstrdup(refname);39103911/* skip first rule, it will always match */3912for(i = nr_rules -1; i >0; --i) {3913int j;3914int rules_to_fail = i;3915int short_name_len;39163917if(1!=sscanf(refname, scanf_fmts[i], short_name))3918continue;39193920 short_name_len =strlen(short_name);39213922/*3923 * in strict mode, all (except the matched one) rules3924 * must fail to resolve to a valid non-ambiguous ref3925 */3926if(strict)3927 rules_to_fail = nr_rules;39283929/*3930 * check if the short name resolves to a valid ref,3931 * but use only rules prior to the matched one3932 */3933for(j =0; j < rules_to_fail; j++) {3934const char*rule = ref_rev_parse_rules[j];3935char refname[PATH_MAX];39363937/* skip matched rule */3938if(i == j)3939continue;39403941/*3942 * the short name is ambiguous, if it resolves3943 * (with this previous rule) to a valid ref3944 * read_ref() returns 0 on success3945 */3946mksnpath(refname,sizeof(refname),3947 rule, short_name_len, short_name);3948if(ref_exists(refname))3949break;3950}39513952/*3953 * short name is non-ambiguous if all previous rules3954 * haven't resolved to a valid ref3955 */3956if(j == rules_to_fail)3957return short_name;3958}39593960free(short_name);3961returnxstrdup(refname);3962}39633964static struct string_list *hide_refs;39653966intparse_hide_refs_config(const char*var,const char*value,const char*section)3967{3968if(!strcmp("transfer.hiderefs", var) ||3969/* NEEDSWORK: use parse_config_key() once both are merged */3970(starts_with(var, section) && var[strlen(section)] =='.'&&3971!strcmp(var +strlen(section),".hiderefs"))) {3972char*ref;3973int len;39743975if(!value)3976returnconfig_error_nonbool(var);3977 ref =xstrdup(value);3978 len =strlen(ref);3979while(len && ref[len -1] =='/')3980 ref[--len] ='\0';3981if(!hide_refs) {3982 hide_refs =xcalloc(1,sizeof(*hide_refs));3983 hide_refs->strdup_strings =1;3984}3985string_list_append(hide_refs, ref);3986}3987return0;3988}39893990intref_is_hidden(const char*refname)3991{3992struct string_list_item *item;39933994if(!hide_refs)3995return0;3996for_each_string_list_item(item, hide_refs) {3997int len;3998if(!starts_with(refname, item->string))3999continue;4000 len =strlen(item->string);4001if(!refname[len] || refname[len] =='/')4002return1;4003}4004return0;4005}40064007struct expire_reflog_cb {4008unsigned int flags;4009 reflog_expiry_should_prune_fn *should_prune_fn;4010void*policy_cb;4011FILE*newlog;4012unsigned char last_kept_sha1[20];4013};40144015static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,4016const char*email,unsigned long timestamp,int tz,4017const char*message,void*cb_data)4018{4019struct expire_reflog_cb *cb = cb_data;4020struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;40214022if(cb->flags & EXPIRE_REFLOGS_REWRITE)4023 osha1 = cb->last_kept_sha1;40244025if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,4026 message, policy_cb)) {4027if(!cb->newlog)4028printf("would prune%s", message);4029else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4030printf("prune%s", message);4031}else{4032if(cb->newlog) {4033fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",4034sha1_to_hex(osha1),sha1_to_hex(nsha1),4035 email, timestamp, tz, message);4036hashcpy(cb->last_kept_sha1, nsha1);4037}4038if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4039printf("keep%s", message);4040}4041return0;4042}40434044intreflog_expire(const char*refname,const unsigned char*sha1,4045unsigned int flags,4046 reflog_expiry_prepare_fn prepare_fn,4047 reflog_expiry_should_prune_fn should_prune_fn,4048 reflog_expiry_cleanup_fn cleanup_fn,4049void*policy_cb_data)4050{4051static struct lock_file reflog_lock;4052struct expire_reflog_cb cb;4053struct ref_lock *lock;4054char*log_file;4055int status =0;4056int type;40574058memset(&cb,0,sizeof(cb));4059 cb.flags = flags;4060 cb.policy_cb = policy_cb_data;4061 cb.should_prune_fn = should_prune_fn;40624063/*4064 * The reflog file is locked by holding the lock on the4065 * reference itself, plus we might need to update the4066 * reference if --updateref was specified:4067 */4068 lock =lock_ref_sha1_basic(refname, sha1, NULL,0, &type);4069if(!lock)4070returnerror("cannot lock ref '%s'", refname);4071if(!reflog_exists(refname)) {4072unlock_ref(lock);4073return0;4074}40754076 log_file =git_pathdup("logs/%s", refname);4077if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4078/*4079 * Even though holding $GIT_DIR/logs/$reflog.lock has4080 * no locking implications, we use the lock_file4081 * machinery here anyway because it does a lot of the4082 * work we need, including cleaning up if the program4083 * exits unexpectedly.4084 */4085if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4086struct strbuf err = STRBUF_INIT;4087unable_to_lock_message(log_file, errno, &err);4088error("%s", err.buf);4089strbuf_release(&err);4090goto failure;4091}4092 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4093if(!cb.newlog) {4094error("cannot fdopen%s(%s)",4095 reflog_lock.filename.buf,strerror(errno));4096goto failure;4097}4098}40994100(*prepare_fn)(refname, sha1, cb.policy_cb);4101for_each_reflog_ent(refname, expire_reflog_ent, &cb);4102(*cleanup_fn)(cb.policy_cb);41034104if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4105/*4106 * It doesn't make sense to adjust a reference pointed4107 * to by a symbolic ref based on expiring entries in4108 * the symbolic reference's reflog. Nor can we update4109 * a reference if there are no remaining reflog4110 * entries.4111 */4112int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4113!(type & REF_ISSYMREF) &&4114!is_null_sha1(cb.last_kept_sha1);41154116if(close_lock_file(&reflog_lock)) {4117 status |=error("couldn't write%s:%s", log_file,4118strerror(errno));4119}else if(update &&4120(write_in_full(lock->lock_fd,4121sha1_to_hex(cb.last_kept_sha1),40) !=40||4122write_str_in_full(lock->lock_fd,"\n") !=1||4123close_ref(lock) <0)) {4124 status |=error("couldn't write%s",4125 lock->lk->filename.buf);4126rollback_lock_file(&reflog_lock);4127}else if(commit_lock_file(&reflog_lock)) {4128 status |=error("unable to commit reflog '%s' (%s)",4129 log_file,strerror(errno));4130}else if(update &&commit_ref(lock)) {4131 status |=error("couldn't set%s", lock->ref_name);4132}4133}4134free(log_file);4135unlock_ref(lock);4136return status;41374138 failure:4139rollback_lock_file(&reflog_lock);4140free(log_file);4141unlock_ref(lock);4142return-1;4143}