1#include "../cache.h" 2#include "../refs.h" 3#include "refs-internal.h" 4#include "../lockfile.h" 5#include "../object.h" 6#include "../dir.h" 7 8struct ref_lock { 9 char *ref_name; 10 struct lock_file *lk; 11 struct object_id old_oid; 12}; 13 14struct ref_entry; 15 16/* 17 * Information used (along with the information in ref_entry) to 18 * describe a single cached reference. This data structure only 19 * occurs embedded in a union in struct ref_entry, and only when 20 * (ref_entry->flag & REF_DIR) is zero. 21 */ 22struct ref_value { 23 /* 24 * The name of the object to which this reference resolves 25 * (which may be a tag object). If REF_ISBROKEN, this is 26 * null. If REF_ISSYMREF, then this is the name of the object 27 * referred to by the last reference in the symlink chain. 28 */ 29 struct object_id oid; 30 31 /* 32 * If REF_KNOWS_PEELED, then this field holds the peeled value 33 * of this reference, or null if the reference is known not to 34 * be peelable. See the documentation for peel_ref() for an 35 * exact definition of "peelable". 36 */ 37 struct object_id peeled; 38}; 39 40struct ref_cache; 41 42/* 43 * Information used (along with the information in ref_entry) to 44 * describe a level in the hierarchy of references. This data 45 * structure only occurs embedded in a union in struct ref_entry, and 46 * only when (ref_entry.flag & REF_DIR) is set. In that case, 47 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 48 * in the directory have already been read: 49 * 50 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 51 * or packed references, already read. 52 * 53 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 54 * references that hasn't been read yet (nor has any of its 55 * subdirectories). 56 * 57 * Entries within a directory are stored within a growable array of 58 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 59 * sorted are sorted by their component name in strcmp() order and the 60 * remaining entries are unsorted. 61 * 62 * Loose references are read lazily, one directory at a time. When a 63 * directory of loose references is read, then all of the references 64 * in that directory are stored, and REF_INCOMPLETE stubs are created 65 * for any subdirectories, but the subdirectories themselves are not 66 * read. The reading is triggered by get_ref_dir(). 67 */ 68struct ref_dir { 69 int nr, alloc; 70 71 /* 72 * Entries with index 0 <= i < sorted are sorted by name. New 73 * entries are appended to the list unsorted, and are sorted 74 * only when required; thus we avoid the need to sort the list 75 * after the addition of every reference. 76 */ 77 int sorted; 78 79 /* A pointer to the ref_cache that contains this ref_dir. */ 80 struct ref_cache *ref_cache; 81 82 struct ref_entry **entries; 83}; 84 85/* 86 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 87 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 88 * public values; see refs.h. 89 */ 90 91/* 92 * The field ref_entry->u.value.peeled of this value entry contains 93 * the correct peeled value for the reference, which might be 94 * null_sha1 if the reference is not a tag or if it is broken. 95 */ 96#define REF_KNOWS_PEELED 0x10 97 98/* ref_entry represents a directory of references */ 99#define REF_DIR 0x20 100 101/* 102 * Entry has not yet been read from disk (used only for REF_DIR 103 * entries representing loose references) 104 */ 105#define REF_INCOMPLETE 0x40 106 107/* 108 * A ref_entry represents either a reference or a "subdirectory" of 109 * references. 110 * 111 * Each directory in the reference namespace is represented by a 112 * ref_entry with (flags & REF_DIR) set and containing a subdir member 113 * that holds the entries in that directory that have been read so 114 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 115 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 116 * used for loose reference directories. 117 * 118 * References are represented by a ref_entry with (flags & REF_DIR) 119 * unset and a value member that describes the reference's value. The 120 * flag member is at the ref_entry level, but it is also needed to 121 * interpret the contents of the value field (in other words, a 122 * ref_value object is not very much use without the enclosing 123 * ref_entry). 124 * 125 * Reference names cannot end with slash and directories' names are 126 * always stored with a trailing slash (except for the top-level 127 * directory, which is always denoted by ""). This has two nice 128 * consequences: (1) when the entries in each subdir are sorted 129 * lexicographically by name (as they usually are), the references in 130 * a whole tree can be generated in lexicographic order by traversing 131 * the tree in left-to-right, depth-first order; (2) the names of 132 * references and subdirectories cannot conflict, and therefore the 133 * presence of an empty subdirectory does not block the creation of a 134 * similarly-named reference. (The fact that reference names with the 135 * same leading components can conflict *with each other* is a 136 * separate issue that is regulated by verify_refname_available().) 137 * 138 * Please note that the name field contains the fully-qualified 139 * reference (or subdirectory) name. Space could be saved by only 140 * storing the relative names. But that would require the full names 141 * to be generated on the fly when iterating in do_for_each_ref(), and 142 * would break callback functions, who have always been able to assume 143 * that the name strings that they are passed will not be freed during 144 * the iteration. 145 */ 146struct ref_entry { 147 unsigned char flag; /* ISSYMREF? ISPACKED? */ 148 union { 149 struct ref_value value; /* if not (flags&REF_DIR) */ 150 struct ref_dir subdir; /* if (flags&REF_DIR) */ 151 } u; 152 /* 153 * The full name of the reference (e.g., "refs/heads/master") 154 * or the full name of the directory with a trailing slash 155 * (e.g., "refs/heads/"): 156 */ 157 char name[FLEX_ARRAY]; 158}; 159 160static void read_loose_refs(const char *dirname, struct ref_dir *dir); 161static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len); 162static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 163 const char *dirname, size_t len, 164 int incomplete); 165static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry); 166 167static struct ref_dir *get_ref_dir(struct ref_entry *entry) 168{ 169 struct ref_dir *dir; 170 assert(entry->flag & REF_DIR); 171 dir = &entry->u.subdir; 172 if (entry->flag & REF_INCOMPLETE) { 173 read_loose_refs(entry->name, dir); 174 175 /* 176 * Manually add refs/bisect, which, being 177 * per-worktree, might not appear in the directory 178 * listing for refs/ in the main repo. 179 */ 180 if (!strcmp(entry->name, "refs/")) { 181 int pos = search_ref_dir(dir, "refs/bisect/", 12); 182 if (pos < 0) { 183 struct ref_entry *child_entry; 184 child_entry = create_dir_entry(dir->ref_cache, 185 "refs/bisect/", 186 12, 1); 187 add_entry_to_dir(dir, child_entry); 188 read_loose_refs("refs/bisect", 189 &child_entry->u.subdir); 190 } 191 } 192 entry->flag &= ~REF_INCOMPLETE; 193 } 194 return dir; 195} 196 197static struct ref_entry *create_ref_entry(const char *refname, 198 const unsigned char *sha1, int flag, 199 int check_name) 200{ 201 struct ref_entry *ref; 202 203 if (check_name && 204 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 205 die("Reference has invalid format: '%s'", refname); 206 FLEX_ALLOC_STR(ref, name, refname); 207 hashcpy(ref->u.value.oid.hash, sha1); 208 oidclr(&ref->u.value.peeled); 209 ref->flag = flag; 210 return ref; 211} 212 213static void clear_ref_dir(struct ref_dir *dir); 214 215static void free_ref_entry(struct ref_entry *entry) 216{ 217 if (entry->flag & REF_DIR) { 218 /* 219 * Do not use get_ref_dir() here, as that might 220 * trigger the reading of loose refs. 221 */ 222 clear_ref_dir(&entry->u.subdir); 223 } 224 free(entry); 225} 226 227/* 228 * Add a ref_entry to the end of dir (unsorted). Entry is always 229 * stored directly in dir; no recursion into subdirectories is 230 * done. 231 */ 232static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry) 233{ 234 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc); 235 dir->entries[dir->nr++] = entry; 236 /* optimize for the case that entries are added in order */ 237 if (dir->nr == 1 || 238 (dir->nr == dir->sorted + 1 && 239 strcmp(dir->entries[dir->nr - 2]->name, 240 dir->entries[dir->nr - 1]->name) < 0)) 241 dir->sorted = dir->nr; 242} 243 244/* 245 * Clear and free all entries in dir, recursively. 246 */ 247static void clear_ref_dir(struct ref_dir *dir) 248{ 249 int i; 250 for (i = 0; i < dir->nr; i++) 251 free_ref_entry(dir->entries[i]); 252 free(dir->entries); 253 dir->sorted = dir->nr = dir->alloc = 0; 254 dir->entries = NULL; 255} 256 257/* 258 * Create a struct ref_entry object for the specified dirname. 259 * dirname is the name of the directory with a trailing slash (e.g., 260 * "refs/heads/") or "" for the top-level directory. 261 */ 262static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 263 const char *dirname, size_t len, 264 int incomplete) 265{ 266 struct ref_entry *direntry; 267 FLEX_ALLOC_MEM(direntry, name, dirname, len); 268 direntry->u.subdir.ref_cache = ref_cache; 269 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0); 270 return direntry; 271} 272 273static int ref_entry_cmp(const void *a, const void *b) 274{ 275 struct ref_entry *one = *(struct ref_entry **)a; 276 struct ref_entry *two = *(struct ref_entry **)b; 277 return strcmp(one->name, two->name); 278} 279 280static void sort_ref_dir(struct ref_dir *dir); 281 282struct string_slice { 283 size_t len; 284 const char *str; 285}; 286 287static int ref_entry_cmp_sslice(const void *key_, const void *ent_) 288{ 289 const struct string_slice *key = key_; 290 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_; 291 int cmp = strncmp(key->str, ent->name, key->len); 292 if (cmp) 293 return cmp; 294 return '\0' - (unsigned char)ent->name[key->len]; 295} 296 297/* 298 * Return the index of the entry with the given refname from the 299 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 300 * no such entry is found. dir must already be complete. 301 */ 302static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len) 303{ 304 struct ref_entry **r; 305 struct string_slice key; 306 307 if (refname == NULL || !dir->nr) 308 return -1; 309 310 sort_ref_dir(dir); 311 key.len = len; 312 key.str = refname; 313 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries), 314 ref_entry_cmp_sslice); 315 316 if (r == NULL) 317 return -1; 318 319 return r - dir->entries; 320} 321 322/* 323 * Search for a directory entry directly within dir (without 324 * recursing). Sort dir if necessary. subdirname must be a directory 325 * name (i.e., end in '/'). If mkdir is set, then create the 326 * directory if it is missing; otherwise, return NULL if the desired 327 * directory cannot be found. dir must already be complete. 328 */ 329static struct ref_dir *search_for_subdir(struct ref_dir *dir, 330 const char *subdirname, size_t len, 331 int mkdir) 332{ 333 int entry_index = search_ref_dir(dir, subdirname, len); 334 struct ref_entry *entry; 335 if (entry_index == -1) { 336 if (!mkdir) 337 return NULL; 338 /* 339 * Since dir is complete, the absence of a subdir 340 * means that the subdir really doesn't exist; 341 * therefore, create an empty record for it but mark 342 * the record complete. 343 */ 344 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0); 345 add_entry_to_dir(dir, entry); 346 } else { 347 entry = dir->entries[entry_index]; 348 } 349 return get_ref_dir(entry); 350} 351 352/* 353 * If refname is a reference name, find the ref_dir within the dir 354 * tree that should hold refname. If refname is a directory name 355 * (i.e., ends in '/'), then return that ref_dir itself. dir must 356 * represent the top-level directory and must already be complete. 357 * Sort ref_dirs and recurse into subdirectories as necessary. If 358 * mkdir is set, then create any missing directories; otherwise, 359 * return NULL if the desired directory cannot be found. 360 */ 361static struct ref_dir *find_containing_dir(struct ref_dir *dir, 362 const char *refname, int mkdir) 363{ 364 const char *slash; 365 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 366 size_t dirnamelen = slash - refname + 1; 367 struct ref_dir *subdir; 368 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir); 369 if (!subdir) { 370 dir = NULL; 371 break; 372 } 373 dir = subdir; 374 } 375 376 return dir; 377} 378 379/* 380 * Find the value entry with the given name in dir, sorting ref_dirs 381 * and recursing into subdirectories as necessary. If the name is not 382 * found or it corresponds to a directory entry, return NULL. 383 */ 384static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname) 385{ 386 int entry_index; 387 struct ref_entry *entry; 388 dir = find_containing_dir(dir, refname, 0); 389 if (!dir) 390 return NULL; 391 entry_index = search_ref_dir(dir, refname, strlen(refname)); 392 if (entry_index == -1) 393 return NULL; 394 entry = dir->entries[entry_index]; 395 return (entry->flag & REF_DIR) ? NULL : entry; 396} 397 398/* 399 * Remove the entry with the given name from dir, recursing into 400 * subdirectories as necessary. If refname is the name of a directory 401 * (i.e., ends with '/'), then remove the directory and its contents. 402 * If the removal was successful, return the number of entries 403 * remaining in the directory entry that contained the deleted entry. 404 * If the name was not found, return -1. Please note that this 405 * function only deletes the entry from the cache; it does not delete 406 * it from the filesystem or ensure that other cache entries (which 407 * might be symbolic references to the removed entry) are updated. 408 * Nor does it remove any containing dir entries that might be made 409 * empty by the removal. dir must represent the top-level directory 410 * and must already be complete. 411 */ 412static int remove_entry(struct ref_dir *dir, const char *refname) 413{ 414 int refname_len = strlen(refname); 415 int entry_index; 416 struct ref_entry *entry; 417 int is_dir = refname[refname_len - 1] == '/'; 418 if (is_dir) { 419 /* 420 * refname represents a reference directory. Remove 421 * the trailing slash; otherwise we will get the 422 * directory *representing* refname rather than the 423 * one *containing* it. 424 */ 425 char *dirname = xmemdupz(refname, refname_len - 1); 426 dir = find_containing_dir(dir, dirname, 0); 427 free(dirname); 428 } else { 429 dir = find_containing_dir(dir, refname, 0); 430 } 431 if (!dir) 432 return -1; 433 entry_index = search_ref_dir(dir, refname, refname_len); 434 if (entry_index == -1) 435 return -1; 436 entry = dir->entries[entry_index]; 437 438 memmove(&dir->entries[entry_index], 439 &dir->entries[entry_index + 1], 440 (dir->nr - entry_index - 1) * sizeof(*dir->entries) 441 ); 442 dir->nr--; 443 if (dir->sorted > entry_index) 444 dir->sorted--; 445 free_ref_entry(entry); 446 return dir->nr; 447} 448 449/* 450 * Add a ref_entry to the ref_dir (unsorted), recursing into 451 * subdirectories as necessary. dir must represent the top-level 452 * directory. Return 0 on success. 453 */ 454static int add_ref(struct ref_dir *dir, struct ref_entry *ref) 455{ 456 dir = find_containing_dir(dir, ref->name, 1); 457 if (!dir) 458 return -1; 459 add_entry_to_dir(dir, ref); 460 return 0; 461} 462 463/* 464 * Emit a warning and return true iff ref1 and ref2 have the same name 465 * and the same sha1. Die if they have the same name but different 466 * sha1s. 467 */ 468static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2) 469{ 470 if (strcmp(ref1->name, ref2->name)) 471 return 0; 472 473 /* Duplicate name; make sure that they don't conflict: */ 474 475 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 476 /* This is impossible by construction */ 477 die("Reference directory conflict: %s", ref1->name); 478 479 if (oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 480 die("Duplicated ref, and SHA1s don't match: %s", ref1->name); 481 482 warning("Duplicated ref: %s", ref1->name); 483 return 1; 484} 485 486/* 487 * Sort the entries in dir non-recursively (if they are not already 488 * sorted) and remove any duplicate entries. 489 */ 490static void sort_ref_dir(struct ref_dir *dir) 491{ 492 int i, j; 493 struct ref_entry *last = NULL; 494 495 /* 496 * This check also prevents passing a zero-length array to qsort(), 497 * which is a problem on some platforms. 498 */ 499 if (dir->sorted == dir->nr) 500 return; 501 502 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp); 503 504 /* Remove any duplicates: */ 505 for (i = 0, j = 0; j < dir->nr; j++) { 506 struct ref_entry *entry = dir->entries[j]; 507 if (last && is_dup_ref(last, entry)) 508 free_ref_entry(entry); 509 else 510 last = dir->entries[i++] = entry; 511 } 512 dir->sorted = dir->nr = i; 513} 514 515/* 516 * Return true iff the reference described by entry can be resolved to 517 * an object in the database. Emit a warning if the referred-to 518 * object does not exist. 519 */ 520static int ref_resolves_to_object(struct ref_entry *entry) 521{ 522 if (entry->flag & REF_ISBROKEN) 523 return 0; 524 if (!has_sha1_file(entry->u.value.oid.hash)) { 525 error("%s does not point to a valid object!", entry->name); 526 return 0; 527 } 528 return 1; 529} 530 531/* 532 * current_ref is a performance hack: when iterating over references 533 * using the for_each_ref*() functions, current_ref is set to the 534 * current reference's entry before calling the callback function. If 535 * the callback function calls peel_ref(), then peel_ref() first 536 * checks whether the reference to be peeled is the current reference 537 * (it usually is) and if so, returns that reference's peeled version 538 * if it is available. This avoids a refname lookup in a common case. 539 */ 540static struct ref_entry *current_ref; 541 542typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data); 543 544struct ref_entry_cb { 545 const char *prefix; 546 int trim; 547 int flags; 548 each_ref_fn *fn; 549 void *cb_data; 550}; 551 552/* 553 * Handle one reference in a do_for_each_ref*()-style iteration, 554 * calling an each_ref_fn for each entry. 555 */ 556static int do_one_ref(struct ref_entry *entry, void *cb_data) 557{ 558 struct ref_entry_cb *data = cb_data; 559 struct ref_entry *old_current_ref; 560 int retval; 561 562 if (!starts_with(entry->name, data->prefix)) 563 return 0; 564 565 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && 566 !ref_resolves_to_object(entry)) 567 return 0; 568 569 /* Store the old value, in case this is a recursive call: */ 570 old_current_ref = current_ref; 571 current_ref = entry; 572 retval = data->fn(entry->name + data->trim, &entry->u.value.oid, 573 entry->flag, data->cb_data); 574 current_ref = old_current_ref; 575 return retval; 576} 577 578/* 579 * Call fn for each reference in dir that has index in the range 580 * offset <= index < dir->nr. Recurse into subdirectories that are in 581 * that index range, sorting them before iterating. This function 582 * does not sort dir itself; it should be sorted beforehand. fn is 583 * called for all references, including broken ones. 584 */ 585static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset, 586 each_ref_entry_fn fn, void *cb_data) 587{ 588 int i; 589 assert(dir->sorted == dir->nr); 590 for (i = offset; i < dir->nr; i++) { 591 struct ref_entry *entry = dir->entries[i]; 592 int retval; 593 if (entry->flag & REF_DIR) { 594 struct ref_dir *subdir = get_ref_dir(entry); 595 sort_ref_dir(subdir); 596 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data); 597 } else { 598 retval = fn(entry, cb_data); 599 } 600 if (retval) 601 return retval; 602 } 603 return 0; 604} 605 606/* 607 * Call fn for each reference in the union of dir1 and dir2, in order 608 * by refname. Recurse into subdirectories. If a value entry appears 609 * in both dir1 and dir2, then only process the version that is in 610 * dir2. The input dirs must already be sorted, but subdirs will be 611 * sorted as needed. fn is called for all references, including 612 * broken ones. 613 */ 614static int do_for_each_entry_in_dirs(struct ref_dir *dir1, 615 struct ref_dir *dir2, 616 each_ref_entry_fn fn, void *cb_data) 617{ 618 int retval; 619 int i1 = 0, i2 = 0; 620 621 assert(dir1->sorted == dir1->nr); 622 assert(dir2->sorted == dir2->nr); 623 while (1) { 624 struct ref_entry *e1, *e2; 625 int cmp; 626 if (i1 == dir1->nr) { 627 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data); 628 } 629 if (i2 == dir2->nr) { 630 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data); 631 } 632 e1 = dir1->entries[i1]; 633 e2 = dir2->entries[i2]; 634 cmp = strcmp(e1->name, e2->name); 635 if (cmp == 0) { 636 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { 637 /* Both are directories; descend them in parallel. */ 638 struct ref_dir *subdir1 = get_ref_dir(e1); 639 struct ref_dir *subdir2 = get_ref_dir(e2); 640 sort_ref_dir(subdir1); 641 sort_ref_dir(subdir2); 642 retval = do_for_each_entry_in_dirs( 643 subdir1, subdir2, fn, cb_data); 644 i1++; 645 i2++; 646 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { 647 /* Both are references; ignore the one from dir1. */ 648 retval = fn(e2, cb_data); 649 i1++; 650 i2++; 651 } else { 652 die("conflict between reference and directory: %s", 653 e1->name); 654 } 655 } else { 656 struct ref_entry *e; 657 if (cmp < 0) { 658 e = e1; 659 i1++; 660 } else { 661 e = e2; 662 i2++; 663 } 664 if (e->flag & REF_DIR) { 665 struct ref_dir *subdir = get_ref_dir(e); 666 sort_ref_dir(subdir); 667 retval = do_for_each_entry_in_dir( 668 subdir, 0, fn, cb_data); 669 } else { 670 retval = fn(e, cb_data); 671 } 672 } 673 if (retval) 674 return retval; 675 } 676} 677 678/* 679 * Load all of the refs from the dir into our in-memory cache. The hard work 680 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 681 * through all of the sub-directories. We do not even need to care about 682 * sorting, as traversal order does not matter to us. 683 */ 684static void prime_ref_dir(struct ref_dir *dir) 685{ 686 int i; 687 for (i = 0; i < dir->nr; i++) { 688 struct ref_entry *entry = dir->entries[i]; 689 if (entry->flag & REF_DIR) 690 prime_ref_dir(get_ref_dir(entry)); 691 } 692} 693 694struct nonmatching_ref_data { 695 const struct string_list *skip; 696 const char *conflicting_refname; 697}; 698 699static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata) 700{ 701 struct nonmatching_ref_data *data = vdata; 702 703 if (data->skip && string_list_has_string(data->skip, entry->name)) 704 return 0; 705 706 data->conflicting_refname = entry->name; 707 return 1; 708} 709 710/* 711 * Return 0 if a reference named refname could be created without 712 * conflicting with the name of an existing reference in dir. 713 * See verify_refname_available for more information. 714 */ 715static int verify_refname_available_dir(const char *refname, 716 const struct string_list *extras, 717 const struct string_list *skip, 718 struct ref_dir *dir, 719 struct strbuf *err) 720{ 721 const char *slash; 722 const char *extra_refname; 723 int pos; 724 struct strbuf dirname = STRBUF_INIT; 725 int ret = -1; 726 727 /* 728 * For the sake of comments in this function, suppose that 729 * refname is "refs/foo/bar". 730 */ 731 732 assert(err); 733 734 strbuf_grow(&dirname, strlen(refname) + 1); 735 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 736 /* Expand dirname to the new prefix, not including the trailing slash: */ 737 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 738 739 /* 740 * We are still at a leading dir of the refname (e.g., 741 * "refs/foo"; if there is a reference with that name, 742 * it is a conflict, *unless* it is in skip. 743 */ 744 if (dir) { 745 pos = search_ref_dir(dir, dirname.buf, dirname.len); 746 if (pos >= 0 && 747 (!skip || !string_list_has_string(skip, dirname.buf))) { 748 /* 749 * We found a reference whose name is 750 * a proper prefix of refname; e.g., 751 * "refs/foo", and is not in skip. 752 */ 753 strbuf_addf(err, "'%s' exists; cannot create '%s'", 754 dirname.buf, refname); 755 goto cleanup; 756 } 757 } 758 759 if (extras && string_list_has_string(extras, dirname.buf) && 760 (!skip || !string_list_has_string(skip, dirname.buf))) { 761 strbuf_addf(err, "cannot process '%s' and '%s' at the same time", 762 refname, dirname.buf); 763 goto cleanup; 764 } 765 766 /* 767 * Otherwise, we can try to continue our search with 768 * the next component. So try to look up the 769 * directory, e.g., "refs/foo/". If we come up empty, 770 * we know there is nothing under this whole prefix, 771 * but even in that case we still have to continue the 772 * search for conflicts with extras. 773 */ 774 strbuf_addch(&dirname, '/'); 775 if (dir) { 776 pos = search_ref_dir(dir, dirname.buf, dirname.len); 777 if (pos < 0) { 778 /* 779 * There was no directory "refs/foo/", 780 * so there is nothing under this 781 * whole prefix. So there is no need 782 * to continue looking for conflicting 783 * references. But we need to continue 784 * looking for conflicting extras. 785 */ 786 dir = NULL; 787 } else { 788 dir = get_ref_dir(dir->entries[pos]); 789 } 790 } 791 } 792 793 /* 794 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 795 * There is no point in searching for a reference with that 796 * name, because a refname isn't considered to conflict with 797 * itself. But we still need to check for references whose 798 * names are in the "refs/foo/bar/" namespace, because they 799 * *do* conflict. 800 */ 801 strbuf_addstr(&dirname, refname + dirname.len); 802 strbuf_addch(&dirname, '/'); 803 804 if (dir) { 805 pos = search_ref_dir(dir, dirname.buf, dirname.len); 806 807 if (pos >= 0) { 808 /* 809 * We found a directory named "$refname/" 810 * (e.g., "refs/foo/bar/"). It is a problem 811 * iff it contains any ref that is not in 812 * "skip". 813 */ 814 struct nonmatching_ref_data data; 815 816 data.skip = skip; 817 data.conflicting_refname = NULL; 818 dir = get_ref_dir(dir->entries[pos]); 819 sort_ref_dir(dir); 820 if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) { 821 strbuf_addf(err, "'%s' exists; cannot create '%s'", 822 data.conflicting_refname, refname); 823 goto cleanup; 824 } 825 } 826 } 827 828 extra_refname = find_descendant_ref(dirname.buf, extras, skip); 829 if (extra_refname) 830 strbuf_addf(err, "cannot process '%s' and '%s' at the same time", 831 refname, extra_refname); 832 else 833 ret = 0; 834 835cleanup: 836 strbuf_release(&dirname); 837 return ret; 838} 839 840struct packed_ref_cache { 841 struct ref_entry *root; 842 843 /* 844 * Count of references to the data structure in this instance, 845 * including the pointer from ref_cache::packed if any. The 846 * data will not be freed as long as the reference count is 847 * nonzero. 848 */ 849 unsigned int referrers; 850 851 /* 852 * Iff the packed-refs file associated with this instance is 853 * currently locked for writing, this points at the associated 854 * lock (which is owned by somebody else). The referrer count 855 * is also incremented when the file is locked and decremented 856 * when it is unlocked. 857 */ 858 struct lock_file *lock; 859 860 /* The metadata from when this packed-refs cache was read */ 861 struct stat_validity validity; 862}; 863 864/* 865 * Future: need to be in "struct repository" 866 * when doing a full libification. 867 */ 868static struct ref_cache { 869 struct ref_cache *next; 870 struct ref_entry *loose; 871 struct packed_ref_cache *packed; 872 /* 873 * The submodule name, or "" for the main repo. We allocate 874 * length 1 rather than FLEX_ARRAY so that the main ref_cache 875 * is initialized correctly. 876 */ 877 char name[1]; 878} ref_cache, *submodule_ref_caches; 879 880/* Lock used for the main packed-refs file: */ 881static struct lock_file packlock; 882 883/* 884 * Increment the reference count of *packed_refs. 885 */ 886static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 887{ 888 packed_refs->referrers++; 889} 890 891/* 892 * Decrease the reference count of *packed_refs. If it goes to zero, 893 * free *packed_refs and return true; otherwise return false. 894 */ 895static int release_packed_ref_cache(struct packed_ref_cache *packed_refs) 896{ 897 if (!--packed_refs->referrers) { 898 free_ref_entry(packed_refs->root); 899 stat_validity_clear(&packed_refs->validity); 900 free(packed_refs); 901 return 1; 902 } else { 903 return 0; 904 } 905} 906 907static void clear_packed_ref_cache(struct ref_cache *refs) 908{ 909 if (refs->packed) { 910 struct packed_ref_cache *packed_refs = refs->packed; 911 912 if (packed_refs->lock) 913 die("internal error: packed-ref cache cleared while locked"); 914 refs->packed = NULL; 915 release_packed_ref_cache(packed_refs); 916 } 917} 918 919static void clear_loose_ref_cache(struct ref_cache *refs) 920{ 921 if (refs->loose) { 922 free_ref_entry(refs->loose); 923 refs->loose = NULL; 924 } 925} 926 927/* 928 * Create a new submodule ref cache and add it to the internal 929 * set of caches. 930 */ 931static struct ref_cache *create_ref_cache(const char *submodule) 932{ 933 struct ref_cache *refs; 934 if (!submodule) 935 submodule = ""; 936 FLEX_ALLOC_STR(refs, name, submodule); 937 refs->next = submodule_ref_caches; 938 submodule_ref_caches = refs; 939 return refs; 940} 941 942static struct ref_cache *lookup_ref_cache(const char *submodule) 943{ 944 struct ref_cache *refs; 945 946 if (!submodule || !*submodule) 947 return &ref_cache; 948 949 for (refs = submodule_ref_caches; refs; refs = refs->next) 950 if (!strcmp(submodule, refs->name)) 951 return refs; 952 return NULL; 953} 954 955/* 956 * Return a pointer to a ref_cache for the specified submodule. For 957 * the main repository, use submodule==NULL. The returned structure 958 * will be allocated and initialized but not necessarily populated; it 959 * should not be freed. 960 */ 961static struct ref_cache *get_ref_cache(const char *submodule) 962{ 963 struct ref_cache *refs = lookup_ref_cache(submodule); 964 if (!refs) 965 refs = create_ref_cache(submodule); 966 return refs; 967} 968 969/* The length of a peeled reference line in packed-refs, including EOL: */ 970#define PEELED_LINE_LENGTH 42 971 972/* 973 * The packed-refs header line that we write out. Perhaps other 974 * traits will be added later. The trailing space is required. 975 */ 976static const char PACKED_REFS_HEADER[] = 977 "# pack-refs with: peeled fully-peeled \n"; 978 979/* 980 * Parse one line from a packed-refs file. Write the SHA1 to sha1. 981 * Return a pointer to the refname within the line (null-terminated), 982 * or NULL if there was a problem. 983 */ 984static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1) 985{ 986 const char *ref; 987 988 /* 989 * 42: the answer to everything. 990 * 991 * In this case, it happens to be the answer to 992 * 40 (length of sha1 hex representation) 993 * +1 (space in between hex and name) 994 * +1 (newline at the end of the line) 995 */ 996 if (line->len <= 42) 997 return NULL; 998 999 if (get_sha1_hex(line->buf, sha1) < 0)1000 return NULL;1001 if (!isspace(line->buf[40]))1002 return NULL;10031004 ref = line->buf + 41;1005 if (isspace(*ref))1006 return NULL;10071008 if (line->buf[line->len - 1] != '\n')1009 return NULL;1010 line->buf[--line->len] = 0;10111012 return ref;1013}10141015/*1016 * Read f, which is a packed-refs file, into dir.1017 *1018 * A comment line of the form "# pack-refs with: " may contain zero or1019 * more traits. We interpret the traits as follows:1020 *1021 * No traits:1022 *1023 * Probably no references are peeled. But if the file contains a1024 * peeled value for a reference, we will use it.1025 *1026 * peeled:1027 *1028 * References under "refs/tags/", if they *can* be peeled, *are*1029 * peeled in this file. References outside of "refs/tags/" are1030 * probably not peeled even if they could have been, but if we find1031 * a peeled value for such a reference we will use it.1032 *1033 * fully-peeled:1034 *1035 * All references in the file that can be peeled are peeled.1036 * Inversely (and this is more important), any references in the1037 * file for which no peeled value is recorded is not peelable. This1038 * trait should typically be written alongside "peeled" for1039 * compatibility with older clients, but we do not require it1040 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1041 */1042static void read_packed_refs(FILE *f, struct ref_dir *dir)1043{1044 struct ref_entry *last = NULL;1045 struct strbuf line = STRBUF_INIT;1046 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;10471048 while (strbuf_getwholeline(&line, f, '\n') != EOF) {1049 unsigned char sha1[20];1050 const char *refname;1051 const char *traits;10521053 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {1054 if (strstr(traits, " fully-peeled "))1055 peeled = PEELED_FULLY;1056 else if (strstr(traits, " peeled "))1057 peeled = PEELED_TAGS;1058 /* perhaps other traits later as well */1059 continue;1060 }10611062 refname = parse_ref_line(&line, sha1);1063 if (refname) {1064 int flag = REF_ISPACKED;10651066 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1067 if (!refname_is_safe(refname))1068 die("packed refname is dangerous: %s", refname);1069 hashclr(sha1);1070 flag |= REF_BAD_NAME | REF_ISBROKEN;1071 }1072 last = create_ref_entry(refname, sha1, flag, 0);1073 if (peeled == PEELED_FULLY ||1074 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))1075 last->flag |= REF_KNOWS_PEELED;1076 add_ref(dir, last);1077 continue;1078 }1079 if (last &&1080 line.buf[0] == '^' &&1081 line.len == PEELED_LINE_LENGTH &&1082 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&1083 !get_sha1_hex(line.buf + 1, sha1)) {1084 hashcpy(last->u.value.peeled.hash, sha1);1085 /*1086 * Regardless of what the file header said,1087 * we definitely know the value of *this*1088 * reference:1089 */1090 last->flag |= REF_KNOWS_PEELED;1091 }1092 }10931094 strbuf_release(&line);1095}10961097/*1098 * Get the packed_ref_cache for the specified ref_cache, creating it1099 * if necessary.1100 */1101static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1102{1103 char *packed_refs_file;11041105 if (*refs->name)1106 packed_refs_file = git_pathdup_submodule(refs->name, "packed-refs");1107 else1108 packed_refs_file = git_pathdup("packed-refs");11091110 if (refs->packed &&1111 !stat_validity_check(&refs->packed->validity, packed_refs_file))1112 clear_packed_ref_cache(refs);11131114 if (!refs->packed) {1115 FILE *f;11161117 refs->packed = xcalloc(1, sizeof(*refs->packed));1118 acquire_packed_ref_cache(refs->packed);1119 refs->packed->root = create_dir_entry(refs, "", 0, 0);1120 f = fopen(packed_refs_file, "r");1121 if (f) {1122 stat_validity_update(&refs->packed->validity, fileno(f));1123 read_packed_refs(f, get_ref_dir(refs->packed->root));1124 fclose(f);1125 }1126 }1127 free(packed_refs_file);1128 return refs->packed;1129}11301131static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1132{1133 return get_ref_dir(packed_ref_cache->root);1134}11351136static struct ref_dir *get_packed_refs(struct ref_cache *refs)1137{1138 return get_packed_ref_dir(get_packed_ref_cache(refs));1139}11401141/*1142 * Add a reference to the in-memory packed reference cache. This may1143 * only be called while the packed-refs file is locked (see1144 * lock_packed_refs()). To actually write the packed-refs file, call1145 * commit_packed_refs().1146 */1147static void add_packed_ref(const char *refname, const unsigned char *sha1)1148{1149 struct packed_ref_cache *packed_ref_cache =1150 get_packed_ref_cache(&ref_cache);11511152 if (!packed_ref_cache->lock)1153 die("internal error: packed refs not locked");1154 add_ref(get_packed_ref_dir(packed_ref_cache),1155 create_ref_entry(refname, sha1, REF_ISPACKED, 1));1156}11571158/*1159 * Read the loose references from the namespace dirname into dir1160 * (without recursing). dirname must end with '/'. dir must be the1161 * directory entry corresponding to dirname.1162 */1163static void read_loose_refs(const char *dirname, struct ref_dir *dir)1164{1165 struct ref_cache *refs = dir->ref_cache;1166 DIR *d;1167 struct dirent *de;1168 int dirnamelen = strlen(dirname);1169 struct strbuf refname;1170 struct strbuf path = STRBUF_INIT;1171 size_t path_baselen;11721173 if (*refs->name)1174 strbuf_git_path_submodule(&path, refs->name, "%s", dirname);1175 else1176 strbuf_git_path(&path, "%s", dirname);1177 path_baselen = path.len;11781179 d = opendir(path.buf);1180 if (!d) {1181 strbuf_release(&path);1182 return;1183 }11841185 strbuf_init(&refname, dirnamelen + 257);1186 strbuf_add(&refname, dirname, dirnamelen);11871188 while ((de = readdir(d)) != NULL) {1189 unsigned char sha1[20];1190 struct stat st;1191 int flag;11921193 if (de->d_name[0] == '.')1194 continue;1195 if (ends_with(de->d_name, ".lock"))1196 continue;1197 strbuf_addstr(&refname, de->d_name);1198 strbuf_addstr(&path, de->d_name);1199 if (stat(path.buf, &st) < 0) {1200 ; /* silently ignore */1201 } else if (S_ISDIR(st.st_mode)) {1202 strbuf_addch(&refname, '/');1203 add_entry_to_dir(dir,1204 create_dir_entry(refs, refname.buf,1205 refname.len, 1));1206 } else {1207 int read_ok;12081209 if (*refs->name) {1210 hashclr(sha1);1211 flag = 0;1212 read_ok = !resolve_gitlink_ref(refs->name,1213 refname.buf, sha1);1214 } else {1215 read_ok = !read_ref_full(refname.buf,1216 RESOLVE_REF_READING,1217 sha1, &flag);1218 }12191220 if (!read_ok) {1221 hashclr(sha1);1222 flag |= REF_ISBROKEN;1223 } else if (is_null_sha1(sha1)) {1224 /*1225 * It is so astronomically unlikely1226 * that NULL_SHA1 is the SHA-1 of an1227 * actual object that we consider its1228 * appearance in a loose reference1229 * file to be repo corruption1230 * (probably due to a software bug).1231 */1232 flag |= REF_ISBROKEN;1233 }12341235 if (check_refname_format(refname.buf,1236 REFNAME_ALLOW_ONELEVEL)) {1237 if (!refname_is_safe(refname.buf))1238 die("loose refname is dangerous: %s", refname.buf);1239 hashclr(sha1);1240 flag |= REF_BAD_NAME | REF_ISBROKEN;1241 }1242 add_entry_to_dir(dir,1243 create_ref_entry(refname.buf, sha1, flag, 0));1244 }1245 strbuf_setlen(&refname, dirnamelen);1246 strbuf_setlen(&path, path_baselen);1247 }1248 strbuf_release(&refname);1249 strbuf_release(&path);1250 closedir(d);1251}12521253static struct ref_dir *get_loose_refs(struct ref_cache *refs)1254{1255 if (!refs->loose) {1256 /*1257 * Mark the top-level directory complete because we1258 * are about to read the only subdirectory that can1259 * hold references:1260 */1261 refs->loose = create_dir_entry(refs, "", 0, 0);1262 /*1263 * Create an incomplete entry for "refs/":1264 */1265 add_entry_to_dir(get_ref_dir(refs->loose),1266 create_dir_entry(refs, "refs/", 5, 1));1267 }1268 return get_ref_dir(refs->loose);1269}12701271#define MAXREFLEN (1024)12721273/*1274 * Called by resolve_gitlink_ref_recursive() after it failed to read1275 * from the loose refs in ref_cache refs. Find <refname> in the1276 * packed-refs file for the submodule.1277 */1278static int resolve_gitlink_packed_ref(struct ref_cache *refs,1279 const char *refname, unsigned char *sha1)1280{1281 struct ref_entry *ref;1282 struct ref_dir *dir = get_packed_refs(refs);12831284 ref = find_ref(dir, refname);1285 if (ref == NULL)1286 return -1;12871288 hashcpy(sha1, ref->u.value.oid.hash);1289 return 0;1290}12911292static int resolve_gitlink_ref_recursive(struct ref_cache *refs,1293 const char *refname, unsigned char *sha1,1294 int recursion)1295{1296 int fd, len;1297 char buffer[128], *p;1298 char *path;12991300 if (recursion > SYMREF_MAXDEPTH || strlen(refname) > MAXREFLEN)1301 return -1;1302 path = *refs->name1303 ? git_pathdup_submodule(refs->name, "%s", refname)1304 : git_pathdup("%s", refname);1305 fd = open(path, O_RDONLY);1306 free(path);1307 if (fd < 0)1308 return resolve_gitlink_packed_ref(refs, refname, sha1);13091310 len = read(fd, buffer, sizeof(buffer)-1);1311 close(fd);1312 if (len < 0)1313 return -1;1314 while (len && isspace(buffer[len-1]))1315 len--;1316 buffer[len] = 0;13171318 /* Was it a detached head or an old-fashioned symlink? */1319 if (!get_sha1_hex(buffer, sha1))1320 return 0;13211322 /* Symref? */1323 if (strncmp(buffer, "ref:", 4))1324 return -1;1325 p = buffer + 4;1326 while (isspace(*p))1327 p++;13281329 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1330}13311332int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)1333{1334 int len = strlen(path), retval;1335 struct strbuf submodule = STRBUF_INIT;1336 struct ref_cache *refs;13371338 while (len && path[len-1] == '/')1339 len--;1340 if (!len)1341 return -1;13421343 strbuf_add(&submodule, path, len);1344 refs = lookup_ref_cache(submodule.buf);1345 if (!refs) {1346 if (!is_nonbare_repository_dir(&submodule)) {1347 strbuf_release(&submodule);1348 return -1;1349 }1350 refs = create_ref_cache(submodule.buf);1351 }1352 strbuf_release(&submodule);13531354 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);1355 return retval;1356}13571358/*1359 * Return the ref_entry for the given refname from the packed1360 * references. If it does not exist, return NULL.1361 */1362static struct ref_entry *get_packed_ref(const char *refname)1363{1364 return find_ref(get_packed_refs(&ref_cache), refname);1365}13661367/*1368 * A loose ref file doesn't exist; check for a packed ref.1369 */1370static int resolve_missing_loose_ref(const char *refname,1371 unsigned char *sha1,1372 unsigned int *flags)1373{1374 struct ref_entry *entry;13751376 /*1377 * The loose reference file does not exist; check for a packed1378 * reference.1379 */1380 entry = get_packed_ref(refname);1381 if (entry) {1382 hashcpy(sha1, entry->u.value.oid.hash);1383 *flags |= REF_ISPACKED;1384 return 0;1385 }1386 /* refname is not a packed reference. */1387 return -1;1388}13891390int read_raw_ref(const char *refname, unsigned char *sha1,1391 struct strbuf *referent, unsigned int *type)1392{1393 struct strbuf sb_contents = STRBUF_INIT;1394 struct strbuf sb_path = STRBUF_INIT;1395 const char *path;1396 const char *buf;1397 struct stat st;1398 int fd;1399 int ret = -1;1400 int save_errno;14011402 *type = 0;1403 strbuf_reset(&sb_path);1404 strbuf_git_path(&sb_path, "%s", refname);1405 path = sb_path.buf;14061407stat_ref:1408 /*1409 * We might have to loop back here to avoid a race1410 * condition: first we lstat() the file, then we try1411 * to read it as a link or as a file. But if somebody1412 * changes the type of the file (file <-> directory1413 * <-> symlink) between the lstat() and reading, then1414 * we don't want to report that as an error but rather1415 * try again starting with the lstat().1416 */14171418 if (lstat(path, &st) < 0) {1419 if (errno != ENOENT)1420 goto out;1421 if (resolve_missing_loose_ref(refname, sha1, type)) {1422 errno = ENOENT;1423 goto out;1424 }1425 ret = 0;1426 goto out;1427 }14281429 /* Follow "normalized" - ie "refs/.." symlinks by hand */1430 if (S_ISLNK(st.st_mode)) {1431 strbuf_reset(&sb_contents);1432 if (strbuf_readlink(&sb_contents, path, 0) < 0) {1433 if (errno == ENOENT || errno == EINVAL)1434 /* inconsistent with lstat; retry */1435 goto stat_ref;1436 else1437 goto out;1438 }1439 if (starts_with(sb_contents.buf, "refs/") &&1440 !check_refname_format(sb_contents.buf, 0)) {1441 strbuf_swap(&sb_contents, referent);1442 *type |= REF_ISSYMREF;1443 ret = 0;1444 goto out;1445 }1446 }14471448 /* Is it a directory? */1449 if (S_ISDIR(st.st_mode)) {1450 /*1451 * Even though there is a directory where the loose1452 * ref is supposed to be, there could still be a1453 * packed ref:1454 */1455 if (resolve_missing_loose_ref(refname, sha1, type)) {1456 errno = EISDIR;1457 goto out;1458 }1459 ret = 0;1460 goto out;1461 }14621463 /*1464 * Anything else, just open it and try to use it as1465 * a ref1466 */1467 fd = open(path, O_RDONLY);1468 if (fd < 0) {1469 if (errno == ENOENT)1470 /* inconsistent with lstat; retry */1471 goto stat_ref;1472 else1473 goto out;1474 }1475 strbuf_reset(&sb_contents);1476 if (strbuf_read(&sb_contents, fd, 256) < 0) {1477 int save_errno = errno;1478 close(fd);1479 errno = save_errno;1480 goto out;1481 }1482 close(fd);1483 strbuf_rtrim(&sb_contents);1484 buf = sb_contents.buf;1485 if (starts_with(buf, "ref:")) {1486 buf += 4;1487 while (isspace(*buf))1488 buf++;14891490 strbuf_reset(referent);1491 strbuf_addstr(referent, buf);1492 *type |= REF_ISSYMREF;1493 ret = 0;1494 goto out;1495 }14961497 /*1498 * Please note that FETCH_HEAD has additional1499 * data after the sha.1500 */1501 if (get_sha1_hex(buf, sha1) ||1502 (buf[40] != '\0' && !isspace(buf[40]))) {1503 *type |= REF_ISBROKEN;1504 errno = EINVAL;1505 goto out;1506 }15071508 ret = 0;15091510out:1511 save_errno = errno;1512 strbuf_release(&sb_path);1513 strbuf_release(&sb_contents);1514 errno = save_errno;1515 return ret;1516}15171518static void unlock_ref(struct ref_lock *lock)1519{1520 /* Do not free lock->lk -- atexit() still looks at them */1521 if (lock->lk)1522 rollback_lock_file(lock->lk);1523 free(lock->ref_name);1524 free(lock);1525}15261527/*1528 * Lock refname, without following symrefs, and set *lock_p to point1529 * at a newly-allocated lock object. Fill in lock->old_oid, referent,1530 * and type similarly to read_raw_ref().1531 *1532 * The caller must verify that refname is a "safe" reference name (in1533 * the sense of refname_is_safe()) before calling this function.1534 *1535 * If the reference doesn't already exist, verify that refname doesn't1536 * have a D/F conflict with any existing references. extras and skip1537 * are passed to verify_refname_available_dir() for this check.1538 *1539 * If mustexist is not set and the reference is not found or is1540 * broken, lock the reference anyway but clear sha1.1541 *1542 * Return 0 on success. On failure, write an error message to err and1543 * return TRANSACTION_NAME_CONFLICT or TRANSACTION_GENERIC_ERROR.1544 *1545 * Implementation note: This function is basically1546 *1547 * lock reference1548 * read_raw_ref()1549 *1550 * but it includes a lot more code to1551 * - Deal with possible races with other processes1552 * - Avoid calling verify_refname_available_dir() when it can be1553 * avoided, namely if we were successfully able to read the ref1554 * - Generate informative error messages in the case of failure1555 */1556static int lock_raw_ref(const char *refname, int mustexist,1557 const struct string_list *extras,1558 const struct string_list *skip,1559 struct ref_lock **lock_p,1560 struct strbuf *referent,1561 unsigned int *type,1562 struct strbuf *err)1563{1564 struct ref_lock *lock;1565 struct strbuf ref_file = STRBUF_INIT;1566 int attempts_remaining = 3;1567 int ret = TRANSACTION_GENERIC_ERROR;15681569 assert(err);1570 *type = 0;15711572 /* First lock the file so it can't change out from under us. */15731574 *lock_p = lock = xcalloc(1, sizeof(*lock));15751576 lock->ref_name = xstrdup(refname);1577 strbuf_git_path(&ref_file, "%s", refname);15781579retry:1580 switch (safe_create_leading_directories(ref_file.buf)) {1581 case SCLD_OK:1582 break; /* success */1583 case SCLD_EXISTS:1584 /*1585 * Suppose refname is "refs/foo/bar". We just failed1586 * to create the containing directory, "refs/foo",1587 * because there was a non-directory in the way. This1588 * indicates a D/F conflict, probably because of1589 * another reference such as "refs/foo". There is no1590 * reason to expect this error to be transitory.1591 */1592 if (verify_refname_available(refname, extras, skip, err)) {1593 if (mustexist) {1594 /*1595 * To the user the relevant error is1596 * that the "mustexist" reference is1597 * missing:1598 */1599 strbuf_reset(err);1600 strbuf_addf(err, "unable to resolve reference '%s'",1601 refname);1602 } else {1603 /*1604 * The error message set by1605 * verify_refname_available_dir() is OK.1606 */1607 ret = TRANSACTION_NAME_CONFLICT;1608 }1609 } else {1610 /*1611 * The file that is in the way isn't a loose1612 * reference. Report it as a low-level1613 * failure.1614 */1615 strbuf_addf(err, "unable to create lock file %s.lock; "1616 "non-directory in the way",1617 ref_file.buf);1618 }1619 goto error_return;1620 case SCLD_VANISHED:1621 /* Maybe another process was tidying up. Try again. */1622 if (--attempts_remaining > 0)1623 goto retry;1624 /* fall through */1625 default:1626 strbuf_addf(err, "unable to create directory for %s",1627 ref_file.buf);1628 goto error_return;1629 }16301631 if (!lock->lk)1632 lock->lk = xcalloc(1, sizeof(struct lock_file));16331634 if (hold_lock_file_for_update(lock->lk, ref_file.buf, LOCK_NO_DEREF) < 0) {1635 if (errno == ENOENT && --attempts_remaining > 0) {1636 /*1637 * Maybe somebody just deleted one of the1638 * directories leading to ref_file. Try1639 * again:1640 */1641 goto retry;1642 } else {1643 unable_to_lock_message(ref_file.buf, errno, err);1644 goto error_return;1645 }1646 }16471648 /*1649 * Now we hold the lock and can read the reference without1650 * fear that its value will change.1651 */16521653 if (read_raw_ref(refname, lock->old_oid.hash, referent, type)) {1654 if (errno == ENOENT) {1655 if (mustexist) {1656 /* Garden variety missing reference. */1657 strbuf_addf(err, "unable to resolve reference '%s'",1658 refname);1659 goto error_return;1660 } else {1661 /*1662 * Reference is missing, but that's OK. We1663 * know that there is not a conflict with1664 * another loose reference because1665 * (supposing that we are trying to lock1666 * reference "refs/foo/bar"):1667 *1668 * - We were successfully able to create1669 * the lockfile refs/foo/bar.lock, so we1670 * know there cannot be a loose reference1671 * named "refs/foo".1672 *1673 * - We got ENOENT and not EISDIR, so we1674 * know that there cannot be a loose1675 * reference named "refs/foo/bar/baz".1676 */1677 }1678 } else if (errno == EISDIR) {1679 /*1680 * There is a directory in the way. It might have1681 * contained references that have been deleted. If1682 * we don't require that the reference already1683 * exists, try to remove the directory so that it1684 * doesn't cause trouble when we want to rename the1685 * lockfile into place later.1686 */1687 if (mustexist) {1688 /* Garden variety missing reference. */1689 strbuf_addf(err, "unable to resolve reference '%s'",1690 refname);1691 goto error_return;1692 } else if (remove_dir_recursively(&ref_file,1693 REMOVE_DIR_EMPTY_ONLY)) {1694 if (verify_refname_available_dir(1695 refname, extras, skip,1696 get_loose_refs(&ref_cache),1697 err)) {1698 /*1699 * The error message set by1700 * verify_refname_available() is OK.1701 */1702 ret = TRANSACTION_NAME_CONFLICT;1703 goto error_return;1704 } else {1705 /*1706 * We can't delete the directory,1707 * but we also don't know of any1708 * references that it should1709 * contain.1710 */1711 strbuf_addf(err, "there is a non-empty directory '%s' "1712 "blocking reference '%s'",1713 ref_file.buf, refname);1714 goto error_return;1715 }1716 }1717 } else if (errno == EINVAL && (*type & REF_ISBROKEN)) {1718 strbuf_addf(err, "unable to resolve reference '%s': "1719 "reference broken", refname);1720 goto error_return;1721 } else {1722 strbuf_addf(err, "unable to resolve reference '%s': %s",1723 refname, strerror(errno));1724 goto error_return;1725 }17261727 /*1728 * If the ref did not exist and we are creating it,1729 * make sure there is no existing packed ref whose1730 * name begins with our refname, nor a packed ref1731 * whose name is a proper prefix of our refname.1732 */1733 if (verify_refname_available_dir(1734 refname, extras, skip,1735 get_packed_refs(&ref_cache),1736 err)) {1737 goto error_return;1738 }1739 }17401741 ret = 0;1742 goto out;17431744error_return:1745 unlock_ref(lock);1746 *lock_p = NULL;17471748out:1749 strbuf_release(&ref_file);1750 return ret;1751}17521753/*1754 * Peel the entry (if possible) and return its new peel_status. If1755 * repeel is true, re-peel the entry even if there is an old peeled1756 * value that is already stored in it.1757 *1758 * It is OK to call this function with a packed reference entry that1759 * might be stale and might even refer to an object that has since1760 * been garbage-collected. In such a case, if the entry has1761 * REF_KNOWS_PEELED then leave the status unchanged and return1762 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1763 */1764static enum peel_status peel_entry(struct ref_entry *entry, int repeel)1765{1766 enum peel_status status;17671768 if (entry->flag & REF_KNOWS_PEELED) {1769 if (repeel) {1770 entry->flag &= ~REF_KNOWS_PEELED;1771 oidclr(&entry->u.value.peeled);1772 } else {1773 return is_null_oid(&entry->u.value.peeled) ?1774 PEEL_NON_TAG : PEEL_PEELED;1775 }1776 }1777 if (entry->flag & REF_ISBROKEN)1778 return PEEL_BROKEN;1779 if (entry->flag & REF_ISSYMREF)1780 return PEEL_IS_SYMREF;17811782 status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1783 if (status == PEEL_PEELED || status == PEEL_NON_TAG)1784 entry->flag |= REF_KNOWS_PEELED;1785 return status;1786}17871788int peel_ref(const char *refname, unsigned char *sha1)1789{1790 int flag;1791 unsigned char base[20];17921793 if (current_ref && (current_ref->name == refname1794 || !strcmp(current_ref->name, refname))) {1795 if (peel_entry(current_ref, 0))1796 return -1;1797 hashcpy(sha1, current_ref->u.value.peeled.hash);1798 return 0;1799 }18001801 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1802 return -1;18031804 /*1805 * If the reference is packed, read its ref_entry from the1806 * cache in the hope that we already know its peeled value.1807 * We only try this optimization on packed references because1808 * (a) forcing the filling of the loose reference cache could1809 * be expensive and (b) loose references anyway usually do not1810 * have REF_KNOWS_PEELED.1811 */1812 if (flag & REF_ISPACKED) {1813 struct ref_entry *r = get_packed_ref(refname);1814 if (r) {1815 if (peel_entry(r, 0))1816 return -1;1817 hashcpy(sha1, r->u.value.peeled.hash);1818 return 0;1819 }1820 }18211822 return peel_object(base, sha1);1823}18241825/*1826 * Call fn for each reference in the specified ref_cache, omitting1827 * references not in the containing_dir of prefix. Call fn for all1828 * references, including broken ones. If fn ever returns a non-zero1829 * value, stop the iteration and return that value; otherwise, return1830 * 0.1831 */1832static int do_for_each_entry(struct ref_cache *refs, const char *prefix,1833 each_ref_entry_fn fn, void *cb_data)1834{1835 struct packed_ref_cache *packed_ref_cache;1836 struct ref_dir *loose_dir;1837 struct ref_dir *packed_dir;1838 int retval = 0;18391840 /*1841 * We must make sure that all loose refs are read before accessing the1842 * packed-refs file; this avoids a race condition in which loose refs1843 * are migrated to the packed-refs file by a simultaneous process, but1844 * our in-memory view is from before the migration. get_packed_ref_cache()1845 * takes care of making sure our view is up to date with what is on1846 * disk.1847 */1848 loose_dir = get_loose_refs(refs);1849 if (prefix && *prefix) {1850 loose_dir = find_containing_dir(loose_dir, prefix, 0);1851 }1852 if (loose_dir)1853 prime_ref_dir(loose_dir);18541855 packed_ref_cache = get_packed_ref_cache(refs);1856 acquire_packed_ref_cache(packed_ref_cache);1857 packed_dir = get_packed_ref_dir(packed_ref_cache);1858 if (prefix && *prefix) {1859 packed_dir = find_containing_dir(packed_dir, prefix, 0);1860 }18611862 if (packed_dir && loose_dir) {1863 sort_ref_dir(packed_dir);1864 sort_ref_dir(loose_dir);1865 retval = do_for_each_entry_in_dirs(1866 packed_dir, loose_dir, fn, cb_data);1867 } else if (packed_dir) {1868 sort_ref_dir(packed_dir);1869 retval = do_for_each_entry_in_dir(1870 packed_dir, 0, fn, cb_data);1871 } else if (loose_dir) {1872 sort_ref_dir(loose_dir);1873 retval = do_for_each_entry_in_dir(1874 loose_dir, 0, fn, cb_data);1875 }18761877 release_packed_ref_cache(packed_ref_cache);1878 return retval;1879}18801881int do_for_each_ref(const char *submodule, const char *prefix,1882 each_ref_fn fn, int trim, int flags, void *cb_data)1883{1884 struct ref_entry_cb data;1885 struct ref_cache *refs;18861887 refs = get_ref_cache(submodule);1888 data.prefix = prefix;1889 data.trim = trim;1890 data.flags = flags;1891 data.fn = fn;1892 data.cb_data = cb_data;18931894 if (ref_paranoia < 0)1895 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);1896 if (ref_paranoia)1897 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;18981899 return do_for_each_entry(refs, prefix, do_one_ref, &data);1900}19011902/*1903 * Verify that the reference locked by lock has the value old_sha1.1904 * Fail if the reference doesn't exist and mustexist is set. Return 01905 * on success. On error, write an error message to err, set errno, and1906 * return a negative value.1907 */1908static int verify_lock(struct ref_lock *lock,1909 const unsigned char *old_sha1, int mustexist,1910 struct strbuf *err)1911{1912 assert(err);19131914 if (read_ref_full(lock->ref_name,1915 mustexist ? RESOLVE_REF_READING : 0,1916 lock->old_oid.hash, NULL)) {1917 if (old_sha1) {1918 int save_errno = errno;1919 strbuf_addf(err, "can't verify ref '%s'", lock->ref_name);1920 errno = save_errno;1921 return -1;1922 } else {1923 hashclr(lock->old_oid.hash);1924 return 0;1925 }1926 }1927 if (old_sha1 && hashcmp(lock->old_oid.hash, old_sha1)) {1928 strbuf_addf(err, "ref '%s' is at %s but expected %s",1929 lock->ref_name,1930 sha1_to_hex(lock->old_oid.hash),1931 sha1_to_hex(old_sha1));1932 errno = EBUSY;1933 return -1;1934 }1935 return 0;1936}19371938static int remove_empty_directories(struct strbuf *path)1939{1940 /*1941 * we want to create a file but there is a directory there;1942 * if that is an empty directory (or a directory that contains1943 * only empty directories), remove them.1944 */1945 return remove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);1946}19471948/*1949 * Locks a ref returning the lock on success and NULL on failure.1950 * On failure errno is set to something meaningful.1951 */1952static struct ref_lock *lock_ref_sha1_basic(const char *refname,1953 const unsigned char *old_sha1,1954 const struct string_list *extras,1955 const struct string_list *skip,1956 unsigned int flags, int *type,1957 struct strbuf *err)1958{1959 struct strbuf ref_file = STRBUF_INIT;1960 struct ref_lock *lock;1961 int last_errno = 0;1962 int lflags = LOCK_NO_DEREF;1963 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));1964 int resolve_flags = RESOLVE_REF_NO_RECURSE;1965 int attempts_remaining = 3;1966 int resolved;19671968 assert(err);19691970 lock = xcalloc(1, sizeof(struct ref_lock));19711972 if (mustexist)1973 resolve_flags |= RESOLVE_REF_READING;1974 if (flags & REF_DELETING)1975 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;19761977 strbuf_git_path(&ref_file, "%s", refname);1978 resolved = !!resolve_ref_unsafe(refname, resolve_flags,1979 lock->old_oid.hash, type);1980 if (!resolved && errno == EISDIR) {1981 /*1982 * we are trying to lock foo but we used to1983 * have foo/bar which now does not exist;1984 * it is normal for the empty directory 'foo'1985 * to remain.1986 */1987 if (remove_empty_directories(&ref_file)) {1988 last_errno = errno;1989 if (!verify_refname_available_dir(refname, extras, skip,1990 get_loose_refs(&ref_cache), err))1991 strbuf_addf(err, "there are still refs under '%s'",1992 refname);1993 goto error_return;1994 }1995 resolved = !!resolve_ref_unsafe(refname, resolve_flags,1996 lock->old_oid.hash, type);1997 }1998 if (!resolved) {1999 last_errno = errno;2000 if (last_errno != ENOTDIR ||2001 !verify_refname_available_dir(refname, extras, skip,2002 get_loose_refs(&ref_cache), err))2003 strbuf_addf(err, "unable to resolve reference '%s': %s",2004 refname, strerror(last_errno));20052006 goto error_return;2007 }20082009 /*2010 * If the ref did not exist and we are creating it, make sure2011 * there is no existing packed ref whose name begins with our2012 * refname, nor a packed ref whose name is a proper prefix of2013 * our refname.2014 */2015 if (is_null_oid(&lock->old_oid) &&2016 verify_refname_available_dir(refname, extras, skip,2017 get_packed_refs(&ref_cache), err)) {2018 last_errno = ENOTDIR;2019 goto error_return;2020 }20212022 lock->lk = xcalloc(1, sizeof(struct lock_file));20232024 lock->ref_name = xstrdup(refname);20252026 retry:2027 switch (safe_create_leading_directories_const(ref_file.buf)) {2028 case SCLD_OK:2029 break; /* success */2030 case SCLD_VANISHED:2031 if (--attempts_remaining > 0)2032 goto retry;2033 /* fall through */2034 default:2035 last_errno = errno;2036 strbuf_addf(err, "unable to create directory for '%s'",2037 ref_file.buf);2038 goto error_return;2039 }20402041 if (hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) < 0) {2042 last_errno = errno;2043 if (errno == ENOENT && --attempts_remaining > 0)2044 /*2045 * Maybe somebody just deleted one of the2046 * directories leading to ref_file. Try2047 * again:2048 */2049 goto retry;2050 else {2051 unable_to_lock_message(ref_file.buf, errno, err);2052 goto error_return;2053 }2054 }2055 if (verify_lock(lock, old_sha1, mustexist, err)) {2056 last_errno = errno;2057 goto error_return;2058 }2059 goto out;20602061 error_return:2062 unlock_ref(lock);2063 lock = NULL;20642065 out:2066 strbuf_release(&ref_file);2067 errno = last_errno;2068 return lock;2069}20702071/*2072 * Write an entry to the packed-refs file for the specified refname.2073 * If peeled is non-NULL, write it as the entry's peeled value.2074 */2075static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,2076 unsigned char *peeled)2077{2078 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);2079 if (peeled)2080 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));2081}20822083/*2084 * An each_ref_entry_fn that writes the entry to a packed-refs file.2085 */2086static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)2087{2088 enum peel_status peel_status = peel_entry(entry, 0);20892090 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2091 error("internal error: %s is not a valid packed reference!",2092 entry->name);2093 write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2094 peel_status == PEEL_PEELED ?2095 entry->u.value.peeled.hash : NULL);2096 return 0;2097}20982099/*2100 * Lock the packed-refs file for writing. Flags is passed to2101 * hold_lock_file_for_update(). Return 0 on success. On errors, set2102 * errno appropriately and return a nonzero value.2103 */2104static int lock_packed_refs(int flags)2105{2106 static int timeout_configured = 0;2107 static int timeout_value = 1000;21082109 struct packed_ref_cache *packed_ref_cache;21102111 if (!timeout_configured) {2112 git_config_get_int("core.packedrefstimeout", &timeout_value);2113 timeout_configured = 1;2114 }21152116 if (hold_lock_file_for_update_timeout(2117 &packlock, git_path("packed-refs"),2118 flags, timeout_value) < 0)2119 return -1;2120 /*2121 * Get the current packed-refs while holding the lock. If the2122 * packed-refs file has been modified since we last read it,2123 * this will automatically invalidate the cache and re-read2124 * the packed-refs file.2125 */2126 packed_ref_cache = get_packed_ref_cache(&ref_cache);2127 packed_ref_cache->lock = &packlock;2128 /* Increment the reference count to prevent it from being freed: */2129 acquire_packed_ref_cache(packed_ref_cache);2130 return 0;2131}21322133/*2134 * Write the current version of the packed refs cache from memory to2135 * disk. The packed-refs file must already be locked for writing (see2136 * lock_packed_refs()). Return zero on success. On errors, set errno2137 * and return a nonzero value2138 */2139static int commit_packed_refs(void)2140{2141 struct packed_ref_cache *packed_ref_cache =2142 get_packed_ref_cache(&ref_cache);2143 int error = 0;2144 int save_errno = 0;2145 FILE *out;21462147 if (!packed_ref_cache->lock)2148 die("internal error: packed-refs not locked");21492150 out = fdopen_lock_file(packed_ref_cache->lock, "w");2151 if (!out)2152 die_errno("unable to fdopen packed-refs descriptor");21532154 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);2155 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),2156 0, write_packed_entry_fn, out);21572158 if (commit_lock_file(packed_ref_cache->lock)) {2159 save_errno = errno;2160 error = -1;2161 }2162 packed_ref_cache->lock = NULL;2163 release_packed_ref_cache(packed_ref_cache);2164 errno = save_errno;2165 return error;2166}21672168/*2169 * Rollback the lockfile for the packed-refs file, and discard the2170 * in-memory packed reference cache. (The packed-refs file will be2171 * read anew if it is needed again after this function is called.)2172 */2173static void rollback_packed_refs(void)2174{2175 struct packed_ref_cache *packed_ref_cache =2176 get_packed_ref_cache(&ref_cache);21772178 if (!packed_ref_cache->lock)2179 die("internal error: packed-refs not locked");2180 rollback_lock_file(packed_ref_cache->lock);2181 packed_ref_cache->lock = NULL;2182 release_packed_ref_cache(packed_ref_cache);2183 clear_packed_ref_cache(&ref_cache);2184}21852186struct ref_to_prune {2187 struct ref_to_prune *next;2188 unsigned char sha1[20];2189 char name[FLEX_ARRAY];2190};21912192struct pack_refs_cb_data {2193 unsigned int flags;2194 struct ref_dir *packed_refs;2195 struct ref_to_prune *ref_to_prune;2196};21972198/*2199 * An each_ref_entry_fn that is run over loose references only. If2200 * the loose reference can be packed, add an entry in the packed ref2201 * cache. If the reference should be pruned, also add it to2202 * ref_to_prune in the pack_refs_cb_data.2203 */2204static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)2205{2206 struct pack_refs_cb_data *cb = cb_data;2207 enum peel_status peel_status;2208 struct ref_entry *packed_entry;2209 int is_tag_ref = starts_with(entry->name, "refs/tags/");22102211 /* Do not pack per-worktree refs: */2212 if (ref_type(entry->name) != REF_TYPE_NORMAL)2213 return 0;22142215 /* ALWAYS pack tags */2216 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2217 return 0;22182219 /* Do not pack symbolic or broken refs: */2220 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2221 return 0;22222223 /* Add a packed ref cache entry equivalent to the loose entry. */2224 peel_status = peel_entry(entry, 1);2225 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2226 die("internal error peeling reference %s (%s)",2227 entry->name, oid_to_hex(&entry->u.value.oid));2228 packed_entry = find_ref(cb->packed_refs, entry->name);2229 if (packed_entry) {2230 /* Overwrite existing packed entry with info from loose entry */2231 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2232 oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2233 } else {2234 packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,2235 REF_ISPACKED | REF_KNOWS_PEELED, 0);2236 add_ref(cb->packed_refs, packed_entry);2237 }2238 oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);22392240 /* Schedule the loose reference for pruning if requested. */2241 if ((cb->flags & PACK_REFS_PRUNE)) {2242 struct ref_to_prune *n;2243 FLEX_ALLOC_STR(n, name, entry->name);2244 hashcpy(n->sha1, entry->u.value.oid.hash);2245 n->next = cb->ref_to_prune;2246 cb->ref_to_prune = n;2247 }2248 return 0;2249}22502251/*2252 * Remove empty parents, but spare refs/ and immediate subdirs.2253 * Note: munges *name.2254 */2255static void try_remove_empty_parents(char *name)2256{2257 char *p, *q;2258 int i;2259 p = name;2260 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */2261 while (*p && *p != '/')2262 p++;2263 /* tolerate duplicate slashes; see check_refname_format() */2264 while (*p == '/')2265 p++;2266 }2267 for (q = p; *q; q++)2268 ;2269 while (1) {2270 while (q > p && *q != '/')2271 q--;2272 while (q > p && *(q-1) == '/')2273 q--;2274 if (q == p)2275 break;2276 *q = '\0';2277 if (rmdir(git_path("%s", name)))2278 break;2279 }2280}22812282/* make sure nobody touched the ref, and unlink */2283static void prune_ref(struct ref_to_prune *r)2284{2285 struct ref_transaction *transaction;2286 struct strbuf err = STRBUF_INIT;22872288 if (check_refname_format(r->name, 0))2289 return;22902291 transaction = ref_transaction_begin(&err);2292 if (!transaction ||2293 ref_transaction_delete(transaction, r->name, r->sha1,2294 REF_ISPRUNING | REF_NODEREF, NULL, &err) ||2295 ref_transaction_commit(transaction, &err)) {2296 ref_transaction_free(transaction);2297 error("%s", err.buf);2298 strbuf_release(&err);2299 return;2300 }2301 ref_transaction_free(transaction);2302 strbuf_release(&err);2303 try_remove_empty_parents(r->name);2304}23052306static void prune_refs(struct ref_to_prune *r)2307{2308 while (r) {2309 prune_ref(r);2310 r = r->next;2311 }2312}23132314int pack_refs(unsigned int flags)2315{2316 struct pack_refs_cb_data cbdata;23172318 memset(&cbdata, 0, sizeof(cbdata));2319 cbdata.flags = flags;23202321 lock_packed_refs(LOCK_DIE_ON_ERROR);2322 cbdata.packed_refs = get_packed_refs(&ref_cache);23232324 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,2325 pack_if_possible_fn, &cbdata);23262327 if (commit_packed_refs())2328 die_errno("unable to overwrite old ref-pack file");23292330 prune_refs(cbdata.ref_to_prune);2331 return 0;2332}23332334/*2335 * Rewrite the packed-refs file, omitting any refs listed in2336 * 'refnames'. On error, leave packed-refs unchanged, write an error2337 * message to 'err', and return a nonzero value.2338 *2339 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2340 */2341static int repack_without_refs(struct string_list *refnames, struct strbuf *err)2342{2343 struct ref_dir *packed;2344 struct string_list_item *refname;2345 int ret, needs_repacking = 0, removed = 0;23462347 assert(err);23482349 /* Look for a packed ref */2350 for_each_string_list_item(refname, refnames) {2351 if (get_packed_ref(refname->string)) {2352 needs_repacking = 1;2353 break;2354 }2355 }23562357 /* Avoid locking if we have nothing to do */2358 if (!needs_repacking)2359 return 0; /* no refname exists in packed refs */23602361 if (lock_packed_refs(0)) {2362 unable_to_lock_message(git_path("packed-refs"), errno, err);2363 return -1;2364 }2365 packed = get_packed_refs(&ref_cache);23662367 /* Remove refnames from the cache */2368 for_each_string_list_item(refname, refnames)2369 if (remove_entry(packed, refname->string) != -1)2370 removed = 1;2371 if (!removed) {2372 /*2373 * All packed entries disappeared while we were2374 * acquiring the lock.2375 */2376 rollback_packed_refs();2377 return 0;2378 }23792380 /* Write what remains */2381 ret = commit_packed_refs();2382 if (ret)2383 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",2384 strerror(errno));2385 return ret;2386}23872388static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)2389{2390 assert(err);23912392 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2393 /*2394 * loose. The loose file name is the same as the2395 * lockfile name, minus ".lock":2396 */2397 char *loose_filename = get_locked_file_path(lock->lk);2398 int res = unlink_or_msg(loose_filename, err);2399 free(loose_filename);2400 if (res)2401 return 1;2402 }2403 return 0;2404}24052406int delete_refs(struct string_list *refnames, unsigned int flags)2407{2408 struct strbuf err = STRBUF_INIT;2409 int i, result = 0;24102411 if (!refnames->nr)2412 return 0;24132414 result = repack_without_refs(refnames, &err);2415 if (result) {2416 /*2417 * If we failed to rewrite the packed-refs file, then2418 * it is unsafe to try to remove loose refs, because2419 * doing so might expose an obsolete packed value for2420 * a reference that might even point at an object that2421 * has been garbage collected.2422 */2423 if (refnames->nr == 1)2424 error(_("could not delete reference %s: %s"),2425 refnames->items[0].string, err.buf);2426 else2427 error(_("could not delete references: %s"), err.buf);24282429 goto out;2430 }24312432 for (i = 0; i < refnames->nr; i++) {2433 const char *refname = refnames->items[i].string;24342435 if (delete_ref(refname, NULL, flags))2436 result |= error(_("could not remove reference %s"), refname);2437 }24382439out:2440 strbuf_release(&err);2441 return result;2442}24432444/*2445 * People using contrib's git-new-workdir have .git/logs/refs ->2446 * /some/other/path/.git/logs/refs, and that may live on another device.2447 *2448 * IOW, to avoid cross device rename errors, the temporary renamed log must2449 * live into logs/refs.2450 */2451#define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"24522453static int rename_tmp_log(const char *newrefname)2454{2455 int attempts_remaining = 4;2456 struct strbuf path = STRBUF_INIT;2457 int ret = -1;24582459 retry:2460 strbuf_reset(&path);2461 strbuf_git_path(&path, "logs/%s", newrefname);2462 switch (safe_create_leading_directories_const(path.buf)) {2463 case SCLD_OK:2464 break; /* success */2465 case SCLD_VANISHED:2466 if (--attempts_remaining > 0)2467 goto retry;2468 /* fall through */2469 default:2470 error("unable to create directory for %s", newrefname);2471 goto out;2472 }24732474 if (rename(git_path(TMP_RENAMED_LOG), path.buf)) {2475 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {2476 /*2477 * rename(a, b) when b is an existing2478 * directory ought to result in ISDIR, but2479 * Solaris 5.8 gives ENOTDIR. Sheesh.2480 */2481 if (remove_empty_directories(&path)) {2482 error("Directory not empty: logs/%s", newrefname);2483 goto out;2484 }2485 goto retry;2486 } else if (errno == ENOENT && --attempts_remaining > 0) {2487 /*2488 * Maybe another process just deleted one of2489 * the directories in the path to newrefname.2490 * Try again from the beginning.2491 */2492 goto retry;2493 } else {2494 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",2495 newrefname, strerror(errno));2496 goto out;2497 }2498 }2499 ret = 0;2500out:2501 strbuf_release(&path);2502 return ret;2503}25042505int verify_refname_available(const char *newname,2506 const struct string_list *extras,2507 const struct string_list *skip,2508 struct strbuf *err)2509{2510 struct ref_dir *packed_refs = get_packed_refs(&ref_cache);2511 struct ref_dir *loose_refs = get_loose_refs(&ref_cache);25122513 if (verify_refname_available_dir(newname, extras, skip,2514 packed_refs, err) ||2515 verify_refname_available_dir(newname, extras, skip,2516 loose_refs, err))2517 return -1;25182519 return 0;2520}25212522static int write_ref_to_lockfile(struct ref_lock *lock,2523 const unsigned char *sha1, struct strbuf *err);2524static int commit_ref_update(struct ref_lock *lock,2525 const unsigned char *sha1, const char *logmsg,2526 struct strbuf *err);25272528int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)2529{2530 unsigned char sha1[20], orig_sha1[20];2531 int flag = 0, logmoved = 0;2532 struct ref_lock *lock;2533 struct stat loginfo;2534 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2535 struct strbuf err = STRBUF_INIT;25362537 if (log && S_ISLNK(loginfo.st_mode))2538 return error("reflog for %s is a symlink", oldrefname);25392540 if (!resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2541 orig_sha1, &flag))2542 return error("refname %s not found", oldrefname);25432544 if (flag & REF_ISSYMREF)2545 return error("refname %s is a symbolic ref, renaming it is not supported",2546 oldrefname);2547 if (!rename_ref_available(oldrefname, newrefname))2548 return 1;25492550 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))2551 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",2552 oldrefname, strerror(errno));25532554 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2555 error("unable to delete old %s", oldrefname);2556 goto rollback;2557 }25582559 /*2560 * Since we are doing a shallow lookup, sha1 is not the2561 * correct value to pass to delete_ref as old_sha1. But that2562 * doesn't matter, because an old_sha1 check wouldn't add to2563 * the safety anyway; we want to delete the reference whatever2564 * its current value.2565 */2566 if (!read_ref_full(newrefname, RESOLVE_REF_READING | RESOLVE_REF_NO_RECURSE,2567 sha1, NULL) &&2568 delete_ref(newrefname, NULL, REF_NODEREF)) {2569 if (errno==EISDIR) {2570 struct strbuf path = STRBUF_INIT;2571 int result;25722573 strbuf_git_path(&path, "%s", newrefname);2574 result = remove_empty_directories(&path);2575 strbuf_release(&path);25762577 if (result) {2578 error("Directory not empty: %s", newrefname);2579 goto rollback;2580 }2581 } else {2582 error("unable to delete existing %s", newrefname);2583 goto rollback;2584 }2585 }25862587 if (log && rename_tmp_log(newrefname))2588 goto rollback;25892590 logmoved = log;25912592 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, REF_NODEREF,2593 NULL, &err);2594 if (!lock) {2595 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);2596 strbuf_release(&err);2597 goto rollback;2598 }2599 hashcpy(lock->old_oid.hash, orig_sha1);26002601 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||2602 commit_ref_update(lock, orig_sha1, logmsg, &err)) {2603 error("unable to write current sha1 into %s: %s", newrefname, err.buf);2604 strbuf_release(&err);2605 goto rollback;2606 }26072608 return 0;26092610 rollback:2611 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, REF_NODEREF,2612 NULL, &err);2613 if (!lock) {2614 error("unable to lock %s for rollback: %s", oldrefname, err.buf);2615 strbuf_release(&err);2616 goto rollbacklog;2617 }26182619 flag = log_all_ref_updates;2620 log_all_ref_updates = 0;2621 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||2622 commit_ref_update(lock, orig_sha1, NULL, &err)) {2623 error("unable to write current sha1 into %s: %s", oldrefname, err.buf);2624 strbuf_release(&err);2625 }2626 log_all_ref_updates = flag;26272628 rollbacklog:2629 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))2630 error("unable to restore logfile %s from %s: %s",2631 oldrefname, newrefname, strerror(errno));2632 if (!logmoved && log &&2633 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))2634 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",2635 oldrefname, strerror(errno));26362637 return 1;2638}26392640static int close_ref(struct ref_lock *lock)2641{2642 if (close_lock_file(lock->lk))2643 return -1;2644 return 0;2645}26462647static int commit_ref(struct ref_lock *lock)2648{2649 char *path = get_locked_file_path(lock->lk);2650 struct stat st;26512652 if (!lstat(path, &st) && S_ISDIR(st.st_mode)) {2653 /*2654 * There is a directory at the path we want to rename2655 * the lockfile to. Hopefully it is empty; try to2656 * delete it.2657 */2658 size_t len = strlen(path);2659 struct strbuf sb_path = STRBUF_INIT;26602661 strbuf_attach(&sb_path, path, len, len);26622663 /*2664 * If this fails, commit_lock_file() will also fail2665 * and will report the problem.2666 */2667 remove_empty_directories(&sb_path);2668 strbuf_release(&sb_path);2669 } else {2670 free(path);2671 }26722673 if (commit_lock_file(lock->lk))2674 return -1;2675 return 0;2676}26772678/*2679 * Create a reflog for a ref. If force_create = 0, the reflog will2680 * only be created for certain refs (those for which2681 * should_autocreate_reflog returns non-zero. Otherwise, create it2682 * regardless of the ref name. Fill in *err and return -1 on failure.2683 */2684static int log_ref_setup(const char *refname, struct strbuf *logfile, struct strbuf *err, int force_create)2685{2686 int logfd, oflags = O_APPEND | O_WRONLY;26872688 strbuf_git_path(logfile, "logs/%s", refname);2689 if (force_create || should_autocreate_reflog(refname)) {2690 if (safe_create_leading_directories(logfile->buf) < 0) {2691 strbuf_addf(err, "unable to create directory for '%s': "2692 "%s", logfile->buf, strerror(errno));2693 return -1;2694 }2695 oflags |= O_CREAT;2696 }26972698 logfd = open(logfile->buf, oflags, 0666);2699 if (logfd < 0) {2700 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2701 return 0;27022703 if (errno == EISDIR) {2704 if (remove_empty_directories(logfile)) {2705 strbuf_addf(err, "there are still logs under "2706 "'%s'", logfile->buf);2707 return -1;2708 }2709 logfd = open(logfile->buf, oflags, 0666);2710 }27112712 if (logfd < 0) {2713 strbuf_addf(err, "unable to append to '%s': %s",2714 logfile->buf, strerror(errno));2715 return -1;2716 }2717 }27182719 adjust_shared_perm(logfile->buf);2720 close(logfd);2721 return 0;2722}272327242725int safe_create_reflog(const char *refname, int force_create, struct strbuf *err)2726{2727 int ret;2728 struct strbuf sb = STRBUF_INIT;27292730 ret = log_ref_setup(refname, &sb, err, force_create);2731 strbuf_release(&sb);2732 return ret;2733}27342735static int log_ref_write_fd(int fd, const unsigned char *old_sha1,2736 const unsigned char *new_sha1,2737 const char *committer, const char *msg)2738{2739 int msglen, written;2740 unsigned maxlen, len;2741 char *logrec;27422743 msglen = msg ? strlen(msg) : 0;2744 maxlen = strlen(committer) + msglen + 100;2745 logrec = xmalloc(maxlen);2746 len = xsnprintf(logrec, maxlen, "%s %s %s\n",2747 sha1_to_hex(old_sha1),2748 sha1_to_hex(new_sha1),2749 committer);2750 if (msglen)2751 len += copy_reflog_msg(logrec + len - 1, msg) - 1;27522753 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;2754 free(logrec);2755 if (written != len)2756 return -1;27572758 return 0;2759}27602761static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,2762 const unsigned char *new_sha1, const char *msg,2763 struct strbuf *logfile, int flags,2764 struct strbuf *err)2765{2766 int logfd, result, oflags = O_APPEND | O_WRONLY;27672768 if (log_all_ref_updates < 0)2769 log_all_ref_updates = !is_bare_repository();27702771 result = log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);27722773 if (result)2774 return result;27752776 logfd = open(logfile->buf, oflags);2777 if (logfd < 0)2778 return 0;2779 result = log_ref_write_fd(logfd, old_sha1, new_sha1,2780 git_committer_info(0), msg);2781 if (result) {2782 strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,2783 strerror(errno));2784 close(logfd);2785 return -1;2786 }2787 if (close(logfd)) {2788 strbuf_addf(err, "unable to append to '%s': %s", logfile->buf,2789 strerror(errno));2790 return -1;2791 }2792 return 0;2793}27942795static int log_ref_write(const char *refname, const unsigned char *old_sha1,2796 const unsigned char *new_sha1, const char *msg,2797 int flags, struct strbuf *err)2798{2799 return files_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2800 err);2801}28022803int files_log_ref_write(const char *refname, const unsigned char *old_sha1,2804 const unsigned char *new_sha1, const char *msg,2805 int flags, struct strbuf *err)2806{2807 struct strbuf sb = STRBUF_INIT;2808 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2809 err);2810 strbuf_release(&sb);2811 return ret;2812}28132814/*2815 * Write sha1 into the open lockfile, then close the lockfile. On2816 * errors, rollback the lockfile, fill in *err and2817 * return -1.2818 */2819static int write_ref_to_lockfile(struct ref_lock *lock,2820 const unsigned char *sha1, struct strbuf *err)2821{2822 static char term = '\n';2823 struct object *o;2824 int fd;28252826 o = parse_object(sha1);2827 if (!o) {2828 strbuf_addf(err,2829 "trying to write ref '%s' with nonexistent object %s",2830 lock->ref_name, sha1_to_hex(sha1));2831 unlock_ref(lock);2832 return -1;2833 }2834 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {2835 strbuf_addf(err,2836 "trying to write non-commit object %s to branch '%s'",2837 sha1_to_hex(sha1), lock->ref_name);2838 unlock_ref(lock);2839 return -1;2840 }2841 fd = get_lock_file_fd(lock->lk);2842 if (write_in_full(fd, sha1_to_hex(sha1), 40) != 40 ||2843 write_in_full(fd, &term, 1) != 1 ||2844 close_ref(lock) < 0) {2845 strbuf_addf(err,2846 "couldn't write '%s'", get_lock_file_path(lock->lk));2847 unlock_ref(lock);2848 return -1;2849 }2850 return 0;2851}28522853/*2854 * Commit a change to a loose reference that has already been written2855 * to the loose reference lockfile. Also update the reflogs if2856 * necessary, using the specified lockmsg (which can be NULL).2857 */2858static int commit_ref_update(struct ref_lock *lock,2859 const unsigned char *sha1, const char *logmsg,2860 struct strbuf *err)2861{2862 clear_loose_ref_cache(&ref_cache);2863 if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, 0, err)) {2864 char *old_msg = strbuf_detach(err, NULL);2865 strbuf_addf(err, "cannot update the ref '%s': %s",2866 lock->ref_name, old_msg);2867 free(old_msg);2868 unlock_ref(lock);2869 return -1;2870 }28712872 if (strcmp(lock->ref_name, "HEAD") != 0) {2873 /*2874 * Special hack: If a branch is updated directly and HEAD2875 * points to it (may happen on the remote side of a push2876 * for example) then logically the HEAD reflog should be2877 * updated too.2878 * A generic solution implies reverse symref information,2879 * but finding all symrefs pointing to the given branch2880 * would be rather costly for this rare event (the direct2881 * update of a branch) to be worth it. So let's cheat and2882 * check with HEAD only which should cover 99% of all usage2883 * scenarios (even 100% of the default ones).2884 */2885 unsigned char head_sha1[20];2886 int head_flag;2887 const char *head_ref;28882889 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,2890 head_sha1, &head_flag);2891 if (head_ref && (head_flag & REF_ISSYMREF) &&2892 !strcmp(head_ref, lock->ref_name)) {2893 struct strbuf log_err = STRBUF_INIT;2894 if (log_ref_write("HEAD", lock->old_oid.hash, sha1,2895 logmsg, 0, &log_err)) {2896 error("%s", log_err.buf);2897 strbuf_release(&log_err);2898 }2899 }2900 }29012902 if (commit_ref(lock)) {2903 strbuf_addf(err, "couldn't set '%s'", lock->ref_name);2904 unlock_ref(lock);2905 return -1;2906 }29072908 unlock_ref(lock);2909 return 0;2910}29112912static int create_ref_symlink(struct ref_lock *lock, const char *target)2913{2914 int ret = -1;2915#ifndef NO_SYMLINK_HEAD2916 char *ref_path = get_locked_file_path(lock->lk);2917 unlink(ref_path);2918 ret = symlink(target, ref_path);2919 free(ref_path);29202921 if (ret)2922 fprintf(stderr, "no symlink - falling back to symbolic ref\n");2923#endif2924 return ret;2925}29262927static void update_symref_reflog(struct ref_lock *lock, const char *refname,2928 const char *target, const char *logmsg)2929{2930 struct strbuf err = STRBUF_INIT;2931 unsigned char new_sha1[20];2932 if (logmsg && !read_ref(target, new_sha1) &&2933 log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg, 0, &err)) {2934 error("%s", err.buf);2935 strbuf_release(&err);2936 }2937}29382939static int create_symref_locked(struct ref_lock *lock, const char *refname,2940 const char *target, const char *logmsg)2941{2942 if (prefer_symlink_refs && !create_ref_symlink(lock, target)) {2943 update_symref_reflog(lock, refname, target, logmsg);2944 return 0;2945 }29462947 if (!fdopen_lock_file(lock->lk, "w"))2948 return error("unable to fdopen %s: %s",2949 lock->lk->tempfile.filename.buf, strerror(errno));29502951 update_symref_reflog(lock, refname, target, logmsg);29522953 /* no error check; commit_ref will check ferror */2954 fprintf(lock->lk->tempfile.fp, "ref: %s\n", target);2955 if (commit_ref(lock) < 0)2956 return error("unable to write symref for %s: %s", refname,2957 strerror(errno));2958 return 0;2959}29602961int create_symref(const char *refname, const char *target, const char *logmsg)2962{2963 struct strbuf err = STRBUF_INIT;2964 struct ref_lock *lock;2965 int ret;29662967 lock = lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,2968 &err);2969 if (!lock) {2970 error("%s", err.buf);2971 strbuf_release(&err);2972 return -1;2973 }29742975 ret = create_symref_locked(lock, refname, target, logmsg);2976 unlock_ref(lock);2977 return ret;2978}29792980int set_worktree_head_symref(const char *gitdir, const char *target)2981{2982 static struct lock_file head_lock;2983 struct ref_lock *lock;2984 struct strbuf head_path = STRBUF_INIT;2985 const char *head_rel;2986 int ret;29872988 strbuf_addf(&head_path, "%s/HEAD", absolute_path(gitdir));2989 if (hold_lock_file_for_update(&head_lock, head_path.buf,2990 LOCK_NO_DEREF) < 0) {2991 struct strbuf err = STRBUF_INIT;2992 unable_to_lock_message(head_path.buf, errno, &err);2993 error("%s", err.buf);2994 strbuf_release(&err);2995 strbuf_release(&head_path);2996 return -1;2997 }29982999 /* head_rel will be "HEAD" for the main tree, "worktrees/wt/HEAD" for3000 linked trees */3001 head_rel = remove_leading_path(head_path.buf,3002 absolute_path(get_git_common_dir()));3003 /* to make use of create_symref_locked(), initialize ref_lock */3004 lock = xcalloc(1, sizeof(struct ref_lock));3005 lock->lk = &head_lock;3006 lock->ref_name = xstrdup(head_rel);30073008 ret = create_symref_locked(lock, head_rel, target, NULL);30093010 unlock_ref(lock); /* will free lock */3011 strbuf_release(&head_path);3012 return ret;3013}30143015int reflog_exists(const char *refname)3016{3017 struct stat st;30183019 return !lstat(git_path("logs/%s", refname), &st) &&3020 S_ISREG(st.st_mode);3021}30223023int delete_reflog(const char *refname)3024{3025 return remove_path(git_path("logs/%s", refname));3026}30273028static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)3029{3030 unsigned char osha1[20], nsha1[20];3031 char *email_end, *message;3032 unsigned long timestamp;3033 int tz;30343035 /* old SP new SP name <email> SP time TAB msg LF */3036 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||3037 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||3038 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||3039 !(email_end = strchr(sb->buf + 82, '>')) ||3040 email_end[1] != ' ' ||3041 !(timestamp = strtoul(email_end + 2, &message, 10)) ||3042 !message || message[0] != ' ' ||3043 (message[1] != '+' && message[1] != '-') ||3044 !isdigit(message[2]) || !isdigit(message[3]) ||3045 !isdigit(message[4]) || !isdigit(message[5]))3046 return 0; /* corrupt? */3047 email_end[1] = '\0';3048 tz = strtol(message + 1, NULL, 10);3049 if (message[6] != '\t')3050 message += 6;3051 else3052 message += 7;3053 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);3054}30553056static char *find_beginning_of_line(char *bob, char *scan)3057{3058 while (bob < scan && *(--scan) != '\n')3059 ; /* keep scanning backwards */3060 /*3061 * Return either beginning of the buffer, or LF at the end of3062 * the previous line.3063 */3064 return scan;3065}30663067int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)3068{3069 struct strbuf sb = STRBUF_INIT;3070 FILE *logfp;3071 long pos;3072 int ret = 0, at_tail = 1;30733074 logfp = fopen(git_path("logs/%s", refname), "r");3075 if (!logfp)3076 return -1;30773078 /* Jump to the end */3079 if (fseek(logfp, 0, SEEK_END) < 0)3080 return error("cannot seek back reflog for %s: %s",3081 refname, strerror(errno));3082 pos = ftell(logfp);3083 while (!ret && 0 < pos) {3084 int cnt;3085 size_t nread;3086 char buf[BUFSIZ];3087 char *endp, *scanp;30883089 /* Fill next block from the end */3090 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;3091 if (fseek(logfp, pos - cnt, SEEK_SET))3092 return error("cannot seek back reflog for %s: %s",3093 refname, strerror(errno));3094 nread = fread(buf, cnt, 1, logfp);3095 if (nread != 1)3096 return error("cannot read %d bytes from reflog for %s: %s",3097 cnt, refname, strerror(errno));3098 pos -= cnt;30993100 scanp = endp = buf + cnt;3101 if (at_tail && scanp[-1] == '\n')3102 /* Looking at the final LF at the end of the file */3103 scanp--;3104 at_tail = 0;31053106 while (buf < scanp) {3107 /*3108 * terminating LF of the previous line, or the beginning3109 * of the buffer.3110 */3111 char *bp;31123113 bp = find_beginning_of_line(buf, scanp);31143115 if (*bp == '\n') {3116 /*3117 * The newline is the end of the previous line,3118 * so we know we have complete line starting3119 * at (bp + 1). Prefix it onto any prior data3120 * we collected for the line and process it.3121 */3122 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));3123 scanp = bp;3124 endp = bp + 1;3125 ret = show_one_reflog_ent(&sb, fn, cb_data);3126 strbuf_reset(&sb);3127 if (ret)3128 break;3129 } else if (!pos) {3130 /*3131 * We are at the start of the buffer, and the3132 * start of the file; there is no previous3133 * line, and we have everything for this one.3134 * Process it, and we can end the loop.3135 */3136 strbuf_splice(&sb, 0, 0, buf, endp - buf);3137 ret = show_one_reflog_ent(&sb, fn, cb_data);3138 strbuf_reset(&sb);3139 break;3140 }31413142 if (bp == buf) {3143 /*3144 * We are at the start of the buffer, and there3145 * is more file to read backwards. Which means3146 * we are in the middle of a line. Note that we3147 * may get here even if *bp was a newline; that3148 * just means we are at the exact end of the3149 * previous line, rather than some spot in the3150 * middle.3151 *3152 * Save away what we have to be combined with3153 * the data from the next read.3154 */3155 strbuf_splice(&sb, 0, 0, buf, endp - buf);3156 break;3157 }3158 }31593160 }3161 if (!ret && sb.len)3162 die("BUG: reverse reflog parser had leftover data");31633164 fclose(logfp);3165 strbuf_release(&sb);3166 return ret;3167}31683169int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)3170{3171 FILE *logfp;3172 struct strbuf sb = STRBUF_INIT;3173 int ret = 0;31743175 logfp = fopen(git_path("logs/%s", refname), "r");3176 if (!logfp)3177 return -1;31783179 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))3180 ret = show_one_reflog_ent(&sb, fn, cb_data);3181 fclose(logfp);3182 strbuf_release(&sb);3183 return ret;3184}3185/*3186 * Call fn for each reflog in the namespace indicated by name. name3187 * must be empty or end with '/'. Name will be used as a scratch3188 * space, but its contents will be restored before return.3189 */3190static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)3191{3192 DIR *d = opendir(git_path("logs/%s", name->buf));3193 int retval = 0;3194 struct dirent *de;3195 int oldlen = name->len;31963197 if (!d)3198 return name->len ? errno : 0;31993200 while ((de = readdir(d)) != NULL) {3201 struct stat st;32023203 if (de->d_name[0] == '.')3204 continue;3205 if (ends_with(de->d_name, ".lock"))3206 continue;3207 strbuf_addstr(name, de->d_name);3208 if (stat(git_path("logs/%s", name->buf), &st) < 0) {3209 ; /* silently ignore */3210 } else {3211 if (S_ISDIR(st.st_mode)) {3212 strbuf_addch(name, '/');3213 retval = do_for_each_reflog(name, fn, cb_data);3214 } else {3215 struct object_id oid;32163217 if (read_ref_full(name->buf, 0, oid.hash, NULL))3218 retval = error("bad ref for %s", name->buf);3219 else3220 retval = fn(name->buf, &oid, 0, cb_data);3221 }3222 if (retval)3223 break;3224 }3225 strbuf_setlen(name, oldlen);3226 }3227 closedir(d);3228 return retval;3229}32303231int for_each_reflog(each_ref_fn fn, void *cb_data)3232{3233 int retval;3234 struct strbuf name;3235 strbuf_init(&name, PATH_MAX);3236 retval = do_for_each_reflog(&name, fn, cb_data);3237 strbuf_release(&name);3238 return retval;3239}32403241static int ref_update_reject_duplicates(struct string_list *refnames,3242 struct strbuf *err)3243{3244 int i, n = refnames->nr;32453246 assert(err);32473248 for (i = 1; i < n; i++)3249 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {3250 strbuf_addf(err,3251 "multiple updates for ref '%s' not allowed.",3252 refnames->items[i].string);3253 return 1;3254 }3255 return 0;3256}32573258/*3259 * If update is a direct update of head_ref (the reference pointed to3260 * by HEAD), then add an extra REF_LOG_ONLY update for HEAD.3261 */3262static int split_head_update(struct ref_update *update,3263 struct ref_transaction *transaction,3264 const char *head_ref,3265 struct string_list *affected_refnames,3266 struct strbuf *err)3267{3268 struct string_list_item *item;3269 struct ref_update *new_update;32703271 if ((update->flags & REF_LOG_ONLY) ||3272 (update->flags & REF_ISPRUNING) ||3273 (update->flags & REF_UPDATE_VIA_HEAD))3274 return 0;32753276 if (strcmp(update->refname, head_ref))3277 return 0;32783279 /*3280 * First make sure that HEAD is not already in the3281 * transaction. This insertion is O(N) in the transaction3282 * size, but it happens at most once per transaction.3283 */3284 item = string_list_insert(affected_refnames, "HEAD");3285 if (item->util) {3286 /* An entry already existed */3287 strbuf_addf(err,3288 "multiple updates for 'HEAD' (including one "3289 "via its referent '%s') are not allowed",3290 update->refname);3291 return TRANSACTION_NAME_CONFLICT;3292 }32933294 new_update = ref_transaction_add_update(3295 transaction, "HEAD",3296 update->flags | REF_LOG_ONLY | REF_NODEREF,3297 update->new_sha1, update->old_sha1,3298 update->msg);32993300 item->util = new_update;33013302 return 0;3303}33043305/*3306 * update is for a symref that points at referent and doesn't have3307 * REF_NODEREF set. Split it into two updates:3308 * - The original update, but with REF_LOG_ONLY and REF_NODEREF set3309 * - A new, separate update for the referent reference3310 * Note that the new update will itself be subject to splitting when3311 * the iteration gets to it.3312 */3313static int split_symref_update(struct ref_update *update,3314 const char *referent,3315 struct ref_transaction *transaction,3316 struct string_list *affected_refnames,3317 struct strbuf *err)3318{3319 struct string_list_item *item;3320 struct ref_update *new_update;3321 unsigned int new_flags;33223323 /*3324 * First make sure that referent is not already in the3325 * transaction. This insertion is O(N) in the transaction3326 * size, but it happens at most once per symref in a3327 * transaction.3328 */3329 item = string_list_insert(affected_refnames, referent);3330 if (item->util) {3331 /* An entry already existed */3332 strbuf_addf(err,3333 "multiple updates for '%s' (including one "3334 "via symref '%s') are not allowed",3335 referent, update->refname);3336 return TRANSACTION_NAME_CONFLICT;3337 }33383339 new_flags = update->flags;3340 if (!strcmp(update->refname, "HEAD")) {3341 /*3342 * Record that the new update came via HEAD, so that3343 * when we process it, split_head_update() doesn't try3344 * to add another reflog update for HEAD. Note that3345 * this bit will be propagated if the new_update3346 * itself needs to be split.3347 */3348 new_flags |= REF_UPDATE_VIA_HEAD;3349 }33503351 new_update = ref_transaction_add_update(3352 transaction, referent, new_flags,3353 update->new_sha1, update->old_sha1,3354 update->msg);33553356 new_update->parent_update = update;33573358 /*3359 * Change the symbolic ref update to log only. Also, it3360 * doesn't need to check its old SHA-1 value, as that will be3361 * done when new_update is processed.3362 */3363 update->flags |= REF_LOG_ONLY | REF_NODEREF;3364 update->flags &= ~REF_HAVE_OLD;33653366 item->util = new_update;33673368 return 0;3369}33703371/*3372 * Return the refname under which update was originally requested.3373 */3374static const char *original_update_refname(struct ref_update *update)3375{3376 while (update->parent_update)3377 update = update->parent_update;33783379 return update->refname;3380}33813382/*3383 * Prepare for carrying out update:3384 * - Lock the reference referred to by update.3385 * - Read the reference under lock.3386 * - Check that its old SHA-1 value (if specified) is correct, and in3387 * any case record it in update->lock->old_oid for later use when3388 * writing the reflog.3389 * - If it is a symref update without REF_NODEREF, split it up into a3390 * REF_LOG_ONLY update of the symref and add a separate update for3391 * the referent to transaction.3392 * - If it is an update of head_ref, add a corresponding REF_LOG_ONLY3393 * update of HEAD.3394 */3395static int lock_ref_for_update(struct ref_update *update,3396 struct ref_transaction *transaction,3397 const char *head_ref,3398 struct string_list *affected_refnames,3399 struct strbuf *err)3400{3401 struct strbuf referent = STRBUF_INIT;3402 int mustexist = (update->flags & REF_HAVE_OLD) &&3403 !is_null_sha1(update->old_sha1);3404 int ret;3405 struct ref_lock *lock;34063407 if ((update->flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1))3408 update->flags |= REF_DELETING;34093410 if (head_ref) {3411 ret = split_head_update(update, transaction, head_ref,3412 affected_refnames, err);3413 if (ret)3414 return ret;3415 }34163417 ret = lock_raw_ref(update->refname, mustexist,3418 affected_refnames, NULL,3419 &update->lock, &referent,3420 &update->type, err);34213422 if (ret) {3423 char *reason;34243425 reason = strbuf_detach(err, NULL);3426 strbuf_addf(err, "cannot lock ref '%s': %s",3427 update->refname, reason);3428 free(reason);3429 return ret;3430 }34313432 lock = update->lock;34333434 if (update->type & REF_ISSYMREF) {3435 if (update->flags & REF_NODEREF) {3436 /*3437 * We won't be reading the referent as part of3438 * the transaction, so we have to read it here3439 * to record and possibly check old_sha1:3440 */3441 if (read_ref_full(update->refname,3442 mustexist ? RESOLVE_REF_READING : 0,3443 lock->old_oid.hash, NULL)) {3444 if (update->flags & REF_HAVE_OLD) {3445 strbuf_addf(err, "cannot lock ref '%s': "3446 "can't resolve old value",3447 update->refname);3448 return TRANSACTION_GENERIC_ERROR;3449 } else {3450 hashclr(lock->old_oid.hash);3451 }3452 }3453 if ((update->flags & REF_HAVE_OLD) &&3454 hashcmp(lock->old_oid.hash, update->old_sha1)) {3455 strbuf_addf(err, "cannot lock ref '%s': "3456 "is at %s but expected %s",3457 update->refname,3458 sha1_to_hex(lock->old_oid.hash),3459 sha1_to_hex(update->old_sha1));3460 return TRANSACTION_GENERIC_ERROR;3461 }34623463 } else {3464 /*3465 * Create a new update for the reference this3466 * symref is pointing at. Also, we will record3467 * and verify old_sha1 for this update as part3468 * of processing the split-off update, so we3469 * don't have to do it here.3470 */3471 ret = split_symref_update(update, referent.buf, transaction,3472 affected_refnames, err);3473 if (ret)3474 return ret;3475 }3476 } else {3477 struct ref_update *parent_update;34783479 /*3480 * If this update is happening indirectly because of a3481 * symref update, record the old SHA-1 in the parent3482 * update:3483 */3484 for (parent_update = update->parent_update;3485 parent_update;3486 parent_update = parent_update->parent_update) {3487 oidcpy(&parent_update->lock->old_oid, &lock->old_oid);3488 }34893490 if ((update->flags & REF_HAVE_OLD) &&3491 hashcmp(lock->old_oid.hash, update->old_sha1)) {3492 if (is_null_sha1(update->old_sha1))3493 strbuf_addf(err, "cannot lock ref '%s': reference already exists",3494 original_update_refname(update));3495 else3496 strbuf_addf(err, "cannot lock ref '%s': is at %s but expected %s",3497 original_update_refname(update),3498 sha1_to_hex(lock->old_oid.hash),3499 sha1_to_hex(update->old_sha1));35003501 return TRANSACTION_GENERIC_ERROR;3502 }3503 }35043505 if ((update->flags & REF_HAVE_NEW) &&3506 !(update->flags & REF_DELETING) &&3507 !(update->flags & REF_LOG_ONLY)) {3508 if (!(update->type & REF_ISSYMREF) &&3509 !hashcmp(lock->old_oid.hash, update->new_sha1)) {3510 /*3511 * The reference already has the desired3512 * value, so we don't need to write it.3513 */3514 } else if (write_ref_to_lockfile(lock, update->new_sha1,3515 err)) {3516 char *write_err = strbuf_detach(err, NULL);35173518 /*3519 * The lock was freed upon failure of3520 * write_ref_to_lockfile():3521 */3522 update->lock = NULL;3523 strbuf_addf(err,3524 "cannot update the ref '%s': %s",3525 update->refname, write_err);3526 free(write_err);3527 return TRANSACTION_GENERIC_ERROR;3528 } else {3529 update->flags |= REF_NEEDS_COMMIT;3530 }3531 }3532 if (!(update->flags & REF_NEEDS_COMMIT)) {3533 /*3534 * We didn't call write_ref_to_lockfile(), so3535 * the lockfile is still open. Close it to3536 * free up the file descriptor:3537 */3538 if (close_ref(lock)) {3539 strbuf_addf(err, "couldn't close '%s.lock'",3540 update->refname);3541 return TRANSACTION_GENERIC_ERROR;3542 }3543 }3544 return 0;3545}35463547int ref_transaction_commit(struct ref_transaction *transaction,3548 struct strbuf *err)3549{3550 int ret = 0, i;3551 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3552 struct string_list_item *ref_to_delete;3553 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;3554 char *head_ref = NULL;3555 int head_type;3556 struct object_id head_oid;35573558 assert(err);35593560 if (transaction->state != REF_TRANSACTION_OPEN)3561 die("BUG: commit called for transaction that is not open");35623563 if (!transaction->nr) {3564 transaction->state = REF_TRANSACTION_CLOSED;3565 return 0;3566 }35673568 /*3569 * Fail if a refname appears more than once in the3570 * transaction. (If we end up splitting up any updates using3571 * split_symref_update() or split_head_update(), those3572 * functions will check that the new updates don't have the3573 * same refname as any existing ones.)3574 */3575 for (i = 0; i < transaction->nr; i++) {3576 struct ref_update *update = transaction->updates[i];3577 struct string_list_item *item =3578 string_list_append(&affected_refnames, update->refname);35793580 /*3581 * We store a pointer to update in item->util, but at3582 * the moment we never use the value of this field3583 * except to check whether it is non-NULL.3584 */3585 item->util = update;3586 }3587 string_list_sort(&affected_refnames);3588 if (ref_update_reject_duplicates(&affected_refnames, err)) {3589 ret = TRANSACTION_GENERIC_ERROR;3590 goto cleanup;3591 }35923593 /*3594 * Special hack: If a branch is updated directly and HEAD3595 * points to it (may happen on the remote side of a push3596 * for example) then logically the HEAD reflog should be3597 * updated too.3598 *3599 * A generic solution would require reverse symref lookups,3600 * but finding all symrefs pointing to a given branch would be3601 * rather costly for this rare event (the direct update of a3602 * branch) to be worth it. So let's cheat and check with HEAD3603 * only, which should cover 99% of all usage scenarios (even3604 * 100% of the default ones).3605 *3606 * So if HEAD is a symbolic reference, then record the name of3607 * the reference that it points to. If we see an update of3608 * head_ref within the transaction, then split_head_update()3609 * arranges for the reflog of HEAD to be updated, too.3610 */3611 head_ref = resolve_refdup("HEAD", RESOLVE_REF_NO_RECURSE,3612 head_oid.hash, &head_type);36133614 if (head_ref && !(head_type & REF_ISSYMREF)) {3615 free(head_ref);3616 head_ref = NULL;3617 }36183619 /*3620 * Acquire all locks, verify old values if provided, check3621 * that new values are valid, and write new values to the3622 * lockfiles, ready to be activated. Only keep one lockfile3623 * open at a time to avoid running out of file descriptors.3624 */3625 for (i = 0; i < transaction->nr; i++) {3626 struct ref_update *update = transaction->updates[i];36273628 ret = lock_ref_for_update(update, transaction, head_ref,3629 &affected_refnames, err);3630 if (ret)3631 goto cleanup;3632 }36333634 /* Perform updates first so live commits remain referenced */3635 for (i = 0; i < transaction->nr; i++) {3636 struct ref_update *update = transaction->updates[i];3637 struct ref_lock *lock = update->lock;36383639 if (update->flags & REF_NEEDS_COMMIT ||3640 update->flags & REF_LOG_ONLY) {3641 if (log_ref_write(lock->ref_name, lock->old_oid.hash,3642 update->new_sha1,3643 update->msg, update->flags, err)) {3644 char *old_msg = strbuf_detach(err, NULL);36453646 strbuf_addf(err, "cannot update the ref '%s': %s",3647 lock->ref_name, old_msg);3648 free(old_msg);3649 unlock_ref(lock);3650 update->lock = NULL;3651 ret = TRANSACTION_GENERIC_ERROR;3652 goto cleanup;3653 }3654 }3655 if (update->flags & REF_NEEDS_COMMIT) {3656 clear_loose_ref_cache(&ref_cache);3657 if (commit_ref(lock)) {3658 strbuf_addf(err, "couldn't set '%s'", lock->ref_name);3659 unlock_ref(lock);3660 update->lock = NULL;3661 ret = TRANSACTION_GENERIC_ERROR;3662 goto cleanup;3663 }3664 }3665 }3666 /* Perform deletes now that updates are safely completed */3667 for (i = 0; i < transaction->nr; i++) {3668 struct ref_update *update = transaction->updates[i];36693670 if (update->flags & REF_DELETING &&3671 !(update->flags & REF_LOG_ONLY)) {3672 if (delete_ref_loose(update->lock, update->type, err)) {3673 ret = TRANSACTION_GENERIC_ERROR;3674 goto cleanup;3675 }36763677 if (!(update->flags & REF_ISPRUNING))3678 string_list_append(&refs_to_delete,3679 update->lock->ref_name);3680 }3681 }36823683 if (repack_without_refs(&refs_to_delete, err)) {3684 ret = TRANSACTION_GENERIC_ERROR;3685 goto cleanup;3686 }3687 for_each_string_list_item(ref_to_delete, &refs_to_delete)3688 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3689 clear_loose_ref_cache(&ref_cache);36903691cleanup:3692 transaction->state = REF_TRANSACTION_CLOSED;36933694 for (i = 0; i < transaction->nr; i++)3695 if (transaction->updates[i]->lock)3696 unlock_ref(transaction->updates[i]->lock);3697 string_list_clear(&refs_to_delete, 0);3698 free(head_ref);3699 string_list_clear(&affected_refnames, 0);37003701 return ret;3702}37033704static int ref_present(const char *refname,3705 const struct object_id *oid, int flags, void *cb_data)3706{3707 struct string_list *affected_refnames = cb_data;37083709 return string_list_has_string(affected_refnames, refname);3710}37113712int initial_ref_transaction_commit(struct ref_transaction *transaction,3713 struct strbuf *err)3714{3715 int ret = 0, i;3716 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;37173718 assert(err);37193720 if (transaction->state != REF_TRANSACTION_OPEN)3721 die("BUG: commit called for transaction that is not open");37223723 /* Fail if a refname appears more than once in the transaction: */3724 for (i = 0; i < transaction->nr; i++)3725 string_list_append(&affected_refnames,3726 transaction->updates[i]->refname);3727 string_list_sort(&affected_refnames);3728 if (ref_update_reject_duplicates(&affected_refnames, err)) {3729 ret = TRANSACTION_GENERIC_ERROR;3730 goto cleanup;3731 }37323733 /*3734 * It's really undefined to call this function in an active3735 * repository or when there are existing references: we are3736 * only locking and changing packed-refs, so (1) any3737 * simultaneous processes might try to change a reference at3738 * the same time we do, and (2) any existing loose versions of3739 * the references that we are setting would have precedence3740 * over our values. But some remote helpers create the remote3741 * "HEAD" and "master" branches before calling this function,3742 * so here we really only check that none of the references3743 * that we are creating already exists.3744 */3745 if (for_each_rawref(ref_present, &affected_refnames))3746 die("BUG: initial ref transaction called with existing refs");37473748 for (i = 0; i < transaction->nr; i++) {3749 struct ref_update *update = transaction->updates[i];37503751 if ((update->flags & REF_HAVE_OLD) &&3752 !is_null_sha1(update->old_sha1))3753 die("BUG: initial ref transaction with old_sha1 set");3754 if (verify_refname_available(update->refname,3755 &affected_refnames, NULL,3756 err)) {3757 ret = TRANSACTION_NAME_CONFLICT;3758 goto cleanup;3759 }3760 }37613762 if (lock_packed_refs(0)) {3763 strbuf_addf(err, "unable to lock packed-refs file: %s",3764 strerror(errno));3765 ret = TRANSACTION_GENERIC_ERROR;3766 goto cleanup;3767 }37683769 for (i = 0; i < transaction->nr; i++) {3770 struct ref_update *update = transaction->updates[i];37713772 if ((update->flags & REF_HAVE_NEW) &&3773 !is_null_sha1(update->new_sha1))3774 add_packed_ref(update->refname, update->new_sha1);3775 }37763777 if (commit_packed_refs()) {3778 strbuf_addf(err, "unable to commit packed-refs file: %s",3779 strerror(errno));3780 ret = TRANSACTION_GENERIC_ERROR;3781 goto cleanup;3782 }37833784cleanup:3785 transaction->state = REF_TRANSACTION_CLOSED;3786 string_list_clear(&affected_refnames, 0);3787 return ret;3788}37893790struct expire_reflog_cb {3791 unsigned int flags;3792 reflog_expiry_should_prune_fn *should_prune_fn;3793 void *policy_cb;3794 FILE *newlog;3795 unsigned char last_kept_sha1[20];3796};37973798static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,3799 const char *email, unsigned long timestamp, int tz,3800 const char *message, void *cb_data)3801{3802 struct expire_reflog_cb *cb = cb_data;3803 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;38043805 if (cb->flags & EXPIRE_REFLOGS_REWRITE)3806 osha1 = cb->last_kept_sha1;38073808 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3809 message, policy_cb)) {3810 if (!cb->newlog)3811 printf("would prune %s", message);3812 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)3813 printf("prune %s", message);3814 } else {3815 if (cb->newlog) {3816 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",3817 sha1_to_hex(osha1), sha1_to_hex(nsha1),3818 email, timestamp, tz, message);3819 hashcpy(cb->last_kept_sha1, nsha1);3820 }3821 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)3822 printf("keep %s", message);3823 }3824 return 0;3825}38263827int reflog_expire(const char *refname, const unsigned char *sha1,3828 unsigned int flags,3829 reflog_expiry_prepare_fn prepare_fn,3830 reflog_expiry_should_prune_fn should_prune_fn,3831 reflog_expiry_cleanup_fn cleanup_fn,3832 void *policy_cb_data)3833{3834 static struct lock_file reflog_lock;3835 struct expire_reflog_cb cb;3836 struct ref_lock *lock;3837 char *log_file;3838 int status = 0;3839 int type;3840 struct strbuf err = STRBUF_INIT;38413842 memset(&cb, 0, sizeof(cb));3843 cb.flags = flags;3844 cb.policy_cb = policy_cb_data;3845 cb.should_prune_fn = should_prune_fn;38463847 /*3848 * The reflog file is locked by holding the lock on the3849 * reference itself, plus we might need to update the3850 * reference if --updateref was specified:3851 */3852 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, REF_NODEREF,3853 &type, &err);3854 if (!lock) {3855 error("cannot lock ref '%s': %s", refname, err.buf);3856 strbuf_release(&err);3857 return -1;3858 }3859 if (!reflog_exists(refname)) {3860 unlock_ref(lock);3861 return 0;3862 }38633864 log_file = git_pathdup("logs/%s", refname);3865 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3866 /*3867 * Even though holding $GIT_DIR/logs/$reflog.lock has3868 * no locking implications, we use the lock_file3869 * machinery here anyway because it does a lot of the3870 * work we need, including cleaning up if the program3871 * exits unexpectedly.3872 */3873 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {3874 struct strbuf err = STRBUF_INIT;3875 unable_to_lock_message(log_file, errno, &err);3876 error("%s", err.buf);3877 strbuf_release(&err);3878 goto failure;3879 }3880 cb.newlog = fdopen_lock_file(&reflog_lock, "w");3881 if (!cb.newlog) {3882 error("cannot fdopen %s (%s)",3883 get_lock_file_path(&reflog_lock), strerror(errno));3884 goto failure;3885 }3886 }38873888 (*prepare_fn)(refname, sha1, cb.policy_cb);3889 for_each_reflog_ent(refname, expire_reflog_ent, &cb);3890 (*cleanup_fn)(cb.policy_cb);38913892 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3893 /*3894 * It doesn't make sense to adjust a reference pointed3895 * to by a symbolic ref based on expiring entries in3896 * the symbolic reference's reflog. Nor can we update3897 * a reference if there are no remaining reflog3898 * entries.3899 */3900 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&3901 !(type & REF_ISSYMREF) &&3902 !is_null_sha1(cb.last_kept_sha1);39033904 if (close_lock_file(&reflog_lock)) {3905 status |= error("couldn't write %s: %s", log_file,3906 strerror(errno));3907 } else if (update &&3908 (write_in_full(get_lock_file_fd(lock->lk),3909 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||3910 write_str_in_full(get_lock_file_fd(lock->lk), "\n") != 1 ||3911 close_ref(lock) < 0)) {3912 status |= error("couldn't write %s",3913 get_lock_file_path(lock->lk));3914 rollback_lock_file(&reflog_lock);3915 } else if (commit_lock_file(&reflog_lock)) {3916 status |= error("unable to write reflog '%s' (%s)",3917 log_file, strerror(errno));3918 } else if (update && commit_ref(lock)) {3919 status |= error("couldn't set %s", lock->ref_name);3920 }3921 }3922 free(log_file);3923 unlock_ref(lock);3924 return status;39253926 failure:3927 rollback_lock_file(&reflog_lock);3928 free(log_file);3929 unlock_ref(lock);3930 return -1;3931}