1#include "../cache.h" 2#include "../refs.h" 3#include "refs-internal.h" 4#include "../iterator.h" 5#include "../dir-iterator.h" 6#include "../lockfile.h" 7#include "../object.h" 8#include "../dir.h" 9 10struct ref_lock { 11 char *ref_name; 12 struct lock_file *lk; 13 struct object_id old_oid; 14}; 15 16struct ref_entry; 17 18/* 19 * Information used (along with the information in ref_entry) to 20 * describe a single cached reference. This data structure only 21 * occurs embedded in a union in struct ref_entry, and only when 22 * (ref_entry->flag & REF_DIR) is zero. 23 */ 24struct ref_value { 25 /* 26 * The name of the object to which this reference resolves 27 * (which may be a tag object). If REF_ISBROKEN, this is 28 * null. If REF_ISSYMREF, then this is the name of the object 29 * referred to by the last reference in the symlink chain. 30 */ 31 struct object_id oid; 32 33 /* 34 * If REF_KNOWS_PEELED, then this field holds the peeled value 35 * of this reference, or null if the reference is known not to 36 * be peelable. See the documentation for peel_ref() for an 37 * exact definition of "peelable". 38 */ 39 struct object_id peeled; 40}; 41 42struct ref_cache; 43 44/* 45 * Information used (along with the information in ref_entry) to 46 * describe a level in the hierarchy of references. This data 47 * structure only occurs embedded in a union in struct ref_entry, and 48 * only when (ref_entry.flag & REF_DIR) is set. In that case, 49 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 50 * in the directory have already been read: 51 * 52 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 53 * or packed references, already read. 54 * 55 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 56 * references that hasn't been read yet (nor has any of its 57 * subdirectories). 58 * 59 * Entries within a directory are stored within a growable array of 60 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 61 * sorted are sorted by their component name in strcmp() order and the 62 * remaining entries are unsorted. 63 * 64 * Loose references are read lazily, one directory at a time. When a 65 * directory of loose references is read, then all of the references 66 * in that directory are stored, and REF_INCOMPLETE stubs are created 67 * for any subdirectories, but the subdirectories themselves are not 68 * read. The reading is triggered by get_ref_dir(). 69 */ 70struct ref_dir { 71 int nr, alloc; 72 73 /* 74 * Entries with index 0 <= i < sorted are sorted by name. New 75 * entries are appended to the list unsorted, and are sorted 76 * only when required; thus we avoid the need to sort the list 77 * after the addition of every reference. 78 */ 79 int sorted; 80 81 /* A pointer to the ref_cache that contains this ref_dir. */ 82 struct ref_cache *ref_cache; 83 84 struct ref_entry **entries; 85}; 86 87/* 88 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 89 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 90 * public values; see refs.h. 91 */ 92 93/* 94 * The field ref_entry->u.value.peeled of this value entry contains 95 * the correct peeled value for the reference, which might be 96 * null_sha1 if the reference is not a tag or if it is broken. 97 */ 98#define REF_KNOWS_PEELED 0x10 99 100/* ref_entry represents a directory of references */ 101#define REF_DIR 0x20 102 103/* 104 * Entry has not yet been read from disk (used only for REF_DIR 105 * entries representing loose references) 106 */ 107#define REF_INCOMPLETE 0x40 108 109/* 110 * A ref_entry represents either a reference or a "subdirectory" of 111 * references. 112 * 113 * Each directory in the reference namespace is represented by a 114 * ref_entry with (flags & REF_DIR) set and containing a subdir member 115 * that holds the entries in that directory that have been read so 116 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 117 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 118 * used for loose reference directories. 119 * 120 * References are represented by a ref_entry with (flags & REF_DIR) 121 * unset and a value member that describes the reference's value. The 122 * flag member is at the ref_entry level, but it is also needed to 123 * interpret the contents of the value field (in other words, a 124 * ref_value object is not very much use without the enclosing 125 * ref_entry). 126 * 127 * Reference names cannot end with slash and directories' names are 128 * always stored with a trailing slash (except for the top-level 129 * directory, which is always denoted by ""). This has two nice 130 * consequences: (1) when the entries in each subdir are sorted 131 * lexicographically by name (as they usually are), the references in 132 * a whole tree can be generated in lexicographic order by traversing 133 * the tree in left-to-right, depth-first order; (2) the names of 134 * references and subdirectories cannot conflict, and therefore the 135 * presence of an empty subdirectory does not block the creation of a 136 * similarly-named reference. (The fact that reference names with the 137 * same leading components can conflict *with each other* is a 138 * separate issue that is regulated by verify_refname_available().) 139 * 140 * Please note that the name field contains the fully-qualified 141 * reference (or subdirectory) name. Space could be saved by only 142 * storing the relative names. But that would require the full names 143 * to be generated on the fly when iterating in do_for_each_ref(), and 144 * would break callback functions, who have always been able to assume 145 * that the name strings that they are passed will not be freed during 146 * the iteration. 147 */ 148struct ref_entry { 149 unsigned char flag; /* ISSYMREF? ISPACKED? */ 150 union { 151 struct ref_value value; /* if not (flags&REF_DIR) */ 152 struct ref_dir subdir; /* if (flags&REF_DIR) */ 153 } u; 154 /* 155 * The full name of the reference (e.g., "refs/heads/master") 156 * or the full name of the directory with a trailing slash 157 * (e.g., "refs/heads/"): 158 */ 159 char name[FLEX_ARRAY]; 160}; 161 162static void read_loose_refs(const char *dirname, struct ref_dir *dir); 163static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len); 164static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 165 const char *dirname, size_t len, 166 int incomplete); 167static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry); 168 169static struct ref_dir *get_ref_dir(struct ref_entry *entry) 170{ 171 struct ref_dir *dir; 172 assert(entry->flag & REF_DIR); 173 dir = &entry->u.subdir; 174 if (entry->flag & REF_INCOMPLETE) { 175 read_loose_refs(entry->name, dir); 176 177 /* 178 * Manually add refs/bisect, which, being 179 * per-worktree, might not appear in the directory 180 * listing for refs/ in the main repo. 181 */ 182 if (!strcmp(entry->name, "refs/")) { 183 int pos = search_ref_dir(dir, "refs/bisect/", 12); 184 if (pos < 0) { 185 struct ref_entry *child_entry; 186 child_entry = create_dir_entry(dir->ref_cache, 187 "refs/bisect/", 188 12, 1); 189 add_entry_to_dir(dir, child_entry); 190 read_loose_refs("refs/bisect", 191 &child_entry->u.subdir); 192 } 193 } 194 entry->flag &= ~REF_INCOMPLETE; 195 } 196 return dir; 197} 198 199static struct ref_entry *create_ref_entry(const char *refname, 200 const unsigned char *sha1, int flag, 201 int check_name) 202{ 203 struct ref_entry *ref; 204 205 if (check_name && 206 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 207 die("Reference has invalid format: '%s'", refname); 208 FLEX_ALLOC_STR(ref, name, refname); 209 hashcpy(ref->u.value.oid.hash, sha1); 210 oidclr(&ref->u.value.peeled); 211 ref->flag = flag; 212 return ref; 213} 214 215static void clear_ref_dir(struct ref_dir *dir); 216 217static void free_ref_entry(struct ref_entry *entry) 218{ 219 if (entry->flag & REF_DIR) { 220 /* 221 * Do not use get_ref_dir() here, as that might 222 * trigger the reading of loose refs. 223 */ 224 clear_ref_dir(&entry->u.subdir); 225 } 226 free(entry); 227} 228 229/* 230 * Add a ref_entry to the end of dir (unsorted). Entry is always 231 * stored directly in dir; no recursion into subdirectories is 232 * done. 233 */ 234static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry) 235{ 236 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc); 237 dir->entries[dir->nr++] = entry; 238 /* optimize for the case that entries are added in order */ 239 if (dir->nr == 1 || 240 (dir->nr == dir->sorted + 1 && 241 strcmp(dir->entries[dir->nr - 2]->name, 242 dir->entries[dir->nr - 1]->name) < 0)) 243 dir->sorted = dir->nr; 244} 245 246/* 247 * Clear and free all entries in dir, recursively. 248 */ 249static void clear_ref_dir(struct ref_dir *dir) 250{ 251 int i; 252 for (i = 0; i < dir->nr; i++) 253 free_ref_entry(dir->entries[i]); 254 free(dir->entries); 255 dir->sorted = dir->nr = dir->alloc = 0; 256 dir->entries = NULL; 257} 258 259/* 260 * Create a struct ref_entry object for the specified dirname. 261 * dirname is the name of the directory with a trailing slash (e.g., 262 * "refs/heads/") or "" for the top-level directory. 263 */ 264static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 265 const char *dirname, size_t len, 266 int incomplete) 267{ 268 struct ref_entry *direntry; 269 FLEX_ALLOC_MEM(direntry, name, dirname, len); 270 direntry->u.subdir.ref_cache = ref_cache; 271 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0); 272 return direntry; 273} 274 275static int ref_entry_cmp(const void *a, const void *b) 276{ 277 struct ref_entry *one = *(struct ref_entry **)a; 278 struct ref_entry *two = *(struct ref_entry **)b; 279 return strcmp(one->name, two->name); 280} 281 282static void sort_ref_dir(struct ref_dir *dir); 283 284struct string_slice { 285 size_t len; 286 const char *str; 287}; 288 289static int ref_entry_cmp_sslice(const void *key_, const void *ent_) 290{ 291 const struct string_slice *key = key_; 292 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_; 293 int cmp = strncmp(key->str, ent->name, key->len); 294 if (cmp) 295 return cmp; 296 return '\0' - (unsigned char)ent->name[key->len]; 297} 298 299/* 300 * Return the index of the entry with the given refname from the 301 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 302 * no such entry is found. dir must already be complete. 303 */ 304static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len) 305{ 306 struct ref_entry **r; 307 struct string_slice key; 308 309 if (refname == NULL || !dir->nr) 310 return -1; 311 312 sort_ref_dir(dir); 313 key.len = len; 314 key.str = refname; 315 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries), 316 ref_entry_cmp_sslice); 317 318 if (r == NULL) 319 return -1; 320 321 return r - dir->entries; 322} 323 324/* 325 * Search for a directory entry directly within dir (without 326 * recursing). Sort dir if necessary. subdirname must be a directory 327 * name (i.e., end in '/'). If mkdir is set, then create the 328 * directory if it is missing; otherwise, return NULL if the desired 329 * directory cannot be found. dir must already be complete. 330 */ 331static struct ref_dir *search_for_subdir(struct ref_dir *dir, 332 const char *subdirname, size_t len, 333 int mkdir) 334{ 335 int entry_index = search_ref_dir(dir, subdirname, len); 336 struct ref_entry *entry; 337 if (entry_index == -1) { 338 if (!mkdir) 339 return NULL; 340 /* 341 * Since dir is complete, the absence of a subdir 342 * means that the subdir really doesn't exist; 343 * therefore, create an empty record for it but mark 344 * the record complete. 345 */ 346 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0); 347 add_entry_to_dir(dir, entry); 348 } else { 349 entry = dir->entries[entry_index]; 350 } 351 return get_ref_dir(entry); 352} 353 354/* 355 * If refname is a reference name, find the ref_dir within the dir 356 * tree that should hold refname. If refname is a directory name 357 * (i.e., ends in '/'), then return that ref_dir itself. dir must 358 * represent the top-level directory and must already be complete. 359 * Sort ref_dirs and recurse into subdirectories as necessary. If 360 * mkdir is set, then create any missing directories; otherwise, 361 * return NULL if the desired directory cannot be found. 362 */ 363static struct ref_dir *find_containing_dir(struct ref_dir *dir, 364 const char *refname, int mkdir) 365{ 366 const char *slash; 367 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 368 size_t dirnamelen = slash - refname + 1; 369 struct ref_dir *subdir; 370 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir); 371 if (!subdir) { 372 dir = NULL; 373 break; 374 } 375 dir = subdir; 376 } 377 378 return dir; 379} 380 381/* 382 * Find the value entry with the given name in dir, sorting ref_dirs 383 * and recursing into subdirectories as necessary. If the name is not 384 * found or it corresponds to a directory entry, return NULL. 385 */ 386static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname) 387{ 388 int entry_index; 389 struct ref_entry *entry; 390 dir = find_containing_dir(dir, refname, 0); 391 if (!dir) 392 return NULL; 393 entry_index = search_ref_dir(dir, refname, strlen(refname)); 394 if (entry_index == -1) 395 return NULL; 396 entry = dir->entries[entry_index]; 397 return (entry->flag & REF_DIR) ? NULL : entry; 398} 399 400/* 401 * Remove the entry with the given name from dir, recursing into 402 * subdirectories as necessary. If refname is the name of a directory 403 * (i.e., ends with '/'), then remove the directory and its contents. 404 * If the removal was successful, return the number of entries 405 * remaining in the directory entry that contained the deleted entry. 406 * If the name was not found, return -1. Please note that this 407 * function only deletes the entry from the cache; it does not delete 408 * it from the filesystem or ensure that other cache entries (which 409 * might be symbolic references to the removed entry) are updated. 410 * Nor does it remove any containing dir entries that might be made 411 * empty by the removal. dir must represent the top-level directory 412 * and must already be complete. 413 */ 414static int remove_entry(struct ref_dir *dir, const char *refname) 415{ 416 int refname_len = strlen(refname); 417 int entry_index; 418 struct ref_entry *entry; 419 int is_dir = refname[refname_len - 1] == '/'; 420 if (is_dir) { 421 /* 422 * refname represents a reference directory. Remove 423 * the trailing slash; otherwise we will get the 424 * directory *representing* refname rather than the 425 * one *containing* it. 426 */ 427 char *dirname = xmemdupz(refname, refname_len - 1); 428 dir = find_containing_dir(dir, dirname, 0); 429 free(dirname); 430 } else { 431 dir = find_containing_dir(dir, refname, 0); 432 } 433 if (!dir) 434 return -1; 435 entry_index = search_ref_dir(dir, refname, refname_len); 436 if (entry_index == -1) 437 return -1; 438 entry = dir->entries[entry_index]; 439 440 memmove(&dir->entries[entry_index], 441 &dir->entries[entry_index + 1], 442 (dir->nr - entry_index - 1) * sizeof(*dir->entries) 443 ); 444 dir->nr--; 445 if (dir->sorted > entry_index) 446 dir->sorted--; 447 free_ref_entry(entry); 448 return dir->nr; 449} 450 451/* 452 * Add a ref_entry to the ref_dir (unsorted), recursing into 453 * subdirectories as necessary. dir must represent the top-level 454 * directory. Return 0 on success. 455 */ 456static int add_ref(struct ref_dir *dir, struct ref_entry *ref) 457{ 458 dir = find_containing_dir(dir, ref->name, 1); 459 if (!dir) 460 return -1; 461 add_entry_to_dir(dir, ref); 462 return 0; 463} 464 465/* 466 * Emit a warning and return true iff ref1 and ref2 have the same name 467 * and the same sha1. Die if they have the same name but different 468 * sha1s. 469 */ 470static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2) 471{ 472 if (strcmp(ref1->name, ref2->name)) 473 return 0; 474 475 /* Duplicate name; make sure that they don't conflict: */ 476 477 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 478 /* This is impossible by construction */ 479 die("Reference directory conflict: %s", ref1->name); 480 481 if (oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 482 die("Duplicated ref, and SHA1s don't match: %s", ref1->name); 483 484 warning("Duplicated ref: %s", ref1->name); 485 return 1; 486} 487 488/* 489 * Sort the entries in dir non-recursively (if they are not already 490 * sorted) and remove any duplicate entries. 491 */ 492static void sort_ref_dir(struct ref_dir *dir) 493{ 494 int i, j; 495 struct ref_entry *last = NULL; 496 497 /* 498 * This check also prevents passing a zero-length array to qsort(), 499 * which is a problem on some platforms. 500 */ 501 if (dir->sorted == dir->nr) 502 return; 503 504 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp); 505 506 /* Remove any duplicates: */ 507 for (i = 0, j = 0; j < dir->nr; j++) { 508 struct ref_entry *entry = dir->entries[j]; 509 if (last && is_dup_ref(last, entry)) 510 free_ref_entry(entry); 511 else 512 last = dir->entries[i++] = entry; 513 } 514 dir->sorted = dir->nr = i; 515} 516 517/* 518 * Return true if refname, which has the specified oid and flags, can 519 * be resolved to an object in the database. If the referred-to object 520 * does not exist, emit a warning and return false. 521 */ 522static int ref_resolves_to_object(const char *refname, 523 const struct object_id *oid, 524 unsigned int flags) 525{ 526 if (flags & REF_ISBROKEN) 527 return 0; 528 if (!has_sha1_file(oid->hash)) { 529 error("%s does not point to a valid object!", refname); 530 return 0; 531 } 532 return 1; 533} 534 535/* 536 * Return true if the reference described by entry can be resolved to 537 * an object in the database; otherwise, emit a warning and return 538 * false. 539 */ 540static int entry_resolves_to_object(struct ref_entry *entry) 541{ 542 return ref_resolves_to_object(entry->name, 543 &entry->u.value.oid, entry->flag); 544} 545 546typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data); 547 548/* 549 * Call fn for each reference in dir that has index in the range 550 * offset <= index < dir->nr. Recurse into subdirectories that are in 551 * that index range, sorting them before iterating. This function 552 * does not sort dir itself; it should be sorted beforehand. fn is 553 * called for all references, including broken ones. 554 */ 555static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset, 556 each_ref_entry_fn fn, void *cb_data) 557{ 558 int i; 559 assert(dir->sorted == dir->nr); 560 for (i = offset; i < dir->nr; i++) { 561 struct ref_entry *entry = dir->entries[i]; 562 int retval; 563 if (entry->flag & REF_DIR) { 564 struct ref_dir *subdir = get_ref_dir(entry); 565 sort_ref_dir(subdir); 566 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data); 567 } else { 568 retval = fn(entry, cb_data); 569 } 570 if (retval) 571 return retval; 572 } 573 return 0; 574} 575 576/* 577 * Load all of the refs from the dir into our in-memory cache. The hard work 578 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 579 * through all of the sub-directories. We do not even need to care about 580 * sorting, as traversal order does not matter to us. 581 */ 582static void prime_ref_dir(struct ref_dir *dir) 583{ 584 int i; 585 for (i = 0; i < dir->nr; i++) { 586 struct ref_entry *entry = dir->entries[i]; 587 if (entry->flag & REF_DIR) 588 prime_ref_dir(get_ref_dir(entry)); 589 } 590} 591 592/* 593 * A level in the reference hierarchy that is currently being iterated 594 * through. 595 */ 596struct cache_ref_iterator_level { 597 /* 598 * The ref_dir being iterated over at this level. The ref_dir 599 * is sorted before being stored here. 600 */ 601 struct ref_dir *dir; 602 603 /* 604 * The index of the current entry within dir (which might 605 * itself be a directory). If index == -1, then the iteration 606 * hasn't yet begun. If index == dir->nr, then the iteration 607 * through this level is over. 608 */ 609 int index; 610}; 611 612/* 613 * Represent an iteration through a ref_dir in the memory cache. The 614 * iteration recurses through subdirectories. 615 */ 616struct cache_ref_iterator { 617 struct ref_iterator base; 618 619 /* 620 * The number of levels currently on the stack. This is always 621 * at least 1, because when it becomes zero the iteration is 622 * ended and this struct is freed. 623 */ 624 size_t levels_nr; 625 626 /* The number of levels that have been allocated on the stack */ 627 size_t levels_alloc; 628 629 /* 630 * A stack of levels. levels[0] is the uppermost level that is 631 * being iterated over in this iteration. (This is not 632 * necessary the top level in the references hierarchy. If we 633 * are iterating through a subtree, then levels[0] will hold 634 * the ref_dir for that subtree, and subsequent levels will go 635 * on from there.) 636 */ 637 struct cache_ref_iterator_level *levels; 638}; 639 640static int cache_ref_iterator_advance(struct ref_iterator *ref_iterator) 641{ 642 struct cache_ref_iterator *iter = 643 (struct cache_ref_iterator *)ref_iterator; 644 645 while (1) { 646 struct cache_ref_iterator_level *level = 647 &iter->levels[iter->levels_nr - 1]; 648 struct ref_dir *dir = level->dir; 649 struct ref_entry *entry; 650 651 if (level->index == -1) 652 sort_ref_dir(dir); 653 654 if (++level->index == level->dir->nr) { 655 /* This level is exhausted; pop up a level */ 656 if (--iter->levels_nr == 0) 657 return ref_iterator_abort(ref_iterator); 658 659 continue; 660 } 661 662 entry = dir->entries[level->index]; 663 664 if (entry->flag & REF_DIR) { 665 /* push down a level */ 666 ALLOC_GROW(iter->levels, iter->levels_nr + 1, 667 iter->levels_alloc); 668 669 level = &iter->levels[iter->levels_nr++]; 670 level->dir = get_ref_dir(entry); 671 level->index = -1; 672 } else { 673 iter->base.refname = entry->name; 674 iter->base.oid = &entry->u.value.oid; 675 iter->base.flags = entry->flag; 676 return ITER_OK; 677 } 678 } 679} 680 681static enum peel_status peel_entry(struct ref_entry *entry, int repeel); 682 683static int cache_ref_iterator_peel(struct ref_iterator *ref_iterator, 684 struct object_id *peeled) 685{ 686 struct cache_ref_iterator *iter = 687 (struct cache_ref_iterator *)ref_iterator; 688 struct cache_ref_iterator_level *level; 689 struct ref_entry *entry; 690 691 level = &iter->levels[iter->levels_nr - 1]; 692 693 if (level->index == -1) 694 die("BUG: peel called before advance for cache iterator"); 695 696 entry = level->dir->entries[level->index]; 697 698 if (peel_entry(entry, 0)) 699 return -1; 700 hashcpy(peeled->hash, entry->u.value.peeled.hash); 701 return 0; 702} 703 704static int cache_ref_iterator_abort(struct ref_iterator *ref_iterator) 705{ 706 struct cache_ref_iterator *iter = 707 (struct cache_ref_iterator *)ref_iterator; 708 709 free(iter->levels); 710 base_ref_iterator_free(ref_iterator); 711 return ITER_DONE; 712} 713 714static struct ref_iterator_vtable cache_ref_iterator_vtable = { 715 cache_ref_iterator_advance, 716 cache_ref_iterator_peel, 717 cache_ref_iterator_abort 718}; 719 720static struct ref_iterator *cache_ref_iterator_begin(struct ref_dir *dir) 721{ 722 struct cache_ref_iterator *iter; 723 struct ref_iterator *ref_iterator; 724 struct cache_ref_iterator_level *level; 725 726 iter = xcalloc(1, sizeof(*iter)); 727 ref_iterator = &iter->base; 728 base_ref_iterator_init(ref_iterator, &cache_ref_iterator_vtable); 729 ALLOC_GROW(iter->levels, 10, iter->levels_alloc); 730 731 iter->levels_nr = 1; 732 level = &iter->levels[0]; 733 level->index = -1; 734 level->dir = dir; 735 736 return ref_iterator; 737} 738 739struct nonmatching_ref_data { 740 const struct string_list *skip; 741 const char *conflicting_refname; 742}; 743 744static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata) 745{ 746 struct nonmatching_ref_data *data = vdata; 747 748 if (data->skip && string_list_has_string(data->skip, entry->name)) 749 return 0; 750 751 data->conflicting_refname = entry->name; 752 return 1; 753} 754 755/* 756 * Return 0 if a reference named refname could be created without 757 * conflicting with the name of an existing reference in dir. 758 * See verify_refname_available for more information. 759 */ 760static int verify_refname_available_dir(const char *refname, 761 const struct string_list *extras, 762 const struct string_list *skip, 763 struct ref_dir *dir, 764 struct strbuf *err) 765{ 766 const char *slash; 767 const char *extra_refname; 768 int pos; 769 struct strbuf dirname = STRBUF_INIT; 770 int ret = -1; 771 772 /* 773 * For the sake of comments in this function, suppose that 774 * refname is "refs/foo/bar". 775 */ 776 777 assert(err); 778 779 strbuf_grow(&dirname, strlen(refname) + 1); 780 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 781 /* Expand dirname to the new prefix, not including the trailing slash: */ 782 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 783 784 /* 785 * We are still at a leading dir of the refname (e.g., 786 * "refs/foo"; if there is a reference with that name, 787 * it is a conflict, *unless* it is in skip. 788 */ 789 if (dir) { 790 pos = search_ref_dir(dir, dirname.buf, dirname.len); 791 if (pos >= 0 && 792 (!skip || !string_list_has_string(skip, dirname.buf))) { 793 /* 794 * We found a reference whose name is 795 * a proper prefix of refname; e.g., 796 * "refs/foo", and is not in skip. 797 */ 798 strbuf_addf(err, "'%s' exists; cannot create '%s'", 799 dirname.buf, refname); 800 goto cleanup; 801 } 802 } 803 804 if (extras && string_list_has_string(extras, dirname.buf) && 805 (!skip || !string_list_has_string(skip, dirname.buf))) { 806 strbuf_addf(err, "cannot process '%s' and '%s' at the same time", 807 refname, dirname.buf); 808 goto cleanup; 809 } 810 811 /* 812 * Otherwise, we can try to continue our search with 813 * the next component. So try to look up the 814 * directory, e.g., "refs/foo/". If we come up empty, 815 * we know there is nothing under this whole prefix, 816 * but even in that case we still have to continue the 817 * search for conflicts with extras. 818 */ 819 strbuf_addch(&dirname, '/'); 820 if (dir) { 821 pos = search_ref_dir(dir, dirname.buf, dirname.len); 822 if (pos < 0) { 823 /* 824 * There was no directory "refs/foo/", 825 * so there is nothing under this 826 * whole prefix. So there is no need 827 * to continue looking for conflicting 828 * references. But we need to continue 829 * looking for conflicting extras. 830 */ 831 dir = NULL; 832 } else { 833 dir = get_ref_dir(dir->entries[pos]); 834 } 835 } 836 } 837 838 /* 839 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 840 * There is no point in searching for a reference with that 841 * name, because a refname isn't considered to conflict with 842 * itself. But we still need to check for references whose 843 * names are in the "refs/foo/bar/" namespace, because they 844 * *do* conflict. 845 */ 846 strbuf_addstr(&dirname, refname + dirname.len); 847 strbuf_addch(&dirname, '/'); 848 849 if (dir) { 850 pos = search_ref_dir(dir, dirname.buf, dirname.len); 851 852 if (pos >= 0) { 853 /* 854 * We found a directory named "$refname/" 855 * (e.g., "refs/foo/bar/"). It is a problem 856 * iff it contains any ref that is not in 857 * "skip". 858 */ 859 struct nonmatching_ref_data data; 860 861 data.skip = skip; 862 data.conflicting_refname = NULL; 863 dir = get_ref_dir(dir->entries[pos]); 864 sort_ref_dir(dir); 865 if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) { 866 strbuf_addf(err, "'%s' exists; cannot create '%s'", 867 data.conflicting_refname, refname); 868 goto cleanup; 869 } 870 } 871 } 872 873 extra_refname = find_descendant_ref(dirname.buf, extras, skip); 874 if (extra_refname) 875 strbuf_addf(err, "cannot process '%s' and '%s' at the same time", 876 refname, extra_refname); 877 else 878 ret = 0; 879 880cleanup: 881 strbuf_release(&dirname); 882 return ret; 883} 884 885struct packed_ref_cache { 886 struct ref_entry *root; 887 888 /* 889 * Count of references to the data structure in this instance, 890 * including the pointer from ref_cache::packed if any. The 891 * data will not be freed as long as the reference count is 892 * nonzero. 893 */ 894 unsigned int referrers; 895 896 /* 897 * Iff the packed-refs file associated with this instance is 898 * currently locked for writing, this points at the associated 899 * lock (which is owned by somebody else). The referrer count 900 * is also incremented when the file is locked and decremented 901 * when it is unlocked. 902 */ 903 struct lock_file *lock; 904 905 /* The metadata from when this packed-refs cache was read */ 906 struct stat_validity validity; 907}; 908 909/* 910 * Future: need to be in "struct repository" 911 * when doing a full libification. 912 */ 913static struct ref_cache { 914 struct ref_cache *next; 915 struct ref_entry *loose; 916 struct packed_ref_cache *packed; 917 /* 918 * The submodule name, or "" for the main repo. We allocate 919 * length 1 rather than FLEX_ARRAY so that the main ref_cache 920 * is initialized correctly. 921 */ 922 char name[1]; 923} ref_cache, *submodule_ref_caches; 924 925/* Lock used for the main packed-refs file: */ 926static struct lock_file packlock; 927 928/* 929 * Increment the reference count of *packed_refs. 930 */ 931static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 932{ 933 packed_refs->referrers++; 934} 935 936/* 937 * Decrease the reference count of *packed_refs. If it goes to zero, 938 * free *packed_refs and return true; otherwise return false. 939 */ 940static int release_packed_ref_cache(struct packed_ref_cache *packed_refs) 941{ 942 if (!--packed_refs->referrers) { 943 free_ref_entry(packed_refs->root); 944 stat_validity_clear(&packed_refs->validity); 945 free(packed_refs); 946 return 1; 947 } else { 948 return 0; 949 } 950} 951 952static void clear_packed_ref_cache(struct ref_cache *refs) 953{ 954 if (refs->packed) { 955 struct packed_ref_cache *packed_refs = refs->packed; 956 957 if (packed_refs->lock) 958 die("internal error: packed-ref cache cleared while locked"); 959 refs->packed = NULL; 960 release_packed_ref_cache(packed_refs); 961 } 962} 963 964static void clear_loose_ref_cache(struct ref_cache *refs) 965{ 966 if (refs->loose) { 967 free_ref_entry(refs->loose); 968 refs->loose = NULL; 969 } 970} 971 972/* 973 * Create a new submodule ref cache and add it to the internal 974 * set of caches. 975 */ 976static struct ref_cache *create_ref_cache(const char *submodule) 977{ 978 struct ref_cache *refs; 979 if (!submodule) 980 submodule = ""; 981 FLEX_ALLOC_STR(refs, name, submodule); 982 refs->next = submodule_ref_caches; 983 submodule_ref_caches = refs; 984 return refs; 985} 986 987static struct ref_cache *lookup_ref_cache(const char *submodule) 988{ 989 struct ref_cache *refs; 990 991 if (!submodule || !*submodule) 992 return &ref_cache; 993 994 for (refs = submodule_ref_caches; refs; refs = refs->next) 995 if (!strcmp(submodule, refs->name)) 996 return refs; 997 return NULL; 998} 9991000/*1001 * Return a pointer to a ref_cache for the specified submodule. For1002 * the main repository, use submodule==NULL; such a call cannot fail.1003 * For a submodule, the submodule must exist and be a nonbare1004 * repository, otherwise return NULL.1005 *1006 * The returned structure will be allocated and initialized but not1007 * necessarily populated; it should not be freed.1008 */1009static struct ref_cache *get_ref_cache(const char *submodule)1010{1011 struct ref_cache *refs = lookup_ref_cache(submodule);10121013 if (!refs) {1014 struct strbuf submodule_sb = STRBUF_INIT;10151016 strbuf_addstr(&submodule_sb, submodule);1017 if (is_nonbare_repository_dir(&submodule_sb))1018 refs = create_ref_cache(submodule);1019 strbuf_release(&submodule_sb);1020 }10211022 return refs;1023}10241025/* The length of a peeled reference line in packed-refs, including EOL: */1026#define PEELED_LINE_LENGTH 4210271028/*1029 * The packed-refs header line that we write out. Perhaps other1030 * traits will be added later. The trailing space is required.1031 */1032static const char PACKED_REFS_HEADER[] =1033 "# pack-refs with: peeled fully-peeled \n";10341035/*1036 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1037 * Return a pointer to the refname within the line (null-terminated),1038 * or NULL if there was a problem.1039 */1040static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)1041{1042 const char *ref;10431044 /*1045 * 42: the answer to everything.1046 *1047 * In this case, it happens to be the answer to1048 * 40 (length of sha1 hex representation)1049 * +1 (space in between hex and name)1050 * +1 (newline at the end of the line)1051 */1052 if (line->len <= 42)1053 return NULL;10541055 if (get_sha1_hex(line->buf, sha1) < 0)1056 return NULL;1057 if (!isspace(line->buf[40]))1058 return NULL;10591060 ref = line->buf + 41;1061 if (isspace(*ref))1062 return NULL;10631064 if (line->buf[line->len - 1] != '\n')1065 return NULL;1066 line->buf[--line->len] = 0;10671068 return ref;1069}10701071/*1072 * Read f, which is a packed-refs file, into dir.1073 *1074 * A comment line of the form "# pack-refs with: " may contain zero or1075 * more traits. We interpret the traits as follows:1076 *1077 * No traits:1078 *1079 * Probably no references are peeled. But if the file contains a1080 * peeled value for a reference, we will use it.1081 *1082 * peeled:1083 *1084 * References under "refs/tags/", if they *can* be peeled, *are*1085 * peeled in this file. References outside of "refs/tags/" are1086 * probably not peeled even if they could have been, but if we find1087 * a peeled value for such a reference we will use it.1088 *1089 * fully-peeled:1090 *1091 * All references in the file that can be peeled are peeled.1092 * Inversely (and this is more important), any references in the1093 * file for which no peeled value is recorded is not peelable. This1094 * trait should typically be written alongside "peeled" for1095 * compatibility with older clients, but we do not require it1096 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1097 */1098static void read_packed_refs(FILE *f, struct ref_dir *dir)1099{1100 struct ref_entry *last = NULL;1101 struct strbuf line = STRBUF_INIT;1102 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;11031104 while (strbuf_getwholeline(&line, f, '\n') != EOF) {1105 unsigned char sha1[20];1106 const char *refname;1107 const char *traits;11081109 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {1110 if (strstr(traits, " fully-peeled "))1111 peeled = PEELED_FULLY;1112 else if (strstr(traits, " peeled "))1113 peeled = PEELED_TAGS;1114 /* perhaps other traits later as well */1115 continue;1116 }11171118 refname = parse_ref_line(&line, sha1);1119 if (refname) {1120 int flag = REF_ISPACKED;11211122 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1123 if (!refname_is_safe(refname))1124 die("packed refname is dangerous: %s", refname);1125 hashclr(sha1);1126 flag |= REF_BAD_NAME | REF_ISBROKEN;1127 }1128 last = create_ref_entry(refname, sha1, flag, 0);1129 if (peeled == PEELED_FULLY ||1130 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))1131 last->flag |= REF_KNOWS_PEELED;1132 add_ref(dir, last);1133 continue;1134 }1135 if (last &&1136 line.buf[0] == '^' &&1137 line.len == PEELED_LINE_LENGTH &&1138 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&1139 !get_sha1_hex(line.buf + 1, sha1)) {1140 hashcpy(last->u.value.peeled.hash, sha1);1141 /*1142 * Regardless of what the file header said,1143 * we definitely know the value of *this*1144 * reference:1145 */1146 last->flag |= REF_KNOWS_PEELED;1147 }1148 }11491150 strbuf_release(&line);1151}11521153/*1154 * Get the packed_ref_cache for the specified ref_cache, creating it1155 * if necessary.1156 */1157static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1158{1159 char *packed_refs_file;11601161 if (*refs->name)1162 packed_refs_file = git_pathdup_submodule(refs->name, "packed-refs");1163 else1164 packed_refs_file = git_pathdup("packed-refs");11651166 if (refs->packed &&1167 !stat_validity_check(&refs->packed->validity, packed_refs_file))1168 clear_packed_ref_cache(refs);11691170 if (!refs->packed) {1171 FILE *f;11721173 refs->packed = xcalloc(1, sizeof(*refs->packed));1174 acquire_packed_ref_cache(refs->packed);1175 refs->packed->root = create_dir_entry(refs, "", 0, 0);1176 f = fopen(packed_refs_file, "r");1177 if (f) {1178 stat_validity_update(&refs->packed->validity, fileno(f));1179 read_packed_refs(f, get_ref_dir(refs->packed->root));1180 fclose(f);1181 }1182 }1183 free(packed_refs_file);1184 return refs->packed;1185}11861187static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1188{1189 return get_ref_dir(packed_ref_cache->root);1190}11911192static struct ref_dir *get_packed_refs(struct ref_cache *refs)1193{1194 return get_packed_ref_dir(get_packed_ref_cache(refs));1195}11961197/*1198 * Add a reference to the in-memory packed reference cache. This may1199 * only be called while the packed-refs file is locked (see1200 * lock_packed_refs()). To actually write the packed-refs file, call1201 * commit_packed_refs().1202 */1203static void add_packed_ref(const char *refname, const unsigned char *sha1)1204{1205 struct packed_ref_cache *packed_ref_cache =1206 get_packed_ref_cache(&ref_cache);12071208 if (!packed_ref_cache->lock)1209 die("internal error: packed refs not locked");1210 add_ref(get_packed_ref_dir(packed_ref_cache),1211 create_ref_entry(refname, sha1, REF_ISPACKED, 1));1212}12131214/*1215 * Read the loose references from the namespace dirname into dir1216 * (without recursing). dirname must end with '/'. dir must be the1217 * directory entry corresponding to dirname.1218 */1219static void read_loose_refs(const char *dirname, struct ref_dir *dir)1220{1221 struct ref_cache *refs = dir->ref_cache;1222 DIR *d;1223 struct dirent *de;1224 int dirnamelen = strlen(dirname);1225 struct strbuf refname;1226 struct strbuf path = STRBUF_INIT;1227 size_t path_baselen;12281229 if (*refs->name)1230 strbuf_git_path_submodule(&path, refs->name, "%s", dirname);1231 else1232 strbuf_git_path(&path, "%s", dirname);1233 path_baselen = path.len;12341235 d = opendir(path.buf);1236 if (!d) {1237 strbuf_release(&path);1238 return;1239 }12401241 strbuf_init(&refname, dirnamelen + 257);1242 strbuf_add(&refname, dirname, dirnamelen);12431244 while ((de = readdir(d)) != NULL) {1245 unsigned char sha1[20];1246 struct stat st;1247 int flag;12481249 if (de->d_name[0] == '.')1250 continue;1251 if (ends_with(de->d_name, ".lock"))1252 continue;1253 strbuf_addstr(&refname, de->d_name);1254 strbuf_addstr(&path, de->d_name);1255 if (stat(path.buf, &st) < 0) {1256 ; /* silently ignore */1257 } else if (S_ISDIR(st.st_mode)) {1258 strbuf_addch(&refname, '/');1259 add_entry_to_dir(dir,1260 create_dir_entry(refs, refname.buf,1261 refname.len, 1));1262 } else {1263 int read_ok;12641265 if (*refs->name) {1266 hashclr(sha1);1267 flag = 0;1268 read_ok = !resolve_gitlink_ref(refs->name,1269 refname.buf, sha1);1270 } else {1271 read_ok = !read_ref_full(refname.buf,1272 RESOLVE_REF_READING,1273 sha1, &flag);1274 }12751276 if (!read_ok) {1277 hashclr(sha1);1278 flag |= REF_ISBROKEN;1279 } else if (is_null_sha1(sha1)) {1280 /*1281 * It is so astronomically unlikely1282 * that NULL_SHA1 is the SHA-1 of an1283 * actual object that we consider its1284 * appearance in a loose reference1285 * file to be repo corruption1286 * (probably due to a software bug).1287 */1288 flag |= REF_ISBROKEN;1289 }12901291 if (check_refname_format(refname.buf,1292 REFNAME_ALLOW_ONELEVEL)) {1293 if (!refname_is_safe(refname.buf))1294 die("loose refname is dangerous: %s", refname.buf);1295 hashclr(sha1);1296 flag |= REF_BAD_NAME | REF_ISBROKEN;1297 }1298 add_entry_to_dir(dir,1299 create_ref_entry(refname.buf, sha1, flag, 0));1300 }1301 strbuf_setlen(&refname, dirnamelen);1302 strbuf_setlen(&path, path_baselen);1303 }1304 strbuf_release(&refname);1305 strbuf_release(&path);1306 closedir(d);1307}13081309static struct ref_dir *get_loose_refs(struct ref_cache *refs)1310{1311 if (!refs->loose) {1312 /*1313 * Mark the top-level directory complete because we1314 * are about to read the only subdirectory that can1315 * hold references:1316 */1317 refs->loose = create_dir_entry(refs, "", 0, 0);1318 /*1319 * Create an incomplete entry for "refs/":1320 */1321 add_entry_to_dir(get_ref_dir(refs->loose),1322 create_dir_entry(refs, "refs/", 5, 1));1323 }1324 return get_ref_dir(refs->loose);1325}13261327#define MAXREFLEN (1024)13281329/*1330 * Called by resolve_gitlink_ref_recursive() after it failed to read1331 * from the loose refs in ref_cache refs. Find <refname> in the1332 * packed-refs file for the submodule.1333 */1334static int resolve_gitlink_packed_ref(struct ref_cache *refs,1335 const char *refname, unsigned char *sha1)1336{1337 struct ref_entry *ref;1338 struct ref_dir *dir = get_packed_refs(refs);13391340 ref = find_ref(dir, refname);1341 if (ref == NULL)1342 return -1;13431344 hashcpy(sha1, ref->u.value.oid.hash);1345 return 0;1346}13471348static int resolve_gitlink_ref_recursive(struct ref_cache *refs,1349 const char *refname, unsigned char *sha1,1350 int recursion)1351{1352 int fd, len;1353 char buffer[128], *p;1354 char *path;13551356 if (recursion > SYMREF_MAXDEPTH || strlen(refname) > MAXREFLEN)1357 return -1;1358 path = *refs->name1359 ? git_pathdup_submodule(refs->name, "%s", refname)1360 : git_pathdup("%s", refname);1361 fd = open(path, O_RDONLY);1362 free(path);1363 if (fd < 0)1364 return resolve_gitlink_packed_ref(refs, refname, sha1);13651366 len = read(fd, buffer, sizeof(buffer)-1);1367 close(fd);1368 if (len < 0)1369 return -1;1370 while (len && isspace(buffer[len-1]))1371 len--;1372 buffer[len] = 0;13731374 /* Was it a detached head or an old-fashioned symlink? */1375 if (!get_sha1_hex(buffer, sha1))1376 return 0;13771378 /* Symref? */1379 if (strncmp(buffer, "ref:", 4))1380 return -1;1381 p = buffer + 4;1382 while (isspace(*p))1383 p++;13841385 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1386}13871388int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)1389{1390 int len = strlen(path), retval;1391 struct strbuf submodule = STRBUF_INIT;1392 struct ref_cache *refs;13931394 while (len && path[len-1] == '/')1395 len--;1396 if (!len)1397 return -1;13981399 strbuf_add(&submodule, path, len);1400 refs = get_ref_cache(submodule.buf);1401 if (!refs) {1402 strbuf_release(&submodule);1403 return -1;1404 }1405 strbuf_release(&submodule);14061407 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);1408 return retval;1409}14101411/*1412 * Return the ref_entry for the given refname from the packed1413 * references. If it does not exist, return NULL.1414 */1415static struct ref_entry *get_packed_ref(const char *refname)1416{1417 return find_ref(get_packed_refs(&ref_cache), refname);1418}14191420/*1421 * A loose ref file doesn't exist; check for a packed ref.1422 */1423static int resolve_missing_loose_ref(const char *refname,1424 unsigned char *sha1,1425 unsigned int *flags)1426{1427 struct ref_entry *entry;14281429 /*1430 * The loose reference file does not exist; check for a packed1431 * reference.1432 */1433 entry = get_packed_ref(refname);1434 if (entry) {1435 hashcpy(sha1, entry->u.value.oid.hash);1436 *flags |= REF_ISPACKED;1437 return 0;1438 }1439 /* refname is not a packed reference. */1440 return -1;1441}14421443int read_raw_ref(const char *refname, unsigned char *sha1,1444 struct strbuf *referent, unsigned int *type)1445{1446 struct strbuf sb_contents = STRBUF_INIT;1447 struct strbuf sb_path = STRBUF_INIT;1448 const char *path;1449 const char *buf;1450 struct stat st;1451 int fd;1452 int ret = -1;1453 int save_errno;14541455 *type = 0;1456 strbuf_reset(&sb_path);1457 strbuf_git_path(&sb_path, "%s", refname);1458 path = sb_path.buf;14591460stat_ref:1461 /*1462 * We might have to loop back here to avoid a race1463 * condition: first we lstat() the file, then we try1464 * to read it as a link or as a file. But if somebody1465 * changes the type of the file (file <-> directory1466 * <-> symlink) between the lstat() and reading, then1467 * we don't want to report that as an error but rather1468 * try again starting with the lstat().1469 */14701471 if (lstat(path, &st) < 0) {1472 if (errno != ENOENT)1473 goto out;1474 if (resolve_missing_loose_ref(refname, sha1, type)) {1475 errno = ENOENT;1476 goto out;1477 }1478 ret = 0;1479 goto out;1480 }14811482 /* Follow "normalized" - ie "refs/.." symlinks by hand */1483 if (S_ISLNK(st.st_mode)) {1484 strbuf_reset(&sb_contents);1485 if (strbuf_readlink(&sb_contents, path, 0) < 0) {1486 if (errno == ENOENT || errno == EINVAL)1487 /* inconsistent with lstat; retry */1488 goto stat_ref;1489 else1490 goto out;1491 }1492 if (starts_with(sb_contents.buf, "refs/") &&1493 !check_refname_format(sb_contents.buf, 0)) {1494 strbuf_swap(&sb_contents, referent);1495 *type |= REF_ISSYMREF;1496 ret = 0;1497 goto out;1498 }1499 /*1500 * It doesn't look like a refname; fall through to just1501 * treating it like a non-symlink, and reading whatever it1502 * points to.1503 */1504 }15051506 /* Is it a directory? */1507 if (S_ISDIR(st.st_mode)) {1508 /*1509 * Even though there is a directory where the loose1510 * ref is supposed to be, there could still be a1511 * packed ref:1512 */1513 if (resolve_missing_loose_ref(refname, sha1, type)) {1514 errno = EISDIR;1515 goto out;1516 }1517 ret = 0;1518 goto out;1519 }15201521 /*1522 * Anything else, just open it and try to use it as1523 * a ref1524 */1525 fd = open(path, O_RDONLY);1526 if (fd < 0) {1527 if (errno == ENOENT && !S_ISLNK(st.st_mode))1528 /* inconsistent with lstat; retry */1529 goto stat_ref;1530 else1531 goto out;1532 }1533 strbuf_reset(&sb_contents);1534 if (strbuf_read(&sb_contents, fd, 256) < 0) {1535 int save_errno = errno;1536 close(fd);1537 errno = save_errno;1538 goto out;1539 }1540 close(fd);1541 strbuf_rtrim(&sb_contents);1542 buf = sb_contents.buf;1543 if (starts_with(buf, "ref:")) {1544 buf += 4;1545 while (isspace(*buf))1546 buf++;15471548 strbuf_reset(referent);1549 strbuf_addstr(referent, buf);1550 *type |= REF_ISSYMREF;1551 ret = 0;1552 goto out;1553 }15541555 /*1556 * Please note that FETCH_HEAD has additional1557 * data after the sha.1558 */1559 if (get_sha1_hex(buf, sha1) ||1560 (buf[40] != '\0' && !isspace(buf[40]))) {1561 *type |= REF_ISBROKEN;1562 errno = EINVAL;1563 goto out;1564 }15651566 ret = 0;15671568out:1569 save_errno = errno;1570 strbuf_release(&sb_path);1571 strbuf_release(&sb_contents);1572 errno = save_errno;1573 return ret;1574}15751576static void unlock_ref(struct ref_lock *lock)1577{1578 /* Do not free lock->lk -- atexit() still looks at them */1579 if (lock->lk)1580 rollback_lock_file(lock->lk);1581 free(lock->ref_name);1582 free(lock);1583}15841585/*1586 * Lock refname, without following symrefs, and set *lock_p to point1587 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1588 * and type similarly to read_raw_ref().1589 *1590 * The caller must verify that refname is a "safe" reference name (in1591 * the sense of refname_is_safe()) before calling this function.1592 *1593 * If the reference doesn't already exist, verify that refname doesn't1594 * have a D/F conflict with any existing references. extras and skip1595 * are passed to verify_refname_available_dir() for this check.1596 *1597 * If mustexist is not set and the reference is not found or is1598 * broken, lock the reference anyway but clear sha1.1599 *1600 * Return 0 on success. On failure, write an error message to err and1601 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1602 *1603 * Implementation note: This function is basically1604 *1605 * lock reference1606 * read_raw_ref()1607 *1608 * but it includes a lot more code to1609 * - Deal with possible races with other processes1610 * - Avoid calling verify_refname_available_dir() when it can be1611 * avoided, namely if we were successfully able to read the ref1612 * - Generate informative error messages in the case of failure1613 */1614static int lock_raw_ref(const char *refname, int mustexist,1615 const struct string_list *extras,1616 const struct string_list *skip,1617 struct ref_lock **lock_p,1618 struct strbuf *referent,1619 unsigned int *type,1620 struct strbuf *err)1621{1622 struct ref_lock *lock;1623 struct strbuf ref_file = STRBUF_INIT;1624 int attempts_remaining = 3;1625 int ret = TRANSACTION_GENERIC_ERROR;16261627 assert(err);1628 *type = 0;16291630 /* First lock the file so it can't change out from under us. */16311632 *lock_p = lock = xcalloc(1, sizeof(*lock));16331634 lock->ref_name = xstrdup(refname);1635 strbuf_git_path(&ref_file, "%s", refname);16361637retry:1638 switch (safe_create_leading_directories(ref_file.buf)) {1639 case SCLD_OK:1640 break; /* success */1641 case SCLD_EXISTS:1642 /*1643 * Suppose refname is "refs/foo/bar". We just failed1644 * to create the containing directory, "refs/foo",1645 * because there was a non-directory in the way. This1646 * indicates a D/F conflict, probably because of1647 * another reference such as "refs/foo". There is no1648 * reason to expect this error to be transitory.1649 */1650 if (verify_refname_available(refname, extras, skip, err)) {1651 if (mustexist) {1652 /*1653 * To the user the relevant error is1654 * that the "mustexist" reference is1655 * missing:1656 */1657 strbuf_reset(err);1658 strbuf_addf(err, "unable to resolve reference '%s'",1659 refname);1660 } else {1661 /*1662 * The error message set by1663 * verify_refname_available_dir() is OK.1664 */1665 ret = TRANSACTION_NAME_CONFLICT;1666 }1667 } else {1668 /*1669 * The file that is in the way isn't a loose1670 * reference. Report it as a low-level1671 * failure.1672 */1673 strbuf_addf(err, "unable to create lock file %s.lock; "1674 "non-directory in the way",1675 ref_file.buf);1676 }1677 goto error_return;1678 case SCLD_VANISHED:1679 /* Maybe another process was tidying up. Try again. */1680 if (--attempts_remaining > 0)1681 goto retry;1682 /* fall through */1683 default:1684 strbuf_addf(err, "unable to create directory for %s",1685 ref_file.buf);1686 goto error_return;1687 }16881689 if (!lock->lk)1690 lock->lk = xcalloc(1, sizeof(struct lock_file));16911692 if (hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) < 0) {1693 if (errno == ENOENT && --attempts_remaining > 0) {1694 /*1695 * Maybe somebody just deleted one of the1696 * directories leading to ref_file. Try1697 * again:1698 */1699 goto retry;1700 } else {1701 unable_to_lock_message(ref_file.buf, errno, err);1702 goto error_return;1703 }1704 }17051706 /*1707 * Now we hold the lock and can read the reference without1708 * fear that its value will change.1709 */17101711 if (read_raw_ref(refname, lock->old_oid.hash, referent, type)) {1712 if (errno == ENOENT) {1713 if (mustexist) {1714 /* Garden variety missing reference. */1715 strbuf_addf(err, "unable to resolve reference '%s'",1716 refname);1717 goto error_return;1718 } else {1719 /*1720 * Reference is missing, but that's OK. We1721 * know that there is not a conflict with1722 * another loose reference because1723 * (supposing that we are trying to lock1724 * reference "refs/foo/bar"):1725 *1726 * - We were successfully able to create1727 * the lockfile refs/foo/bar.lock, so we1728 * know there cannot be a loose reference1729 * named "refs/foo".1730 *1731 * - We got ENOENT and not EISDIR, so we1732 * know that there cannot be a loose1733 * reference named "refs/foo/bar/baz".1734 */1735 }1736 } else if (errno == EISDIR) {1737 /*1738 * There is a directory in the way. It might have1739 * contained references that have been deleted. If1740 * we don't require that the reference already1741 * exists, try to remove the directory so that it1742 * doesn't cause trouble when we want to rename the1743 * lockfile into place later.1744 */1745 if (mustexist) {1746 /* Garden variety missing reference. */1747 strbuf_addf(err, "unable to resolve reference '%s'",1748 refname);1749 goto error_return;1750 } else if (remove_dir_recursively(&ref_file,1751 REMOVE_DIR_EMPTY_ONLY)) {1752 if (verify_refname_available_dir(1753 refname, extras, skip,1754 get_loose_refs(&ref_cache),1755 err)) {1756 /*1757 * The error message set by1758 * verify_refname_available() is OK.1759 */1760 ret = TRANSACTION_NAME_CONFLICT;1761 goto error_return;1762 } else {1763 /*1764 * We can't delete the directory,1765 * but we also don't know of any1766 * references that it should1767 * contain.1768 */1769 strbuf_addf(err, "there is a non-empty directory '%s' "1770 "blocking reference '%s'",1771 ref_file.buf, refname);1772 goto error_return;1773 }1774 }1775 } else if (errno == EINVAL && (*type & REF_ISBROKEN)) {1776 strbuf_addf(err, "unable to resolve reference '%s': "1777 "reference broken", refname);1778 goto error_return;1779 } else {1780 strbuf_addf(err, "unable to resolve reference '%s': %s",1781 refname, strerror(errno));1782 goto error_return;1783 }17841785 /*1786 * If the ref did not exist and we are creating it,1787 * make sure there is no existing packed ref whose1788 * name begins with our refname, nor a packed ref1789 * whose name is a proper prefix of our refname.1790 */1791 if (verify_refname_available_dir(1792 refname, extras, skip,1793 get_packed_refs(&ref_cache),1794 err)) {1795 goto error_return;1796 }1797 }17981799 ret = 0;1800 goto out;18011802error_return:1803 unlock_ref(lock);1804 *lock_p = NULL;18051806out:1807 strbuf_release(&ref_file);1808 return ret;1809}18101811/*1812 * Peel the entry (if possible) and return its new peel_status. If1813 * repeel is true, re-peel the entry even if there is an old peeled1814 * value that is already stored in it.1815 *1816 * It is OK to call this function with a packed reference entry that1817 * might be stale and might even refer to an object that has since1818 * been garbage-collected. In such a case, if the entry has1819 * REF_KNOWS_PEELED then leave the status unchanged and return1820 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1821 */1822static enum peel_status peel_entry(struct ref_entry *entry, int repeel)1823{1824 enum peel_status status;18251826 if (entry->flag & REF_KNOWS_PEELED) {1827 if (repeel) {1828 entry->flag &= ~REF_KNOWS_PEELED;1829 oidclr(&entry->u.value.peeled);1830 } else {1831 return is_null_oid(&entry->u.value.peeled) ?1832 PEEL_NON_TAG : PEEL_PEELED;1833 }1834 }1835 if (entry->flag & REF_ISBROKEN)1836 return PEEL_BROKEN;1837 if (entry->flag & REF_ISSYMREF)1838 return PEEL_IS_SYMREF;18391840 status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1841 if (status == PEEL_PEELED || status == PEEL_NON_TAG)1842 entry->flag |= REF_KNOWS_PEELED;1843 return status;1844}18451846int peel_ref(const char *refname, unsigned char *sha1)1847{1848 int flag;1849 unsigned char base[20];18501851 if (current_ref_iter && current_ref_iter->refname == refname) {1852 struct object_id peeled;18531854 if (ref_iterator_peel(current_ref_iter, &peeled))1855 return -1;1856 hashcpy(sha1, peeled.hash);1857 return 0;1858 }18591860 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1861 return -1;18621863 /*1864 * If the reference is packed, read its ref_entry from the1865 * cache in the hope that we already know its peeled value.1866 * We only try this optimization on packed references because1867 * (a) forcing the filling of the loose reference cache could1868 * be expensive and (b) loose references anyway usually do not1869 * have REF_KNOWS_PEELED.1870 */1871 if (flag & REF_ISPACKED) {1872 struct ref_entry *r = get_packed_ref(refname);1873 if (r) {1874 if (peel_entry(r, 0))1875 return -1;1876 hashcpy(sha1, r->u.value.peeled.hash);1877 return 0;1878 }1879 }18801881 return peel_object(base, sha1);1882}18831884struct files_ref_iterator {1885 struct ref_iterator base;18861887 struct packed_ref_cache *packed_ref_cache;1888 struct ref_iterator *iter0;1889 unsigned int flags;1890};18911892static int files_ref_iterator_advance(struct ref_iterator *ref_iterator)1893{1894 struct files_ref_iterator *iter =1895 (struct files_ref_iterator *)ref_iterator;1896 int ok;18971898 while ((ok = ref_iterator_advance(iter->iter0)) == ITER_OK) {1899 if (!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&1900 !ref_resolves_to_object(iter->iter0->refname,1901 iter->iter0->oid,1902 iter->iter0->flags))1903 continue;19041905 iter->base.refname = iter->iter0->refname;1906 iter->base.oid = iter->iter0->oid;1907 iter->base.flags = iter->iter0->flags;1908 return ITER_OK;1909 }19101911 iter->iter0 = NULL;1912 if (ref_iterator_abort(ref_iterator) != ITER_DONE)1913 ok = ITER_ERROR;19141915 return ok;1916}19171918static int files_ref_iterator_peel(struct ref_iterator *ref_iterator,1919 struct object_id *peeled)1920{1921 struct files_ref_iterator *iter =1922 (struct files_ref_iterator *)ref_iterator;19231924 return ref_iterator_peel(iter->iter0, peeled);1925}19261927static int files_ref_iterator_abort(struct ref_iterator *ref_iterator)1928{1929 struct files_ref_iterator *iter =1930 (struct files_ref_iterator *)ref_iterator;1931 int ok = ITER_DONE;19321933 if (iter->iter0)1934 ok = ref_iterator_abort(iter->iter0);19351936 release_packed_ref_cache(iter->packed_ref_cache);1937 base_ref_iterator_free(ref_iterator);1938 return ok;1939}19401941static struct ref_iterator_vtable files_ref_iterator_vtable = {1942 files_ref_iterator_advance,1943 files_ref_iterator_peel,1944 files_ref_iterator_abort1945};19461947struct ref_iterator *files_ref_iterator_begin(1948 const char *submodule,1949 const char *prefix, unsigned int flags)1950{1951 struct ref_cache *refs = get_ref_cache(submodule);1952 struct ref_dir *loose_dir, *packed_dir;1953 struct ref_iterator *loose_iter, *packed_iter;1954 struct files_ref_iterator *iter;1955 struct ref_iterator *ref_iterator;19561957 if (!refs)1958 return empty_ref_iterator_begin();19591960 if (ref_paranoia < 0)1961 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);1962 if (ref_paranoia)1963 flags |= DO_FOR_EACH_INCLUDE_BROKEN;19641965 iter = xcalloc(1, sizeof(*iter));1966 ref_iterator = &iter->base;1967 base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);19681969 /*1970 * We must make sure that all loose refs are read before1971 * accessing the packed-refs file; this avoids a race1972 * condition if loose refs are migrated to the packed-refs1973 * file by a simultaneous process, but our in-memory view is1974 * from before the migration. We ensure this as follows:1975 * First, we call prime_ref_dir(), which pre-reads the loose1976 * references for the subtree into the cache. (If they've1977 * already been read, that's OK; we only need to guarantee1978 * that they're read before the packed refs, not *how much*1979 * before.) After that, we call get_packed_ref_cache(), which1980 * internally checks whether the packed-ref cache is up to1981 * date with what is on disk, and re-reads it if not.1982 */19831984 loose_dir = get_loose_refs(refs);19851986 if (prefix && *prefix)1987 loose_dir = find_containing_dir(loose_dir, prefix, 0);19881989 if (loose_dir) {1990 prime_ref_dir(loose_dir);1991 loose_iter = cache_ref_iterator_begin(loose_dir);1992 } else {1993 /* There's nothing to iterate over. */1994 loose_iter = empty_ref_iterator_begin();1995 }19961997 iter->packed_ref_cache = get_packed_ref_cache(refs);1998 acquire_packed_ref_cache(iter->packed_ref_cache);1999 packed_dir = get_packed_ref_dir(iter->packed_ref_cache);20002001 if (prefix && *prefix)2002 packed_dir = find_containing_dir(packed_dir, prefix, 0);20032004 if (packed_dir) {2005 packed_iter = cache_ref_iterator_begin(packed_dir);2006 } else {2007 /* There's nothing to iterate over. */2008 packed_iter = empty_ref_iterator_begin();2009 }20102011 iter->iter0 = overlay_ref_iterator_begin(loose_iter, packed_iter);2012 iter->flags = flags;20132014 return ref_iterator;2015}20162017/*2018 * Verify that the reference locked by lock has the value old_sha1.2019 * Fail if the reference doesn't exist and mustexist is set. Return 02020 * on success. On error, write an error message to err, set errno, and2021 * return a negative value.2022 */2023static int verify_lock(struct ref_lock *lock,2024 const unsigned char *old_sha1, int mustexist,2025 struct strbuf *err)2026{2027 assert(err);20282029 if (read_ref_full(lock->ref_name,2030 mustexist ? RESOLVE_REF_READING : 0,2031 lock->old_oid.hash, NULL)) {2032 if (old_sha1) {2033 int save_errno = errno;2034 strbuf_addf(err, "can't verify ref '%s'", lock->ref_name);2035 errno = save_errno;2036 return -1;2037 } else {2038 oidclr(&lock->old_oid);2039 return 0;2040 }2041 }2042 if (old_sha1 && hashcmp(lock->old_oid.hash, old_sha1)) {2043 strbuf_addf(err, "ref '%s' is at %s but expected %s",2044 lock->ref_name,2045 oid_to_hex(&lock->old_oid),2046 sha1_to_hex(old_sha1));2047 errno = EBUSY;2048 return -1;2049 }2050 return 0;2051}20522053static int remove_empty_directories(struct strbuf *path)2054{2055 /*2056 * we want to create a file but there is a directory there;2057 * if that is an empty directory (or a directory that contains2058 * only empty directories), remove them.2059 */2060 return remove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);2061}20622063/*2064 * Locks a ref returning the lock on success and NULL on failure.2065 * On failure errno is set to something meaningful.2066 */2067static struct ref_lock *lock_ref_sha1_basic(const char *refname,2068 const unsigned char *old_sha1,2069 const struct string_list *extras,2070 const struct string_list *skip,2071 unsigned int flags, int *type,2072 struct strbuf *err)2073{2074 struct strbuf ref_file = STRBUF_INIT;2075 struct ref_lock *lock;2076 int last_errno = 0;2077 int lflags = LOCK_NO_DEREF;2078 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2079 int resolve_flags = RESOLVE_REF_NO_RECURSE;2080 int attempts_remaining = 3;2081 int resolved;20822083 assert(err);20842085 lock = xcalloc(1, sizeof(struct ref_lock));20862087 if (mustexist)2088 resolve_flags |= RESOLVE_REF_READING;2089 if (flags & REF_DELETING)2090 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;20912092 strbuf_git_path(&ref_file, "%s", refname);2093 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2094 lock->old_oid.hash, type);2095 if (!resolved && errno == EISDIR) {2096 /*2097 * we are trying to lock foo but we used to2098 * have foo/bar which now does not exist;2099 * it is normal for the empty directory 'foo'2100 * to remain.2101 */2102 if (remove_empty_directories(&ref_file)) {2103 last_errno = errno;2104 if (!verify_refname_available_dir(refname, extras, skip,2105 get_loose_refs(&ref_cache), err))2106 strbuf_addf(err, "there are still refs under '%s'",2107 refname);2108 goto error_return;2109 }2110 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2111 lock->old_oid.hash, type);2112 }2113 if (!resolved) {2114 last_errno = errno;2115 if (last_errno != ENOTDIR ||2116 !verify_refname_available_dir(refname, extras, skip,2117 get_loose_refs(&ref_cache), err))2118 strbuf_addf(err, "unable to resolve reference '%s': %s",2119 refname, strerror(last_errno));21202121 goto error_return;2122 }21232124 /*2125 * If the ref did not exist and we are creating it, make sure2126 * there is no existing packed ref whose name begins with our2127 * refname, nor a packed ref whose name is a proper prefix of2128 * our refname.2129 */2130 if (is_null_oid(&lock->old_oid) &&2131 verify_refname_available_dir(refname, extras, skip,2132 get_packed_refs(&ref_cache), err)) {2133 last_errno = ENOTDIR;2134 goto error_return;2135 }21362137 lock->lk = xcalloc(1, sizeof(struct lock_file));21382139 lock->ref_name = xstrdup(refname);21402141 retry:2142 switch (safe_create_leading_directories_const(ref_file.buf)) {2143 case SCLD_OK:2144 break; /* success */2145 case SCLD_VANISHED:2146 if (--attempts_remaining > 0)2147 goto retry;2148 /* fall through */2149 default:2150 last_errno = errno;2151 strbuf_addf(err, "unable to create directory for '%s'",2152 ref_file.buf);2153 goto error_return;2154 }21552156 if (hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) < 0) {2157 last_errno = errno;2158 if (errno == ENOENT && --attempts_remaining > 0)2159 /*2160 * Maybe somebody just deleted one of the2161 * directories leading to ref_file. Try2162 * again:2163 */2164 goto retry;2165 else {2166 unable_to_lock_message(ref_file.buf, errno, err);2167 goto error_return;2168 }2169 }2170 if (verify_lock(lock, old_sha1, mustexist, err)) {2171 last_errno = errno;2172 goto error_return;2173 }2174 goto out;21752176 error_return:2177 unlock_ref(lock);2178 lock = NULL;21792180 out:2181 strbuf_release(&ref_file);2182 errno = last_errno;2183 return lock;2184}21852186/*2187 * Write an entry to the packed-refs file for the specified refname.2188 * If peeled is non-NULL, write it as the entry's peeled value.2189 */2190static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,2191 unsigned char *peeled)2192{2193 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);2194 if (peeled)2195 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));2196}21972198/*2199 * An each_ref_entry_fn that writes the entry to a packed-refs file.2200 */2201static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)2202{2203 enum peel_status peel_status = peel_entry(entry, 0);22042205 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2206 error("internal error: %s is not a valid packed reference!",2207 entry->name);2208 write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2209 peel_status == PEEL_PEELED ?2210 entry->u.value.peeled.hash : NULL);2211 return 0;2212}22132214/*2215 * Lock the packed-refs file for writing. Flags is passed to2216 * hold_lock_file_for_update(). Return 0 on success. On errors, set2217 * errno appropriately and return a nonzero value.2218 */2219static int lock_packed_refs(int flags)2220{2221 static int timeout_configured = 0;2222 static int timeout_value = 1000;22232224 struct packed_ref_cache *packed_ref_cache;22252226 if (!timeout_configured) {2227 git_config_get_int("core.packedrefstimeout", &timeout_value);2228 timeout_configured = 1;2229 }22302231 if (hold_lock_file_for_update_timeout(2232 &packlock, git_path("packed-refs"),2233 flags, timeout_value) < 0)2234 return -1;2235 /*2236 * Get the current packed-refs while holding the lock. If the2237 * packed-refs file has been modified since we last read it,2238 * this will automatically invalidate the cache and re-read2239 * the packed-refs file.2240 */2241 packed_ref_cache = get_packed_ref_cache(&ref_cache);2242 packed_ref_cache->lock = &packlock;2243 /* Increment the reference count to prevent it from being freed: */2244 acquire_packed_ref_cache(packed_ref_cache);2245 return 0;2246}22472248/*2249 * Write the current version of the packed refs cache from memory to2250 * disk. The packed-refs file must already be locked for writing (see2251 * lock_packed_refs()). Return zero on success. On errors, set errno2252 * and return a nonzero value2253 */2254static int commit_packed_refs(void)2255{2256 struct packed_ref_cache *packed_ref_cache =2257 get_packed_ref_cache(&ref_cache);2258 int error = 0;2259 int save_errno = 0;2260 FILE *out;22612262 if (!packed_ref_cache->lock)2263 die("internal error: packed-refs not locked");22642265 out = fdopen_lock_file(packed_ref_cache->lock, "w");2266 if (!out)2267 die_errno("unable to fdopen packed-refs descriptor");22682269 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);2270 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),2271 0, write_packed_entry_fn, out);22722273 if (commit_lock_file(packed_ref_cache->lock)) {2274 save_errno = errno;2275 error = -1;2276 }2277 packed_ref_cache->lock = NULL;2278 release_packed_ref_cache(packed_ref_cache);2279 errno = save_errno;2280 return error;2281}22822283/*2284 * Rollback the lockfile for the packed-refs file, and discard the2285 * in-memory packed reference cache. (The packed-refs file will be2286 * read anew if it is needed again after this function is called.)2287 */2288static void rollback_packed_refs(void)2289{2290 struct packed_ref_cache *packed_ref_cache =2291 get_packed_ref_cache(&ref_cache);22922293 if (!packed_ref_cache->lock)2294 die("internal error: packed-refs not locked");2295 rollback_lock_file(packed_ref_cache->lock);2296 packed_ref_cache->lock = NULL;2297 release_packed_ref_cache(packed_ref_cache);2298 clear_packed_ref_cache(&ref_cache);2299}23002301struct ref_to_prune {2302 struct ref_to_prune *next;2303 unsigned char sha1[20];2304 char name[FLEX_ARRAY];2305};23062307struct pack_refs_cb_data {2308 unsigned int flags;2309 struct ref_dir *packed_refs;2310 struct ref_to_prune *ref_to_prune;2311};23122313/*2314 * An each_ref_entry_fn that is run over loose references only. If2315 * the loose reference can be packed, add an entry in the packed ref2316 * cache. If the reference should be pruned, also add it to2317 * ref_to_prune in the pack_refs_cb_data.2318 */2319static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)2320{2321 struct pack_refs_cb_data *cb = cb_data;2322 enum peel_status peel_status;2323 struct ref_entry *packed_entry;2324 int is_tag_ref = starts_with(entry->name, "refs/tags/");23252326 /* Do not pack per-worktree refs: */2327 if (ref_type(entry->name) != REF_TYPE_NORMAL)2328 return 0;23292330 /* ALWAYS pack tags */2331 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2332 return 0;23332334 /* Do not pack symbolic or broken refs: */2335 if ((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))2336 return 0;23372338 /* Add a packed ref cache entry equivalent to the loose entry. */2339 peel_status = peel_entry(entry, 1);2340 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2341 die("internal error peeling reference %s (%s)",2342 entry->name, oid_to_hex(&entry->u.value.oid));2343 packed_entry = find_ref(cb->packed_refs, entry->name);2344 if (packed_entry) {2345 /* Overwrite existing packed entry with info from loose entry */2346 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2347 oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2348 } else {2349 packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,2350 REF_ISPACKED | REF_KNOWS_PEELED, 0);2351 add_ref(cb->packed_refs, packed_entry);2352 }2353 oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);23542355 /* Schedule the loose reference for pruning if requested. */2356 if ((cb->flags & PACK_REFS_PRUNE)) {2357 struct ref_to_prune *n;2358 FLEX_ALLOC_STR(n, name, entry->name);2359 hashcpy(n->sha1, entry->u.value.oid.hash);2360 n->next = cb->ref_to_prune;2361 cb->ref_to_prune = n;2362 }2363 return 0;2364}23652366/*2367 * Remove empty parents, but spare refs/ and immediate subdirs.2368 * Note: munges *name.2369 */2370static void try_remove_empty_parents(char *name)2371{2372 char *p, *q;2373 int i;2374 p = name;2375 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */2376 while (*p && *p != '/')2377 p++;2378 /* tolerate duplicate slashes; see check_refname_format() */2379 while (*p == '/')2380 p++;2381 }2382 for (q = p; *q; q++)2383 ;2384 while (1) {2385 while (q > p && *q != '/')2386 q--;2387 while (q > p && *(q-1) == '/')2388 q--;2389 if (q == p)2390 break;2391 *q = '\0';2392 if (rmdir(git_path("%s", name)))2393 break;2394 }2395}23962397/* make sure nobody touched the ref, and unlink */2398static void prune_ref(struct ref_to_prune *r)2399{2400 struct ref_transaction *transaction;2401 struct strbuf err = STRBUF_INIT;24022403 if (check_refname_format(r->name, 0))2404 return;24052406 transaction = ref_transaction_begin(&err);2407 if (!transaction ||2408 ref_transaction_delete(transaction, r->name, r->sha1,2409 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2410 ref_transaction_commit(transaction, &err)) {2411 ref_transaction_free(transaction);2412 error("%s", err.buf);2413 strbuf_release(&err);2414 return;2415 }2416 ref_transaction_free(transaction);2417 strbuf_release(&err);2418 try_remove_empty_parents(r->name);2419}24202421static void prune_refs(struct ref_to_prune *r)2422{2423 while (r) {2424 prune_ref(r);2425 r = r->next;2426 }2427}24282429int pack_refs(unsigned int flags)2430{2431 struct pack_refs_cb_data cbdata;24322433 memset(&cbdata, 0, sizeof(cbdata));2434 cbdata.flags = flags;24352436 lock_packed_refs(LOCK_DIE_ON_ERROR);2437 cbdata.packed_refs = get_packed_refs(&ref_cache);24382439 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,2440 pack_if_possible_fn, &cbdata);24412442 if (commit_packed_refs())2443 die_errno("unable to overwrite old ref-pack file");24442445 prune_refs(cbdata.ref_to_prune);2446 return 0;2447}24482449/*2450 * Rewrite the packed-refs file, omitting any refs listed in2451 * 'refnames'. On error, leave packed-refs unchanged, write an error2452 * message to 'err', and return a nonzero value.2453 *2454 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2455 */2456static int repack_without_refs(struct string_list *refnames, struct strbuf *err)2457{2458 struct ref_dir *packed;2459 struct string_list_item *refname;2460 int ret, needs_repacking = 0, removed = 0;24612462 assert(err);24632464 /* Look for a packed ref */2465 for_each_string_list_item(refname, refnames) {2466 if (get_packed_ref(refname->string)) {2467 needs_repacking = 1;2468 break;2469 }2470 }24712472 /* Avoid locking if we have nothing to do */2473 if (!needs_repacking)2474 return 0; /* no refname exists in packed refs */24752476 if (lock_packed_refs(0)) {2477 unable_to_lock_message(git_path("packed-refs"), errno, err);2478 return -1;2479 }2480 packed = get_packed_refs(&ref_cache);24812482 /* Remove refnames from the cache */2483 for_each_string_list_item(refname, refnames)2484 if (remove_entry(packed, refname->string) != -1)2485 removed = 1;2486 if (!removed) {2487 /*2488 * All packed entries disappeared while we were2489 * acquiring the lock.2490 */2491 rollback_packed_refs();2492 return 0;2493 }24942495 /* Write what remains */2496 ret = commit_packed_refs();2497 if (ret)2498 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",2499 strerror(errno));2500 return ret;2501}25022503static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)2504{2505 assert(err);25062507 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2508 /*2509 * loose. The loose file name is the same as the2510 * lockfile name, minus ".lock":2511 */2512 char *loose_filename = get_locked_file_path(lock->lk);2513 int res = unlink_or_msg(loose_filename, err);2514 free(loose_filename);2515 if (res)2516 return 1;2517 }2518 return 0;2519}25202521int delete_refs(struct string_list *refnames, unsigned int flags)2522{2523 struct strbuf err = STRBUF_INIT;2524 int i, result = 0;25252526 if (!refnames->nr)2527 return 0;25282529 result = repack_without_refs(refnames, &err);2530 if (result) {2531 /*2532 * If we failed to rewrite the packed-refs file, then2533 * it is unsafe to try to remove loose refs, because2534 * doing so might expose an obsolete packed value for2535 * a reference that might even point at an object that2536 * has been garbage collected.2537 */2538 if (refnames->nr == 1)2539 error(_("could not delete reference %s: %s"),2540 refnames->items[0].string, err.buf);2541 else2542 error(_("could not delete references: %s"), err.buf);25432544 goto out;2545 }25462547 for (i = 0; i < refnames->nr; i++) {2548 const char *refname = refnames->items[i].string;25492550 if (delete_ref(refname, NULL, flags))2551 result |= error(_("could not remove reference %s"), refname);2552 }25532554out:2555 strbuf_release(&err);2556 return result;2557}25582559/*2560 * People using contrib's git-new-workdir have .git/logs/refs ->2561 * /some/other/path/.git/logs/refs, and that may live on another device.2562 *2563 * IOW, to avoid cross device rename errors, the temporary renamed log must2564 * live into logs/refs.2565 */2566#define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"25672568static int rename_tmp_log(const char *newrefname)2569{2570 int attempts_remaining = 4;2571 struct strbuf path = STRBUF_INIT;2572 int ret = -1;25732574 retry:2575 strbuf_reset(&path);2576 strbuf_git_path(&path, "logs/%s", newrefname);2577 switch (safe_create_leading_directories_const(path.buf)) {2578 case SCLD_OK:2579 break; /* success */2580 case SCLD_VANISHED:2581 if (--attempts_remaining > 0)2582 goto retry;2583 /* fall through */2584 default:2585 error("unable to create directory for %s", newrefname);2586 goto out;2587 }25882589 if (rename(git_path(TMP_RENAMED_LOG), path.buf)) {2590 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {2591 /*2592 * rename(a, b) when b is an existing2593 * directory ought to result in ISDIR, but2594 * Solaris 5.8 gives ENOTDIR. Sheesh.2595 */2596 if (remove_empty_directories(&path)) {2597 error("Directory not empty: logs/%s", newrefname);2598 goto out;2599 }2600 goto retry;2601 } else if (errno == ENOENT && --attempts_remaining > 0) {2602 /*2603 * Maybe another process just deleted one of2604 * the directories in the path to newrefname.2605 * Try again from the beginning.2606 */2607 goto retry;2608 } else {2609 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",2610 newrefname, strerror(errno));2611 goto out;2612 }2613 }2614 ret = 0;2615out:2616 strbuf_release(&path);2617 return ret;2618}26192620int verify_refname_available(const char *newname,2621 const struct string_list *extras,2622 const struct string_list *skip,2623 struct strbuf *err)2624{2625 struct ref_dir *packed_refs = get_packed_refs(&ref_cache);2626 struct ref_dir *loose_refs = get_loose_refs(&ref_cache);26272628 if (verify_refname_available_dir(newname, extras, skip,2629 packed_refs, err) ||2630 verify_refname_available_dir(newname, extras, skip,2631 loose_refs, err))2632 return -1;26332634 return 0;2635}26362637static int write_ref_to_lockfile(struct ref_lock *lock,2638 const unsigned char *sha1, struct strbuf *err);2639static int commit_ref_update(struct ref_lock *lock,2640 const unsigned char *sha1, const char *logmsg,2641 struct strbuf *err);26422643int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)2644{2645 unsigned char sha1[20], orig_sha1[20];2646 int flag = 0, logmoved = 0;2647 struct ref_lock *lock;2648 struct stat loginfo;2649 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2650 struct strbuf err = STRBUF_INIT;26512652 if (log && S_ISLNK(loginfo.st_mode))2653 return error("reflog for %s is a symlink", oldrefname);26542655 if (!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2656 orig_sha1, &flag))2657 return error("refname %s not found", oldrefname);26582659 if (flag & REF_ISSYMREF)2660 return error("refname %s is a symbolic ref, renaming it is not supported",2661 oldrefname);2662 if (!rename_ref_available(oldrefname, newrefname))2663 return 1;26642665 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))2666 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",2667 oldrefname, strerror(errno));26682669 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2670 error("unable to delete old %s", oldrefname);2671 goto rollback;2672 }26732674 /*2675 * Since we are doing a shallow lookup, sha1 is not the2676 * correct value to pass to delete_ref as old_sha1. But that2677 * doesn't matter, because an old_sha1 check wouldn't add to2678 * the safety anyway; we want to delete the reference whatever2679 * its current value.2680 */2681 if (!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2682 sha1, NULL) &&2683 delete_ref(newrefname, NULL, REF_NODEREF)) {2684 if (errno==EISDIR) {2685 struct strbuf path = STRBUF_INIT;2686 int result;26872688 strbuf_git_path(&path, "%s", newrefname);2689 result = remove_empty_directories(&path);2690 strbuf_release(&path);26912692 if (result) {2693 error("Directory not empty: %s", newrefname);2694 goto rollback;2695 }2696 } else {2697 error("unable to delete existing %s", newrefname);2698 goto rollback;2699 }2700 }27012702 if (log && rename_tmp_log(newrefname))2703 goto rollback;27042705 logmoved = log;27062707 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, REF_NODEREF,2708 NULL, &err);2709 if (!lock) {2710 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);2711 strbuf_release(&err);2712 goto rollback;2713 }2714 hashcpy(lock->old_oid.hash, orig_sha1);27152716 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||2717 commit_ref_update(lock, orig_sha1, logmsg, &err)) {2718 error("unable to write current sha1 into %s: %s", newrefname, err.buf);2719 strbuf_release(&err);2720 goto rollback;2721 }27222723 return 0;27242725 rollback:2726 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, REF_NODEREF,2727 NULL, &err);2728 if (!lock) {2729 error("unable to lock %s for rollback: %s", oldrefname, err.buf);2730 strbuf_release(&err);2731 goto rollbacklog;2732 }27332734 flag = log_all_ref_updates;2735 log_all_ref_updates = 0;2736 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||2737 commit_ref_update(lock, orig_sha1, NULL, &err)) {2738 error("unable to write current sha1 into %s: %s", oldrefname, err.buf);2739 strbuf_release(&err);2740 }2741 log_all_ref_updates = flag;27422743 rollbacklog:2744 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))2745 error("unable to restore logfile %s from %s: %s",2746 oldrefname, newrefname, strerror(errno));2747 if (!logmoved && log &&2748 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))2749 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",2750 oldrefname, strerror(errno));27512752 return 1;2753}27542755static int close_ref(struct ref_lock *lock)2756{2757 if (close_lock_file(lock->lk))2758 return -1;2759 return 0;2760}27612762static int commit_ref(struct ref_lock *lock)2763{2764 char *path = get_locked_file_path(lock->lk);2765 struct stat st;27662767 if (!lstat(path, &st) && S_ISDIR(st.st_mode)) {2768 /*2769 * There is a directory at the path we want to rename2770 * the lockfile to. Hopefully it is empty; try to2771 * delete it.2772 */2773 size_t len = strlen(path);2774 struct strbuf sb_path = STRBUF_INIT;27752776 strbuf_attach(&sb_path, path, len, len);27772778 /*2779 * If this fails, commit_lock_file() will also fail2780 * and will report the problem.2781 */2782 remove_empty_directories(&sb_path);2783 strbuf_release(&sb_path);2784 } else {2785 free(path);2786 }27872788 if (commit_lock_file(lock->lk))2789 return -1;2790 return 0;2791}27922793/*2794 * Create a reflog for a ref. If force_create = 0, the reflog will2795 * only be created for certain refs (those for which2796 * should_autocreate_reflog returns non-zero. Otherwise, create it2797 * regardless of the ref name. Fill in *err and return -1 on failure.2798 */2799static int log_ref_setup(const char *refname, struct strbuf *logfile, struct strbuf *err, int force_create)2800{2801 int logfd, oflags = O_APPEND | O_WRONLY;28022803 strbuf_git_path(logfile, "logs/%s", refname);2804 if (force_create || should_autocreate_reflog(refname)) {2805 if (safe_create_leading_directories(logfile->buf) < 0) {2806 strbuf_addf(err, "unable to create directory for '%s': "2807 "%s", logfile->buf, strerror(errno));2808 return -1;2809 }2810 oflags |= O_CREAT;2811 }28122813 logfd = open(logfile->buf, oflags, 0666);2814 if (logfd < 0) {2815 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2816 return 0;28172818 if (errno == EISDIR) {2819 if (remove_empty_directories(logfile)) {2820 strbuf_addf(err, "there are still logs under "2821 "'%s'", logfile->buf);2822 return -1;2823 }2824 logfd = open(logfile->buf, oflags, 0666);2825 }28262827 if (logfd < 0) {2828 strbuf_addf(err, "unable to append to '%s': %s",2829 logfile->buf, strerror(errno));2830 return -1;2831 }2832 }28332834 adjust_shared_perm(logfile->buf);2835 close(logfd);2836 return 0;2837}283828392840int safe_create_reflog(const char *refname, int force_create, struct strbuf *err)2841{2842 int ret;2843 struct strbuf sb = STRBUF_INIT;28442845 ret = log_ref_setup(refname, &sb, err, force_create);2846 strbuf_release(&sb);2847 return ret;2848}28492850static int log_ref_write_fd(int fd, const unsigned char *old_sha1,2851 const unsigned char *new_sha1,2852 const char *committer, const char *msg)2853{2854 int msglen, written;2855 unsigned maxlen, len;2856 char *logrec;28572858 msglen = msg ? strlen(msg) : 0;2859 maxlen = strlen(committer) + msglen + 100;2860 logrec = xmalloc(maxlen);2861 len = xsnprintf(logrec, maxlen, "%s %s %s\n",2862 sha1_to_hex(old_sha1),2863 sha1_to_hex(new_sha1),2864 committer);2865 if (msglen)2866 len += copy_reflog_msg(logrec + len - 1, msg) - 1;28672868 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;2869 free(logrec);2870 if (written != len)2871 return -1;28722873 return 0;2874}28752876static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,2877 const unsigned char *new_sha1, const char *msg,2878 struct strbuf *logfile, int flags,2879 struct strbuf *err)2880{2881 int logfd, result, oflags = O_APPEND | O_WRONLY;28822883 if (log_all_ref_updates < 0)2884 log_all_ref_updates = !is_bare_repository();28852886 result = log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);28872888 if (result)2889 return result;28902891 logfd = open(logfile->buf, oflags);2892 if (logfd < 0)2893 return 0;2894 result = log_ref_write_fd(logfd, old_sha1, new_sha1,2895 git_committer_info(0), msg);2896 if (result) {2897 strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,2898 strerror(errno));2899 close(logfd);2900 return -1;2901 }2902 if (close(logfd)) {2903 strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,2904 strerror(errno));2905 return -1;2906 }2907 return 0;2908}29092910static int log_ref_write(const char *refname, const unsigned char *old_sha1,2911 const unsigned char *new_sha1, const char *msg,2912 int flags, struct strbuf *err)2913{2914 return files_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2915 err);2916}29172918int files_log_ref_write(const char *refname, const unsigned char *old_sha1,2919 const unsigned char *new_sha1, const char *msg,2920 int flags, struct strbuf *err)2921{2922 struct strbuf sb = STRBUF_INIT;2923 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2924 err);2925 strbuf_release(&sb);2926 return ret;2927}29282929/*2930 * Write sha1 into the open lockfile, then close the lockfile. On2931 * errors, rollback the lockfile, fill in *err and2932 * return -1.2933 */2934static int write_ref_to_lockfile(struct ref_lock *lock,2935 const unsigned char *sha1, struct strbuf *err)2936{2937 static char term = '\n';2938 struct object *o;2939 int fd;29402941 o = parse_object(sha1);2942 if (!o) {2943 strbuf_addf(err,2944 "trying to write ref '%s' with nonexistent object %s",2945 lock->ref_name, sha1_to_hex(sha1));2946 unlock_ref(lock);2947 return -1;2948 }2949 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {2950 strbuf_addf(err,2951 "trying to write non-commit object %s to branch '%s'",2952 sha1_to_hex(sha1), lock->ref_name);2953 unlock_ref(lock);2954 return -1;2955 }2956 fd = get_lock_file_fd(lock->lk);2957 if (write_in_full(fd, sha1_to_hex(sha1), 40) != 40 ||2958 write_in_full(fd, &term, 1) != 1 ||2959 close_ref(lock) < 0) {2960 strbuf_addf(err,2961 "couldn't write '%s'", get_lock_file_path(lock->lk));2962 unlock_ref(lock);2963 return -1;2964 }2965 return 0;2966}29672968/*2969 * Commit a change to a loose reference that has already been written2970 * to the loose reference lockfile. Also update the reflogs if2971 * necessary, using the specified lockmsg (which can be NULL).2972 */2973static int commit_ref_update(struct ref_lock *lock,2974 const unsigned char *sha1, const char *logmsg,2975 struct strbuf *err)2976{2977 clear_loose_ref_cache(&ref_cache);2978 if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, 0, err)) {2979 char *old_msg = strbuf_detach(err, NULL);2980 strbuf_addf(err, "cannot update the ref '%s': %s",2981 lock->ref_name, old_msg);2982 free(old_msg);2983 unlock_ref(lock);2984 return -1;2985 }29862987 if (strcmp(lock->ref_name, "HEAD") != 0) {2988 /*2989 * Special hack: If a branch is updated directly and HEAD2990 * points to it (may happen on the remote side of a push2991 * for example) then logically the HEAD reflog should be2992 * updated too.2993 * A generic solution implies reverse symref information,2994 * but finding all symrefs pointing to the given branch2995 * would be rather costly for this rare event (the direct2996 * update of a branch) to be worth it. So let's cheat and2997 * check with HEAD only which should cover 99% of all usage2998 * scenarios (even 100% of the default ones).2999 */3000 unsigned char head_sha1[20];3001 int head_flag;3002 const char *head_ref;30033004 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3005 head_sha1, &head_flag);3006 if (head_ref && (head_flag & REF_ISSYMREF) &&3007 !strcmp(head_ref, lock->ref_name)) {3008 struct strbuf log_err = STRBUF_INIT;3009 if (log_ref_write("HEAD", lock->old_oid.hash, sha1,3010 logmsg, 0, &log_err)) {3011 error("%s", log_err.buf);3012 strbuf_release(&log_err);3013 }3014 }3015 }30163017 if (commit_ref(lock)) {3018 strbuf_addf(err, "couldn't set '%s'", lock->ref_name);3019 unlock_ref(lock);3020 return -1;3021 }30223023 unlock_ref(lock);3024 return 0;3025}30263027static int create_ref_symlink(struct ref_lock *lock, const char *target)3028{3029 int ret = -1;3030#ifndef NO_SYMLINK_HEAD3031 char *ref_path = get_locked_file_path(lock->lk);3032 unlink(ref_path);3033 ret = symlink(target, ref_path);3034 free(ref_path);30353036 if (ret)3037 fprintf(stderr, "no symlink - falling back to symbolic ref\n");3038#endif3039 return ret;3040}30413042static void update_symref_reflog(struct ref_lock *lock, const char *refname,3043 const char *target, const char *logmsg)3044{3045 struct strbuf err = STRBUF_INIT;3046 unsigned char new_sha1[20];3047 if (logmsg && !read_ref(target, new_sha1) &&3048 log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg, 0, &err)) {3049 error("%s", err.buf);3050 strbuf_release(&err);3051 }3052}30533054static int create_symref_locked(struct ref_lock *lock, const char *refname,3055 const char *target, const char *logmsg)3056{3057 if (prefer_symlink_refs && !create_ref_symlink(lock, target)) {3058 update_symref_reflog(lock, refname, target, logmsg);3059 return 0;3060 }30613062 if (!fdopen_lock_file(lock->lk, "w"))3063 return error("unable to fdopen %s: %s",3064 lock->lk->tempfile.filename.buf, strerror(errno));30653066 update_symref_reflog(lock, refname, target, logmsg);30673068 /* no error check; commit_ref will check ferror */3069 fprintf(lock->lk->tempfile.fp, "ref: %s\n", target);3070 if (commit_ref(lock) < 0)3071 return error("unable to write symref for %s: %s", refname,3072 strerror(errno));3073 return 0;3074}30753076int create_symref(const char *refname, const char *target, const char *logmsg)3077{3078 struct strbuf err = STRBUF_INIT;3079 struct ref_lock *lock;3080 int ret;30813082 lock = lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,3083 &err);3084 if (!lock) {3085 error("%s", err.buf);3086 strbuf_release(&err);3087 return -1;3088 }30893090 ret = create_symref_locked(lock, refname, target, logmsg);3091 unlock_ref(lock);3092 return ret;3093}30943095int set_worktree_head_symref(const char *gitdir, const char *target)3096{3097 static struct lock_file head_lock;3098 struct ref_lock *lock;3099 struct strbuf head_path = STRBUF_INIT;3100 const char *head_rel;3101 int ret;31023103 strbuf_addf(&head_path, "%s/HEAD", absolute_path(gitdir));3104 if (hold_lock_file_for_update(&head_lock, head_path.buf,3105 LOCK_NO_DEREF) < 0) {3106 struct strbuf err = STRBUF_INIT;3107 unable_to_lock_message(head_path.buf, errno, &err);3108 error("%s", err.buf);3109 strbuf_release(&err);3110 strbuf_release(&head_path);3111 return -1;3112 }31133114 /* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3115 linked trees */3116 head_rel = remove_leading_path(head_path.buf,3117 absolute_path(get_git_common_dir()));3118 /* to make use of create_symref_locked(), initialize ref_lock */3119 lock = xcalloc(1, sizeof(struct ref_lock));3120 lock->lk = &head_lock;3121 lock->ref_name = xstrdup(head_rel);31223123 ret = create_symref_locked(lock, head_rel, target, NULL);31243125 unlock_ref(lock); /* will free lock */3126 strbuf_release(&head_path);3127 return ret;3128}31293130int reflog_exists(const char *refname)3131{3132 struct stat st;31333134 return !lstat(git_path("logs/%s", refname), &st) &&3135 S_ISREG(st.st_mode);3136}31373138int delete_reflog(const char *refname)3139{3140 return remove_path(git_path("logs/%s", refname));3141}31423143static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)3144{3145 unsigned char osha1[20], nsha1[20];3146 char *email_end, *message;3147 unsigned long timestamp;3148 int tz;31493150 /* old SP new SP name <email> SP time TAB msg LF */3151 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||3152 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||3153 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||3154 !(email_end = strchr(sb->buf + 82, '>')) ||3155 email_end[1] != ' ' ||3156 !(timestamp = strtoul(email_end + 2, &message, 10)) ||3157 !message || message[0] != ' ' ||3158 (message[1] != '+' && message[1] != '-') ||3159 !isdigit(message[2]) || !isdigit(message[3]) ||3160 !isdigit(message[4]) || !isdigit(message[5]))3161 return 0; /* corrupt? */3162 email_end[1] = '\0';3163 tz = strtol(message + 1, NULL, 10);3164 if (message[6] != '\t')3165 message += 6;3166 else3167 message += 7;3168 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);3169}31703171static char *find_beginning_of_line(char *bob, char *scan)3172{3173 while (bob < scan && *(--scan) != '\n')3174 ; /* keep scanning backwards */3175 /*3176 * Return either beginning of the buffer, or LF at the end of3177 * the previous line.3178 */3179 return scan;3180}31813182int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)3183{3184 struct strbuf sb = STRBUF_INIT;3185 FILE *logfp;3186 long pos;3187 int ret = 0, at_tail = 1;31883189 logfp = fopen(git_path("logs/%s", refname), "r");3190 if (!logfp)3191 return -1;31923193 /* Jump to the end */3194 if (fseek(logfp, 0, SEEK_END) < 0)3195 return error("cannot seek back reflog for %s: %s",3196 refname, strerror(errno));3197 pos = ftell(logfp);3198 while (!ret && 0 < pos) {3199 int cnt;3200 size_t nread;3201 char buf[BUFSIZ];3202 char *endp, *scanp;32033204 /* Fill next block from the end */3205 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;3206 if (fseek(logfp, pos - cnt, SEEK_SET))3207 return error("cannot seek back reflog for %s: %s",3208 refname, strerror(errno));3209 nread = fread(buf, cnt, 1, logfp);3210 if (nread != 1)3211 return error("cannot read %d bytes from reflog for %s: %s",3212 cnt, refname, strerror(errno));3213 pos -= cnt;32143215 scanp = endp = buf + cnt;3216 if (at_tail && scanp[-1] == '\n')3217 /* Looking at the final LF at the end of the file */3218 scanp--;3219 at_tail = 0;32203221 while (buf < scanp) {3222 /*3223 * terminating LF of the previous line, or the beginning3224 * of the buffer.3225 */3226 char *bp;32273228 bp = find_beginning_of_line(buf, scanp);32293230 if (*bp == '\n') {3231 /*3232 * The newline is the end of the previous line,3233 * so we know we have complete line starting3234 * at (bp + 1). Prefix it onto any prior data3235 * we collected for the line and process it.3236 */3237 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));3238 scanp = bp;3239 endp = bp + 1;3240 ret = show_one_reflog_ent(&sb, fn, cb_data);3241 strbuf_reset(&sb);3242 if (ret)3243 break;3244 } else if (!pos) {3245 /*3246 * We are at the start of the buffer, and the3247 * start of the file; there is no previous3248 * line, and we have everything for this one.3249 * Process it, and we can end the loop.3250 */3251 strbuf_splice(&sb, 0, 0, buf, endp - buf);3252 ret = show_one_reflog_ent(&sb, fn, cb_data);3253 strbuf_reset(&sb);3254 break;3255 }32563257 if (bp == buf) {3258 /*3259 * We are at the start of the buffer, and there3260 * is more file to read backwards. Which means3261 * we are in the middle of a line. Note that we3262 * may get here even if *bp was a newline; that3263 * just means we are at the exact end of the3264 * previous line, rather than some spot in the3265 * middle.3266 *3267 * Save away what we have to be combined with3268 * the data from the next read.3269 */3270 strbuf_splice(&sb, 0, 0, buf, endp - buf);3271 break;3272 }3273 }32743275 }3276 if (!ret && sb.len)3277 die("BUG: reverse reflog parser had leftover data");32783279 fclose(logfp);3280 strbuf_release(&sb);3281 return ret;3282}32833284int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)3285{3286 FILE *logfp;3287 struct strbuf sb = STRBUF_INIT;3288 int ret = 0;32893290 logfp = fopen(git_path("logs/%s", refname), "r");3291 if (!logfp)3292 return -1;32933294 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))3295 ret = show_one_reflog_ent(&sb, fn, cb_data);3296 fclose(logfp);3297 strbuf_release(&sb);3298 return ret;3299}33003301struct files_reflog_iterator {3302 struct ref_iterator base;33033304 struct dir_iterator *dir_iterator;3305 struct object_id oid;3306};33073308static int files_reflog_iterator_advance(struct ref_iterator *ref_iterator)3309{3310 struct files_reflog_iterator *iter =3311 (struct files_reflog_iterator *)ref_iterator;3312 struct dir_iterator *diter = iter->dir_iterator;3313 int ok;33143315 while ((ok = dir_iterator_advance(diter)) == ITER_OK) {3316 int flags;33173318 if (!S_ISREG(diter->st.st_mode))3319 continue;3320 if (diter->basename[0] == '.')3321 continue;3322 if (ends_with(diter->basename, ".lock"))3323 continue;33243325 if (read_ref_full(diter->relative_path, 0,3326 iter->oid.hash, &flags)) {3327 error("bad ref for %s", diter->path.buf);3328 continue;3329 }33303331 iter->base.refname = diter->relative_path;3332 iter->base.oid = &iter->oid;3333 iter->base.flags = flags;3334 return ITER_OK;3335 }33363337 iter->dir_iterator = NULL;3338 if (ref_iterator_abort(ref_iterator) == ITER_ERROR)3339 ok = ITER_ERROR;3340 return ok;3341}33423343static int files_reflog_iterator_peel(struct ref_iterator *ref_iterator,3344 struct object_id *peeled)3345{3346 die("BUG: ref_iterator_peel() called for reflog_iterator");3347}33483349static int files_reflog_iterator_abort(struct ref_iterator *ref_iterator)3350{3351 struct files_reflog_iterator *iter =3352 (struct files_reflog_iterator *)ref_iterator;3353 int ok = ITER_DONE;33543355 if (iter->dir_iterator)3356 ok = dir_iterator_abort(iter->dir_iterator);33573358 base_ref_iterator_free(ref_iterator);3359 return ok;3360}33613362static struct ref_iterator_vtable files_reflog_iterator_vtable = {3363 files_reflog_iterator_advance,3364 files_reflog_iterator_peel,3365 files_reflog_iterator_abort3366};33673368struct ref_iterator *files_reflog_iterator_begin(void)3369{3370 struct files_reflog_iterator *iter = xcalloc(1, sizeof(*iter));3371 struct ref_iterator *ref_iterator = &iter->base;33723373 base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);3374 iter->dir_iterator = dir_iterator_begin(git_path("logs"));3375 return ref_iterator;3376}33773378int for_each_reflog(each_ref_fn fn, void *cb_data)3379{3380 return do_for_each_ref_iterator(files_reflog_iterator_begin(),3381 fn, cb_data);3382}33833384static int ref_update_reject_duplicates(struct string_list *refnames,3385 struct strbuf *err)3386{3387 int i, n = refnames->nr;33883389 assert(err);33903391 for (i = 1; i < n; i++)3392 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {3393 strbuf_addf(err,3394 "multiple updates for ref '%s' not allowed.",3395 refnames->items[i].string);3396 return 1;3397 }3398 return 0;3399}34003401/*3402 * If update is a direct update of head_ref (the reference pointed to3403 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3404 */3405static int split_head_update(struct ref_update *update,3406 struct ref_transaction *transaction,3407 const char *head_ref,3408 struct string_list *affected_refnames,3409 struct strbuf *err)3410{3411 struct string_list_item *item;3412 struct ref_update *new_update;34133414 if ((update->flags & REF_LOG_ONLY) ||3415 (update->flags & REF_ISPRUNING) ||3416 (update->flags & REF_UPDATE_VIA_HEAD))3417 return 0;34183419 if (strcmp(update->refname, head_ref))3420 return 0;34213422 /*3423 * First make sure that HEAD is not already in the3424 * transaction. This insertion is O(N) in the transaction3425 * size, but it happens at most once per transaction.3426 */3427 item = string_list_insert(affected_refnames, "HEAD");3428 if (item->util) {3429 /* An entry already existed */3430 strbuf_addf(err,3431 "multiple updates for 'HEAD' (including one "3432 "via its referent '%s') are not allowed",3433 update->refname);3434 return TRANSACTION_NAME_CONFLICT;3435 }34363437 new_update = ref_transaction_add_update(3438 transaction, "HEAD",3439 update->flags | REF_LOG_ONLY | REF_NODEREF,3440 update->new_sha1, update->old_sha1,3441 update->msg);34423443 item->util = new_update;34443445 return 0;3446}34473448/*3449 * update is for a symref that points at referent and doesn't have3450 * REF_NODEREF set. Split it into two updates:3451 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3452 * - A new, separate update for the referent reference3453 * Note that the new update will itself be subject to splitting when3454 * the iteration gets to it.3455 */3456static int split_symref_update(struct ref_update *update,3457 const char *referent,3458 struct ref_transaction *transaction,3459 struct string_list *affected_refnames,3460 struct strbuf *err)3461{3462 struct string_list_item *item;3463 struct ref_update *new_update;3464 unsigned int new_flags;34653466 /*3467 * First make sure that referent is not already in the3468 * transaction. This insertion is O(N) in the transaction3469 * size, but it happens at most once per symref in a3470 * transaction.3471 */3472 item = string_list_insert(affected_refnames, referent);3473 if (item->util) {3474 /* An entry already existed */3475 strbuf_addf(err,3476 "multiple updates for '%s' (including one "3477 "via symref '%s') are not allowed",3478 referent, update->refname);3479 return TRANSACTION_NAME_CONFLICT;3480 }34813482 new_flags = update->flags;3483 if (!strcmp(update->refname, "HEAD")) {3484 /*3485 * Record that the new update came via HEAD, so that3486 * when we process it, split_head_update() doesn't try3487 * to add another reflog update for HEAD. Note that3488 * this bit will be propagated if the new_update3489 * itself needs to be split.3490 */3491 new_flags |= REF_UPDATE_VIA_HEAD;3492 }34933494 new_update = ref_transaction_add_update(3495 transaction, referent, new_flags,3496 update->new_sha1, update->old_sha1,3497 update->msg);34983499 new_update->parent_update = update;35003501 /*3502 * Change the symbolic ref update to log only. Also, it3503 * doesn't need to check its old SHA-1 value, as that will be3504 * done when new_update is processed.3505 */3506 update->flags |= REF_LOG_ONLY | REF_NODEREF;3507 update->flags &= ~REF_HAVE_OLD;35083509 item->util = new_update;35103511 return 0;3512}35133514/*3515 * Return the refname under which update was originally requested.3516 */3517static const char *original_update_refname(struct ref_update *update)3518{3519 while (update->parent_update)3520 update = update->parent_update;35213522 return update->refname;3523}35243525/*3526 * Check whether the REF_HAVE_OLD and old_oid values stored in update3527 * are consistent with oid, which is the reference's current value. If3528 * everything is OK, return 0; otherwise, write an error message to3529 * err and return -1.3530 */3531static int check_old_oid(struct ref_update *update, struct object_id *oid,3532 struct strbuf *err)3533{3534 if (!(update->flags & REF_HAVE_OLD) ||3535 !hashcmp(oid->hash, update->old_sha1))3536 return 0;35373538 if (is_null_sha1(update->old_sha1))3539 strbuf_addf(err, "cannot lock ref '%s': "3540 "reference already exists",3541 original_update_refname(update));3542 else if (is_null_oid(oid))3543 strbuf_addf(err, "cannot lock ref '%s': "3544 "reference is missing but expected %s",3545 original_update_refname(update),3546 sha1_to_hex(update->old_sha1));3547 else3548 strbuf_addf(err, "cannot lock ref '%s': "3549 "is at %s but expected %s",3550 original_update_refname(update),3551 oid_to_hex(oid),3552 sha1_to_hex(update->old_sha1));35533554 return -1;3555}35563557/*3558 * Prepare for carrying out update:3559 * - Lock the reference referred to by update.3560 * - Read the reference under lock.3561 * - Check that its old SHA-1 value (if specified) is correct, and in3562 * any case record it in update->lock->old_oid for later use when3563 * writing the reflog.3564 * - If it is a symref update without REF_NODEREF, split it up into a3565 * REF_LOG_ONLY update of the symref and add a separate update for3566 * the referent to transaction.3567 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3568 * update of HEAD.3569 */3570static int lock_ref_for_update(struct ref_update *update,3571 struct ref_transaction *transaction,3572 const char *head_ref,3573 struct string_list *affected_refnames,3574 struct strbuf *err)3575{3576 struct strbuf referent = STRBUF_INIT;3577 int mustexist = (update->flags & REF_HAVE_OLD) &&3578 !is_null_sha1(update->old_sha1);3579 int ret;3580 struct ref_lock *lock;35813582 if ((update->flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1))3583 update->flags |= REF_DELETING;35843585 if (head_ref) {3586 ret = split_head_update(update, transaction, head_ref,3587 affected_refnames, err);3588 if (ret)3589 return ret;3590 }35913592 ret = lock_raw_ref(update->refname, mustexist,3593 affected_refnames, NULL,3594 &update->lock, &referent,3595 &update->type, err);35963597 if (ret) {3598 char *reason;35993600 reason = strbuf_detach(err, NULL);3601 strbuf_addf(err, "cannot lock ref '%s': %s",3602 original_update_refname(update), reason);3603 free(reason);3604 return ret;3605 }36063607 lock = update->lock;36083609 if (update->type & REF_ISSYMREF) {3610 if (update->flags & REF_NODEREF) {3611 /*3612 * We won't be reading the referent as part of3613 * the transaction, so we have to read it here3614 * to record and possibly check old_sha1:3615 */3616 if (read_ref_full(referent.buf, 0,3617 lock->old_oid.hash, NULL)) {3618 if (update->flags & REF_HAVE_OLD) {3619 strbuf_addf(err, "cannot lock ref '%s': "3620 "error reading reference",3621 original_update_refname(update));3622 return -1;3623 }3624 } else if (check_old_oid(update, &lock->old_oid, err)) {3625 return TRANSACTION_GENERIC_ERROR;3626 }3627 } else {3628 /*3629 * Create a new update for the reference this3630 * symref is pointing at. Also, we will record3631 * and verify old_sha1 for this update as part3632 * of processing the split-off update, so we3633 * don't have to do it here.3634 */3635 ret = split_symref_update(update, referent.buf, transaction,3636 affected_refnames, err);3637 if (ret)3638 return ret;3639 }3640 } else {3641 struct ref_update *parent_update;36423643 if (check_old_oid(update, &lock->old_oid, err))3644 return TRANSACTION_GENERIC_ERROR;36453646 /*3647 * If this update is happening indirectly because of a3648 * symref update, record the old SHA-1 in the parent3649 * update:3650 */3651 for (parent_update = update->parent_update;3652 parent_update;3653 parent_update = parent_update->parent_update) {3654 oidcpy(&parent_update->lock->old_oid, &lock->old_oid);3655 }3656 }36573658 if ((update->flags & REF_HAVE_NEW) &&3659 !(update->flags & REF_DELETING) &&3660 !(update->flags & REF_LOG_ONLY)) {3661 if (!(update->type & REF_ISSYMREF) &&3662 !hashcmp(lock->old_oid.hash, update->new_sha1)) {3663 /*3664 * The reference already has the desired3665 * value, so we don't need to write it.3666 */3667 } else if (write_ref_to_lockfile(lock, update->new_sha1,3668 err)) {3669 char *write_err = strbuf_detach(err, NULL);36703671 /*3672 * The lock was freed upon failure of3673 * write_ref_to_lockfile():3674 */3675 update->lock = NULL;3676 strbuf_addf(err,3677 "cannot update ref '%s': %s",3678 update->refname, write_err);3679 free(write_err);3680 return TRANSACTION_GENERIC_ERROR;3681 } else {3682 update->flags |= REF_NEEDS_COMMIT;3683 }3684 }3685 if (!(update->flags & REF_NEEDS_COMMIT)) {3686 /*3687 * We didn't call write_ref_to_lockfile(), so3688 * the lockfile is still open. Close it to3689 * free up the file descriptor:3690 */3691 if (close_ref(lock)) {3692 strbuf_addf(err, "couldn't close '%s.lock'",3693 update->refname);3694 return TRANSACTION_GENERIC_ERROR;3695 }3696 }3697 return 0;3698}36993700int ref_transaction_commit(struct ref_transaction *transaction,3701 struct strbuf *err)3702{3703 int ret = 0, i;3704 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3705 struct string_list_item *ref_to_delete;3706 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3707 char *head_ref = NULL;3708 int head_type;3709 struct object_id head_oid;37103711 assert(err);37123713 if (transaction->state != REF_TRANSACTION_OPEN)3714 die("BUG: commit called for transaction that is not open");37153716 if (!transaction->nr) {3717 transaction->state = REF_TRANSACTION_CLOSED;3718 return 0;3719 }37203721 /*3722 * Fail if a refname appears more than once in the3723 * transaction. (If we end up splitting up any updates using3724 * split_symref_update() or split_head_update(), those3725 * functions will check that the new updates don't have the3726 * same refname as any existing ones.)3727 */3728 for (i = 0; i < transaction->nr; i++) {3729 struct ref_update *update = transaction->updates[i];3730 struct string_list_item *item =3731 string_list_append(&affected_refnames, update->refname);37323733 /*3734 * We store a pointer to update in item->util, but at3735 * the moment we never use the value of this field3736 * except to check whether it is non-NULL.3737 */3738 item->util = update;3739 }3740 string_list_sort(&affected_refnames);3741 if (ref_update_reject_duplicates(&affected_refnames, err)) {3742 ret = TRANSACTION_GENERIC_ERROR;3743 goto cleanup;3744 }37453746 /*3747 * Special hack: If a branch is updated directly and HEAD3748 * points to it (may happen on the remote side of a push3749 * for example) then logically the HEAD reflog should be3750 * updated too.3751 *3752 * A generic solution would require reverse symref lookups,3753 * but finding all symrefs pointing to a given branch would be3754 * rather costly for this rare event (the direct update of a3755 * branch) to be worth it. So let's cheat and check with HEAD3756 * only, which should cover 99% of all usage scenarios (even3757 * 100% of the default ones).3758 *3759 * So if HEAD is a symbolic reference, then record the name of3760 * the reference that it points to. If we see an update of3761 * head_ref within the transaction, then split_head_update()3762 * arranges for the reflog of HEAD to be updated, too.3763 */3764 head_ref = resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3765 head_oid.hash, &head_type);37663767 if (head_ref && !(head_type & REF_ISSYMREF)) {3768 free(head_ref);3769 head_ref = NULL;3770 }37713772 /*3773 * Acquire all locks, verify old values if provided, check3774 * that new values are valid, and write new values to the3775 * lockfiles, ready to be activated. Only keep one lockfile3776 * open at a time to avoid running out of file descriptors.3777 */3778 for (i = 0; i < transaction->nr; i++) {3779 struct ref_update *update = transaction->updates[i];37803781 ret = lock_ref_for_update(update, transaction, head_ref,3782 &affected_refnames, err);3783 if (ret)3784 goto cleanup;3785 }37863787 /* Perform updates first so live commits remain referenced */3788 for (i = 0; i < transaction->nr; i++) {3789 struct ref_update *update = transaction->updates[i];3790 struct ref_lock *lock = update->lock;37913792 if (update->flags & REF_NEEDS_COMMIT ||3793 update->flags & REF_LOG_ONLY) {3794 if (log_ref_write(lock->ref_name, lock->old_oid.hash,3795 update->new_sha1,3796 update->msg, update->flags, err)) {3797 char *old_msg = strbuf_detach(err, NULL);37983799 strbuf_addf(err, "cannot update the ref '%s': %s",3800 lock->ref_name, old_msg);3801 free(old_msg);3802 unlock_ref(lock);3803 update->lock = NULL;3804 ret = TRANSACTION_GENERIC_ERROR;3805 goto cleanup;3806 }3807 }3808 if (update->flags & REF_NEEDS_COMMIT) {3809 clear_loose_ref_cache(&ref_cache);3810 if (commit_ref(lock)) {3811 strbuf_addf(err, "couldn't set '%s'", lock->ref_name);3812 unlock_ref(lock);3813 update->lock = NULL;3814 ret = TRANSACTION_GENERIC_ERROR;3815 goto cleanup;3816 }3817 }3818 }3819 /* Perform deletes now that updates are safely completed */3820 for (i = 0; i < transaction->nr; i++) {3821 struct ref_update *update = transaction->updates[i];38223823 if (update->flags & REF_DELETING &&3824 !(update->flags & REF_LOG_ONLY)) {3825 if (delete_ref_loose(update->lock, update->type, err)) {3826 ret = TRANSACTION_GENERIC_ERROR;3827 goto cleanup;3828 }38293830 if (!(update->flags & REF_ISPRUNING))3831 string_list_append(&refs_to_delete,3832 update->lock->ref_name);3833 }3834 }38353836 if (repack_without_refs(&refs_to_delete, err)) {3837 ret = TRANSACTION_GENERIC_ERROR;3838 goto cleanup;3839 }3840 for_each_string_list_item(ref_to_delete, &refs_to_delete)3841 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3842 clear_loose_ref_cache(&ref_cache);38433844cleanup:3845 transaction->state = REF_TRANSACTION_CLOSED;38463847 for (i = 0; i < transaction->nr; i++)3848 if (transaction->updates[i]->lock)3849 unlock_ref(transaction->updates[i]->lock);3850 string_list_clear(&refs_to_delete, 0);3851 free(head_ref);3852 string_list_clear(&affected_refnames, 0);38533854 return ret;3855}38563857static int ref_present(const char *refname,3858 const struct object_id *oid, int flags, void *cb_data)3859{3860 struct string_list *affected_refnames = cb_data;38613862 return string_list_has_string(affected_refnames, refname);3863}38643865int initial_ref_transaction_commit(struct ref_transaction *transaction,3866 struct strbuf *err)3867{3868 int ret = 0, i;3869 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;38703871 assert(err);38723873 if (transaction->state != REF_TRANSACTION_OPEN)3874 die("BUG: commit called for transaction that is not open");38753876 /* Fail if a refname appears more than once in the transaction: */3877 for (i = 0; i < transaction->nr; i++)3878 string_list_append(&affected_refnames,3879 transaction->updates[i]->refname);3880 string_list_sort(&affected_refnames);3881 if (ref_update_reject_duplicates(&affected_refnames, err)) {3882 ret = TRANSACTION_GENERIC_ERROR;3883 goto cleanup;3884 }38853886 /*3887 * It's really undefined to call this function in an active3888 * repository or when there are existing references: we are3889 * only locking and changing packed-refs, so (1) any3890 * simultaneous processes might try to change a reference at3891 * the same time we do, and (2) any existing loose versions of3892 * the references that we are setting would have precedence3893 * over our values. But some remote helpers create the remote3894 * "HEAD" and "master" branches before calling this function,3895 * so here we really only check that none of the references3896 * that we are creating already exists.3897 */3898 if (for_each_rawref(ref_present, &affected_refnames))3899 die("BUG: initial ref transaction called with existing refs");39003901 for (i = 0; i < transaction->nr; i++) {3902 struct ref_update *update = transaction->updates[i];39033904 if ((update->flags & REF_HAVE_OLD) &&3905 !is_null_sha1(update->old_sha1))3906 die("BUG: initial ref transaction with old_sha1 set");3907 if (verify_refname_available(update->refname,3908 &affected_refnames, NULL,3909 err)) {3910 ret = TRANSACTION_NAME_CONFLICT;3911 goto cleanup;3912 }3913 }39143915 if (lock_packed_refs(0)) {3916 strbuf_addf(err, "unable to lock packed-refs file: %s",3917 strerror(errno));3918 ret = TRANSACTION_GENERIC_ERROR;3919 goto cleanup;3920 }39213922 for (i = 0; i < transaction->nr; i++) {3923 struct ref_update *update = transaction->updates[i];39243925 if ((update->flags & REF_HAVE_NEW) &&3926 !is_null_sha1(update->new_sha1))3927 add_packed_ref(update->refname, update->new_sha1);3928 }39293930 if (commit_packed_refs()) {3931 strbuf_addf(err, "unable to commit packed-refs file: %s",3932 strerror(errno));3933 ret = TRANSACTION_GENERIC_ERROR;3934 goto cleanup;3935 }39363937cleanup:3938 transaction->state = REF_TRANSACTION_CLOSED;3939 string_list_clear(&affected_refnames, 0);3940 return ret;3941}39423943struct expire_reflog_cb {3944 unsigned int flags;3945 reflog_expiry_should_prune_fn *should_prune_fn;3946 void *policy_cb;3947 FILE *newlog;3948 unsigned char last_kept_sha1[20];3949};39503951static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,3952 const char *email, unsigned long timestamp, int tz,3953 const char *message, void *cb_data)3954{3955 struct expire_reflog_cb *cb = cb_data;3956 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;39573958 if (cb->flags & EXPIRE_REFLOGS_REWRITE)3959 osha1 = cb->last_kept_sha1;39603961 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3962 message, policy_cb)) {3963 if (!cb->newlog)3964 printf("would prune %s", message);3965 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)3966 printf("prune %s", message);3967 } else {3968 if (cb->newlog) {3969 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",3970 sha1_to_hex(osha1), sha1_to_hex(nsha1),3971 email, timestamp, tz, message);3972 hashcpy(cb->last_kept_sha1, nsha1);3973 }3974 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)3975 printf("keep %s", message);3976 }3977 return 0;3978}39793980int reflog_expire(const char *refname, const unsigned char *sha1,3981 unsigned int flags,3982 reflog_expiry_prepare_fn prepare_fn,3983 reflog_expiry_should_prune_fn should_prune_fn,3984 reflog_expiry_cleanup_fn cleanup_fn,3985 void *policy_cb_data)3986{3987 static struct lock_file reflog_lock;3988 struct expire_reflog_cb cb;3989 struct ref_lock *lock;3990 char *log_file;3991 int status = 0;3992 int type;3993 struct strbuf err = STRBUF_INIT;39943995 memset(&cb, 0, sizeof(cb));3996 cb.flags = flags;3997 cb.policy_cb = policy_cb_data;3998 cb.should_prune_fn = should_prune_fn;39994000 /*4001 * The reflog file is locked by holding the lock on the4002 * reference itself, plus we might need to update the4003 * reference if --updateref was specified:4004 */4005 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,4006 &type, &err);4007 if (!lock) {4008 error("cannot lock ref '%s': %s", refname, err.buf);4009 strbuf_release(&err);4010 return -1;4011 }4012 if (!reflog_exists(refname)) {4013 unlock_ref(lock);4014 return 0;4015 }40164017 log_file = git_pathdup("logs/%s", refname);4018 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4019 /*4020 * Even though holding $GIT_DIR/logs/$reflog.lock has4021 * no locking implications, we use the lock_file4022 * machinery here anyway because it does a lot of the4023 * work we need, including cleaning up if the program4024 * exits unexpectedly.4025 */4026 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {4027 struct strbuf err = STRBUF_INIT;4028 unable_to_lock_message(log_file, errno, &err);4029 error("%s", err.buf);4030 strbuf_release(&err);4031 goto failure;4032 }4033 cb.newlog = fdopen_lock_file(&reflog_lock, "w");4034 if (!cb.newlog) {4035 error("cannot fdopen %s (%s)",4036 get_lock_file_path(&reflog_lock), strerror(errno));4037 goto failure;4038 }4039 }40404041 (*prepare_fn)(refname, sha1, cb.policy_cb);4042 for_each_reflog_ent(refname, expire_reflog_ent, &cb);4043 (*cleanup_fn)(cb.policy_cb);40444045 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4046 /*4047 * It doesn't make sense to adjust a reference pointed4048 * to by a symbolic ref based on expiring entries in4049 * the symbolic reference's reflog. Nor can we update4050 * a reference if there are no remaining reflog4051 * entries.4052 */4053 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4054 !(type & REF_ISSYMREF) &&4055 !is_null_sha1(cb.last_kept_sha1);40564057 if (close_lock_file(&reflog_lock)) {4058 status |= error("couldn't write %s: %s", log_file,4059 strerror(errno));4060 } else if (update &&4061 (write_in_full(get_lock_file_fd(lock->lk),4062 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||4063 write_str_in_full(get_lock_file_fd(lock->lk), "\n") != 1 ||4064 close_ref(lock) < 0)) {4065 status |= error("couldn't write %s",4066 get_lock_file_path(lock->lk));4067 rollback_lock_file(&reflog_lock);4068 } else if (commit_lock_file(&reflog_lock)) {4069 status |= error("unable to write reflog '%s' (%s)",4070 log_file, strerror(errno));4071 } else if (update && commit_ref(lock)) {4072 status |= error("couldn't set %s", lock->ref_name);4073 }4074 }4075 free(log_file);4076 unlock_ref(lock);4077 return status;40784079 failure:4080 rollback_lock_file(&reflog_lock);4081 free(log_file);4082 unlock_ref(lock);4083 return -1;4084}