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*ref,int resolve_flags,unsigned char*sha1,int*flags)1736{1737returnxstrdup_or_null(resolve_ref_unsafe(ref, resolve_flags, sha1, flags));1738}17391740/* The argument to filter_refs */1741struct ref_filter {1742const char*pattern;1743 each_ref_fn *fn;1744void*cb_data;1745};17461747intread_ref_full(const char*refname,int resolve_flags,unsigned char*sha1,int*flags)1748{1749if(resolve_ref_unsafe(refname, resolve_flags, sha1, flags))1750return0;1751return-1;1752}17531754intread_ref(const char*refname,unsigned char*sha1)1755{1756returnread_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);1757}17581759intref_exists(const char*refname)1760{1761unsigned char sha1[20];1762return!!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);1763}17641765static intfilter_refs(const char*refname,const struct object_id *oid,1766int flags,void*data)1767{1768struct ref_filter *filter = (struct ref_filter *)data;17691770if(wildmatch(filter->pattern, refname,0, NULL))1771return0;1772return filter->fn(refname, oid, flags, filter->cb_data);1773}17741775enum peel_status {1776/* object was peeled successfully: */1777 PEEL_PEELED =0,17781779/*1780 * object cannot be peeled because the named object (or an1781 * object referred to by a tag in the peel chain), does not1782 * exist.1783 */1784 PEEL_INVALID = -1,17851786/* object cannot be peeled because it is not a tag: */1787 PEEL_NON_TAG = -2,17881789/* ref_entry contains no peeled value because it is a symref: */1790 PEEL_IS_SYMREF = -3,17911792/*1793 * ref_entry cannot be peeled because it is broken (i.e., the1794 * symbolic reference cannot even be resolved to an object1795 * name):1796 */1797 PEEL_BROKEN = -41798};17991800/*1801 * Peel the named object; i.e., if the object is a tag, resolve the1802 * tag recursively until a non-tag is found. If successful, store the1803 * result to sha1 and return PEEL_PEELED. If the object is not a tag1804 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,1805 * and leave sha1 unchanged.1806 */1807static enum peel_status peel_object(const unsigned char*name,unsigned char*sha1)1808{1809struct object *o =lookup_unknown_object(name);18101811if(o->type == OBJ_NONE) {1812int type =sha1_object_info(name, NULL);1813if(type <0|| !object_as_type(o, type,0))1814return PEEL_INVALID;1815}18161817if(o->type != OBJ_TAG)1818return PEEL_NON_TAG;18191820 o =deref_tag_noverify(o);1821if(!o)1822return PEEL_INVALID;18231824hashcpy(sha1, o->sha1);1825return PEEL_PEELED;1826}18271828/*1829 * Peel the entry (if possible) and return its new peel_status. If1830 * repeel is true, re-peel the entry even if there is an old peeled1831 * value that is already stored in it.1832 *1833 * It is OK to call this function with a packed reference entry that1834 * might be stale and might even refer to an object that has since1835 * been garbage-collected. In such a case, if the entry has1836 * REF_KNOWS_PEELED then leave the status unchanged and return1837 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1838 */1839static enum peel_status peel_entry(struct ref_entry *entry,int repeel)1840{1841enum peel_status status;18421843if(entry->flag & REF_KNOWS_PEELED) {1844if(repeel) {1845 entry->flag &= ~REF_KNOWS_PEELED;1846oidclr(&entry->u.value.peeled);1847}else{1848returnis_null_oid(&entry->u.value.peeled) ?1849 PEEL_NON_TAG : PEEL_PEELED;1850}1851}1852if(entry->flag & REF_ISBROKEN)1853return PEEL_BROKEN;1854if(entry->flag & REF_ISSYMREF)1855return PEEL_IS_SYMREF;18561857 status =peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1858if(status == PEEL_PEELED || status == PEEL_NON_TAG)1859 entry->flag |= REF_KNOWS_PEELED;1860return status;1861}18621863intpeel_ref(const char*refname,unsigned char*sha1)1864{1865int flag;1866unsigned char base[20];18671868if(current_ref && (current_ref->name == refname1869|| !strcmp(current_ref->name, refname))) {1870if(peel_entry(current_ref,0))1871return-1;1872hashcpy(sha1, current_ref->u.value.peeled.hash);1873return0;1874}18751876if(read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1877return-1;18781879/*1880 * If the reference is packed, read its ref_entry from the1881 * cache in the hope that we already know its peeled value.1882 * We only try this optimization on packed references because1883 * (a) forcing the filling of the loose reference cache could1884 * be expensive and (b) loose references anyway usually do not1885 * have REF_KNOWS_PEELED.1886 */1887if(flag & REF_ISPACKED) {1888struct ref_entry *r =get_packed_ref(refname);1889if(r) {1890if(peel_entry(r,0))1891return-1;1892hashcpy(sha1, r->u.value.peeled.hash);1893return0;1894}1895}18961897returnpeel_object(base, sha1);1898}18991900struct warn_if_dangling_data {1901FILE*fp;1902const char*refname;1903const struct string_list *refnames;1904const char*msg_fmt;1905};19061907static intwarn_if_dangling_symref(const char*refname,const struct object_id *oid,1908int flags,void*cb_data)1909{1910struct warn_if_dangling_data *d = cb_data;1911const char*resolves_to;1912struct object_id junk;19131914if(!(flags & REF_ISSYMREF))1915return0;19161917 resolves_to =resolve_ref_unsafe(refname,0, junk.hash, NULL);1918if(!resolves_to1919|| (d->refname1920?strcmp(resolves_to, d->refname)1921: !string_list_has_string(d->refnames, resolves_to))) {1922return0;1923}19241925fprintf(d->fp, d->msg_fmt, refname);1926fputc('\n', d->fp);1927return0;1928}19291930voidwarn_dangling_symref(FILE*fp,const char*msg_fmt,const char*refname)1931{1932struct warn_if_dangling_data data;19331934 data.fp = fp;1935 data.refname = refname;1936 data.refnames = NULL;1937 data.msg_fmt = msg_fmt;1938for_each_rawref(warn_if_dangling_symref, &data);1939}19401941voidwarn_dangling_symrefs(FILE*fp,const char*msg_fmt,const struct string_list *refnames)1942{1943struct warn_if_dangling_data data;19441945 data.fp = fp;1946 data.refname = NULL;1947 data.refnames = refnames;1948 data.msg_fmt = msg_fmt;1949for_each_rawref(warn_if_dangling_symref, &data);1950}19511952/*1953 * Call fn for each reference in the specified ref_cache, omitting1954 * references not in the containing_dir of base. fn is called for all1955 * references, including broken ones. If fn ever returns a non-zero1956 * value, stop the iteration and return that value; otherwise, return1957 * 0.1958 */1959static intdo_for_each_entry(struct ref_cache *refs,const char*base,1960 each_ref_entry_fn fn,void*cb_data)1961{1962struct packed_ref_cache *packed_ref_cache;1963struct ref_dir *loose_dir;1964struct ref_dir *packed_dir;1965int retval =0;19661967/*1968 * We must make sure that all loose refs are read before accessing the1969 * packed-refs file; this avoids a race condition in which loose refs1970 * are migrated to the packed-refs file by a simultaneous process, but1971 * our in-memory view is from before the migration. get_packed_ref_cache()1972 * takes care of making sure our view is up to date with what is on1973 * disk.1974 */1975 loose_dir =get_loose_refs(refs);1976if(base && *base) {1977 loose_dir =find_containing_dir(loose_dir, base,0);1978}1979if(loose_dir)1980prime_ref_dir(loose_dir);19811982 packed_ref_cache =get_packed_ref_cache(refs);1983acquire_packed_ref_cache(packed_ref_cache);1984 packed_dir =get_packed_ref_dir(packed_ref_cache);1985if(base && *base) {1986 packed_dir =find_containing_dir(packed_dir, base,0);1987}19881989if(packed_dir && loose_dir) {1990sort_ref_dir(packed_dir);1991sort_ref_dir(loose_dir);1992 retval =do_for_each_entry_in_dirs(1993 packed_dir, loose_dir, fn, cb_data);1994}else if(packed_dir) {1995sort_ref_dir(packed_dir);1996 retval =do_for_each_entry_in_dir(1997 packed_dir,0, fn, cb_data);1998}else if(loose_dir) {1999sort_ref_dir(loose_dir);2000 retval =do_for_each_entry_in_dir(2001 loose_dir,0, fn, cb_data);2002}20032004release_packed_ref_cache(packed_ref_cache);2005return retval;2006}20072008/*2009 * Call fn for each reference in the specified ref_cache for which the2010 * refname begins with base. If trim is non-zero, then trim that many2011 * characters off the beginning of each refname before passing the2012 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include2013 * broken references in the iteration. If fn ever returns a non-zero2014 * value, stop the iteration and return that value; otherwise, return2015 * 0.2016 */2017static intdo_for_each_ref(struct ref_cache *refs,const char*base,2018 each_ref_fn fn,int trim,int flags,void*cb_data)2019{2020struct ref_entry_cb data;2021 data.base = base;2022 data.trim = trim;2023 data.flags = flags;2024 data.fn = fn;2025 data.cb_data = cb_data;20262027if(ref_paranoia <0)2028 ref_paranoia =git_env_bool("GIT_REF_PARANOIA",0);2029if(ref_paranoia)2030 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;20312032returndo_for_each_entry(refs, base, do_one_ref, &data);2033}20342035static intdo_head_ref(const char*submodule, each_ref_fn fn,void*cb_data)2036{2037struct object_id oid;2038int flag;20392040if(submodule) {2041if(resolve_gitlink_ref(submodule,"HEAD", oid.hash) ==0)2042returnfn("HEAD", &oid,0, cb_data);20432044return0;2045}20462047if(!read_ref_full("HEAD", RESOLVE_REF_READING, oid.hash, &flag))2048returnfn("HEAD", &oid, flag, cb_data);20492050return0;2051}20522053inthead_ref(each_ref_fn fn,void*cb_data)2054{2055returndo_head_ref(NULL, fn, cb_data);2056}20572058inthead_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2059{2060returndo_head_ref(submodule, fn, cb_data);2061}20622063intfor_each_ref(each_ref_fn fn,void*cb_data)2064{2065returndo_for_each_ref(&ref_cache,"", fn,0,0, cb_data);2066}20672068intfor_each_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2069{2070returndo_for_each_ref(get_ref_cache(submodule),"", fn,0,0, cb_data);2071}20722073intfor_each_ref_in(const char*prefix, each_ref_fn fn,void*cb_data)2074{2075returndo_for_each_ref(&ref_cache, prefix, fn,strlen(prefix),0, cb_data);2076}20772078intfor_each_ref_in_submodule(const char*submodule,const char*prefix,2079 each_ref_fn fn,void*cb_data)2080{2081returndo_for_each_ref(get_ref_cache(submodule), prefix, fn,strlen(prefix),0, cb_data);2082}20832084intfor_each_tag_ref(each_ref_fn fn,void*cb_data)2085{2086returnfor_each_ref_in("refs/tags/", fn, cb_data);2087}20882089intfor_each_tag_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2090{2091returnfor_each_ref_in_submodule(submodule,"refs/tags/", fn, cb_data);2092}20932094intfor_each_branch_ref(each_ref_fn fn,void*cb_data)2095{2096returnfor_each_ref_in("refs/heads/", fn, cb_data);2097}20982099intfor_each_branch_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2100{2101returnfor_each_ref_in_submodule(submodule,"refs/heads/", fn, cb_data);2102}21032104intfor_each_remote_ref(each_ref_fn fn,void*cb_data)2105{2106returnfor_each_ref_in("refs/remotes/", fn, cb_data);2107}21082109intfor_each_remote_ref_submodule(const char*submodule, each_ref_fn fn,void*cb_data)2110{2111returnfor_each_ref_in_submodule(submodule,"refs/remotes/", fn, cb_data);2112}21132114intfor_each_replace_ref(each_ref_fn fn,void*cb_data)2115{2116returndo_for_each_ref(&ref_cache,"refs/replace/", fn,13,0, cb_data);2117}21182119inthead_ref_namespaced(each_ref_fn fn,void*cb_data)2120{2121struct strbuf buf = STRBUF_INIT;2122int ret =0;2123struct object_id oid;2124int flag;21252126strbuf_addf(&buf,"%sHEAD",get_git_namespace());2127if(!read_ref_full(buf.buf, RESOLVE_REF_READING, oid.hash, &flag))2128 ret =fn(buf.buf, &oid, flag, cb_data);2129strbuf_release(&buf);21302131return ret;2132}21332134intfor_each_namespaced_ref(each_ref_fn fn,void*cb_data)2135{2136struct strbuf buf = STRBUF_INIT;2137int ret;2138strbuf_addf(&buf,"%srefs/",get_git_namespace());2139 ret =do_for_each_ref(&ref_cache, buf.buf, fn,0,0, cb_data);2140strbuf_release(&buf);2141return ret;2142}21432144intfor_each_glob_ref_in(each_ref_fn fn,const char*pattern,2145const char*prefix,void*cb_data)2146{2147struct strbuf real_pattern = STRBUF_INIT;2148struct ref_filter filter;2149int ret;21502151if(!prefix && !starts_with(pattern,"refs/"))2152strbuf_addstr(&real_pattern,"refs/");2153else if(prefix)2154strbuf_addstr(&real_pattern, prefix);2155strbuf_addstr(&real_pattern, pattern);21562157if(!has_glob_specials(pattern)) {2158/* Append implied '/' '*' if not present. */2159if(real_pattern.buf[real_pattern.len -1] !='/')2160strbuf_addch(&real_pattern,'/');2161/* No need to check for '*', there is none. */2162strbuf_addch(&real_pattern,'*');2163}21642165 filter.pattern = real_pattern.buf;2166 filter.fn = fn;2167 filter.cb_data = cb_data;2168 ret =for_each_ref(filter_refs, &filter);21692170strbuf_release(&real_pattern);2171return ret;2172}21732174intfor_each_glob_ref(each_ref_fn fn,const char*pattern,void*cb_data)2175{2176returnfor_each_glob_ref_in(fn, pattern, NULL, cb_data);2177}21782179intfor_each_rawref(each_ref_fn fn,void*cb_data)2180{2181returndo_for_each_ref(&ref_cache,"", fn,0,2182 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);2183}21842185const char*prettify_refname(const char*name)2186{2187return name + (2188starts_with(name,"refs/heads/") ?11:2189starts_with(name,"refs/tags/") ?10:2190starts_with(name,"refs/remotes/") ?13:21910);2192}21932194static const char*ref_rev_parse_rules[] = {2195"%.*s",2196"refs/%.*s",2197"refs/tags/%.*s",2198"refs/heads/%.*s",2199"refs/remotes/%.*s",2200"refs/remotes/%.*s/HEAD",2201 NULL2202};22032204intrefname_match(const char*abbrev_name,const char*full_name)2205{2206const char**p;2207const int abbrev_name_len =strlen(abbrev_name);22082209for(p = ref_rev_parse_rules; *p; p++) {2210if(!strcmp(full_name,mkpath(*p, abbrev_name_len, abbrev_name))) {2211return1;2212}2213}22142215return0;2216}22172218static voidunlock_ref(struct ref_lock *lock)2219{2220/* Do not free lock->lk -- atexit() still looks at them */2221if(lock->lk)2222rollback_lock_file(lock->lk);2223free(lock->ref_name);2224free(lock->orig_ref_name);2225free(lock);2226}22272228/*2229 * Verify that the reference locked by lock has the value old_sha1.2230 * Fail if the reference doesn't exist and mustexist is set. Return 02231 * on success. On error, write an error message to err, set errno, and2232 * return a negative value.2233 */2234static intverify_lock(struct ref_lock *lock,2235const unsigned char*old_sha1,int mustexist,2236struct strbuf *err)2237{2238assert(err);22392240if(read_ref_full(lock->ref_name,2241 mustexist ? RESOLVE_REF_READING :0,2242 lock->old_oid.hash, NULL)) {2243int save_errno = errno;2244strbuf_addf(err,"can't verify ref%s", lock->ref_name);2245 errno = save_errno;2246return-1;2247}2248if(hashcmp(lock->old_oid.hash, old_sha1)) {2249strbuf_addf(err,"ref%sis at%sbut expected%s",2250 lock->ref_name,2251sha1_to_hex(lock->old_oid.hash),2252sha1_to_hex(old_sha1));2253 errno = EBUSY;2254return-1;2255}2256return0;2257}22582259static intremove_empty_directories(const char*file)2260{2261/* we want to create a file but there is a directory there;2262 * if that is an empty directory (or a directory that contains2263 * only empty directories), remove them.2264 */2265struct strbuf path;2266int result, save_errno;22672268strbuf_init(&path,20);2269strbuf_addstr(&path, file);22702271 result =remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);2272 save_errno = errno;22732274strbuf_release(&path);2275 errno = save_errno;22762277return result;2278}22792280/*2281 * *string and *len will only be substituted, and *string returned (for2282 * later free()ing) if the string passed in is a magic short-hand form2283 * to name a branch.2284 */2285static char*substitute_branch_name(const char**string,int*len)2286{2287struct strbuf buf = STRBUF_INIT;2288int ret =interpret_branch_name(*string, *len, &buf);22892290if(ret == *len) {2291size_t size;2292*string =strbuf_detach(&buf, &size);2293*len = size;2294return(char*)*string;2295}22962297return NULL;2298}22992300intdwim_ref(const char*str,int len,unsigned char*sha1,char**ref)2301{2302char*last_branch =substitute_branch_name(&str, &len);2303const char**p, *r;2304int refs_found =0;23052306*ref = NULL;2307for(p = ref_rev_parse_rules; *p; p++) {2308char fullref[PATH_MAX];2309unsigned char sha1_from_ref[20];2310unsigned char*this_result;2311int flag;23122313 this_result = refs_found ? sha1_from_ref : sha1;2314mksnpath(fullref,sizeof(fullref), *p, len, str);2315 r =resolve_ref_unsafe(fullref, RESOLVE_REF_READING,2316 this_result, &flag);2317if(r) {2318if(!refs_found++)2319*ref =xstrdup(r);2320if(!warn_ambiguous_refs)2321break;2322}else if((flag & REF_ISSYMREF) &&strcmp(fullref,"HEAD")) {2323warning("ignoring dangling symref%s.", fullref);2324}else if((flag & REF_ISBROKEN) &&strchr(fullref,'/')) {2325warning("ignoring broken ref%s.", fullref);2326}2327}2328free(last_branch);2329return refs_found;2330}23312332intdwim_log(const char*str,int len,unsigned char*sha1,char**log)2333{2334char*last_branch =substitute_branch_name(&str, &len);2335const char**p;2336int logs_found =0;23372338*log = NULL;2339for(p = ref_rev_parse_rules; *p; p++) {2340unsigned char hash[20];2341char path[PATH_MAX];2342const char*ref, *it;23432344mksnpath(path,sizeof(path), *p, len, str);2345 ref =resolve_ref_unsafe(path, RESOLVE_REF_READING,2346 hash, NULL);2347if(!ref)2348continue;2349if(reflog_exists(path))2350 it = path;2351else if(strcmp(ref, path) &&reflog_exists(ref))2352 it = ref;2353else2354continue;2355if(!logs_found++) {2356*log =xstrdup(it);2357hashcpy(sha1, hash);2358}2359if(!warn_ambiguous_refs)2360break;2361}2362free(last_branch);2363return logs_found;2364}23652366/*2367 * Locks a ref returning the lock on success and NULL on failure.2368 * On failure errno is set to something meaningful.2369 */2370static struct ref_lock *lock_ref_sha1_basic(const char*refname,2371const unsigned char*old_sha1,2372const struct string_list *extras,2373const struct string_list *skip,2374unsigned int flags,int*type_p,2375struct strbuf *err)2376{2377const char*ref_file;2378const char*orig_refname = refname;2379struct ref_lock *lock;2380int last_errno =0;2381int type, lflags;2382int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2383int resolve_flags =0;2384int attempts_remaining =3;23852386assert(err);23872388 lock =xcalloc(1,sizeof(struct ref_lock));23892390if(mustexist)2391 resolve_flags |= RESOLVE_REF_READING;2392if(flags & REF_DELETING) {2393 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;2394if(flags & REF_NODEREF)2395 resolve_flags |= RESOLVE_REF_NO_RECURSE;2396}23972398 refname =resolve_ref_unsafe(refname, resolve_flags,2399 lock->old_oid.hash, &type);2400if(!refname && errno == EISDIR) {2401/* we are trying to lock foo but we used to2402 * have foo/bar which now does not exist;2403 * it is normal for the empty directory 'foo'2404 * to remain.2405 */2406 ref_file =git_path("%s", orig_refname);2407if(remove_empty_directories(ref_file)) {2408 last_errno = errno;24092410if(!verify_refname_available(orig_refname, extras, skip,2411get_loose_refs(&ref_cache), err))2412strbuf_addf(err,"there are still refs under '%s'",2413 orig_refname);24142415goto error_return;2416}2417 refname =resolve_ref_unsafe(orig_refname, resolve_flags,2418 lock->old_oid.hash, &type);2419}2420if(type_p)2421*type_p = type;2422if(!refname) {2423 last_errno = errno;2424if(last_errno != ENOTDIR ||2425!verify_refname_available(orig_refname, extras, skip,2426get_loose_refs(&ref_cache), err))2427strbuf_addf(err,"unable to resolve reference%s:%s",2428 orig_refname,strerror(last_errno));24292430goto error_return;2431}2432/*2433 * If the ref did not exist and we are creating it, make sure2434 * there is no existing packed ref whose name begins with our2435 * refname, nor a packed ref whose name is a proper prefix of2436 * our refname.2437 */2438if(is_null_oid(&lock->old_oid) &&2439verify_refname_available(refname, extras, skip,2440get_packed_refs(&ref_cache), err)) {2441 last_errno = ENOTDIR;2442goto error_return;2443}24442445 lock->lk =xcalloc(1,sizeof(struct lock_file));24462447 lflags =0;2448if(flags & REF_NODEREF) {2449 refname = orig_refname;2450 lflags |= LOCK_NO_DEREF;2451}2452 lock->ref_name =xstrdup(refname);2453 lock->orig_ref_name =xstrdup(orig_refname);2454 ref_file =git_path("%s", refname);24552456 retry:2457switch(safe_create_leading_directories_const(ref_file)) {2458case SCLD_OK:2459break;/* success */2460case SCLD_VANISHED:2461if(--attempts_remaining >0)2462goto retry;2463/* fall through */2464default:2465 last_errno = errno;2466strbuf_addf(err,"unable to create directory for%s", ref_file);2467goto error_return;2468}24692470if(hold_lock_file_for_update(lock->lk, ref_file, lflags) <0) {2471 last_errno = errno;2472if(errno == ENOENT && --attempts_remaining >0)2473/*2474 * Maybe somebody just deleted one of the2475 * directories leading to ref_file. Try2476 * again:2477 */2478goto retry;2479else{2480unable_to_lock_message(ref_file, errno, err);2481goto error_return;2482}2483}2484if(old_sha1 &&verify_lock(lock, old_sha1, mustexist, err)) {2485 last_errno = errno;2486goto error_return;2487}2488return lock;24892490 error_return:2491unlock_ref(lock);2492 errno = last_errno;2493return NULL;2494}24952496/*2497 * Write an entry to the packed-refs file for the specified refname.2498 * If peeled is non-NULL, write it as the entry's peeled value.2499 */2500static voidwrite_packed_entry(FILE*fh,char*refname,unsigned char*sha1,2501unsigned char*peeled)2502{2503fprintf_or_die(fh,"%s %s\n",sha1_to_hex(sha1), refname);2504if(peeled)2505fprintf_or_die(fh,"^%s\n",sha1_to_hex(peeled));2506}25072508/*2509 * An each_ref_entry_fn that writes the entry to a packed-refs file.2510 */2511static intwrite_packed_entry_fn(struct ref_entry *entry,void*cb_data)2512{2513enum peel_status peel_status =peel_entry(entry,0);25142515if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2516error("internal error:%sis not a valid packed reference!",2517 entry->name);2518write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2519 peel_status == PEEL_PEELED ?2520 entry->u.value.peeled.hash : NULL);2521return0;2522}25232524/*2525 * Lock the packed-refs file for writing. Flags is passed to2526 * hold_lock_file_for_update(). Return 0 on success. On errors, set2527 * errno appropriately and return a nonzero value.2528 */2529static intlock_packed_refs(int flags)2530{2531static int timeout_configured =0;2532static int timeout_value =1000;25332534struct packed_ref_cache *packed_ref_cache;25352536if(!timeout_configured) {2537git_config_get_int("core.packedrefstimeout", &timeout_value);2538 timeout_configured =1;2539}25402541if(hold_lock_file_for_update_timeout(2542&packlock,git_path("packed-refs"),2543 flags, timeout_value) <0)2544return-1;2545/*2546 * Get the current packed-refs while holding the lock. If the2547 * packed-refs file has been modified since we last read it,2548 * this will automatically invalidate the cache and re-read2549 * the packed-refs file.2550 */2551 packed_ref_cache =get_packed_ref_cache(&ref_cache);2552 packed_ref_cache->lock = &packlock;2553/* Increment the reference count to prevent it from being freed: */2554acquire_packed_ref_cache(packed_ref_cache);2555return0;2556}25572558/*2559 * Write the current version of the packed refs cache from memory to2560 * disk. The packed-refs file must already be locked for writing (see2561 * lock_packed_refs()). Return zero on success. On errors, set errno2562 * and return a nonzero value2563 */2564static intcommit_packed_refs(void)2565{2566struct packed_ref_cache *packed_ref_cache =2567get_packed_ref_cache(&ref_cache);2568int error =0;2569int save_errno =0;2570FILE*out;25712572if(!packed_ref_cache->lock)2573die("internal error: packed-refs not locked");25742575 out =fdopen_lock_file(packed_ref_cache->lock,"w");2576if(!out)2577die_errno("unable to fdopen packed-refs descriptor");25782579fprintf_or_die(out,"%s", PACKED_REFS_HEADER);2580do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),25810, write_packed_entry_fn, out);25822583if(commit_lock_file(packed_ref_cache->lock)) {2584 save_errno = errno;2585 error = -1;2586}2587 packed_ref_cache->lock = NULL;2588release_packed_ref_cache(packed_ref_cache);2589 errno = save_errno;2590return error;2591}25922593/*2594 * Rollback the lockfile for the packed-refs file, and discard the2595 * in-memory packed reference cache. (The packed-refs file will be2596 * read anew if it is needed again after this function is called.)2597 */2598static voidrollback_packed_refs(void)2599{2600struct packed_ref_cache *packed_ref_cache =2601get_packed_ref_cache(&ref_cache);26022603if(!packed_ref_cache->lock)2604die("internal error: packed-refs not locked");2605rollback_lock_file(packed_ref_cache->lock);2606 packed_ref_cache->lock = NULL;2607release_packed_ref_cache(packed_ref_cache);2608clear_packed_ref_cache(&ref_cache);2609}26102611struct ref_to_prune {2612struct ref_to_prune *next;2613unsigned char sha1[20];2614char name[FLEX_ARRAY];2615};26162617struct pack_refs_cb_data {2618unsigned int flags;2619struct ref_dir *packed_refs;2620struct ref_to_prune *ref_to_prune;2621};26222623/*2624 * An each_ref_entry_fn that is run over loose references only. If2625 * the loose reference can be packed, add an entry in the packed ref2626 * cache. If the reference should be pruned, also add it to2627 * ref_to_prune in the pack_refs_cb_data.2628 */2629static intpack_if_possible_fn(struct ref_entry *entry,void*cb_data)2630{2631struct pack_refs_cb_data *cb = cb_data;2632enum peel_status peel_status;2633struct ref_entry *packed_entry;2634int is_tag_ref =starts_with(entry->name,"refs/tags/");26352636/* ALWAYS pack tags */2637if(!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2638return0;26392640/* Do not pack symbolic or broken refs: */2641if((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2642return0;26432644/* Add a packed ref cache entry equivalent to the loose entry. */2645 peel_status =peel_entry(entry,1);2646if(peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2647die("internal error peeling reference%s(%s)",2648 entry->name,oid_to_hex(&entry->u.value.oid));2649 packed_entry =find_ref(cb->packed_refs, entry->name);2650if(packed_entry) {2651/* Overwrite existing packed entry with info from loose entry */2652 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2653oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2654}else{2655 packed_entry =create_ref_entry(entry->name, entry->u.value.oid.hash,2656 REF_ISPACKED | REF_KNOWS_PEELED,0);2657add_ref(cb->packed_refs, packed_entry);2658}2659oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);26602661/* Schedule the loose reference for pruning if requested. */2662if((cb->flags & PACK_REFS_PRUNE)) {2663int namelen =strlen(entry->name) +1;2664struct ref_to_prune *n =xcalloc(1,sizeof(*n) + namelen);2665hashcpy(n->sha1, entry->u.value.oid.hash);2666strcpy(n->name, entry->name);2667 n->next = cb->ref_to_prune;2668 cb->ref_to_prune = n;2669}2670return0;2671}26722673/*2674 * Remove empty parents, but spare refs/ and immediate subdirs.2675 * Note: munges *name.2676 */2677static voidtry_remove_empty_parents(char*name)2678{2679char*p, *q;2680int i;2681 p = name;2682for(i =0; i <2; i++) {/* refs/{heads,tags,...}/ */2683while(*p && *p !='/')2684 p++;2685/* tolerate duplicate slashes; see check_refname_format() */2686while(*p =='/')2687 p++;2688}2689for(q = p; *q; q++)2690;2691while(1) {2692while(q > p && *q !='/')2693 q--;2694while(q > p && *(q-1) =='/')2695 q--;2696if(q == p)2697break;2698*q ='\0';2699if(rmdir(git_path("%s", name)))2700break;2701}2702}27032704/* make sure nobody touched the ref, and unlink */2705static voidprune_ref(struct ref_to_prune *r)2706{2707struct ref_transaction *transaction;2708struct strbuf err = STRBUF_INIT;27092710if(check_refname_format(r->name,0))2711return;27122713 transaction =ref_transaction_begin(&err);2714if(!transaction ||2715ref_transaction_delete(transaction, r->name, r->sha1,2716 REF_ISPRUNING, NULL, &err) ||2717ref_transaction_commit(transaction, &err)) {2718ref_transaction_free(transaction);2719error("%s", err.buf);2720strbuf_release(&err);2721return;2722}2723ref_transaction_free(transaction);2724strbuf_release(&err);2725try_remove_empty_parents(r->name);2726}27272728static voidprune_refs(struct ref_to_prune *r)2729{2730while(r) {2731prune_ref(r);2732 r = r->next;2733}2734}27352736intpack_refs(unsigned int flags)2737{2738struct pack_refs_cb_data cbdata;27392740memset(&cbdata,0,sizeof(cbdata));2741 cbdata.flags = flags;27422743lock_packed_refs(LOCK_DIE_ON_ERROR);2744 cbdata.packed_refs =get_packed_refs(&ref_cache);27452746do_for_each_entry_in_dir(get_loose_refs(&ref_cache),0,2747 pack_if_possible_fn, &cbdata);27482749if(commit_packed_refs())2750die_errno("unable to overwrite old ref-pack file");27512752prune_refs(cbdata.ref_to_prune);2753return0;2754}27552756/*2757 * Rewrite the packed-refs file, omitting any refs listed in2758 * 'refnames'. On error, leave packed-refs unchanged, write an error2759 * message to 'err', and return a nonzero value.2760 *2761 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2762 */2763static intrepack_without_refs(struct string_list *refnames,struct strbuf *err)2764{2765struct ref_dir *packed;2766struct string_list_item *refname;2767int ret, needs_repacking =0, removed =0;27682769assert(err);27702771/* Look for a packed ref */2772for_each_string_list_item(refname, refnames) {2773if(get_packed_ref(refname->string)) {2774 needs_repacking =1;2775break;2776}2777}27782779/* Avoid locking if we have nothing to do */2780if(!needs_repacking)2781return0;/* no refname exists in packed refs */27822783if(lock_packed_refs(0)) {2784unable_to_lock_message(git_path("packed-refs"), errno, err);2785return-1;2786}2787 packed =get_packed_refs(&ref_cache);27882789/* Remove refnames from the cache */2790for_each_string_list_item(refname, refnames)2791if(remove_entry(packed, refname->string) != -1)2792 removed =1;2793if(!removed) {2794/*2795 * All packed entries disappeared while we were2796 * acquiring the lock.2797 */2798rollback_packed_refs();2799return0;2800}28012802/* Write what remains */2803 ret =commit_packed_refs();2804if(ret)2805strbuf_addf(err,"unable to overwrite old ref-pack file:%s",2806strerror(errno));2807return ret;2808}28092810static intdelete_ref_loose(struct ref_lock *lock,int flag,struct strbuf *err)2811{2812assert(err);28132814if(!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2815/*2816 * loose. The loose file name is the same as the2817 * lockfile name, minus ".lock":2818 */2819char*loose_filename =get_locked_file_path(lock->lk);2820int res =unlink_or_msg(loose_filename, err);2821free(loose_filename);2822if(res)2823return1;2824}2825return0;2826}28272828intdelete_ref(const char*refname,const unsigned char*old_sha1,2829unsigned int flags)2830{2831struct ref_transaction *transaction;2832struct strbuf err = STRBUF_INIT;28332834/*2835 * Treat NULL_SHA1 and NULL alike, to mean "we don't care what2836 * the old value of the reference was (or even if it didn't2837 * exist)":2838 */2839if(old_sha1 &&is_null_sha1(old_sha1))2840 old_sha1 = NULL;28412842 transaction =ref_transaction_begin(&err);2843if(!transaction ||2844ref_transaction_delete(transaction, refname, old_sha1,2845 flags, NULL, &err) ||2846ref_transaction_commit(transaction, &err)) {2847error("%s", err.buf);2848ref_transaction_free(transaction);2849strbuf_release(&err);2850return1;2851}2852ref_transaction_free(transaction);2853strbuf_release(&err);2854return0;2855}28562857intdelete_refs(struct string_list *refnames)2858{2859struct strbuf err = STRBUF_INIT;2860int i, result =0;28612862if(!refnames->nr)2863return0;28642865 result =repack_without_refs(refnames, &err);2866if(result) {2867/*2868 * If we failed to rewrite the packed-refs file, then2869 * it is unsafe to try to remove loose refs, because2870 * doing so might expose an obsolete packed value for2871 * a reference that might even point at an object that2872 * has been garbage collected.2873 */2874if(refnames->nr ==1)2875error(_("could not delete reference%s:%s"),2876 refnames->items[0].string, err.buf);2877else2878error(_("could not delete references:%s"), err.buf);28792880goto out;2881}28822883for(i =0; i < refnames->nr; i++) {2884const char*refname = refnames->items[i].string;28852886if(delete_ref(refname, NULL,0))2887 result |=error(_("could not remove reference%s"), refname);2888}28892890out:2891strbuf_release(&err);2892return result;2893}28942895/*2896 * People using contrib's git-new-workdir have .git/logs/refs ->2897 * /some/other/path/.git/logs/refs, and that may live on another device.2898 *2899 * IOW, to avoid cross device rename errors, the temporary renamed log must2900 * live into logs/refs.2901 */2902#define TMP_RENAMED_LOG"logs/refs/.tmp-renamed-log"29032904static intrename_tmp_log(const char*newrefname)2905{2906int attempts_remaining =4;29072908 retry:2909switch(safe_create_leading_directories_const(git_path("logs/%s", newrefname))) {2910case SCLD_OK:2911break;/* success */2912case SCLD_VANISHED:2913if(--attempts_remaining >0)2914goto retry;2915/* fall through */2916default:2917error("unable to create directory for%s", newrefname);2918return-1;2919}29202921if(rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", newrefname))) {2922if((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining >0) {2923/*2924 * rename(a, b) when b is an existing2925 * directory ought to result in ISDIR, but2926 * Solaris 5.8 gives ENOTDIR. Sheesh.2927 */2928if(remove_empty_directories(git_path("logs/%s", newrefname))) {2929error("Directory not empty: logs/%s", newrefname);2930return-1;2931}2932goto retry;2933}else if(errno == ENOENT && --attempts_remaining >0) {2934/*2935 * Maybe another process just deleted one of2936 * the directories in the path to newrefname.2937 * Try again from the beginning.2938 */2939goto retry;2940}else{2941error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s:%s",2942 newrefname,strerror(errno));2943return-1;2944}2945}2946return0;2947}29482949static intrename_ref_available(const char*oldname,const char*newname)2950{2951struct string_list skip = STRING_LIST_INIT_NODUP;2952struct strbuf err = STRBUF_INIT;2953int ret;29542955string_list_insert(&skip, oldname);2956 ret = !verify_refname_available(newname, NULL, &skip,2957get_packed_refs(&ref_cache), &err)2958&& !verify_refname_available(newname, NULL, &skip,2959get_loose_refs(&ref_cache), &err);2960if(!ret)2961error("%s", err.buf);29622963string_list_clear(&skip,0);2964strbuf_release(&err);2965return ret;2966}29672968static intwrite_ref_to_lockfile(struct ref_lock *lock,const unsigned char*sha1);2969static intcommit_ref_update(struct ref_lock *lock,2970const unsigned char*sha1,const char*logmsg);29712972intrename_ref(const char*oldrefname,const char*newrefname,const char*logmsg)2973{2974unsigned char sha1[20], orig_sha1[20];2975int flag =0, logmoved =0;2976struct ref_lock *lock;2977struct stat loginfo;2978int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2979const char*symref = NULL;2980struct strbuf err = STRBUF_INIT;29812982if(log &&S_ISLNK(loginfo.st_mode))2983returnerror("reflog for%sis a symlink", oldrefname);29842985 symref =resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,2986 orig_sha1, &flag);2987if(flag & REF_ISSYMREF)2988returnerror("refname%sis a symbolic ref, renaming it is not supported",2989 oldrefname);2990if(!symref)2991returnerror("refname%snot found", oldrefname);29922993if(!rename_ref_available(oldrefname, newrefname))2994return1;29952996if(log &&rename(git_path("logs/%s", oldrefname),git_path(TMP_RENAMED_LOG)))2997returnerror("unable to move logfile logs/%sto "TMP_RENAMED_LOG":%s",2998 oldrefname,strerror(errno));29993000if(delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {3001error("unable to delete old%s", oldrefname);3002goto rollback;3003}30043005if(!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&3006delete_ref(newrefname, sha1, REF_NODEREF)) {3007if(errno==EISDIR) {3008if(remove_empty_directories(git_path("%s", newrefname))) {3009error("Directory not empty:%s", newrefname);3010goto rollback;3011}3012}else{3013error("unable to delete existing%s", newrefname);3014goto rollback;3015}3016}30173018if(log &&rename_tmp_log(newrefname))3019goto rollback;30203021 logmoved = log;30223023 lock =lock_ref_sha1_basic(newrefname, NULL, NULL, NULL,0, NULL, &err);3024if(!lock) {3025error("unable to rename '%s' to '%s':%s", oldrefname, newrefname, err.buf);3026strbuf_release(&err);3027goto rollback;3028}3029hashcpy(lock->old_oid.hash, orig_sha1);30303031if(write_ref_to_lockfile(lock, orig_sha1) ||3032commit_ref_update(lock, orig_sha1, logmsg)) {3033error("unable to write current sha1 into%s", newrefname);3034goto rollback;3035}30363037return0;30383039 rollback:3040 lock =lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL,0, NULL, &err);3041if(!lock) {3042error("unable to lock%sfor rollback:%s", oldrefname, err.buf);3043strbuf_release(&err);3044goto rollbacklog;3045}30463047 flag = log_all_ref_updates;3048 log_all_ref_updates =0;3049if(write_ref_to_lockfile(lock, orig_sha1) ||3050commit_ref_update(lock, orig_sha1, NULL))3051error("unable to write current sha1 into%s", oldrefname);3052 log_all_ref_updates = flag;30533054 rollbacklog:3055if(logmoved &&rename(git_path("logs/%s", newrefname),git_path("logs/%s", oldrefname)))3056error("unable to restore logfile%sfrom%s:%s",3057 oldrefname, newrefname,strerror(errno));3058if(!logmoved && log &&3059rename(git_path(TMP_RENAMED_LOG),git_path("logs/%s", oldrefname)))3060error("unable to restore logfile%sfrom "TMP_RENAMED_LOG":%s",3061 oldrefname,strerror(errno));30623063return1;3064}30653066static intclose_ref(struct ref_lock *lock)3067{3068if(close_lock_file(lock->lk))3069return-1;3070return0;3071}30723073static intcommit_ref(struct ref_lock *lock)3074{3075if(commit_lock_file(lock->lk))3076return-1;3077return0;3078}30793080/*3081 * copy the reflog message msg to buf, which has been allocated sufficiently3082 * large, while cleaning up the whitespaces. Especially, convert LF to space,3083 * because reflog file is one line per entry.3084 */3085static intcopy_msg(char*buf,const char*msg)3086{3087char*cp = buf;3088char c;3089int wasspace =1;30903091*cp++ ='\t';3092while((c = *msg++)) {3093if(wasspace &&isspace(c))3094continue;3095 wasspace =isspace(c);3096if(wasspace)3097 c =' ';3098*cp++ = c;3099}3100while(buf < cp &&isspace(cp[-1]))3101 cp--;3102*cp++ ='\n';3103return cp - buf;3104}31053106/* This function must set a meaningful errno on failure */3107intlog_ref_setup(const char*refname,struct strbuf *sb_logfile)3108{3109int logfd, oflags = O_APPEND | O_WRONLY;3110char*logfile;31113112strbuf_git_path(sb_logfile,"logs/%s", refname);3113 logfile = sb_logfile->buf;3114/* make sure the rest of the function can't change "logfile" */3115 sb_logfile = NULL;3116if(log_all_ref_updates &&3117(starts_with(refname,"refs/heads/") ||3118starts_with(refname,"refs/remotes/") ||3119starts_with(refname,"refs/notes/") ||3120!strcmp(refname,"HEAD"))) {3121if(safe_create_leading_directories(logfile) <0) {3122int save_errno = errno;3123error("unable to create directory for%s", logfile);3124 errno = save_errno;3125return-1;3126}3127 oflags |= O_CREAT;3128}31293130 logfd =open(logfile, oflags,0666);3131if(logfd <0) {3132if(!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))3133return0;31343135if(errno == EISDIR) {3136if(remove_empty_directories(logfile)) {3137int save_errno = errno;3138error("There are still logs under '%s'",3139 logfile);3140 errno = save_errno;3141return-1;3142}3143 logfd =open(logfile, oflags,0666);3144}31453146if(logfd <0) {3147int save_errno = errno;3148error("Unable to append to%s:%s", logfile,3149strerror(errno));3150 errno = save_errno;3151return-1;3152}3153}31543155adjust_shared_perm(logfile);3156close(logfd);3157return0;3158}31593160static intlog_ref_write_fd(int fd,const unsigned char*old_sha1,3161const unsigned char*new_sha1,3162const char*committer,const char*msg)3163{3164int msglen, written;3165unsigned maxlen, len;3166char*logrec;31673168 msglen = msg ?strlen(msg) :0;3169 maxlen =strlen(committer) + msglen +100;3170 logrec =xmalloc(maxlen);3171 len =sprintf(logrec,"%s %s %s\n",3172sha1_to_hex(old_sha1),3173sha1_to_hex(new_sha1),3174 committer);3175if(msglen)3176 len +=copy_msg(logrec + len -1, msg) -1;31773178 written = len <= maxlen ?write_in_full(fd, logrec, len) : -1;3179free(logrec);3180if(written != len)3181return-1;31823183return0;3184}31853186static intlog_ref_write_1(const char*refname,const unsigned char*old_sha1,3187const unsigned char*new_sha1,const char*msg,3188struct strbuf *sb_log_file)3189{3190int logfd, result, oflags = O_APPEND | O_WRONLY;3191char*log_file;31923193if(log_all_ref_updates <0)3194 log_all_ref_updates = !is_bare_repository();31953196 result =log_ref_setup(refname, sb_log_file);3197if(result)3198return result;3199 log_file = sb_log_file->buf;3200/* make sure the rest of the function can't change "log_file" */3201 sb_log_file = NULL;32023203 logfd =open(log_file, oflags);3204if(logfd <0)3205return0;3206 result =log_ref_write_fd(logfd, old_sha1, new_sha1,3207git_committer_info(0), msg);3208if(result) {3209int save_errno = errno;3210close(logfd);3211error("Unable to append to%s", log_file);3212 errno = save_errno;3213return-1;3214}3215if(close(logfd)) {3216int save_errno = errno;3217error("Unable to append to%s", log_file);3218 errno = save_errno;3219return-1;3220}3221return0;3222}32233224static intlog_ref_write(const char*refname,const unsigned char*old_sha1,3225const unsigned char*new_sha1,const char*msg)3226{3227struct strbuf sb = STRBUF_INIT;3228int ret =log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb);3229strbuf_release(&sb);3230return ret;3231}32323233intis_branch(const char*refname)3234{3235return!strcmp(refname,"HEAD") ||starts_with(refname,"refs/heads/");3236}32373238/*3239 * Write sha1 into the open lockfile, then close the lockfile. On3240 * errors, rollback the lockfile and set errno to reflect the problem.3241 */3242static intwrite_ref_to_lockfile(struct ref_lock *lock,3243const unsigned char*sha1)3244{3245static char term ='\n';3246struct object *o;32473248 o =parse_object(sha1);3249if(!o) {3250error("Trying to write ref%swith nonexistent object%s",3251 lock->ref_name,sha1_to_hex(sha1));3252unlock_ref(lock);3253 errno = EINVAL;3254return-1;3255}3256if(o->type != OBJ_COMMIT &&is_branch(lock->ref_name)) {3257error("Trying to write non-commit object%sto branch%s",3258sha1_to_hex(sha1), lock->ref_name);3259unlock_ref(lock);3260 errno = EINVAL;3261return-1;3262}3263if(write_in_full(lock->lk->fd,sha1_to_hex(sha1),40) !=40||3264write_in_full(lock->lk->fd, &term,1) !=1||3265close_ref(lock) <0) {3266int save_errno = errno;3267error("Couldn't write%s", lock->lk->filename.buf);3268unlock_ref(lock);3269 errno = save_errno;3270return-1;3271}3272return0;3273}32743275/*3276 * Commit a change to a loose reference that has already been written3277 * to the loose reference lockfile. Also update the reflogs if3278 * necessary, using the specified lockmsg (which can be NULL).3279 */3280static intcommit_ref_update(struct ref_lock *lock,3281const unsigned char*sha1,const char*logmsg)3282{3283clear_loose_ref_cache(&ref_cache);3284if(log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg) <0||3285(strcmp(lock->ref_name, lock->orig_ref_name) &&3286log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg) <0)) {3287unlock_ref(lock);3288return-1;3289}3290if(strcmp(lock->orig_ref_name,"HEAD") !=0) {3291/*3292 * Special hack: If a branch is updated directly and HEAD3293 * points to it (may happen on the remote side of a push3294 * for example) then logically the HEAD reflog should be3295 * updated too.3296 * A generic solution implies reverse symref information,3297 * but finding all symrefs pointing to the given branch3298 * would be rather costly for this rare event (the direct3299 * update of a branch) to be worth it. So let's cheat and3300 * check with HEAD only which should cover 99% of all usage3301 * scenarios (even 100% of the default ones).3302 */3303unsigned char head_sha1[20];3304int head_flag;3305const char*head_ref;3306 head_ref =resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3307 head_sha1, &head_flag);3308if(head_ref && (head_flag & REF_ISSYMREF) &&3309!strcmp(head_ref, lock->ref_name))3310log_ref_write("HEAD", lock->old_oid.hash, sha1, logmsg);3311}3312if(commit_ref(lock)) {3313error("Couldn't set%s", lock->ref_name);3314unlock_ref(lock);3315return-1;3316}3317unlock_ref(lock);3318return0;3319}33203321intcreate_symref(const char*ref_target,const char*refs_heads_master,3322const char*logmsg)3323{3324const char*lockpath;3325char ref[1000];3326int fd, len, written;3327char*git_HEAD =git_pathdup("%s", ref_target);3328unsigned char old_sha1[20], new_sha1[20];33293330if(logmsg &&read_ref(ref_target, old_sha1))3331hashclr(old_sha1);33323333if(safe_create_leading_directories(git_HEAD) <0)3334returnerror("unable to create directory for%s", git_HEAD);33353336#ifndef NO_SYMLINK_HEAD3337if(prefer_symlink_refs) {3338unlink(git_HEAD);3339if(!symlink(refs_heads_master, git_HEAD))3340goto done;3341fprintf(stderr,"no symlink - falling back to symbolic ref\n");3342}3343#endif33443345 len =snprintf(ref,sizeof(ref),"ref:%s\n", refs_heads_master);3346if(sizeof(ref) <= len) {3347error("refname too long:%s", refs_heads_master);3348goto error_free_return;3349}3350 lockpath =mkpath("%s.lock", git_HEAD);3351 fd =open(lockpath, O_CREAT | O_EXCL | O_WRONLY,0666);3352if(fd <0) {3353error("Unable to open%sfor writing", lockpath);3354goto error_free_return;3355}3356 written =write_in_full(fd, ref, len);3357if(close(fd) !=0|| written != len) {3358error("Unable to write to%s", lockpath);3359goto error_unlink_return;3360}3361if(rename(lockpath, git_HEAD) <0) {3362error("Unable to create%s", git_HEAD);3363goto error_unlink_return;3364}3365if(adjust_shared_perm(git_HEAD)) {3366error("Unable to fix permissions on%s", lockpath);3367 error_unlink_return:3368unlink_or_warn(lockpath);3369 error_free_return:3370free(git_HEAD);3371return-1;3372}33733374#ifndef NO_SYMLINK_HEAD3375 done:3376#endif3377if(logmsg && !read_ref(refs_heads_master, new_sha1))3378log_ref_write(ref_target, old_sha1, new_sha1, logmsg);33793380free(git_HEAD);3381return0;3382}33833384struct read_ref_at_cb {3385const char*refname;3386unsigned long at_time;3387int cnt;3388int reccnt;3389unsigned char*sha1;3390int found_it;33913392unsigned char osha1[20];3393unsigned char nsha1[20];3394int tz;3395unsigned long date;3396char**msg;3397unsigned long*cutoff_time;3398int*cutoff_tz;3399int*cutoff_cnt;3400};34013402static intread_ref_at_ent(unsigned char*osha1,unsigned char*nsha1,3403const char*email,unsigned long timestamp,int tz,3404const char*message,void*cb_data)3405{3406struct read_ref_at_cb *cb = cb_data;34073408 cb->reccnt++;3409 cb->tz = tz;3410 cb->date = timestamp;34113412if(timestamp <= cb->at_time || cb->cnt ==0) {3413if(cb->msg)3414*cb->msg =xstrdup(message);3415if(cb->cutoff_time)3416*cb->cutoff_time = timestamp;3417if(cb->cutoff_tz)3418*cb->cutoff_tz = tz;3419if(cb->cutoff_cnt)3420*cb->cutoff_cnt = cb->reccnt -1;3421/*3422 * we have not yet updated cb->[n|o]sha1 so they still3423 * hold the values for the previous record.3424 */3425if(!is_null_sha1(cb->osha1)) {3426hashcpy(cb->sha1, nsha1);3427if(hashcmp(cb->osha1, nsha1))3428warning("Log for ref%shas gap after%s.",3429 cb->refname,show_date(cb->date, cb->tz, DATE_RFC2822));3430}3431else if(cb->date == cb->at_time)3432hashcpy(cb->sha1, nsha1);3433else if(hashcmp(nsha1, cb->sha1))3434warning("Log for ref%sunexpectedly ended on%s.",3435 cb->refname,show_date(cb->date, cb->tz,3436 DATE_RFC2822));3437hashcpy(cb->osha1, osha1);3438hashcpy(cb->nsha1, nsha1);3439 cb->found_it =1;3440return1;3441}3442hashcpy(cb->osha1, osha1);3443hashcpy(cb->nsha1, nsha1);3444if(cb->cnt >0)3445 cb->cnt--;3446return0;3447}34483449static intread_ref_at_ent_oldest(unsigned char*osha1,unsigned char*nsha1,3450const char*email,unsigned long timestamp,3451int tz,const char*message,void*cb_data)3452{3453struct read_ref_at_cb *cb = cb_data;34543455if(cb->msg)3456*cb->msg =xstrdup(message);3457if(cb->cutoff_time)3458*cb->cutoff_time = timestamp;3459if(cb->cutoff_tz)3460*cb->cutoff_tz = tz;3461if(cb->cutoff_cnt)3462*cb->cutoff_cnt = cb->reccnt;3463hashcpy(cb->sha1, osha1);3464if(is_null_sha1(cb->sha1))3465hashcpy(cb->sha1, nsha1);3466/* We just want the first entry */3467return1;3468}34693470intread_ref_at(const char*refname,unsigned int flags,unsigned long at_time,int cnt,3471unsigned char*sha1,char**msg,3472unsigned long*cutoff_time,int*cutoff_tz,int*cutoff_cnt)3473{3474struct read_ref_at_cb cb;34753476memset(&cb,0,sizeof(cb));3477 cb.refname = refname;3478 cb.at_time = at_time;3479 cb.cnt = cnt;3480 cb.msg = msg;3481 cb.cutoff_time = cutoff_time;3482 cb.cutoff_tz = cutoff_tz;3483 cb.cutoff_cnt = cutoff_cnt;3484 cb.sha1 = sha1;34853486for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);34873488if(!cb.reccnt) {3489if(flags & GET_SHA1_QUIETLY)3490exit(128);3491else3492die("Log for%sis empty.", refname);3493}3494if(cb.found_it)3495return0;34963497for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);34983499return1;3500}35013502intreflog_exists(const char*refname)3503{3504struct stat st;35053506return!lstat(git_path("logs/%s", refname), &st) &&3507S_ISREG(st.st_mode);3508}35093510intdelete_reflog(const char*refname)3511{3512returnremove_path(git_path("logs/%s", refname));3513}35143515static intshow_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn,void*cb_data)3516{3517unsigned char osha1[20], nsha1[20];3518char*email_end, *message;3519unsigned long timestamp;3520int tz;35213522/* old SP new SP name <email> SP time TAB msg LF */3523if(sb->len <83|| sb->buf[sb->len -1] !='\n'||3524get_sha1_hex(sb->buf, osha1) || sb->buf[40] !=' '||3525get_sha1_hex(sb->buf +41, nsha1) || sb->buf[81] !=' '||3526!(email_end =strchr(sb->buf +82,'>')) ||3527 email_end[1] !=' '||3528!(timestamp =strtoul(email_end +2, &message,10)) ||3529!message || message[0] !=' '||3530(message[1] !='+'&& message[1] !='-') ||3531!isdigit(message[2]) || !isdigit(message[3]) ||3532!isdigit(message[4]) || !isdigit(message[5]))3533return0;/* corrupt? */3534 email_end[1] ='\0';3535 tz =strtol(message +1, NULL,10);3536if(message[6] !='\t')3537 message +=6;3538else3539 message +=7;3540returnfn(osha1, nsha1, sb->buf +82, timestamp, tz, message, cb_data);3541}35423543static char*find_beginning_of_line(char*bob,char*scan)3544{3545while(bob < scan && *(--scan) !='\n')3546;/* keep scanning backwards */3547/*3548 * Return either beginning of the buffer, or LF at the end of3549 * the previous line.3550 */3551return scan;3552}35533554intfor_each_reflog_ent_reverse(const char*refname, each_reflog_ent_fn fn,void*cb_data)3555{3556struct strbuf sb = STRBUF_INIT;3557FILE*logfp;3558long pos;3559int ret =0, at_tail =1;35603561 logfp =fopen(git_path("logs/%s", refname),"r");3562if(!logfp)3563return-1;35643565/* Jump to the end */3566if(fseek(logfp,0, SEEK_END) <0)3567returnerror("cannot seek back reflog for%s:%s",3568 refname,strerror(errno));3569 pos =ftell(logfp);3570while(!ret &&0< pos) {3571int cnt;3572size_t nread;3573char buf[BUFSIZ];3574char*endp, *scanp;35753576/* Fill next block from the end */3577 cnt = (sizeof(buf) < pos) ?sizeof(buf) : pos;3578if(fseek(logfp, pos - cnt, SEEK_SET))3579returnerror("cannot seek back reflog for%s:%s",3580 refname,strerror(errno));3581 nread =fread(buf, cnt,1, logfp);3582if(nread !=1)3583returnerror("cannot read%dbytes from reflog for%s:%s",3584 cnt, refname,strerror(errno));3585 pos -= cnt;35863587 scanp = endp = buf + cnt;3588if(at_tail && scanp[-1] =='\n')3589/* Looking at the final LF at the end of the file */3590 scanp--;3591 at_tail =0;35923593while(buf < scanp) {3594/*3595 * terminating LF of the previous line, or the beginning3596 * of the buffer.3597 */3598char*bp;35993600 bp =find_beginning_of_line(buf, scanp);36013602if(*bp =='\n') {3603/*3604 * The newline is the end of the previous line,3605 * so we know we have complete line starting3606 * at (bp + 1). Prefix it onto any prior data3607 * we collected for the line and process it.3608 */3609strbuf_splice(&sb,0,0, bp +1, endp - (bp +1));3610 scanp = bp;3611 endp = bp +1;3612 ret =show_one_reflog_ent(&sb, fn, cb_data);3613strbuf_reset(&sb);3614if(ret)3615break;3616}else if(!pos) {3617/*3618 * We are at the start of the buffer, and the3619 * start of the file; there is no previous3620 * line, and we have everything for this one.3621 * Process it, and we can end the loop.3622 */3623strbuf_splice(&sb,0,0, buf, endp - buf);3624 ret =show_one_reflog_ent(&sb, fn, cb_data);3625strbuf_reset(&sb);3626break;3627}36283629if(bp == buf) {3630/*3631 * We are at the start of the buffer, and there3632 * is more file to read backwards. Which means3633 * we are in the middle of a line. Note that we3634 * may get here even if *bp was a newline; that3635 * just means we are at the exact end of the3636 * previous line, rather than some spot in the3637 * middle.3638 *3639 * Save away what we have to be combined with3640 * the data from the next read.3641 */3642strbuf_splice(&sb,0,0, buf, endp - buf);3643break;3644}3645}36463647}3648if(!ret && sb.len)3649die("BUG: reverse reflog parser had leftover data");36503651fclose(logfp);3652strbuf_release(&sb);3653return ret;3654}36553656intfor_each_reflog_ent(const char*refname, each_reflog_ent_fn fn,void*cb_data)3657{3658FILE*logfp;3659struct strbuf sb = STRBUF_INIT;3660int ret =0;36613662 logfp =fopen(git_path("logs/%s", refname),"r");3663if(!logfp)3664return-1;36653666while(!ret && !strbuf_getwholeline(&sb, logfp,'\n'))3667 ret =show_one_reflog_ent(&sb, fn, cb_data);3668fclose(logfp);3669strbuf_release(&sb);3670return ret;3671}3672/*3673 * Call fn for each reflog in the namespace indicated by name. name3674 * must be empty or end with '/'. Name will be used as a scratch3675 * space, but its contents will be restored before return.3676 */3677static intdo_for_each_reflog(struct strbuf *name, each_ref_fn fn,void*cb_data)3678{3679DIR*d =opendir(git_path("logs/%s", name->buf));3680int retval =0;3681struct dirent *de;3682int oldlen = name->len;36833684if(!d)3685return name->len ? errno :0;36863687while((de =readdir(d)) != NULL) {3688struct stat st;36893690if(de->d_name[0] =='.')3691continue;3692if(ends_with(de->d_name,".lock"))3693continue;3694strbuf_addstr(name, de->d_name);3695if(stat(git_path("logs/%s", name->buf), &st) <0) {3696;/* silently ignore */3697}else{3698if(S_ISDIR(st.st_mode)) {3699strbuf_addch(name,'/');3700 retval =do_for_each_reflog(name, fn, cb_data);3701}else{3702struct object_id oid;37033704if(read_ref_full(name->buf,0, oid.hash, NULL))3705 retval =error("bad ref for%s", name->buf);3706else3707 retval =fn(name->buf, &oid,0, cb_data);3708}3709if(retval)3710break;3711}3712strbuf_setlen(name, oldlen);3713}3714closedir(d);3715return retval;3716}37173718intfor_each_reflog(each_ref_fn fn,void*cb_data)3719{3720int retval;3721struct strbuf name;3722strbuf_init(&name, PATH_MAX);3723 retval =do_for_each_reflog(&name, fn, cb_data);3724strbuf_release(&name);3725return retval;3726}37273728/**3729 * Information needed for a single ref update. Set new_sha1 to the new3730 * value or to null_sha1 to delete the ref. To check the old value3731 * while the ref is locked, set (flags & REF_HAVE_OLD) and set3732 * old_sha1 to the old value, or to null_sha1 to ensure the ref does3733 * not exist before update.3734 */3735struct ref_update {3736/*3737 * If (flags & REF_HAVE_NEW), set the reference to this value:3738 */3739unsigned char new_sha1[20];3740/*3741 * If (flags & REF_HAVE_OLD), check that the reference3742 * previously had this value:3743 */3744unsigned char old_sha1[20];3745/*3746 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,3747 * REF_DELETING, and REF_ISPRUNING:3748 */3749unsigned int flags;3750struct ref_lock *lock;3751int type;3752char*msg;3753const char refname[FLEX_ARRAY];3754};37553756/*3757 * Transaction states.3758 * OPEN: The transaction is in a valid state and can accept new updates.3759 * An OPEN transaction can be committed.3760 * CLOSED: A closed transaction is no longer active and no other operations3761 * than free can be used on it in this state.3762 * A transaction can either become closed by successfully committing3763 * an active transaction or if there is a failure while building3764 * the transaction thus rendering it failed/inactive.3765 */3766enum ref_transaction_state {3767 REF_TRANSACTION_OPEN =0,3768 REF_TRANSACTION_CLOSED =13769};37703771/*3772 * Data structure for holding a reference transaction, which can3773 * consist of checks and updates to multiple references, carried out3774 * as atomically as possible. This structure is opaque to callers.3775 */3776struct ref_transaction {3777struct ref_update **updates;3778size_t alloc;3779size_t nr;3780enum ref_transaction_state state;3781};37823783struct ref_transaction *ref_transaction_begin(struct strbuf *err)3784{3785assert(err);37863787returnxcalloc(1,sizeof(struct ref_transaction));3788}37893790voidref_transaction_free(struct ref_transaction *transaction)3791{3792int i;37933794if(!transaction)3795return;37963797for(i =0; i < transaction->nr; i++) {3798free(transaction->updates[i]->msg);3799free(transaction->updates[i]);3800}3801free(transaction->updates);3802free(transaction);3803}38043805static struct ref_update *add_update(struct ref_transaction *transaction,3806const char*refname)3807{3808size_t len =strlen(refname);3809struct ref_update *update =xcalloc(1,sizeof(*update) + len +1);38103811strcpy((char*)update->refname, refname);3812ALLOC_GROW(transaction->updates, transaction->nr +1, transaction->alloc);3813 transaction->updates[transaction->nr++] = update;3814return update;3815}38163817intref_transaction_update(struct ref_transaction *transaction,3818const char*refname,3819const unsigned char*new_sha1,3820const unsigned char*old_sha1,3821unsigned int flags,const char*msg,3822struct strbuf *err)3823{3824struct ref_update *update;38253826assert(err);38273828if(transaction->state != REF_TRANSACTION_OPEN)3829die("BUG: update called for transaction that is not open");38303831if(new_sha1 && !is_null_sha1(new_sha1) &&3832check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {3833strbuf_addf(err,"refusing to update ref with bad name%s",3834 refname);3835return-1;3836}38373838 update =add_update(transaction, refname);3839if(new_sha1) {3840hashcpy(update->new_sha1, new_sha1);3841 flags |= REF_HAVE_NEW;3842}3843if(old_sha1) {3844hashcpy(update->old_sha1, old_sha1);3845 flags |= REF_HAVE_OLD;3846}3847 update->flags = flags;3848if(msg)3849 update->msg =xstrdup(msg);3850return0;3851}38523853intref_transaction_create(struct ref_transaction *transaction,3854const char*refname,3855const unsigned char*new_sha1,3856unsigned int flags,const char*msg,3857struct strbuf *err)3858{3859if(!new_sha1 ||is_null_sha1(new_sha1))3860die("BUG: create called without valid new_sha1");3861returnref_transaction_update(transaction, refname, new_sha1,3862 null_sha1, flags, msg, err);3863}38643865intref_transaction_delete(struct ref_transaction *transaction,3866const char*refname,3867const unsigned char*old_sha1,3868unsigned int flags,const char*msg,3869struct strbuf *err)3870{3871if(old_sha1 &&is_null_sha1(old_sha1))3872die("BUG: delete called with old_sha1 set to zeros");3873returnref_transaction_update(transaction, refname,3874 null_sha1, old_sha1,3875 flags, msg, err);3876}38773878intref_transaction_verify(struct ref_transaction *transaction,3879const char*refname,3880const unsigned char*old_sha1,3881unsigned int flags,3882struct strbuf *err)3883{3884if(!old_sha1)3885die("BUG: verify called with old_sha1 set to NULL");3886returnref_transaction_update(transaction, refname,3887 NULL, old_sha1,3888 flags, NULL, err);3889}38903891intupdate_ref(const char*msg,const char*refname,3892const unsigned char*new_sha1,const unsigned char*old_sha1,3893unsigned int flags,enum action_on_err onerr)3894{3895struct ref_transaction *t;3896struct strbuf err = STRBUF_INIT;38973898 t =ref_transaction_begin(&err);3899if(!t ||3900ref_transaction_update(t, refname, new_sha1, old_sha1,3901 flags, msg, &err) ||3902ref_transaction_commit(t, &err)) {3903const char*str ="update_ref failed for ref '%s':%s";39043905ref_transaction_free(t);3906switch(onerr) {3907case UPDATE_REFS_MSG_ON_ERR:3908error(str, refname, err.buf);3909break;3910case UPDATE_REFS_DIE_ON_ERR:3911die(str, refname, err.buf);3912break;3913case UPDATE_REFS_QUIET_ON_ERR:3914break;3915}3916strbuf_release(&err);3917return1;3918}3919strbuf_release(&err);3920ref_transaction_free(t);3921return0;3922}39233924static intref_update_reject_duplicates(struct string_list *refnames,3925struct strbuf *err)3926{3927int i, n = refnames->nr;39283929assert(err);39303931for(i =1; i < n; i++)3932if(!strcmp(refnames->items[i -1].string, refnames->items[i].string)) {3933strbuf_addf(err,3934"Multiple updates for ref '%s' not allowed.",3935 refnames->items[i].string);3936return1;3937}3938return0;3939}39403941intref_transaction_commit(struct ref_transaction *transaction,3942struct strbuf *err)3943{3944int ret =0, i;3945int n = transaction->nr;3946struct ref_update **updates = transaction->updates;3947struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3948struct string_list_item *ref_to_delete;3949struct string_list affected_refnames = STRING_LIST_INIT_NODUP;39503951assert(err);39523953if(transaction->state != REF_TRANSACTION_OPEN)3954die("BUG: commit called for transaction that is not open");39553956if(!n) {3957 transaction->state = REF_TRANSACTION_CLOSED;3958return0;3959}39603961/* Fail if a refname appears more than once in the transaction: */3962for(i =0; i < n; i++)3963string_list_append(&affected_refnames, updates[i]->refname);3964string_list_sort(&affected_refnames);3965if(ref_update_reject_duplicates(&affected_refnames, err)) {3966 ret = TRANSACTION_GENERIC_ERROR;3967goto cleanup;3968}39693970/*3971 * Acquire all locks, verify old values if provided, check3972 * that new values are valid, and write new values to the3973 * lockfiles, ready to be activated. Only keep one lockfile3974 * open at a time to avoid running out of file descriptors.3975 */3976for(i =0; i < n; i++) {3977struct ref_update *update = updates[i];39783979if((update->flags & REF_HAVE_NEW) &&3980is_null_sha1(update->new_sha1))3981 update->flags |= REF_DELETING;3982 update->lock =lock_ref_sha1_basic(3983 update->refname,3984((update->flags & REF_HAVE_OLD) ?3985 update->old_sha1 : NULL),3986&affected_refnames, NULL,3987 update->flags,3988&update->type,3989 err);3990if(!update->lock) {3991char*reason;39923993 ret = (errno == ENOTDIR)3994? TRANSACTION_NAME_CONFLICT3995: TRANSACTION_GENERIC_ERROR;3996 reason =strbuf_detach(err, NULL);3997strbuf_addf(err,"cannot lock ref '%s':%s",3998 update->refname, reason);3999free(reason);4000goto cleanup;4001}4002if((update->flags & REF_HAVE_NEW) &&4003!(update->flags & REF_DELETING)) {4004int overwriting_symref = ((update->type & REF_ISSYMREF) &&4005(update->flags & REF_NODEREF));40064007if(!overwriting_symref &&4008!hashcmp(update->lock->old_oid.hash, update->new_sha1)) {4009/*4010 * The reference already has the desired4011 * value, so we don't need to write it.4012 */4013}else if(write_ref_to_lockfile(update->lock,4014 update->new_sha1)) {4015/*4016 * The lock was freed upon failure of4017 * write_ref_to_lockfile():4018 */4019 update->lock = NULL;4020strbuf_addf(err,"cannot update the ref '%s'.",4021 update->refname);4022 ret = TRANSACTION_GENERIC_ERROR;4023goto cleanup;4024}else{4025 update->flags |= REF_NEEDS_COMMIT;4026}4027}4028if(!(update->flags & REF_NEEDS_COMMIT)) {4029/*4030 * We didn't have to write anything to the lockfile.4031 * Close it to free up the file descriptor:4032 */4033if(close_ref(update->lock)) {4034strbuf_addf(err,"Couldn't close%s.lock",4035 update->refname);4036goto cleanup;4037}4038}4039}40404041/* Perform updates first so live commits remain referenced */4042for(i =0; i < n; i++) {4043struct ref_update *update = updates[i];40444045if(update->flags & REF_NEEDS_COMMIT) {4046if(commit_ref_update(update->lock,4047 update->new_sha1, update->msg)) {4048/* freed by commit_ref_update(): */4049 update->lock = NULL;4050strbuf_addf(err,"Cannot update the ref '%s'.",4051 update->refname);4052 ret = TRANSACTION_GENERIC_ERROR;4053goto cleanup;4054}else{4055/* freed by commit_ref_update(): */4056 update->lock = NULL;4057}4058}4059}40604061/* Perform deletes now that updates are safely completed */4062for(i =0; i < n; i++) {4063struct ref_update *update = updates[i];40644065if(update->flags & REF_DELETING) {4066if(delete_ref_loose(update->lock, update->type, err)) {4067 ret = TRANSACTION_GENERIC_ERROR;4068goto cleanup;4069}40704071if(!(update->flags & REF_ISPRUNING))4072string_list_append(&refs_to_delete,4073 update->lock->ref_name);4074}4075}40764077if(repack_without_refs(&refs_to_delete, err)) {4078 ret = TRANSACTION_GENERIC_ERROR;4079goto cleanup;4080}4081for_each_string_list_item(ref_to_delete, &refs_to_delete)4082unlink_or_warn(git_path("logs/%s", ref_to_delete->string));4083clear_loose_ref_cache(&ref_cache);40844085cleanup:4086 transaction->state = REF_TRANSACTION_CLOSED;40874088for(i =0; i < n; i++)4089if(updates[i]->lock)4090unlock_ref(updates[i]->lock);4091string_list_clear(&refs_to_delete,0);4092string_list_clear(&affected_refnames,0);4093return ret;4094}40954096intinitial_ref_transaction_commit(struct ref_transaction *transaction,4097struct strbuf *err)4098{4099int ret =0, i;4100int n = transaction->nr;4101struct ref_update **updates = transaction->updates;41024103assert(err);41044105if(transaction->state != REF_TRANSACTION_OPEN)4106die("BUG: commit called for transaction that is not open");41074108for(i =0; i < n; i++) {4109struct ref_update *update = updates[i];41104111if((update->flags & REF_HAVE_OLD) &&4112!is_null_sha1(update->old_sha1))4113die("BUG: initial ref transaction with old_sha1 set");4114}41154116if(lock_packed_refs(0)) {4117strbuf_addf(err,"unable to lock packed-refs file:%s",4118strerror(errno));4119 ret = TRANSACTION_GENERIC_ERROR;4120goto cleanup;4121}41224123for(i =0; i < n; i++) {4124struct ref_update *update = updates[i];41254126if((update->flags & REF_HAVE_NEW) &&4127!is_null_sha1(update->new_sha1))4128add_packed_ref(update->refname, update->new_sha1);4129}41304131if(commit_packed_refs()) {4132strbuf_addf(err,"unable to commit packed-refs file:%s",4133strerror(errno));4134 ret = TRANSACTION_GENERIC_ERROR;4135goto cleanup;4136}41374138cleanup:4139 transaction->state = REF_TRANSACTION_CLOSED;4140return ret;4141}41424143char*shorten_unambiguous_ref(const char*refname,int strict)4144{4145int i;4146static char**scanf_fmts;4147static int nr_rules;4148char*short_name;41494150if(!nr_rules) {4151/*4152 * Pre-generate scanf formats from ref_rev_parse_rules[].4153 * Generate a format suitable for scanf from a4154 * ref_rev_parse_rules rule by interpolating "%s" at the4155 * location of the "%.*s".4156 */4157size_t total_len =0;4158size_t offset =0;41594160/* the rule list is NULL terminated, count them first */4161for(nr_rules =0; ref_rev_parse_rules[nr_rules]; nr_rules++)4162/* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */4163 total_len +=strlen(ref_rev_parse_rules[nr_rules]) -2+1;41644165 scanf_fmts =xmalloc(nr_rules *sizeof(char*) + total_len);41664167 offset =0;4168for(i =0; i < nr_rules; i++) {4169assert(offset < total_len);4170 scanf_fmts[i] = (char*)&scanf_fmts[nr_rules] + offset;4171 offset +=snprintf(scanf_fmts[i], total_len - offset,4172 ref_rev_parse_rules[i],2,"%s") +1;4173}4174}41754176/* bail out if there are no rules */4177if(!nr_rules)4178returnxstrdup(refname);41794180/* buffer for scanf result, at most refname must fit */4181 short_name =xstrdup(refname);41824183/* skip first rule, it will always match */4184for(i = nr_rules -1; i >0; --i) {4185int j;4186int rules_to_fail = i;4187int short_name_len;41884189if(1!=sscanf(refname, scanf_fmts[i], short_name))4190continue;41914192 short_name_len =strlen(short_name);41934194/*4195 * in strict mode, all (except the matched one) rules4196 * must fail to resolve to a valid non-ambiguous ref4197 */4198if(strict)4199 rules_to_fail = nr_rules;42004201/*4202 * check if the short name resolves to a valid ref,4203 * but use only rules prior to the matched one4204 */4205for(j =0; j < rules_to_fail; j++) {4206const char*rule = ref_rev_parse_rules[j];4207char refname[PATH_MAX];42084209/* skip matched rule */4210if(i == j)4211continue;42124213/*4214 * the short name is ambiguous, if it resolves4215 * (with this previous rule) to a valid ref4216 * read_ref() returns 0 on success4217 */4218mksnpath(refname,sizeof(refname),4219 rule, short_name_len, short_name);4220if(ref_exists(refname))4221break;4222}42234224/*4225 * short name is non-ambiguous if all previous rules4226 * haven't resolved to a valid ref4227 */4228if(j == rules_to_fail)4229return short_name;4230}42314232free(short_name);4233returnxstrdup(refname);4234}42354236static struct string_list *hide_refs;42374238intparse_hide_refs_config(const char*var,const char*value,const char*section)4239{4240if(!strcmp("transfer.hiderefs", var) ||4241/* NEEDSWORK: use parse_config_key() once both are merged */4242(starts_with(var, section) && var[strlen(section)] =='.'&&4243!strcmp(var +strlen(section),".hiderefs"))) {4244char*ref;4245int len;42464247if(!value)4248returnconfig_error_nonbool(var);4249 ref =xstrdup(value);4250 len =strlen(ref);4251while(len && ref[len -1] =='/')4252 ref[--len] ='\0';4253if(!hide_refs) {4254 hide_refs =xcalloc(1,sizeof(*hide_refs));4255 hide_refs->strdup_strings =1;4256}4257string_list_append(hide_refs, ref);4258}4259return0;4260}42614262intref_is_hidden(const char*refname)4263{4264struct string_list_item *item;42654266if(!hide_refs)4267return0;4268for_each_string_list_item(item, hide_refs) {4269int len;4270if(!starts_with(refname, item->string))4271continue;4272 len =strlen(item->string);4273if(!refname[len] || refname[len] =='/')4274return1;4275}4276return0;4277}42784279struct expire_reflog_cb {4280unsigned int flags;4281 reflog_expiry_should_prune_fn *should_prune_fn;4282void*policy_cb;4283FILE*newlog;4284unsigned char last_kept_sha1[20];4285};42864287static intexpire_reflog_ent(unsigned char*osha1,unsigned char*nsha1,4288const char*email,unsigned long timestamp,int tz,4289const char*message,void*cb_data)4290{4291struct expire_reflog_cb *cb = cb_data;4292struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;42934294if(cb->flags & EXPIRE_REFLOGS_REWRITE)4295 osha1 = cb->last_kept_sha1;42964297if((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,4298 message, policy_cb)) {4299if(!cb->newlog)4300printf("would prune%s", message);4301else if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4302printf("prune%s", message);4303}else{4304if(cb->newlog) {4305fprintf(cb->newlog,"%s %s %s %lu %+05d\t%s",4306sha1_to_hex(osha1),sha1_to_hex(nsha1),4307 email, timestamp, tz, message);4308hashcpy(cb->last_kept_sha1, nsha1);4309}4310if(cb->flags & EXPIRE_REFLOGS_VERBOSE)4311printf("keep%s", message);4312}4313return0;4314}43154316intreflog_expire(const char*refname,const unsigned char*sha1,4317unsigned int flags,4318 reflog_expiry_prepare_fn prepare_fn,4319 reflog_expiry_should_prune_fn should_prune_fn,4320 reflog_expiry_cleanup_fn cleanup_fn,4321void*policy_cb_data)4322{4323static struct lock_file reflog_lock;4324struct expire_reflog_cb cb;4325struct ref_lock *lock;4326char*log_file;4327int status =0;4328int type;4329struct strbuf err = STRBUF_INIT;43304331memset(&cb,0,sizeof(cb));4332 cb.flags = flags;4333 cb.policy_cb = policy_cb_data;4334 cb.should_prune_fn = should_prune_fn;43354336/*4337 * The reflog file is locked by holding the lock on the4338 * reference itself, plus we might need to update the4339 * reference if --updateref was specified:4340 */4341 lock =lock_ref_sha1_basic(refname, sha1, NULL, NULL,0, &type, &err);4342if(!lock) {4343error("cannot lock ref '%s':%s", refname, err.buf);4344strbuf_release(&err);4345return-1;4346}4347if(!reflog_exists(refname)) {4348unlock_ref(lock);4349return0;4350}43514352 log_file =git_pathdup("logs/%s", refname);4353if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4354/*4355 * Even though holding $GIT_DIR/logs/$reflog.lock has4356 * no locking implications, we use the lock_file4357 * machinery here anyway because it does a lot of the4358 * work we need, including cleaning up if the program4359 * exits unexpectedly.4360 */4361if(hold_lock_file_for_update(&reflog_lock, log_file,0) <0) {4362struct strbuf err = STRBUF_INIT;4363unable_to_lock_message(log_file, errno, &err);4364error("%s", err.buf);4365strbuf_release(&err);4366goto failure;4367}4368 cb.newlog =fdopen_lock_file(&reflog_lock,"w");4369if(!cb.newlog) {4370error("cannot fdopen%s(%s)",4371 reflog_lock.filename.buf,strerror(errno));4372goto failure;4373}4374}43754376(*prepare_fn)(refname, sha1, cb.policy_cb);4377for_each_reflog_ent(refname, expire_reflog_ent, &cb);4378(*cleanup_fn)(cb.policy_cb);43794380if(!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4381/*4382 * It doesn't make sense to adjust a reference pointed4383 * to by a symbolic ref based on expiring entries in4384 * the symbolic reference's reflog. Nor can we update4385 * a reference if there are no remaining reflog4386 * entries.4387 */4388int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4389!(type & REF_ISSYMREF) &&4390!is_null_sha1(cb.last_kept_sha1);43914392if(close_lock_file(&reflog_lock)) {4393 status |=error("couldn't write%s:%s", log_file,4394strerror(errno));4395}else if(update &&4396(write_in_full(lock->lk->fd,4397sha1_to_hex(cb.last_kept_sha1),40) !=40||4398write_str_in_full(lock->lk->fd,"\n") !=1||4399close_ref(lock) <0)) {4400 status |=error("couldn't write%s",4401 lock->lk->filename.buf);4402rollback_lock_file(&reflog_lock);4403}else if(commit_lock_file(&reflog_lock)) {4404 status |=error("unable to commit reflog '%s' (%s)",4405 log_file,strerror(errno));4406}else if(update &&commit_ref(lock)) {4407 status |=error("couldn't set%s", lock->ref_name);4408}4409}4410free(log_file);4411unlock_ref(lock);4412return status;44134414 failure:4415rollback_lock_file(&reflog_lock);4416free(log_file);4417unlock_ref(lock);4418return-1;4419}