1#include"cache.h" 2#include"lockfile.h" 3#include"refs.h" 4#include"object.h" 5#include"tag.h" 6#include"dir.h" 7#include"string-list.h" 8 9struct ref_lock { 10char*ref_name; 11char*orig_ref_name; 12struct lock_file *lk; 13struct object_id old_oid; 14}; 15 16/* 17 * How to handle various characters in refnames: 18 * 0: An acceptable character for refs 19 * 1: End-of-component 20 * 2: ., look for a preceding . to reject .. in refs 21 * 3: {, look for a preceding @ to reject @{ in refs 22 * 4: A bad character: ASCII control characters, "~", "^", ":" or SP 23 */ 24static unsigned char refname_disposition[256] = { 251,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, 264,4,4,4,4,4,4,4,4,4,4,4,4,4,4,4, 274,0,0,0,0,0,0,0,0,0,4,0,0,0,2,1, 280,0,0,0,0,0,0,0,0,0,4,0,0,0,0,4, 290,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 300,0,0,0,0,0,0,0,0,0,0,4,4,0,4,0, 310,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0, 320,0,0,0,0,0,0,0,0,0,0,3,0,0,4,4 33}; 34 35/* 36 * Flag passed to lock_ref_sha1_basic() telling it to tolerate broken 37 * refs (i.e., because the reference is about to be deleted anyway). 38 */ 39#define REF_DELETING 0x02 40 41/* 42 * Used as a flag in ref_update::flags when a loose ref is being 43 * pruned. 44 */ 45#define REF_ISPRUNING 0x04 46 47/* 48 * Used as a flag in ref_update::flags when the reference should be 49 * updated to new_sha1. 50 */ 51#define REF_HAVE_NEW 0x08 52 53/* 54 * Used as a flag in ref_update::flags when old_sha1 should be 55 * checked. 56 */ 57#define REF_HAVE_OLD 0x10 58 59/* 60 * Used as a flag in ref_update::flags when the lockfile needs to be 61 * committed. 62 */ 63#define REF_NEEDS_COMMIT 0x20 64 65/* 66 * Try to read one refname component from the front of refname. 67 * Return the length of the component found, or -1 if the component is 68 * not legal. It is legal if it is something reasonable to have under 69 * ".git/refs/"; We do not like it if: 70 * 71 * - any path component of it begins with ".", or 72 * - it has double dots "..", or 73 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or 74 * - it ends with a "/". 75 * - it ends with ".lock" 76 * - it contains a "\" (backslash) 77 */ 78static intcheck_refname_component(const char*refname,int flags) 79{ 80const char*cp; 81char last ='\0'; 82 83for(cp = refname; ; cp++) { 84int ch = *cp &255; 85unsigned char disp = refname_disposition[ch]; 86switch(disp) { 87case1: 88goto out; 89case2: 90if(last =='.') 91return-1;/* Refname contains "..". */ 92break; 93case3: 94if(last =='@') 95return-1;/* Refname contains "@{". */ 96break; 97case4: 98return-1; 99} 100 last = ch; 101} 102out: 103if(cp == refname) 104return0;/* Component has zero length. */ 105if(refname[0] =='.') 106return-1;/* Component starts with '.'. */ 107if(cp - refname >= LOCK_SUFFIX_LEN && 108!memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN)) 109return-1;/* Refname ends with ".lock". */ 110return cp - refname; 111} 112 113intcheck_refname_format(const char*refname,int flags) 114{ 115int component_len, component_count =0; 116 117if(!strcmp(refname,"@")) 118/* Refname is a single character '@'. */ 119return-1; 120 121while(1) { 122/* We are at the start of a path component. */ 123 component_len =check_refname_component(refname, flags); 124if(component_len <=0) { 125if((flags & REFNAME_REFSPEC_PATTERN) && 126 refname[0] =='*'&& 127(refname[1] =='\0'|| refname[1] =='/')) { 128/* Accept one wildcard as a full refname component. */ 129 flags &= ~REFNAME_REFSPEC_PATTERN; 130 component_len =1; 131}else{ 132return-1; 133} 134} 135 component_count++; 136if(refname[component_len] =='\0') 137break; 138/* Skip to next component. */ 139 refname += component_len +1; 140} 141 142if(refname[component_len -1] =='.') 143return-1;/* Refname ends with '.'. */ 144if(!(flags & REFNAME_ALLOW_ONELEVEL) && component_count <2) 145return-1;/* Refname has only one component. */ 146return0; 147} 148 149struct ref_entry; 150 151/* 152 * Information used (along with the information in ref_entry) to 153 * describe a single cached reference. This data structure only 154 * occurs embedded in a union in struct ref_entry, and only when 155 * (ref_entry->flag & REF_DIR) is zero. 156 */ 157struct ref_value { 158/* 159 * The name of the object to which this reference resolves 160 * (which may be a tag object). If REF_ISBROKEN, this is 161 * null. If REF_ISSYMREF, then this is the name of the object 162 * referred to by the last reference in the symlink chain. 163 */ 164struct object_id oid; 165 166/* 167 * If REF_KNOWS_PEELED, then this field holds the peeled value 168 * of this reference, or null if the reference is known not to 169 * be peelable. See the documentation for peel_ref() for an 170 * exact definition of "peelable". 171 */ 172struct object_id peeled; 173}; 174 175struct ref_cache; 176 177/* 178 * Information used (along with the information in ref_entry) to 179 * describe a level in the hierarchy of references. This data 180 * structure only occurs embedded in a union in struct ref_entry, and 181 * only when (ref_entry.flag & REF_DIR) is set. In that case, 182 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 183 * in the directory have already been read: 184 * 185 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 186 * or packed references, already read. 187 * 188 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 189 * references that hasn't been read yet (nor has any of its 190 * subdirectories). 191 * 192 * Entries within a directory are stored within a growable array of 193 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 194 * sorted are sorted by their component name in strcmp() order and the 195 * remaining entries are unsorted. 196 * 197 * Loose references are read lazily, one directory at a time. When a 198 * directory of loose references is read, then all of the references 199 * in that directory are stored, and REF_INCOMPLETE stubs are created 200 * for any subdirectories, but the subdirectories themselves are not 201 * read. The reading is triggered by get_ref_dir(). 202 */ 203struct ref_dir { 204int nr, alloc; 205 206/* 207 * Entries with index 0 <= i < sorted are sorted by name. New 208 * entries are appended to the list unsorted, and are sorted 209 * only when required; thus we avoid the need to sort the list 210 * after the addition of every reference. 211 */ 212int sorted; 213 214/* A pointer to the ref_cache that contains this ref_dir. */ 215struct ref_cache *ref_cache; 216 217struct ref_entry **entries; 218}; 219 220/* 221 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 222 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 223 * public values; see refs.h. 224 */ 225 226/* 227 * The field ref_entry->u.value.peeled of this value entry contains 228 * the correct peeled value for the reference, which might be 229 * null_sha1 if the reference is not a tag or if it is broken. 230 */ 231#define REF_KNOWS_PEELED 0x10 232 233/* ref_entry represents a directory of references */ 234#define REF_DIR 0x20 235 236/* 237 * Entry has not yet been read from disk (used only for REF_DIR 238 * entries representing loose references) 239 */ 240#define REF_INCOMPLETE 0x40 241 242/* 243 * A ref_entry represents either a reference or a "subdirectory" of 244 * references. 245 * 246 * Each directory in the reference namespace is represented by a 247 * ref_entry with (flags & REF_DIR) set and containing a subdir member 248 * that holds the entries in that directory that have been read so 249 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 250 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 251 * used for loose reference directories. 252 * 253 * References are represented by a ref_entry with (flags & REF_DIR) 254 * unset and a value member that describes the reference's value. The 255 * flag member is at the ref_entry level, but it is also needed to 256 * interpret the contents of the value field (in other words, a 257 * ref_value object is not very much use without the enclosing 258 * ref_entry). 259 * 260 * Reference names cannot end with slash and directories' names are 261 * always stored with a trailing slash (except for the top-level 262 * directory, which is always denoted by ""). This has two nice 263 * consequences: (1) when the entries in each subdir are sorted 264 * lexicographically by name (as they usually are), the references in 265 * a whole tree can be generated in lexicographic order by traversing 266 * the tree in left-to-right, depth-first order; (2) the names of 267 * references and subdirectories cannot conflict, and therefore the 268 * presence of an empty subdirectory does not block the creation of a 269 * similarly-named reference. (The fact that reference names with the 270 * same leading components can conflict *with each other* is a 271 * separate issue that is regulated by verify_refname_available().) 272 * 273 * Please note that the name field contains the fully-qualified 274 * reference (or subdirectory) name. Space could be saved by only 275 * storing the relative names. But that would require the full names 276 * to be generated on the fly when iterating in do_for_each_ref(), and 277 * would break callback functions, who have always been able to assume 278 * that the name strings that they are passed will not be freed during 279 * the iteration. 280 */ 281struct ref_entry { 282unsigned char flag;/* ISSYMREF? ISPACKED? */ 283union{ 284struct ref_value value;/* if not (flags&REF_DIR) */ 285struct ref_dir subdir;/* if (flags&REF_DIR) */ 286} u; 287/* 288 * The full name of the reference (e.g., "refs/heads/master") 289 * or the full name of the directory with a trailing slash 290 * (e.g., "refs/heads/"): 291 */ 292char name[FLEX_ARRAY]; 293}; 294 295static voidread_loose_refs(const char*dirname,struct ref_dir *dir); 296 297static struct ref_dir *get_ref_dir(struct ref_entry *entry) 298{ 299struct ref_dir *dir; 300assert(entry->flag & REF_DIR); 301 dir = &entry->u.subdir; 302if(entry->flag & REF_INCOMPLETE) { 303read_loose_refs(entry->name, dir); 304 entry->flag &= ~REF_INCOMPLETE; 305} 306return dir; 307} 308 309/* 310 * Check if a refname is safe. 311 * For refs that start with "refs/" we consider it safe as long they do 312 * not try to resolve to outside of refs/. 313 * 314 * For all other refs we only consider them safe iff they only contain 315 * upper case characters and '_' (like "HEAD" AND "MERGE_HEAD", and not like 316 * "config"). 317 */ 318static intrefname_is_safe(const char*refname) 319{ 320if(starts_with(refname,"refs/")) { 321char*buf; 322int result; 323 324 buf =xmalloc(strlen(refname) +1); 325/* 326 * Does the refname try to escape refs/? 327 * For example: refs/foo/../bar is safe but refs/foo/../../bar 328 * is not. 329 */ 330 result = !normalize_path_copy(buf, refname +strlen("refs/")); 331free(buf); 332return result; 333} 334while(*refname) { 335if(!isupper(*refname) && *refname !='_') 336return0; 337 refname++; 338} 339return1; 340} 341 342static struct ref_entry *create_ref_entry(const char*refname, 343const unsigned char*sha1,int flag, 344int check_name) 345{ 346int len; 347struct ref_entry *ref; 348 349if(check_name && 350check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 351die("Reference has invalid format: '%s'", refname); 352 len =strlen(refname) +1; 353 ref =xmalloc(sizeof(struct ref_entry) + len); 354hashcpy(ref->u.value.oid.hash, sha1); 355oidclr(&ref->u.value.peeled); 356memcpy(ref->name, refname, len); 357 ref->flag = flag; 358return ref; 359} 360 361static voidclear_ref_dir(struct ref_dir *dir); 362 363static voidfree_ref_entry(struct ref_entry *entry) 364{ 365if(entry->flag & REF_DIR) { 366/* 367 * Do not use get_ref_dir() here, as that might 368 * trigger the reading of loose refs. 369 */ 370clear_ref_dir(&entry->u.subdir); 371} 372free(entry); 373} 374 375/* 376 * Add a ref_entry to the end of dir (unsorted). Entry is always 377 * stored directly in dir; no recursion into subdirectories is 378 * done. 379 */ 380static voidadd_entry_to_dir(struct ref_dir *dir,struct ref_entry *entry) 381{ 382ALLOC_GROW(dir->entries, dir->nr +1, dir->alloc); 383 dir->entries[dir->nr++] = entry; 384/* optimize for the case that entries are added in order */ 385if(dir->nr ==1|| 386(dir->nr == dir->sorted +1&& 387strcmp(dir->entries[dir->nr -2]->name, 388 dir->entries[dir->nr -1]->name) <0)) 389 dir->sorted = dir->nr; 390} 391 392/* 393 * Clear and free all entries in dir, recursively. 394 */ 395static voidclear_ref_dir(struct ref_dir *dir) 396{ 397int i; 398for(i =0; i < dir->nr; i++) 399free_ref_entry(dir->entries[i]); 400free(dir->entries); 401 dir->sorted = dir->nr = dir->alloc =0; 402 dir->entries = NULL; 403} 404 405/* 406 * Create a struct ref_entry object for the specified dirname. 407 * dirname is the name of the directory with a trailing slash (e.g., 408 * "refs/heads/") or "" for the top-level directory. 409 */ 410static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 411const char*dirname,size_t len, 412int incomplete) 413{ 414struct ref_entry *direntry; 415 direntry =xcalloc(1,sizeof(struct ref_entry) + len +1); 416memcpy(direntry->name, dirname, len); 417 direntry->name[len] ='\0'; 418 direntry->u.subdir.ref_cache = ref_cache; 419 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE :0); 420return direntry; 421} 422 423static intref_entry_cmp(const void*a,const void*b) 424{ 425struct ref_entry *one = *(struct ref_entry **)a; 426struct ref_entry *two = *(struct ref_entry **)b; 427returnstrcmp(one->name, two->name); 428} 429 430static voidsort_ref_dir(struct ref_dir *dir); 431 432struct string_slice { 433size_t len; 434const char*str; 435}; 436 437static intref_entry_cmp_sslice(const void*key_,const void*ent_) 438{ 439const struct string_slice *key = key_; 440const struct ref_entry *ent = *(const struct ref_entry *const*)ent_; 441int cmp =strncmp(key->str, ent->name, key->len); 442if(cmp) 443return cmp; 444return'\0'- (unsigned char)ent->name[key->len]; 445} 446 447/* 448 * Return the index of the entry with the given refname from the 449 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 450 * no such entry is found. dir must already be complete. 451 */ 452static intsearch_ref_dir(struct ref_dir *dir,const char*refname,size_t len) 453{ 454struct ref_entry **r; 455struct string_slice key; 456 457if(refname == NULL || !dir->nr) 458return-1; 459 460sort_ref_dir(dir); 461 key.len = len; 462 key.str = refname; 463 r =bsearch(&key, dir->entries, dir->nr,sizeof(*dir->entries), 464 ref_entry_cmp_sslice); 465 466if(r == NULL) 467return-1; 468 469return r - dir->entries; 470} 471 472/* 473 * Search for a directory entry directly within dir (without 474 * recursing). Sort dir if necessary. subdirname must be a directory 475 * name (i.e., end in '/'). If mkdir is set, then create the 476 * directory if it is missing; otherwise, return NULL if the desired 477 * directory cannot be found. dir must already be complete. 478 */ 479static struct ref_dir *search_for_subdir(struct ref_dir *dir, 480const char*subdirname,size_t len, 481int mkdir) 482{ 483int entry_index =search_ref_dir(dir, subdirname, len); 484struct ref_entry *entry; 485if(entry_index == -1) { 486if(!mkdir) 487return NULL; 488/* 489 * Since dir is complete, the absence of a subdir 490 * means that the subdir really doesn't exist; 491 * therefore, create an empty record for it but mark 492 * the record complete. 493 */ 494 entry =create_dir_entry(dir->ref_cache, subdirname, len,0); 495add_entry_to_dir(dir, entry); 496}else{ 497 entry = dir->entries[entry_index]; 498} 499returnget_ref_dir(entry); 500} 501 502/* 503 * If refname is a reference name, find the ref_dir within the dir 504 * tree that should hold refname. If refname is a directory name 505 * (i.e., ends in '/'), then return that ref_dir itself. dir must 506 * represent the top-level directory and must already be complete. 507 * Sort ref_dirs and recurse into subdirectories as necessary. If 508 * mkdir is set, then create any missing directories; otherwise, 509 * return NULL if the desired directory cannot be found. 510 */ 511static struct ref_dir *find_containing_dir(struct ref_dir *dir, 512const char*refname,int mkdir) 513{ 514const char*slash; 515for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 516size_t dirnamelen = slash - refname +1; 517struct ref_dir *subdir; 518 subdir =search_for_subdir(dir, refname, dirnamelen, mkdir); 519if(!subdir) { 520 dir = NULL; 521break; 522} 523 dir = subdir; 524} 525 526return dir; 527} 528 529/* 530 * Find the value entry with the given name in dir, sorting ref_dirs 531 * and recursing into subdirectories as necessary. If the name is not 532 * found or it corresponds to a directory entry, return NULL. 533 */ 534static struct ref_entry *find_ref(struct ref_dir *dir,const char*refname) 535{ 536int entry_index; 537struct ref_entry *entry; 538 dir =find_containing_dir(dir, refname,0); 539if(!dir) 540return NULL; 541 entry_index =search_ref_dir(dir, refname,strlen(refname)); 542if(entry_index == -1) 543return NULL; 544 entry = dir->entries[entry_index]; 545return(entry->flag & REF_DIR) ? NULL : entry; 546} 547 548/* 549 * Remove the entry with the given name from dir, recursing into 550 * subdirectories as necessary. If refname is the name of a directory 551 * (i.e., ends with '/'), then remove the directory and its contents. 552 * If the removal was successful, return the number of entries 553 * remaining in the directory entry that contained the deleted entry. 554 * If the name was not found, return -1. Please note that this 555 * function only deletes the entry from the cache; it does not delete 556 * it from the filesystem or ensure that other cache entries (which 557 * might be symbolic references to the removed entry) are updated. 558 * Nor does it remove any containing dir entries that might be made 559 * empty by the removal. dir must represent the top-level directory 560 * and must already be complete. 561 */ 562static intremove_entry(struct ref_dir *dir,const char*refname) 563{ 564int refname_len =strlen(refname); 565int entry_index; 566struct ref_entry *entry; 567int is_dir = refname[refname_len -1] =='/'; 568if(is_dir) { 569/* 570 * refname represents a reference directory. Remove 571 * the trailing slash; otherwise we will get the 572 * directory *representing* refname rather than the 573 * one *containing* it. 574 */ 575char*dirname =xmemdupz(refname, refname_len -1); 576 dir =find_containing_dir(dir, dirname,0); 577free(dirname); 578}else{ 579 dir =find_containing_dir(dir, refname,0); 580} 581if(!dir) 582return-1; 583 entry_index =search_ref_dir(dir, refname, refname_len); 584if(entry_index == -1) 585return-1; 586 entry = dir->entries[entry_index]; 587 588memmove(&dir->entries[entry_index], 589&dir->entries[entry_index +1], 590(dir->nr - entry_index -1) *sizeof(*dir->entries) 591); 592 dir->nr--; 593if(dir->sorted > entry_index) 594 dir->sorted--; 595free_ref_entry(entry); 596return dir->nr; 597} 598 599/* 600 * Add a ref_entry to the ref_dir (unsorted), recursing into 601 * subdirectories as necessary. dir must represent the top-level 602 * directory. Return 0 on success. 603 */ 604static intadd_ref(struct ref_dir *dir,struct ref_entry *ref) 605{ 606 dir =find_containing_dir(dir, ref->name,1); 607if(!dir) 608return-1; 609add_entry_to_dir(dir, ref); 610return0; 611} 612 613/* 614 * Emit a warning and return true iff ref1 and ref2 have the same name 615 * and the same sha1. Die if they have the same name but different 616 * sha1s. 617 */ 618static intis_dup_ref(const struct ref_entry *ref1,const struct ref_entry *ref2) 619{ 620if(strcmp(ref1->name, ref2->name)) 621return0; 622 623/* Duplicate name; make sure that they don't conflict: */ 624 625if((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 626/* This is impossible by construction */ 627die("Reference directory conflict:%s", ref1->name); 628 629if(oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 630die("Duplicated ref, and SHA1s don't match:%s", ref1->name); 631 632warning("Duplicated ref:%s", ref1->name); 633return1; 634} 635 636/* 637 * Sort the entries in dir non-recursively (if they are not already 638 * sorted) and remove any duplicate entries. 639 */ 640static voidsort_ref_dir(struct ref_dir *dir) 641{ 642int i, j; 643struct ref_entry *last = NULL; 644 645/* 646 * This check also prevents passing a zero-length array to qsort(), 647 * which is a problem on some platforms. 648 */ 649if(dir->sorted == dir->nr) 650return; 651 652qsort(dir->entries, dir->nr,sizeof(*dir->entries), ref_entry_cmp); 653 654/* Remove any duplicates: */ 655for(i =0, j =0; j < dir->nr; j++) { 656struct ref_entry *entry = dir->entries[j]; 657if(last &&is_dup_ref(last, entry)) 658free_ref_entry(entry); 659else 660 last = dir->entries[i++] = entry; 661} 662 dir->sorted = dir->nr = i; 663} 664 665/* Include broken references in a do_for_each_ref*() iteration: */ 666#define DO_FOR_EACH_INCLUDE_BROKEN 0x01 667 668/* 669 * Return true iff the reference described by entry can be resolved to 670 * an object in the database. Emit a warning if the referred-to 671 * object does not exist. 672 */ 673static intref_resolves_to_object(struct ref_entry *entry) 674{ 675if(entry->flag & REF_ISBROKEN) 676return0; 677if(!has_sha1_file(entry->u.value.oid.hash)) { 678error("%sdoes not point to a valid object!", entry->name); 679return0; 680} 681return1; 682} 683 684/* 685 * current_ref is a performance hack: when iterating over references 686 * using the for_each_ref*() functions, current_ref is set to the 687 * current reference's entry before calling the callback function. If 688 * the callback function calls peel_ref(), then peel_ref() first 689 * checks whether the reference to be peeled is the current reference 690 * (it usually is) and if so, returns that reference's peeled version 691 * if it is available. This avoids a refname lookup in a common case. 692 */ 693static struct ref_entry *current_ref; 694 695typedefinteach_ref_entry_fn(struct ref_entry *entry,void*cb_data); 696 697struct ref_entry_cb { 698const char*base; 699int trim; 700int flags; 701 each_ref_fn *fn; 702void*cb_data; 703}; 704 705/* 706 * Handle one reference in a do_for_each_ref*()-style iteration, 707 * calling an each_ref_fn for each entry. 708 */ 709static intdo_one_ref(struct ref_entry *entry,void*cb_data) 710{ 711struct ref_entry_cb *data = cb_data; 712struct ref_entry *old_current_ref; 713int retval; 714 715if(!starts_with(entry->name, data->base)) 716return0; 717 718if(!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && 719!ref_resolves_to_object(entry)) 720return0; 721 722/* Store the old value, in case this is a recursive call: */ 723 old_current_ref = current_ref; 724 current_ref = entry; 725 retval = data->fn(entry->name + data->trim, &entry->u.value.oid, 726 entry->flag, data->cb_data); 727 current_ref = old_current_ref; 728return retval; 729} 730 731/* 732 * Call fn for each reference in dir that has index in the range 733 * offset <= index < dir->nr. Recurse into subdirectories that are in 734 * that index range, sorting them before iterating. This function 735 * does not sort dir itself; it should be sorted beforehand. fn is 736 * called for all references, including broken ones. 737 */ 738static intdo_for_each_entry_in_dir(struct ref_dir *dir,int offset, 739 each_ref_entry_fn fn,void*cb_data) 740{ 741int i; 742assert(dir->sorted == dir->nr); 743for(i = offset; i < dir->nr; i++) { 744struct ref_entry *entry = dir->entries[i]; 745int retval; 746if(entry->flag & REF_DIR) { 747struct ref_dir *subdir =get_ref_dir(entry); 748sort_ref_dir(subdir); 749 retval =do_for_each_entry_in_dir(subdir,0, fn, cb_data); 750}else{ 751 retval =fn(entry, cb_data); 752} 753if(retval) 754return retval; 755} 756return0; 757} 758 759/* 760 * Call fn for each reference in the union of dir1 and dir2, in order 761 * by refname. Recurse into subdirectories. If a value entry appears 762 * in both dir1 and dir2, then only process the version that is in 763 * dir2. The input dirs must already be sorted, but subdirs will be 764 * sorted as needed. fn is called for all references, including 765 * broken ones. 766 */ 767static intdo_for_each_entry_in_dirs(struct ref_dir *dir1, 768struct ref_dir *dir2, 769 each_ref_entry_fn fn,void*cb_data) 770{ 771int retval; 772int i1 =0, i2 =0; 773 774assert(dir1->sorted == dir1->nr); 775assert(dir2->sorted == dir2->nr); 776while(1) { 777struct ref_entry *e1, *e2; 778int cmp; 779if(i1 == dir1->nr) { 780returndo_for_each_entry_in_dir(dir2, i2, fn, cb_data); 781} 782if(i2 == dir2->nr) { 783returndo_for_each_entry_in_dir(dir1, i1, fn, cb_data); 784} 785 e1 = dir1->entries[i1]; 786 e2 = dir2->entries[i2]; 787 cmp =strcmp(e1->name, e2->name); 788if(cmp ==0) { 789if((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { 790/* Both are directories; descend them in parallel. */ 791struct ref_dir *subdir1 =get_ref_dir(e1); 792struct ref_dir *subdir2 =get_ref_dir(e2); 793sort_ref_dir(subdir1); 794sort_ref_dir(subdir2); 795 retval =do_for_each_entry_in_dirs( 796 subdir1, subdir2, fn, cb_data); 797 i1++; 798 i2++; 799}else if(!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { 800/* Both are references; ignore the one from dir1. */ 801 retval =fn(e2, cb_data); 802 i1++; 803 i2++; 804}else{ 805die("conflict between reference and directory:%s", 806 e1->name); 807} 808}else{ 809struct ref_entry *e; 810if(cmp <0) { 811 e = e1; 812 i1++; 813}else{ 814 e = e2; 815 i2++; 816} 817if(e->flag & REF_DIR) { 818struct ref_dir *subdir =get_ref_dir(e); 819sort_ref_dir(subdir); 820 retval =do_for_each_entry_in_dir( 821 subdir,0, fn, cb_data); 822}else{ 823 retval =fn(e, cb_data); 824} 825} 826if(retval) 827return retval; 828} 829} 830 831/* 832 * Load all of the refs from the dir into our in-memory cache. The hard work 833 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 834 * through all of the sub-directories. We do not even need to care about 835 * sorting, as traversal order does not matter to us. 836 */ 837static voidprime_ref_dir(struct ref_dir *dir) 838{ 839int i; 840for(i =0; i < dir->nr; i++) { 841struct ref_entry *entry = dir->entries[i]; 842if(entry->flag & REF_DIR) 843prime_ref_dir(get_ref_dir(entry)); 844} 845} 846 847struct nonmatching_ref_data { 848const struct string_list *skip; 849const char*conflicting_refname; 850}; 851 852static intnonmatching_ref_fn(struct ref_entry *entry,void*vdata) 853{ 854struct nonmatching_ref_data *data = vdata; 855 856if(data->skip &&string_list_has_string(data->skip, entry->name)) 857return0; 858 859 data->conflicting_refname = entry->name; 860return1; 861} 862 863/* 864 * Return 0 if a reference named refname could be created without 865 * conflicting with the name of an existing reference in dir. 866 * Otherwise, return a negative value and write an explanation to err. 867 * If extras is non-NULL, it is a list of additional refnames with 868 * which refname is not allowed to conflict. If skip is non-NULL, 869 * ignore potential conflicts with refs in skip (e.g., because they 870 * are scheduled for deletion in the same operation). Behavior is 871 * undefined if the same name is listed in both extras and skip. 872 * 873 * Two reference names conflict if one of them exactly matches the 874 * leading components of the other; e.g., "refs/foo/bar" conflicts 875 * with both "refs/foo" and with "refs/foo/bar/baz" but not with 876 * "refs/foo/bar" or "refs/foo/barbados". 877 * 878 * extras and skip must be sorted. 879 */ 880static intverify_refname_available(const char*refname, 881const struct string_list *extras, 882const struct string_list *skip, 883struct ref_dir *dir, 884struct strbuf *err) 885{ 886const char*slash; 887int pos; 888struct strbuf dirname = STRBUF_INIT; 889int ret = -1; 890 891/* 892 * For the sake of comments in this function, suppose that 893 * refname is "refs/foo/bar". 894 */ 895 896assert(err); 897 898strbuf_grow(&dirname,strlen(refname) +1); 899for(slash =strchr(refname,'/'); slash; slash =strchr(slash +1,'/')) { 900/* Expand dirname to the new prefix, not including the trailing slash: */ 901strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 902 903/* 904 * We are still at a leading dir of the refname (e.g., 905 * "refs/foo"; if there is a reference with that name, 906 * it is a conflict, *unless* it is in skip. 907 */ 908if(dir) { 909 pos =search_ref_dir(dir, dirname.buf, dirname.len); 910if(pos >=0&& 911(!skip || !string_list_has_string(skip, dirname.buf))) { 912/* 913 * We found a reference whose name is 914 * a proper prefix of refname; e.g., 915 * "refs/foo", and is not in skip. 916 */ 917strbuf_addf(err,"'%s' exists; cannot create '%s'", 918 dirname.buf, refname); 919goto cleanup; 920} 921} 922 923if(extras &&string_list_has_string(extras, dirname.buf) && 924(!skip || !string_list_has_string(skip, dirname.buf))) { 925strbuf_addf(err,"cannot process '%s' and '%s' at the same time", 926 refname, dirname.buf); 927goto cleanup; 928} 929 930/* 931 * Otherwise, we can try to continue our search with 932 * the next component. So try to look up the 933 * directory, e.g., "refs/foo/". If we come up empty, 934 * we know there is nothing under this whole prefix, 935 * but even in that case we still have to continue the 936 * search for conflicts with extras. 937 */ 938strbuf_addch(&dirname,'/'); 939if(dir) { 940 pos =search_ref_dir(dir, dirname.buf, dirname.len); 941if(pos <0) { 942/* 943 * There was no directory "refs/foo/", 944 * so there is nothing under this 945 * whole prefix. So there is no need 946 * to continue looking for conflicting 947 * references. But we need to continue 948 * looking for conflicting extras. 949 */ 950 dir = NULL; 951}else{ 952 dir =get_ref_dir(dir->entries[pos]); 953} 954} 955} 956 957/* 958 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 959 * There is no point in searching for a reference with that 960 * name, because a refname isn't considered to conflict with 961 * itself. But we still need to check for references whose 962 * names are in the "refs/foo/bar/" namespace, because they 963 * *do* conflict. 964 */ 965strbuf_addstr(&dirname, refname + dirname.len); 966strbuf_addch(&dirname,'/'); 967 968if(dir) { 969 pos =search_ref_dir(dir, dirname.buf, dirname.len); 970 971if(pos >=0) { 972/* 973 * We found a directory named "$refname/" 974 * (e.g., "refs/foo/bar/"). It is a problem 975 * iff it contains any ref that is not in 976 * "skip". 977 */ 978struct nonmatching_ref_data data; 979 980 data.skip = skip; 981 data.conflicting_refname = NULL; 982 dir =get_ref_dir(dir->entries[pos]); 983sort_ref_dir(dir); 984if(do_for_each_entry_in_dir(dir,0, nonmatching_ref_fn, &data)) { 985strbuf_addf(err,"'%s' exists; cannot create '%s'", 986 data.conflicting_refname, refname); 987goto cleanup; 988} 989} 990} 991 992if(extras) { 993/* 994 * Check for entries in extras that start with 995 * "$refname/". We do that by looking for the place 996 * where "$refname/" would be inserted in extras. If 997 * there is an entry at that position that starts with 998 * "$refname/" and is not in skip, then we have a 999 * conflict.1000 */1001for(pos =string_list_find_insert_index(extras, dirname.buf,0);1002 pos < extras->nr; pos++) {1003const char*extra_refname = extras->items[pos].string;10041005if(!starts_with(extra_refname, dirname.buf))1006break;10071008if(!skip || !string_list_has_string(skip, extra_refname)) {1009strbuf_addf(err,"cannot process '%s' and '%s' at the same time",1010 refname, extra_refname);1011goto cleanup;1012}1013}1014}10151016/* No conflicts were found */1017 ret =0;10181019cleanup:1020strbuf_release(&dirname);1021return ret;1022}10231024struct packed_ref_cache {1025struct ref_entry *root;10261027/*1028 * Count of references to the data structure in this instance,1029 * including the pointer from ref_cache::packed if any. The1030 * data will not be freed as long as the reference count is1031 * nonzero.1032 */1033unsigned int referrers;10341035/*1036 * Iff the packed-refs file associated with this instance is1037 * currently locked for writing, this points at the associated1038 * lock (which is owned by somebody else). The referrer count1039 * is also incremented when the file is locked and decremented1040 * when it is unlocked.1041 */1042struct lock_file *lock;10431044/* The metadata from when this packed-refs cache was read */1045struct stat_validity validity;1046};10471048/*1049 * Future: need to be in "struct repository"1050 * when doing a full libification.1051 */1052static struct ref_cache {1053struct ref_cache *next;1054struct ref_entry *loose;1055struct packed_ref_cache *packed;1056/*1057 * The submodule name, or "" for the main repo. We allocate1058 * length 1 rather than FLEX_ARRAY so that the main ref_cache1059 * is initialized correctly.1060 */1061char name[1];1062} ref_cache, *submodule_ref_caches;10631064/* Lock used for the main packed-refs file: */1065static struct lock_file packlock;10661067/*1068 * Increment the reference count of *packed_refs.1069 */1070static voidacquire_packed_ref_cache(struct packed_ref_cache *packed_refs)1071{1072 packed_refs->referrers++;1073}10741075/*1076 * Decrease the reference count of *packed_refs. If it goes to zero,1077 * free *packed_refs and return true; otherwise return false.1078 */1079static intrelease_packed_ref_cache(struct packed_ref_cache *packed_refs)1080{1081if(!--packed_refs->referrers) {1082free_ref_entry(packed_refs->root);1083stat_validity_clear(&packed_refs->validity);1084free(packed_refs);1085return1;1086}else{1087return0;1088}1089}10901091static voidclear_packed_ref_cache(struct ref_cache *refs)1092{1093if(refs->packed) {1094struct packed_ref_cache *packed_refs = refs->packed;10951096if(packed_refs->lock)1097die("internal error: packed-ref cache cleared while locked");1098 refs->packed = NULL;1099release_packed_ref_cache(packed_refs);1100}1101}11021103static voidclear_loose_ref_cache(struct ref_cache *refs)1104{1105if(refs->loose) {1106free_ref_entry(refs->loose);1107 refs->loose = NULL;1108}1109}11101111static struct ref_cache *create_ref_cache(const char*submodule)1112{1113int len;1114struct ref_cache *refs;1115if(!submodule)1116 submodule ="";1117 len =strlen(submodule) +1;1118 refs =xcalloc(1,sizeof(struct ref_cache) + len);1119memcpy(refs->name, submodule, len);1120return refs;1121}11221123/*1124 * Return a pointer to a ref_cache for the specified submodule. For1125 * the main repository, use submodule==NULL. The returned structure1126 * will be allocated and initialized but not necessarily populated; it1127 * should not be freed.1128 */1129static struct ref_cache *get_ref_cache(const char*submodule)1130{1131struct ref_cache *refs;11321133if(!submodule || !*submodule)1134return&ref_cache;11351136for(refs = submodule_ref_caches; refs; refs = refs->next)1137if(!strcmp(submodule, refs->name))1138return refs;11391140 refs =create_ref_cache(submodule);1141 refs->next = submodule_ref_caches;1142 submodule_ref_caches = refs;1143return refs;1144}11451146/* The length of a peeled reference line in packed-refs, including EOL: */1147#define PEELED_LINE_LENGTH 4211481149/*1150 * The packed-refs header line that we write out. Perhaps other1151 * traits will be added later. The trailing space is required.1152 */1153static const char PACKED_REFS_HEADER[] =1154"# pack-refs with: peeled fully-peeled\n";11551156/*1157 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1158 * Return a pointer to the refname within the line (null-terminated),1159 * or NULL if there was a problem.1160 */1161static const char*parse_ref_line(struct strbuf *line,unsigned char*sha1)1162{1163const char*ref;11641165/*1166 * 42: the answer to everything.1167 *1168 * In this case, it happens to be the answer to1169 * 40 (length of sha1 hex representation)1170 * +1 (space in between hex and name)1171 * +1 (newline at the end of the line)1172 */1173if(line->len <=42)1174return NULL;11751176if(get_sha1_hex(line->buf, sha1) <0)1177return NULL;1178if(!isspace(line->buf[40]))1179return NULL;11801181 ref = line->buf +41;1182if(isspace(*ref))1183return NULL;11841185if(line->buf[line->len -1] !='\n')1186return NULL;1187 line->buf[--line->len] =0;11881189return ref;1190}11911192/*1193 * Read f, which is a packed-refs file, into dir.1194 *1195 * A comment line of the form "# pack-refs with: " may contain zero or1196 * more traits. We interpret the traits as follows:1197 *1198 * No traits:1199 *1200 * Probably no references are peeled. But if the file contains a1201 * peeled value for a reference, we will use it.1202 *1203 * peeled:1204 *1205 * References under "refs/tags/", if they *can* be peeled, *are*1206 * peeled in this file. References outside of "refs/tags/" are1207 * probably not peeled even if they could have been, but if we find1208 * a peeled value for such a reference we will use it.1209 *1210 * fully-peeled:1211 *1212 * All references in the file that can be peeled are peeled.1213 * Inversely (and this is more important), any references in the1214 * file for which no peeled value is recorded is not peelable. This1215 * trait should typically be written alongside "peeled" for1216 * compatibility with older clients, but we do not require it1217 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1218 */1219static voidread_packed_refs(FILE*f,struct ref_dir *dir)1220{1221struct ref_entry *last = NULL;1222struct strbuf line = STRBUF_INIT;1223enum{ PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;12241225while(strbuf_getwholeline(&line, f,'\n') != EOF) {1226unsigned char sha1[20];1227const char*refname;1228const char*traits;12291230if(skip_prefix(line.buf,"# pack-refs with:", &traits)) {1231if(strstr(traits," fully-peeled "))1232 peeled = PEELED_FULLY;1233else if(strstr(traits," peeled "))1234 peeled = PEELED_TAGS;1235/* perhaps other traits later as well */1236continue;1237}12381239 refname =parse_ref_line(&line, sha1);1240if(refname) {1241int flag = REF_ISPACKED;12421243if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1244if(!refname_is_safe(refname))1245die("packed refname is dangerous:%s", refname);1246hashclr(sha1);1247 flag |= REF_BAD_NAME | REF_ISBROKEN;1248}1249 last =create_ref_entry(refname, sha1, flag,0);1250if(peeled == PEELED_FULLY ||1251(peeled == PEELED_TAGS &&starts_with(refname,"refs/tags/")))1252 last->flag |= REF_KNOWS_PEELED;1253add_ref(dir, last);1254continue;1255}1256if(last &&1257 line.buf[0] =='^'&&1258 line.len == PEELED_LINE_LENGTH &&1259 line.buf[PEELED_LINE_LENGTH -1] =='\n'&&1260!get_sha1_hex(line.buf +1, sha1)) {1261hashcpy(last->u.value.peeled.hash, sha1);1262/*1263 * Regardless of what the file header said,1264 * we definitely know the value of *this*1265 * reference:1266 */1267 last->flag |= REF_KNOWS_PEELED;1268}1269}12701271strbuf_release(&line);1272}12731274/*1275 * Get the packed_ref_cache for the specified ref_cache, creating it1276 * if necessary.1277 */1278static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1279{1280const char*packed_refs_file;12811282if(*refs->name)1283 packed_refs_file =git_path_submodule(refs->name,"packed-refs");1284else1285 packed_refs_file =git_path("packed-refs");12861287if(refs->packed &&1288!stat_validity_check(&refs->packed->validity, packed_refs_file))1289clear_packed_ref_cache(refs);12901291if(!refs->packed) {1292FILE*f;12931294 refs->packed =xcalloc(1,sizeof(*refs->packed));1295acquire_packed_ref_cache(refs->packed);1296 refs->packed->root =create_dir_entry(refs,"",0,0);1297 f =fopen(packed_refs_file,"r");1298if(f) {1299stat_validity_update(&refs->packed->validity,fileno(f));1300read_packed_refs(f,get_ref_dir(refs->packed->root));1301fclose(f);1302}1303}1304return refs->packed;1305}13061307static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1308{1309returnget_ref_dir(packed_ref_cache->root);1310}13111312static struct ref_dir *get_packed_refs(struct ref_cache *refs)1313{1314returnget_packed_ref_dir(get_packed_ref_cache(refs));1315}13161317/*1318 * Add a reference to the in-memory packed reference cache. This may1319 * only be called while the packed-refs file is locked (see1320 * lock_packed_refs()). To actually write the packed-refs file, call1321 * commit_packed_refs().1322 */1323static voidadd_packed_ref(const char*refname,const unsigned char*sha1)1324{1325struct packed_ref_cache *packed_ref_cache =1326get_packed_ref_cache(&ref_cache);13271328if(!packed_ref_cache->lock)1329die("internal error: packed refs not locked");1330add_ref(get_packed_ref_dir(packed_ref_cache),1331create_ref_entry(refname, sha1, REF_ISPACKED,1));1332}13331334/*1335 * Read the loose references from the namespace dirname into dir1336 * (without recursing). dirname must end with '/'. dir must be the1337 * directory entry corresponding to dirname.1338 */1339static voidread_loose_refs(const char*dirname,struct ref_dir *dir)1340{1341struct ref_cache *refs = dir->ref_cache;1342DIR*d;1343const char*path;1344struct dirent *de;1345int dirnamelen =strlen(dirname);1346struct strbuf refname;13471348if(*refs->name)1349 path =git_path_submodule(refs->name,"%s", dirname);1350else1351 path =git_path("%s", dirname);13521353 d =opendir(path);1354if(!d)1355return;13561357strbuf_init(&refname, dirnamelen +257);1358strbuf_add(&refname, dirname, dirnamelen);13591360while((de =readdir(d)) != NULL) {1361unsigned char sha1[20];1362struct stat st;1363int flag;1364const char*refdir;13651366if(de->d_name[0] =='.')1367continue;1368if(ends_with(de->d_name,".lock"))1369continue;1370strbuf_addstr(&refname, de->d_name);1371 refdir = *refs->name1372?git_path_submodule(refs->name,"%s", refname.buf)1373:git_path("%s", refname.buf);1374if(stat(refdir, &st) <0) {1375;/* silently ignore */1376}else if(S_ISDIR(st.st_mode)) {1377strbuf_addch(&refname,'/');1378add_entry_to_dir(dir,1379create_dir_entry(refs, refname.buf,1380 refname.len,1));1381}else{1382if(*refs->name) {1383hashclr(sha1);1384 flag =0;1385if(resolve_gitlink_ref(refs->name, refname.buf, sha1) <0) {1386hashclr(sha1);1387 flag |= REF_ISBROKEN;1388}1389}else if(read_ref_full(refname.buf,1390 RESOLVE_REF_READING,1391 sha1, &flag)) {1392hashclr(sha1);1393 flag |= REF_ISBROKEN;1394}1395if(check_refname_format(refname.buf,1396 REFNAME_ALLOW_ONELEVEL)) {1397if(!refname_is_safe(refname.buf))1398die("loose refname is dangerous:%s", refname.buf);1399hashclr(sha1);1400 flag |= REF_BAD_NAME | REF_ISBROKEN;1401}1402add_entry_to_dir(dir,1403create_ref_entry(refname.buf, sha1, flag,0));1404}1405strbuf_setlen(&refname, dirnamelen);1406}1407strbuf_release(&refname);1408closedir(d);1409}14101411static struct ref_dir *get_loose_refs(struct ref_cache *refs)1412{1413if(!refs->loose) {1414/*1415 * Mark the top-level directory complete because we1416 * are about to read the only subdirectory that can1417 * hold references:1418 */1419 refs->loose =create_dir_entry(refs,"",0,0);1420/*1421 * Create an incomplete entry for "refs/":1422 */1423add_entry_to_dir(get_ref_dir(refs->loose),1424create_dir_entry(refs,"refs/",5,1));1425}1426returnget_ref_dir(refs->loose);1427}14281429/* We allow "recursive" symbolic refs. Only within reason, though */1430#define MAXDEPTH 51431#define MAXREFLEN (1024)14321433/*1434 * Called by resolve_gitlink_ref_recursive() after it failed to read1435 * from the loose refs in ref_cache refs. Find <refname> in the1436 * packed-refs file for the submodule.1437 */1438static intresolve_gitlink_packed_ref(struct ref_cache *refs,1439const char*refname,unsigned char*sha1)1440{1441struct ref_entry *ref;1442struct ref_dir *dir =get_packed_refs(refs);14431444 ref =find_ref(dir, refname);1445if(ref == NULL)1446return-1;14471448hashcpy(sha1, ref->u.value.oid.hash);1449return0;1450}14511452static intresolve_gitlink_ref_recursive(struct ref_cache *refs,1453const char*refname,unsigned char*sha1,1454int recursion)1455{1456int fd, len;1457char buffer[128], *p;1458const char*path;14591460if(recursion > MAXDEPTH ||strlen(refname) > MAXREFLEN)1461return-1;1462 path = *refs->name1463?git_path_submodule(refs->name,"%s", refname)1464:git_path("%s", refname);1465 fd =open(path, O_RDONLY);1466if(fd <0)1467returnresolve_gitlink_packed_ref(refs, refname, sha1);14681469 len =read(fd, buffer,sizeof(buffer)-1);1470close(fd);1471if(len <0)1472return-1;1473while(len &&isspace(buffer[len-1]))1474 len--;1475 buffer[len] =0;14761477/* Was it a detached head or an old-fashioned symlink? */1478if(!get_sha1_hex(buffer, sha1))1479return0;14801481/* Symref? */1482if(strncmp(buffer,"ref:",4))1483return-1;1484 p = buffer +4;1485while(isspace(*p))1486 p++;14871488returnresolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1489}14901491intresolve_gitlink_ref(const char*path,const char*refname,unsigned char*sha1)1492{1493int len =strlen(path), retval;1494char*submodule;1495struct ref_cache *refs;14961497while(len && path[len-1] =='/')1498 len--;1499if(!len)1500return-1;1501 submodule =xstrndup(path, len);1502 refs =get_ref_cache(submodule);1503free(submodule);15041505 retval =resolve_gitlink_ref_recursive(refs, refname, sha1,0);1506return retval;1507}15081509/*1510 * Return the ref_entry for the given refname from the packed1511 * references. If it does not exist, return NULL.1512 */1513static struct ref_entry *get_packed_ref(const char*refname)1514{1515returnfind_ref(get_packed_refs(&ref_cache), refname);1516}15171518/*1519 * A loose ref file doesn't exist; check for a packed ref. The1520 * options are forwarded from resolve_safe_unsafe().1521 */1522static intresolve_missing_loose_ref(const char*refname,1523int resolve_flags,1524unsigned char*sha1,1525int*flags)1526{1527struct ref_entry *entry;15281529/*1530 * The loose reference file does not exist; check for a packed1531 * reference.1532 */1533 entry =get_packed_ref(refname);1534if(entry) {1535hashcpy(sha1, entry->u.value.oid.hash);1536if(flags)1537*flags |= REF_ISPACKED;1538return0;1539}1540/* The reference is not a packed reference, either. */1541if(resolve_flags & RESOLVE_REF_READING) {1542 errno = ENOENT;1543return-1;1544}else{1545hashclr(sha1);1546return0;1547}1548}15491550/* This function needs to return a meaningful errno on failure */1551static const char*resolve_ref_unsafe_1(const char*refname,1552int resolve_flags,1553unsigned char*sha1,1554int*flags,1555struct strbuf *sb_path)1556{1557int depth = MAXDEPTH;1558 ssize_t len;1559char buffer[256];1560static char refname_buffer[256];1561int bad_name =0;15621563if(flags)1564*flags =0;15651566if(check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1567if(flags)1568*flags |= REF_BAD_NAME;15691570if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1571!refname_is_safe(refname)) {1572 errno = EINVAL;1573return NULL;1574}1575/*1576 * dwim_ref() uses REF_ISBROKEN to distinguish between1577 * missing refs and refs that were present but invalid,1578 * to complain about the latter to stderr.1579 *1580 * We don't know whether the ref exists, so don't set1581 * REF_ISBROKEN yet.1582 */1583 bad_name =1;1584}1585for(;;) {1586const char*path;1587struct stat st;1588char*buf;1589int fd;15901591if(--depth <0) {1592 errno = ELOOP;1593return NULL;1594}15951596strbuf_reset(sb_path);1597strbuf_git_path(sb_path,"%s", refname);1598 path = sb_path->buf;15991600/*1601 * We might have to loop back here to avoid a race1602 * condition: first we lstat() the file, then we try1603 * to read it as a link or as a file. But if somebody1604 * changes the type of the file (file <-> directory1605 * <-> symlink) between the lstat() and reading, then1606 * we don't want to report that as an error but rather1607 * try again starting with the lstat().1608 */1609 stat_ref:1610if(lstat(path, &st) <0) {1611if(errno != ENOENT)1612return NULL;1613if(resolve_missing_loose_ref(refname, resolve_flags,1614 sha1, flags))1615return NULL;1616if(bad_name) {1617hashclr(sha1);1618if(flags)1619*flags |= REF_ISBROKEN;1620}1621return refname;1622}16231624/* Follow "normalized" - ie "refs/.." symlinks by hand */1625if(S_ISLNK(st.st_mode)) {1626 len =readlink(path, buffer,sizeof(buffer)-1);1627if(len <0) {1628if(errno == ENOENT || errno == EINVAL)1629/* inconsistent with lstat; retry */1630goto stat_ref;1631else1632return NULL;1633}1634 buffer[len] =0;1635if(starts_with(buffer,"refs/") &&1636!check_refname_format(buffer,0)) {1637strcpy(refname_buffer, buffer);1638 refname = refname_buffer;1639if(flags)1640*flags |= REF_ISSYMREF;1641if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1642hashclr(sha1);1643return refname;1644}1645continue;1646}1647}16481649/* Is it a directory? */1650if(S_ISDIR(st.st_mode)) {1651 errno = EISDIR;1652return NULL;1653}16541655/*1656 * Anything else, just open it and try to use it as1657 * a ref1658 */1659 fd =open(path, O_RDONLY);1660if(fd <0) {1661if(errno == ENOENT)1662/* inconsistent with lstat; retry */1663goto stat_ref;1664else1665return NULL;1666}1667 len =read_in_full(fd, buffer,sizeof(buffer)-1);1668if(len <0) {1669int save_errno = errno;1670close(fd);1671 errno = save_errno;1672return NULL;1673}1674close(fd);1675while(len &&isspace(buffer[len-1]))1676 len--;1677 buffer[len] ='\0';16781679/*1680 * Is it a symbolic ref?1681 */1682if(!starts_with(buffer,"ref:")) {1683/*1684 * Please note that FETCH_HEAD has a second1685 * line containing other data.1686 */1687if(get_sha1_hex(buffer, sha1) ||1688(buffer[40] !='\0'&& !isspace(buffer[40]))) {1689if(flags)1690*flags |= REF_ISBROKEN;1691 errno = EINVAL;1692return NULL;1693}1694if(bad_name) {1695hashclr(sha1);1696if(flags)1697*flags |= REF_ISBROKEN;1698}1699return refname;1700}1701if(flags)1702*flags |= REF_ISSYMREF;1703 buf = buffer +4;1704while(isspace(*buf))1705 buf++;1706 refname =strcpy(refname_buffer, buf);1707if(resolve_flags & RESOLVE_REF_NO_RECURSE) {1708hashclr(sha1);1709return refname;1710}1711if(check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {1712if(flags)1713*flags |= REF_ISBROKEN;17141715if(!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1716!refname_is_safe(buf)) {1717 errno = EINVAL;1718return NULL;1719}1720 bad_name =1;1721}1722}1723}17241725const char*resolve_ref_unsafe(const char*refname,int resolve_flags,1726unsigned char*sha1,int*flags)1727{1728struct strbuf sb_path = STRBUF_INIT;1729const char*ret =resolve_ref_unsafe_1(refname, resolve_flags,1730 sha1, flags, &sb_path);1731strbuf_release(&sb_path);1732return ret;1733}17341735char*resolve_refdup(const char*refname,int resolve_flags,1736unsigned char*sha1,int*flags)1737{1738returnxstrdup_or_null(resolve_ref_unsafe(refname, resolve_flags,1739 sha1, flags));1740}17411742/* The argument to filter_refs */1743struct ref_filter {1744const char*pattern;1745 each_ref_fn *fn;1746void*cb_data;1747};17481749intread_ref_full(const char*refname,int resolve_flags,unsigned char*sha1,int*flags)1750{1751if(resolve_ref_unsafe(refname, resolve_flags, sha1, flags))1752return0;1753return-1;1754}17551756intread_ref(const char*refname,unsigned char*sha1)1757{1758returnread_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);1759}17601761intref_exists(const char*refname)1762{1763unsigned char sha1[20];1764return!!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);1765}17661767static intfilter_refs(const char*refname,const struct object_id *oid,1768int flags,void*data)1769{1770struct ref_filter *filter = (struct ref_filter *)data;17711772if(wildmatch(filter->pattern, refname,0, NULL))1773return0;1774return filter->fn(refname, oid, flags, filter->cb_data);1775}17761777enum peel_status {1778/* object was peeled successfully: */1779 PEEL_PEELED =0,17801781/*1782 * object cannot be peeled because the named object (or an1783 * object referred to by a tag in the peel chain), does not1784 * exist.1785 */1786 PEEL_INVALID = -1,17871788/* object cannot be peeled because it is not a tag: */1789 PEEL_NON_TAG = -2,17901791/* ref_entry contains no peeled value because it is a symref: */1792 PEEL_IS_SYMREF = -3,17931794/*1795 * ref_entry cannot be peeled because it is broken (i.e., the1796 * symbolic reference cannot even be resolved to an object1797 * name):1798 */1799 PEEL_BROKEN = -41800};18011802/*1803 * Peel the named object; i.e., if the object is a tag, resolve the1804 * tag recursively until a non-tag is found. If successful, store the1805 * result to sha1 and return PEEL_PEELED. If the object is not a tag1806 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,1807 * and leave sha1 unchanged.1808 */1809static enum peel_status peel_object(const unsigned char*name,unsigned char*sha1)1810{1811struct object *o =lookup_unknown_object(name);18121813if(o->type == OBJ_NONE) {1814int type =sha1_object_info(name, NULL);1815if(type <0|| !object_as_type(o, type,0))1816return PEEL_INVALID;1817}18181819if(o->type != OBJ_TAG)1820return PEEL_NON_TAG;18211822 o =deref_tag_noverify(o);1823if(!o)1824return PEEL_INVALID;18251826hashcpy(sha1, o->sha1);1827return PEEL_PEELED;1828}18291830/*1831 * Peel the entry (if possible) and return its new peel_status. If1832 * repeel is true, re-peel the entry even if there is an old peeled1833 * value that is already stored in it.1834 *1835 * It is OK to call this function with a packed reference entry that1836 * might be stale and might even refer to an object that has since1837 * been garbage-collected. In such a case, if the entry has1838 * REF_KNOWS_PEELED then leave the status unchanged and return1839 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1840 */1841static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1842{1843enum peel_status status;18441845if(entry->flag & REF_KNOWS_PEELED) {1846if(repeel) {1847 entry->flag &= ~REF_KNOWS_PEELED;1848oidclr(&entry->u.value.peeled);1849}else{1850returnis_null_oid(&entry->u.value.peeled) ?1851 PEEL_NON_TAG : PEEL_PEELED;1852}1853}1854if(entry->flag & REF_ISBROKEN)1855return PEEL_BROKEN;1856if(entry->flag & REF_ISSYMREF)1857return PEEL_IS_SYMREF;18581859 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1860if(status == PEEL_PEELED || status == PEEL_NON_TAG)1861 entry->flag |= REF_KNOWS_PEELED;1862return status;1863}18641865intpeel_ref(const char*refname,unsigned char*sha1)1866{1867int flag;1868unsigned char base[20];18691870if(current_ref && (current_ref->name == refname1871|| !strcmp(current_ref->name, refname))) {1872if(peel_entry(current_ref,0))1873return-1;1874hashcpy(sha1, current_ref->u.value.peeled.hash);1875return0;1876}18771878if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1879return-1;18801881/*1882 * If the reference is packed, read its ref_entry from the1883 * cache in the hope that we already know its peeled value.1884 * We only try this optimization on packed references because1885 * (a) forcing the filling of the loose reference cache could1886 * be expensive and (b) loose references anyway usually do not1887 * have REF_KNOWS_PEELED.1888 */1889if(flag & REF_ISPACKED) {1890struct ref_entry *r =get_packed_ref(refname);1891if(r) {1892if(peel_entry(r,0))1893return-1;1894hashcpy(sha1, r->u.value.peeled.hash);1895return0;1896}1897}18981899returnpeel_object(base, sha1);1900}19011902struct warn_if_dangling_data {1903FILE*fp;1904const char*refname;1905const struct string_list *refnames;1906const char*msg_fmt;1907};19081909static intwarn_if_dangling_symref(const char*refname,const struct object_id *oid,1910int flags,void*cb_data)1911{1912struct warn_if_dangling_data *d = cb_data;1913const char*resolves_to;1914struct object_id junk;19151916if(!(flags & REF_ISSYMREF))1917return0;19181919 resolves_to =resolve_ref_unsafe(refname,0, junk.hash, NULL);1920if(!resolves_to1921|| (d->refname1922?strcmp(resolves_to, d->refname)1923: !string_list_has_string(d->refnames, resolves_to))) {1924return0;1925}19261927fprintf(d->fp, d->msg_fmt, refname);1928fputc('\n', d->fp);1929return0;1930}19311932voidwarn_dangling_symref(FILE*fp,const char*msg_fmt,const char*refname)1933{1934struct warn_if_dangling_data data;19351936 data.fp = fp;1937 data.refname = refname;1938 data.refnames = NULL;1939 data.msg_fmt = msg_fmt;1940for_each_rawref(warn_if_dangling_symref, &data);1941}19421943voidwarn_dangling_symrefs(FILE*fp,const char*msg_fmt,const struct string_list *refnames)1944{1945struct warn_if_dangling_data data;19461947 data.fp = fp;1948 data.refname = NULL;1949 data.refnames = refnames;1950 data.msg_fmt = msg_fmt;1951for_each_rawref(warn_if_dangling_symref, &data);1952}19531954/*1955 * Call fn for each reference in the specified ref_cache, omitting1956 * references not in the containing_dir of base. fn is called for all1957 * references, including broken ones. If fn ever returns a non-zero1958 * value, stop the iteration and return that value; otherwise, return1959 * 0.1960 */1961static intdo_for_each_entry(struct ref_cache *refs,const char*base,1962 each_ref_entry_fn fn,void*cb_data)1963{1964struct packed_ref_cache *packed_ref_cache;1965struct ref_dir *loose_dir;1966struct ref_dir *packed_dir;1967int retval =0;19681969/*1970 * We must make sure that all loose refs are read before accessing the1971 * packed-refs file; this avoids a race condition in which loose refs1972 * are migrated to the packed-refs file by a simultaneous process, but1973 * our in-memory view is from before the migration. get_packed_ref_cache()1974 * takes care of making sure our view is up to date with what is on1975 * disk.1976 */1977 loose_dir =get_loose_refs(refs);1978if(base && *base) {1979 loose_dir =find_containing_dir(loose_dir, base,0);1980}1981if(loose_dir)1982prime_ref_dir(loose_dir);19831984 packed_ref_cache =get_packed_ref_cache(refs);1985acquire_packed_ref_cache(packed_ref_cache);1986 packed_dir =get_packed_ref_dir(packed_ref_cache);1987if(base && *base) {1988 packed_dir =find_containing_dir(packed_dir, base,0);1989}19901991if(packed_dir && loose_dir) {1992sort_ref_dir(packed_dir);1993sort_ref_dir(loose_dir);1994 retval =do_for_each_entry_in_dirs(1995 packed_dir, loose_dir, fn, cb_data);1996}else if(packed_dir) {1997sort_ref_dir(packed_dir);1998 retval =do_for_each_entry_in_dir(1999 packed_dir,0, fn, cb_data);2000}else if(loose_dir) {2001sort_ref_dir(loose_dir);2002 retval =do_for_each_entry_in_dir(2003 loose_dir,0, fn, cb_data);2004}20052006release_packed_ref_cache(packed_ref_cache);2007return retval;2008}20092010/*2011 * Call fn for each reference in the specified ref_cache for which the2012 * refname begins with base. If trim is non-zero, then trim that many2013 * characters off the beginning of each refname before passing the2014 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include2015 * broken references in the iteration. If fn ever returns a non-zero2016 * value, stop the iteration and return that value; otherwise, return2017 * 0.2018 */2019static intdo_for_each_ref(struct ref_cache *refs,const char*base,2020 each_ref_fn fn,int trim,int flags,void*cb_data)2021{2022struct ref_entry_cb data;2023 data.base = base;2024 data.trim = trim;2025 data.flags = flags;2026 data.fn = fn;2027 data.cb_data = cb_data;20282029if(ref_paranoia <0)2030 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);2031if(ref_paranoia)2032 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;20332034returndo_for_each_entry(refs, base, do_one_ref, &data);2035}20362037static intdo_head_ref(const char*submodule, each_ref_fn fn,void*cb_data)2038{2039struct object_id oid;2040int flag;20412042if(submodule) {2043if(resolve_gitlink_ref(submodule,"HEAD", oid.hash) ==0)2044returnfn("HEAD", &oid,0, cb_data);20452046return0;2047}20482049if(!read_ref_full("HEAD", RESOLVE_REF_READING, oid.hash, &flag))2050returnfn("HEAD", &oid, flag, cb_data);20512052return0;2053}20542055inthead_ref(each_ref_fn fn,void*cb_data)2056{2057returndo_head_ref(NULL, fn, cb_data);2058}20592060inthead_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2061{2062returndo_head_ref(submodule, fn, cb_data);2063}20642065intfor_each_ref(each_ref_fn fn,void*cb_data)2066{2067returndo_for_each_ref(&ref_cache,"", fn,0,0, cb_data);2068}20692070intfor_each_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2071{2072returndo_for_each_ref(get_ref_cache(submodule),"", fn,0,0, cb_data);2073}20742075intfor_each_ref_in(const char*prefix, each_ref_fn fn,void*cb_data)2076{2077returndo_for_each_ref(&ref_cache, prefix, fn,strlen(prefix),0, cb_data);2078}20792080intfor_each_ref_in_submodule(const char*submodule,const char*prefix,2081 each_ref_fn fn,void*cb_data)2082{2083returndo_for_each_ref(get_ref_cache(submodule), prefix, fn,strlen(prefix),0, cb_data);2084}20852086intfor_each_tag_ref(each_ref_fn fn,void*cb_data)2087{2088returnfor_each_ref_in("refs/tags/", fn, cb_data);2089}20902091intfor_each_tag_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2092{2093returnfor_each_ref_in_submodule(submodule,"refs/tags/", fn, cb_data);2094}20952096intfor_each_branch_ref(each_ref_fn fn,void*cb_data)2097{2098returnfor_each_ref_in("refs/heads/", fn, cb_data);2099}21002101intfor_each_branch_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2102{2103returnfor_each_ref_in_submodule(submodule,"refs/heads/", fn, cb_data);2104}21052106intfor_each_remote_ref(each_ref_fn fn,void*cb_data)2107{2108returnfor_each_ref_in("refs/remotes/", fn, cb_data);2109}21102111intfor_each_remote_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2112{2113returnfor_each_ref_in_submodule(submodule,"refs/remotes/", fn, cb_data);2114}21152116intfor_each_replace_ref(each_ref_fn fn,void*cb_data)2117{2118returndo_for_each_ref(&ref_cache,"refs/replace/", fn,13,0, cb_data);2119}21202121inthead_ref_namespaced(each_ref_fn fn,void*cb_data)2122{2123struct strbuf buf = STRBUF_INIT;2124int ret =0;2125struct object_id oid;2126int flag;21272128strbuf_addf(&buf,"%sHEAD",get_git_namespace());2129if(!read_ref_full(buf.buf, RESOLVE_REF_READING, oid.hash, &flag))2130 ret =fn(buf.buf, &oid, flag, cb_data);2131strbuf_release(&buf);21322133return ret;2134}21352136intfor_each_namespaced_ref(each_ref_fn fn,void*cb_data)2137{2138struct strbuf buf = STRBUF_INIT;2139int ret;2140strbuf_addf(&buf,"%srefs/",get_git_namespace());2141 ret =do_for_each_ref(&ref_cache, buf.buf, fn,0,0, cb_data);2142strbuf_release(&buf);2143return ret;2144}21452146intfor_each_glob_ref_in(each_ref_fn fn,const char*pattern,2147const char*prefix,void*cb_data)2148{2149struct strbuf real_pattern = STRBUF_INIT;2150struct ref_filter filter;2151int ret;21522153if(!prefix && !starts_with(pattern,"refs/"))2154strbuf_addstr(&real_pattern,"refs/");2155else if(prefix)2156strbuf_addstr(&real_pattern, prefix);2157strbuf_addstr(&real_pattern, pattern);21582159if(!has_glob_specials(pattern)) {2160/* Append implied '/' '*' if not present. */2161if(real_pattern.buf[real_pattern.len -1] !='/')2162strbuf_addch(&real_pattern,'/');2163/* No need to check for '*', there is none. */2164strbuf_addch(&real_pattern,'*');2165}21662167 filter.pattern = real_pattern.buf;2168 filter.fn = fn;2169 filter.cb_data = cb_data;2170 ret =for_each_ref(filter_refs, &filter);21712172strbuf_release(&real_pattern);2173return ret;2174}21752176intfor_each_glob_ref(each_ref_fn fn,const char*pattern,void*cb_data)2177{2178returnfor_each_glob_ref_in(fn, pattern, NULL, cb_data);2179}21802181intfor_each_rawref(each_ref_fn fn,void*cb_data)2182{2183returndo_for_each_ref(&ref_cache,"", fn,0,2184 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);2185}21862187const char*prettify_refname(const char*name)2188{2189return name + (2190starts_with(name,"refs/heads/") ?11:2191starts_with(name,"refs/tags/") ?10:2192starts_with(name,"refs/remotes/") ?13:21930);2194}21952196static const char*ref_rev_parse_rules[] = {2197"%.*s",2198"refs/%.*s",2199"refs/tags/%.*s",2200"refs/heads/%.*s",2201"refs/remotes/%.*s",2202"refs/remotes/%.*s/HEAD",2203 NULL2204};22052206intrefname_match(const char*abbrev_name,const char*full_name)2207{2208const char**p;2209const int abbrev_name_len =strlen(abbrev_name);22102211for(p = ref_rev_parse_rules; *p; p++) {2212if(!strcmp(full_name,mkpath(*p, abbrev_name_len, abbrev_name))) {2213return1;2214}2215}22162217return0;2218}22192220static voidunlock_ref(struct ref_lock *lock)2221{2222/* Do not free lock->lk -- atexit() still looks at them */2223if(lock->lk)2224rollback_lock_file(lock->lk);2225free(lock->ref_name);2226free(lock->orig_ref_name);2227free(lock);2228}22292230/*2231 * Verify that the reference locked by lock has the value old_sha1.2232 * Fail if the reference doesn't exist and mustexist is set. Return 02233 * on success. On error, write an error message to err, set errno, and2234 * return a negative value.2235 */2236static intverify_lock(struct ref_lock *lock,2237const unsigned char*old_sha1,int mustexist,2238struct strbuf *err)2239{2240assert(err);22412242if(read_ref_full(lock->ref_name,2243 mustexist ? RESOLVE_REF_READING :0,2244 lock->old_oid.hash, NULL)) {2245int save_errno = errno;2246strbuf_addf(err,"can't verify ref%s", lock->ref_name);2247 errno = save_errno;2248return-1;2249}2250if(hashcmp(lock->old_oid.hash, old_sha1)) {2251strbuf_addf(err,"ref%sis at%sbut expected%s",2252 lock->ref_name,2253sha1_to_hex(lock->old_oid.hash),2254sha1_to_hex(old_sha1));2255 errno = EBUSY;2256return-1;2257}2258return0;2259}22602261static intremove_empty_directories(const char*file)2262{2263/* we want to create a file but there is a directory there;2264 * if that is an empty directory (or a directory that contains2265 * only empty directories), remove them.2266 */2267struct strbuf path;2268int result, save_errno;22692270strbuf_init(&path,20);2271strbuf_addstr(&path, file);22722273 result =remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);2274 save_errno = errno;22752276strbuf_release(&path);2277 errno = save_errno;22782279return result;2280}22812282/*2283 * *string and *len will only be substituted, and *string returned (for2284 * later free()ing) if the string passed in is a magic short-hand form2285 * to name a branch.2286 */2287static char*substitute_branch_name(const char**string,int*len)2288{2289struct strbuf buf = STRBUF_INIT;2290int ret =interpret_branch_name(*string, *len, &buf);22912292if(ret == *len) {2293size_t size;2294*string =strbuf_detach(&buf, &size);2295*len = size;2296return(char*)*string;2297}22982299return NULL;2300}23012302intdwim_ref(const char*str,int len,unsigned char*sha1,char**ref)2303{2304char*last_branch =substitute_branch_name(&str, &len);2305const char**p, *r;2306int refs_found =0;23072308*ref = NULL;2309for(p = ref_rev_parse_rules; *p; p++) {2310char fullref[PATH_MAX];2311unsigned char sha1_from_ref[20];2312unsigned char*this_result;2313int flag;23142315 this_result = refs_found ? sha1_from_ref : sha1;2316mksnpath(fullref,sizeof(fullref), *p, len, str);2317 r =resolve_ref_unsafe(fullref, RESOLVE_REF_READING,2318 this_result, &flag);2319if(r) {2320if(!refs_found++)2321*ref =xstrdup(r);2322if(!warn_ambiguous_refs)2323break;2324}else if((flag & REF_ISSYMREF) &&strcmp(fullref,"HEAD")) {2325warning("ignoring dangling symref%s.", fullref);2326}else if((flag & REF_ISBROKEN) &&strchr(fullref,'/')) {2327warning("ignoring broken ref%s.", fullref);2328}2329}2330free(last_branch);2331return refs_found;2332}23332334intdwim_log(const char*str,int len,unsigned char*sha1,char**log)2335{2336char*last_branch =substitute_branch_name(&str, &len);2337const char**p;2338int logs_found =0;23392340*log = NULL;2341for(p = ref_rev_parse_rules; *p; p++) {2342unsigned char hash[20];2343char path[PATH_MAX];2344const char*ref, *it;23452346mksnpath(path,sizeof(path), *p, len, str);2347 ref =resolve_ref_unsafe(path, RESOLVE_REF_READING,2348 hash, NULL);2349if(!ref)2350continue;2351if(reflog_exists(path))2352 it = path;2353else if(strcmp(ref, path) &&reflog_exists(ref))2354 it = ref;2355else2356continue;2357if(!logs_found++) {2358*log =xstrdup(it);2359hashcpy(sha1, hash);2360}2361if(!warn_ambiguous_refs)2362break;2363}2364free(last_branch);2365return logs_found;2366}23672368/*2369 * Locks a ref returning the lock on success and NULL on failure.2370 * On failure errno is set to something meaningful.2371 */2372static struct ref_lock *lock_ref_sha1_basic(const char*refname,2373const unsigned char*old_sha1,2374const struct string_list *extras,2375const struct string_list *skip,2376unsigned int flags,int*type_p,2377struct strbuf *err)2378{2379const char*ref_file;2380const char*orig_refname = refname;2381struct ref_lock *lock;2382int last_errno =0;2383int type, lflags;2384int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2385int resolve_flags =0;2386int attempts_remaining =3;23872388assert(err);23892390 lock =xcalloc(1,sizeof(struct ref_lock));23912392if(mustexist)2393 resolve_flags |= RESOLVE_REF_READING;2394if(flags & REF_DELETING) {2395 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;2396if(flags & REF_NODEREF)2397 resolve_flags |= RESOLVE_REF_NO_RECURSE;2398}23992400 refname =resolve_ref_unsafe(refname, resolve_flags,2401 lock->old_oid.hash, &type);2402if(!refname && errno == EISDIR) {2403/* we are trying to lock foo but we used to2404 * have foo/bar which now does not exist;2405 * it is normal for the empty directory 'foo'2406 * to remain.2407 */2408 ref_file =git_path("%s", orig_refname);2409if(remove_empty_directories(ref_file)) {2410 last_errno = errno;24112412if(!verify_refname_available(orig_refname, extras, skip,2413get_loose_refs(&ref_cache), err))2414strbuf_addf(err,"there are still refs under '%s'",2415 orig_refname);24162417goto error_return;2418}2419 refname =resolve_ref_unsafe(orig_refname, resolve_flags,2420 lock->old_oid.hash, &type);2421}2422if(type_p)2423*type_p = type;2424if(!refname) {2425 last_errno = errno;2426if(last_errno != ENOTDIR ||2427!verify_refname_available(orig_refname, extras, skip,2428get_loose_refs(&ref_cache), err))2429strbuf_addf(err,"unable to resolve reference%s:%s",2430 orig_refname,strerror(last_errno));24312432goto error_return;2433}2434/*2435 * If the ref did not exist and we are creating it, make sure2436 * there is no existing packed ref whose name begins with our2437 * refname, nor a packed ref whose name is a proper prefix of2438 * our refname.2439 */2440if(is_null_oid(&lock->old_oid) &&2441verify_refname_available(refname, extras, skip,2442get_packed_refs(&ref_cache), err)) {2443 last_errno = ENOTDIR;2444goto error_return;2445}24462447 lock->lk =xcalloc(1,sizeof(struct lock_file));24482449 lflags =0;2450if(flags & REF_NODEREF) {2451 refname = orig_refname;2452 lflags |= LOCK_NO_DEREF;2453}2454 lock->ref_name =xstrdup(refname);2455 lock->orig_ref_name =xstrdup(orig_refname);2456 ref_file =git_path("%s", refname);24572458 retry:2459switch(safe_create_leading_directories_const(ref_file)) {2460case SCLD_OK:2461break;/* success */2462case SCLD_VANISHED:2463if(--attempts_remaining >0)2464goto retry;2465/* fall through */2466default:2467 last_errno = errno;2468strbuf_addf(err,"unable to create directory for%s", ref_file);2469goto error_return;2470}24712472if(hold_lock_file_for_update(lock->lk, ref_file, lflags) <0) {2473 last_errno = errno;2474if(errno == ENOENT && --attempts_remaining >0)2475/*2476 * Maybe somebody just deleted one of the2477 * directories leading to ref_file. Try2478 * again:2479 */2480goto retry;2481else{2482unable_to_lock_message(ref_file, errno, err);2483goto error_return;2484}2485}2486if(old_sha1 &&verify_lock(lock, old_sha1, mustexist, err)) {2487 last_errno = errno;2488goto error_return;2489}2490return lock;24912492 error_return:2493unlock_ref(lock);2494 errno = last_errno;2495return NULL;2496}24972498/*2499 * Write an entry to the packed-refs file for the specified refname.2500 * If peeled is non-NULL, write it as the entry's peeled value.2501 */2502static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2503unsigned char*peeled)2504{2505fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2506if(peeled)2507fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2508}25092510/*2511 * An each_ref_entry_fn that writes the entry to a packed-refs file.2512 */2513static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2514{2515enum peel_status peel_status =peel_entry(entry,0);25162517if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2518error("internal error:%sis not a valid packed reference!",2519 entry->name);2520write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2521 peel_status == PEEL_PEELED ?2522 entry->u.value.peeled.hash : NULL);2523return0;2524}25252526/*2527 * Lock the packed-refs file for writing. Flags is passed to2528 * hold_lock_file_for_update(). Return 0 on success. On errors, set2529 * errno appropriately and return a nonzero value.2530 */2531static intlock_packed_refs(int flags)2532{2533static int timeout_configured =0;2534static int timeout_value =1000;25352536struct packed_ref_cache *packed_ref_cache;25372538if(!timeout_configured) {2539git_config_get_int("core.packedrefstimeout", &timeout_value);2540 timeout_configured =1;2541}25422543if(hold_lock_file_for_update_timeout(2544&packlock,git_path("packed-refs"),2545 flags, timeout_value) <0)2546return-1;2547/*2548 * Get the current packed-refs while holding the lock. If the2549 * packed-refs file has been modified since we last read it,2550 * this will automatically invalidate the cache and re-read2551 * the packed-refs file.2552 */2553 packed_ref_cache =get_packed_ref_cache(&ref_cache);2554 packed_ref_cache->lock = &packlock;2555/* Increment the reference count to prevent it from being freed: */2556acquire_packed_ref_cache(packed_ref_cache);2557return0;2558}25592560/*2561 * Write the current version of the packed refs cache from memory to2562 * disk. The packed-refs file must already be locked for writing (see2563 * lock_packed_refs()). Return zero on success. On errors, set errno2564 * and return a nonzero value2565 */2566static intcommit_packed_refs(void)2567{2568struct packed_ref_cache *packed_ref_cache =2569get_packed_ref_cache(&ref_cache);2570int error =0;2571int save_errno =0;2572FILE*out;25732574if(!packed_ref_cache->lock)2575die("internal error: packed-refs not locked");25762577 out =fdopen_lock_file(packed_ref_cache->lock,"w");2578if(!out)2579die_errno("unable to fdopen packed-refs descriptor");25802581fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2582do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),25830, write_packed_entry_fn, out);25842585if(commit_lock_file(packed_ref_cache->lock)) {2586 save_errno = errno;2587 error = -1;2588}2589 packed_ref_cache->lock = NULL;2590release_packed_ref_cache(packed_ref_cache);2591 errno = save_errno;2592return error;2593}25942595/*2596 * Rollback the lockfile for the packed-refs file, and discard the2597 * in-memory packed reference cache. (The packed-refs file will be2598 * read anew if it is needed again after this function is called.)2599 */2600static voidrollback_packed_refs(void)2601{2602struct packed_ref_cache *packed_ref_cache =2603get_packed_ref_cache(&ref_cache);26042605if(!packed_ref_cache->lock)2606die("internal error: packed-refs not locked");2607rollback_lock_file(packed_ref_cache->lock);2608 packed_ref_cache->lock = NULL;2609release_packed_ref_cache(packed_ref_cache);2610clear_packed_ref_cache(&ref_cache);2611}26122613struct ref_to_prune {2614struct ref_to_prune *next;2615unsigned char sha1[20];2616char name[FLEX_ARRAY];2617};26182619struct pack_refs_cb_data {2620unsigned int flags;2621struct ref_dir *packed_refs;2622struct ref_to_prune *ref_to_prune;2623};26242625/*2626 * An each_ref_entry_fn that is run over loose references only. If2627 * the loose reference can be packed, add an entry in the packed ref2628 * cache. If the reference should be pruned, also add it to2629 * ref_to_prune in the pack_refs_cb_data.2630 */2631static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2632{2633struct pack_refs_cb_data *cb = cb_data;2634enum peel_status peel_status;2635struct ref_entry *packed_entry;2636int is_tag_ref =starts_with(entry->name,"refs/tags/");26372638/* ALWAYS pack tags */2639if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2640return0;26412642/* Do not pack symbolic or broken refs: */2643if((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2644return0;26452646/* Add a packed ref cache entry equivalent to the loose entry. */2647 peel_status =peel_entry(entry,1);2648if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2649die("internal error peeling reference%s(%s)",2650 entry->name,oid_to_hex(&entry->u.value.oid));2651 packed_entry =find_ref(cb->packed_refs, entry->name);2652if(packed_entry) {2653/* Overwrite existing packed entry with info from loose entry */2654 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2655oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2656}else{2657 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2658 REF_ISPACKED | REF_KNOWS_PEELED,0);2659add_ref(cb->packed_refs, packed_entry);2660}2661oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);26622663/* Schedule the loose reference for pruning if requested. */2664if((cb->flags & PACK_REFS_PRUNE)) {2665int namelen =strlen(entry->name) +1;2666struct ref_to_prune *n =xcalloc(1,sizeof(*n) + namelen);2667hashcpy(n->sha1, entry->u.value.oid.hash);2668strcpy(n->name, entry->name);2669 n->next = cb->ref_to_prune;2670 cb->ref_to_prune = n;2671}2672return0;2673}26742675/*2676 * Remove empty parents, but spare refs/ and immediate subdirs.2677 * Note: munges *name.2678 */2679static voidtry_remove_empty_parents(char*name)2680{2681char*p, *q;2682int i;2683 p = name;2684for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2685while(*p && *p !='/')2686 p++;2687/* tolerate duplicate slashes; see check_refname_format() */2688while(*p =='/')2689 p++;2690}2691for(q = p; *q; q++)2692;2693while(1) {2694while(q > p && *q !='/')2695 q--;2696while(q > p && *(q-1) =='/')2697 q--;2698if(q == p)2699break;2700*q ='\0';2701if(rmdir(git_path("%s", name)))2702break;2703}2704}27052706/* make sure nobody touched the ref, and unlink */2707static voidprune_ref(struct ref_to_prune *r)2708{2709struct ref_transaction *transaction;2710struct strbuf err = STRBUF_INIT;27112712if(check_refname_format(r->name,0))2713return;27142715 transaction =ref_transaction_begin(&err);2716if(!transaction ||2717ref_transaction_delete(transaction, r->name, r->sha1,2718 REF_ISPRUNING, NULL, &err) ||2719ref_transaction_commit(transaction, &err)) {2720ref_transaction_free(transaction);2721error("%s", err.buf);2722strbuf_release(&err);2723return;2724}2725ref_transaction_free(transaction);2726strbuf_release(&err);2727try_remove_empty_parents(r->name);2728}27292730static voidprune_refs(struct ref_to_prune *r)2731{2732while(r) {2733prune_ref(r);2734 r = r->next;2735}2736}27372738intpack_refs(unsigned int flags)2739{2740struct pack_refs_cb_data cbdata;27412742memset(&cbdata,0,sizeof(cbdata));2743 cbdata.flags = flags;27442745lock_packed_refs(LOCK_DIE_ON_ERROR);2746 cbdata.packed_refs =get_packed_refs(&ref_cache);27472748do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2749 pack_if_possible_fn, &cbdata);27502751if(commit_packed_refs())2752die_errno("unable to overwrite old ref-pack file");27532754prune_refs(cbdata.ref_to_prune);2755return0;2756}27572758/*2759 * Rewrite the packed-refs file, omitting any refs listed in2760 * 'refnames'. On error, leave packed-refs unchanged, write an error2761 * message to 'err', and return a nonzero value.2762 *2763 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2764 */2765static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2766{2767struct ref_dir *packed;2768struct string_list_item *refname;2769int ret, needs_repacking =0, removed =0;27702771assert(err);27722773/* Look for a packed ref */2774for_each_string_list_item(refname, refnames) {2775if(get_packed_ref(refname->string)) {2776 needs_repacking =1;2777break;2778}2779}27802781/* Avoid locking if we have nothing to do */2782if(!needs_repacking)2783return0;/* no refname exists in packed refs */27842785if(lock_packed_refs(0)) {2786unable_to_lock_message(git_path("packed-refs"), errno, err);2787return-1;2788}2789 packed =get_packed_refs(&ref_cache);27902791/* Remove refnames from the cache */2792for_each_string_list_item(refname, refnames)2793if(remove_entry(packed, refname->string) != -1)2794 removed =1;2795if(!removed) {2796/*2797 * All packed entries disappeared while we were2798 * acquiring the lock.2799 */2800rollback_packed_refs();2801return0;2802}28032804/* Write what remains */2805 ret =commit_packed_refs();2806if(ret)2807strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2808strerror(errno));2809return ret;2810}28112812static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2813{2814assert(err);28152816if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2817/*2818 * loose. The loose file name is the same as the2819 * lockfile name, minus ".lock":2820 */2821char*loose_filename =get_locked_file_path(lock->lk);2822int res =unlink_or_msg(loose_filename, err);2823free(loose_filename);2824if(res)2825return1;2826}2827return0;2828}28292830intdelete_ref(const char*refname,const unsigned char*old_sha1,2831unsigned int flags)2832{2833struct ref_transaction *transaction;2834struct strbuf err = STRBUF_INIT;28352836 transaction =ref_transaction_begin(&err);2837if(!transaction ||2838ref_transaction_delete(transaction, refname, old_sha1,2839 flags, NULL, &err) ||2840ref_transaction_commit(transaction, &err)) {2841error("%s", err.buf);2842ref_transaction_free(transaction);2843strbuf_release(&err);2844return1;2845}2846ref_transaction_free(transaction);2847strbuf_release(&err);2848return0;2849}28502851intdelete_refs(struct string_list *refnames)2852{2853struct strbuf err = STRBUF_INIT;2854int i, result =0;28552856if(!refnames->nr)2857return0;28582859 result =repack_without_refs(refnames, &err);2860if(result) {2861/*2862 * If we failed to rewrite the packed-refs file, then2863 * it is unsafe to try to remove loose refs, because2864 * doing so might expose an obsolete packed value for2865 * a reference that might even point at an object that2866 * has been garbage collected.2867 */2868if(refnames->nr ==1)2869error(_("could not delete reference%s:%s"),2870 refnames->items[0].string, err.buf);2871else2872error(_("could not delete references:%s"), err.buf);28732874goto out;2875}28762877for(i =0; i < refnames->nr; i++) {2878const char*refname = refnames->items[i].string;28792880if(delete_ref(refname, NULL,0))2881 result |=error(_("could not remove reference%s"), refname);2882}28832884out:2885strbuf_release(&err);2886return result;2887}28882889/*2890 * People using contrib's git-new-workdir have .git/logs/refs ->2891 * /some/other/path/.git/logs/refs, and that may live on another device.2892 *2893 * IOW, to avoid cross device rename errors, the temporary renamed log must2894 * live into logs/refs.2895 */2896#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"28972898static intrename_tmp_log(const char*newrefname)2899{2900int attempts_remaining =4;29012902 retry:2903switch(safe_create_leading_directories_const(git_path("logs/%s", newrefname))) {2904case SCLD_OK:2905break;/* success */2906case SCLD_VANISHED:2907if(--attempts_remaining >0)2908goto retry;2909/* fall through */2910default:2911error("unable to create directory for%s", newrefname);2912return-1;2913}29142915if(rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", newrefname))) {2916if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2917/*2918 * rename(a, b) when b is an existing2919 * directory ought to result in ISDIR, but2920 * Solaris 5.8 gives ENOTDIR. Sheesh.2921 */2922if(remove_empty_directories(git_path("logs/%s", newrefname))) {2923error("Directory not empty: logs/%s", newrefname);2924return-1;2925}2926goto retry;2927}else if(errno == ENOENT && --attempts_remaining >0) {2928/*2929 * Maybe another process just deleted one of2930 * the directories in the path to newrefname.2931 * Try again from the beginning.2932 */2933goto retry;2934}else{2935error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2936 newrefname,strerror(errno));2937return-1;2938}2939}2940return0;2941}29422943static intrename_ref_available(const char*oldname,const char*newname)2944{2945struct string_list skip = STRING_LIST_INIT_NODUP;2946struct strbuf err = STRBUF_INIT;2947int ret;29482949string_list_insert(&skip, oldname);2950 ret = !verify_refname_available(newname, NULL, &skip,2951get_packed_refs(&ref_cache), &err)2952&& !verify_refname_available(newname, NULL, &skip,2953get_loose_refs(&ref_cache), &err);2954if(!ret)2955error("%s", err.buf);29562957string_list_clear(&skip,0);2958strbuf_release(&err);2959return ret;2960}29612962static intwrite_ref_to_lockfile(struct ref_lock *lock,const unsigned char*sha1);2963static intcommit_ref_update(struct ref_lock *lock,2964const unsigned char*sha1,const char*logmsg);29652966intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2967{2968unsigned char sha1[20], orig_sha1[20];2969int flag =0, logmoved =0;2970struct ref_lock *lock;2971struct stat loginfo;2972int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2973const char*symref = NULL;2974struct strbuf err = STRBUF_INIT;29752976if(log &&S_ISLNK(loginfo.st_mode))2977returnerror("reflog for%sis a symlink", oldrefname);29782979 symref =resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,2980 orig_sha1, &flag);2981if(flag & REF_ISSYMREF)2982returnerror("refname%sis a symbolic ref, renaming it is not supported",2983 oldrefname);2984if(!symref)2985returnerror("refname%snot found", oldrefname);29862987if(!rename_ref_available(oldrefname, newrefname))2988return1;29892990if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2991returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2992 oldrefname,strerror(errno));29932994if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2995error("unable to delete old%s", oldrefname);2996goto rollback;2997}29982999if(!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&3000delete_ref(newrefname, sha1, REF_NODEREF)) {3001if(errno==EISDIR) {3002if(remove_empty_directories(git_path("%s", newrefname))) {3003error("Directory not empty:%s", newrefname);3004goto rollback;3005}3006}else{3007error("unable to delete existing%s", newrefname);3008goto rollback;3009}3010}30113012if(log &&rename_tmp_log(newrefname))3013goto rollback;30143015 logmoved = log;30163017 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL,0, NULL, &err);3018if(!lock) {3019error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);3020strbuf_release(&err);3021goto rollback;3022}3023hashcpy(lock->old_oid.hash, orig_sha1);30243025if(write_ref_to_lockfile(lock, orig_sha1) ||3026commit_ref_update(lock, orig_sha1, logmsg)) {3027error("unable to write current sha1 into%s", newrefname);3028goto rollback;3029}30303031return0;30323033 rollback:3034 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL,0, NULL, &err);3035if(!lock) {3036error("unable to lock%sfor rollback:%s", oldrefname, err.buf);3037strbuf_release(&err);3038goto rollbacklog;3039}30403041 flag = log_all_ref_updates;3042 log_all_ref_updates =0;3043if(write_ref_to_lockfile(lock, orig_sha1) ||3044commit_ref_update(lock, orig_sha1, NULL))3045error("unable to write current sha1 into%s", oldrefname);3046 log_all_ref_updates = flag;30473048 rollbacklog:3049if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))3050error("unable to restore logfile%sfrom%s:%s",3051 oldrefname, newrefname,strerror(errno));3052if(!logmoved && log &&3053rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))3054error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",3055 oldrefname,strerror(errno));30563057return1;3058}30593060static intclose_ref(struct ref_lock *lock)3061{3062if(close_lock_file(lock->lk))3063return-1;3064return0;3065}30663067static intcommit_ref(struct ref_lock *lock)3068{3069if(commit_lock_file(lock->lk))3070return-1;3071return0;3072}30733074/*3075 * copy the reflog message msg to buf, which has been allocated sufficiently3076 * large, while cleaning up the whitespaces. Especially, convert LF to space,3077 * because reflog file is one line per entry.3078 */3079static intcopy_msg(char*buf,const char*msg)3080{3081char*cp = buf;3082char c;3083int wasspace =1;30843085*cp++ ='\t';3086while((c = *msg++)) {3087if(wasspace &&isspace(c))3088continue;3089 wasspace =isspace(c);3090if(wasspace)3091 c =' ';3092*cp++ = c;3093}3094while(buf < cp &&isspace(cp[-1]))3095 cp--;3096*cp++ ='\n';3097return cp - buf;3098}30993100/* This function must set a meaningful errno on failure */3101intlog_ref_setup(const char*refname,struct strbuf *sb_logfile)3102{3103int logfd, oflags = O_APPEND | O_WRONLY;3104char*logfile;31053106strbuf_git_path(sb_logfile,"logs/%s", refname);3107 logfile = sb_logfile->buf;3108/* make sure the rest of the function can't change "logfile" */3109 sb_logfile = NULL;3110if(log_all_ref_updates &&3111(starts_with(refname,"refs/heads/") ||3112starts_with(refname,"refs/remotes/") ||3113starts_with(refname,"refs/notes/") ||3114!strcmp(refname,"HEAD"))) {3115if(safe_create_leading_directories(logfile) <0) {3116int save_errno = errno;3117error("unable to create directory for%s", logfile);3118 errno = save_errno;3119return-1;3120}3121 oflags |= O_CREAT;3122}31233124 logfd =open(logfile, oflags,0666);3125if(logfd <0) {3126if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))3127return0;31283129if(errno == EISDIR) {3130if(remove_empty_directories(logfile)) {3131int save_errno = errno;3132error("There are still logs under '%s'",3133 logfile);3134 errno = save_errno;3135return-1;3136}3137 logfd =open(logfile, oflags,0666);3138}31393140if(logfd <0) {3141int save_errno = errno;3142error("Unable to append to%s:%s", logfile,3143strerror(errno));3144 errno = save_errno;3145return-1;3146}3147}31483149adjust_shared_perm(logfile);3150close(logfd);3151return0;3152}31533154static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,3155const unsigned char*new_sha1,3156const char*committer,const char*msg)3157{3158int msglen, written;3159unsigned maxlen, len;3160char*logrec;31613162 msglen = msg ?strlen(msg) :0;3163 maxlen =strlen(committer) + msglen +100;3164 logrec =xmalloc(maxlen);3165 len =sprintf(logrec,"%s %s %s\n",3166sha1_to_hex(old_sha1),3167sha1_to_hex(new_sha1),3168 committer);3169if(msglen)3170 len +=copy_msg(logrec + len -1, msg) -1;31713172 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;3173free(logrec);3174if(written != len)3175return-1;31763177return0;3178}31793180static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,3181const unsigned char*new_sha1,const char*msg,3182struct strbuf *sb_log_file)3183{3184int logfd, result, oflags = O_APPEND | O_WRONLY;3185char*log_file;31863187if(log_all_ref_updates <0)3188 log_all_ref_updates = !is_bare_repository();31893190 result =log_ref_setup(refname, sb_log_file);3191if(result)3192return result;3193 log_file = sb_log_file->buf;3194/* make sure the rest of the function can't change "log_file" */3195 sb_log_file = NULL;31963197 logfd =open(log_file, oflags);3198if(logfd <0)3199return0;3200 result =log_ref_write_fd(logfd, old_sha1, new_sha1,3201git_committer_info(0), msg);3202if(result) {3203int save_errno = errno;3204close(logfd);3205error("Unable to append to%s", log_file);3206 errno = save_errno;3207return-1;3208}3209if(close(logfd)) {3210int save_errno = errno;3211error("Unable to append to%s", log_file);3212 errno = save_errno;3213return-1;3214}3215return0;3216}32173218static intlog_ref_write(const char*refname,const unsigned char*old_sha1,3219const unsigned char*new_sha1,const char*msg)3220{3221struct strbuf sb = STRBUF_INIT;3222int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb);3223strbuf_release(&sb);3224return ret;3225}32263227intis_branch(const char*refname)3228{3229return!strcmp(refname,"HEAD") ||starts_with(refname,"refs/heads/");3230}32313232/*3233 * Write sha1 into the open lockfile, then close the lockfile. On3234 * errors, rollback the lockfile and set errno to reflect the problem.3235 */3236static intwrite_ref_to_lockfile(struct ref_lock *lock,3237const unsigned char*sha1)3238{3239static char term ='\n';3240struct object *o;32413242 o =parse_object(sha1);3243if(!o) {3244error("Trying to write ref%swith nonexistent object%s",3245 lock->ref_name,sha1_to_hex(sha1));3246unlock_ref(lock);3247 errno = EINVAL;3248return-1;3249}3250if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {3251error("Trying to write non-commit object%sto branch%s",3252sha1_to_hex(sha1), lock->ref_name);3253unlock_ref(lock);3254 errno = EINVAL;3255return-1;3256}3257if(write_in_full(lock->lk->fd,sha1_to_hex(sha1),40) !=40||3258write_in_full(lock->lk->fd, &term,1) !=1||3259close_ref(lock) <0) {3260int save_errno = errno;3261error("Couldn't write%s", lock->lk->filename.buf);3262unlock_ref(lock);3263 errno = save_errno;3264return-1;3265}3266return0;3267}32683269/*3270 * Commit a change to a loose reference that has already been written3271 * to the loose reference lockfile. Also update the reflogs if3272 * necessary, using the specified lockmsg (which can be NULL).3273 */3274static intcommit_ref_update(struct ref_lock *lock,3275const unsigned char*sha1,const char*logmsg)3276{3277clear_loose_ref_cache(&ref_cache);3278if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg) <0||3279(strcmp(lock->ref_name, lock->orig_ref_name) &&3280log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg) <0)) {3281unlock_ref(lock);3282return-1;3283}3284if(strcmp(lock->orig_ref_name,"HEAD") !=0) {3285/*3286 * Special hack: If a branch is updated directly and HEAD3287 * points to it (may happen on the remote side of a push3288 * for example) then logically the HEAD reflog should be3289 * updated too.3290 * A generic solution implies reverse symref information,3291 * but finding all symrefs pointing to the given branch3292 * would be rather costly for this rare event (the direct3293 * update of a branch) to be worth it. So let's cheat and3294 * check with HEAD only which should cover 99% of all usage3295 * scenarios (even 100% of the default ones).3296 */3297unsigned char head_sha1[20];3298int head_flag;3299const char*head_ref;3300 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3301 head_sha1, &head_flag);3302if(head_ref && (head_flag & REF_ISSYMREF) &&3303!strcmp(head_ref, lock->ref_name))3304log_ref_write("HEAD", lock->old_oid.hash, sha1, logmsg);3305}3306if(commit_ref(lock)) {3307error("Couldn't set%s", lock->ref_name);3308unlock_ref(lock);3309return-1;3310}3311unlock_ref(lock);3312return0;3313}33143315intcreate_symref(const char*ref_target,const char*refs_heads_master,3316const char*logmsg)3317{3318const char*lockpath;3319char ref[1000];3320int fd, len, written;3321char*git_HEAD =git_pathdup("%s", ref_target);3322unsigned char old_sha1[20], new_sha1[20];33233324if(logmsg &&read_ref(ref_target, old_sha1))3325hashclr(old_sha1);33263327if(safe_create_leading_directories(git_HEAD) <0)3328returnerror("unable to create directory for%s", git_HEAD);33293330#ifndef NO_SYMLINK_HEAD3331if(prefer_symlink_refs) {3332unlink(git_HEAD);3333if(!symlink(refs_heads_master, git_HEAD))3334goto done;3335fprintf(stderr,"no symlink - falling back to symbolic ref\n");3336}3337#endif33383339 len =snprintf(ref,sizeof(ref),"ref:%s\n", refs_heads_master);3340if(sizeof(ref) <= len) {3341error("refname too long:%s", refs_heads_master);3342goto error_free_return;3343}3344 lockpath =mkpath("%s.lock", git_HEAD);3345 fd =open(lockpath, O_CREAT | O_EXCL | O_WRONLY,0666);3346if(fd <0) {3347error("Unable to open%sfor writing", lockpath);3348goto error_free_return;3349}3350 written =write_in_full(fd, ref, len);3351if(close(fd) !=0|| written != len) {3352error("Unable to write to%s", lockpath);3353goto error_unlink_return;3354}3355if(rename(lockpath, git_HEAD) <0) {3356error("Unable to create%s", git_HEAD);3357goto error_unlink_return;3358}3359if(adjust_shared_perm(git_HEAD)) {3360error("Unable to fix permissions on%s", lockpath);3361 error_unlink_return:3362unlink_or_warn(lockpath);3363 error_free_return:3364free(git_HEAD);3365return-1;3366}33673368#ifndef NO_SYMLINK_HEAD3369 done:3370#endif3371if(logmsg && !read_ref(refs_heads_master, new_sha1))3372log_ref_write(ref_target, old_sha1, new_sha1, logmsg);33733374free(git_HEAD);3375return0;3376}33773378struct read_ref_at_cb {3379const char*refname;3380unsigned long at_time;3381int cnt;3382int reccnt;3383unsigned char*sha1;3384int found_it;33853386unsigned char osha1[20];3387unsigned char nsha1[20];3388int tz;3389unsigned long date;3390char**msg;3391unsigned long*cutoff_time;3392int*cutoff_tz;3393int*cutoff_cnt;3394};33953396static intread_ref_at_ent(unsigned char*osha1,unsigned char*nsha1,3397const char*email,unsigned long timestamp,int tz,3398const char*message,void*cb_data)3399{3400struct read_ref_at_cb *cb = cb_data;34013402 cb->reccnt++;3403 cb->tz = tz;3404 cb->date = timestamp;34053406if(timestamp <= cb->at_time || cb->cnt ==0) {3407if(cb->msg)3408*cb->msg =xstrdup(message);3409if(cb->cutoff_time)3410*cb->cutoff_time = timestamp;3411if(cb->cutoff_tz)3412*cb->cutoff_tz = tz;3413if(cb->cutoff_cnt)3414*cb->cutoff_cnt = cb->reccnt -1;3415/*3416 * we have not yet updated cb->[n|o]sha1 so they still3417 * hold the values for the previous record.3418 */3419if(!is_null_sha1(cb->osha1)) {3420hashcpy(cb->sha1, nsha1);3421if(hashcmp(cb->osha1, nsha1))3422warning("Log for ref%shas gap after%s.",3423 cb->refname,show_date(cb->date, cb->tz, DATE_RFC2822));3424}3425else if(cb->date == cb->at_time)3426hashcpy(cb->sha1, nsha1);3427else if(hashcmp(nsha1, cb->sha1))3428warning("Log for ref%sunexpectedly ended on%s.",3429 cb->refname,show_date(cb->date, cb->tz,3430 DATE_RFC2822));3431hashcpy(cb->osha1, osha1);3432hashcpy(cb->nsha1, nsha1);3433 cb->found_it =1;3434return1;3435}3436hashcpy(cb->osha1, osha1);3437hashcpy(cb->nsha1, nsha1);3438if(cb->cnt >0)3439 cb->cnt--;3440return0;3441}34423443static intread_ref_at_ent_oldest(unsigned char*osha1,unsigned char*nsha1,3444const char*email,unsigned long timestamp,3445int tz,const char*message,void*cb_data)3446{3447struct read_ref_at_cb *cb = cb_data;34483449if(cb->msg)3450*cb->msg =xstrdup(message);3451if(cb->cutoff_time)3452*cb->cutoff_time = timestamp;3453if(cb->cutoff_tz)3454*cb->cutoff_tz = tz;3455if(cb->cutoff_cnt)3456*cb->cutoff_cnt = cb->reccnt;3457hashcpy(cb->sha1, osha1);3458if(is_null_sha1(cb->sha1))3459hashcpy(cb->sha1, nsha1);3460/* We just want the first entry */3461return1;3462}34633464intread_ref_at(const char*refname,unsigned int flags,unsigned long at_time,int cnt,3465unsigned char*sha1,char**msg,3466unsigned long*cutoff_time,int*cutoff_tz,int*cutoff_cnt)3467{3468struct read_ref_at_cb cb;34693470memset(&cb,0,sizeof(cb));3471 cb.refname = refname;3472 cb.at_time = at_time;3473 cb.cnt = cnt;3474 cb.msg = msg;3475 cb.cutoff_time = cutoff_time;3476 cb.cutoff_tz = cutoff_tz;3477 cb.cutoff_cnt = cutoff_cnt;3478 cb.sha1 = sha1;34793480for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);34813482if(!cb.reccnt) {3483if(flags & GET_SHA1_QUIETLY)3484exit(128);3485else3486die("Log for%sis empty.", refname);3487}3488if(cb.found_it)3489return0;34903491for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);34923493return1;3494}34953496intreflog_exists(const char*refname)3497{3498struct stat st;34993500return!lstat(git_path("logs/%s", refname), &st) &&3501S_ISREG(st.st_mode);3502}35033504intdelete_reflog(const char*refname)3505{3506returnremove_path(git_path("logs/%s", refname));3507}35083509static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3510{3511unsigned char osha1[20], nsha1[20];3512char*email_end, *message;3513unsigned long timestamp;3514int tz;35153516/* old SP new SP name <email> SP time TAB msg LF */3517if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3518get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3519get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3520!(email_end =strchr(sb->buf +82,'>')) ||3521 email_end[1] !=' '||3522!(timestamp =strtoul(email_end +2, &message,10)) ||3523!message || message[0] !=' '||3524(message[1] !='+'&& message[1] !='-') ||3525!isdigit(message[2]) || !isdigit(message[3]) ||3526!isdigit(message[4]) || !isdigit(message[5]))3527return0;/* corrupt? */3528 email_end[1] ='\0';3529 tz =strtol(message +1, NULL,10);3530if(message[6] !='\t')3531 message +=6;3532else3533 message +=7;3534returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3535}35363537static char*find_beginning_of_line(char*bob,char*scan)3538{3539while(bob < scan && *(--scan) !='\n')3540;/* keep scanning backwards */3541/*3542 * Return either beginning of the buffer, or LF at the end of3543 * the previous line.3544 */3545return scan;3546}35473548intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)3549{3550struct strbuf sb = STRBUF_INIT;3551FILE*logfp;3552long pos;3553int ret =0, at_tail =1;35543555 logfp =fopen(git_path("logs/%s", refname),"r");3556if(!logfp)3557return-1;35583559/* Jump to the end */3560if(fseek(logfp,0, SEEK_END) <0)3561returnerror("cannot seek back reflog for%s:%s",3562 refname,strerror(errno));3563 pos =ftell(logfp);3564while(!ret &&0< pos) {3565int cnt;3566size_t nread;3567char buf[BUFSIZ];3568char*endp, *scanp;35693570/* Fill next block from the end */3571 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3572if(fseek(logfp, pos - cnt, SEEK_SET))3573returnerror("cannot seek back reflog for%s:%s",3574 refname,strerror(errno));3575 nread =fread(buf, cnt,1, logfp);3576if(nread !=1)3577returnerror("cannot read%dbytes from reflog for%s:%s",3578 cnt, refname,strerror(errno));3579 pos -= cnt;35803581 scanp = endp = buf + cnt;3582if(at_tail && scanp[-1] =='\n')3583/* Looking at the final LF at the end of the file */3584 scanp--;3585 at_tail =0;35863587while(buf < scanp) {3588/*3589 * terminating LF of the previous line, or the beginning3590 * of the buffer.3591 */3592char*bp;35933594 bp =find_beginning_of_line(buf, scanp);35953596if(*bp =='\n') {3597/*3598 * The newline is the end of the previous line,3599 * so we know we have complete line starting3600 * at (bp + 1). Prefix it onto any prior data3601 * we collected for the line and process it.3602 */3603strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3604 scanp = bp;3605 endp = bp +1;3606 ret =show_one_reflog_ent(&sb, fn, cb_data);3607strbuf_reset(&sb);3608if(ret)3609break;3610}else if(!pos) {3611/*3612 * We are at the start of the buffer, and the3613 * start of the file; there is no previous3614 * line, and we have everything for this one.3615 * Process it, and we can end the loop.3616 */3617strbuf_splice(&sb,0,0, buf, endp - buf);3618 ret =show_one_reflog_ent(&sb, fn, cb_data);3619strbuf_reset(&sb);3620break;3621}36223623if(bp == buf) {3624/*3625 * We are at the start of the buffer, and there3626 * is more file to read backwards. Which means3627 * we are in the middle of a line. Note that we3628 * may get here even if *bp was a newline; that3629 * just means we are at the exact end of the3630 * previous line, rather than some spot in the3631 * middle.3632 *3633 * Save away what we have to be combined with3634 * the data from the next read.3635 */3636strbuf_splice(&sb,0,0, buf, endp - buf);3637break;3638}3639}36403641}3642if(!ret && sb.len)3643die("BUG: reverse reflog parser had leftover data");36443645fclose(logfp);3646strbuf_release(&sb);3647return ret;3648}36493650intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3651{3652FILE*logfp;3653struct strbuf sb = STRBUF_INIT;3654int ret =0;36553656 logfp =fopen(git_path("logs/%s", refname),"r");3657if(!logfp)3658return-1;36593660while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3661 ret =show_one_reflog_ent(&sb, fn, cb_data);3662fclose(logfp);3663strbuf_release(&sb);3664return ret;3665}3666/*3667 * Call fn for each reflog in the namespace indicated by name. name3668 * must be empty or end with '/'. Name will be used as a scratch3669 * space, but its contents will be restored before return.3670 */3671static intdo_for_each_reflog(struct strbuf *name, each_ref_fn fn,void*cb_data)3672{3673DIR*d =opendir(git_path("logs/%s", name->buf));3674int retval =0;3675struct dirent *de;3676int oldlen = name->len;36773678if(!d)3679return name->len ? errno :0;36803681while((de =readdir(d)) != NULL) {3682struct stat st;36833684if(de->d_name[0] =='.')3685continue;3686if(ends_with(de->d_name,".lock"))3687continue;3688strbuf_addstr(name, de->d_name);3689if(stat(git_path("logs/%s", name->buf), &st) <0) {3690;/* silently ignore */3691}else{3692if(S_ISDIR(st.st_mode)) {3693strbuf_addch(name,'/');3694 retval =do_for_each_reflog(name, fn, cb_data);3695}else{3696struct object_id oid;36973698if(read_ref_full(name->buf,0, oid.hash, NULL))3699 retval =error("bad ref for%s", name->buf);3700else3701 retval =fn(name->buf, &oid,0, cb_data);3702}3703if(retval)3704break;3705}3706strbuf_setlen(name, oldlen);3707}3708closedir(d);3709return retval;3710}37113712intfor_each_reflog(each_ref_fn fn,void*cb_data)3713{3714int retval;3715struct strbuf name;3716strbuf_init(&name, PATH_MAX);3717 retval =do_for_each_reflog(&name, fn, cb_data);3718strbuf_release(&name);3719return retval;3720}37213722/**3723 * Information needed for a single ref update. Set new_sha1 to the new3724 * value or to null_sha1 to delete the ref. To check the old value3725 * while the ref is locked, set (flags & REF_HAVE_OLD) and set3726 * old_sha1 to the old value, or to null_sha1 to ensure the ref does3727 * not exist before update.3728 */3729struct ref_update {3730/*3731 * If (flags & REF_HAVE_NEW), set the reference to this value:3732 */3733unsigned char new_sha1[20];3734/*3735 * If (flags & REF_HAVE_OLD), check that the reference3736 * previously had this value:3737 */3738unsigned char old_sha1[20];3739/*3740 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,3741 * REF_DELETING, and REF_ISPRUNING:3742 */3743unsigned int flags;3744struct ref_lock *lock;3745int type;3746char*msg;3747const char refname[FLEX_ARRAY];3748};37493750/*3751 * Transaction states.3752 * OPEN: The transaction is in a valid state and can accept new updates.3753 * An OPEN transaction can be committed.3754 * CLOSED: A closed transaction is no longer active and no other operations3755 * than free can be used on it in this state.3756 * A transaction can either become closed by successfully committing3757 * an active transaction or if there is a failure while building3758 * the transaction thus rendering it failed/inactive.3759 */3760enum ref_transaction_state {3761 REF_TRANSACTION_OPEN =0,3762 REF_TRANSACTION_CLOSED =13763};37643765/*3766 * Data structure for holding a reference transaction, which can3767 * consist of checks and updates to multiple references, carried out3768 * as atomically as possible. This structure is opaque to callers.3769 */3770struct ref_transaction {3771struct ref_update **updates;3772size_t alloc;3773size_t nr;3774enum ref_transaction_state state;3775};37763777struct ref_transaction *ref_transaction_begin(struct strbuf *err)3778{3779assert(err);37803781returnxcalloc(1,sizeof(struct ref_transaction));3782}37833784voidref_transaction_free(struct ref_transaction *transaction)3785{3786int i;37873788if(!transaction)3789return;37903791for(i =0; i < transaction->nr; i++) {3792free(transaction->updates[i]->msg);3793free(transaction->updates[i]);3794}3795free(transaction->updates);3796free(transaction);3797}37983799static struct ref_update *add_update(struct ref_transaction *transaction,3800const char*refname)3801{3802size_t len =strlen(refname);3803struct ref_update *update =xcalloc(1,sizeof(*update) + len +1);38043805strcpy((char*)update->refname, refname);3806ALLOC_GROW(transaction->updates, transaction->nr +1, transaction->alloc);3807 transaction->updates[transaction->nr++] = update;3808return update;3809}38103811intref_transaction_update(struct ref_transaction *transaction,3812const char*refname,3813const unsigned char*new_sha1,3814const unsigned char*old_sha1,3815unsigned int flags,const char*msg,3816struct strbuf *err)3817{3818struct ref_update *update;38193820assert(err);38213822if(transaction->state != REF_TRANSACTION_OPEN)3823die("BUG: update called for transaction that is not open");38243825if(new_sha1 && !is_null_sha1(new_sha1) &&3826check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {3827strbuf_addf(err,"refusing to update ref with bad name%s",3828 refname);3829return-1;3830}38313832 update =add_update(transaction, refname);3833if(new_sha1) {3834hashcpy(update->new_sha1, new_sha1);3835 flags |= REF_HAVE_NEW;3836}3837if(old_sha1) {3838hashcpy(update->old_sha1, old_sha1);3839 flags |= REF_HAVE_OLD;3840}3841 update->flags = flags;3842if(msg)3843 update->msg =xstrdup(msg);3844return0;3845}38463847intref_transaction_create(struct ref_transaction *transaction,3848const char*refname,3849const unsigned char*new_sha1,3850unsigned int flags,const char*msg,3851struct strbuf *err)3852{3853if(!new_sha1 ||is_null_sha1(new_sha1))3854die("BUG: create called without valid new_sha1");3855returnref_transaction_update(transaction, refname, new_sha1,3856 null_sha1, flags, msg, err);3857}38583859intref_transaction_delete(struct ref_transaction *transaction,3860const char*refname,3861const unsigned char*old_sha1,3862unsigned int flags,const char*msg,3863struct strbuf *err)3864{3865if(old_sha1 &&is_null_sha1(old_sha1))3866die("BUG: delete called with old_sha1 set to zeros");3867returnref_transaction_update(transaction, refname,3868 null_sha1, old_sha1,3869 flags, msg, err);3870}38713872intref_transaction_verify(struct ref_transaction *transaction,3873const char*refname,3874const unsigned char*old_sha1,3875unsigned int flags,3876struct strbuf *err)3877{3878if(!old_sha1)3879die("BUG: verify called with old_sha1 set to NULL");3880returnref_transaction_update(transaction, refname,3881 NULL, old_sha1,3882 flags, NULL, err);3883}38843885intupdate_ref(const char*msg,const char*refname,3886const unsigned char*new_sha1,const unsigned char*old_sha1,3887unsigned int flags,enum action_on_err onerr)3888{3889struct ref_transaction *t;3890struct strbuf err = STRBUF_INIT;38913892 t =ref_transaction_begin(&err);3893if(!t ||3894ref_transaction_update(t, refname, new_sha1, old_sha1,3895 flags, msg, &err) ||3896ref_transaction_commit(t, &err)) {3897const char*str ="update_ref failed for ref '%s':%s";38983899ref_transaction_free(t);3900switch(onerr) {3901case UPDATE_REFS_MSG_ON_ERR:3902error(str, refname, err.buf);3903break;3904case UPDATE_REFS_DIE_ON_ERR:3905die(str, refname, err.buf);3906break;3907case UPDATE_REFS_QUIET_ON_ERR:3908break;3909}3910strbuf_release(&err);3911return1;3912}3913strbuf_release(&err);3914ref_transaction_free(t);3915return0;3916}39173918static intref_update_reject_duplicates(struct string_list *refnames,3919struct strbuf *err)3920{3921int i, n = refnames->nr;39223923assert(err);39243925for(i =1; i < n; i++)3926if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3927strbuf_addf(err,3928"Multiple updates for ref '%s' not allowed.",3929 refnames->items[i].string);3930return1;3931}3932return0;3933}39343935intref_transaction_commit(struct ref_transaction *transaction,3936struct strbuf *err)3937{3938int ret =0, i;3939int n = transaction->nr;3940struct ref_update **updates = transaction->updates;3941struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3942struct string_list_item *ref_to_delete;3943struct string_list affected_refnames = STRING_LIST_INIT_NODUP;39443945assert(err);39463947if(transaction->state != REF_TRANSACTION_OPEN)3948die("BUG: commit called for transaction that is not open");39493950if(!n) {3951 transaction->state = REF_TRANSACTION_CLOSED;3952return0;3953}39543955/* Fail if a refname appears more than once in the transaction: */3956for(i =0; i < n; i++)3957string_list_append(&affected_refnames, updates[i]->refname);3958string_list_sort(&affected_refnames);3959if(ref_update_reject_duplicates(&affected_refnames, err)) {3960 ret = TRANSACTION_GENERIC_ERROR;3961goto cleanup;3962}39633964/*3965 * Acquire all locks, verify old values if provided, check3966 * that new values are valid, and write new values to the3967 * lockfiles, ready to be activated. Only keep one lockfile3968 * open at a time to avoid running out of file descriptors.3969 */3970for(i =0; i < n; i++) {3971struct ref_update *update = updates[i];39723973if((update->flags & REF_HAVE_NEW) &&3974is_null_sha1(update->new_sha1))3975 update->flags |= REF_DELETING;3976 update->lock =lock_ref_sha1_basic(3977 update->refname,3978((update->flags & REF_HAVE_OLD) ?3979 update->old_sha1 : NULL),3980&affected_refnames, NULL,3981 update->flags,3982&update->type,3983 err);3984if(!update->lock) {3985char*reason;39863987 ret = (errno == ENOTDIR)3988? TRANSACTION_NAME_CONFLICT3989: TRANSACTION_GENERIC_ERROR;3990 reason =strbuf_detach(err, NULL);3991strbuf_addf(err,"cannot lock ref '%s':%s",3992 update->refname, reason);3993free(reason);3994goto cleanup;3995}3996if((update->flags & REF_HAVE_NEW) &&3997!(update->flags & REF_DELETING)) {3998int overwriting_symref = ((update->type & REF_ISSYMREF) &&3999(update->flags & REF_NODEREF));40004001if(!overwriting_symref &&4002!hashcmp(update->lock->old_oid.hash, update->new_sha1)) {4003/*4004 * The reference already has the desired4005 * value, so we don't need to write it.4006 */4007}else if(write_ref_to_lockfile(update->lock,4008 update->new_sha1)) {4009/*4010 * The lock was freed upon failure of4011 * write_ref_to_lockfile():4012 */4013 update->lock = NULL;4014strbuf_addf(err,"cannot update the ref '%s'.",4015 update->refname);4016 ret = TRANSACTION_GENERIC_ERROR;4017goto cleanup;4018}else{4019 update->flags |= REF_NEEDS_COMMIT;4020}4021}4022if(!(update->flags & REF_NEEDS_COMMIT)) {4023/*4024 * We didn't have to write anything to the lockfile.4025 * Close it to free up the file descriptor:4026 */4027if(close_ref(update->lock)) {4028strbuf_addf(err,"Couldn't close%s.lock",4029 update->refname);4030goto cleanup;4031}4032}4033}40344035/* Perform updates first so live commits remain referenced */4036for(i =0; i < n; i++) {4037struct ref_update *update = updates[i];40384039if(update->flags & REF_NEEDS_COMMIT) {4040if(commit_ref_update(update->lock,4041 update->new_sha1, update->msg)) {4042/* freed by commit_ref_update(): */4043 update->lock = NULL;4044strbuf_addf(err,"Cannot update the ref '%s'.",4045 update->refname);4046 ret = TRANSACTION_GENERIC_ERROR;4047goto cleanup;4048}else{4049/* freed by commit_ref_update(): */4050 update->lock = NULL;4051}4052}4053}40544055/* Perform deletes now that updates are safely completed */4056for(i =0; i < n; i++) {4057struct ref_update *update = updates[i];40584059if(update->flags & REF_DELETING) {4060if(delete_ref_loose(update->lock, update->type, err)) {4061 ret = TRANSACTION_GENERIC_ERROR;4062goto cleanup;4063}40644065if(!(update->flags & REF_ISPRUNING))4066string_list_append(&refs_to_delete,4067 update->lock->ref_name);4068}4069}40704071if(repack_without_refs(&refs_to_delete, err)) {4072 ret = TRANSACTION_GENERIC_ERROR;4073goto cleanup;4074}4075for_each_string_list_item(ref_to_delete, &refs_to_delete)4076unlink_or_warn(git_path("logs/%s", ref_to_delete->string));4077clear_loose_ref_cache(&ref_cache);40784079cleanup:4080 transaction->state = REF_TRANSACTION_CLOSED;40814082for(i =0; i < n; i++)4083if(updates[i]->lock)4084unlock_ref(updates[i]->lock);4085string_list_clear(&refs_to_delete,0);4086string_list_clear(&affected_refnames,0);4087return ret;4088}40894090static intref_present(const char*refname,4091const struct object_id *oid,int flags,void*cb_data)4092{4093struct string_list *affected_refnames = cb_data;40944095returnstring_list_has_string(affected_refnames, refname);4096}40974098intinitial_ref_transaction_commit(struct ref_transaction *transaction,4099struct strbuf *err)4100{4101struct ref_dir *loose_refs =get_loose_refs(&ref_cache);4102struct ref_dir *packed_refs =get_packed_refs(&ref_cache);4103int ret =0, i;4104int n = transaction->nr;4105struct ref_update **updates = transaction->updates;4106struct string_list affected_refnames = STRING_LIST_INIT_NODUP;41074108assert(err);41094110if(transaction->state != REF_TRANSACTION_OPEN)4111die("BUG: commit called for transaction that is not open");41124113/* Fail if a refname appears more than once in the transaction: */4114for(i =0; i < n; i++)4115string_list_append(&affected_refnames, updates[i]->refname);4116string_list_sort(&affected_refnames);4117if(ref_update_reject_duplicates(&affected_refnames, err)) {4118 ret = TRANSACTION_GENERIC_ERROR;4119goto cleanup;4120}41214122/*4123 * It's really undefined to call this function in an active4124 * repository or when there are existing references: we are4125 * only locking and changing packed-refs, so (1) any4126 * simultaneous processes might try to change a reference at4127 * the same time we do, and (2) any existing loose versions of4128 * the references that we are setting would have precedence4129 * over our values. But some remote helpers create the remote4130 * "HEAD" and "master" branches before calling this function,4131 * so here we really only check that none of the references4132 * that we are creating already exists.4133 */4134if(for_each_rawref(ref_present, &affected_refnames))4135die("BUG: initial ref transaction called with existing refs");41364137for(i =0; i < n; i++) {4138struct ref_update *update = updates[i];41394140if((update->flags & REF_HAVE_OLD) &&4141!is_null_sha1(update->old_sha1))4142die("BUG: initial ref transaction with old_sha1 set");4143if(verify_refname_available(update->refname,4144&affected_refnames, NULL,4145 loose_refs, err) ||4146verify_refname_available(update->refname,4147&affected_refnames, NULL,4148 packed_refs, err)) {4149 ret = TRANSACTION_NAME_CONFLICT;4150goto cleanup;4151}4152}41534154if(lock_packed_refs(0)) {4155strbuf_addf(err,"unable to lock packed-refs file:%s",4156strerror(errno));4157 ret = TRANSACTION_GENERIC_ERROR;4158goto cleanup;4159}41604161for(i =0; i < n; i++) {4162struct ref_update *update = updates[i];41634164if((update->flags & REF_HAVE_NEW) &&4165!is_null_sha1(update->new_sha1))4166add_packed_ref(update->refname, update->new_sha1);4167}41684169if(commit_packed_refs()) {4170strbuf_addf(err,"unable to commit packed-refs file:%s",4171strerror(errno));4172 ret = TRANSACTION_GENERIC_ERROR;4173goto cleanup;4174}41754176cleanup:4177 transaction->state = REF_TRANSACTION_CLOSED;4178string_list_clear(&affected_refnames,0);4179return ret;4180}41814182char*shorten_unambiguous_ref(const char*refname,int strict)4183{4184int i;4185static char**scanf_fmts;4186static int nr_rules;4187char*short_name;41884189if(!nr_rules) {4190/*4191 * Pre-generate scanf formats from ref_rev_parse_rules[].4192 * Generate a format suitable for scanf from a4193 * ref_rev_parse_rules rule by interpolating "%s" at the4194 * location of the "%.*s".4195 */4196size_t total_len =0;4197size_t offset =0;41984199/* the rule list is NULL terminated, count them first */4200for(nr_rules =0; ref_rev_parse_rules[nr_rules]; nr_rules++)4201/* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */4202 total_len +=strlen(ref_rev_parse_rules[nr_rules]) -2+1;42034204 scanf_fmts =xmalloc(nr_rules *sizeof(char*) + total_len);42054206 offset =0;4207for(i =0; i < nr_rules; i++) {4208assert(offset < total_len);4209 scanf_fmts[i] = (char*)&scanf_fmts[nr_rules] + offset;4210 offset +=snprintf(scanf_fmts[i], total_len - offset,4211 ref_rev_parse_rules[i],2,"%s") +1;4212}4213}42144215/* bail out if there are no rules */4216if(!nr_rules)4217returnxstrdup(refname);42184219/* buffer for scanf result, at most refname must fit */4220 short_name =xstrdup(refname);42214222/* skip first rule, it will always match */4223for(i = nr_rules -1; i >0; --i) {4224int j;4225int rules_to_fail = i;4226int short_name_len;42274228if(1!=sscanf(refname, scanf_fmts[i], short_name))4229continue;42304231 short_name_len =strlen(short_name);42324233/*4234 * in strict mode, all (except the matched one) rules4235 * must fail to resolve to a valid non-ambiguous ref4236 */4237if(strict)4238 rules_to_fail = nr_rules;42394240/*4241 * check if the short name resolves to a valid ref,4242 * but use only rules prior to the matched one4243 */4244for(j =0; j < rules_to_fail; j++) {4245const char*rule = ref_rev_parse_rules[j];4246char refname[PATH_MAX];42474248/* skip matched rule */4249if(i == j)4250continue;42514252/*4253 * the short name is ambiguous, if it resolves4254 * (with this previous rule) to a valid ref4255 * read_ref() returns 0 on success4256 */4257mksnpath(refname,sizeof(refname),4258 rule, short_name_len, short_name);4259if(ref_exists(refname))4260break;4261}42624263/*4264 * short name is non-ambiguous if all previous rules4265 * haven't resolved to a valid ref4266 */4267if(j == rules_to_fail)4268return short_name;4269}42704271free(short_name);4272returnxstrdup(refname);4273}42744275static struct string_list *hide_refs;42764277intparse_hide_refs_config(const char*var,const char*value,const char*section)4278{4279if(!strcmp("transfer.hiderefs", var) ||4280/* NEEDSWORK: use parse_config_key() once both are merged */4281(starts_with(var, section) && var[strlen(section)] =='.'&&4282!strcmp(var +strlen(section),".hiderefs"))) {4283char*ref;4284int len;42854286if(!value)4287returnconfig_error_nonbool(var);4288 ref =xstrdup(value);4289 len =strlen(ref);4290while(len && ref[len -1] =='/')4291 ref[--len] ='\0';4292if(!hide_refs) {4293 hide_refs =xcalloc(1,sizeof(*hide_refs));4294 hide_refs->strdup_strings =1;4295}4296string_list_append(hide_refs, ref);4297}4298return0;4299}43004301intref_is_hidden(const char*refname)4302{4303struct string_list_item *item;43044305if(!hide_refs)4306return0;4307for_each_string_list_item(item, hide_refs) {4308int len;4309if(!starts_with(refname, item->string))4310continue;4311 len =strlen(item->string);4312if(!refname[len] || refname[len] =='/')4313return1;4314}4315return0;4316}43174318struct expire_reflog_cb {4319unsigned int flags;4320 reflog_expiry_should_prune_fn *should_prune_fn;4321void*policy_cb;4322FILE*newlog;4323unsigned char last_kept_sha1[20];4324};43254326static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,4327const char*email,unsigned long timestamp,int tz,4328const char*message,void*cb_data)4329{4330struct expire_reflog_cb *cb = cb_data;4331struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;43324333if(cb->flags & EXPIRE_REFLOGS_REWRITE)4334 osha1 = cb->last_kept_sha1;43354336if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,4337 message, policy_cb)) {4338if(!cb->newlog)4339printf("would prune%s", message);4340else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4341printf("prune%s", message);4342}else{4343if(cb->newlog) {4344fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",4345sha1_to_hex(osha1),sha1_to_hex(nsha1),4346 email, timestamp, tz, message);4347hashcpy(cb->last_kept_sha1, nsha1);4348}4349if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4350printf("keep%s", message);4351}4352return0;4353}43544355intreflog_expire(const char*refname,const unsigned char*sha1,4356unsigned int flags,4357 reflog_expiry_prepare_fn prepare_fn,4358 reflog_expiry_should_prune_fn should_prune_fn,4359 reflog_expiry_cleanup_fn cleanup_fn,4360void*policy_cb_data)4361{4362static struct lock_file reflog_lock;4363struct expire_reflog_cb cb;4364struct ref_lock *lock;4365char*log_file;4366int status =0;4367int type;4368struct strbuf err = STRBUF_INIT;43694370memset(&cb,0,sizeof(cb));4371 cb.flags = flags;4372 cb.policy_cb = policy_cb_data;4373 cb.should_prune_fn = should_prune_fn;43744375/*4376 * The reflog file is locked by holding the lock on the4377 * reference itself, plus we might need to update the4378 * reference if --updateref was specified:4379 */4380 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL,0, &type, &err);4381if(!lock) {4382error("cannot lock ref '%s':%s", refname, err.buf);4383strbuf_release(&err);4384return-1;4385}4386if(!reflog_exists(refname)) {4387unlock_ref(lock);4388return0;4389}43904391 log_file =git_pathdup("logs/%s", refname);4392if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4393/*4394 * Even though holding $GIT_DIR/logs/$reflog.lock has4395 * no locking implications, we use the lock_file4396 * machinery here anyway because it does a lot of the4397 * work we need, including cleaning up if the program4398 * exits unexpectedly.4399 */4400if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4401struct strbuf err = STRBUF_INIT;4402unable_to_lock_message(log_file, errno, &err);4403error("%s", err.buf);4404strbuf_release(&err);4405goto failure;4406}4407 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4408if(!cb.newlog) {4409error("cannot fdopen%s(%s)",4410 reflog_lock.filename.buf,strerror(errno));4411goto failure;4412}4413}44144415(*prepare_fn)(refname, sha1, cb.policy_cb);4416for_each_reflog_ent(refname, expire_reflog_ent, &cb);4417(*cleanup_fn)(cb.policy_cb);44184419if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4420/*4421 * It doesn't make sense to adjust a reference pointed4422 * to by a symbolic ref based on expiring entries in4423 * the symbolic reference's reflog. Nor can we update4424 * a reference if there are no remaining reflog4425 * entries.4426 */4427int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4428!(type & REF_ISSYMREF) &&4429!is_null_sha1(cb.last_kept_sha1);44304431if(close_lock_file(&reflog_lock)) {4432 status |=error("couldn't write%s:%s", log_file,4433strerror(errno));4434}else if(update &&4435(write_in_full(lock->lk->fd,4436sha1_to_hex(cb.last_kept_sha1),40) !=40||4437write_str_in_full(lock->lk->fd,"\n") !=1||4438close_ref(lock) <0)) {4439 status |=error("couldn't write%s",4440 lock->lk->filename.buf);4441rollback_lock_file(&reflog_lock);4442}else if(commit_lock_file(&reflog_lock)) {4443 status |=error("unable to commit reflog '%s' (%s)",4444 log_file,strerror(errno));4445}else if(update &&commit_ref(lock)) {4446 status |=error("couldn't set%s", lock->ref_name);4447}4448}4449free(log_file);4450unlock_ref(lock);4451return status;44524453 failure:4454rollback_lock_file(&reflog_lock);4455free(log_file);4456unlock_ref(lock);4457return-1;4458}