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 char *orig_ref_name; 11 struct lock_file *lk; 12 struct object_id old_oid; 13}; 14 15struct ref_entry; 16 17/* 18 * Information used (along with the information in ref_entry) to 19 * describe a single cached reference. This data structure only 20 * occurs embedded in a union in struct ref_entry, and only when 21 * (ref_entry->flag & REF_DIR) is zero. 22 */ 23struct ref_value { 24 /* 25 * The name of the object to which this reference resolves 26 * (which may be a tag object). If REF_ISBROKEN, this is 27 * null. If REF_ISSYMREF, then this is the name of the object 28 * referred to by the last reference in the symlink chain. 29 */ 30 struct object_id oid; 31 32 /* 33 * If REF_KNOWS_PEELED, then this field holds the peeled value 34 * of this reference, or null if the reference is known not to 35 * be peelable. See the documentation for peel_ref() for an 36 * exact definition of "peelable". 37 */ 38 struct object_id peeled; 39}; 40 41struct ref_cache; 42 43/* 44 * Information used (along with the information in ref_entry) to 45 * describe a level in the hierarchy of references. This data 46 * structure only occurs embedded in a union in struct ref_entry, and 47 * only when (ref_entry.flag & REF_DIR) is set. In that case, 48 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 49 * in the directory have already been read: 50 * 51 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 52 * or packed references, already read. 53 * 54 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 55 * references that hasn't been read yet (nor has any of its 56 * subdirectories). 57 * 58 * Entries within a directory are stored within a growable array of 59 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 60 * sorted are sorted by their component name in strcmp() order and the 61 * remaining entries are unsorted. 62 * 63 * Loose references are read lazily, one directory at a time. When a 64 * directory of loose references is read, then all of the references 65 * in that directory are stored, and REF_INCOMPLETE stubs are created 66 * for any subdirectories, but the subdirectories themselves are not 67 * read. The reading is triggered by get_ref_dir(). 68 */ 69struct ref_dir { 70 int nr, alloc; 71 72 /* 73 * Entries with index 0 <= i < sorted are sorted by name. New 74 * entries are appended to the list unsorted, and are sorted 75 * only when required; thus we avoid the need to sort the list 76 * after the addition of every reference. 77 */ 78 int sorted; 79 80 /* A pointer to the ref_cache that contains this ref_dir. */ 81 struct ref_cache *ref_cache; 82 83 struct ref_entry **entries; 84}; 85 86/* 87 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 88 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 89 * public values; see refs.h. 90 */ 91 92/* 93 * The field ref_entry->u.value.peeled of this value entry contains 94 * the correct peeled value for the reference, which might be 95 * null_sha1 if the reference is not a tag or if it is broken. 96 */ 97#define REF_KNOWS_PEELED 0x10 98 99/* ref_entry represents a directory of references */ 100#define REF_DIR 0x20 101 102/* 103 * Entry has not yet been read from disk (used only for REF_DIR 104 * entries representing loose references) 105 */ 106#define REF_INCOMPLETE 0x40 107 108/* 109 * A ref_entry represents either a reference or a "subdirectory" of 110 * references. 111 * 112 * Each directory in the reference namespace is represented by a 113 * ref_entry with (flags & REF_DIR) set and containing a subdir member 114 * that holds the entries in that directory that have been read so 115 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 116 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 117 * used for loose reference directories. 118 * 119 * References are represented by a ref_entry with (flags & REF_DIR) 120 * unset and a value member that describes the reference's value. The 121 * flag member is at the ref_entry level, but it is also needed to 122 * interpret the contents of the value field (in other words, a 123 * ref_value object is not very much use without the enclosing 124 * ref_entry). 125 * 126 * Reference names cannot end with slash and directories' names are 127 * always stored with a trailing slash (except for the top-level 128 * directory, which is always denoted by ""). This has two nice 129 * consequences: (1) when the entries in each subdir are sorted 130 * lexicographically by name (as they usually are), the references in 131 * a whole tree can be generated in lexicographic order by traversing 132 * the tree in left-to-right, depth-first order; (2) the names of 133 * references and subdirectories cannot conflict, and therefore the 134 * presence of an empty subdirectory does not block the creation of a 135 * similarly-named reference. (The fact that reference names with the 136 * same leading components can conflict *with each other* is a 137 * separate issue that is regulated by verify_refname_available().) 138 * 139 * Please note that the name field contains the fully-qualified 140 * reference (or subdirectory) name. Space could be saved by only 141 * storing the relative names. But that would require the full names 142 * to be generated on the fly when iterating in do_for_each_ref(), and 143 * would break callback functions, who have always been able to assume 144 * that the name strings that they are passed will not be freed during 145 * the iteration. 146 */ 147struct ref_entry { 148 unsigned char flag; /* ISSYMREF? ISPACKED? */ 149 union { 150 struct ref_value value; /* if not (flags&REF_DIR) */ 151 struct ref_dir subdir; /* if (flags&REF_DIR) */ 152 } u; 153 /* 154 * The full name of the reference (e.g., "refs/heads/master") 155 * or the full name of the directory with a trailing slash 156 * (e.g., "refs/heads/"): 157 */ 158 char name[FLEX_ARRAY]; 159}; 160 161static void read_loose_refs(const char *dirname, struct ref_dir *dir); 162static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len); 163static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 164 const char *dirname, size_t len, 165 int incomplete); 166static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry); 167 168static struct ref_dir *get_ref_dir(struct ref_entry *entry) 169{ 170 struct ref_dir *dir; 171 assert(entry->flag & REF_DIR); 172 dir = &entry->u.subdir; 173 if (entry->flag & REF_INCOMPLETE) { 174 read_loose_refs(entry->name, dir); 175 176 /* 177 * Manually add refs/bisect, which, being 178 * per-worktree, might not appear in the directory 179 * listing for refs/ in the main repo. 180 */ 181 if (!strcmp(entry->name, "refs/")) { 182 int pos = search_ref_dir(dir, "refs/bisect/", 12); 183 if (pos < 0) { 184 struct ref_entry *child_entry; 185 child_entry = create_dir_entry(dir->ref_cache, 186 "refs/bisect/", 187 12, 1); 188 add_entry_to_dir(dir, child_entry); 189 read_loose_refs("refs/bisect", 190 &child_entry->u.subdir); 191 } 192 } 193 entry->flag &= ~REF_INCOMPLETE; 194 } 195 return dir; 196} 197 198static struct ref_entry *create_ref_entry(const char *refname, 199 const unsigned char *sha1, int flag, 200 int check_name) 201{ 202 struct ref_entry *ref; 203 204 if (check_name && 205 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 206 die("Reference has invalid format: '%s'", refname); 207 FLEX_ALLOC_STR(ref, name, refname); 208 hashcpy(ref->u.value.oid.hash, sha1); 209 oidclr(&ref->u.value.peeled); 210 ref->flag = flag; 211 return ref; 212} 213 214static void clear_ref_dir(struct ref_dir *dir); 215 216static void free_ref_entry(struct ref_entry *entry) 217{ 218 if (entry->flag & REF_DIR) { 219 /* 220 * Do not use get_ref_dir() here, as that might 221 * trigger the reading of loose refs. 222 */ 223 clear_ref_dir(&entry->u.subdir); 224 } 225 free(entry); 226} 227 228/* 229 * Add a ref_entry to the end of dir (unsorted). Entry is always 230 * stored directly in dir; no recursion into subdirectories is 231 * done. 232 */ 233static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry) 234{ 235 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc); 236 dir->entries[dir->nr++] = entry; 237 /* optimize for the case that entries are added in order */ 238 if (dir->nr == 1 || 239 (dir->nr == dir->sorted + 1 && 240 strcmp(dir->entries[dir->nr - 2]->name, 241 dir->entries[dir->nr - 1]->name) < 0)) 242 dir->sorted = dir->nr; 243} 244 245/* 246 * Clear and free all entries in dir, recursively. 247 */ 248static void clear_ref_dir(struct ref_dir *dir) 249{ 250 int i; 251 for (i = 0; i < dir->nr; i++) 252 free_ref_entry(dir->entries[i]); 253 free(dir->entries); 254 dir->sorted = dir->nr = dir->alloc = 0; 255 dir->entries = NULL; 256} 257 258/* 259 * Create a struct ref_entry object for the specified dirname. 260 * dirname is the name of the directory with a trailing slash (e.g., 261 * "refs/heads/") or "" for the top-level directory. 262 */ 263static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 264 const char *dirname, size_t len, 265 int incomplete) 266{ 267 struct ref_entry *direntry; 268 FLEX_ALLOC_MEM(direntry, name, dirname, len); 269 direntry->u.subdir.ref_cache = ref_cache; 270 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0); 271 return direntry; 272} 273 274static int ref_entry_cmp(const void *a, const void *b) 275{ 276 struct ref_entry *one = *(struct ref_entry **)a; 277 struct ref_entry *two = *(struct ref_entry **)b; 278 return strcmp(one->name, two->name); 279} 280 281static void sort_ref_dir(struct ref_dir *dir); 282 283struct string_slice { 284 size_t len; 285 const char *str; 286}; 287 288static int ref_entry_cmp_sslice(const void *key_, const void *ent_) 289{ 290 const struct string_slice *key = key_; 291 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_; 292 int cmp = strncmp(key->str, ent->name, key->len); 293 if (cmp) 294 return cmp; 295 return '\0' - (unsigned char)ent->name[key->len]; 296} 297 298/* 299 * Return the index of the entry with the given refname from the 300 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 301 * no such entry is found. dir must already be complete. 302 */ 303static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len) 304{ 305 struct ref_entry **r; 306 struct string_slice key; 307 308 if (refname == NULL || !dir->nr) 309 return -1; 310 311 sort_ref_dir(dir); 312 key.len = len; 313 key.str = refname; 314 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries), 315 ref_entry_cmp_sslice); 316 317 if (r == NULL) 318 return -1; 319 320 return r - dir->entries; 321} 322 323/* 324 * Search for a directory entry directly within dir (without 325 * recursing). Sort dir if necessary. subdirname must be a directory 326 * name (i.e., end in '/'). If mkdir is set, then create the 327 * directory if it is missing; otherwise, return NULL if the desired 328 * directory cannot be found. dir must already be complete. 329 */ 330static struct ref_dir *search_for_subdir(struct ref_dir *dir, 331 const char *subdirname, size_t len, 332 int mkdir) 333{ 334 int entry_index = search_ref_dir(dir, subdirname, len); 335 struct ref_entry *entry; 336 if (entry_index == -1) { 337 if (!mkdir) 338 return NULL; 339 /* 340 * Since dir is complete, the absence of a subdir 341 * means that the subdir really doesn't exist; 342 * therefore, create an empty record for it but mark 343 * the record complete. 344 */ 345 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0); 346 add_entry_to_dir(dir, entry); 347 } else { 348 entry = dir->entries[entry_index]; 349 } 350 return get_ref_dir(entry); 351} 352 353/* 354 * If refname is a reference name, find the ref_dir within the dir 355 * tree that should hold refname. If refname is a directory name 356 * (i.e., ends in '/'), then return that ref_dir itself. dir must 357 * represent the top-level directory and must already be complete. 358 * Sort ref_dirs and recurse into subdirectories as necessary. If 359 * mkdir is set, then create any missing directories; otherwise, 360 * return NULL if the desired directory cannot be found. 361 */ 362static struct ref_dir *find_containing_dir(struct ref_dir *dir, 363 const char *refname, int mkdir) 364{ 365 const char *slash; 366 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 367 size_t dirnamelen = slash - refname + 1; 368 struct ref_dir *subdir; 369 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir); 370 if (!subdir) { 371 dir = NULL; 372 break; 373 } 374 dir = subdir; 375 } 376 377 return dir; 378} 379 380/* 381 * Find the value entry with the given name in dir, sorting ref_dirs 382 * and recursing into subdirectories as necessary. If the name is not 383 * found or it corresponds to a directory entry, return NULL. 384 */ 385static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname) 386{ 387 int entry_index; 388 struct ref_entry *entry; 389 dir = find_containing_dir(dir, refname, 0); 390 if (!dir) 391 return NULL; 392 entry_index = search_ref_dir(dir, refname, strlen(refname)); 393 if (entry_index == -1) 394 return NULL; 395 entry = dir->entries[entry_index]; 396 return (entry->flag & REF_DIR) ? NULL : entry; 397} 398 399/* 400 * Remove the entry with the given name from dir, recursing into 401 * subdirectories as necessary. If refname is the name of a directory 402 * (i.e., ends with '/'), then remove the directory and its contents. 403 * If the removal was successful, return the number of entries 404 * remaining in the directory entry that contained the deleted entry. 405 * If the name was not found, return -1. Please note that this 406 * function only deletes the entry from the cache; it does not delete 407 * it from the filesystem or ensure that other cache entries (which 408 * might be symbolic references to the removed entry) are updated. 409 * Nor does it remove any containing dir entries that might be made 410 * empty by the removal. dir must represent the top-level directory 411 * and must already be complete. 412 */ 413static int remove_entry(struct ref_dir *dir, const char *refname) 414{ 415 int refname_len = strlen(refname); 416 int entry_index; 417 struct ref_entry *entry; 418 int is_dir = refname[refname_len - 1] == '/'; 419 if (is_dir) { 420 /* 421 * refname represents a reference directory. Remove 422 * the trailing slash; otherwise we will get the 423 * directory *representing* refname rather than the 424 * one *containing* it. 425 */ 426 char *dirname = xmemdupz(refname, refname_len - 1); 427 dir = find_containing_dir(dir, dirname, 0); 428 free(dirname); 429 } else { 430 dir = find_containing_dir(dir, refname, 0); 431 } 432 if (!dir) 433 return -1; 434 entry_index = search_ref_dir(dir, refname, refname_len); 435 if (entry_index == -1) 436 return -1; 437 entry = dir->entries[entry_index]; 438 439 memmove(&dir->entries[entry_index], 440 &dir->entries[entry_index + 1], 441 (dir->nr - entry_index - 1) * sizeof(*dir->entries) 442 ); 443 dir->nr--; 444 if (dir->sorted > entry_index) 445 dir->sorted--; 446 free_ref_entry(entry); 447 return dir->nr; 448} 449 450/* 451 * Add a ref_entry to the ref_dir (unsorted), recursing into 452 * subdirectories as necessary. dir must represent the top-level 453 * directory. Return 0 on success. 454 */ 455static int add_ref(struct ref_dir *dir, struct ref_entry *ref) 456{ 457 dir = find_containing_dir(dir, ref->name, 1); 458 if (!dir) 459 return -1; 460 add_entry_to_dir(dir, ref); 461 return 0; 462} 463 464/* 465 * Emit a warning and return true iff ref1 and ref2 have the same name 466 * and the same sha1. Die if they have the same name but different 467 * sha1s. 468 */ 469static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2) 470{ 471 if (strcmp(ref1->name, ref2->name)) 472 return 0; 473 474 /* Duplicate name; make sure that they don't conflict: */ 475 476 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 477 /* This is impossible by construction */ 478 die("Reference directory conflict: %s", ref1->name); 479 480 if (oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 481 die("Duplicated ref, and SHA1s don't match: %s", ref1->name); 482 483 warning("Duplicated ref: %s", ref1->name); 484 return 1; 485} 486 487/* 488 * Sort the entries in dir non-recursively (if they are not already 489 * sorted) and remove any duplicate entries. 490 */ 491static void sort_ref_dir(struct ref_dir *dir) 492{ 493 int i, j; 494 struct ref_entry *last = NULL; 495 496 /* 497 * This check also prevents passing a zero-length array to qsort(), 498 * which is a problem on some platforms. 499 */ 500 if (dir->sorted == dir->nr) 501 return; 502 503 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp); 504 505 /* Remove any duplicates: */ 506 for (i = 0, j = 0; j < dir->nr; j++) { 507 struct ref_entry *entry = dir->entries[j]; 508 if (last && is_dup_ref(last, entry)) 509 free_ref_entry(entry); 510 else 511 last = dir->entries[i++] = entry; 512 } 513 dir->sorted = dir->nr = i; 514} 515 516/* 517 * Return true iff the reference described by entry can be resolved to 518 * an object in the database. Emit a warning if the referred-to 519 * object does not exist. 520 */ 521static int ref_resolves_to_object(struct ref_entry *entry) 522{ 523 if (entry->flag & REF_ISBROKEN) 524 return 0; 525 if (!has_sha1_file(entry->u.value.oid.hash)) { 526 error("%s does not point to a valid object!", entry->name); 527 return 0; 528 } 529 return 1; 530} 531 532/* 533 * current_ref is a performance hack: when iterating over references 534 * using the for_each_ref*() functions, current_ref is set to the 535 * current reference's entry before calling the callback function. If 536 * the callback function calls peel_ref(), then peel_ref() first 537 * checks whether the reference to be peeled is the current reference 538 * (it usually is) and if so, returns that reference's peeled version 539 * if it is available. This avoids a refname lookup in a common case. 540 */ 541static struct ref_entry *current_ref; 542 543typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data); 544 545struct ref_entry_cb { 546 const char *base; 547 int trim; 548 int flags; 549 each_ref_fn *fn; 550 void *cb_data; 551}; 552 553/* 554 * Handle one reference in a do_for_each_ref*()-style iteration, 555 * calling an each_ref_fn for each entry. 556 */ 557static int do_one_ref(struct ref_entry *entry, void *cb_data) 558{ 559 struct ref_entry_cb *data = cb_data; 560 struct ref_entry *old_current_ref; 561 int retval; 562 563 if (!starts_with(entry->name, data->base)) 564 return 0; 565 566 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && 567 !ref_resolves_to_object(entry)) 568 return 0; 569 570 /* Store the old value, in case this is a recursive call: */ 571 old_current_ref = current_ref; 572 current_ref = entry; 573 retval = data->fn(entry->name + data->trim, &entry->u.value.oid, 574 entry->flag, data->cb_data); 575 current_ref = old_current_ref; 576 return retval; 577} 578 579/* 580 * Call fn for each reference in dir that has index in the range 581 * offset <= index < dir->nr. Recurse into subdirectories that are in 582 * that index range, sorting them before iterating. This function 583 * does not sort dir itself; it should be sorted beforehand. fn is 584 * called for all references, including broken ones. 585 */ 586static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset, 587 each_ref_entry_fn fn, void *cb_data) 588{ 589 int i; 590 assert(dir->sorted == dir->nr); 591 for (i = offset; i < dir->nr; i++) { 592 struct ref_entry *entry = dir->entries[i]; 593 int retval; 594 if (entry->flag & REF_DIR) { 595 struct ref_dir *subdir = get_ref_dir(entry); 596 sort_ref_dir(subdir); 597 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data); 598 } else { 599 retval = fn(entry, cb_data); 600 } 601 if (retval) 602 return retval; 603 } 604 return 0; 605} 606 607/* 608 * Call fn for each reference in the union of dir1 and dir2, in order 609 * by refname. Recurse into subdirectories. If a value entry appears 610 * in both dir1 and dir2, then only process the version that is in 611 * dir2. The input dirs must already be sorted, but subdirs will be 612 * sorted as needed. fn is called for all references, including 613 * broken ones. 614 */ 615static int do_for_each_entry_in_dirs(struct ref_dir *dir1, 616 struct ref_dir *dir2, 617 each_ref_entry_fn fn, void *cb_data) 618{ 619 int retval; 620 int i1 = 0, i2 = 0; 621 622 assert(dir1->sorted == dir1->nr); 623 assert(dir2->sorted == dir2->nr); 624 while (1) { 625 struct ref_entry *e1, *e2; 626 int cmp; 627 if (i1 == dir1->nr) { 628 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data); 629 } 630 if (i2 == dir2->nr) { 631 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data); 632 } 633 e1 = dir1->entries[i1]; 634 e2 = dir2->entries[i2]; 635 cmp = strcmp(e1->name, e2->name); 636 if (cmp == 0) { 637 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { 638 /* Both are directories; descend them in parallel. */ 639 struct ref_dir *subdir1 = get_ref_dir(e1); 640 struct ref_dir *subdir2 = get_ref_dir(e2); 641 sort_ref_dir(subdir1); 642 sort_ref_dir(subdir2); 643 retval = do_for_each_entry_in_dirs( 644 subdir1, subdir2, fn, cb_data); 645 i1++; 646 i2++; 647 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { 648 /* Both are references; ignore the one from dir1. */ 649 retval = fn(e2, cb_data); 650 i1++; 651 i2++; 652 } else { 653 die("conflict between reference and directory: %s", 654 e1->name); 655 } 656 } else { 657 struct ref_entry *e; 658 if (cmp < 0) { 659 e = e1; 660 i1++; 661 } else { 662 e = e2; 663 i2++; 664 } 665 if (e->flag & REF_DIR) { 666 struct ref_dir *subdir = get_ref_dir(e); 667 sort_ref_dir(subdir); 668 retval = do_for_each_entry_in_dir( 669 subdir, 0, fn, cb_data); 670 } else { 671 retval = fn(e, cb_data); 672 } 673 } 674 if (retval) 675 return retval; 676 } 677} 678 679/* 680 * Load all of the refs from the dir into our in-memory cache. The hard work 681 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 682 * through all of the sub-directories. We do not even need to care about 683 * sorting, as traversal order does not matter to us. 684 */ 685static void prime_ref_dir(struct ref_dir *dir) 686{ 687 int i; 688 for (i = 0; i < dir->nr; i++) { 689 struct ref_entry *entry = dir->entries[i]; 690 if (entry->flag & REF_DIR) 691 prime_ref_dir(get_ref_dir(entry)); 692 } 693} 694 695struct nonmatching_ref_data { 696 const struct string_list *skip; 697 const char *conflicting_refname; 698}; 699 700static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata) 701{ 702 struct nonmatching_ref_data *data = vdata; 703 704 if (data->skip && string_list_has_string(data->skip, entry->name)) 705 return 0; 706 707 data->conflicting_refname = entry->name; 708 return 1; 709} 710 711/* 712 * Return 0 if a reference named refname could be created without 713 * conflicting with the name of an existing reference in dir. 714 * See verify_refname_available for more information. 715 */ 716static int verify_refname_available_dir(const char *refname, 717 const struct string_list *extras, 718 const struct string_list *skip, 719 struct ref_dir *dir, 720 struct strbuf *err) 721{ 722 const char *slash; 723 const char *extra_refname; 724 int pos; 725 struct strbuf dirname = STRBUF_INIT; 726 int ret = -1; 727 728 /* 729 * For the sake of comments in this function, suppose that 730 * refname is "refs/foo/bar". 731 */ 732 733 assert(err); 734 735 strbuf_grow(&dirname, strlen(refname) + 1); 736 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 737 /* Expand dirname to the new prefix, not including the trailing slash: */ 738 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 739 740 /* 741 * We are still at a leading dir of the refname (e.g., 742 * "refs/foo"; if there is a reference with that name, 743 * it is a conflict, *unless* it is in skip. 744 */ 745 if (dir) { 746 pos = search_ref_dir(dir, dirname.buf, dirname.len); 747 if (pos >= 0 && 748 (!skip || !string_list_has_string(skip, dirname.buf))) { 749 /* 750 * We found a reference whose name is 751 * a proper prefix of refname; e.g., 752 * "refs/foo", and is not in skip. 753 */ 754 strbuf_addf(err, "'%s' exists; cannot create '%s'", 755 dirname.buf, refname); 756 goto cleanup; 757 } 758 } 759 760 if (extras && string_list_has_string(extras, dirname.buf) && 761 (!skip || !string_list_has_string(skip, dirname.buf))) { 762 strbuf_addf(err, "cannot process '%s' and '%s' at the same time", 763 refname, dirname.buf); 764 goto cleanup; 765 } 766 767 /* 768 * Otherwise, we can try to continue our search with 769 * the next component. So try to look up the 770 * directory, e.g., "refs/foo/". If we come up empty, 771 * we know there is nothing under this whole prefix, 772 * but even in that case we still have to continue the 773 * search for conflicts with extras. 774 */ 775 strbuf_addch(&dirname, '/'); 776 if (dir) { 777 pos = search_ref_dir(dir, dirname.buf, dirname.len); 778 if (pos < 0) { 779 /* 780 * There was no directory "refs/foo/", 781 * so there is nothing under this 782 * whole prefix. So there is no need 783 * to continue looking for conflicting 784 * references. But we need to continue 785 * looking for conflicting extras. 786 */ 787 dir = NULL; 788 } else { 789 dir = get_ref_dir(dir->entries[pos]); 790 } 791 } 792 } 793 794 /* 795 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 796 * There is no point in searching for a reference with that 797 * name, because a refname isn't considered to conflict with 798 * itself. But we still need to check for references whose 799 * names are in the "refs/foo/bar/" namespace, because they 800 * *do* conflict. 801 */ 802 strbuf_addstr(&dirname, refname + dirname.len); 803 strbuf_addch(&dirname, '/'); 804 805 if (dir) { 806 pos = search_ref_dir(dir, dirname.buf, dirname.len); 807 808 if (pos >= 0) { 809 /* 810 * We found a directory named "$refname/" 811 * (e.g., "refs/foo/bar/"). It is a problem 812 * iff it contains any ref that is not in 813 * "skip". 814 */ 815 struct nonmatching_ref_data data; 816 817 data.skip = skip; 818 data.conflicting_refname = NULL; 819 dir = get_ref_dir(dir->entries[pos]); 820 sort_ref_dir(dir); 821 if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) { 822 strbuf_addf(err, "'%s' exists; cannot create '%s'", 823 data.conflicting_refname, refname); 824 goto cleanup; 825 } 826 } 827 } 828 829 extra_refname = find_descendant_ref(dirname.buf, extras, skip); 830 if (extra_refname) 831 strbuf_addf(err, "cannot process '%s' and '%s' at the same time", 832 refname, extra_refname); 833 else 834 ret = 0; 835 836cleanup: 837 strbuf_release(&dirname); 838 return ret; 839} 840 841struct packed_ref_cache { 842 struct ref_entry *root; 843 844 /* 845 * Count of references to the data structure in this instance, 846 * including the pointer from ref_cache::packed if any. The 847 * data will not be freed as long as the reference count is 848 * nonzero. 849 */ 850 unsigned int referrers; 851 852 /* 853 * Iff the packed-refs file associated with this instance is 854 * currently locked for writing, this points at the associated 855 * lock (which is owned by somebody else). The referrer count 856 * is also incremented when the file is locked and decremented 857 * when it is unlocked. 858 */ 859 struct lock_file *lock; 860 861 /* The metadata from when this packed-refs cache was read */ 862 struct stat_validity validity; 863}; 864 865/* 866 * Future: need to be in "struct repository" 867 * when doing a full libification. 868 */ 869static struct ref_cache { 870 struct ref_cache *next; 871 struct ref_entry *loose; 872 struct packed_ref_cache *packed; 873 /* 874 * The submodule name, or "" for the main repo. We allocate 875 * length 1 rather than FLEX_ARRAY so that the main ref_cache 876 * is initialized correctly. 877 */ 878 char name[1]; 879} ref_cache, *submodule_ref_caches; 880 881/* Lock used for the main packed-refs file: */ 882static struct lock_file packlock; 883 884/* 885 * Increment the reference count of *packed_refs. 886 */ 887static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs) 888{ 889 packed_refs->referrers++; 890} 891 892/* 893 * Decrease the reference count of *packed_refs. If it goes to zero, 894 * free *packed_refs and return true; otherwise return false. 895 */ 896static int release_packed_ref_cache(struct packed_ref_cache *packed_refs) 897{ 898 if (!--packed_refs->referrers) { 899 free_ref_entry(packed_refs->root); 900 stat_validity_clear(&packed_refs->validity); 901 free(packed_refs); 902 return 1; 903 } else { 904 return 0; 905 } 906} 907 908static void clear_packed_ref_cache(struct ref_cache *refs) 909{ 910 if (refs->packed) { 911 struct packed_ref_cache *packed_refs = refs->packed; 912 913 if (packed_refs->lock) 914 die("internal error: packed-ref cache cleared while locked"); 915 refs->packed = NULL; 916 release_packed_ref_cache(packed_refs); 917 } 918} 919 920static void clear_loose_ref_cache(struct ref_cache *refs) 921{ 922 if (refs->loose) { 923 free_ref_entry(refs->loose); 924 refs->loose = NULL; 925 } 926} 927 928/* 929 * Create a new submodule ref cache and add it to the internal 930 * set of caches. 931 */ 932static struct ref_cache *create_ref_cache(const char *submodule) 933{ 934 struct ref_cache *refs; 935 if (!submodule) 936 submodule = ""; 937 FLEX_ALLOC_STR(refs, name, submodule); 938 refs->next = submodule_ref_caches; 939 submodule_ref_caches = refs; 940 return refs; 941} 942 943static struct ref_cache *lookup_ref_cache(const char *submodule) 944{ 945 struct ref_cache *refs; 946 947 if (!submodule || !*submodule) 948 return &ref_cache; 949 950 for (refs = submodule_ref_caches; refs; refs = refs->next) 951 if (!strcmp(submodule, refs->name)) 952 return refs; 953 return NULL; 954} 955 956/* 957 * Return a pointer to a ref_cache for the specified submodule. For 958 * the main repository, use submodule==NULL. The returned structure 959 * will be allocated and initialized but not necessarily populated; it 960 * should not be freed. 961 */ 962static struct ref_cache *get_ref_cache(const char *submodule) 963{ 964 struct ref_cache *refs = lookup_ref_cache(submodule); 965 if (!refs) 966 refs = create_ref_cache(submodule); 967 return refs; 968} 969 970/* The length of a peeled reference line in packed-refs, including EOL: */ 971#define PEELED_LINE_LENGTH 42 972 973/* 974 * The packed-refs header line that we write out. Perhaps other 975 * traits will be added later. The trailing space is required. 976 */ 977static const char PACKED_REFS_HEADER[] = 978 "# pack-refs with: peeled fully-peeled \n"; 979 980/* 981 * Parse one line from a packed-refs file. Write the SHA1 to sha1. 982 * Return a pointer to the refname within the line (null-terminated), 983 * or NULL if there was a problem. 984 */ 985static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1) 986{ 987 const char *ref; 988 989 /* 990 * 42: the answer to everything. 991 * 992 * In this case, it happens to be the answer to 993 * 40 (length of sha1 hex representation) 994 * +1 (space in between hex and name) 995 * +1 (newline at the end of the line) 996 */ 997 if (line->len <= 42) 998 return NULL; 9991000 if (get_sha1_hex(line->buf, sha1) < 0)1001 return NULL;1002 if (!isspace(line->buf[40]))1003 return NULL;10041005 ref = line->buf + 41;1006 if (isspace(*ref))1007 return NULL;10081009 if (line->buf[line->len - 1] != '\n')1010 return NULL;1011 line->buf[--line->len] = 0;10121013 return ref;1014}10151016/*1017 * Read f, which is a packed-refs file, into dir.1018 *1019 * A comment line of the form "# pack-refs with: " may contain zero or1020 * more traits. We interpret the traits as follows:1021 *1022 * No traits:1023 *1024 * Probably no references are peeled. But if the file contains a1025 * peeled value for a reference, we will use it.1026 *1027 * peeled:1028 *1029 * References under "refs/tags/", if they *can* be peeled, *are*1030 * peeled in this file. References outside of "refs/tags/" are1031 * probably not peeled even if they could have been, but if we find1032 * a peeled value for such a reference we will use it.1033 *1034 * fully-peeled:1035 *1036 * All references in the file that can be peeled are peeled.1037 * Inversely (and this is more important), any references in the1038 * file for which no peeled value is recorded is not peelable. This1039 * trait should typically be written alongside "peeled" for1040 * compatibility with older clients, but we do not require it1041 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1042 */1043static void read_packed_refs(FILE *f, struct ref_dir *dir)1044{1045 struct ref_entry *last = NULL;1046 struct strbuf line = STRBUF_INIT;1047 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;10481049 while (strbuf_getwholeline(&line, f, '\n') != EOF) {1050 unsigned char sha1[20];1051 const char *refname;1052 const char *traits;10531054 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {1055 if (strstr(traits, " fully-peeled "))1056 peeled = PEELED_FULLY;1057 else if (strstr(traits, " peeled "))1058 peeled = PEELED_TAGS;1059 /* perhaps other traits later as well */1060 continue;1061 }10621063 refname = parse_ref_line(&line, sha1);1064 if (refname) {1065 int flag = REF_ISPACKED;10661067 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1068 if (!refname_is_safe(refname))1069 die("packed refname is dangerous: %s", refname);1070 hashclr(sha1);1071 flag |= REF_BAD_NAME | REF_ISBROKEN;1072 }1073 last = create_ref_entry(refname, sha1, flag, 0);1074 if (peeled == PEELED_FULLY ||1075 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))1076 last->flag |= REF_KNOWS_PEELED;1077 add_ref(dir, last);1078 continue;1079 }1080 if (last &&1081 line.buf[0] == '^' &&1082 line.len == PEELED_LINE_LENGTH &&1083 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&1084 !get_sha1_hex(line.buf + 1, sha1)) {1085 hashcpy(last->u.value.peeled.hash, sha1);1086 /*1087 * Regardless of what the file header said,1088 * we definitely know the value of *this*1089 * reference:1090 */1091 last->flag |= REF_KNOWS_PEELED;1092 }1093 }10941095 strbuf_release(&line);1096}10971098/*1099 * Get the packed_ref_cache for the specified ref_cache, creating it1100 * if necessary.1101 */1102static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1103{1104 char *packed_refs_file;11051106 if (*refs->name)1107 packed_refs_file = git_pathdup_submodule(refs->name, "packed-refs");1108 else1109 packed_refs_file = git_pathdup("packed-refs");11101111 if (refs->packed &&1112 !stat_validity_check(&refs->packed->validity, packed_refs_file))1113 clear_packed_ref_cache(refs);11141115 if (!refs->packed) {1116 FILE *f;11171118 refs->packed = xcalloc(1, sizeof(*refs->packed));1119 acquire_packed_ref_cache(refs->packed);1120 refs->packed->root = create_dir_entry(refs, "", 0, 0);1121 f = fopen(packed_refs_file, "r");1122 if (f) {1123 stat_validity_update(&refs->packed->validity, fileno(f));1124 read_packed_refs(f, get_ref_dir(refs->packed->root));1125 fclose(f);1126 }1127 }1128 free(packed_refs_file);1129 return refs->packed;1130}11311132static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1133{1134 return get_ref_dir(packed_ref_cache->root);1135}11361137static struct ref_dir *get_packed_refs(struct ref_cache *refs)1138{1139 return get_packed_ref_dir(get_packed_ref_cache(refs));1140}11411142/*1143 * Add a reference to the in-memory packed reference cache. This may1144 * only be called while the packed-refs file is locked (see1145 * lock_packed_refs()). To actually write the packed-refs file, call1146 * commit_packed_refs().1147 */1148static void add_packed_ref(const char *refname, const unsigned char *sha1)1149{1150 struct packed_ref_cache *packed_ref_cache =1151 get_packed_ref_cache(&ref_cache);11521153 if (!packed_ref_cache->lock)1154 die("internal error: packed refs not locked");1155 add_ref(get_packed_ref_dir(packed_ref_cache),1156 create_ref_entry(refname, sha1, REF_ISPACKED, 1));1157}11581159/*1160 * Read the loose references from the namespace dirname into dir1161 * (without recursing). dirname must end with '/'. dir must be the1162 * directory entry corresponding to dirname.1163 */1164static void read_loose_refs(const char *dirname, struct ref_dir *dir)1165{1166 struct ref_cache *refs = dir->ref_cache;1167 DIR *d;1168 struct dirent *de;1169 int dirnamelen = strlen(dirname);1170 struct strbuf refname;1171 struct strbuf path = STRBUF_INIT;1172 size_t path_baselen;11731174 if (*refs->name)1175 strbuf_git_path_submodule(&path, refs->name, "%s", dirname);1176 else1177 strbuf_git_path(&path, "%s", dirname);1178 path_baselen = path.len;11791180 d = opendir(path.buf);1181 if (!d) {1182 strbuf_release(&path);1183 return;1184 }11851186 strbuf_init(&refname, dirnamelen + 257);1187 strbuf_add(&refname, dirname, dirnamelen);11881189 while ((de = readdir(d)) != NULL) {1190 unsigned char sha1[20];1191 struct stat st;1192 int flag;11931194 if (de->d_name[0] == '.')1195 continue;1196 if (ends_with(de->d_name, ".lock"))1197 continue;1198 strbuf_addstr(&refname, de->d_name);1199 strbuf_addstr(&path, de->d_name);1200 if (stat(path.buf, &st) < 0) {1201 ; /* silently ignore */1202 } else if (S_ISDIR(st.st_mode)) {1203 strbuf_addch(&refname, '/');1204 add_entry_to_dir(dir,1205 create_dir_entry(refs, refname.buf,1206 refname.len, 1));1207 } else {1208 int read_ok;12091210 if (*refs->name) {1211 hashclr(sha1);1212 flag = 0;1213 read_ok = !resolve_gitlink_ref(refs->name,1214 refname.buf, sha1);1215 } else {1216 read_ok = !read_ref_full(refname.buf,1217 RESOLVE_REF_READING,1218 sha1, &flag);1219 }12201221 if (!read_ok) {1222 hashclr(sha1);1223 flag |= REF_ISBROKEN;1224 } else if (is_null_sha1(sha1)) {1225 /*1226 * It is so astronomically unlikely1227 * that NULL_SHA1 is the SHA-1 of an1228 * actual object that we consider its1229 * appearance in a loose reference1230 * file to be repo corruption1231 * (probably due to a software bug).1232 */1233 flag |= REF_ISBROKEN;1234 }12351236 if (check_refname_format(refname.buf,1237 REFNAME_ALLOW_ONELEVEL)) {1238 if (!refname_is_safe(refname.buf))1239 die("loose refname is dangerous: %s", refname.buf);1240 hashclr(sha1);1241 flag |= REF_BAD_NAME | REF_ISBROKEN;1242 }1243 add_entry_to_dir(dir,1244 create_ref_entry(refname.buf, sha1, flag, 0));1245 }1246 strbuf_setlen(&refname, dirnamelen);1247 strbuf_setlen(&path, path_baselen);1248 }1249 strbuf_release(&refname);1250 strbuf_release(&path);1251 closedir(d);1252}12531254static struct ref_dir *get_loose_refs(struct ref_cache *refs)1255{1256 if (!refs->loose) {1257 /*1258 * Mark the top-level directory complete because we1259 * are about to read the only subdirectory that can1260 * hold references:1261 */1262 refs->loose = create_dir_entry(refs, "", 0, 0);1263 /*1264 * Create an incomplete entry for "refs/":1265 */1266 add_entry_to_dir(get_ref_dir(refs->loose),1267 create_dir_entry(refs, "refs/", 5, 1));1268 }1269 return get_ref_dir(refs->loose);1270}12711272/* We allow "recursive" symbolic refs. Only within reason, though */1273#define MAXDEPTH 51274#define MAXREFLEN (1024)12751276/*1277 * Called by resolve_gitlink_ref_recursive() after it failed to read1278 * from the loose refs in ref_cache refs. Find <refname> in the1279 * packed-refs file for the submodule.1280 */1281static int resolve_gitlink_packed_ref(struct ref_cache *refs,1282 const char *refname, unsigned char *sha1)1283{1284 struct ref_entry *ref;1285 struct ref_dir *dir = get_packed_refs(refs);12861287 ref = find_ref(dir, refname);1288 if (ref == NULL)1289 return -1;12901291 hashcpy(sha1, ref->u.value.oid.hash);1292 return 0;1293}12941295static int resolve_gitlink_ref_recursive(struct ref_cache *refs,1296 const char *refname, unsigned char *sha1,1297 int recursion)1298{1299 int fd, len;1300 char buffer[128], *p;1301 char *path;13021303 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)1304 return -1;1305 path = *refs->name1306 ? git_pathdup_submodule(refs->name, "%s", refname)1307 : git_pathdup("%s", refname);1308 fd = open(path, O_RDONLY);1309 free(path);1310 if (fd < 0)1311 return resolve_gitlink_packed_ref(refs, refname, sha1);13121313 len = read(fd, buffer, sizeof(buffer)-1);1314 close(fd);1315 if (len < 0)1316 return -1;1317 while (len && isspace(buffer[len-1]))1318 len--;1319 buffer[len] = 0;13201321 /* Was it a detached head or an old-fashioned symlink? */1322 if (!get_sha1_hex(buffer, sha1))1323 return 0;13241325 /* Symref? */1326 if (strncmp(buffer, "ref:", 4))1327 return -1;1328 p = buffer + 4;1329 while (isspace(*p))1330 p++;13311332 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1333}13341335int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)1336{1337 int len = strlen(path), retval;1338 struct strbuf submodule = STRBUF_INIT;1339 struct ref_cache *refs;13401341 while (len && path[len-1] == '/')1342 len--;1343 if (!len)1344 return -1;13451346 strbuf_add(&submodule, path, len);1347 refs = lookup_ref_cache(submodule.buf);1348 if (!refs) {1349 if (!is_nonbare_repository_dir(&submodule)) {1350 strbuf_release(&submodule);1351 return -1;1352 }1353 refs = create_ref_cache(submodule.buf);1354 }1355 strbuf_release(&submodule);13561357 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);1358 return retval;1359}13601361/*1362 * Return the ref_entry for the given refname from the packed1363 * references. If it does not exist, return NULL.1364 */1365static struct ref_entry *get_packed_ref(const char *refname)1366{1367 return find_ref(get_packed_refs(&ref_cache), refname);1368}13691370/*1371 * A loose ref file doesn't exist; check for a packed ref.1372 */1373static int resolve_missing_loose_ref(const char *refname,1374 unsigned char *sha1,1375 int *flags)1376{1377 struct ref_entry *entry;13781379 /*1380 * The loose reference file does not exist; check for a packed1381 * reference.1382 */1383 entry = get_packed_ref(refname);1384 if (entry) {1385 hashcpy(sha1, entry->u.value.oid.hash);1386 *flags |= REF_ISPACKED;1387 return 0;1388 }1389 /* refname is not a packed reference. */1390 return -1;1391}13921393/* This function needs to return a meaningful errno on failure */1394static const char *resolve_ref_1(const char *refname,1395 int resolve_flags,1396 unsigned char *sha1,1397 int *flags,1398 struct strbuf *sb_refname,1399 struct strbuf *sb_path,1400 struct strbuf *sb_contents)1401{1402 int symref_count;14031404 *flags = 0;14051406 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1407 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1408 !refname_is_safe(refname)) {1409 errno = EINVAL;1410 return NULL;1411 }14121413 /*1414 * dwim_ref() uses REF_ISBROKEN to distinguish between1415 * missing refs and refs that were present but invalid,1416 * to complain about the latter to stderr.1417 *1418 * We don't know whether the ref exists, so don't set1419 * REF_ISBROKEN yet.1420 */1421 *flags |= REF_BAD_NAME;1422 }14231424 for (symref_count = 0; symref_count < MAXDEPTH; symref_count++) {1425 const char *path;1426 struct stat st;1427 int fd;14281429 strbuf_reset(sb_path);1430 strbuf_git_path(sb_path, "%s", refname);1431 path = sb_path->buf;14321433 /*1434 * We might have to loop back here to avoid a race1435 * condition: first we lstat() the file, then we try1436 * to read it as a link or as a file. But if somebody1437 * changes the type of the file (file <-> directory1438 * <-> symlink) between the lstat() and reading, then1439 * we don't want to report that as an error but rather1440 * try again starting with the lstat().1441 */1442 stat_ref:1443 if (lstat(path, &st) < 0) {1444 if (errno != ENOENT)1445 return NULL;1446 if (resolve_missing_loose_ref(refname, sha1, flags)) {1447 if (resolve_flags & RESOLVE_REF_READING) {1448 errno = ENOENT;1449 return NULL;1450 }1451 hashclr(sha1);1452 }1453 if (*flags & REF_BAD_NAME) {1454 hashclr(sha1);1455 *flags |= REF_ISBROKEN;1456 }1457 return refname;1458 }14591460 /* Follow "normalized" - ie "refs/.." symlinks by hand */1461 if (S_ISLNK(st.st_mode)) {1462 strbuf_reset(sb_contents);1463 if (strbuf_readlink(sb_contents, path, 0) < 0) {1464 if (errno == ENOENT || errno == EINVAL)1465 /* inconsistent with lstat; retry */1466 goto stat_ref;1467 else1468 return NULL;1469 }1470 if (starts_with(sb_contents->buf, "refs/") &&1471 !check_refname_format(sb_contents->buf, 0)) {1472 strbuf_swap(sb_refname, sb_contents);1473 refname = sb_refname->buf;1474 *flags |= REF_ISSYMREF;1475 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {1476 hashclr(sha1);1477 return refname;1478 }1479 continue;1480 }1481 }14821483 /* Is it a directory? */1484 if (S_ISDIR(st.st_mode)) {1485 errno = EISDIR;1486 return NULL;1487 }14881489 /*1490 * Anything else, just open it and try to use it as1491 * a ref1492 */1493 fd = open(path, O_RDONLY);1494 if (fd < 0) {1495 if (errno == ENOENT)1496 /* inconsistent with lstat; retry */1497 goto stat_ref;1498 else1499 return NULL;1500 }1501 strbuf_reset(sb_contents);1502 if (strbuf_read(sb_contents, fd, 256) < 0) {1503 int save_errno = errno;1504 close(fd);1505 errno = save_errno;1506 return NULL;1507 }1508 close(fd);1509 strbuf_rtrim(sb_contents);15101511 /*1512 * Is it a symbolic ref?1513 */1514 if (!starts_with(sb_contents->buf, "ref:")) {1515 /*1516 * Please note that FETCH_HEAD has a second1517 * line containing other data.1518 */1519 if (get_sha1_hex(sb_contents->buf, sha1) ||1520 (sb_contents->buf[40] != '\0' && !isspace(sb_contents->buf[40]))) {1521 *flags |= REF_ISBROKEN;1522 errno = EINVAL;1523 return NULL;1524 }1525 if (*flags & REF_BAD_NAME) {1526 hashclr(sha1);1527 *flags |= REF_ISBROKEN;1528 }1529 return refname;1530 }1531 *flags |= REF_ISSYMREF;1532 refname = sb_contents->buf + 4;1533 while (isspace(*refname))1534 refname++;1535 strbuf_reset(sb_refname);1536 strbuf_addstr(sb_refname, refname);1537 refname = sb_refname->buf;1538 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {1539 hashclr(sha1);1540 return refname;1541 }1542 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1543 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1544 !refname_is_safe(refname)) {1545 errno = EINVAL;1546 return NULL;1547 }15481549 *flags |= REF_ISBROKEN | REF_BAD_NAME;1550 }1551 }15521553 errno = ELOOP;1554 return NULL;1555}15561557const char *resolve_ref_unsafe(const char *refname, int resolve_flags,1558 unsigned char *sha1, int *flags)1559{1560 static struct strbuf sb_refname = STRBUF_INIT;1561 struct strbuf sb_contents = STRBUF_INIT;1562 struct strbuf sb_path = STRBUF_INIT;1563 int unused_flags;1564 const char *ret;15651566 if (!flags)1567 flags = &unused_flags;15681569 ret = resolve_ref_1(refname, resolve_flags, sha1, flags,1570 &sb_refname, &sb_path, &sb_contents);1571 strbuf_release(&sb_path);1572 strbuf_release(&sb_contents);1573 return ret;1574}15751576/*1577 * Peel the entry (if possible) and return its new peel_status. If1578 * repeel is true, re-peel the entry even if there is an old peeled1579 * value that is already stored in it.1580 *1581 * It is OK to call this function with a packed reference entry that1582 * might be stale and might even refer to an object that has since1583 * been garbage-collected. In such a case, if the entry has1584 * REF_KNOWS_PEELED then leave the status unchanged and return1585 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1586 */1587static enum peel_status peel_entry(struct ref_entry *entry, int repeel)1588{1589 enum peel_status status;15901591 if (entry->flag & REF_KNOWS_PEELED) {1592 if (repeel) {1593 entry->flag &= ~REF_KNOWS_PEELED;1594 oidclr(&entry->u.value.peeled);1595 } else {1596 return is_null_oid(&entry->u.value.peeled) ?1597 PEEL_NON_TAG : PEEL_PEELED;1598 }1599 }1600 if (entry->flag & REF_ISBROKEN)1601 return PEEL_BROKEN;1602 if (entry->flag & REF_ISSYMREF)1603 return PEEL_IS_SYMREF;16041605 status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1606 if (status == PEEL_PEELED || status == PEEL_NON_TAG)1607 entry->flag |= REF_KNOWS_PEELED;1608 return status;1609}16101611int peel_ref(const char *refname, unsigned char *sha1)1612{1613 int flag;1614 unsigned char base[20];16151616 if (current_ref && (current_ref->name == refname1617 || !strcmp(current_ref->name, refname))) {1618 if (peel_entry(current_ref, 0))1619 return -1;1620 hashcpy(sha1, current_ref->u.value.peeled.hash);1621 return 0;1622 }16231624 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1625 return -1;16261627 /*1628 * If the reference is packed, read its ref_entry from the1629 * cache in the hope that we already know its peeled value.1630 * We only try this optimization on packed references because1631 * (a) forcing the filling of the loose reference cache could1632 * be expensive and (b) loose references anyway usually do not1633 * have REF_KNOWS_PEELED.1634 */1635 if (flag & REF_ISPACKED) {1636 struct ref_entry *r = get_packed_ref(refname);1637 if (r) {1638 if (peel_entry(r, 0))1639 return -1;1640 hashcpy(sha1, r->u.value.peeled.hash);1641 return 0;1642 }1643 }16441645 return peel_object(base, sha1);1646}16471648/*1649 * Call fn for each reference in the specified ref_cache, omitting1650 * references not in the containing_dir of base. fn is called for all1651 * references, including broken ones. If fn ever returns a non-zero1652 * value, stop the iteration and return that value; otherwise, return1653 * 0.1654 */1655static int do_for_each_entry(struct ref_cache *refs, const char *base,1656 each_ref_entry_fn fn, void *cb_data)1657{1658 struct packed_ref_cache *packed_ref_cache;1659 struct ref_dir *loose_dir;1660 struct ref_dir *packed_dir;1661 int retval = 0;16621663 /*1664 * We must make sure that all loose refs are read before accessing the1665 * packed-refs file; this avoids a race condition in which loose refs1666 * are migrated to the packed-refs file by a simultaneous process, but1667 * our in-memory view is from before the migration. get_packed_ref_cache()1668 * takes care of making sure our view is up to date with what is on1669 * disk.1670 */1671 loose_dir = get_loose_refs(refs);1672 if (base && *base) {1673 loose_dir = find_containing_dir(loose_dir, base, 0);1674 }1675 if (loose_dir)1676 prime_ref_dir(loose_dir);16771678 packed_ref_cache = get_packed_ref_cache(refs);1679 acquire_packed_ref_cache(packed_ref_cache);1680 packed_dir = get_packed_ref_dir(packed_ref_cache);1681 if (base && *base) {1682 packed_dir = find_containing_dir(packed_dir, base, 0);1683 }16841685 if (packed_dir && loose_dir) {1686 sort_ref_dir(packed_dir);1687 sort_ref_dir(loose_dir);1688 retval = do_for_each_entry_in_dirs(1689 packed_dir, loose_dir, fn, cb_data);1690 } else if (packed_dir) {1691 sort_ref_dir(packed_dir);1692 retval = do_for_each_entry_in_dir(1693 packed_dir, 0, fn, cb_data);1694 } else if (loose_dir) {1695 sort_ref_dir(loose_dir);1696 retval = do_for_each_entry_in_dir(1697 loose_dir, 0, fn, cb_data);1698 }16991700 release_packed_ref_cache(packed_ref_cache);1701 return retval;1702}17031704/*1705 * Call fn for each reference in the specified ref_cache for which the1706 * refname begins with base. If trim is non-zero, then trim that many1707 * characters off the beginning of each refname before passing the1708 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include1709 * broken references in the iteration. If fn ever returns a non-zero1710 * value, stop the iteration and return that value; otherwise, return1711 * 0.1712 */1713int do_for_each_ref(const char *submodule, const char *base,1714 each_ref_fn fn, int trim, int flags, void *cb_data)1715{1716 struct ref_entry_cb data;1717 struct ref_cache *refs;17181719 refs = get_ref_cache(submodule);1720 data.base = base;1721 data.trim = trim;1722 data.flags = flags;1723 data.fn = fn;1724 data.cb_data = cb_data;17251726 if (ref_paranoia < 0)1727 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);1728 if (ref_paranoia)1729 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;17301731 return do_for_each_entry(refs, base, do_one_ref, &data);1732}17331734static void unlock_ref(struct ref_lock *lock)1735{1736 /* Do not free lock->lk -- atexit() still looks at them */1737 if (lock->lk)1738 rollback_lock_file(lock->lk);1739 free(lock->ref_name);1740 free(lock->orig_ref_name);1741 free(lock);1742}17431744/*1745 * Verify that the reference locked by lock has the value old_sha1.1746 * Fail if the reference doesn't exist and mustexist is set. Return 01747 * on success. On error, write an error message to err, set errno, and1748 * return a negative value.1749 */1750static int verify_lock(struct ref_lock *lock,1751 const unsigned char *old_sha1, int mustexist,1752 struct strbuf *err)1753{1754 assert(err);17551756 if (read_ref_full(lock->ref_name,1757 mustexist ? RESOLVE_REF_READING : 0,1758 lock->old_oid.hash, NULL)) {1759 if (old_sha1) {1760 int save_errno = errno;1761 strbuf_addf(err, "can't verify ref %s", lock->ref_name);1762 errno = save_errno;1763 return -1;1764 } else {1765 hashclr(lock->old_oid.hash);1766 return 0;1767 }1768 }1769 if (old_sha1 && hashcmp(lock->old_oid.hash, old_sha1)) {1770 strbuf_addf(err, "ref %s is at %s but expected %s",1771 lock->ref_name,1772 sha1_to_hex(lock->old_oid.hash),1773 sha1_to_hex(old_sha1));1774 errno = EBUSY;1775 return -1;1776 }1777 return 0;1778}17791780static int remove_empty_directories(struct strbuf *path)1781{1782 /*1783 * we want to create a file but there is a directory there;1784 * if that is an empty directory (or a directory that contains1785 * only empty directories), remove them.1786 */1787 return remove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);1788}17891790/*1791 * Locks a ref returning the lock on success and NULL on failure.1792 * On failure errno is set to something meaningful.1793 */1794static struct ref_lock *lock_ref_sha1_basic(const char *refname,1795 const unsigned char *old_sha1,1796 const struct string_list *extras,1797 const struct string_list *skip,1798 unsigned int flags, int *type_p,1799 struct strbuf *err)1800{1801 struct strbuf ref_file = STRBUF_INIT;1802 struct strbuf orig_ref_file = STRBUF_INIT;1803 const char *orig_refname = refname;1804 struct ref_lock *lock;1805 int last_errno = 0;1806 int type;1807 int lflags = 0;1808 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));1809 int resolve_flags = 0;1810 int attempts_remaining = 3;18111812 assert(err);18131814 lock = xcalloc(1, sizeof(struct ref_lock));18151816 if (mustexist)1817 resolve_flags |= RESOLVE_REF_READING;1818 if (flags & REF_DELETING)1819 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;1820 if (flags & REF_NODEREF) {1821 resolve_flags |= RESOLVE_REF_NO_RECURSE;1822 lflags |= LOCK_NO_DEREF;1823 }18241825 refname = resolve_ref_unsafe(refname, resolve_flags,1826 lock->old_oid.hash, &type);1827 if (!refname && errno == EISDIR) {1828 /*1829 * we are trying to lock foo but we used to1830 * have foo/bar which now does not exist;1831 * it is normal for the empty directory 'foo'1832 * to remain.1833 */1834 strbuf_git_path(&orig_ref_file, "%s", orig_refname);1835 if (remove_empty_directories(&orig_ref_file)) {1836 last_errno = errno;1837 if (!verify_refname_available_dir(orig_refname, extras, skip,1838 get_loose_refs(&ref_cache), err))1839 strbuf_addf(err, "there are still refs under '%s'",1840 orig_refname);1841 goto error_return;1842 }1843 refname = resolve_ref_unsafe(orig_refname, resolve_flags,1844 lock->old_oid.hash, &type);1845 }1846 if (type_p)1847 *type_p = type;1848 if (!refname) {1849 last_errno = errno;1850 if (last_errno != ENOTDIR ||1851 !verify_refname_available_dir(orig_refname, extras, skip,1852 get_loose_refs(&ref_cache), err))1853 strbuf_addf(err, "unable to resolve reference %s: %s",1854 orig_refname, strerror(last_errno));18551856 goto error_return;1857 }18581859 if (flags & REF_NODEREF)1860 refname = orig_refname;18611862 /*1863 * If the ref did not exist and we are creating it, make sure1864 * there is no existing packed ref whose name begins with our1865 * refname, nor a packed ref whose name is a proper prefix of1866 * our refname.1867 */1868 if (is_null_oid(&lock->old_oid) &&1869 verify_refname_available_dir(refname, extras, skip,1870 get_packed_refs(&ref_cache), err)) {1871 last_errno = ENOTDIR;1872 goto error_return;1873 }18741875 lock->lk = xcalloc(1, sizeof(struct lock_file));18761877 lock->ref_name = xstrdup(refname);1878 lock->orig_ref_name = xstrdup(orig_refname);1879 strbuf_git_path(&ref_file, "%s", refname);18801881 retry:1882 switch (safe_create_leading_directories_const(ref_file.buf)) {1883 case SCLD_OK:1884 break; /* success */1885 case SCLD_VANISHED:1886 if (--attempts_remaining > 0)1887 goto retry;1888 /* fall through */1889 default:1890 last_errno = errno;1891 strbuf_addf(err, "unable to create directory for %s",1892 ref_file.buf);1893 goto error_return;1894 }18951896 if (hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) < 0) {1897 last_errno = errno;1898 if (errno == ENOENT && --attempts_remaining > 0)1899 /*1900 * Maybe somebody just deleted one of the1901 * directories leading to ref_file. Try1902 * again:1903 */1904 goto retry;1905 else {1906 unable_to_lock_message(ref_file.buf, errno, err);1907 goto error_return;1908 }1909 }1910 if (verify_lock(lock, old_sha1, mustexist, err)) {1911 last_errno = errno;1912 goto error_return;1913 }1914 goto out;19151916 error_return:1917 unlock_ref(lock);1918 lock = NULL;19191920 out:1921 strbuf_release(&ref_file);1922 strbuf_release(&orig_ref_file);1923 errno = last_errno;1924 return lock;1925}19261927/*1928 * Write an entry to the packed-refs file for the specified refname.1929 * If peeled is non-NULL, write it as the entry's peeled value.1930 */1931static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,1932 unsigned char *peeled)1933{1934 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);1935 if (peeled)1936 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));1937}19381939/*1940 * An each_ref_entry_fn that writes the entry to a packed-refs file.1941 */1942static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)1943{1944 enum peel_status peel_status = peel_entry(entry, 0);19451946 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)1947 error("internal error: %s is not a valid packed reference!",1948 entry->name);1949 write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,1950 peel_status == PEEL_PEELED ?1951 entry->u.value.peeled.hash : NULL);1952 return 0;1953}19541955/*1956 * Lock the packed-refs file for writing. Flags is passed to1957 * hold_lock_file_for_update(). Return 0 on success. On errors, set1958 * errno appropriately and return a nonzero value.1959 */1960static int lock_packed_refs(int flags)1961{1962 static int timeout_configured = 0;1963 static int timeout_value = 1000;19641965 struct packed_ref_cache *packed_ref_cache;19661967 if (!timeout_configured) {1968 git_config_get_int("core.packedrefstimeout", &timeout_value);1969 timeout_configured = 1;1970 }19711972 if (hold_lock_file_for_update_timeout(1973 &packlock, git_path("packed-refs"),1974 flags, timeout_value) < 0)1975 return -1;1976 /*1977 * Get the current packed-refs while holding the lock. If the1978 * packed-refs file has been modified since we last read it,1979 * this will automatically invalidate the cache and re-read1980 * the packed-refs file.1981 */1982 packed_ref_cache = get_packed_ref_cache(&ref_cache);1983 packed_ref_cache->lock = &packlock;1984 /* Increment the reference count to prevent it from being freed: */1985 acquire_packed_ref_cache(packed_ref_cache);1986 return 0;1987}19881989/*1990 * Write the current version of the packed refs cache from memory to1991 * disk. The packed-refs file must already be locked for writing (see1992 * lock_packed_refs()). Return zero on success. On errors, set errno1993 * and return a nonzero value1994 */1995static int commit_packed_refs(void)1996{1997 struct packed_ref_cache *packed_ref_cache =1998 get_packed_ref_cache(&ref_cache);1999 int error = 0;2000 int save_errno = 0;2001 FILE *out;20022003 if (!packed_ref_cache->lock)2004 die("internal error: packed-refs not locked");20052006 out = fdopen_lock_file(packed_ref_cache->lock, "w");2007 if (!out)2008 die_errno("unable to fdopen packed-refs descriptor");20092010 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);2011 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),2012 0, write_packed_entry_fn, out);20132014 if (commit_lock_file(packed_ref_cache->lock)) {2015 save_errno = errno;2016 error = -1;2017 }2018 packed_ref_cache->lock = NULL;2019 release_packed_ref_cache(packed_ref_cache);2020 errno = save_errno;2021 return error;2022}20232024/*2025 * Rollback the lockfile for the packed-refs file, and discard the2026 * in-memory packed reference cache. (The packed-refs file will be2027 * read anew if it is needed again after this function is called.)2028 */2029static void rollback_packed_refs(void)2030{2031 struct packed_ref_cache *packed_ref_cache =2032 get_packed_ref_cache(&ref_cache);20332034 if (!packed_ref_cache->lock)2035 die("internal error: packed-refs not locked");2036 rollback_lock_file(packed_ref_cache->lock);2037 packed_ref_cache->lock = NULL;2038 release_packed_ref_cache(packed_ref_cache);2039 clear_packed_ref_cache(&ref_cache);2040}20412042struct ref_to_prune {2043 struct ref_to_prune *next;2044 unsigned char sha1[20];2045 char name[FLEX_ARRAY];2046};20472048struct pack_refs_cb_data {2049 unsigned int flags;2050 struct ref_dir *packed_refs;2051 struct ref_to_prune *ref_to_prune;2052};20532054/*2055 * An each_ref_entry_fn that is run over loose references only. If2056 * the loose reference can be packed, add an entry in the packed ref2057 * cache. If the reference should be pruned, also add it to2058 * ref_to_prune in the pack_refs_cb_data.2059 */2060static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)2061{2062 struct pack_refs_cb_data *cb = cb_data;2063 enum peel_status peel_status;2064 struct ref_entry *packed_entry;2065 int is_tag_ref = starts_with(entry->name, "refs/tags/");20662067 /* Do not pack per-worktree refs: */2068 if (ref_type(entry->name) != REF_TYPE_NORMAL)2069 return 0;20702071 /* ALWAYS pack tags */2072 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2073 return 0;20742075 /* Do not pack symbolic or broken refs: */2076 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2077 return 0;20782079 /* Add a packed ref cache entry equivalent to the loose entry. */2080 peel_status = peel_entry(entry, 1);2081 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2082 die("internal error peeling reference %s (%s)",2083 entry->name, oid_to_hex(&entry->u.value.oid));2084 packed_entry = find_ref(cb->packed_refs, entry->name);2085 if (packed_entry) {2086 /* Overwrite existing packed entry with info from loose entry */2087 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2088 oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2089 } else {2090 packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,2091 REF_ISPACKED | REF_KNOWS_PEELED, 0);2092 add_ref(cb->packed_refs, packed_entry);2093 }2094 oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);20952096 /* Schedule the loose reference for pruning if requested. */2097 if ((cb->flags & PACK_REFS_PRUNE)) {2098 struct ref_to_prune *n;2099 FLEX_ALLOC_STR(n, name, entry->name);2100 hashcpy(n->sha1, entry->u.value.oid.hash);2101 n->next = cb->ref_to_prune;2102 cb->ref_to_prune = n;2103 }2104 return 0;2105}21062107/*2108 * Remove empty parents, but spare refs/ and immediate subdirs.2109 * Note: munges *name.2110 */2111static void try_remove_empty_parents(char *name)2112{2113 char *p, *q;2114 int i;2115 p = name;2116 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */2117 while (*p && *p != '/')2118 p++;2119 /* tolerate duplicate slashes; see check_refname_format() */2120 while (*p == '/')2121 p++;2122 }2123 for (q = p; *q; q++)2124 ;2125 while (1) {2126 while (q > p && *q != '/')2127 q--;2128 while (q > p && *(q-1) == '/')2129 q--;2130 if (q == p)2131 break;2132 *q = '\0';2133 if (rmdir(git_path("%s", name)))2134 break;2135 }2136}21372138/* make sure nobody touched the ref, and unlink */2139static void prune_ref(struct ref_to_prune *r)2140{2141 struct ref_transaction *transaction;2142 struct strbuf err = STRBUF_INIT;21432144 if (check_refname_format(r->name, 0))2145 return;21462147 transaction = ref_transaction_begin(&err);2148 if (!transaction ||2149 ref_transaction_delete(transaction, r->name, r->sha1,2150 REF_ISPRUNING, NULL, &err) ||2151 ref_transaction_commit(transaction, &err)) {2152 ref_transaction_free(transaction);2153 error("%s", err.buf);2154 strbuf_release(&err);2155 return;2156 }2157 ref_transaction_free(transaction);2158 strbuf_release(&err);2159 try_remove_empty_parents(r->name);2160}21612162static void prune_refs(struct ref_to_prune *r)2163{2164 while (r) {2165 prune_ref(r);2166 r = r->next;2167 }2168}21692170int pack_refs(unsigned int flags)2171{2172 struct pack_refs_cb_data cbdata;21732174 memset(&cbdata, 0, sizeof(cbdata));2175 cbdata.flags = flags;21762177 lock_packed_refs(LOCK_DIE_ON_ERROR);2178 cbdata.packed_refs = get_packed_refs(&ref_cache);21792180 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,2181 pack_if_possible_fn, &cbdata);21822183 if (commit_packed_refs())2184 die_errno("unable to overwrite old ref-pack file");21852186 prune_refs(cbdata.ref_to_prune);2187 return 0;2188}21892190/*2191 * Rewrite the packed-refs file, omitting any refs listed in2192 * 'refnames'. On error, leave packed-refs unchanged, write an error2193 * message to 'err', and return a nonzero value.2194 *2195 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2196 */2197static int repack_without_refs(struct string_list *refnames, struct strbuf *err)2198{2199 struct ref_dir *packed;2200 struct string_list_item *refname;2201 int ret, needs_repacking = 0, removed = 0;22022203 assert(err);22042205 /* Look for a packed ref */2206 for_each_string_list_item(refname, refnames) {2207 if (get_packed_ref(refname->string)) {2208 needs_repacking = 1;2209 break;2210 }2211 }22122213 /* Avoid locking if we have nothing to do */2214 if (!needs_repacking)2215 return 0; /* no refname exists in packed refs */22162217 if (lock_packed_refs(0)) {2218 unable_to_lock_message(git_path("packed-refs"), errno, err);2219 return -1;2220 }2221 packed = get_packed_refs(&ref_cache);22222223 /* Remove refnames from the cache */2224 for_each_string_list_item(refname, refnames)2225 if (remove_entry(packed, refname->string) != -1)2226 removed = 1;2227 if (!removed) {2228 /*2229 * All packed entries disappeared while we were2230 * acquiring the lock.2231 */2232 rollback_packed_refs();2233 return 0;2234 }22352236 /* Write what remains */2237 ret = commit_packed_refs();2238 if (ret)2239 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",2240 strerror(errno));2241 return ret;2242}22432244static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)2245{2246 assert(err);22472248 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2249 /*2250 * loose. The loose file name is the same as the2251 * lockfile name, minus ".lock":2252 */2253 char *loose_filename = get_locked_file_path(lock->lk);2254 int res = unlink_or_msg(loose_filename, err);2255 free(loose_filename);2256 if (res)2257 return 1;2258 }2259 return 0;2260}22612262int delete_refs(struct string_list *refnames)2263{2264 struct strbuf err = STRBUF_INIT;2265 int i, result = 0;22662267 if (!refnames->nr)2268 return 0;22692270 result = repack_without_refs(refnames, &err);2271 if (result) {2272 /*2273 * If we failed to rewrite the packed-refs file, then2274 * it is unsafe to try to remove loose refs, because2275 * doing so might expose an obsolete packed value for2276 * a reference that might even point at an object that2277 * has been garbage collected.2278 */2279 if (refnames->nr == 1)2280 error(_("could not delete reference %s: %s"),2281 refnames->items[0].string, err.buf);2282 else2283 error(_("could not delete references: %s"), err.buf);22842285 goto out;2286 }22872288 for (i = 0; i < refnames->nr; i++) {2289 const char *refname = refnames->items[i].string;22902291 if (delete_ref(refname, NULL, 0))2292 result |= error(_("could not remove reference %s"), refname);2293 }22942295out:2296 strbuf_release(&err);2297 return result;2298}22992300/*2301 * People using contrib's git-new-workdir have .git/logs/refs ->2302 * /some/other/path/.git/logs/refs, and that may live on another device.2303 *2304 * IOW, to avoid cross device rename errors, the temporary renamed log must2305 * live into logs/refs.2306 */2307#define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"23082309static int rename_tmp_log(const char *newrefname)2310{2311 int attempts_remaining = 4;2312 struct strbuf path = STRBUF_INIT;2313 int ret = -1;23142315 retry:2316 strbuf_reset(&path);2317 strbuf_git_path(&path, "logs/%s", newrefname);2318 switch (safe_create_leading_directories_const(path.buf)) {2319 case SCLD_OK:2320 break; /* success */2321 case SCLD_VANISHED:2322 if (--attempts_remaining > 0)2323 goto retry;2324 /* fall through */2325 default:2326 error("unable to create directory for %s", newrefname);2327 goto out;2328 }23292330 if (rename(git_path(TMP_RENAMED_LOG), path.buf)) {2331 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {2332 /*2333 * rename(a, b) when b is an existing2334 * directory ought to result in ISDIR, but2335 * Solaris 5.8 gives ENOTDIR. Sheesh.2336 */2337 if (remove_empty_directories(&path)) {2338 error("Directory not empty: logs/%s", newrefname);2339 goto out;2340 }2341 goto retry;2342 } else if (errno == ENOENT && --attempts_remaining > 0) {2343 /*2344 * Maybe another process just deleted one of2345 * the directories in the path to newrefname.2346 * Try again from the beginning.2347 */2348 goto retry;2349 } else {2350 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",2351 newrefname, strerror(errno));2352 goto out;2353 }2354 }2355 ret = 0;2356out:2357 strbuf_release(&path);2358 return ret;2359}23602361int verify_refname_available(const char *newname,2362 struct string_list *extras,2363 struct string_list *skip,2364 struct strbuf *err)2365{2366 struct ref_dir *packed_refs = get_packed_refs(&ref_cache);2367 struct ref_dir *loose_refs = get_loose_refs(&ref_cache);23682369 if (verify_refname_available_dir(newname, extras, skip,2370 packed_refs, err) ||2371 verify_refname_available_dir(newname, extras, skip,2372 loose_refs, err))2373 return -1;23742375 return 0;2376}23772378static int write_ref_to_lockfile(struct ref_lock *lock,2379 const unsigned char *sha1, struct strbuf *err);2380static int commit_ref_update(struct ref_lock *lock,2381 const unsigned char *sha1, const char *logmsg,2382 int flags, struct strbuf *err);23832384int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)2385{2386 unsigned char sha1[20], orig_sha1[20];2387 int flag = 0, logmoved = 0;2388 struct ref_lock *lock;2389 struct stat loginfo;2390 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2391 const char *symref = NULL;2392 struct strbuf err = STRBUF_INIT;23932394 if (log && S_ISLNK(loginfo.st_mode))2395 return error("reflog for %s is a symlink", oldrefname);23962397 symref = resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,2398 orig_sha1, &flag);2399 if (flag & REF_ISSYMREF)2400 return error("refname %s is a symbolic ref, renaming it is not supported",2401 oldrefname);2402 if (!symref)2403 return error("refname %s not found", oldrefname);24042405 if (!rename_ref_available(oldrefname, newrefname))2406 return 1;24072408 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))2409 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",2410 oldrefname, strerror(errno));24112412 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2413 error("unable to delete old %s", oldrefname);2414 goto rollback;2415 }24162417 if (!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&2418 delete_ref(newrefname, sha1, REF_NODEREF)) {2419 if (errno==EISDIR) {2420 struct strbuf path = STRBUF_INIT;2421 int result;24222423 strbuf_git_path(&path, "%s", newrefname);2424 result = remove_empty_directories(&path);2425 strbuf_release(&path);24262427 if (result) {2428 error("Directory not empty: %s", newrefname);2429 goto rollback;2430 }2431 } else {2432 error("unable to delete existing %s", newrefname);2433 goto rollback;2434 }2435 }24362437 if (log && rename_tmp_log(newrefname))2438 goto rollback;24392440 logmoved = log;24412442 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, 0, NULL, &err);2443 if (!lock) {2444 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);2445 strbuf_release(&err);2446 goto rollback;2447 }2448 hashcpy(lock->old_oid.hash, orig_sha1);24492450 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||2451 commit_ref_update(lock, orig_sha1, logmsg, 0, &err)) {2452 error("unable to write current sha1 into %s: %s", newrefname, err.buf);2453 strbuf_release(&err);2454 goto rollback;2455 }24562457 return 0;24582459 rollback:2460 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, 0, NULL, &err);2461 if (!lock) {2462 error("unable to lock %s for rollback: %s", oldrefname, err.buf);2463 strbuf_release(&err);2464 goto rollbacklog;2465 }24662467 flag = log_all_ref_updates;2468 log_all_ref_updates = 0;2469 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||2470 commit_ref_update(lock, orig_sha1, NULL, 0, &err)) {2471 error("unable to write current sha1 into %s: %s", oldrefname, err.buf);2472 strbuf_release(&err);2473 }2474 log_all_ref_updates = flag;24752476 rollbacklog:2477 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))2478 error("unable to restore logfile %s from %s: %s",2479 oldrefname, newrefname, strerror(errno));2480 if (!logmoved && log &&2481 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))2482 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",2483 oldrefname, strerror(errno));24842485 return 1;2486}24872488static int close_ref(struct ref_lock *lock)2489{2490 if (close_lock_file(lock->lk))2491 return -1;2492 return 0;2493}24942495static int commit_ref(struct ref_lock *lock)2496{2497 if (commit_lock_file(lock->lk))2498 return -1;2499 return 0;2500}25012502/*2503 * Create a reflog for a ref. If force_create = 0, the reflog will2504 * only be created for certain refs (those for which2505 * should_autocreate_reflog returns non-zero. Otherwise, create it2506 * regardless of the ref name. Fill in *err and return -1 on failure.2507 */2508static int log_ref_setup(const char *refname, struct strbuf *logfile, struct strbuf *err, int force_create)2509{2510 int logfd, oflags = O_APPEND | O_WRONLY;25112512 strbuf_git_path(logfile, "logs/%s", refname);2513 if (force_create || should_autocreate_reflog(refname)) {2514 if (safe_create_leading_directories(logfile->buf) < 0) {2515 strbuf_addf(err, "unable to create directory for %s: "2516 "%s", logfile->buf, strerror(errno));2517 return -1;2518 }2519 oflags |= O_CREAT;2520 }25212522 logfd = open(logfile->buf, oflags, 0666);2523 if (logfd < 0) {2524 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2525 return 0;25262527 if (errno == EISDIR) {2528 if (remove_empty_directories(logfile)) {2529 strbuf_addf(err, "There are still logs under "2530 "'%s'", logfile->buf);2531 return -1;2532 }2533 logfd = open(logfile->buf, oflags, 0666);2534 }25352536 if (logfd < 0) {2537 strbuf_addf(err, "unable to append to %s: %s",2538 logfile->buf, strerror(errno));2539 return -1;2540 }2541 }25422543 adjust_shared_perm(logfile->buf);2544 close(logfd);2545 return 0;2546}254725482549int safe_create_reflog(const char *refname, int force_create, struct strbuf *err)2550{2551 int ret;2552 struct strbuf sb = STRBUF_INIT;25532554 ret = log_ref_setup(refname, &sb, err, force_create);2555 strbuf_release(&sb);2556 return ret;2557}25582559static int log_ref_write_fd(int fd, const unsigned char *old_sha1,2560 const unsigned char *new_sha1,2561 const char *committer, const char *msg)2562{2563 int msglen, written;2564 unsigned maxlen, len;2565 char *logrec;25662567 msglen = msg ? strlen(msg) : 0;2568 maxlen = strlen(committer) + msglen + 100;2569 logrec = xmalloc(maxlen);2570 len = xsnprintf(logrec, maxlen, "%s %s %s\n",2571 sha1_to_hex(old_sha1),2572 sha1_to_hex(new_sha1),2573 committer);2574 if (msglen)2575 len += copy_reflog_msg(logrec + len - 1, msg) - 1;25762577 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;2578 free(logrec);2579 if (written != len)2580 return -1;25812582 return 0;2583}25842585static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,2586 const unsigned char *new_sha1, const char *msg,2587 struct strbuf *logfile, int flags,2588 struct strbuf *err)2589{2590 int logfd, result, oflags = O_APPEND | O_WRONLY;25912592 if (log_all_ref_updates < 0)2593 log_all_ref_updates = !is_bare_repository();25942595 result = log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);25962597 if (result)2598 return result;25992600 logfd = open(logfile->buf, oflags);2601 if (logfd < 0)2602 return 0;2603 result = log_ref_write_fd(logfd, old_sha1, new_sha1,2604 git_committer_info(0), msg);2605 if (result) {2606 strbuf_addf(err, "unable to append to %s: %s", logfile->buf,2607 strerror(errno));2608 close(logfd);2609 return -1;2610 }2611 if (close(logfd)) {2612 strbuf_addf(err, "unable to append to %s: %s", logfile->buf,2613 strerror(errno));2614 return -1;2615 }2616 return 0;2617}26182619static int log_ref_write(const char *refname, const unsigned char *old_sha1,2620 const unsigned char *new_sha1, const char *msg,2621 int flags, struct strbuf *err)2622{2623 return files_log_ref_write(refname, old_sha1, new_sha1, msg, flags,2624 err);2625}26262627int files_log_ref_write(const char *refname, const unsigned char *old_sha1,2628 const unsigned char *new_sha1, const char *msg,2629 int flags, struct strbuf *err)2630{2631 struct strbuf sb = STRBUF_INIT;2632 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,2633 err);2634 strbuf_release(&sb);2635 return ret;2636}26372638/*2639 * Write sha1 into the open lockfile, then close the lockfile. On2640 * errors, rollback the lockfile, fill in *err and2641 * return -1.2642 */2643static int write_ref_to_lockfile(struct ref_lock *lock,2644 const unsigned char *sha1, struct strbuf *err)2645{2646 static char term = '\n';2647 struct object *o;2648 int fd;26492650 o = parse_object(sha1);2651 if (!o) {2652 strbuf_addf(err,2653 "Trying to write ref %s with nonexistent object %s",2654 lock->ref_name, sha1_to_hex(sha1));2655 unlock_ref(lock);2656 return -1;2657 }2658 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {2659 strbuf_addf(err,2660 "Trying to write non-commit object %s to branch %s",2661 sha1_to_hex(sha1), lock->ref_name);2662 unlock_ref(lock);2663 return -1;2664 }2665 fd = get_lock_file_fd(lock->lk);2666 if (write_in_full(fd, sha1_to_hex(sha1), 40) != 40 ||2667 write_in_full(fd, &term, 1) != 1 ||2668 close_ref(lock) < 0) {2669 strbuf_addf(err,2670 "Couldn't write %s", get_lock_file_path(lock->lk));2671 unlock_ref(lock);2672 return -1;2673 }2674 return 0;2675}26762677/*2678 * Commit a change to a loose reference that has already been written2679 * to the loose reference lockfile. Also update the reflogs if2680 * necessary, using the specified lockmsg (which can be NULL).2681 */2682static int commit_ref_update(struct ref_lock *lock,2683 const unsigned char *sha1, const char *logmsg,2684 int flags, struct strbuf *err)2685{2686 clear_loose_ref_cache(&ref_cache);2687 if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) < 0 ||2688 (strcmp(lock->ref_name, lock->orig_ref_name) &&2689 log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) < 0)) {2690 char *old_msg = strbuf_detach(err, NULL);2691 strbuf_addf(err, "Cannot update the ref '%s': %s",2692 lock->ref_name, old_msg);2693 free(old_msg);2694 unlock_ref(lock);2695 return -1;2696 }2697 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {2698 /*2699 * Special hack: If a branch is updated directly and HEAD2700 * points to it (may happen on the remote side of a push2701 * for example) then logically the HEAD reflog should be2702 * updated too.2703 * A generic solution implies reverse symref information,2704 * but finding all symrefs pointing to the given branch2705 * would be rather costly for this rare event (the direct2706 * update of a branch) to be worth it. So let's cheat and2707 * check with HEAD only which should cover 99% of all usage2708 * scenarios (even 100% of the default ones).2709 */2710 unsigned char head_sha1[20];2711 int head_flag;2712 const char *head_ref;2713 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,2714 head_sha1, &head_flag);2715 if (head_ref && (head_flag & REF_ISSYMREF) &&2716 !strcmp(head_ref, lock->ref_name)) {2717 struct strbuf log_err = STRBUF_INIT;2718 if (log_ref_write("HEAD", lock->old_oid.hash, sha1,2719 logmsg, 0, &log_err)) {2720 error("%s", log_err.buf);2721 strbuf_release(&log_err);2722 }2723 }2724 }2725 if (commit_ref(lock)) {2726 error("Couldn't set %s", lock->ref_name);2727 unlock_ref(lock);2728 return -1;2729 }27302731 unlock_ref(lock);2732 return 0;2733}27342735static int create_ref_symlink(struct ref_lock *lock, const char *target)2736{2737 int ret = -1;2738#ifndef NO_SYMLINK_HEAD2739 char *ref_path = get_locked_file_path(lock->lk);2740 unlink(ref_path);2741 ret = symlink(target, ref_path);2742 free(ref_path);27432744 if (ret)2745 fprintf(stderr, "no symlink - falling back to symbolic ref\n");2746#endif2747 return ret;2748}27492750static void update_symref_reflog(struct ref_lock *lock, const char *refname,2751 const char *target, const char *logmsg)2752{2753 struct strbuf err = STRBUF_INIT;2754 unsigned char new_sha1[20];2755 if (logmsg && !read_ref(target, new_sha1) &&2756 log_ref_write(refname, lock->old_oid.hash, new_sha1, logmsg, 0, &err)) {2757 error("%s", err.buf);2758 strbuf_release(&err);2759 }2760}27612762static int create_symref_locked(struct ref_lock *lock, const char *refname,2763 const char *target, const char *logmsg)2764{2765 if (prefer_symlink_refs && !create_ref_symlink(lock, target)) {2766 update_symref_reflog(lock, refname, target, logmsg);2767 return 0;2768 }27692770 if (!fdopen_lock_file(lock->lk, "w"))2771 return error("unable to fdopen %s: %s",2772 lock->lk->tempfile.filename.buf, strerror(errno));27732774 update_symref_reflog(lock, refname, target, logmsg);27752776 /* no error check; commit_ref will check ferror */2777 fprintf(lock->lk->tempfile.fp, "ref: %s\n", target);2778 if (commit_ref(lock) < 0)2779 return error("unable to write symref for %s: %s", refname,2780 strerror(errno));2781 return 0;2782}27832784int create_symref(const char *refname, const char *target, const char *logmsg)2785{2786 struct strbuf err = STRBUF_INIT;2787 struct ref_lock *lock;2788 int ret;27892790 lock = lock_ref_sha1_basic(refname, NULL, NULL, NULL, REF_NODEREF, NULL,2791 &err);2792 if (!lock) {2793 error("%s", err.buf);2794 strbuf_release(&err);2795 return -1;2796 }27972798 ret = create_symref_locked(lock, refname, target, logmsg);2799 unlock_ref(lock);2800 return ret;2801}28022803int reflog_exists(const char *refname)2804{2805 struct stat st;28062807 return !lstat(git_path("logs/%s", refname), &st) &&2808 S_ISREG(st.st_mode);2809}28102811int delete_reflog(const char *refname)2812{2813 return remove_path(git_path("logs/%s", refname));2814}28152816static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)2817{2818 unsigned char osha1[20], nsha1[20];2819 char *email_end, *message;2820 unsigned long timestamp;2821 int tz;28222823 /* old SP new SP name <email> SP time TAB msg LF */2824 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||2825 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||2826 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||2827 !(email_end = strchr(sb->buf + 82, '>')) ||2828 email_end[1] != ' ' ||2829 !(timestamp = strtoul(email_end + 2, &message, 10)) ||2830 !message || message[0] != ' ' ||2831 (message[1] != '+' && message[1] != '-') ||2832 !isdigit(message[2]) || !isdigit(message[3]) ||2833 !isdigit(message[4]) || !isdigit(message[5]))2834 return 0; /* corrupt? */2835 email_end[1] = '\0';2836 tz = strtol(message + 1, NULL, 10);2837 if (message[6] != '\t')2838 message += 6;2839 else2840 message += 7;2841 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);2842}28432844static char *find_beginning_of_line(char *bob, char *scan)2845{2846 while (bob < scan && *(--scan) != '\n')2847 ; /* keep scanning backwards */2848 /*2849 * Return either beginning of the buffer, or LF at the end of2850 * the previous line.2851 */2852 return scan;2853}28542855int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)2856{2857 struct strbuf sb = STRBUF_INIT;2858 FILE *logfp;2859 long pos;2860 int ret = 0, at_tail = 1;28612862 logfp = fopen(git_path("logs/%s", refname), "r");2863 if (!logfp)2864 return -1;28652866 /* Jump to the end */2867 if (fseek(logfp, 0, SEEK_END) < 0)2868 return error("cannot seek back reflog for %s: %s",2869 refname, strerror(errno));2870 pos = ftell(logfp);2871 while (!ret && 0 < pos) {2872 int cnt;2873 size_t nread;2874 char buf[BUFSIZ];2875 char *endp, *scanp;28762877 /* Fill next block from the end */2878 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;2879 if (fseek(logfp, pos - cnt, SEEK_SET))2880 return error("cannot seek back reflog for %s: %s",2881 refname, strerror(errno));2882 nread = fread(buf, cnt, 1, logfp);2883 if (nread != 1)2884 return error("cannot read %d bytes from reflog for %s: %s",2885 cnt, refname, strerror(errno));2886 pos -= cnt;28872888 scanp = endp = buf + cnt;2889 if (at_tail && scanp[-1] == '\n')2890 /* Looking at the final LF at the end of the file */2891 scanp--;2892 at_tail = 0;28932894 while (buf < scanp) {2895 /*2896 * terminating LF of the previous line, or the beginning2897 * of the buffer.2898 */2899 char *bp;29002901 bp = find_beginning_of_line(buf, scanp);29022903 if (*bp == '\n') {2904 /*2905 * The newline is the end of the previous line,2906 * so we know we have complete line starting2907 * at (bp + 1). Prefix it onto any prior data2908 * we collected for the line and process it.2909 */2910 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));2911 scanp = bp;2912 endp = bp + 1;2913 ret = show_one_reflog_ent(&sb, fn, cb_data);2914 strbuf_reset(&sb);2915 if (ret)2916 break;2917 } else if (!pos) {2918 /*2919 * We are at the start of the buffer, and the2920 * start of the file; there is no previous2921 * line, and we have everything for this one.2922 * Process it, and we can end the loop.2923 */2924 strbuf_splice(&sb, 0, 0, buf, endp - buf);2925 ret = show_one_reflog_ent(&sb, fn, cb_data);2926 strbuf_reset(&sb);2927 break;2928 }29292930 if (bp == buf) {2931 /*2932 * We are at the start of the buffer, and there2933 * is more file to read backwards. Which means2934 * we are in the middle of a line. Note that we2935 * may get here even if *bp was a newline; that2936 * just means we are at the exact end of the2937 * previous line, rather than some spot in the2938 * middle.2939 *2940 * Save away what we have to be combined with2941 * the data from the next read.2942 */2943 strbuf_splice(&sb, 0, 0, buf, endp - buf);2944 break;2945 }2946 }29472948 }2949 if (!ret && sb.len)2950 die("BUG: reverse reflog parser had leftover data");29512952 fclose(logfp);2953 strbuf_release(&sb);2954 return ret;2955}29562957int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)2958{2959 FILE *logfp;2960 struct strbuf sb = STRBUF_INIT;2961 int ret = 0;29622963 logfp = fopen(git_path("logs/%s", refname), "r");2964 if (!logfp)2965 return -1;29662967 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))2968 ret = show_one_reflog_ent(&sb, fn, cb_data);2969 fclose(logfp);2970 strbuf_release(&sb);2971 return ret;2972}2973/*2974 * Call fn for each reflog in the namespace indicated by name. name2975 * must be empty or end with '/'. Name will be used as a scratch2976 * space, but its contents will be restored before return.2977 */2978static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)2979{2980 DIR *d = opendir(git_path("logs/%s", name->buf));2981 int retval = 0;2982 struct dirent *de;2983 int oldlen = name->len;29842985 if (!d)2986 return name->len ? errno : 0;29872988 while ((de = readdir(d)) != NULL) {2989 struct stat st;29902991 if (de->d_name[0] == '.')2992 continue;2993 if (ends_with(de->d_name, ".lock"))2994 continue;2995 strbuf_addstr(name, de->d_name);2996 if (stat(git_path("logs/%s", name->buf), &st) < 0) {2997 ; /* silently ignore */2998 } else {2999 if (S_ISDIR(st.st_mode)) {3000 strbuf_addch(name, '/');3001 retval = do_for_each_reflog(name, fn, cb_data);3002 } else {3003 struct object_id oid;30043005 if (read_ref_full(name->buf, 0, oid.hash, NULL))3006 retval = error("bad ref for %s", name->buf);3007 else3008 retval = fn(name->buf, &oid, 0, cb_data);3009 }3010 if (retval)3011 break;3012 }3013 strbuf_setlen(name, oldlen);3014 }3015 closedir(d);3016 return retval;3017}30183019int for_each_reflog(each_ref_fn fn, void *cb_data)3020{3021 int retval;3022 struct strbuf name;3023 strbuf_init(&name, PATH_MAX);3024 retval = do_for_each_reflog(&name, fn, cb_data);3025 strbuf_release(&name);3026 return retval;3027}30283029static int ref_update_reject_duplicates(struct string_list *refnames,3030 struct strbuf *err)3031{3032 int i, n = refnames->nr;30333034 assert(err);30353036 for (i = 1; i < n; i++)3037 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {3038 strbuf_addf(err,3039 "Multiple updates for ref '%s' not allowed.",3040 refnames->items[i].string);3041 return 1;3042 }3043 return 0;3044}30453046int ref_transaction_commit(struct ref_transaction *transaction,3047 struct strbuf *err)3048{3049 int ret = 0, i;3050 int n = transaction->nr;3051 struct ref_update **updates = transaction->updates;3052 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3053 struct string_list_item *ref_to_delete;3054 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;30553056 assert(err);30573058 if (transaction->state != REF_TRANSACTION_OPEN)3059 die("BUG: commit called for transaction that is not open");30603061 if (!n) {3062 transaction->state = REF_TRANSACTION_CLOSED;3063 return 0;3064 }30653066 /* Fail if a refname appears more than once in the transaction: */3067 for (i = 0; i < n; i++)3068 string_list_append(&affected_refnames, updates[i]->refname);3069 string_list_sort(&affected_refnames);3070 if (ref_update_reject_duplicates(&affected_refnames, err)) {3071 ret = TRANSACTION_GENERIC_ERROR;3072 goto cleanup;3073 }30743075 /*3076 * Acquire all locks, verify old values if provided, check3077 * that new values are valid, and write new values to the3078 * lockfiles, ready to be activated. Only keep one lockfile3079 * open at a time to avoid running out of file descriptors.3080 */3081 for (i = 0; i < n; i++) {3082 struct ref_update *update = updates[i];30833084 if ((update->flags & REF_HAVE_NEW) &&3085 is_null_sha1(update->new_sha1))3086 update->flags |= REF_DELETING;3087 update->lock = lock_ref_sha1_basic(3088 update->refname,3089 ((update->flags & REF_HAVE_OLD) ?3090 update->old_sha1 : NULL),3091 &affected_refnames, NULL,3092 update->flags,3093 &update->type,3094 err);3095 if (!update->lock) {3096 char *reason;30973098 ret = (errno == ENOTDIR)3099 ? TRANSACTION_NAME_CONFLICT3100 : TRANSACTION_GENERIC_ERROR;3101 reason = strbuf_detach(err, NULL);3102 strbuf_addf(err, "cannot lock ref '%s': %s",3103 update->refname, reason);3104 free(reason);3105 goto cleanup;3106 }3107 if ((update->flags & REF_HAVE_NEW) &&3108 !(update->flags & REF_DELETING)) {3109 int overwriting_symref = ((update->type & REF_ISSYMREF) &&3110 (update->flags & REF_NODEREF));31113112 if (!overwriting_symref &&3113 !hashcmp(update->lock->old_oid.hash, update->new_sha1)) {3114 /*3115 * The reference already has the desired3116 * value, so we don't need to write it.3117 */3118 } else if (write_ref_to_lockfile(update->lock,3119 update->new_sha1,3120 err)) {3121 char *write_err = strbuf_detach(err, NULL);31223123 /*3124 * The lock was freed upon failure of3125 * write_ref_to_lockfile():3126 */3127 update->lock = NULL;3128 strbuf_addf(err,3129 "cannot update the ref '%s': %s",3130 update->refname, write_err);3131 free(write_err);3132 ret = TRANSACTION_GENERIC_ERROR;3133 goto cleanup;3134 } else {3135 update->flags |= REF_NEEDS_COMMIT;3136 }3137 }3138 if (!(update->flags & REF_NEEDS_COMMIT)) {3139 /*3140 * We didn't have to write anything to the lockfile.3141 * Close it to free up the file descriptor:3142 */3143 if (close_ref(update->lock)) {3144 strbuf_addf(err, "Couldn't close %s.lock",3145 update->refname);3146 goto cleanup;3147 }3148 }3149 }31503151 /* Perform updates first so live commits remain referenced */3152 for (i = 0; i < n; i++) {3153 struct ref_update *update = updates[i];31543155 if (update->flags & REF_NEEDS_COMMIT) {3156 if (commit_ref_update(update->lock,3157 update->new_sha1, update->msg,3158 update->flags, err)) {3159 /* freed by commit_ref_update(): */3160 update->lock = NULL;3161 ret = TRANSACTION_GENERIC_ERROR;3162 goto cleanup;3163 } else {3164 /* freed by commit_ref_update(): */3165 update->lock = NULL;3166 }3167 }3168 }31693170 /* Perform deletes now that updates are safely completed */3171 for (i = 0; i < n; i++) {3172 struct ref_update *update = updates[i];31733174 if (update->flags & REF_DELETING) {3175 if (delete_ref_loose(update->lock, update->type, err)) {3176 ret = TRANSACTION_GENERIC_ERROR;3177 goto cleanup;3178 }31793180 if (!(update->flags & REF_ISPRUNING))3181 string_list_append(&refs_to_delete,3182 update->lock->ref_name);3183 }3184 }31853186 if (repack_without_refs(&refs_to_delete, err)) {3187 ret = TRANSACTION_GENERIC_ERROR;3188 goto cleanup;3189 }3190 for_each_string_list_item(ref_to_delete, &refs_to_delete)3191 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3192 clear_loose_ref_cache(&ref_cache);31933194cleanup:3195 transaction->state = REF_TRANSACTION_CLOSED;31963197 for (i = 0; i < n; i++)3198 if (updates[i]->lock)3199 unlock_ref(updates[i]->lock);3200 string_list_clear(&refs_to_delete, 0);3201 string_list_clear(&affected_refnames, 0);3202 return ret;3203}32043205static int ref_present(const char *refname,3206 const struct object_id *oid, int flags, void *cb_data)3207{3208 struct string_list *affected_refnames = cb_data;32093210 return string_list_has_string(affected_refnames, refname);3211}32123213int initial_ref_transaction_commit(struct ref_transaction *transaction,3214 struct strbuf *err)3215{3216 int ret = 0, i;3217 int n = transaction->nr;3218 struct ref_update **updates = transaction->updates;3219 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;32203221 assert(err);32223223 if (transaction->state != REF_TRANSACTION_OPEN)3224 die("BUG: commit called for transaction that is not open");32253226 /* Fail if a refname appears more than once in the transaction: */3227 for (i = 0; i < n; i++)3228 string_list_append(&affected_refnames, updates[i]->refname);3229 string_list_sort(&affected_refnames);3230 if (ref_update_reject_duplicates(&affected_refnames, err)) {3231 ret = TRANSACTION_GENERIC_ERROR;3232 goto cleanup;3233 }32343235 /*3236 * It's really undefined to call this function in an active3237 * repository or when there are existing references: we are3238 * only locking and changing packed-refs, so (1) any3239 * simultaneous processes might try to change a reference at3240 * the same time we do, and (2) any existing loose versions of3241 * the references that we are setting would have precedence3242 * over our values. But some remote helpers create the remote3243 * "HEAD" and "master" branches before calling this function,3244 * so here we really only check that none of the references3245 * that we are creating already exists.3246 */3247 if (for_each_rawref(ref_present, &affected_refnames))3248 die("BUG: initial ref transaction called with existing refs");32493250 for (i = 0; i < n; i++) {3251 struct ref_update *update = updates[i];32523253 if ((update->flags & REF_HAVE_OLD) &&3254 !is_null_sha1(update->old_sha1))3255 die("BUG: initial ref transaction with old_sha1 set");3256 if (verify_refname_available(update->refname,3257 &affected_refnames, NULL,3258 err)) {3259 ret = TRANSACTION_NAME_CONFLICT;3260 goto cleanup;3261 }3262 }32633264 if (lock_packed_refs(0)) {3265 strbuf_addf(err, "unable to lock packed-refs file: %s",3266 strerror(errno));3267 ret = TRANSACTION_GENERIC_ERROR;3268 goto cleanup;3269 }32703271 for (i = 0; i < n; i++) {3272 struct ref_update *update = updates[i];32733274 if ((update->flags & REF_HAVE_NEW) &&3275 !is_null_sha1(update->new_sha1))3276 add_packed_ref(update->refname, update->new_sha1);3277 }32783279 if (commit_packed_refs()) {3280 strbuf_addf(err, "unable to commit packed-refs file: %s",3281 strerror(errno));3282 ret = TRANSACTION_GENERIC_ERROR;3283 goto cleanup;3284 }32853286cleanup:3287 transaction->state = REF_TRANSACTION_CLOSED;3288 string_list_clear(&affected_refnames, 0);3289 return ret;3290}32913292struct expire_reflog_cb {3293 unsigned int flags;3294 reflog_expiry_should_prune_fn *should_prune_fn;3295 void *policy_cb;3296 FILE *newlog;3297 unsigned char last_kept_sha1[20];3298};32993300static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,3301 const char *email, unsigned long timestamp, int tz,3302 const char *message, void *cb_data)3303{3304 struct expire_reflog_cb *cb = cb_data;3305 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;33063307 if (cb->flags & EXPIRE_REFLOGS_REWRITE)3308 osha1 = cb->last_kept_sha1;33093310 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,3311 message, policy_cb)) {3312 if (!cb->newlog)3313 printf("would prune %s", message);3314 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)3315 printf("prune %s", message);3316 } else {3317 if (cb->newlog) {3318 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",3319 sha1_to_hex(osha1), sha1_to_hex(nsha1),3320 email, timestamp, tz, message);3321 hashcpy(cb->last_kept_sha1, nsha1);3322 }3323 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)3324 printf("keep %s", message);3325 }3326 return 0;3327}33283329int reflog_expire(const char *refname, const unsigned char *sha1,3330 unsigned int flags,3331 reflog_expiry_prepare_fn prepare_fn,3332 reflog_expiry_should_prune_fn should_prune_fn,3333 reflog_expiry_cleanup_fn cleanup_fn,3334 void *policy_cb_data)3335{3336 static struct lock_file reflog_lock;3337 struct expire_reflog_cb cb;3338 struct ref_lock *lock;3339 char *log_file;3340 int status = 0;3341 int type;3342 struct strbuf err = STRBUF_INIT;33433344 memset(&cb, 0, sizeof(cb));3345 cb.flags = flags;3346 cb.policy_cb = policy_cb_data;3347 cb.should_prune_fn = should_prune_fn;33483349 /*3350 * The reflog file is locked by holding the lock on the3351 * reference itself, plus we might need to update the3352 * reference if --updateref was specified:3353 */3354 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, 0, &type, &err);3355 if (!lock) {3356 error("cannot lock ref '%s': %s", refname, err.buf);3357 strbuf_release(&err);3358 return -1;3359 }3360 if (!reflog_exists(refname)) {3361 unlock_ref(lock);3362 return 0;3363 }33643365 log_file = git_pathdup("logs/%s", refname);3366 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3367 /*3368 * Even though holding $GIT_DIR/logs/$reflog.lock has3369 * no locking implications, we use the lock_file3370 * machinery here anyway because it does a lot of the3371 * work we need, including cleaning up if the program3372 * exits unexpectedly.3373 */3374 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {3375 struct strbuf err = STRBUF_INIT;3376 unable_to_lock_message(log_file, errno, &err);3377 error("%s", err.buf);3378 strbuf_release(&err);3379 goto failure;3380 }3381 cb.newlog = fdopen_lock_file(&reflog_lock, "w");3382 if (!cb.newlog) {3383 error("cannot fdopen %s (%s)",3384 get_lock_file_path(&reflog_lock), strerror(errno));3385 goto failure;3386 }3387 }33883389 (*prepare_fn)(refname, sha1, cb.policy_cb);3390 for_each_reflog_ent(refname, expire_reflog_ent, &cb);3391 (*cleanup_fn)(cb.policy_cb);33923393 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {3394 /*3395 * It doesn't make sense to adjust a reference pointed3396 * to by a symbolic ref based on expiring entries in3397 * the symbolic reference's reflog. Nor can we update3398 * a reference if there are no remaining reflog3399 * entries.3400 */3401 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&3402 !(type & REF_ISSYMREF) &&3403 !is_null_sha1(cb.last_kept_sha1);34043405 if (close_lock_file(&reflog_lock)) {3406 status |= error("couldn't write %s: %s", log_file,3407 strerror(errno));3408 } else if (update &&3409 (write_in_full(get_lock_file_fd(lock->lk),3410 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||3411 write_str_in_full(get_lock_file_fd(lock->lk), "\n") != 1 ||3412 close_ref(lock) < 0)) {3413 status |= error("couldn't write %s",3414 get_lock_file_path(lock->lk));3415 rollback_lock_file(&reflog_lock);3416 } else if (commit_lock_file(&reflog_lock)) {3417 status |= error("unable to write reflog '%s' (%s)",3418 log_file, strerror(errno));3419 } else if (update && commit_ref(lock)) {3420 status |= error("couldn't set %s", lock->ref_name);3421 }3422 }3423 free(log_file);3424 unlock_ref(lock);3425 return status;34263427 failure:3428 rollback_lock_file(&reflog_lock);3429 free(log_file);3430 unlock_ref(lock);3431 return -1;3432}