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 files_ref_store; 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 files_ref_store that contains this ref_dir. */ 82 struct files_ref_store *ref_store; 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 files_ref_store *ref_store, 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_store, 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 files_ref_store *ref_store, 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_store = ref_store; 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_store, 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, 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 files_ref_store::packed if any. 891 * The data will not be freed as long as the reference count 892 * is 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 */ 913struct files_ref_store { 914 struct ref_store base; 915 struct ref_entry *loose; 916 struct packed_ref_cache *packed; 917}; 918 919/* Lock used for the main packed-refs file: */ 920static struct lock_file packlock; 921 922/* 923 * Increment the reference count of *packed_refs. 924 */ 925static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 926{ 927 packed_refs->referrers++; 928} 929 930/* 931 * Decrease the reference count of *packed_refs. If it goes to zero, 932 * free *packed_refs and return true; otherwise return false. 933 */ 934static int release_packed_ref_cache(struct packed_ref_cache *packed_refs) 935{ 936 if (!--packed_refs->referrers) { 937 free_ref_entry(packed_refs->root); 938 stat_validity_clear(&packed_refs->validity); 939 free(packed_refs); 940 return 1; 941 } else { 942 return 0; 943 } 944} 945 946static void clear_packed_ref_cache(struct files_ref_store *refs) 947{ 948 if (refs->packed) { 949 struct packed_ref_cache *packed_refs = refs->packed; 950 951 if (packed_refs->lock) 952 die("internal error: packed-ref cache cleared while locked"); 953 refs->packed = NULL; 954 release_packed_ref_cache(packed_refs); 955 } 956} 957 958static void clear_loose_ref_cache(struct files_ref_store *refs) 959{ 960 if (refs->loose) { 961 free_ref_entry(refs->loose); 962 refs->loose = NULL; 963 } 964} 965 966/* 967 * Create a new submodule ref cache and add it to the internal 968 * set of caches. 969 */ 970static struct ref_store *files_ref_store_create(const char *submodule) 971{ 972 struct files_ref_store *refs = xcalloc(1, sizeof(*refs)); 973 struct ref_store *ref_store = (struct ref_store *)refs; 974 975 base_ref_store_init(ref_store, &refs_be_files, submodule); 976 977 return ref_store; 978} 979 980/* 981 * Downcast ref_store to files_ref_store. Die if ref_store is not a 982 * files_ref_store. If submodule_allowed is not true, then also die if 983 * files_ref_store is for a submodule (i.e., not for the main 984 * repository). caller is used in any necessary error messages. 985 */ 986static struct files_ref_store *files_downcast( 987 struct ref_store *ref_store, int submodule_allowed, 988 const char *caller) 989{ 990 if (ref_store->be != &refs_be_files) 991 die("BUG: ref_store is type \"%s\" not \"files\" in %s", 992 ref_store->be->name, caller); 993 994 if (!submodule_allowed) 995 assert_main_repository(ref_store, caller); 996 997 return (struct files_ref_store *)ref_store; 998} 9991000/* The length of a peeled reference line in packed-refs, including EOL: */1001#define PEELED_LINE_LENGTH 4210021003/*1004 * The packed-refs header line that we write out. Perhaps other1005 * traits will be added later. The trailing space is required.1006 */1007static const char PACKED_REFS_HEADER[] =1008 "# pack-refs with: peeled fully-peeled \n";10091010/*1011 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1012 * Return a pointer to the refname within the line (null-terminated),1013 * or NULL if there was a problem.1014 */1015static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)1016{1017 const char *ref;10181019 /*1020 * 42: the answer to everything.1021 *1022 * In this case, it happens to be the answer to1023 * 40 (length of sha1 hex representation)1024 * +1 (space in between hex and name)1025 * +1 (newline at the end of the line)1026 */1027 if (line->len <= 42)1028 return NULL;10291030 if (get_sha1_hex(line->buf, sha1) < 0)1031 return NULL;1032 if (!isspace(line->buf[40]))1033 return NULL;10341035 ref = line->buf + 41;1036 if (isspace(*ref))1037 return NULL;10381039 if (line->buf[line->len - 1] != '\n')1040 return NULL;1041 line->buf[--line->len] = 0;10421043 return ref;1044}10451046/*1047 * Read f, which is a packed-refs file, into dir.1048 *1049 * A comment line of the form "# pack-refs with: " may contain zero or1050 * more traits. We interpret the traits as follows:1051 *1052 * No traits:1053 *1054 * Probably no references are peeled. But if the file contains a1055 * peeled value for a reference, we will use it.1056 *1057 * peeled:1058 *1059 * References under "refs/tags/", if they *can* be peeled, *are*1060 * peeled in this file. References outside of "refs/tags/" are1061 * probably not peeled even if they could have been, but if we find1062 * a peeled value for such a reference we will use it.1063 *1064 * fully-peeled:1065 *1066 * All references in the file that can be peeled are peeled.1067 * Inversely (and this is more important), any references in the1068 * file for which no peeled value is recorded is not peelable. This1069 * trait should typically be written alongside "peeled" for1070 * compatibility with older clients, but we do not require it1071 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1072 */1073static void read_packed_refs(FILE *f, struct ref_dir *dir)1074{1075 struct ref_entry *last = NULL;1076 struct strbuf line = STRBUF_INIT;1077 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;10781079 while (strbuf_getwholeline(&line, f, '\n') != EOF) {1080 unsigned char sha1[20];1081 const char *refname;1082 const char *traits;10831084 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {1085 if (strstr(traits, " fully-peeled "))1086 peeled = PEELED_FULLY;1087 else if (strstr(traits, " peeled "))1088 peeled = PEELED_TAGS;1089 /* perhaps other traits later as well */1090 continue;1091 }10921093 refname = parse_ref_line(&line, sha1);1094 if (refname) {1095 int flag = REF_ISPACKED;10961097 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1098 if (!refname_is_safe(refname))1099 die("packed refname is dangerous: %s", refname);1100 hashclr(sha1);1101 flag |= REF_BAD_NAME | REF_ISBROKEN;1102 }1103 last = create_ref_entry(refname, sha1, flag, 0);1104 if (peeled == PEELED_FULLY ||1105 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))1106 last->flag |= REF_KNOWS_PEELED;1107 add_ref(dir, last);1108 continue;1109 }1110 if (last &&1111 line.buf[0] == '^' &&1112 line.len == PEELED_LINE_LENGTH &&1113 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&1114 !get_sha1_hex(line.buf + 1, sha1)) {1115 hashcpy(last->u.value.peeled.hash, sha1);1116 /*1117 * Regardless of what the file header said,1118 * we definitely know the value of *this*1119 * reference:1120 */1121 last->flag |= REF_KNOWS_PEELED;1122 }1123 }11241125 strbuf_release(&line);1126}11271128/*1129 * Get the packed_ref_cache for the specified files_ref_store,1130 * creating it if necessary.1131 */1132static struct packed_ref_cache *get_packed_ref_cache(struct files_ref_store *refs)1133{1134 char *packed_refs_file;11351136 if (*refs->base.submodule)1137 packed_refs_file = git_pathdup_submodule(refs->base.submodule,1138 "packed-refs");1139 else1140 packed_refs_file = git_pathdup("packed-refs");11411142 if (refs->packed &&1143 !stat_validity_check(&refs->packed->validity, packed_refs_file))1144 clear_packed_ref_cache(refs);11451146 if (!refs->packed) {1147 FILE *f;11481149 refs->packed = xcalloc(1, sizeof(*refs->packed));1150 acquire_packed_ref_cache(refs->packed);1151 refs->packed->root = create_dir_entry(refs, "", 0, 0);1152 f = fopen(packed_refs_file, "r");1153 if (f) {1154 stat_validity_update(&refs->packed->validity, fileno(f));1155 read_packed_refs(f, get_ref_dir(refs->packed->root));1156 fclose(f);1157 }1158 }1159 free(packed_refs_file);1160 return refs->packed;1161}11621163static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1164{1165 return get_ref_dir(packed_ref_cache->root);1166}11671168static struct ref_dir *get_packed_refs(struct files_ref_store *refs)1169{1170 return get_packed_ref_dir(get_packed_ref_cache(refs));1171}11721173/*1174 * Add a reference to the in-memory packed reference cache. This may1175 * only be called while the packed-refs file is locked (see1176 * lock_packed_refs()). To actually write the packed-refs file, call1177 * commit_packed_refs().1178 */1179static void add_packed_ref(struct files_ref_store *refs,1180 const char *refname, const unsigned char *sha1)1181{1182 struct packed_ref_cache *packed_ref_cache = get_packed_ref_cache(refs);11831184 if (!packed_ref_cache->lock)1185 die("internal error: packed refs not locked");1186 add_ref(get_packed_ref_dir(packed_ref_cache),1187 create_ref_entry(refname, sha1, REF_ISPACKED, 1));1188}11891190/*1191 * Read the loose references from the namespace dirname into dir1192 * (without recursing). dirname must end with '/'. dir must be the1193 * directory entry corresponding to dirname.1194 */1195static void read_loose_refs(const char *dirname, struct ref_dir *dir)1196{1197 struct files_ref_store *refs = dir->ref_store;1198 DIR *d;1199 struct dirent *de;1200 int dirnamelen = strlen(dirname);1201 struct strbuf refname;1202 struct strbuf path = STRBUF_INIT;1203 size_t path_baselen;1204 int err = 0;12051206 if (*refs->base.submodule)1207 err = strbuf_git_path_submodule(&path, refs->base.submodule, "%s", dirname);1208 else1209 strbuf_git_path(&path, "%s", dirname);1210 path_baselen = path.len;12111212 if (err) {1213 strbuf_release(&path);1214 return;1215 }12161217 d = opendir(path.buf);1218 if (!d) {1219 strbuf_release(&path);1220 return;1221 }12221223 strbuf_init(&refname, dirnamelen + 257);1224 strbuf_add(&refname, dirname, dirnamelen);12251226 while ((de = readdir(d)) != NULL) {1227 unsigned char sha1[20];1228 struct stat st;1229 int flag;12301231 if (de->d_name[0] == '.')1232 continue;1233 if (ends_with(de->d_name, ".lock"))1234 continue;1235 strbuf_addstr(&refname, de->d_name);1236 strbuf_addstr(&path, de->d_name);1237 if (stat(path.buf, &st) < 0) {1238 ; /* silently ignore */1239 } else if (S_ISDIR(st.st_mode)) {1240 strbuf_addch(&refname, '/');1241 add_entry_to_dir(dir,1242 create_dir_entry(refs, refname.buf,1243 refname.len, 1));1244 } else {1245 int read_ok;12461247 if (*refs->base.submodule) {1248 hashclr(sha1);1249 flag = 0;1250 read_ok = !resolve_gitlink_ref(refs->base.submodule,1251 refname.buf, sha1);1252 } else {1253 read_ok = !read_ref_full(refname.buf,1254 RESOLVE_REF_READING,1255 sha1, &flag);1256 }12571258 if (!read_ok) {1259 hashclr(sha1);1260 flag |= REF_ISBROKEN;1261 } else if (is_null_sha1(sha1)) {1262 /*1263 * It is so astronomically unlikely1264 * that NULL_SHA1 is the SHA-1 of an1265 * actual object that we consider its1266 * appearance in a loose reference1267 * file to be repo corruption1268 * (probably due to a software bug).1269 */1270 flag |= REF_ISBROKEN;1271 }12721273 if (check_refname_format(refname.buf,1274 REFNAME_ALLOW_ONELEVEL)) {1275 if (!refname_is_safe(refname.buf))1276 die("loose refname is dangerous: %s", refname.buf);1277 hashclr(sha1);1278 flag |= REF_BAD_NAME | REF_ISBROKEN;1279 }1280 add_entry_to_dir(dir,1281 create_ref_entry(refname.buf, sha1, flag, 0));1282 }1283 strbuf_setlen(&refname, dirnamelen);1284 strbuf_setlen(&path, path_baselen);1285 }1286 strbuf_release(&refname);1287 strbuf_release(&path);1288 closedir(d);1289}12901291static struct ref_dir *get_loose_refs(struct files_ref_store *refs)1292{1293 if (!refs->loose) {1294 /*1295 * Mark the top-level directory complete because we1296 * are about to read the only subdirectory that can1297 * hold references:1298 */1299 refs->loose = create_dir_entry(refs, "", 0, 0);1300 /*1301 * Create an incomplete entry for "refs/":1302 */1303 add_entry_to_dir(get_ref_dir(refs->loose),1304 create_dir_entry(refs, "refs/", 5, 1));1305 }1306 return get_ref_dir(refs->loose);1307}13081309/*1310 * Return the ref_entry for the given refname from the packed1311 * references. If it does not exist, return NULL.1312 */1313static struct ref_entry *get_packed_ref(struct files_ref_store *refs,1314 const char *refname)1315{1316 return find_ref(get_packed_refs(refs), refname);1317}13181319/*1320 * A loose ref file doesn't exist; check for a packed ref.1321 */1322static int resolve_packed_ref(struct files_ref_store *refs,1323 const char *refname,1324 unsigned char *sha1, unsigned int *flags)1325{1326 struct ref_entry *entry;13271328 /*1329 * The loose reference file does not exist; check for a packed1330 * reference.1331 */1332 entry = get_packed_ref(refs, refname);1333 if (entry) {1334 hashcpy(sha1, entry->u.value.oid.hash);1335 *flags |= REF_ISPACKED;1336 return 0;1337 }1338 /* refname is not a packed reference. */1339 return -1;1340}13411342static int files_read_raw_ref(struct ref_store *ref_store,1343 const char *refname, unsigned char *sha1,1344 struct strbuf *referent, unsigned int *type)1345{1346 struct files_ref_store *refs =1347 files_downcast(ref_store, 1, "read_raw_ref");1348 struct strbuf sb_contents = STRBUF_INIT;1349 struct strbuf sb_path = STRBUF_INIT;1350 const char *path;1351 const char *buf;1352 struct stat st;1353 int fd;1354 int ret = -1;1355 int save_errno;1356 int remaining_retries = 3;13571358 *type = 0;1359 strbuf_reset(&sb_path);13601361 if (*refs->base.submodule)1362 strbuf_git_path_submodule(&sb_path, refs->base.submodule, "%s", refname);1363 else1364 strbuf_git_path(&sb_path, "%s", refname);13651366 path = sb_path.buf;13671368stat_ref:1369 /*1370 * We might have to loop back here to avoid a race1371 * condition: first we lstat() the file, then we try1372 * to read it as a link or as a file. But if somebody1373 * changes the type of the file (file <-> directory1374 * <-> symlink) between the lstat() and reading, then1375 * we don't want to report that as an error but rather1376 * try again starting with the lstat().1377 *1378 * We'll keep a count of the retries, though, just to avoid1379 * any confusing situation sending us into an infinite loop.1380 */13811382 if (remaining_retries-- <= 0)1383 goto out;13841385 if (lstat(path, &st) < 0) {1386 if (errno != ENOENT)1387 goto out;1388 if (resolve_packed_ref(refs, refname, sha1, type)) {1389 errno = ENOENT;1390 goto out;1391 }1392 ret = 0;1393 goto out;1394 }13951396 /* Follow "normalized" - ie "refs/.." symlinks by hand */1397 if (S_ISLNK(st.st_mode)) {1398 strbuf_reset(&sb_contents);1399 if (strbuf_readlink(&sb_contents, path, 0) < 0) {1400 if (errno == ENOENT || errno == EINVAL)1401 /* inconsistent with lstat; retry */1402 goto stat_ref;1403 else1404 goto out;1405 }1406 if (starts_with(sb_contents.buf, "refs/") &&1407 !check_refname_format(sb_contents.buf, 0)) {1408 strbuf_swap(&sb_contents, referent);1409 *type |= REF_ISSYMREF;1410 ret = 0;1411 goto out;1412 }1413 /*1414 * It doesn't look like a refname; fall through to just1415 * treating it like a non-symlink, and reading whatever it1416 * points to.1417 */1418 }14191420 /* Is it a directory? */1421 if (S_ISDIR(st.st_mode)) {1422 /*1423 * Even though there is a directory where the loose1424 * ref is supposed to be, there could still be a1425 * packed ref:1426 */1427 if (resolve_packed_ref(refs, refname, sha1, type)) {1428 errno = EISDIR;1429 goto out;1430 }1431 ret = 0;1432 goto out;1433 }14341435 /*1436 * Anything else, just open it and try to use it as1437 * a ref1438 */1439 fd = open(path, O_RDONLY);1440 if (fd < 0) {1441 if (errno == ENOENT && !S_ISLNK(st.st_mode))1442 /* inconsistent with lstat; retry */1443 goto stat_ref;1444 else1445 goto out;1446 }1447 strbuf_reset(&sb_contents);1448 if (strbuf_read(&sb_contents, fd, 256) < 0) {1449 int save_errno = errno;1450 close(fd);1451 errno = save_errno;1452 goto out;1453 }1454 close(fd);1455 strbuf_rtrim(&sb_contents);1456 buf = sb_contents.buf;1457 if (starts_with(buf, "ref:")) {1458 buf += 4;1459 while (isspace(*buf))1460 buf++;14611462 strbuf_reset(referent);1463 strbuf_addstr(referent, buf);1464 *type |= REF_ISSYMREF;1465 ret = 0;1466 goto out;1467 }14681469 /*1470 * Please note that FETCH_HEAD has additional1471 * data after the sha.1472 */1473 if (get_sha1_hex(buf, sha1) ||1474 (buf[40] != '\0' && !isspace(buf[40]))) {1475 *type |= REF_ISBROKEN;1476 errno = EINVAL;1477 goto out;1478 }14791480 ret = 0;14811482out:1483 save_errno = errno;1484 strbuf_release(&sb_path);1485 strbuf_release(&sb_contents);1486 errno = save_errno;1487 return ret;1488}14891490static void unlock_ref(struct ref_lock *lock)1491{1492 /* Do not free lock->lk -- atexit() still looks at them */1493 if (lock->lk)1494 rollback_lock_file(lock->lk);1495 free(lock->ref_name);1496 free(lock);1497}14981499/*1500 * Lock refname, without following symrefs, and set *lock_p to point1501 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1502 * and type similarly to read_raw_ref().1503 *1504 * The caller must verify that refname is a "safe" reference name (in1505 * the sense of refname_is_safe()) before calling this function.1506 *1507 * If the reference doesn't already exist, verify that refname doesn't1508 * have a D/F conflict with any existing references. extras and skip1509 * are passed to verify_refname_available_dir() for this check.1510 *1511 * If mustexist is not set and the reference is not found or is1512 * broken, lock the reference anyway but clear sha1.1513 *1514 * Return 0 on success. On failure, write an error message to err and1515 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1516 *1517 * Implementation note: This function is basically1518 *1519 * lock reference1520 * read_raw_ref()1521 *1522 * but it includes a lot more code to1523 * - Deal with possible races with other processes1524 * - Avoid calling verify_refname_available_dir() when it can be1525 * avoided, namely if we were successfully able to read the ref1526 * - Generate informative error messages in the case of failure1527 */1528static int lock_raw_ref(struct files_ref_store *refs,1529 const char *refname, int mustexist,1530 const struct string_list *extras,1531 const struct string_list *skip,1532 struct ref_lock **lock_p,1533 struct strbuf *referent,1534 unsigned int *type,1535 struct strbuf *err)1536{1537 struct ref_lock *lock;1538 struct strbuf ref_file = STRBUF_INIT;1539 int attempts_remaining = 3;1540 int ret = TRANSACTION_GENERIC_ERROR;15411542 assert(err);1543 assert_main_repository(&refs->base, "lock_raw_ref");15441545 *type = 0;15461547 /* First lock the file so it can't change out from under us. */15481549 *lock_p = lock = xcalloc(1, sizeof(*lock));15501551 lock->ref_name = xstrdup(refname);1552 strbuf_git_path(&ref_file, "%s", refname);15531554retry:1555 switch (safe_create_leading_directories(ref_file.buf)) {1556 case SCLD_OK:1557 break; /* success */1558 case SCLD_EXISTS:1559 /*1560 * Suppose refname is "refs/foo/bar". We just failed1561 * to create the containing directory, "refs/foo",1562 * because there was a non-directory in the way. This1563 * indicates a D/F conflict, probably because of1564 * another reference such as "refs/foo". There is no1565 * reason to expect this error to be transitory.1566 */1567 if (verify_refname_available(refname, extras, skip, err)) {1568 if (mustexist) {1569 /*1570 * To the user the relevant error is1571 * that the "mustexist" reference is1572 * missing:1573 */1574 strbuf_reset(err);1575 strbuf_addf(err, "unable to resolve reference '%s'",1576 refname);1577 } else {1578 /*1579 * The error message set by1580 * verify_refname_available_dir() is OK.1581 */1582 ret = TRANSACTION_NAME_CONFLICT;1583 }1584 } else {1585 /*1586 * The file that is in the way isn't a loose1587 * reference. Report it as a low-level1588 * failure.1589 */1590 strbuf_addf(err, "unable to create lock file %s.lock; "1591 "non-directory in the way",1592 ref_file.buf);1593 }1594 goto error_return;1595 case SCLD_VANISHED:1596 /* Maybe another process was tidying up. Try again. */1597 if (--attempts_remaining > 0)1598 goto retry;1599 /* fall through */1600 default:1601 strbuf_addf(err, "unable to create directory for %s",1602 ref_file.buf);1603 goto error_return;1604 }16051606 if (!lock->lk)1607 lock->lk = xcalloc(1, sizeof(struct lock_file));16081609 if (hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) < 0) {1610 if (errno == ENOENT && --attempts_remaining > 0) {1611 /*1612 * Maybe somebody just deleted one of the1613 * directories leading to ref_file. Try1614 * again:1615 */1616 goto retry;1617 } else {1618 unable_to_lock_message(ref_file.buf, errno, err);1619 goto error_return;1620 }1621 }16221623 /*1624 * Now we hold the lock and can read the reference without1625 * fear that its value will change.1626 */16271628 if (files_read_raw_ref(&refs->base, refname,1629 lock->old_oid.hash, referent, type)) {1630 if (errno == ENOENT) {1631 if (mustexist) {1632 /* Garden variety missing reference. */1633 strbuf_addf(err, "unable to resolve reference '%s'",1634 refname);1635 goto error_return;1636 } else {1637 /*1638 * Reference is missing, but that's OK. We1639 * know that there is not a conflict with1640 * another loose reference because1641 * (supposing that we are trying to lock1642 * reference "refs/foo/bar"):1643 *1644 * - We were successfully able to create1645 * the lockfile refs/foo/bar.lock, so we1646 * know there cannot be a loose reference1647 * named "refs/foo".1648 *1649 * - We got ENOENT and not EISDIR, so we1650 * know that there cannot be a loose1651 * reference named "refs/foo/bar/baz".1652 */1653 }1654 } else if (errno == EISDIR) {1655 /*1656 * There is a directory in the way. It might have1657 * contained references that have been deleted. If1658 * we don't require that the reference already1659 * exists, try to remove the directory so that it1660 * doesn't cause trouble when we want to rename the1661 * lockfile into place later.1662 */1663 if (mustexist) {1664 /* Garden variety missing reference. */1665 strbuf_addf(err, "unable to resolve reference '%s'",1666 refname);1667 goto error_return;1668 } else if (remove_dir_recursively(&ref_file,1669 REMOVE_DIR_EMPTY_ONLY)) {1670 if (verify_refname_available_dir(1671 refname, extras, skip,1672 get_loose_refs(refs),1673 err)) {1674 /*1675 * The error message set by1676 * verify_refname_available() is OK.1677 */1678 ret = TRANSACTION_NAME_CONFLICT;1679 goto error_return;1680 } else {1681 /*1682 * We can't delete the directory,1683 * but we also don't know of any1684 * references that it should1685 * contain.1686 */1687 strbuf_addf(err, "there is a non-empty directory '%s' "1688 "blocking reference '%s'",1689 ref_file.buf, refname);1690 goto error_return;1691 }1692 }1693 } else if (errno == EINVAL && (*type & REF_ISBROKEN)) {1694 strbuf_addf(err, "unable to resolve reference '%s': "1695 "reference broken", refname);1696 goto error_return;1697 } else {1698 strbuf_addf(err, "unable to resolve reference '%s': %s",1699 refname, strerror(errno));1700 goto error_return;1701 }17021703 /*1704 * If the ref did not exist and we are creating it,1705 * make sure there is no existing packed ref whose1706 * name begins with our refname, nor a packed ref1707 * whose name is a proper prefix of our refname.1708 */1709 if (verify_refname_available_dir(1710 refname, extras, skip,1711 get_packed_refs(refs),1712 err)) {1713 goto error_return;1714 }1715 }17161717 ret = 0;1718 goto out;17191720error_return:1721 unlock_ref(lock);1722 *lock_p = NULL;17231724out:1725 strbuf_release(&ref_file);1726 return ret;1727}17281729/*1730 * Peel the entry (if possible) and return its new peel_status. If1731 * repeel is true, re-peel the entry even if there is an old peeled1732 * value that is already stored in it.1733 *1734 * It is OK to call this function with a packed reference entry that1735 * might be stale and might even refer to an object that has since1736 * been garbage-collected. In such a case, if the entry has1737 * REF_KNOWS_PEELED then leave the status unchanged and return1738 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1739 */1740static enum peel_status peel_entry(struct ref_entry *entry, int repeel)1741{1742 enum peel_status status;17431744 if (entry->flag & REF_KNOWS_PEELED) {1745 if (repeel) {1746 entry->flag &= ~REF_KNOWS_PEELED;1747 oidclr(&entry->u.value.peeled);1748 } else {1749 return is_null_oid(&entry->u.value.peeled) ?1750 PEEL_NON_TAG : PEEL_PEELED;1751 }1752 }1753 if (entry->flag & REF_ISBROKEN)1754 return PEEL_BROKEN;1755 if (entry->flag & REF_ISSYMREF)1756 return PEEL_IS_SYMREF;17571758 status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1759 if (status == PEEL_PEELED || status == PEEL_NON_TAG)1760 entry->flag |= REF_KNOWS_PEELED;1761 return status;1762}17631764static int files_peel_ref(struct ref_store *ref_store,1765 const char *refname, unsigned char *sha1)1766{1767 struct files_ref_store *refs = files_downcast(ref_store, 0, "peel_ref");1768 int flag;1769 unsigned char base[20];17701771 if (current_ref_iter && current_ref_iter->refname == refname) {1772 struct object_id peeled;17731774 if (ref_iterator_peel(current_ref_iter, &peeled))1775 return -1;1776 hashcpy(sha1, peeled.hash);1777 return 0;1778 }17791780 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1781 return -1;17821783 /*1784 * If the reference is packed, read its ref_entry from the1785 * cache in the hope that we already know its peeled value.1786 * We only try this optimization on packed references because1787 * (a) forcing the filling of the loose reference cache could1788 * be expensive and (b) loose references anyway usually do not1789 * have REF_KNOWS_PEELED.1790 */1791 if (flag & REF_ISPACKED) {1792 struct ref_entry *r = get_packed_ref(refs, refname);1793 if (r) {1794 if (peel_entry(r, 0))1795 return -1;1796 hashcpy(sha1, r->u.value.peeled.hash);1797 return 0;1798 }1799 }18001801 return peel_object(base, sha1);1802}18031804struct files_ref_iterator {1805 struct ref_iterator base;18061807 struct packed_ref_cache *packed_ref_cache;1808 struct ref_iterator *iter0;1809 unsigned int flags;1810};18111812static int files_ref_iterator_advance(struct ref_iterator *ref_iterator)1813{1814 struct files_ref_iterator *iter =1815 (struct files_ref_iterator *)ref_iterator;1816 int ok;18171818 while ((ok = ref_iterator_advance(iter->iter0)) == ITER_OK) {1819 if (iter->flags & DO_FOR_EACH_PER_WORKTREE_ONLY &&1820 ref_type(iter->iter0->refname) != REF_TYPE_PER_WORKTREE)1821 continue;18221823 if (!(iter->flags & DO_FOR_EACH_INCLUDE_BROKEN) &&1824 !ref_resolves_to_object(iter->iter0->refname,1825 iter->iter0->oid,1826 iter->iter0->flags))1827 continue;18281829 iter->base.refname = iter->iter0->refname;1830 iter->base.oid = iter->iter0->oid;1831 iter->base.flags = iter->iter0->flags;1832 return ITER_OK;1833 }18341835 iter->iter0 = NULL;1836 if (ref_iterator_abort(ref_iterator) != ITER_DONE)1837 ok = ITER_ERROR;18381839 return ok;1840}18411842static int files_ref_iterator_peel(struct ref_iterator *ref_iterator,1843 struct object_id *peeled)1844{1845 struct files_ref_iterator *iter =1846 (struct files_ref_iterator *)ref_iterator;18471848 return ref_iterator_peel(iter->iter0, peeled);1849}18501851static int files_ref_iterator_abort(struct ref_iterator *ref_iterator)1852{1853 struct files_ref_iterator *iter =1854 (struct files_ref_iterator *)ref_iterator;1855 int ok = ITER_DONE;18561857 if (iter->iter0)1858 ok = ref_iterator_abort(iter->iter0);18591860 release_packed_ref_cache(iter->packed_ref_cache);1861 base_ref_iterator_free(ref_iterator);1862 return ok;1863}18641865static struct ref_iterator_vtable files_ref_iterator_vtable = {1866 files_ref_iterator_advance,1867 files_ref_iterator_peel,1868 files_ref_iterator_abort1869};18701871static struct ref_iterator *files_ref_iterator_begin(1872 struct ref_store *ref_store,1873 const char *prefix, unsigned int flags)1874{1875 struct files_ref_store *refs =1876 files_downcast(ref_store, 1, "ref_iterator_begin");1877 struct ref_dir *loose_dir, *packed_dir;1878 struct ref_iterator *loose_iter, *packed_iter;1879 struct files_ref_iterator *iter;1880 struct ref_iterator *ref_iterator;18811882 if (!refs)1883 return empty_ref_iterator_begin();18841885 if (ref_paranoia < 0)1886 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);1887 if (ref_paranoia)1888 flags |= DO_FOR_EACH_INCLUDE_BROKEN;18891890 iter = xcalloc(1, sizeof(*iter));1891 ref_iterator = &iter->base;1892 base_ref_iterator_init(ref_iterator, &files_ref_iterator_vtable);18931894 /*1895 * We must make sure that all loose refs are read before1896 * accessing the packed-refs file; this avoids a race1897 * condition if loose refs are migrated to the packed-refs1898 * file by a simultaneous process, but our in-memory view is1899 * from before the migration. We ensure this as follows:1900 * First, we call prime_ref_dir(), which pre-reads the loose1901 * references for the subtree into the cache. (If they've1902 * already been read, that's OK; we only need to guarantee1903 * that they're read before the packed refs, not *how much*1904 * before.) After that, we call get_packed_ref_cache(), which1905 * internally checks whether the packed-ref cache is up to1906 * date with what is on disk, and re-reads it if not.1907 */19081909 loose_dir = get_loose_refs(refs);19101911 if (prefix && *prefix)1912 loose_dir = find_containing_dir(loose_dir, prefix, 0);19131914 if (loose_dir) {1915 prime_ref_dir(loose_dir);1916 loose_iter = cache_ref_iterator_begin(loose_dir);1917 } else {1918 /* There's nothing to iterate over. */1919 loose_iter = empty_ref_iterator_begin();1920 }19211922 iter->packed_ref_cache = get_packed_ref_cache(refs);1923 acquire_packed_ref_cache(iter->packed_ref_cache);1924 packed_dir = get_packed_ref_dir(iter->packed_ref_cache);19251926 if (prefix && *prefix)1927 packed_dir = find_containing_dir(packed_dir, prefix, 0);19281929 if (packed_dir) {1930 packed_iter = cache_ref_iterator_begin(packed_dir);1931 } else {1932 /* There's nothing to iterate over. */1933 packed_iter = empty_ref_iterator_begin();1934 }19351936 iter->iter0 = overlay_ref_iterator_begin(loose_iter, packed_iter);1937 iter->flags = flags;19381939 return ref_iterator;1940}19411942/*1943 * Verify that the reference locked by lock has the value old_sha1.1944 * Fail if the reference doesn't exist and mustexist is set. Return 01945 * on success. On error, write an error message to err, set errno, and1946 * return a negative value.1947 */1948static int verify_lock(struct ref_lock *lock,1949 const unsigned char *old_sha1, int mustexist,1950 struct strbuf *err)1951{1952 assert(err);19531954 if (read_ref_full(lock->ref_name,1955 mustexist ? RESOLVE_REF_READING : 0,1956 lock->old_oid.hash, NULL)) {1957 if (old_sha1) {1958 int save_errno = errno;1959 strbuf_addf(err, "can't verify ref '%s'", lock->ref_name);1960 errno = save_errno;1961 return -1;1962 } else {1963 oidclr(&lock->old_oid);1964 return 0;1965 }1966 }1967 if (old_sha1 && hashcmp(lock->old_oid.hash, old_sha1)) {1968 strbuf_addf(err, "ref '%s' is at %s but expected %s",1969 lock->ref_name,1970 oid_to_hex(&lock->old_oid),1971 sha1_to_hex(old_sha1));1972 errno = EBUSY;1973 return -1;1974 }1975 return 0;1976}19771978static int remove_empty_directories(struct strbuf *path)1979{1980 /*1981 * we want to create a file but there is a directory there;1982 * if that is an empty directory (or a directory that contains1983 * only empty directories), remove them.1984 */1985 return remove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);1986}19871988/*1989 * Locks a ref returning the lock on success and NULL on failure.1990 * On failure errno is set to something meaningful.1991 */1992static struct ref_lock *lock_ref_sha1_basic(struct files_ref_store *refs,1993 const char *refname,1994 const unsigned char *old_sha1,1995 const struct string_list *extras,1996 const struct string_list *skip,1997 unsigned int flags, int *type,1998 struct strbuf *err)1999{2000 struct strbuf ref_file = STRBUF_INIT;2001 struct ref_lock *lock;2002 int last_errno = 0;2003 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2004 int resolve_flags = RESOLVE_REF_NO_RECURSE;2005 int attempts_remaining = 3;2006 int resolved;20072008 assert_main_repository(&refs->base, "lock_ref_sha1_basic");2009 assert(err);20102011 lock = xcalloc(1, sizeof(struct ref_lock));20122013 if (mustexist)2014 resolve_flags |= RESOLVE_REF_READING;2015 if (flags & REF_DELETING)2016 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;20172018 strbuf_git_path(&ref_file, "%s", refname);2019 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2020 lock->old_oid.hash, type);2021 if (!resolved && errno == EISDIR) {2022 /*2023 * we are trying to lock foo but we used to2024 * have foo/bar which now does not exist;2025 * it is normal for the empty directory 'foo'2026 * to remain.2027 */2028 if (remove_empty_directories(&ref_file)) {2029 last_errno = errno;2030 if (!verify_refname_available_dir(2031 refname, extras, skip,2032 get_loose_refs(refs), err))2033 strbuf_addf(err, "there are still refs under '%s'",2034 refname);2035 goto error_return;2036 }2037 resolved = !!resolve_ref_unsafe(refname, resolve_flags,2038 lock->old_oid.hash, type);2039 }2040 if (!resolved) {2041 last_errno = errno;2042 if (last_errno != ENOTDIR ||2043 !verify_refname_available_dir(2044 refname, extras, skip,2045 get_loose_refs(refs), err))2046 strbuf_addf(err, "unable to resolve reference '%s': %s",2047 refname, strerror(last_errno));20482049 goto error_return;2050 }20512052 /*2053 * If the ref did not exist and we are creating it, make sure2054 * there is no existing packed ref whose name begins with our2055 * refname, nor a packed ref whose name is a proper prefix of2056 * our refname.2057 */2058 if (is_null_oid(&lock->old_oid) &&2059 verify_refname_available_dir(refname, extras, skip,2060 get_packed_refs(refs),2061 err)) {2062 last_errno = ENOTDIR;2063 goto error_return;2064 }20652066 lock->lk = xcalloc(1, sizeof(struct lock_file));20672068 lock->ref_name = xstrdup(refname);20692070 retry:2071 switch (safe_create_leading_directories_const(ref_file.buf)) {2072 case SCLD_OK:2073 break; /* success */2074 case SCLD_VANISHED:2075 if (--attempts_remaining > 0)2076 goto retry;2077 /* fall through */2078 default:2079 last_errno = errno;2080 strbuf_addf(err, "unable to create directory for '%s'",2081 ref_file.buf);2082 goto error_return;2083 }20842085 if (hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) < 0) {2086 last_errno = errno;2087 if (errno == ENOENT && --attempts_remaining > 0)2088 /*2089 * Maybe somebody just deleted one of the2090 * directories leading to ref_file. Try2091 * again:2092 */2093 goto retry;2094 else {2095 unable_to_lock_message(ref_file.buf, errno, err);2096 goto error_return;2097 }2098 }2099 if (verify_lock(lock, old_sha1, mustexist, err)) {2100 last_errno = errno;2101 goto error_return;2102 }2103 goto out;21042105 error_return:2106 unlock_ref(lock);2107 lock = NULL;21082109 out:2110 strbuf_release(&ref_file);2111 errno = last_errno;2112 return lock;2113}21142115/*2116 * Write an entry to the packed-refs file for the specified refname.2117 * If peeled is non-NULL, write it as the entry's peeled value.2118 */2119static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,2120 unsigned char *peeled)2121{2122 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);2123 if (peeled)2124 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));2125}21262127/*2128 * An each_ref_entry_fn that writes the entry to a packed-refs file.2129 */2130static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)2131{2132 enum peel_status peel_status = peel_entry(entry, 0);21332134 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2135 error("internal error: %s is not a valid packed reference!",2136 entry->name);2137 write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2138 peel_status == PEEL_PEELED ?2139 entry->u.value.peeled.hash : NULL);2140 return 0;2141}21422143/*2144 * Lock the packed-refs file for writing. Flags is passed to2145 * hold_lock_file_for_update(). Return 0 on success. On errors, set2146 * errno appropriately and return a nonzero value.2147 */2148static int lock_packed_refs(struct files_ref_store *refs, int flags)2149{2150 static int timeout_configured = 0;2151 static int timeout_value = 1000;2152 struct packed_ref_cache *packed_ref_cache;21532154 assert_main_repository(&refs->base, "lock_packed_refs");21552156 if (!timeout_configured) {2157 git_config_get_int("core.packedrefstimeout", &timeout_value);2158 timeout_configured = 1;2159 }21602161 if (hold_lock_file_for_update_timeout(2162 &packlock, git_path("packed-refs"),2163 flags, timeout_value) < 0)2164 return -1;2165 /*2166 * Get the current packed-refs while holding the lock. If the2167 * packed-refs file has been modified since we last read it,2168 * this will automatically invalidate the cache and re-read2169 * the packed-refs file.2170 */2171 packed_ref_cache = get_packed_ref_cache(refs);2172 packed_ref_cache->lock = &packlock;2173 /* Increment the reference count to prevent it from being freed: */2174 acquire_packed_ref_cache(packed_ref_cache);2175 return 0;2176}21772178/*2179 * Write the current version of the packed refs cache from memory to2180 * disk. The packed-refs file must already be locked for writing (see2181 * lock_packed_refs()). Return zero on success. On errors, set errno2182 * and return a nonzero value2183 */2184static int commit_packed_refs(struct files_ref_store *refs)2185{2186 struct packed_ref_cache *packed_ref_cache =2187 get_packed_ref_cache(refs);2188 int error = 0;2189 int save_errno = 0;2190 FILE *out;21912192 assert_main_repository(&refs->base, "commit_packed_refs");21932194 if (!packed_ref_cache->lock)2195 die("internal error: packed-refs not locked");21962197 out = fdopen_lock_file(packed_ref_cache->lock, "w");2198 if (!out)2199 die_errno("unable to fdopen packed-refs descriptor");22002201 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);2202 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),2203 0, write_packed_entry_fn, out);22042205 if (commit_lock_file(packed_ref_cache->lock)) {2206 save_errno = errno;2207 error = -1;2208 }2209 packed_ref_cache->lock = NULL;2210 release_packed_ref_cache(packed_ref_cache);2211 errno = save_errno;2212 return error;2213}22142215/*2216 * Rollback the lockfile for the packed-refs file, and discard the2217 * in-memory packed reference cache. (The packed-refs file will be2218 * read anew if it is needed again after this function is called.)2219 */2220static void rollback_packed_refs(struct files_ref_store *refs)2221{2222 struct packed_ref_cache *packed_ref_cache =2223 get_packed_ref_cache(refs);22242225 assert_main_repository(&refs->base, "rollback_packed_refs");22262227 if (!packed_ref_cache->lock)2228 die("internal error: packed-refs not locked");2229 rollback_lock_file(packed_ref_cache->lock);2230 packed_ref_cache->lock = NULL;2231 release_packed_ref_cache(packed_ref_cache);2232 clear_packed_ref_cache(refs);2233}22342235struct ref_to_prune {2236 struct ref_to_prune *next;2237 unsigned char sha1[20];2238 char name[FLEX_ARRAY];2239};22402241struct pack_refs_cb_data {2242 unsigned int flags;2243 struct ref_dir *packed_refs;2244 struct ref_to_prune *ref_to_prune;2245};22462247/*2248 * An each_ref_entry_fn that is run over loose references only. If2249 * the loose reference can be packed, add an entry in the packed ref2250 * cache. If the reference should be pruned, also add it to2251 * ref_to_prune in the pack_refs_cb_data.2252 */2253static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)2254{2255 struct pack_refs_cb_data *cb = cb_data;2256 enum peel_status peel_status;2257 struct ref_entry *packed_entry;2258 int is_tag_ref = starts_with(entry->name, "refs/tags/");22592260 /* Do not pack per-worktree refs: */2261 if (ref_type(entry->name) != REF_TYPE_NORMAL)2262 return 0;22632264 /* ALWAYS pack tags */2265 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2266 return 0;22672268 /* Do not pack symbolic or broken refs: */2269 if ((entry->flag & REF_ISSYMREF) || !entry_resolves_to_object(entry))2270 return 0;22712272 /* Add a packed ref cache entry equivalent to the loose entry. */2273 peel_status = peel_entry(entry, 1);2274 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2275 die("internal error peeling reference %s (%s)",2276 entry->name, oid_to_hex(&entry->u.value.oid));2277 packed_entry = find_ref(cb->packed_refs, entry->name);2278 if (packed_entry) {2279 /* Overwrite existing packed entry with info from loose entry */2280 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2281 oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2282 } else {2283 packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,2284 REF_ISPACKED | REF_KNOWS_PEELED, 0);2285 add_ref(cb->packed_refs, packed_entry);2286 }2287 oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);22882289 /* Schedule the loose reference for pruning if requested. */2290 if ((cb->flags & PACK_REFS_PRUNE)) {2291 struct ref_to_prune *n;2292 FLEX_ALLOC_STR(n, name, entry->name);2293 hashcpy(n->sha1, entry->u.value.oid.hash);2294 n->next = cb->ref_to_prune;2295 cb->ref_to_prune = n;2296 }2297 return 0;2298}22992300/*2301 * Remove empty parents, but spare refs/ and immediate subdirs.2302 * Note: munges *name.2303 */2304static void try_remove_empty_parents(char *name)2305{2306 char *p, *q;2307 int i;2308 p = name;2309 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */2310 while (*p && *p != '/')2311 p++;2312 /* tolerate duplicate slashes; see check_refname_format() */2313 while (*p == '/')2314 p++;2315 }2316 for (q = p; *q; q++)2317 ;2318 while (1) {2319 while (q > p && *q != '/')2320 q--;2321 while (q > p && *(q-1) == '/')2322 q--;2323 if (q == p)2324 break;2325 *q = '\0';2326 if (rmdir(git_path("%s", name)))2327 break;2328 }2329}23302331/* make sure nobody touched the ref, and unlink */2332static void prune_ref(struct ref_to_prune *r)2333{2334 struct ref_transaction *transaction;2335 struct strbuf err = STRBUF_INIT;23362337 if (check_refname_format(r->name, 0))2338 return;23392340 transaction = ref_transaction_begin(&err);2341 if (!transaction ||2342 ref_transaction_delete(transaction, r->name, r->sha1,2343 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2344 ref_transaction_commit(transaction, &err)) {2345 ref_transaction_free(transaction);2346 error("%s", err.buf);2347 strbuf_release(&err);2348 return;2349 }2350 ref_transaction_free(transaction);2351 strbuf_release(&err);2352 try_remove_empty_parents(r->name);2353}23542355static void prune_refs(struct ref_to_prune *r)2356{2357 while (r) {2358 prune_ref(r);2359 r = r->next;2360 }2361}23622363static int files_pack_refs(struct ref_store *ref_store, unsigned int flags)2364{2365 struct files_ref_store *refs =2366 files_downcast(ref_store, 0, "pack_refs");2367 struct pack_refs_cb_data cbdata;23682369 memset(&cbdata, 0, sizeof(cbdata));2370 cbdata.flags = flags;23712372 lock_packed_refs(refs, LOCK_DIE_ON_ERROR);2373 cbdata.packed_refs = get_packed_refs(refs);23742375 do_for_each_entry_in_dir(get_loose_refs(refs), 0,2376 pack_if_possible_fn, &cbdata);23772378 if (commit_packed_refs(refs))2379 die_errno("unable to overwrite old ref-pack file");23802381 prune_refs(cbdata.ref_to_prune);2382 return 0;2383}23842385/*2386 * Rewrite the packed-refs file, omitting any refs listed in2387 * 'refnames'. On error, leave packed-refs unchanged, write an error2388 * message to 'err', and return a nonzero value.2389 *2390 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2391 */2392static int repack_without_refs(struct files_ref_store *refs,2393 struct string_list *refnames, struct strbuf *err)2394{2395 struct ref_dir *packed;2396 struct string_list_item *refname;2397 int ret, needs_repacking = 0, removed = 0;23982399 assert_main_repository(&refs->base, "repack_without_refs");2400 assert(err);24012402 /* Look for a packed ref */2403 for_each_string_list_item(refname, refnames) {2404 if (get_packed_ref(refs, refname->string)) {2405 needs_repacking = 1;2406 break;2407 }2408 }24092410 /* Avoid locking if we have nothing to do */2411 if (!needs_repacking)2412 return 0; /* no refname exists in packed refs */24132414 if (lock_packed_refs(refs, 0)) {2415 unable_to_lock_message(git_path("packed-refs"), errno, err);2416 return -1;2417 }2418 packed = get_packed_refs(refs);24192420 /* Remove refnames from the cache */2421 for_each_string_list_item(refname, refnames)2422 if (remove_entry(packed, refname->string) != -1)2423 removed = 1;2424 if (!removed) {2425 /*2426 * All packed entries disappeared while we were2427 * acquiring the lock.2428 */2429 rollback_packed_refs(refs);2430 return 0;2431 }24322433 /* Write what remains */2434 ret = commit_packed_refs(refs);2435 if (ret)2436 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",2437 strerror(errno));2438 return ret;2439}24402441static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)2442{2443 assert(err);24442445 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2446 /*2447 * loose. The loose file name is the same as the2448 * lockfile name, minus ".lock":2449 */2450 char *loose_filename = get_locked_file_path(lock->lk);2451 int res = unlink_or_msg(loose_filename, err);2452 free(loose_filename);2453 if (res)2454 return 1;2455 }2456 return 0;2457}24582459static int files_delete_refs(struct ref_store *ref_store,2460 struct string_list *refnames, unsigned int flags)2461{2462 struct files_ref_store *refs =2463 files_downcast(ref_store, 0, "delete_refs");2464 struct strbuf err = STRBUF_INIT;2465 int i, result = 0;24662467 if (!refnames->nr)2468 return 0;24692470 result = repack_without_refs(refs, refnames, &err);2471 if (result) {2472 /*2473 * If we failed to rewrite the packed-refs file, then2474 * it is unsafe to try to remove loose refs, because2475 * doing so might expose an obsolete packed value for2476 * a reference that might even point at an object that2477 * has been garbage collected.2478 */2479 if (refnames->nr == 1)2480 error(_("could not delete reference %s: %s"),2481 refnames->items[0].string, err.buf);2482 else2483 error(_("could not delete references: %s"), err.buf);24842485 goto out;2486 }24872488 for (i = 0; i < refnames->nr; i++) {2489 const char *refname = refnames->items[i].string;24902491 if (delete_ref(refname, NULL, flags))2492 result |= error(_("could not remove reference %s"), refname);2493 }24942495out:2496 strbuf_release(&err);2497 return result;2498}24992500/*2501 * People using contrib's git-new-workdir have .git/logs/refs ->2502 * /some/other/path/.git/logs/refs, and that may live on another device.2503 *2504 * IOW, to avoid cross device rename errors, the temporary renamed log must2505 * live into logs/refs.2506 */2507#define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"25082509static int rename_tmp_log(const char *newrefname)2510{2511 int attempts_remaining = 4;2512 struct strbuf path = STRBUF_INIT;2513 int ret = -1;25142515 retry:2516 strbuf_reset(&path);2517 strbuf_git_path(&path, "logs/%s", newrefname);2518 switch (safe_create_leading_directories_const(path.buf)) {2519 case SCLD_OK:2520 break; /* success */2521 case SCLD_VANISHED:2522 if (--attempts_remaining > 0)2523 goto retry;2524 /* fall through */2525 default:2526 error("unable to create directory for %s", newrefname);2527 goto out;2528 }25292530 if (rename(git_path(TMP_RENAMED_LOG), path.buf)) {2531 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {2532 /*2533 * rename(a, b) when b is an existing2534 * directory ought to result in ISDIR, but2535 * Solaris 5.8 gives ENOTDIR. Sheesh.2536 */2537 if (remove_empty_directories(&path)) {2538 error("Directory not empty: logs/%s", newrefname);2539 goto out;2540 }2541 goto retry;2542 } else if (errno == ENOENT && --attempts_remaining > 0) {2543 /*2544 * Maybe another process just deleted one of2545 * the directories in the path to newrefname.2546 * Try again from the beginning.2547 */2548 goto retry;2549 } else {2550 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",2551 newrefname, strerror(errno));2552 goto out;2553 }2554 }2555 ret = 0;2556out:2557 strbuf_release(&path);2558 return ret;2559}25602561static int files_verify_refname_available(struct ref_store *ref_store,2562 const char *newname,2563 const struct string_list *extras,2564 const struct string_list *skip,2565 struct strbuf *err)2566{2567 struct files_ref_store *refs =2568 files_downcast(ref_store, 1, "verify_refname_available");2569 struct ref_dir *packed_refs = get_packed_refs(refs);2570 struct ref_dir *loose_refs = get_loose_refs(refs);25712572 if (verify_refname_available_dir(newname, extras, skip,2573 packed_refs, err) ||2574 verify_refname_available_dir(newname, extras, skip,2575 loose_refs, err))2576 return -1;25772578 return 0;2579}25802581static int write_ref_to_lockfile(struct ref_lock *lock,2582 const unsigned char *sha1, struct strbuf *err);2583static int commit_ref_update(struct files_ref_store *refs,2584 struct ref_lock *lock,2585 const unsigned char *sha1, const char *logmsg,2586 struct strbuf *err);25872588static int files_rename_ref(struct ref_store *ref_store,2589 const char *oldrefname, const char *newrefname,2590 const char *logmsg)2591{2592 struct files_ref_store *refs =2593 files_downcast(ref_store, 0, "rename_ref");2594 unsigned char sha1[20], orig_sha1[20];2595 int flag = 0, logmoved = 0;2596 struct ref_lock *lock;2597 struct stat loginfo;2598 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2599 struct strbuf err = STRBUF_INIT;26002601 if (log && S_ISLNK(loginfo.st_mode))2602 return error("reflog for %s is a symlink", oldrefname);26032604 if (!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2605 orig_sha1, &flag))2606 return error("refname %s not found", oldrefname);26072608 if (flag & REF_ISSYMREF)2609 return error("refname %s is a symbolic ref, renaming it is not supported",2610 oldrefname);2611 if (!rename_ref_available(oldrefname, newrefname))2612 return 1;26132614 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))2615 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",2616 oldrefname, strerror(errno));26172618 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2619 error("unable to delete old %s", oldrefname);2620 goto rollback;2621 }26222623 /*2624 * Since we are doing a shallow lookup, sha1 is not the2625 * correct value to pass to delete_ref as old_sha1. But that2626 * doesn't matter, because an old_sha1 check wouldn't add to2627 * the safety anyway; we want to delete the reference whatever2628 * its current value.2629 */2630 if (!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2631 sha1, NULL) &&2632 delete_ref(newrefname, NULL, REF_NODEREF)) {2633 if (errno == EISDIR) {2634 struct strbuf path = STRBUF_INIT;2635 int result;26362637 strbuf_git_path(&path, "%s", newrefname);2638 result = remove_empty_directories(&path);2639 strbuf_release(&path);26402641 if (result) {2642 error("Directory not empty: %s", newrefname);2643 goto rollback;2644 }2645 } else {2646 error("unable to delete existing %s", newrefname);2647 goto rollback;2648 }2649 }26502651 if (log && rename_tmp_log(newrefname))2652 goto rollback;26532654 logmoved = log;26552656 lock = lock_ref_sha1_basic(refs, newrefname, NULL, NULL, NULL,2657 REF_NODEREF, NULL, &err);2658 if (!lock) {2659 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);2660 strbuf_release(&err);2661 goto rollback;2662 }2663 hashcpy(lock->old_oid.hash, orig_sha1);26642665 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||2666 commit_ref_update(refs, lock, orig_sha1, logmsg, &err)) {2667 error("unable to write current sha1 into %s: %s", newrefname, err.buf);2668 strbuf_release(&err);2669 goto rollback;2670 }26712672 return 0;26732674 rollback:2675 lock = lock_ref_sha1_basic(refs, oldrefname, NULL, NULL, NULL,2676 REF_NODEREF, NULL, &err);2677 if (!lock) {2678 error("unable to lock %s for rollback: %s", oldrefname, err.buf);2679 strbuf_release(&err);2680 goto rollbacklog;2681 }26822683 flag = log_all_ref_updates;2684 log_all_ref_updates = 0;2685 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||2686 commit_ref_update(refs, lock, orig_sha1, NULL, &err)) {2687 error("unable to write current sha1 into %s: %s", oldrefname, err.buf);2688 strbuf_release(&err);2689 }2690 log_all_ref_updates = flag;26912692 rollbacklog:2693 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))2694 error("unable to restore logfile %s from %s: %s",2695 oldrefname, newrefname, strerror(errno));2696 if (!logmoved && log &&2697 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))2698 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",2699 oldrefname, strerror(errno));27002701 return 1;2702}27032704static int close_ref(struct ref_lock *lock)2705{2706 if (close_lock_file(lock->lk))2707 return -1;2708 return 0;2709}27102711static int commit_ref(struct ref_lock *lock)2712{2713 char *path = get_locked_file_path(lock->lk);2714 struct stat st;27152716 if (!lstat(path, &st) && S_ISDIR(st.st_mode)) {2717 /*2718 * There is a directory at the path we want to rename2719 * the lockfile to. Hopefully it is empty; try to2720 * delete it.2721 */2722 size_t len = strlen(path);2723 struct strbuf sb_path = STRBUF_INIT;27242725 strbuf_attach(&sb_path, path, len, len);27262727 /*2728 * If this fails, commit_lock_file() will also fail2729 * and will report the problem.2730 */2731 remove_empty_directories(&sb_path);2732 strbuf_release(&sb_path);2733 } else {2734 free(path);2735 }27362737 if (commit_lock_file(lock->lk))2738 return -1;2739 return 0;2740}27412742/*2743 * Create a reflog for a ref. If force_create = 0, the reflog will2744 * only be created for certain refs (those for which2745 * should_autocreate_reflog returns non-zero. Otherwise, create it2746 * regardless of the ref name. Fill in *err and return -1 on failure.2747 */2748static int log_ref_setup(const char *refname, struct strbuf *logfile, struct strbuf *err, int force_create)2749{2750 int logfd, oflags = O_APPEND | O_WRONLY;27512752 strbuf_git_path(logfile, "logs/%s", refname);2753 if (force_create || should_autocreate_reflog(refname)) {2754 if (safe_create_leading_directories(logfile->buf) < 0) {2755 strbuf_addf(err, "unable to create directory for '%s': "2756 "%s", logfile->buf, strerror(errno));2757 return -1;2758 }2759 oflags |= O_CREAT;2760 }27612762 logfd = open(logfile->buf, oflags, 0666);2763 if (logfd < 0) {2764 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2765 return 0;27662767 if (errno == EISDIR) {2768 if (remove_empty_directories(logfile)) {2769 strbuf_addf(err, "there are still logs under "2770 "'%s'", logfile->buf);2771 return -1;2772 }2773 logfd = open(logfile->buf, oflags, 0666);2774 }27752776 if (logfd < 0) {2777 strbuf_addf(err, "unable to append to '%s': %s",2778 logfile->buf, strerror(errno));2779 return -1;2780 }2781 }27822783 adjust_shared_perm(logfile->buf);2784 close(logfd);2785 return 0;2786}278727882789static int files_create_reflog(struct ref_store *ref_store,2790 const char *refname, int force_create,2791 struct strbuf *err)2792{2793 int ret;2794 struct strbuf sb = STRBUF_INIT;27952796 /* Check validity (but we don't need the result): */2797 files_downcast(ref_store, 0, "create_reflog");27982799 ret = log_ref_setup(refname, &sb, err, force_create);2800 strbuf_release(&sb);2801 return ret;2802}28032804static int log_ref_write_fd(int fd, const unsigned char *old_sha1,2805 const unsigned char *new_sha1,2806 const char *committer, const char *msg)2807{2808 int msglen, written;2809 unsigned maxlen, len;2810 char *logrec;28112812 msglen = msg ? strlen(msg) : 0;2813 maxlen = strlen(committer) + msglen + 100;2814 logrec = xmalloc(maxlen);2815 len = xsnprintf(logrec, maxlen, "%s %s %s\n",2816 sha1_to_hex(old_sha1),2817 sha1_to_hex(new_sha1),2818 committer);2819 if (msglen)2820 len += copy_reflog_msg(logrec + len - 1, msg) - 1;28212822 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;2823 free(logrec);2824 if (written != len)2825 return -1;28262827 return 0;2828}28292830static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,2831 const unsigned char *new_sha1, const char *msg,2832 struct strbuf *logfile, int flags,2833 struct strbuf *err)2834{2835 int logfd, result, oflags = O_APPEND | O_WRONLY;28362837 if (log_all_ref_updates < 0)2838 log_all_ref_updates = !is_bare_repository();28392840 result = log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);28412842 if (result)2843 return result;28442845 logfd = open(logfile->buf, oflags);2846 if (logfd < 0)2847 return 0;2848 result = log_ref_write_fd(logfd, old_sha1, new_sha1,2849 git_committer_info(0), msg);2850 if (result) {2851 strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,2852 strerror(errno));2853 close(logfd);2854 return -1;2855 }2856 if (close(logfd)) {2857 strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,2858 strerror(errno));2859 return -1;2860 }2861 return 0;2862}28632864static int log_ref_write(const char *refname, const unsigned char *old_sha1,2865 const unsigned char *new_sha1, const char *msg,2866 int flags, struct strbuf *err)2867{2868 return files_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2869 err);2870}28712872int files_log_ref_write(const char *refname, const unsigned char *old_sha1,2873 const unsigned char *new_sha1, const char *msg,2874 int flags, struct strbuf *err)2875{2876 struct strbuf sb = STRBUF_INIT;2877 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2878 err);2879 strbuf_release(&sb);2880 return ret;2881}28822883/*2884 * Write sha1 into the open lockfile, then close the lockfile. On2885 * errors, rollback the lockfile, fill in *err and2886 * return -1.2887 */2888static int write_ref_to_lockfile(struct ref_lock *lock,2889 const unsigned char *sha1, struct strbuf *err)2890{2891 static char term = '\n';2892 struct object *o;2893 int fd;28942895 o = parse_object(sha1);2896 if (!o) {2897 strbuf_addf(err,2898 "trying to write ref '%s' with nonexistent object %s",2899 lock->ref_name, sha1_to_hex(sha1));2900 unlock_ref(lock);2901 return -1;2902 }2903 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {2904 strbuf_addf(err,2905 "trying to write non-commit object %s to branch '%s'",2906 sha1_to_hex(sha1), lock->ref_name);2907 unlock_ref(lock);2908 return -1;2909 }2910 fd = get_lock_file_fd(lock->lk);2911 if (write_in_full(fd, sha1_to_hex(sha1), 40) != 40 ||2912 write_in_full(fd, &term, 1) != 1 ||2913 close_ref(lock) < 0) {2914 strbuf_addf(err,2915 "couldn't write '%s'", get_lock_file_path(lock->lk));2916 unlock_ref(lock);2917 return -1;2918 }2919 return 0;2920}29212922/*2923 * Commit a change to a loose reference that has already been written2924 * to the loose reference lockfile. Also update the reflogs if2925 * necessary, using the specified lockmsg (which can be NULL).2926 */2927static int commit_ref_update(struct files_ref_store *refs,2928 struct ref_lock *lock,2929 const unsigned char *sha1, const char *logmsg,2930 struct strbuf *err)2931{2932 assert_main_repository(&refs->base, "commit_ref_update");29332934 clear_loose_ref_cache(refs);2935 if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, 0, err)) {2936 char *old_msg = strbuf_detach(err, NULL);2937 strbuf_addf(err, "cannot update the ref '%s': %s",2938 lock->ref_name, old_msg);2939 free(old_msg);2940 unlock_ref(lock);2941 return -1;2942 }29432944 if (strcmp(lock->ref_name, "HEAD") != 0) {2945 /*2946 * Special hack: If a branch is updated directly and HEAD2947 * points to it (may happen on the remote side of a push2948 * for example) then logically the HEAD reflog should be2949 * updated too.2950 * A generic solution implies reverse symref information,2951 * but finding all symrefs pointing to the given branch2952 * would be rather costly for this rare event (the direct2953 * update of a branch) to be worth it. So let's cheat and2954 * check with HEAD only which should cover 99% of all usage2955 * scenarios (even 100% of the default ones).2956 */2957 unsigned char head_sha1[20];2958 int head_flag;2959 const char *head_ref;29602961 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,2962 head_sha1, &head_flag);2963 if (head_ref && (head_flag & REF_ISSYMREF) &&2964 !strcmp(head_ref, lock->ref_name)) {2965 struct strbuf log_err = STRBUF_INIT;2966 if (log_ref_write("HEAD", lock->old_oid.hash, sha1,2967 logmsg, 0, &log_err)) {2968 error("%s", log_err.buf);2969 strbuf_release(&log_err);2970 }2971 }2972 }29732974 if (commit_ref(lock)) {2975 strbuf_addf(err, "couldn't set '%s'", lock->ref_name);2976 unlock_ref(lock);2977 return -1;2978 }29792980 unlock_ref(lock);2981 return 0;2982}29832984static int create_ref_symlink(struct ref_lock *lock, const char *target)2985{2986 int ret = -1;2987#ifndef NO_SYMLINK_HEAD2988 char *ref_path = get_locked_file_path(lock->lk);2989 unlink(ref_path);2990 ret = symlink(target, ref_path);2991 free(ref_path);29922993 if (ret)2994 fprintf(stderr, "no symlink - falling back to symbolic ref\n");2995#endif2996 return ret;2997}29982999static void update_symref_reflog(struct ref_lock *lock, const char *refname,3000 const char *target, const char *logmsg)3001{3002 struct strbuf err = STRBUF_INIT;3003 unsigned char new_sha1[20];3004 if (logmsg && !read_ref(target, new_sha1) &&3005 log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg, 0, &err)) {3006 error("%s", err.buf);3007 strbuf_release(&err);3008 }3009}30103011static int create_symref_locked(struct ref_lock *lock, const char *refname,3012 const char *target, const char *logmsg)3013{3014 if (prefer_symlink_refs && !create_ref_symlink(lock, target)) {3015 update_symref_reflog(lock, refname, target, logmsg);3016 return 0;3017 }30183019 if (!fdopen_lock_file(lock->lk, "w"))3020 return error("unable to fdopen %s: %s",3021 lock->lk->tempfile.filename.buf, strerror(errno));30223023 update_symref_reflog(lock, refname, target, logmsg);30243025 /* no error check; commit_ref will check ferror */3026 fprintf(lock->lk->tempfile.fp, "ref: %s\n", target);3027 if (commit_ref(lock) < 0)3028 return error("unable to write symref for %s: %s", refname,3029 strerror(errno));3030 return 0;3031}30323033static int files_create_symref(struct ref_store *ref_store,3034 const char *refname, const char *target,3035 const char *logmsg)3036{3037 struct files_ref_store *refs =3038 files_downcast(ref_store, 0, "create_symref");3039 struct strbuf err = STRBUF_INIT;3040 struct ref_lock *lock;3041 int ret;30423043 lock = lock_ref_sha1_basic(refs, refname, NULL,3044 NULL, NULL, REF_NODEREF, NULL,3045 &err);3046 if (!lock) {3047 error("%s", err.buf);3048 strbuf_release(&err);3049 return -1;3050 }30513052 ret = create_symref_locked(lock, refname, target, logmsg);3053 unlock_ref(lock);3054 return ret;3055}30563057int set_worktree_head_symref(const char *gitdir, const char *target)3058{3059 static struct lock_file head_lock;3060 struct ref_lock *lock;3061 struct strbuf head_path = STRBUF_INIT;3062 const char *head_rel;3063 int ret;30643065 strbuf_addf(&head_path, "%s/HEAD", absolute_path(gitdir));3066 if (hold_lock_file_for_update(&head_lock, head_path.buf,3067 LOCK_NO_DEREF) < 0) {3068 struct strbuf err = STRBUF_INIT;3069 unable_to_lock_message(head_path.buf, errno, &err);3070 error("%s", err.buf);3071 strbuf_release(&err);3072 strbuf_release(&head_path);3073 return -1;3074 }30753076 /* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3077 linked trees */3078 head_rel = remove_leading_path(head_path.buf,3079 absolute_path(get_git_common_dir()));3080 /* to make use of create_symref_locked(), initialize ref_lock */3081 lock = xcalloc(1, sizeof(struct ref_lock));3082 lock->lk = &head_lock;3083 lock->ref_name = xstrdup(head_rel);30843085 ret = create_symref_locked(lock, head_rel, target, NULL);30863087 unlock_ref(lock); /* will free lock */3088 strbuf_release(&head_path);3089 return ret;3090}30913092static int files_reflog_exists(struct ref_store *ref_store,3093 const char *refname)3094{3095 struct stat st;30963097 /* Check validity (but we don't need the result): */3098 files_downcast(ref_store, 0, "reflog_exists");30993100 return !lstat(git_path("logs/%s", refname), &st) &&3101 S_ISREG(st.st_mode);3102}31033104static int files_delete_reflog(struct ref_store *ref_store,3105 const char *refname)3106{3107 /* Check validity (but we don't need the result): */3108 files_downcast(ref_store, 0, "delete_reflog");31093110 return remove_path(git_path("logs/%s", refname));3111}31123113static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)3114{3115 unsigned char osha1[20], nsha1[20];3116 char *email_end, *message;3117 unsigned long timestamp;3118 int tz;31193120 /* old SP new SP name <email> SP time TAB msg LF */3121 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||3122 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||3123 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||3124 !(email_end = strchr(sb->buf + 82, '>')) ||3125 email_end[1] != ' ' ||3126 !(timestamp = strtoul(email_end + 2, &message, 10)) ||3127 !message || message[0] != ' ' ||3128 (message[1] != '+' && message[1] != '-') ||3129 !isdigit(message[2]) || !isdigit(message[3]) ||3130 !isdigit(message[4]) || !isdigit(message[5]))3131 return 0; /* corrupt? */3132 email_end[1] = '\0';3133 tz = strtol(message + 1, NULL, 10);3134 if (message[6] != '\t')3135 message += 6;3136 else3137 message += 7;3138 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);3139}31403141static char *find_beginning_of_line(char *bob, char *scan)3142{3143 while (bob < scan && *(--scan) != '\n')3144 ; /* keep scanning backwards */3145 /*3146 * Return either beginning of the buffer, or LF at the end of3147 * the previous line.3148 */3149 return scan;3150}31513152static int files_for_each_reflog_ent_reverse(struct ref_store *ref_store,3153 const char *refname,3154 each_reflog_ent_fn fn,3155 void *cb_data)3156{3157 struct strbuf sb = STRBUF_INIT;3158 FILE *logfp;3159 long pos;3160 int ret = 0, at_tail = 1;31613162 /* Check validity (but we don't need the result): */3163 files_downcast(ref_store, 0, "for_each_reflog_ent_reverse");31643165 logfp = fopen(git_path("logs/%s", refname), "r");3166 if (!logfp)3167 return -1;31683169 /* Jump to the end */3170 if (fseek(logfp, 0, SEEK_END) < 0)3171 return error("cannot seek back reflog for %s: %s",3172 refname, strerror(errno));3173 pos = ftell(logfp);3174 while (!ret && 0 < pos) {3175 int cnt;3176 size_t nread;3177 char buf[BUFSIZ];3178 char *endp, *scanp;31793180 /* Fill next block from the end */3181 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;3182 if (fseek(logfp, pos - cnt, SEEK_SET))3183 return error("cannot seek back reflog for %s: %s",3184 refname, strerror(errno));3185 nread = fread(buf, cnt, 1, logfp);3186 if (nread != 1)3187 return error("cannot read %d bytes from reflog for %s: %s",3188 cnt, refname, strerror(errno));3189 pos -= cnt;31903191 scanp = endp = buf + cnt;3192 if (at_tail && scanp[-1] == '\n')3193 /* Looking at the final LF at the end of the file */3194 scanp--;3195 at_tail = 0;31963197 while (buf < scanp) {3198 /*3199 * terminating LF of the previous line, or the beginning3200 * of the buffer.3201 */3202 char *bp;32033204 bp = find_beginning_of_line(buf, scanp);32053206 if (*bp == '\n') {3207 /*3208 * The newline is the end of the previous line,3209 * so we know we have complete line starting3210 * at (bp + 1). Prefix it onto any prior data3211 * we collected for the line and process it.3212 */3213 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));3214 scanp = bp;3215 endp = bp + 1;3216 ret = show_one_reflog_ent(&sb, fn, cb_data);3217 strbuf_reset(&sb);3218 if (ret)3219 break;3220 } else if (!pos) {3221 /*3222 * We are at the start of the buffer, and the3223 * start of the file; there is no previous3224 * line, and we have everything for this one.3225 * Process it, and we can end the loop.3226 */3227 strbuf_splice(&sb, 0, 0, buf, endp - buf);3228 ret = show_one_reflog_ent(&sb, fn, cb_data);3229 strbuf_reset(&sb);3230 break;3231 }32323233 if (bp == buf) {3234 /*3235 * We are at the start of the buffer, and there3236 * is more file to read backwards. Which means3237 * we are in the middle of a line. Note that we3238 * may get here even if *bp was a newline; that3239 * just means we are at the exact end of the3240 * previous line, rather than some spot in the3241 * middle.3242 *3243 * Save away what we have to be combined with3244 * the data from the next read.3245 */3246 strbuf_splice(&sb, 0, 0, buf, endp - buf);3247 break;3248 }3249 }32503251 }3252 if (!ret && sb.len)3253 die("BUG: reverse reflog parser had leftover data");32543255 fclose(logfp);3256 strbuf_release(&sb);3257 return ret;3258}32593260static int files_for_each_reflog_ent(struct ref_store *ref_store,3261 const char *refname,3262 each_reflog_ent_fn fn, void *cb_data)3263{3264 FILE *logfp;3265 struct strbuf sb = STRBUF_INIT;3266 int ret = 0;32673268 /* Check validity (but we don't need the result): */3269 files_downcast(ref_store, 0, "for_each_reflog_ent");32703271 logfp = fopen(git_path("logs/%s", refname), "r");3272 if (!logfp)3273 return -1;32743275 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))3276 ret = show_one_reflog_ent(&sb, fn, cb_data);3277 fclose(logfp);3278 strbuf_release(&sb);3279 return ret;3280}32813282struct files_reflog_iterator {3283 struct ref_iterator base;32843285 struct dir_iterator *dir_iterator;3286 struct object_id oid;3287};32883289static int files_reflog_iterator_advance(struct ref_iterator *ref_iterator)3290{3291 struct files_reflog_iterator *iter =3292 (struct files_reflog_iterator *)ref_iterator;3293 struct dir_iterator *diter = iter->dir_iterator;3294 int ok;32953296 while ((ok = dir_iterator_advance(diter)) == ITER_OK) {3297 int flags;32983299 if (!S_ISREG(diter->st.st_mode))3300 continue;3301 if (diter->basename[0] == '.')3302 continue;3303 if (ends_with(diter->basename, ".lock"))3304 continue;33053306 if (read_ref_full(diter->relative_path, 0,3307 iter->oid.hash, &flags)) {3308 error("bad ref for %s", diter->path.buf);3309 continue;3310 }33113312 iter->base.refname = diter->relative_path;3313 iter->base.oid = &iter->oid;3314 iter->base.flags = flags;3315 return ITER_OK;3316 }33173318 iter->dir_iterator = NULL;3319 if (ref_iterator_abort(ref_iterator) == ITER_ERROR)3320 ok = ITER_ERROR;3321 return ok;3322}33233324static int files_reflog_iterator_peel(struct ref_iterator *ref_iterator,3325 struct object_id *peeled)3326{3327 die("BUG: ref_iterator_peel() called for reflog_iterator");3328}33293330static int files_reflog_iterator_abort(struct ref_iterator *ref_iterator)3331{3332 struct files_reflog_iterator *iter =3333 (struct files_reflog_iterator *)ref_iterator;3334 int ok = ITER_DONE;33353336 if (iter->dir_iterator)3337 ok = dir_iterator_abort(iter->dir_iterator);33383339 base_ref_iterator_free(ref_iterator);3340 return ok;3341}33423343static struct ref_iterator_vtable files_reflog_iterator_vtable = {3344 files_reflog_iterator_advance,3345 files_reflog_iterator_peel,3346 files_reflog_iterator_abort3347};33483349static struct ref_iterator *files_reflog_iterator_begin(struct ref_store *ref_store)3350{3351 struct files_reflog_iterator *iter = xcalloc(1, sizeof(*iter));3352 struct ref_iterator *ref_iterator = &iter->base;33533354 /* Check validity (but we don't need the result): */3355 files_downcast(ref_store, 0, "reflog_iterator_begin");33563357 base_ref_iterator_init(ref_iterator, &files_reflog_iterator_vtable);3358 iter->dir_iterator = dir_iterator_begin(git_path("logs"));3359 return ref_iterator;3360}33613362static int ref_update_reject_duplicates(struct string_list *refnames,3363 struct strbuf *err)3364{3365 int i, n = refnames->nr;33663367 assert(err);33683369 for (i = 1; i < n; i++)3370 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {3371 strbuf_addf(err,3372 "multiple updates for ref '%s' not allowed.",3373 refnames->items[i].string);3374 return 1;3375 }3376 return 0;3377}33783379/*3380 * If update is a direct update of head_ref (the reference pointed to3381 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3382 */3383static int split_head_update(struct ref_update *update,3384 struct ref_transaction *transaction,3385 const char *head_ref,3386 struct string_list *affected_refnames,3387 struct strbuf *err)3388{3389 struct string_list_item *item;3390 struct ref_update *new_update;33913392 if ((update->flags & REF_LOG_ONLY) ||3393 (update->flags & REF_ISPRUNING) ||3394 (update->flags & REF_UPDATE_VIA_HEAD))3395 return 0;33963397 if (strcmp(update->refname, head_ref))3398 return 0;33993400 /*3401 * First make sure that HEAD is not already in the3402 * transaction. This insertion is O(N) in the transaction3403 * size, but it happens at most once per transaction.3404 */3405 item = string_list_insert(affected_refnames, "HEAD");3406 if (item->util) {3407 /* An entry already existed */3408 strbuf_addf(err,3409 "multiple updates for 'HEAD' (including one "3410 "via its referent '%s') are not allowed",3411 update->refname);3412 return TRANSACTION_NAME_CONFLICT;3413 }34143415 new_update = ref_transaction_add_update(3416 transaction, "HEAD",3417 update->flags | REF_LOG_ONLY | REF_NODEREF,3418 update->new_sha1, update->old_sha1,3419 update->msg);34203421 item->util = new_update;34223423 return 0;3424}34253426/*3427 * update is for a symref that points at referent and doesn't have3428 * REF_NODEREF set. Split it into two updates:3429 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3430 * - A new, separate update for the referent reference3431 * Note that the new update will itself be subject to splitting when3432 * the iteration gets to it.3433 */3434static int split_symref_update(struct files_ref_store *refs,3435 struct ref_update *update,3436 const char *referent,3437 struct ref_transaction *transaction,3438 struct string_list *affected_refnames,3439 struct strbuf *err)3440{3441 struct string_list_item *item;3442 struct ref_update *new_update;3443 unsigned int new_flags;34443445 /*3446 * First make sure that referent is not already in the3447 * transaction. This insertion is O(N) in the transaction3448 * size, but it happens at most once per symref in a3449 * transaction.3450 */3451 item = string_list_insert(affected_refnames, referent);3452 if (item->util) {3453 /* An entry already existed */3454 strbuf_addf(err,3455 "multiple updates for '%s' (including one "3456 "via symref '%s') are not allowed",3457 referent, update->refname);3458 return TRANSACTION_NAME_CONFLICT;3459 }34603461 new_flags = update->flags;3462 if (!strcmp(update->refname, "HEAD")) {3463 /*3464 * Record that the new update came via HEAD, so that3465 * when we process it, split_head_update() doesn't try3466 * to add another reflog update for HEAD. Note that3467 * this bit will be propagated if the new_update3468 * itself needs to be split.3469 */3470 new_flags |= REF_UPDATE_VIA_HEAD;3471 }34723473 new_update = ref_transaction_add_update(3474 transaction, referent, new_flags,3475 update->new_sha1, update->old_sha1,3476 update->msg);34773478 new_update->parent_update = update;34793480 /*3481 * Change the symbolic ref update to log only. Also, it3482 * doesn't need to check its old SHA-1 value, as that will be3483 * done when new_update is processed.3484 */3485 update->flags |= REF_LOG_ONLY | REF_NODEREF;3486 update->flags &= ~REF_HAVE_OLD;34873488 item->util = new_update;34893490 return 0;3491}34923493/*3494 * Return the refname under which update was originally requested.3495 */3496static const char *original_update_refname(struct ref_update *update)3497{3498 while (update->parent_update)3499 update = update->parent_update;35003501 return update->refname;3502}35033504/*3505 * Check whether the REF_HAVE_OLD and old_oid values stored in update3506 * are consistent with oid, which is the reference's current value. If3507 * everything is OK, return 0; otherwise, write an error message to3508 * err and return -1.3509 */3510static int check_old_oid(struct ref_update *update, struct object_id *oid,3511 struct strbuf *err)3512{3513 if (!(update->flags & REF_HAVE_OLD) ||3514 !hashcmp(oid->hash, update->old_sha1))3515 return 0;35163517 if (is_null_sha1(update->old_sha1))3518 strbuf_addf(err, "cannot lock ref '%s': "3519 "reference already exists",3520 original_update_refname(update));3521 else if (is_null_oid(oid))3522 strbuf_addf(err, "cannot lock ref '%s': "3523 "reference is missing but expected %s",3524 original_update_refname(update),3525 sha1_to_hex(update->old_sha1));3526 else3527 strbuf_addf(err, "cannot lock ref '%s': "3528 "is at %s but expected %s",3529 original_update_refname(update),3530 oid_to_hex(oid),3531 sha1_to_hex(update->old_sha1));35323533 return -1;3534}35353536/*3537 * Prepare for carrying out update:3538 * - Lock the reference referred to by update.3539 * - Read the reference under lock.3540 * - Check that its old SHA-1 value (if specified) is correct, and in3541 * any case record it in update->lock->old_oid for later use when3542 * writing the reflog.3543 * - If it is a symref update without REF_NODEREF, split it up into a3544 * REF_LOG_ONLY update of the symref and add a separate update for3545 * the referent to transaction.3546 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3547 * update of HEAD.3548 */3549static int lock_ref_for_update(struct files_ref_store *refs,3550 struct ref_update *update,3551 struct ref_transaction *transaction,3552 const char *head_ref,3553 struct string_list *affected_refnames,3554 struct strbuf *err)3555{3556 struct strbuf referent = STRBUF_INIT;3557 int mustexist = (update->flags & REF_HAVE_OLD) &&3558 !is_null_sha1(update->old_sha1);3559 int ret;3560 struct ref_lock *lock;35613562 assert_main_repository(&refs->base, "lock_ref_for_update");35633564 if ((update->flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1))3565 update->flags |= REF_DELETING;35663567 if (head_ref) {3568 ret = split_head_update(update, transaction, head_ref,3569 affected_refnames, err);3570 if (ret)3571 return ret;3572 }35733574 ret = lock_raw_ref(refs, update->refname, mustexist,3575 affected_refnames, NULL,3576 &lock, &referent,3577 &update->type, err);3578 if (ret) {3579 char *reason;35803581 reason = strbuf_detach(err, NULL);3582 strbuf_addf(err, "cannot lock ref '%s': %s",3583 original_update_refname(update), reason);3584 free(reason);3585 return ret;3586 }35873588 update->backend_data = lock;35893590 if (update->type & REF_ISSYMREF) {3591 if (update->flags & REF_NODEREF) {3592 /*3593 * We won't be reading the referent as part of3594 * the transaction, so we have to read it here3595 * to record and possibly check old_sha1:3596 */3597 if (read_ref_full(referent.buf, 0,3598 lock->old_oid.hash, NULL)) {3599 if (update->flags & REF_HAVE_OLD) {3600 strbuf_addf(err, "cannot lock ref '%s': "3601 "error reading reference",3602 original_update_refname(update));3603 return -1;3604 }3605 } else if (check_old_oid(update, &lock->old_oid, err)) {3606 return TRANSACTION_GENERIC_ERROR;3607 }3608 } else {3609 /*3610 * Create a new update for the reference this3611 * symref is pointing at. Also, we will record3612 * and verify old_sha1 for this update as part3613 * of processing the split-off update, so we3614 * don't have to do it here.3615 */3616 ret = split_symref_update(refs, update,3617 referent.buf, transaction,3618 affected_refnames, err);3619 if (ret)3620 return ret;3621 }3622 } else {3623 struct ref_update *parent_update;36243625 if (check_old_oid(update, &lock->old_oid, err))3626 return TRANSACTION_GENERIC_ERROR;36273628 /*3629 * If this update is happening indirectly because of a3630 * symref update, record the old SHA-1 in the parent3631 * update:3632 */3633 for (parent_update = update->parent_update;3634 parent_update;3635 parent_update = parent_update->parent_update) {3636 struct ref_lock *parent_lock = parent_update->backend_data;3637 oidcpy(&parent_lock->old_oid, &lock->old_oid);3638 }3639 }36403641 if ((update->flags & REF_HAVE_NEW) &&3642 !(update->flags & REF_DELETING) &&3643 !(update->flags & REF_LOG_ONLY)) {3644 if (!(update->type & REF_ISSYMREF) &&3645 !hashcmp(lock->old_oid.hash, update->new_sha1)) {3646 /*3647 * The reference already has the desired3648 * value, so we don't need to write it.3649 */3650 } else if (write_ref_to_lockfile(lock, update->new_sha1,3651 err)) {3652 char *write_err = strbuf_detach(err, NULL);36533654 /*3655 * The lock was freed upon failure of3656 * write_ref_to_lockfile():3657 */3658 update->backend_data = NULL;3659 strbuf_addf(err,3660 "cannot update ref '%s': %s",3661 update->refname, write_err);3662 free(write_err);3663 return TRANSACTION_GENERIC_ERROR;3664 } else {3665 update->flags |= REF_NEEDS_COMMIT;3666 }3667 }3668 if (!(update->flags & REF_NEEDS_COMMIT)) {3669 /*3670 * We didn't call write_ref_to_lockfile(), so3671 * the lockfile is still open. Close it to3672 * free up the file descriptor:3673 */3674 if (close_ref(lock)) {3675 strbuf_addf(err, "couldn't close '%s.lock'",3676 update->refname);3677 return TRANSACTION_GENERIC_ERROR;3678 }3679 }3680 return 0;3681}36823683static int files_transaction_commit(struct ref_store *ref_store,3684 struct ref_transaction *transaction,3685 struct strbuf *err)3686{3687 struct files_ref_store *refs =3688 files_downcast(ref_store, 0, "ref_transaction_commit");3689 int ret = 0, i;3690 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3691 struct string_list_item *ref_to_delete;3692 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3693 char *head_ref = NULL;3694 int head_type;3695 struct object_id head_oid;36963697 assert(err);36983699 if (transaction->state != REF_TRANSACTION_OPEN)3700 die("BUG: commit called for transaction that is not open");37013702 if (!transaction->nr) {3703 transaction->state = REF_TRANSACTION_CLOSED;3704 return 0;3705 }37063707 /*3708 * Fail if a refname appears more than once in the3709 * transaction. (If we end up splitting up any updates using3710 * split_symref_update() or split_head_update(), those3711 * functions will check that the new updates don't have the3712 * same refname as any existing ones.)3713 */3714 for (i = 0; i < transaction->nr; i++) {3715 struct ref_update *update = transaction->updates[i];3716 struct string_list_item *item =3717 string_list_append(&affected_refnames, update->refname);37183719 /*3720 * We store a pointer to update in item->util, but at3721 * the moment we never use the value of this field3722 * except to check whether it is non-NULL.3723 */3724 item->util = update;3725 }3726 string_list_sort(&affected_refnames);3727 if (ref_update_reject_duplicates(&affected_refnames, err)) {3728 ret = TRANSACTION_GENERIC_ERROR;3729 goto cleanup;3730 }37313732 /*3733 * Special hack: If a branch is updated directly and HEAD3734 * points to it (may happen on the remote side of a push3735 * for example) then logically the HEAD reflog should be3736 * updated too.3737 *3738 * A generic solution would require reverse symref lookups,3739 * but finding all symrefs pointing to a given branch would be3740 * rather costly for this rare event (the direct update of a3741 * branch) to be worth it. So let's cheat and check with HEAD3742 * only, which should cover 99% of all usage scenarios (even3743 * 100% of the default ones).3744 *3745 * So if HEAD is a symbolic reference, then record the name of3746 * the reference that it points to. If we see an update of3747 * head_ref within the transaction, then split_head_update()3748 * arranges for the reflog of HEAD to be updated, too.3749 */3750 head_ref = resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3751 head_oid.hash, &head_type);37523753 if (head_ref && !(head_type & REF_ISSYMREF)) {3754 free(head_ref);3755 head_ref = NULL;3756 }37573758 /*3759 * Acquire all locks, verify old values if provided, check3760 * that new values are valid, and write new values to the3761 * lockfiles, ready to be activated. Only keep one lockfile3762 * open at a time to avoid running out of file descriptors.3763 */3764 for (i = 0; i < transaction->nr; i++) {3765 struct ref_update *update = transaction->updates[i];37663767 ret = lock_ref_for_update(refs, update, transaction,3768 head_ref, &affected_refnames, err);3769 if (ret)3770 goto cleanup;3771 }37723773 /* Perform updates first so live commits remain referenced */3774 for (i = 0; i < transaction->nr; i++) {3775 struct ref_update *update = transaction->updates[i];3776 struct ref_lock *lock = update->backend_data;37773778 if (update->flags & REF_NEEDS_COMMIT ||3779 update->flags & REF_LOG_ONLY) {3780 if (log_ref_write(lock->ref_name, lock->old_oid.hash,3781 update->new_sha1,3782 update->msg, update->flags, err)) {3783 char *old_msg = strbuf_detach(err, NULL);37843785 strbuf_addf(err, "cannot update the ref '%s': %s",3786 lock->ref_name, old_msg);3787 free(old_msg);3788 unlock_ref(lock);3789 update->backend_data = NULL;3790 ret = TRANSACTION_GENERIC_ERROR;3791 goto cleanup;3792 }3793 }3794 if (update->flags & REF_NEEDS_COMMIT) {3795 clear_loose_ref_cache(refs);3796 if (commit_ref(lock)) {3797 strbuf_addf(err, "couldn't set '%s'", lock->ref_name);3798 unlock_ref(lock);3799 update->backend_data = NULL;3800 ret = TRANSACTION_GENERIC_ERROR;3801 goto cleanup;3802 }3803 }3804 }3805 /* Perform deletes now that updates are safely completed */3806 for (i = 0; i < transaction->nr; i++) {3807 struct ref_update *update = transaction->updates[i];3808 struct ref_lock *lock = update->backend_data;38093810 if (update->flags & REF_DELETING &&3811 !(update->flags & REF_LOG_ONLY)) {3812 if (delete_ref_loose(lock, update->type, err)) {3813 ret = TRANSACTION_GENERIC_ERROR;3814 goto cleanup;3815 }38163817 if (!(update->flags & REF_ISPRUNING))3818 string_list_append(&refs_to_delete,3819 lock->ref_name);3820 }3821 }38223823 if (repack_without_refs(refs, &refs_to_delete, err)) {3824 ret = TRANSACTION_GENERIC_ERROR;3825 goto cleanup;3826 }3827 for_each_string_list_item(ref_to_delete, &refs_to_delete)3828 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3829 clear_loose_ref_cache(refs);38303831cleanup:3832 transaction->state = REF_TRANSACTION_CLOSED;38333834 for (i = 0; i < transaction->nr; i++)3835 if (transaction->updates[i]->backend_data)3836 unlock_ref(transaction->updates[i]->backend_data);3837 string_list_clear(&refs_to_delete, 0);3838 free(head_ref);3839 string_list_clear(&affected_refnames, 0);38403841 return ret;3842}38433844static int ref_present(const char *refname,3845 const struct object_id *oid, int flags, void *cb_data)3846{3847 struct string_list *affected_refnames = cb_data;38483849 return string_list_has_string(affected_refnames, refname);3850}38513852static int files_initial_transaction_commit(struct ref_store *ref_store,3853 struct ref_transaction *transaction,3854 struct strbuf *err)3855{3856 struct files_ref_store *refs =3857 files_downcast(ref_store, 0, "initial_ref_transaction_commit");3858 int ret = 0, i;3859 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;38603861 assert(err);38623863 if (transaction->state != REF_TRANSACTION_OPEN)3864 die("BUG: commit called for transaction that is not open");38653866 /* Fail if a refname appears more than once in the transaction: */3867 for (i = 0; i < transaction->nr; i++)3868 string_list_append(&affected_refnames,3869 transaction->updates[i]->refname);3870 string_list_sort(&affected_refnames);3871 if (ref_update_reject_duplicates(&affected_refnames, err)) {3872 ret = TRANSACTION_GENERIC_ERROR;3873 goto cleanup;3874 }38753876 /*3877 * It's really undefined to call this function in an active3878 * repository or when there are existing references: we are3879 * only locking and changing packed-refs, so (1) any3880 * simultaneous processes might try to change a reference at3881 * the same time we do, and (2) any existing loose versions of3882 * the references that we are setting would have precedence3883 * over our values. But some remote helpers create the remote3884 * "HEAD" and "master" branches before calling this function,3885 * so here we really only check that none of the references3886 * that we are creating already exists.3887 */3888 if (for_each_rawref(ref_present, &affected_refnames))3889 die("BUG: initial ref transaction called with existing refs");38903891 for (i = 0; i < transaction->nr; i++) {3892 struct ref_update *update = transaction->updates[i];38933894 if ((update->flags & REF_HAVE_OLD) &&3895 !is_null_sha1(update->old_sha1))3896 die("BUG: initial ref transaction with old_sha1 set");3897 if (verify_refname_available(update->refname,3898 &affected_refnames, NULL,3899 err)) {3900 ret = TRANSACTION_NAME_CONFLICT;3901 goto cleanup;3902 }3903 }39043905 if (lock_packed_refs(refs, 0)) {3906 strbuf_addf(err, "unable to lock packed-refs file: %s",3907 strerror(errno));3908 ret = TRANSACTION_GENERIC_ERROR;3909 goto cleanup;3910 }39113912 for (i = 0; i < transaction->nr; i++) {3913 struct ref_update *update = transaction->updates[i];39143915 if ((update->flags & REF_HAVE_NEW) &&3916 !is_null_sha1(update->new_sha1))3917 add_packed_ref(refs, update->refname, update->new_sha1);3918 }39193920 if (commit_packed_refs(refs)) {3921 strbuf_addf(err, "unable to commit packed-refs file: %s",3922 strerror(errno));3923 ret = TRANSACTION_GENERIC_ERROR;3924 goto cleanup;3925 }39263927cleanup:3928 transaction->state = REF_TRANSACTION_CLOSED;3929 string_list_clear(&affected_refnames, 0);3930 return ret;3931}39323933struct expire_reflog_cb {3934 unsigned int flags;3935 reflog_expiry_should_prune_fn *should_prune_fn;3936 void *policy_cb;3937 FILE *newlog;3938 unsigned char last_kept_sha1[20];3939};39403941static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,3942 const char *email, unsigned long timestamp, int tz,3943 const char *message, void *cb_data)3944{3945 struct expire_reflog_cb *cb = cb_data;3946 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;39473948 if (cb->flags & EXPIRE_REFLOGS_REWRITE)3949 osha1 = cb->last_kept_sha1;39503951 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3952 message, policy_cb)) {3953 if (!cb->newlog)3954 printf("would prune %s", message);3955 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)3956 printf("prune %s", message);3957 } else {3958 if (cb->newlog) {3959 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",3960 sha1_to_hex(osha1), sha1_to_hex(nsha1),3961 email, timestamp, tz, message);3962 hashcpy(cb->last_kept_sha1, nsha1);3963 }3964 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)3965 printf("keep %s", message);3966 }3967 return 0;3968}39693970static int files_reflog_expire(struct ref_store *ref_store,3971 const char *refname, const unsigned char *sha1,3972 unsigned int flags,3973 reflog_expiry_prepare_fn prepare_fn,3974 reflog_expiry_should_prune_fn should_prune_fn,3975 reflog_expiry_cleanup_fn cleanup_fn,3976 void *policy_cb_data)3977{3978 struct files_ref_store *refs =3979 files_downcast(ref_store, 0, "reflog_expire");3980 static struct lock_file reflog_lock;3981 struct expire_reflog_cb cb;3982 struct ref_lock *lock;3983 char *log_file;3984 int status = 0;3985 int type;3986 struct strbuf err = STRBUF_INIT;39873988 memset(&cb, 0, sizeof(cb));3989 cb.flags = flags;3990 cb.policy_cb = policy_cb_data;3991 cb.should_prune_fn = should_prune_fn;39923993 /*3994 * The reflog file is locked by holding the lock on the3995 * reference itself, plus we might need to update the3996 * reference if --updateref was specified:3997 */3998 lock = lock_ref_sha1_basic(refs, refname, sha1,3999 NULL, NULL, REF_NODEREF,4000 &type, &err);4001 if (!lock) {4002 error("cannot lock ref '%s': %s", refname, err.buf);4003 strbuf_release(&err);4004 return -1;4005 }4006 if (!reflog_exists(refname)) {4007 unlock_ref(lock);4008 return 0;4009 }40104011 log_file = git_pathdup("logs/%s", refname);4012 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4013 /*4014 * Even though holding $GIT_DIR/logs/$reflog.lock has4015 * no locking implications, we use the lock_file4016 * machinery here anyway because it does a lot of the4017 * work we need, including cleaning up if the program4018 * exits unexpectedly.4019 */4020 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {4021 struct strbuf err = STRBUF_INIT;4022 unable_to_lock_message(log_file, errno, &err);4023 error("%s", err.buf);4024 strbuf_release(&err);4025 goto failure;4026 }4027 cb.newlog = fdopen_lock_file(&reflog_lock, "w");4028 if (!cb.newlog) {4029 error("cannot fdopen %s (%s)",4030 get_lock_file_path(&reflog_lock), strerror(errno));4031 goto failure;4032 }4033 }40344035 (*prepare_fn)(refname, sha1, cb.policy_cb);4036 for_each_reflog_ent(refname, expire_reflog_ent, &cb);4037 (*cleanup_fn)(cb.policy_cb);40384039 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4040 /*4041 * It doesn't make sense to adjust a reference pointed4042 * to by a symbolic ref based on expiring entries in4043 * the symbolic reference's reflog. Nor can we update4044 * a reference if there are no remaining reflog4045 * entries.4046 */4047 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4048 !(type & REF_ISSYMREF) &&4049 !is_null_sha1(cb.last_kept_sha1);40504051 if (close_lock_file(&reflog_lock)) {4052 status |= error("couldn't write %s: %s", log_file,4053 strerror(errno));4054 } else if (update &&4055 (write_in_full(get_lock_file_fd(lock->lk),4056 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||4057 write_str_in_full(get_lock_file_fd(lock->lk), "\n") != 1 ||4058 close_ref(lock) < 0)) {4059 status |= error("couldn't write %s",4060 get_lock_file_path(lock->lk));4061 rollback_lock_file(&reflog_lock);4062 } else if (commit_lock_file(&reflog_lock)) {4063 status |= error("unable to write reflog '%s' (%s)",4064 log_file, strerror(errno));4065 } else if (update && commit_ref(lock)) {4066 status |= error("couldn't set %s", lock->ref_name);4067 }4068 }4069 free(log_file);4070 unlock_ref(lock);4071 return status;40724073 failure:4074 rollback_lock_file(&reflog_lock);4075 free(log_file);4076 unlock_ref(lock);4077 return -1;4078}40794080static int files_init_db(struct ref_store *ref_store, struct strbuf *err)4081{4082 /* Check validity (but we don't need the result): */4083 files_downcast(ref_store, 0, "init_db");40844085 /*4086 * Create .git/refs/{heads,tags}4087 */4088 safe_create_dir(git_path("refs/heads"), 1);4089 safe_create_dir(git_path("refs/tags"), 1);4090 if (get_shared_repository()) {4091 adjust_shared_perm(git_path("refs/heads"));4092 adjust_shared_perm(git_path("refs/tags"));4093 }4094 return 0;4095}40964097struct ref_storage_be refs_be_files = {4098 NULL,4099 "files",4100 files_ref_store_create,4101 files_init_db,4102 files_transaction_commit,4103 files_initial_transaction_commit,41044105 files_pack_refs,4106 files_peel_ref,4107 files_create_symref,4108 files_delete_refs,4109 files_rename_ref,41104111 files_ref_iterator_begin,4112 files_read_raw_ref,4113 files_verify_refname_available,41144115 files_reflog_iterator_begin,4116 files_for_each_reflog_ent,4117 files_for_each_reflog_ent_reverse,4118 files_reflog_exists,4119 files_create_reflog,4120 files_delete_reflog,4121 files_reflog_expire4122};