1#include "cache.h" 2#include "lockfile.h" 3#include "refs.h" 4#include "object.h" 5#include "tag.h" 6#include "dir.h" 7#include "string-list.h" 8 9struct ref_lock { 10 char *ref_name; 11 char *orig_ref_name; 12 struct lock_file *lk; 13 struct object_id old_oid; 14}; 15 16/* 17 * How to handle various characters in refnames: 18 * 0: An acceptable character for refs 19 * 1: End-of-component 20 * 2: ., look for a preceding . to reject .. in refs 21 * 3: {, look for a preceding @ to reject @{ in refs 22 * 4: A bad character: ASCII control characters, and 23 * ":", "?", "[", "\", "^", "~", SP, or TAB 24 * 5: *, reject unless REFNAME_REFSPEC_PATTERN is set 25 */ 26static unsigned char refname_disposition[256] = { 27 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 28 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 29 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 0, 0, 0, 2, 1, 30 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4, 31 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 32 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0, 33 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 34 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 4, 4 35}; 36 37/* 38 * Flag passed to lock_ref_sha1_basic() telling it to tolerate broken 39 * refs (i.e., because the reference is about to be deleted anyway). 40 */ 41#define REF_DELETING 0x02 42 43/* 44 * Used as a flag in ref_update::flags when a loose ref is being 45 * pruned. 46 */ 47#define REF_ISPRUNING 0x04 48 49/* 50 * Used as a flag in ref_update::flags when the reference should be 51 * updated to new_sha1. 52 */ 53#define REF_HAVE_NEW 0x08 54 55/* 56 * Used as a flag in ref_update::flags when old_sha1 should be 57 * checked. 58 */ 59#define REF_HAVE_OLD 0x10 60 61/* 62 * Used as a flag in ref_update::flags when the lockfile needs to be 63 * committed. 64 */ 65#define REF_NEEDS_COMMIT 0x20 66 67/* 68 * 0x40 is REF_FORCE_CREATE_REFLOG, so skip it if you're adding a 69 * value to ref_update::flags 70 */ 71 72/* 73 * Try to read one refname component from the front of refname. 74 * Return the length of the component found, or -1 if the component is 75 * not legal. It is legal if it is something reasonable to have under 76 * ".git/refs/"; We do not like it if: 77 * 78 * - any path component of it begins with ".", or 79 * - it has double dots "..", or 80 * - it has ASCII control characters, or 81 * - it has ":", "?", "[", "\", "^", "~", SP, or TAB anywhere, or 82 * - it has "*" anywhere unless REFNAME_REFSPEC_PATTERN is set, or 83 * - it ends with a "/", or 84 * - it ends with ".lock", or 85 * - it contains a "@{" portion 86 */ 87static int check_refname_component(const char *refname, int *flags) 88{ 89 const char *cp; 90 char last = '\0'; 91 92 for (cp = refname; ; cp++) { 93 int ch = *cp & 255; 94 unsigned char disp = refname_disposition[ch]; 95 switch (disp) { 96 case 1: 97 goto out; 98 case 2: 99 if (last == '.') 100 return -1; /* Refname contains "..". */ 101 break; 102 case 3: 103 if (last == '@') 104 return -1; /* Refname contains "@{". */ 105 break; 106 case 4: 107 return -1; 108 case 5: 109 if (!(*flags & REFNAME_REFSPEC_PATTERN)) 110 return -1; /* refspec can't be a pattern */ 111 112 /* 113 * Unset the pattern flag so that we only accept 114 * a single asterisk for one side of refspec. 115 */ 116 *flags &= ~ REFNAME_REFSPEC_PATTERN; 117 break; 118 } 119 last = ch; 120 } 121out: 122 if (cp == refname) 123 return 0; /* Component has zero length. */ 124 if (refname[0] == '.') 125 return -1; /* Component starts with '.'. */ 126 if (cp - refname >= LOCK_SUFFIX_LEN && 127 !memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN)) 128 return -1; /* Refname ends with ".lock". */ 129 return cp - refname; 130} 131 132int check_refname_format(const char *refname, int flags) 133{ 134 int component_len, component_count = 0; 135 136 if (!strcmp(refname, "@")) 137 /* Refname is a single character '@'. */ 138 return -1; 139 140 while (1) { 141 /* We are at the start of a path component. */ 142 component_len = check_refname_component(refname, &flags); 143 if (component_len <= 0) 144 return -1; 145 146 component_count++; 147 if (refname[component_len] == '\0') 148 break; 149 /* Skip to next component. */ 150 refname += component_len + 1; 151 } 152 153 if (refname[component_len - 1] == '.') 154 return -1; /* Refname ends with '.'. */ 155 if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2) 156 return -1; /* Refname has only one component. */ 157 return 0; 158} 159 160struct ref_entry; 161 162/* 163 * Information used (along with the information in ref_entry) to 164 * describe a single cached reference. This data structure only 165 * occurs embedded in a union in struct ref_entry, and only when 166 * (ref_entry->flag & REF_DIR) is zero. 167 */ 168struct ref_value { 169 /* 170 * The name of the object to which this reference resolves 171 * (which may be a tag object). If REF_ISBROKEN, this is 172 * null. If REF_ISSYMREF, then this is the name of the object 173 * referred to by the last reference in the symlink chain. 174 */ 175 struct object_id oid; 176 177 /* 178 * If REF_KNOWS_PEELED, then this field holds the peeled value 179 * of this reference, or null if the reference is known not to 180 * be peelable. See the documentation for peel_ref() for an 181 * exact definition of "peelable". 182 */ 183 struct object_id peeled; 184}; 185 186struct ref_cache; 187 188/* 189 * Information used (along with the information in ref_entry) to 190 * describe a level in the hierarchy of references. This data 191 * structure only occurs embedded in a union in struct ref_entry, and 192 * only when (ref_entry.flag & REF_DIR) is set. In that case, 193 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 194 * in the directory have already been read: 195 * 196 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 197 * or packed references, already read. 198 * 199 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 200 * references that hasn't been read yet (nor has any of its 201 * subdirectories). 202 * 203 * Entries within a directory are stored within a growable array of 204 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 205 * sorted are sorted by their component name in strcmp() order and the 206 * remaining entries are unsorted. 207 * 208 * Loose references are read lazily, one directory at a time. When a 209 * directory of loose references is read, then all of the references 210 * in that directory are stored, and REF_INCOMPLETE stubs are created 211 * for any subdirectories, but the subdirectories themselves are not 212 * read. The reading is triggered by get_ref_dir(). 213 */ 214struct ref_dir { 215 int nr, alloc; 216 217 /* 218 * Entries with index 0 <= i < sorted are sorted by name. New 219 * entries are appended to the list unsorted, and are sorted 220 * only when required; thus we avoid the need to sort the list 221 * after the addition of every reference. 222 */ 223 int sorted; 224 225 /* A pointer to the ref_cache that contains this ref_dir. */ 226 struct ref_cache *ref_cache; 227 228 struct ref_entry **entries; 229}; 230 231/* 232 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 233 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 234 * public values; see refs.h. 235 */ 236 237/* 238 * The field ref_entry->u.value.peeled of this value entry contains 239 * the correct peeled value for the reference, which might be 240 * null_sha1 if the reference is not a tag or if it is broken. 241 */ 242#define REF_KNOWS_PEELED 0x10 243 244/* ref_entry represents a directory of references */ 245#define REF_DIR 0x20 246 247/* 248 * Entry has not yet been read from disk (used only for REF_DIR 249 * entries representing loose references) 250 */ 251#define REF_INCOMPLETE 0x40 252 253/* 254 * A ref_entry represents either a reference or a "subdirectory" of 255 * references. 256 * 257 * Each directory in the reference namespace is represented by a 258 * ref_entry with (flags & REF_DIR) set and containing a subdir member 259 * that holds the entries in that directory that have been read so 260 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 261 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 262 * used for loose reference directories. 263 * 264 * References are represented by a ref_entry with (flags & REF_DIR) 265 * unset and a value member that describes the reference's value. The 266 * flag member is at the ref_entry level, but it is also needed to 267 * interpret the contents of the value field (in other words, a 268 * ref_value object is not very much use without the enclosing 269 * ref_entry). 270 * 271 * Reference names cannot end with slash and directories' names are 272 * always stored with a trailing slash (except for the top-level 273 * directory, which is always denoted by ""). This has two nice 274 * consequences: (1) when the entries in each subdir are sorted 275 * lexicographically by name (as they usually are), the references in 276 * a whole tree can be generated in lexicographic order by traversing 277 * the tree in left-to-right, depth-first order; (2) the names of 278 * references and subdirectories cannot conflict, and therefore the 279 * presence of an empty subdirectory does not block the creation of a 280 * similarly-named reference. (The fact that reference names with the 281 * same leading components can conflict *with each other* is a 282 * separate issue that is regulated by verify_refname_available().) 283 * 284 * Please note that the name field contains the fully-qualified 285 * reference (or subdirectory) name. Space could be saved by only 286 * storing the relative names. But that would require the full names 287 * to be generated on the fly when iterating in do_for_each_ref(), and 288 * would break callback functions, who have always been able to assume 289 * that the name strings that they are passed will not be freed during 290 * the iteration. 291 */ 292struct ref_entry { 293 unsigned char flag; /* ISSYMREF? ISPACKED? */ 294 union { 295 struct ref_value value; /* if not (flags&REF_DIR) */ 296 struct ref_dir subdir; /* if (flags&REF_DIR) */ 297 } u; 298 /* 299 * The full name of the reference (e.g., "refs/heads/master") 300 * or the full name of the directory with a trailing slash 301 * (e.g., "refs/heads/"): 302 */ 303 char name[FLEX_ARRAY]; 304}; 305 306static void read_loose_refs(const char *dirname, struct ref_dir *dir); 307 308static struct ref_dir *get_ref_dir(struct ref_entry *entry) 309{ 310 struct ref_dir *dir; 311 assert(entry->flag & REF_DIR); 312 dir = &entry->u.subdir; 313 if (entry->flag & REF_INCOMPLETE) { 314 read_loose_refs(entry->name, dir); 315 entry->flag &= ~REF_INCOMPLETE; 316 } 317 return dir; 318} 319 320/* 321 * Check if a refname is safe. 322 * For refs that start with "refs/" we consider it safe as long they do 323 * not try to resolve to outside of refs/. 324 * 325 * For all other refs we only consider them safe iff they only contain 326 * upper case characters and '_' (like "HEAD" AND "MERGE_HEAD", and not like 327 * "config"). 328 */ 329static int refname_is_safe(const char *refname) 330{ 331 if (starts_with(refname, "refs/")) { 332 char *buf; 333 int result; 334 335 buf = xmalloc(strlen(refname) + 1); 336 /* 337 * Does the refname try to escape refs/? 338 * For example: refs/foo/../bar is safe but refs/foo/../../bar 339 * is not. 340 */ 341 result = !normalize_path_copy(buf, refname + strlen("refs/")); 342 free(buf); 343 return result; 344 } 345 while (*refname) { 346 if (!isupper(*refname) && *refname != '_') 347 return 0; 348 refname++; 349 } 350 return 1; 351} 352 353static struct ref_entry *create_ref_entry(const char *refname, 354 const unsigned char *sha1, int flag, 355 int check_name) 356{ 357 int len; 358 struct ref_entry *ref; 359 360 if (check_name && 361 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 362 die("Reference has invalid format: '%s'", refname); 363 len = strlen(refname) + 1; 364 ref = xmalloc(sizeof(struct ref_entry) + len); 365 hashcpy(ref->u.value.oid.hash, sha1); 366 oidclr(&ref->u.value.peeled); 367 memcpy(ref->name, refname, len); 368 ref->flag = flag; 369 return ref; 370} 371 372static void clear_ref_dir(struct ref_dir *dir); 373 374static void free_ref_entry(struct ref_entry *entry) 375{ 376 if (entry->flag & REF_DIR) { 377 /* 378 * Do not use get_ref_dir() here, as that might 379 * trigger the reading of loose refs. 380 */ 381 clear_ref_dir(&entry->u.subdir); 382 } 383 free(entry); 384} 385 386/* 387 * Add a ref_entry to the end of dir (unsorted). Entry is always 388 * stored directly in dir; no recursion into subdirectories is 389 * done. 390 */ 391static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry) 392{ 393 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc); 394 dir->entries[dir->nr++] = entry; 395 /* optimize for the case that entries are added in order */ 396 if (dir->nr == 1 || 397 (dir->nr == dir->sorted + 1 && 398 strcmp(dir->entries[dir->nr - 2]->name, 399 dir->entries[dir->nr - 1]->name) < 0)) 400 dir->sorted = dir->nr; 401} 402 403/* 404 * Clear and free all entries in dir, recursively. 405 */ 406static void clear_ref_dir(struct ref_dir *dir) 407{ 408 int i; 409 for (i = 0; i < dir->nr; i++) 410 free_ref_entry(dir->entries[i]); 411 free(dir->entries); 412 dir->sorted = dir->nr = dir->alloc = 0; 413 dir->entries = NULL; 414} 415 416/* 417 * Create a struct ref_entry object for the specified dirname. 418 * dirname is the name of the directory with a trailing slash (e.g., 419 * "refs/heads/") or "" for the top-level directory. 420 */ 421static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 422 const char *dirname, size_t len, 423 int incomplete) 424{ 425 struct ref_entry *direntry; 426 direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1); 427 memcpy(direntry->name, dirname, len); 428 direntry->name[len] = '\0'; 429 direntry->u.subdir.ref_cache = ref_cache; 430 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0); 431 return direntry; 432} 433 434static int ref_entry_cmp(const void *a, const void *b) 435{ 436 struct ref_entry *one = *(struct ref_entry **)a; 437 struct ref_entry *two = *(struct ref_entry **)b; 438 return strcmp(one->name, two->name); 439} 440 441static void sort_ref_dir(struct ref_dir *dir); 442 443struct string_slice { 444 size_t len; 445 const char *str; 446}; 447 448static int ref_entry_cmp_sslice(const void *key_, const void *ent_) 449{ 450 const struct string_slice *key = key_; 451 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_; 452 int cmp = strncmp(key->str, ent->name, key->len); 453 if (cmp) 454 return cmp; 455 return '\0' - (unsigned char)ent->name[key->len]; 456} 457 458/* 459 * Return the index of the entry with the given refname from the 460 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 461 * no such entry is found. dir must already be complete. 462 */ 463static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len) 464{ 465 struct ref_entry **r; 466 struct string_slice key; 467 468 if (refname == NULL || !dir->nr) 469 return -1; 470 471 sort_ref_dir(dir); 472 key.len = len; 473 key.str = refname; 474 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries), 475 ref_entry_cmp_sslice); 476 477 if (r == NULL) 478 return -1; 479 480 return r - dir->entries; 481} 482 483/* 484 * Search for a directory entry directly within dir (without 485 * recursing). Sort dir if necessary. subdirname must be a directory 486 * name (i.e., end in '/'). If mkdir is set, then create the 487 * directory if it is missing; otherwise, return NULL if the desired 488 * directory cannot be found. dir must already be complete. 489 */ 490static struct ref_dir *search_for_subdir(struct ref_dir *dir, 491 const char *subdirname, size_t len, 492 int mkdir) 493{ 494 int entry_index = search_ref_dir(dir, subdirname, len); 495 struct ref_entry *entry; 496 if (entry_index == -1) { 497 if (!mkdir) 498 return NULL; 499 /* 500 * Since dir is complete, the absence of a subdir 501 * means that the subdir really doesn't exist; 502 * therefore, create an empty record for it but mark 503 * the record complete. 504 */ 505 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0); 506 add_entry_to_dir(dir, entry); 507 } else { 508 entry = dir->entries[entry_index]; 509 } 510 return get_ref_dir(entry); 511} 512 513/* 514 * If refname is a reference name, find the ref_dir within the dir 515 * tree that should hold refname. If refname is a directory name 516 * (i.e., ends in '/'), then return that ref_dir itself. dir must 517 * represent the top-level directory and must already be complete. 518 * Sort ref_dirs and recurse into subdirectories as necessary. If 519 * mkdir is set, then create any missing directories; otherwise, 520 * return NULL if the desired directory cannot be found. 521 */ 522static struct ref_dir *find_containing_dir(struct ref_dir *dir, 523 const char *refname, int mkdir) 524{ 525 const char *slash; 526 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 527 size_t dirnamelen = slash - refname + 1; 528 struct ref_dir *subdir; 529 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir); 530 if (!subdir) { 531 dir = NULL; 532 break; 533 } 534 dir = subdir; 535 } 536 537 return dir; 538} 539 540/* 541 * Find the value entry with the given name in dir, sorting ref_dirs 542 * and recursing into subdirectories as necessary. If the name is not 543 * found or it corresponds to a directory entry, return NULL. 544 */ 545static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname) 546{ 547 int entry_index; 548 struct ref_entry *entry; 549 dir = find_containing_dir(dir, refname, 0); 550 if (!dir) 551 return NULL; 552 entry_index = search_ref_dir(dir, refname, strlen(refname)); 553 if (entry_index == -1) 554 return NULL; 555 entry = dir->entries[entry_index]; 556 return (entry->flag & REF_DIR) ? NULL : entry; 557} 558 559/* 560 * Remove the entry with the given name from dir, recursing into 561 * subdirectories as necessary. If refname is the name of a directory 562 * (i.e., ends with '/'), then remove the directory and its contents. 563 * If the removal was successful, return the number of entries 564 * remaining in the directory entry that contained the deleted entry. 565 * If the name was not found, return -1. Please note that this 566 * function only deletes the entry from the cache; it does not delete 567 * it from the filesystem or ensure that other cache entries (which 568 * might be symbolic references to the removed entry) are updated. 569 * Nor does it remove any containing dir entries that might be made 570 * empty by the removal. dir must represent the top-level directory 571 * and must already be complete. 572 */ 573static int remove_entry(struct ref_dir *dir, const char *refname) 574{ 575 int refname_len = strlen(refname); 576 int entry_index; 577 struct ref_entry *entry; 578 int is_dir = refname[refname_len - 1] == '/'; 579 if (is_dir) { 580 /* 581 * refname represents a reference directory. Remove 582 * the trailing slash; otherwise we will get the 583 * directory *representing* refname rather than the 584 * one *containing* it. 585 */ 586 char *dirname = xmemdupz(refname, refname_len - 1); 587 dir = find_containing_dir(dir, dirname, 0); 588 free(dirname); 589 } else { 590 dir = find_containing_dir(dir, refname, 0); 591 } 592 if (!dir) 593 return -1; 594 entry_index = search_ref_dir(dir, refname, refname_len); 595 if (entry_index == -1) 596 return -1; 597 entry = dir->entries[entry_index]; 598 599 memmove(&dir->entries[entry_index], 600 &dir->entries[entry_index + 1], 601 (dir->nr - entry_index - 1) * sizeof(*dir->entries) 602 ); 603 dir->nr--; 604 if (dir->sorted > entry_index) 605 dir->sorted--; 606 free_ref_entry(entry); 607 return dir->nr; 608} 609 610/* 611 * Add a ref_entry to the ref_dir (unsorted), recursing into 612 * subdirectories as necessary. dir must represent the top-level 613 * directory. Return 0 on success. 614 */ 615static int add_ref(struct ref_dir *dir, struct ref_entry *ref) 616{ 617 dir = find_containing_dir(dir, ref->name, 1); 618 if (!dir) 619 return -1; 620 add_entry_to_dir(dir, ref); 621 return 0; 622} 623 624/* 625 * Emit a warning and return true iff ref1 and ref2 have the same name 626 * and the same sha1. Die if they have the same name but different 627 * sha1s. 628 */ 629static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2) 630{ 631 if (strcmp(ref1->name, ref2->name)) 632 return 0; 633 634 /* Duplicate name; make sure that they don't conflict: */ 635 636 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 637 /* This is impossible by construction */ 638 die("Reference directory conflict: %s", ref1->name); 639 640 if (oidcmp(&ref1->u.value.oid, &ref2->u.value.oid)) 641 die("Duplicated ref, and SHA1s don't match: %s", ref1->name); 642 643 warning("Duplicated ref: %s", ref1->name); 644 return 1; 645} 646 647/* 648 * Sort the entries in dir non-recursively (if they are not already 649 * sorted) and remove any duplicate entries. 650 */ 651static void sort_ref_dir(struct ref_dir *dir) 652{ 653 int i, j; 654 struct ref_entry *last = NULL; 655 656 /* 657 * This check also prevents passing a zero-length array to qsort(), 658 * which is a problem on some platforms. 659 */ 660 if (dir->sorted == dir->nr) 661 return; 662 663 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp); 664 665 /* Remove any duplicates: */ 666 for (i = 0, j = 0; j < dir->nr; j++) { 667 struct ref_entry *entry = dir->entries[j]; 668 if (last && is_dup_ref(last, entry)) 669 free_ref_entry(entry); 670 else 671 last = dir->entries[i++] = entry; 672 } 673 dir->sorted = dir->nr = i; 674} 675 676/* Include broken references in a do_for_each_ref*() iteration: */ 677#define DO_FOR_EACH_INCLUDE_BROKEN 0x01 678 679/* 680 * Return true iff the reference described by entry can be resolved to 681 * an object in the database. Emit a warning if the referred-to 682 * object does not exist. 683 */ 684static int ref_resolves_to_object(struct ref_entry *entry) 685{ 686 if (entry->flag & REF_ISBROKEN) 687 return 0; 688 if (!has_sha1_file(entry->u.value.oid.hash)) { 689 error("%s does not point to a valid object!", entry->name); 690 return 0; 691 } 692 return 1; 693} 694 695/* 696 * current_ref is a performance hack: when iterating over references 697 * using the for_each_ref*() functions, current_ref is set to the 698 * current reference's entry before calling the callback function. If 699 * the callback function calls peel_ref(), then peel_ref() first 700 * checks whether the reference to be peeled is the current reference 701 * (it usually is) and if so, returns that reference's peeled version 702 * if it is available. This avoids a refname lookup in a common case. 703 */ 704static struct ref_entry *current_ref; 705 706typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data); 707 708struct ref_entry_cb { 709 const char *base; 710 int trim; 711 int flags; 712 each_ref_fn *fn; 713 void *cb_data; 714}; 715 716/* 717 * Handle one reference in a do_for_each_ref*()-style iteration, 718 * calling an each_ref_fn for each entry. 719 */ 720static int do_one_ref(struct ref_entry *entry, void *cb_data) 721{ 722 struct ref_entry_cb *data = cb_data; 723 struct ref_entry *old_current_ref; 724 int retval; 725 726 if (!starts_with(entry->name, data->base)) 727 return 0; 728 729 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && 730 !ref_resolves_to_object(entry)) 731 return 0; 732 733 /* Store the old value, in case this is a recursive call: */ 734 old_current_ref = current_ref; 735 current_ref = entry; 736 retval = data->fn(entry->name + data->trim, &entry->u.value.oid, 737 entry->flag, data->cb_data); 738 current_ref = old_current_ref; 739 return retval; 740} 741 742/* 743 * Call fn for each reference in dir that has index in the range 744 * offset <= index < dir->nr. Recurse into subdirectories that are in 745 * that index range, sorting them before iterating. This function 746 * does not sort dir itself; it should be sorted beforehand. fn is 747 * called for all references, including broken ones. 748 */ 749static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset, 750 each_ref_entry_fn fn, void *cb_data) 751{ 752 int i; 753 assert(dir->sorted == dir->nr); 754 for (i = offset; i < dir->nr; i++) { 755 struct ref_entry *entry = dir->entries[i]; 756 int retval; 757 if (entry->flag & REF_DIR) { 758 struct ref_dir *subdir = get_ref_dir(entry); 759 sort_ref_dir(subdir); 760 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data); 761 } else { 762 retval = fn(entry, cb_data); 763 } 764 if (retval) 765 return retval; 766 } 767 return 0; 768} 769 770/* 771 * Call fn for each reference in the union of dir1 and dir2, in order 772 * by refname. Recurse into subdirectories. If a value entry appears 773 * in both dir1 and dir2, then only process the version that is in 774 * dir2. The input dirs must already be sorted, but subdirs will be 775 * sorted as needed. fn is called for all references, including 776 * broken ones. 777 */ 778static int do_for_each_entry_in_dirs(struct ref_dir *dir1, 779 struct ref_dir *dir2, 780 each_ref_entry_fn fn, void *cb_data) 781{ 782 int retval; 783 int i1 = 0, i2 = 0; 784 785 assert(dir1->sorted == dir1->nr); 786 assert(dir2->sorted == dir2->nr); 787 while (1) { 788 struct ref_entry *e1, *e2; 789 int cmp; 790 if (i1 == dir1->nr) { 791 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data); 792 } 793 if (i2 == dir2->nr) { 794 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data); 795 } 796 e1 = dir1->entries[i1]; 797 e2 = dir2->entries[i2]; 798 cmp = strcmp(e1->name, e2->name); 799 if (cmp == 0) { 800 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { 801 /* Both are directories; descend them in parallel. */ 802 struct ref_dir *subdir1 = get_ref_dir(e1); 803 struct ref_dir *subdir2 = get_ref_dir(e2); 804 sort_ref_dir(subdir1); 805 sort_ref_dir(subdir2); 806 retval = do_for_each_entry_in_dirs( 807 subdir1, subdir2, fn, cb_data); 808 i1++; 809 i2++; 810 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { 811 /* Both are references; ignore the one from dir1. */ 812 retval = fn(e2, cb_data); 813 i1++; 814 i2++; 815 } else { 816 die("conflict between reference and directory: %s", 817 e1->name); 818 } 819 } else { 820 struct ref_entry *e; 821 if (cmp < 0) { 822 e = e1; 823 i1++; 824 } else { 825 e = e2; 826 i2++; 827 } 828 if (e->flag & REF_DIR) { 829 struct ref_dir *subdir = get_ref_dir(e); 830 sort_ref_dir(subdir); 831 retval = do_for_each_entry_in_dir( 832 subdir, 0, fn, cb_data); 833 } else { 834 retval = fn(e, cb_data); 835 } 836 } 837 if (retval) 838 return retval; 839 } 840} 841 842/* 843 * Load all of the refs from the dir into our in-memory cache. The hard work 844 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 845 * through all of the sub-directories. We do not even need to care about 846 * sorting, as traversal order does not matter to us. 847 */ 848static void prime_ref_dir(struct ref_dir *dir) 849{ 850 int i; 851 for (i = 0; i < dir->nr; i++) { 852 struct ref_entry *entry = dir->entries[i]; 853 if (entry->flag & REF_DIR) 854 prime_ref_dir(get_ref_dir(entry)); 855 } 856} 857 858struct nonmatching_ref_data { 859 const struct string_list *skip; 860 const char *conflicting_refname; 861}; 862 863static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata) 864{ 865 struct nonmatching_ref_data *data = vdata; 866 867 if (data->skip && string_list_has_string(data->skip, entry->name)) 868 return 0; 869 870 data->conflicting_refname = entry->name; 871 return 1; 872} 873 874/* 875 * Return 0 if a reference named refname could be created without 876 * conflicting with the name of an existing reference in dir. 877 * Otherwise, return a negative value and write an explanation to err. 878 * If extras is non-NULL, it is a list of additional refnames with 879 * which refname is not allowed to conflict. If skip is non-NULL, 880 * ignore potential conflicts with refs in skip (e.g., because they 881 * are scheduled for deletion in the same operation). Behavior is 882 * undefined if the same name is listed in both extras and skip. 883 * 884 * Two reference names conflict if one of them exactly matches the 885 * leading components of the other; e.g., "refs/foo/bar" conflicts 886 * with both "refs/foo" and with "refs/foo/bar/baz" but not with 887 * "refs/foo/bar" or "refs/foo/barbados". 888 * 889 * extras and skip must be sorted. 890 */ 891static int verify_refname_available(const char *refname, 892 const struct string_list *extras, 893 const struct string_list *skip, 894 struct ref_dir *dir, 895 struct strbuf *err) 896{ 897 const char *slash; 898 int pos; 899 struct strbuf dirname = STRBUF_INIT; 900 int ret = -1; 901 902 /* 903 * For the sake of comments in this function, suppose that 904 * refname is "refs/foo/bar". 905 */ 906 907 assert(err); 908 909 strbuf_grow(&dirname, strlen(refname) + 1); 910 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 911 /* Expand dirname to the new prefix, not including the trailing slash: */ 912 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 913 914 /* 915 * We are still at a leading dir of the refname (e.g., 916 * "refs/foo"; if there is a reference with that name, 917 * it is a conflict, *unless* it is in skip. 918 */ 919 if (dir) { 920 pos = search_ref_dir(dir, dirname.buf, dirname.len); 921 if (pos >= 0 && 922 (!skip || !string_list_has_string(skip, dirname.buf))) { 923 /* 924 * We found a reference whose name is 925 * a proper prefix of refname; e.g., 926 * "refs/foo", and is not in skip. 927 */ 928 strbuf_addf(err, "'%s' exists; cannot create '%s'", 929 dirname.buf, refname); 930 goto cleanup; 931 } 932 } 933 934 if (extras && string_list_has_string(extras, dirname.buf) && 935 (!skip || !string_list_has_string(skip, dirname.buf))) { 936 strbuf_addf(err, "cannot process '%s' and '%s' at the same time", 937 refname, dirname.buf); 938 goto cleanup; 939 } 940 941 /* 942 * Otherwise, we can try to continue our search with 943 * the next component. So try to look up the 944 * directory, e.g., "refs/foo/". If we come up empty, 945 * we know there is nothing under this whole prefix, 946 * but even in that case we still have to continue the 947 * search for conflicts with extras. 948 */ 949 strbuf_addch(&dirname, '/'); 950 if (dir) { 951 pos = search_ref_dir(dir, dirname.buf, dirname.len); 952 if (pos < 0) { 953 /* 954 * There was no directory "refs/foo/", 955 * so there is nothing under this 956 * whole prefix. So there is no need 957 * to continue looking for conflicting 958 * references. But we need to continue 959 * looking for conflicting extras. 960 */ 961 dir = NULL; 962 } else { 963 dir = get_ref_dir(dir->entries[pos]); 964 } 965 } 966 } 967 968 /* 969 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 970 * There is no point in searching for a reference with that 971 * name, because a refname isn't considered to conflict with 972 * itself. But we still need to check for references whose 973 * names are in the "refs/foo/bar/" namespace, because they 974 * *do* conflict. 975 */ 976 strbuf_addstr(&dirname, refname + dirname.len); 977 strbuf_addch(&dirname, '/'); 978 979 if (dir) { 980 pos = search_ref_dir(dir, dirname.buf, dirname.len); 981 982 if (pos >= 0) { 983 /* 984 * We found a directory named "$refname/" 985 * (e.g., "refs/foo/bar/"). It is a problem 986 * iff it contains any ref that is not in 987 * "skip". 988 */ 989 struct nonmatching_ref_data data; 990 991 data.skip = skip; 992 data.conflicting_refname = NULL; 993 dir = get_ref_dir(dir->entries[pos]); 994 sort_ref_dir(dir); 995 if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) { 996 strbuf_addf(err, "'%s' exists; cannot create '%s'", 997 data.conflicting_refname, refname); 998 goto cleanup; 999 }1000 }1001 }10021003 if (extras) {1004 /*1005 * Check for entries in extras that start with1006 * "$refname/". We do that by looking for the place1007 * where "$refname/" would be inserted in extras. If1008 * there is an entry at that position that starts with1009 * "$refname/" and is not in skip, then we have a1010 * conflict.1011 */1012 for (pos = string_list_find_insert_index(extras, dirname.buf, 0);1013 pos < extras->nr; pos++) {1014 const char *extra_refname = extras->items[pos].string;10151016 if (!starts_with(extra_refname, dirname.buf))1017 break;10181019 if (!skip || !string_list_has_string(skip, extra_refname)) {1020 strbuf_addf(err, "cannot process '%s' and '%s' at the same time",1021 refname, extra_refname);1022 goto cleanup;1023 }1024 }1025 }10261027 /* No conflicts were found */1028 ret = 0;10291030cleanup:1031 strbuf_release(&dirname);1032 return ret;1033}10341035struct packed_ref_cache {1036 struct ref_entry *root;10371038 /*1039 * Count of references to the data structure in this instance,1040 * including the pointer from ref_cache::packed if any. The1041 * data will not be freed as long as the reference count is1042 * nonzero.1043 */1044 unsigned int referrers;10451046 /*1047 * Iff the packed-refs file associated with this instance is1048 * currently locked for writing, this points at the associated1049 * lock (which is owned by somebody else). The referrer count1050 * is also incremented when the file is locked and decremented1051 * when it is unlocked.1052 */1053 struct lock_file *lock;10541055 /* The metadata from when this packed-refs cache was read */1056 struct stat_validity validity;1057};10581059/*1060 * Future: need to be in "struct repository"1061 * when doing a full libification.1062 */1063static struct ref_cache {1064 struct ref_cache *next;1065 struct ref_entry *loose;1066 struct packed_ref_cache *packed;1067 /*1068 * The submodule name, or "" for the main repo. We allocate1069 * length 1 rather than FLEX_ARRAY so that the main ref_cache1070 * is initialized correctly.1071 */1072 char name[1];1073} ref_cache, *submodule_ref_caches;10741075/* Lock used for the main packed-refs file: */1076static struct lock_file packlock;10771078/*1079 * Increment the reference count of *packed_refs.1080 */1081static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)1082{1083 packed_refs->referrers++;1084}10851086/*1087 * Decrease the reference count of *packed_refs. If it goes to zero,1088 * free *packed_refs and return true; otherwise return false.1089 */1090static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)1091{1092 if (!--packed_refs->referrers) {1093 free_ref_entry(packed_refs->root);1094 stat_validity_clear(&packed_refs->validity);1095 free(packed_refs);1096 return 1;1097 } else {1098 return 0;1099 }1100}11011102static void clear_packed_ref_cache(struct ref_cache *refs)1103{1104 if (refs->packed) {1105 struct packed_ref_cache *packed_refs = refs->packed;11061107 if (packed_refs->lock)1108 die("internal error: packed-ref cache cleared while locked");1109 refs->packed = NULL;1110 release_packed_ref_cache(packed_refs);1111 }1112}11131114static void clear_loose_ref_cache(struct ref_cache *refs)1115{1116 if (refs->loose) {1117 free_ref_entry(refs->loose);1118 refs->loose = NULL;1119 }1120}11211122static struct ref_cache *create_ref_cache(const char *submodule)1123{1124 int len;1125 struct ref_cache *refs;1126 if (!submodule)1127 submodule = "";1128 len = strlen(submodule) + 1;1129 refs = xcalloc(1, sizeof(struct ref_cache) + len);1130 memcpy(refs->name, submodule, len);1131 return refs;1132}11331134/*1135 * Return a pointer to a ref_cache for the specified submodule. For1136 * the main repository, use submodule==NULL. The returned structure1137 * will be allocated and initialized but not necessarily populated; it1138 * should not be freed.1139 */1140static struct ref_cache *get_ref_cache(const char *submodule)1141{1142 struct ref_cache *refs;11431144 if (!submodule || !*submodule)1145 return &ref_cache;11461147 for (refs = submodule_ref_caches; refs; refs = refs->next)1148 if (!strcmp(submodule, refs->name))1149 return refs;11501151 refs = create_ref_cache(submodule);1152 refs->next = submodule_ref_caches;1153 submodule_ref_caches = refs;1154 return refs;1155}11561157/* The length of a peeled reference line in packed-refs, including EOL: */1158#define PEELED_LINE_LENGTH 4211591160/*1161 * The packed-refs header line that we write out. Perhaps other1162 * traits will be added later. The trailing space is required.1163 */1164static const char PACKED_REFS_HEADER[] =1165 "# pack-refs with: peeled fully-peeled \n";11661167/*1168 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1169 * Return a pointer to the refname within the line (null-terminated),1170 * or NULL if there was a problem.1171 */1172static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)1173{1174 const char *ref;11751176 /*1177 * 42: the answer to everything.1178 *1179 * In this case, it happens to be the answer to1180 * 40 (length of sha1 hex representation)1181 * +1 (space in between hex and name)1182 * +1 (newline at the end of the line)1183 */1184 if (line->len <= 42)1185 return NULL;11861187 if (get_sha1_hex(line->buf, sha1) < 0)1188 return NULL;1189 if (!isspace(line->buf[40]))1190 return NULL;11911192 ref = line->buf + 41;1193 if (isspace(*ref))1194 return NULL;11951196 if (line->buf[line->len - 1] != '\n')1197 return NULL;1198 line->buf[--line->len] = 0;11991200 return ref;1201}12021203/*1204 * Read f, which is a packed-refs file, into dir.1205 *1206 * A comment line of the form "# pack-refs with: " may contain zero or1207 * more traits. We interpret the traits as follows:1208 *1209 * No traits:1210 *1211 * Probably no references are peeled. But if the file contains a1212 * peeled value for a reference, we will use it.1213 *1214 * peeled:1215 *1216 * References under "refs/tags/", if they *can* be peeled, *are*1217 * peeled in this file. References outside of "refs/tags/" are1218 * probably not peeled even if they could have been, but if we find1219 * a peeled value for such a reference we will use it.1220 *1221 * fully-peeled:1222 *1223 * All references in the file that can be peeled are peeled.1224 * Inversely (and this is more important), any references in the1225 * file for which no peeled value is recorded is not peelable. This1226 * trait should typically be written alongside "peeled" for1227 * compatibility with older clients, but we do not require it1228 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1229 */1230static void read_packed_refs(FILE *f, struct ref_dir *dir)1231{1232 struct ref_entry *last = NULL;1233 struct strbuf line = STRBUF_INIT;1234 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;12351236 while (strbuf_getwholeline(&line, f, '\n') != EOF) {1237 unsigned char sha1[20];1238 const char *refname;1239 const char *traits;12401241 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {1242 if (strstr(traits, " fully-peeled "))1243 peeled = PEELED_FULLY;1244 else if (strstr(traits, " peeled "))1245 peeled = PEELED_TAGS;1246 /* perhaps other traits later as well */1247 continue;1248 }12491250 refname = parse_ref_line(&line, sha1);1251 if (refname) {1252 int flag = REF_ISPACKED;12531254 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1255 if (!refname_is_safe(refname))1256 die("packed refname is dangerous: %s", refname);1257 hashclr(sha1);1258 flag |= REF_BAD_NAME | REF_ISBROKEN;1259 }1260 last = create_ref_entry(refname, sha1, flag, 0);1261 if (peeled == PEELED_FULLY ||1262 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))1263 last->flag |= REF_KNOWS_PEELED;1264 add_ref(dir, last);1265 continue;1266 }1267 if (last &&1268 line.buf[0] == '^' &&1269 line.len == PEELED_LINE_LENGTH &&1270 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&1271 !get_sha1_hex(line.buf + 1, sha1)) {1272 hashcpy(last->u.value.peeled.hash, sha1);1273 /*1274 * Regardless of what the file header said,1275 * we definitely know the value of *this*1276 * reference:1277 */1278 last->flag |= REF_KNOWS_PEELED;1279 }1280 }12811282 strbuf_release(&line);1283}12841285/*1286 * Get the packed_ref_cache for the specified ref_cache, creating it1287 * if necessary.1288 */1289static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1290{1291 char *packed_refs_file;12921293 if (*refs->name)1294 packed_refs_file = git_pathdup_submodule(refs->name, "packed-refs");1295 else1296 packed_refs_file = git_pathdup("packed-refs");12971298 if (refs->packed &&1299 !stat_validity_check(&refs->packed->validity, packed_refs_file))1300 clear_packed_ref_cache(refs);13011302 if (!refs->packed) {1303 FILE *f;13041305 refs->packed = xcalloc(1, sizeof(*refs->packed));1306 acquire_packed_ref_cache(refs->packed);1307 refs->packed->root = create_dir_entry(refs, "", 0, 0);1308 f = fopen(packed_refs_file, "r");1309 if (f) {1310 stat_validity_update(&refs->packed->validity, fileno(f));1311 read_packed_refs(f, get_ref_dir(refs->packed->root));1312 fclose(f);1313 }1314 }1315 free(packed_refs_file);1316 return refs->packed;1317}13181319static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1320{1321 return get_ref_dir(packed_ref_cache->root);1322}13231324static struct ref_dir *get_packed_refs(struct ref_cache *refs)1325{1326 return get_packed_ref_dir(get_packed_ref_cache(refs));1327}13281329/*1330 * Add a reference to the in-memory packed reference cache. This may1331 * only be called while the packed-refs file is locked (see1332 * lock_packed_refs()). To actually write the packed-refs file, call1333 * commit_packed_refs().1334 */1335static void add_packed_ref(const char *refname, const unsigned char *sha1)1336{1337 struct packed_ref_cache *packed_ref_cache =1338 get_packed_ref_cache(&ref_cache);13391340 if (!packed_ref_cache->lock)1341 die("internal error: packed refs not locked");1342 add_ref(get_packed_ref_dir(packed_ref_cache),1343 create_ref_entry(refname, sha1, REF_ISPACKED, 1));1344}13451346/*1347 * Read the loose references from the namespace dirname into dir1348 * (without recursing). dirname must end with '/'. dir must be the1349 * directory entry corresponding to dirname.1350 */1351static void read_loose_refs(const char *dirname, struct ref_dir *dir)1352{1353 struct ref_cache *refs = dir->ref_cache;1354 DIR *d;1355 const char *path;1356 struct dirent *de;1357 int dirnamelen = strlen(dirname);1358 struct strbuf refname;13591360 if (*refs->name)1361 path = git_path_submodule(refs->name, "%s", dirname);1362 else1363 path = git_path("%s", dirname);13641365 d = opendir(path);1366 if (!d)1367 return;13681369 strbuf_init(&refname, dirnamelen + 257);1370 strbuf_add(&refname, dirname, dirnamelen);13711372 while ((de = readdir(d)) != NULL) {1373 unsigned char sha1[20];1374 struct stat st;1375 int flag;1376 const char *refdir;13771378 if (de->d_name[0] == '.')1379 continue;1380 if (ends_with(de->d_name, ".lock"))1381 continue;1382 strbuf_addstr(&refname, de->d_name);1383 refdir = *refs->name1384 ? git_path_submodule(refs->name, "%s", refname.buf)1385 : git_path("%s", refname.buf);1386 if (stat(refdir, &st) < 0) {1387 ; /* silently ignore */1388 } else if (S_ISDIR(st.st_mode)) {1389 strbuf_addch(&refname, '/');1390 add_entry_to_dir(dir,1391 create_dir_entry(refs, refname.buf,1392 refname.len, 1));1393 } else {1394 int read_ok;13951396 if (*refs->name) {1397 hashclr(sha1);1398 flag = 0;1399 read_ok = !resolve_gitlink_ref(refs->name,1400 refname.buf, sha1);1401 } else {1402 read_ok = !read_ref_full(refname.buf,1403 RESOLVE_REF_READING,1404 sha1, &flag);1405 }14061407 if (!read_ok) {1408 hashclr(sha1);1409 flag |= REF_ISBROKEN;1410 } else if (is_null_sha1(sha1)) {1411 /*1412 * It is so astronomically unlikely1413 * that NULL_SHA1 is the SHA-1 of an1414 * actual object that we consider its1415 * appearance in a loose reference1416 * file to be repo corruption1417 * (probably due to a software bug).1418 */1419 flag |= REF_ISBROKEN;1420 }14211422 if (check_refname_format(refname.buf,1423 REFNAME_ALLOW_ONELEVEL)) {1424 if (!refname_is_safe(refname.buf))1425 die("loose refname is dangerous: %s", refname.buf);1426 hashclr(sha1);1427 flag |= REF_BAD_NAME | REF_ISBROKEN;1428 }1429 add_entry_to_dir(dir,1430 create_ref_entry(refname.buf, sha1, flag, 0));1431 }1432 strbuf_setlen(&refname, dirnamelen);1433 }1434 strbuf_release(&refname);1435 closedir(d);1436}14371438static struct ref_dir *get_loose_refs(struct ref_cache *refs)1439{1440 if (!refs->loose) {1441 /*1442 * Mark the top-level directory complete because we1443 * are about to read the only subdirectory that can1444 * hold references:1445 */1446 refs->loose = create_dir_entry(refs, "", 0, 0);1447 /*1448 * Create an incomplete entry for "refs/":1449 */1450 add_entry_to_dir(get_ref_dir(refs->loose),1451 create_dir_entry(refs, "refs/", 5, 1));1452 }1453 return get_ref_dir(refs->loose);1454}14551456/* We allow "recursive" symbolic refs. Only within reason, though */1457#define MAXDEPTH 51458#define MAXREFLEN (1024)14591460/*1461 * Called by resolve_gitlink_ref_recursive() after it failed to read1462 * from the loose refs in ref_cache refs. Find <refname> in the1463 * packed-refs file for the submodule.1464 */1465static int resolve_gitlink_packed_ref(struct ref_cache *refs,1466 const char *refname, unsigned char *sha1)1467{1468 struct ref_entry *ref;1469 struct ref_dir *dir = get_packed_refs(refs);14701471 ref = find_ref(dir, refname);1472 if (ref == NULL)1473 return -1;14741475 hashcpy(sha1, ref->u.value.oid.hash);1476 return 0;1477}14781479static int resolve_gitlink_ref_recursive(struct ref_cache *refs,1480 const char *refname, unsigned char *sha1,1481 int recursion)1482{1483 int fd, len;1484 char buffer[128], *p;1485 char *path;14861487 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)1488 return -1;1489 path = *refs->name1490 ? git_pathdup_submodule(refs->name, "%s", refname)1491 : git_pathdup("%s", refname);1492 fd = open(path, O_RDONLY);1493 free(path);1494 if (fd < 0)1495 return resolve_gitlink_packed_ref(refs, refname, sha1);14961497 len = read(fd, buffer, sizeof(buffer)-1);1498 close(fd);1499 if (len < 0)1500 return -1;1501 while (len && isspace(buffer[len-1]))1502 len--;1503 buffer[len] = 0;15041505 /* Was it a detached head or an old-fashioned symlink? */1506 if (!get_sha1_hex(buffer, sha1))1507 return 0;15081509 /* Symref? */1510 if (strncmp(buffer, "ref:", 4))1511 return -1;1512 p = buffer + 4;1513 while (isspace(*p))1514 p++;15151516 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1517}15181519int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)1520{1521 int len = strlen(path), retval;1522 char *submodule;1523 struct ref_cache *refs;15241525 while (len && path[len-1] == '/')1526 len--;1527 if (!len)1528 return -1;1529 submodule = xstrndup(path, len);1530 refs = get_ref_cache(submodule);1531 free(submodule);15321533 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);1534 return retval;1535}15361537/*1538 * Return the ref_entry for the given refname from the packed1539 * references. If it does not exist, return NULL.1540 */1541static struct ref_entry *get_packed_ref(const char *refname)1542{1543 return find_ref(get_packed_refs(&ref_cache), refname);1544}15451546/*1547 * A loose ref file doesn't exist; check for a packed ref. The1548 * options are forwarded from resolve_safe_unsafe().1549 */1550static int resolve_missing_loose_ref(const char *refname,1551 int resolve_flags,1552 unsigned char *sha1,1553 int *flags)1554{1555 struct ref_entry *entry;15561557 /*1558 * The loose reference file does not exist; check for a packed1559 * reference.1560 */1561 entry = get_packed_ref(refname);1562 if (entry) {1563 hashcpy(sha1, entry->u.value.oid.hash);1564 if (flags)1565 *flags |= REF_ISPACKED;1566 return 0;1567 }1568 /* The reference is not a packed reference, either. */1569 if (resolve_flags & RESOLVE_REF_READING) {1570 errno = ENOENT;1571 return -1;1572 } else {1573 hashclr(sha1);1574 return 0;1575 }1576}15771578/* This function needs to return a meaningful errno on failure */1579static const char *resolve_ref_unsafe_1(const char *refname,1580 int resolve_flags,1581 unsigned char *sha1,1582 int *flags,1583 struct strbuf *sb_path)1584{1585 int depth = MAXDEPTH;1586 ssize_t len;1587 char buffer[256];1588 static char refname_buffer[256];1589 int bad_name = 0;15901591 if (flags)1592 *flags = 0;15931594 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1595 if (flags)1596 *flags |= REF_BAD_NAME;15971598 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1599 !refname_is_safe(refname)) {1600 errno = EINVAL;1601 return NULL;1602 }1603 /*1604 * dwim_ref() uses REF_ISBROKEN to distinguish between1605 * missing refs and refs that were present but invalid,1606 * to complain about the latter to stderr.1607 *1608 * We don't know whether the ref exists, so don't set1609 * REF_ISBROKEN yet.1610 */1611 bad_name = 1;1612 }1613 for (;;) {1614 const char *path;1615 struct stat st;1616 char *buf;1617 int fd;16181619 if (--depth < 0) {1620 errno = ELOOP;1621 return NULL;1622 }16231624 strbuf_reset(sb_path);1625 strbuf_git_path(sb_path, "%s", refname);1626 path = sb_path->buf;16271628 /*1629 * We might have to loop back here to avoid a race1630 * condition: first we lstat() the file, then we try1631 * to read it as a link or as a file. But if somebody1632 * changes the type of the file (file <-> directory1633 * <-> symlink) between the lstat() and reading, then1634 * we don't want to report that as an error but rather1635 * try again starting with the lstat().1636 */1637 stat_ref:1638 if (lstat(path, &st) < 0) {1639 if (errno != ENOENT)1640 return NULL;1641 if (resolve_missing_loose_ref(refname, resolve_flags,1642 sha1, flags))1643 return NULL;1644 if (bad_name) {1645 hashclr(sha1);1646 if (flags)1647 *flags |= REF_ISBROKEN;1648 }1649 return refname;1650 }16511652 /* Follow "normalized" - ie "refs/.." symlinks by hand */1653 if (S_ISLNK(st.st_mode)) {1654 len = readlink(path, buffer, sizeof(buffer)-1);1655 if (len < 0) {1656 if (errno == ENOENT || errno == EINVAL)1657 /* inconsistent with lstat; retry */1658 goto stat_ref;1659 else1660 return NULL;1661 }1662 buffer[len] = 0;1663 if (starts_with(buffer, "refs/") &&1664 !check_refname_format(buffer, 0)) {1665 strcpy(refname_buffer, buffer);1666 refname = refname_buffer;1667 if (flags)1668 *flags |= REF_ISSYMREF;1669 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {1670 hashclr(sha1);1671 return refname;1672 }1673 continue;1674 }1675 }16761677 /* Is it a directory? */1678 if (S_ISDIR(st.st_mode)) {1679 errno = EISDIR;1680 return NULL;1681 }16821683 /*1684 * Anything else, just open it and try to use it as1685 * a ref1686 */1687 fd = open(path, O_RDONLY);1688 if (fd < 0) {1689 if (errno == ENOENT)1690 /* inconsistent with lstat; retry */1691 goto stat_ref;1692 else1693 return NULL;1694 }1695 len = read_in_full(fd, buffer, sizeof(buffer)-1);1696 if (len < 0) {1697 int save_errno = errno;1698 close(fd);1699 errno = save_errno;1700 return NULL;1701 }1702 close(fd);1703 while (len && isspace(buffer[len-1]))1704 len--;1705 buffer[len] = '\0';17061707 /*1708 * Is it a symbolic ref?1709 */1710 if (!starts_with(buffer, "ref:")) {1711 /*1712 * Please note that FETCH_HEAD has a second1713 * line containing other data.1714 */1715 if (get_sha1_hex(buffer, sha1) ||1716 (buffer[40] != '\0' && !isspace(buffer[40]))) {1717 if (flags)1718 *flags |= REF_ISBROKEN;1719 errno = EINVAL;1720 return NULL;1721 }1722 if (bad_name) {1723 hashclr(sha1);1724 if (flags)1725 *flags |= REF_ISBROKEN;1726 }1727 return refname;1728 }1729 if (flags)1730 *flags |= REF_ISSYMREF;1731 buf = buffer + 4;1732 while (isspace(*buf))1733 buf++;1734 refname = strcpy(refname_buffer, buf);1735 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {1736 hashclr(sha1);1737 return refname;1738 }1739 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {1740 if (flags)1741 *flags |= REF_ISBROKEN;17421743 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1744 !refname_is_safe(buf)) {1745 errno = EINVAL;1746 return NULL;1747 }1748 bad_name = 1;1749 }1750 }1751}17521753const char *resolve_ref_unsafe(const char *refname, int resolve_flags,1754 unsigned char *sha1, int *flags)1755{1756 struct strbuf sb_path = STRBUF_INIT;1757 const char *ret = resolve_ref_unsafe_1(refname, resolve_flags,1758 sha1, flags, &sb_path);1759 strbuf_release(&sb_path);1760 return ret;1761}17621763char *resolve_refdup(const char *refname, int resolve_flags,1764 unsigned char *sha1, int *flags)1765{1766 return xstrdup_or_null(resolve_ref_unsafe(refname, resolve_flags,1767 sha1, flags));1768}17691770/* The argument to filter_refs */1771struct ref_filter {1772 const char *pattern;1773 each_ref_fn *fn;1774 void *cb_data;1775};17761777int read_ref_full(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)1778{1779 if (resolve_ref_unsafe(refname, resolve_flags, sha1, flags))1780 return 0;1781 return -1;1782}17831784int read_ref(const char *refname, unsigned char *sha1)1785{1786 return read_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);1787}17881789int ref_exists(const char *refname)1790{1791 unsigned char sha1[20];1792 return !!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);1793}17941795static int filter_refs(const char *refname, const struct object_id *oid,1796 int flags, void *data)1797{1798 struct ref_filter *filter = (struct ref_filter *)data;17991800 if (wildmatch(filter->pattern, refname, 0, NULL))1801 return 0;1802 return filter->fn(refname, oid, flags, filter->cb_data);1803}18041805enum peel_status {1806 /* object was peeled successfully: */1807 PEEL_PEELED = 0,18081809 /*1810 * object cannot be peeled because the named object (or an1811 * object referred to by a tag in the peel chain), does not1812 * exist.1813 */1814 PEEL_INVALID = -1,18151816 /* object cannot be peeled because it is not a tag: */1817 PEEL_NON_TAG = -2,18181819 /* ref_entry contains no peeled value because it is a symref: */1820 PEEL_IS_SYMREF = -3,18211822 /*1823 * ref_entry cannot be peeled because it is broken (i.e., the1824 * symbolic reference cannot even be resolved to an object1825 * name):1826 */1827 PEEL_BROKEN = -41828};18291830/*1831 * Peel the named object; i.e., if the object is a tag, resolve the1832 * tag recursively until a non-tag is found. If successful, store the1833 * result to sha1 and return PEEL_PEELED. If the object is not a tag1834 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,1835 * and leave sha1 unchanged.1836 */1837static enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)1838{1839 struct object *o = lookup_unknown_object(name);18401841 if (o->type == OBJ_NONE) {1842 int type = sha1_object_info(name, NULL);1843 if (type < 0 || !object_as_type(o, type, 0))1844 return PEEL_INVALID;1845 }18461847 if (o->type != OBJ_TAG)1848 return PEEL_NON_TAG;18491850 o = deref_tag_noverify(o);1851 if (!o)1852 return PEEL_INVALID;18531854 hashcpy(sha1, o->sha1);1855 return PEEL_PEELED;1856}18571858/*1859 * Peel the entry (if possible) and return its new peel_status. If1860 * repeel is true, re-peel the entry even if there is an old peeled1861 * value that is already stored in it.1862 *1863 * It is OK to call this function with a packed reference entry that1864 * might be stale and might even refer to an object that has since1865 * been garbage-collected. In such a case, if the entry has1866 * REF_KNOWS_PEELED then leave the status unchanged and return1867 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1868 */1869static enum peel_status peel_entry(struct ref_entry *entry, int repeel)1870{1871 enum peel_status status;18721873 if (entry->flag & REF_KNOWS_PEELED) {1874 if (repeel) {1875 entry->flag &= ~REF_KNOWS_PEELED;1876 oidclr(&entry->u.value.peeled);1877 } else {1878 return is_null_oid(&entry->u.value.peeled) ?1879 PEEL_NON_TAG : PEEL_PEELED;1880 }1881 }1882 if (entry->flag & REF_ISBROKEN)1883 return PEEL_BROKEN;1884 if (entry->flag & REF_ISSYMREF)1885 return PEEL_IS_SYMREF;18861887 status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1888 if (status == PEEL_PEELED || status == PEEL_NON_TAG)1889 entry->flag |= REF_KNOWS_PEELED;1890 return status;1891}18921893int peel_ref(const char *refname, unsigned char *sha1)1894{1895 int flag;1896 unsigned char base[20];18971898 if (current_ref && (current_ref->name == refname1899 || !strcmp(current_ref->name, refname))) {1900 if (peel_entry(current_ref, 0))1901 return -1;1902 hashcpy(sha1, current_ref->u.value.peeled.hash);1903 return 0;1904 }19051906 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1907 return -1;19081909 /*1910 * If the reference is packed, read its ref_entry from the1911 * cache in the hope that we already know its peeled value.1912 * We only try this optimization on packed references because1913 * (a) forcing the filling of the loose reference cache could1914 * be expensive and (b) loose references anyway usually do not1915 * have REF_KNOWS_PEELED.1916 */1917 if (flag & REF_ISPACKED) {1918 struct ref_entry *r = get_packed_ref(refname);1919 if (r) {1920 if (peel_entry(r, 0))1921 return -1;1922 hashcpy(sha1, r->u.value.peeled.hash);1923 return 0;1924 }1925 }19261927 return peel_object(base, sha1);1928}19291930struct warn_if_dangling_data {1931 FILE *fp;1932 const char *refname;1933 const struct string_list *refnames;1934 const char *msg_fmt;1935};19361937static int warn_if_dangling_symref(const char *refname, const struct object_id *oid,1938 int flags, void *cb_data)1939{1940 struct warn_if_dangling_data *d = cb_data;1941 const char *resolves_to;1942 struct object_id junk;19431944 if (!(flags & REF_ISSYMREF))1945 return 0;19461947 resolves_to = resolve_ref_unsafe(refname, 0, junk.hash, NULL);1948 if (!resolves_to1949 || (d->refname1950 ? strcmp(resolves_to, d->refname)1951 : !string_list_has_string(d->refnames, resolves_to))) {1952 return 0;1953 }19541955 fprintf(d->fp, d->msg_fmt, refname);1956 fputc('\n', d->fp);1957 return 0;1958}19591960void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)1961{1962 struct warn_if_dangling_data data;19631964 data.fp = fp;1965 data.refname = refname;1966 data.refnames = NULL;1967 data.msg_fmt = msg_fmt;1968 for_each_rawref(warn_if_dangling_symref, &data);1969}19701971void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)1972{1973 struct warn_if_dangling_data data;19741975 data.fp = fp;1976 data.refname = NULL;1977 data.refnames = refnames;1978 data.msg_fmt = msg_fmt;1979 for_each_rawref(warn_if_dangling_symref, &data);1980}19811982/*1983 * Call fn for each reference in the specified ref_cache, omitting1984 * references not in the containing_dir of base. fn is called for all1985 * references, including broken ones. If fn ever returns a non-zero1986 * value, stop the iteration and return that value; otherwise, return1987 * 0.1988 */1989static int do_for_each_entry(struct ref_cache *refs, const char *base,1990 each_ref_entry_fn fn, void *cb_data)1991{1992 struct packed_ref_cache *packed_ref_cache;1993 struct ref_dir *loose_dir;1994 struct ref_dir *packed_dir;1995 int retval = 0;19961997 /*1998 * We must make sure that all loose refs are read before accessing the1999 * packed-refs file; this avoids a race condition in which loose refs2000 * are migrated to the packed-refs file by a simultaneous process, but2001 * our in-memory view is from before the migration. get_packed_ref_cache()2002 * takes care of making sure our view is up to date with what is on2003 * disk.2004 */2005 loose_dir = get_loose_refs(refs);2006 if (base && *base) {2007 loose_dir = find_containing_dir(loose_dir, base, 0);2008 }2009 if (loose_dir)2010 prime_ref_dir(loose_dir);20112012 packed_ref_cache = get_packed_ref_cache(refs);2013 acquire_packed_ref_cache(packed_ref_cache);2014 packed_dir = get_packed_ref_dir(packed_ref_cache);2015 if (base && *base) {2016 packed_dir = find_containing_dir(packed_dir, base, 0);2017 }20182019 if (packed_dir && loose_dir) {2020 sort_ref_dir(packed_dir);2021 sort_ref_dir(loose_dir);2022 retval = do_for_each_entry_in_dirs(2023 packed_dir, loose_dir, fn, cb_data);2024 } else if (packed_dir) {2025 sort_ref_dir(packed_dir);2026 retval = do_for_each_entry_in_dir(2027 packed_dir, 0, fn, cb_data);2028 } else if (loose_dir) {2029 sort_ref_dir(loose_dir);2030 retval = do_for_each_entry_in_dir(2031 loose_dir, 0, fn, cb_data);2032 }20332034 release_packed_ref_cache(packed_ref_cache);2035 return retval;2036}20372038/*2039 * Call fn for each reference in the specified ref_cache for which the2040 * refname begins with base. If trim is non-zero, then trim that many2041 * characters off the beginning of each refname before passing the2042 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include2043 * broken references in the iteration. If fn ever returns a non-zero2044 * value, stop the iteration and return that value; otherwise, return2045 * 0.2046 */2047static int do_for_each_ref(struct ref_cache *refs, const char *base,2048 each_ref_fn fn, int trim, int flags, void *cb_data)2049{2050 struct ref_entry_cb data;2051 data.base = base;2052 data.trim = trim;2053 data.flags = flags;2054 data.fn = fn;2055 data.cb_data = cb_data;20562057 if (ref_paranoia < 0)2058 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);2059 if (ref_paranoia)2060 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;20612062 return do_for_each_entry(refs, base, do_one_ref, &data);2063}20642065static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)2066{2067 struct object_id oid;2068 int flag;20692070 if (submodule) {2071 if (resolve_gitlink_ref(submodule, "HEAD", oid.hash) == 0)2072 return fn("HEAD", &oid, 0, cb_data);20732074 return 0;2075 }20762077 if (!read_ref_full("HEAD", RESOLVE_REF_READING, oid.hash, &flag))2078 return fn("HEAD", &oid, flag, cb_data);20792080 return 0;2081}20822083int head_ref(each_ref_fn fn, void *cb_data)2084{2085 return do_head_ref(NULL, fn, cb_data);2086}20872088int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2089{2090 return do_head_ref(submodule, fn, cb_data);2091}20922093int for_each_ref(each_ref_fn fn, void *cb_data)2094{2095 return do_for_each_ref(&ref_cache, "", fn, 0, 0, cb_data);2096}20972098int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2099{2100 return do_for_each_ref(get_ref_cache(submodule), "", fn, 0, 0, cb_data);2101}21022103int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)2104{2105 return do_for_each_ref(&ref_cache, prefix, fn, strlen(prefix), 0, cb_data);2106}21072108int for_each_ref_in_submodule(const char *submodule, const char *prefix,2109 each_ref_fn fn, void *cb_data)2110{2111 return do_for_each_ref(get_ref_cache(submodule), prefix, fn, strlen(prefix), 0, cb_data);2112}21132114int for_each_tag_ref(each_ref_fn fn, void *cb_data)2115{2116 return for_each_ref_in("refs/tags/", fn, cb_data);2117}21182119int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2120{2121 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);2122}21232124int for_each_branch_ref(each_ref_fn fn, void *cb_data)2125{2126 return for_each_ref_in("refs/heads/", fn, cb_data);2127}21282129int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2130{2131 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);2132}21332134int for_each_remote_ref(each_ref_fn fn, void *cb_data)2135{2136 return for_each_ref_in("refs/remotes/", fn, cb_data);2137}21382139int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2140{2141 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);2142}21432144int for_each_replace_ref(each_ref_fn fn, void *cb_data)2145{2146 return do_for_each_ref(&ref_cache, git_replace_ref_base, fn,2147 strlen(git_replace_ref_base), 0, cb_data);2148}21492150int head_ref_namespaced(each_ref_fn fn, void *cb_data)2151{2152 struct strbuf buf = STRBUF_INIT;2153 int ret = 0;2154 struct object_id oid;2155 int flag;21562157 strbuf_addf(&buf, "%sHEAD", get_git_namespace());2158 if (!read_ref_full(buf.buf, RESOLVE_REF_READING, oid.hash, &flag))2159 ret = fn(buf.buf, &oid, flag, cb_data);2160 strbuf_release(&buf);21612162 return ret;2163}21642165int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)2166{2167 struct strbuf buf = STRBUF_INIT;2168 int ret;2169 strbuf_addf(&buf, "%srefs/", get_git_namespace());2170 ret = do_for_each_ref(&ref_cache, buf.buf, fn, 0, 0, cb_data);2171 strbuf_release(&buf);2172 return ret;2173}21742175int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,2176 const char *prefix, void *cb_data)2177{2178 struct strbuf real_pattern = STRBUF_INIT;2179 struct ref_filter filter;2180 int ret;21812182 if (!prefix && !starts_with(pattern, "refs/"))2183 strbuf_addstr(&real_pattern, "refs/");2184 else if (prefix)2185 strbuf_addstr(&real_pattern, prefix);2186 strbuf_addstr(&real_pattern, pattern);21872188 if (!has_glob_specials(pattern)) {2189 /* Append implied '/' '*' if not present. */2190 if (real_pattern.buf[real_pattern.len - 1] != '/')2191 strbuf_addch(&real_pattern, '/');2192 /* No need to check for '*', there is none. */2193 strbuf_addch(&real_pattern, '*');2194 }21952196 filter.pattern = real_pattern.buf;2197 filter.fn = fn;2198 filter.cb_data = cb_data;2199 ret = for_each_ref(filter_refs, &filter);22002201 strbuf_release(&real_pattern);2202 return ret;2203}22042205int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)2206{2207 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);2208}22092210int for_each_rawref(each_ref_fn fn, void *cb_data)2211{2212 return do_for_each_ref(&ref_cache, "", fn, 0,2213 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);2214}22152216const char *prettify_refname(const char *name)2217{2218 return name + (2219 starts_with(name, "refs/heads/") ? 11 :2220 starts_with(name, "refs/tags/") ? 10 :2221 starts_with(name, "refs/remotes/") ? 13 :2222 0);2223}22242225static const char *ref_rev_parse_rules[] = {2226 "%.*s",2227 "refs/%.*s",2228 "refs/tags/%.*s",2229 "refs/heads/%.*s",2230 "refs/remotes/%.*s",2231 "refs/remotes/%.*s/HEAD",2232 NULL2233};22342235int refname_match(const char *abbrev_name, const char *full_name)2236{2237 const char **p;2238 const int abbrev_name_len = strlen(abbrev_name);22392240 for (p = ref_rev_parse_rules; *p; p++) {2241 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {2242 return 1;2243 }2244 }22452246 return 0;2247}22482249static void unlock_ref(struct ref_lock *lock)2250{2251 /* Do not free lock->lk -- atexit() still looks at them */2252 if (lock->lk)2253 rollback_lock_file(lock->lk);2254 free(lock->ref_name);2255 free(lock->orig_ref_name);2256 free(lock);2257}22582259/*2260 * Verify that the reference locked by lock has the value old_sha1.2261 * Fail if the reference doesn't exist and mustexist is set. Return 02262 * on success. On error, write an error message to err, set errno, and2263 * return a negative value.2264 */2265static int verify_lock(struct ref_lock *lock,2266 const unsigned char *old_sha1, int mustexist,2267 struct strbuf *err)2268{2269 assert(err);22702271 if (read_ref_full(lock->ref_name,2272 mustexist ? RESOLVE_REF_READING : 0,2273 lock->old_oid.hash, NULL)) {2274 int save_errno = errno;2275 strbuf_addf(err, "can't verify ref %s", lock->ref_name);2276 errno = save_errno;2277 return -1;2278 }2279 if (hashcmp(lock->old_oid.hash, old_sha1)) {2280 strbuf_addf(err, "ref %s is at %s but expected %s",2281 lock->ref_name,2282 sha1_to_hex(lock->old_oid.hash),2283 sha1_to_hex(old_sha1));2284 errno = EBUSY;2285 return -1;2286 }2287 return 0;2288}22892290static int remove_empty_directories(const char *file)2291{2292 /* we want to create a file but there is a directory there;2293 * if that is an empty directory (or a directory that contains2294 * only empty directories), remove them.2295 */2296 struct strbuf path;2297 int result, save_errno;22982299 strbuf_init(&path, 20);2300 strbuf_addstr(&path, file);23012302 result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);2303 save_errno = errno;23042305 strbuf_release(&path);2306 errno = save_errno;23072308 return result;2309}23102311/*2312 * *string and *len will only be substituted, and *string returned (for2313 * later free()ing) if the string passed in is a magic short-hand form2314 * to name a branch.2315 */2316static char *substitute_branch_name(const char **string, int *len)2317{2318 struct strbuf buf = STRBUF_INIT;2319 int ret = interpret_branch_name(*string, *len, &buf);23202321 if (ret == *len) {2322 size_t size;2323 *string = strbuf_detach(&buf, &size);2324 *len = size;2325 return (char *)*string;2326 }23272328 return NULL;2329}23302331int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)2332{2333 char *last_branch = substitute_branch_name(&str, &len);2334 const char **p, *r;2335 int refs_found = 0;23362337 *ref = NULL;2338 for (p = ref_rev_parse_rules; *p; p++) {2339 char fullref[PATH_MAX];2340 unsigned char sha1_from_ref[20];2341 unsigned char *this_result;2342 int flag;23432344 this_result = refs_found ? sha1_from_ref : sha1;2345 mksnpath(fullref, sizeof(fullref), *p, len, str);2346 r = resolve_ref_unsafe(fullref, RESOLVE_REF_READING,2347 this_result, &flag);2348 if (r) {2349 if (!refs_found++)2350 *ref = xstrdup(r);2351 if (!warn_ambiguous_refs)2352 break;2353 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {2354 warning("ignoring dangling symref %s.", fullref);2355 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {2356 warning("ignoring broken ref %s.", fullref);2357 }2358 }2359 free(last_branch);2360 return refs_found;2361}23622363int dwim_log(const char *str, int len, unsigned char *sha1, char **log)2364{2365 char *last_branch = substitute_branch_name(&str, &len);2366 const char **p;2367 int logs_found = 0;23682369 *log = NULL;2370 for (p = ref_rev_parse_rules; *p; p++) {2371 unsigned char hash[20];2372 char path[PATH_MAX];2373 const char *ref, *it;23742375 mksnpath(path, sizeof(path), *p, len, str);2376 ref = resolve_ref_unsafe(path, RESOLVE_REF_READING,2377 hash, NULL);2378 if (!ref)2379 continue;2380 if (reflog_exists(path))2381 it = path;2382 else if (strcmp(ref, path) && reflog_exists(ref))2383 it = ref;2384 else2385 continue;2386 if (!logs_found++) {2387 *log = xstrdup(it);2388 hashcpy(sha1, hash);2389 }2390 if (!warn_ambiguous_refs)2391 break;2392 }2393 free(last_branch);2394 return logs_found;2395}23962397/*2398 * Locks a ref returning the lock on success and NULL on failure.2399 * On failure errno is set to something meaningful.2400 */2401static struct ref_lock *lock_ref_sha1_basic(const char *refname,2402 const unsigned char *old_sha1,2403 const struct string_list *extras,2404 const struct string_list *skip,2405 unsigned int flags, int *type_p,2406 struct strbuf *err)2407{2408 const char *ref_file;2409 const char *orig_refname = refname;2410 struct ref_lock *lock;2411 int last_errno = 0;2412 int type, lflags;2413 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2414 int resolve_flags = 0;2415 int attempts_remaining = 3;24162417 assert(err);24182419 lock = xcalloc(1, sizeof(struct ref_lock));24202421 if (mustexist)2422 resolve_flags |= RESOLVE_REF_READING;2423 if (flags & REF_DELETING) {2424 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;2425 if (flags & REF_NODEREF)2426 resolve_flags |= RESOLVE_REF_NO_RECURSE;2427 }24282429 refname = resolve_ref_unsafe(refname, resolve_flags,2430 lock->old_oid.hash, &type);2431 if (!refname && errno == EISDIR) {2432 /* we are trying to lock foo but we used to2433 * have foo/bar which now does not exist;2434 * it is normal for the empty directory 'foo'2435 * to remain.2436 */2437 ref_file = git_path("%s", orig_refname);2438 if (remove_empty_directories(ref_file)) {2439 last_errno = errno;24402441 if (!verify_refname_available(orig_refname, extras, skip,2442 get_loose_refs(&ref_cache), err))2443 strbuf_addf(err, "there are still refs under '%s'",2444 orig_refname);24452446 goto error_return;2447 }2448 refname = resolve_ref_unsafe(orig_refname, resolve_flags,2449 lock->old_oid.hash, &type);2450 }2451 if (type_p)2452 *type_p = type;2453 if (!refname) {2454 last_errno = errno;2455 if (last_errno != ENOTDIR ||2456 !verify_refname_available(orig_refname, extras, skip,2457 get_loose_refs(&ref_cache), err))2458 strbuf_addf(err, "unable to resolve reference %s: %s",2459 orig_refname, strerror(last_errno));24602461 goto error_return;2462 }2463 /*2464 * If the ref did not exist and we are creating it, make sure2465 * there is no existing packed ref whose name begins with our2466 * refname, nor a packed ref whose name is a proper prefix of2467 * our refname.2468 */2469 if (is_null_oid(&lock->old_oid) &&2470 verify_refname_available(refname, extras, skip,2471 get_packed_refs(&ref_cache), err)) {2472 last_errno = ENOTDIR;2473 goto error_return;2474 }24752476 lock->lk = xcalloc(1, sizeof(struct lock_file));24772478 lflags = 0;2479 if (flags & REF_NODEREF) {2480 refname = orig_refname;2481 lflags |= LOCK_NO_DEREF;2482 }2483 lock->ref_name = xstrdup(refname);2484 lock->orig_ref_name = xstrdup(orig_refname);2485 ref_file = git_path("%s", refname);24862487 retry:2488 switch (safe_create_leading_directories_const(ref_file)) {2489 case SCLD_OK:2490 break; /* success */2491 case SCLD_VANISHED:2492 if (--attempts_remaining > 0)2493 goto retry;2494 /* fall through */2495 default:2496 last_errno = errno;2497 strbuf_addf(err, "unable to create directory for %s", ref_file);2498 goto error_return;2499 }25002501 if (hold_lock_file_for_update(lock->lk, ref_file, lflags) < 0) {2502 last_errno = errno;2503 if (errno == ENOENT && --attempts_remaining > 0)2504 /*2505 * Maybe somebody just deleted one of the2506 * directories leading to ref_file. Try2507 * again:2508 */2509 goto retry;2510 else {2511 unable_to_lock_message(ref_file, errno, err);2512 goto error_return;2513 }2514 }2515 if (old_sha1 && verify_lock(lock, old_sha1, mustexist, err)) {2516 last_errno = errno;2517 goto error_return;2518 }2519 return lock;25202521 error_return:2522 unlock_ref(lock);2523 errno = last_errno;2524 return NULL;2525}25262527/*2528 * Write an entry to the packed-refs file for the specified refname.2529 * If peeled is non-NULL, write it as the entry's peeled value.2530 */2531static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,2532 unsigned char *peeled)2533{2534 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);2535 if (peeled)2536 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));2537}25382539/*2540 * An each_ref_entry_fn that writes the entry to a packed-refs file.2541 */2542static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)2543{2544 enum peel_status peel_status = peel_entry(entry, 0);25452546 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2547 error("internal error: %s is not a valid packed reference!",2548 entry->name);2549 write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2550 peel_status == PEEL_PEELED ?2551 entry->u.value.peeled.hash : NULL);2552 return 0;2553}25542555/*2556 * Lock the packed-refs file for writing. Flags is passed to2557 * hold_lock_file_for_update(). Return 0 on success. On errors, set2558 * errno appropriately and return a nonzero value.2559 */2560static int lock_packed_refs(int flags)2561{2562 static int timeout_configured = 0;2563 static int timeout_value = 1000;25642565 struct packed_ref_cache *packed_ref_cache;25662567 if (!timeout_configured) {2568 git_config_get_int("core.packedrefstimeout", &timeout_value);2569 timeout_configured = 1;2570 }25712572 if (hold_lock_file_for_update_timeout(2573 &packlock, git_path("packed-refs"),2574 flags, timeout_value) < 0)2575 return -1;2576 /*2577 * Get the current packed-refs while holding the lock. If the2578 * packed-refs file has been modified since we last read it,2579 * this will automatically invalidate the cache and re-read2580 * the packed-refs file.2581 */2582 packed_ref_cache = get_packed_ref_cache(&ref_cache);2583 packed_ref_cache->lock = &packlock;2584 /* Increment the reference count to prevent it from being freed: */2585 acquire_packed_ref_cache(packed_ref_cache);2586 return 0;2587}25882589/*2590 * Write the current version of the packed refs cache from memory to2591 * disk. The packed-refs file must already be locked for writing (see2592 * lock_packed_refs()). Return zero on success. On errors, set errno2593 * and return a nonzero value2594 */2595static int commit_packed_refs(void)2596{2597 struct packed_ref_cache *packed_ref_cache =2598 get_packed_ref_cache(&ref_cache);2599 int error = 0;2600 int save_errno = 0;2601 FILE *out;26022603 if (!packed_ref_cache->lock)2604 die("internal error: packed-refs not locked");26052606 out = fdopen_lock_file(packed_ref_cache->lock, "w");2607 if (!out)2608 die_errno("unable to fdopen packed-refs descriptor");26092610 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);2611 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),2612 0, write_packed_entry_fn, out);26132614 if (commit_lock_file(packed_ref_cache->lock)) {2615 save_errno = errno;2616 error = -1;2617 }2618 packed_ref_cache->lock = NULL;2619 release_packed_ref_cache(packed_ref_cache);2620 errno = save_errno;2621 return error;2622}26232624/*2625 * Rollback the lockfile for the packed-refs file, and discard the2626 * in-memory packed reference cache. (The packed-refs file will be2627 * read anew if it is needed again after this function is called.)2628 */2629static void rollback_packed_refs(void)2630{2631 struct packed_ref_cache *packed_ref_cache =2632 get_packed_ref_cache(&ref_cache);26332634 if (!packed_ref_cache->lock)2635 die("internal error: packed-refs not locked");2636 rollback_lock_file(packed_ref_cache->lock);2637 packed_ref_cache->lock = NULL;2638 release_packed_ref_cache(packed_ref_cache);2639 clear_packed_ref_cache(&ref_cache);2640}26412642struct ref_to_prune {2643 struct ref_to_prune *next;2644 unsigned char sha1[20];2645 char name[FLEX_ARRAY];2646};26472648struct pack_refs_cb_data {2649 unsigned int flags;2650 struct ref_dir *packed_refs;2651 struct ref_to_prune *ref_to_prune;2652};26532654/*2655 * An each_ref_entry_fn that is run over loose references only. If2656 * the loose reference can be packed, add an entry in the packed ref2657 * cache. If the reference should be pruned, also add it to2658 * ref_to_prune in the pack_refs_cb_data.2659 */2660static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)2661{2662 struct pack_refs_cb_data *cb = cb_data;2663 enum peel_status peel_status;2664 struct ref_entry *packed_entry;2665 int is_tag_ref = starts_with(entry->name, "refs/tags/");26662667 /* ALWAYS pack tags */2668 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2669 return 0;26702671 /* Do not pack symbolic or broken refs: */2672 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2673 return 0;26742675 /* Add a packed ref cache entry equivalent to the loose entry. */2676 peel_status = peel_entry(entry, 1);2677 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2678 die("internal error peeling reference %s (%s)",2679 entry->name, oid_to_hex(&entry->u.value.oid));2680 packed_entry = find_ref(cb->packed_refs, entry->name);2681 if (packed_entry) {2682 /* Overwrite existing packed entry with info from loose entry */2683 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2684 oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2685 } else {2686 packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,2687 REF_ISPACKED | REF_KNOWS_PEELED, 0);2688 add_ref(cb->packed_refs, packed_entry);2689 }2690 oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);26912692 /* Schedule the loose reference for pruning if requested. */2693 if ((cb->flags & PACK_REFS_PRUNE)) {2694 int namelen = strlen(entry->name) + 1;2695 struct ref_to_prune *n = xcalloc(1, sizeof(*n) + namelen);2696 hashcpy(n->sha1, entry->u.value.oid.hash);2697 strcpy(n->name, entry->name);2698 n->next = cb->ref_to_prune;2699 cb->ref_to_prune = n;2700 }2701 return 0;2702}27032704/*2705 * Remove empty parents, but spare refs/ and immediate subdirs.2706 * Note: munges *name.2707 */2708static void try_remove_empty_parents(char *name)2709{2710 char *p, *q;2711 int i;2712 p = name;2713 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */2714 while (*p && *p != '/')2715 p++;2716 /* tolerate duplicate slashes; see check_refname_format() */2717 while (*p == '/')2718 p++;2719 }2720 for (q = p; *q; q++)2721 ;2722 while (1) {2723 while (q > p && *q != '/')2724 q--;2725 while (q > p && *(q-1) == '/')2726 q--;2727 if (q == p)2728 break;2729 *q = '\0';2730 if (rmdir(git_path("%s", name)))2731 break;2732 }2733}27342735/* make sure nobody touched the ref, and unlink */2736static void prune_ref(struct ref_to_prune *r)2737{2738 struct ref_transaction *transaction;2739 struct strbuf err = STRBUF_INIT;27402741 if (check_refname_format(r->name, 0))2742 return;27432744 transaction = ref_transaction_begin(&err);2745 if (!transaction ||2746 ref_transaction_delete(transaction, r->name, r->sha1,2747 REF_ISPRUNING, NULL, &err) ||2748 ref_transaction_commit(transaction, &err)) {2749 ref_transaction_free(transaction);2750 error("%s", err.buf);2751 strbuf_release(&err);2752 return;2753 }2754 ref_transaction_free(transaction);2755 strbuf_release(&err);2756 try_remove_empty_parents(r->name);2757}27582759static void prune_refs(struct ref_to_prune *r)2760{2761 while (r) {2762 prune_ref(r);2763 r = r->next;2764 }2765}27662767int pack_refs(unsigned int flags)2768{2769 struct pack_refs_cb_data cbdata;27702771 memset(&cbdata, 0, sizeof(cbdata));2772 cbdata.flags = flags;27732774 lock_packed_refs(LOCK_DIE_ON_ERROR);2775 cbdata.packed_refs = get_packed_refs(&ref_cache);27762777 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,2778 pack_if_possible_fn, &cbdata);27792780 if (commit_packed_refs())2781 die_errno("unable to overwrite old ref-pack file");27822783 prune_refs(cbdata.ref_to_prune);2784 return 0;2785}27862787/*2788 * Rewrite the packed-refs file, omitting any refs listed in2789 * 'refnames'. On error, leave packed-refs unchanged, write an error2790 * message to 'err', and return a nonzero value.2791 *2792 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2793 */2794static int repack_without_refs(struct string_list *refnames, struct strbuf *err)2795{2796 struct ref_dir *packed;2797 struct string_list_item *refname;2798 int ret, needs_repacking = 0, removed = 0;27992800 assert(err);28012802 /* Look for a packed ref */2803 for_each_string_list_item(refname, refnames) {2804 if (get_packed_ref(refname->string)) {2805 needs_repacking = 1;2806 break;2807 }2808 }28092810 /* Avoid locking if we have nothing to do */2811 if (!needs_repacking)2812 return 0; /* no refname exists in packed refs */28132814 if (lock_packed_refs(0)) {2815 unable_to_lock_message(git_path("packed-refs"), errno, err);2816 return -1;2817 }2818 packed = get_packed_refs(&ref_cache);28192820 /* Remove refnames from the cache */2821 for_each_string_list_item(refname, refnames)2822 if (remove_entry(packed, refname->string) != -1)2823 removed = 1;2824 if (!removed) {2825 /*2826 * All packed entries disappeared while we were2827 * acquiring the lock.2828 */2829 rollback_packed_refs();2830 return 0;2831 }28322833 /* Write what remains */2834 ret = commit_packed_refs();2835 if (ret)2836 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",2837 strerror(errno));2838 return ret;2839}28402841static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)2842{2843 assert(err);28442845 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2846 /*2847 * loose. The loose file name is the same as the2848 * lockfile name, minus ".lock":2849 */2850 char *loose_filename = get_locked_file_path(lock->lk);2851 int res = unlink_or_msg(loose_filename, err);2852 free(loose_filename);2853 if (res)2854 return 1;2855 }2856 return 0;2857}28582859int delete_ref(const char *refname, const unsigned char *old_sha1,2860 unsigned int flags)2861{2862 struct ref_transaction *transaction;2863 struct strbuf err = STRBUF_INIT;28642865 transaction = ref_transaction_begin(&err);2866 if (!transaction ||2867 ref_transaction_delete(transaction, refname, old_sha1,2868 flags, NULL, &err) ||2869 ref_transaction_commit(transaction, &err)) {2870 error("%s", err.buf);2871 ref_transaction_free(transaction);2872 strbuf_release(&err);2873 return 1;2874 }2875 ref_transaction_free(transaction);2876 strbuf_release(&err);2877 return 0;2878}28792880int delete_refs(struct string_list *refnames)2881{2882 struct strbuf err = STRBUF_INIT;2883 int i, result = 0;28842885 if (!refnames->nr)2886 return 0;28872888 result = repack_without_refs(refnames, &err);2889 if (result) {2890 /*2891 * If we failed to rewrite the packed-refs file, then2892 * it is unsafe to try to remove loose refs, because2893 * doing so might expose an obsolete packed value for2894 * a reference that might even point at an object that2895 * has been garbage collected.2896 */2897 if (refnames->nr == 1)2898 error(_("could not delete reference %s: %s"),2899 refnames->items[0].string, err.buf);2900 else2901 error(_("could not delete references: %s"), err.buf);29022903 goto out;2904 }29052906 for (i = 0; i < refnames->nr; i++) {2907 const char *refname = refnames->items[i].string;29082909 if (delete_ref(refname, NULL, 0))2910 result |= error(_("could not remove reference %s"), refname);2911 }29122913out:2914 strbuf_release(&err);2915 return result;2916}29172918/*2919 * People using contrib's git-new-workdir have .git/logs/refs ->2920 * /some/other/path/.git/logs/refs, and that may live on another device.2921 *2922 * IOW, to avoid cross device rename errors, the temporary renamed log must2923 * live into logs/refs.2924 */2925#define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"29262927static int rename_tmp_log(const char *newrefname)2928{2929 int attempts_remaining = 4;29302931 retry:2932 switch (safe_create_leading_directories_const(git_path("logs/%s", newrefname))) {2933 case SCLD_OK:2934 break; /* success */2935 case SCLD_VANISHED:2936 if (--attempts_remaining > 0)2937 goto retry;2938 /* fall through */2939 default:2940 error("unable to create directory for %s", newrefname);2941 return -1;2942 }29432944 if (rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {2945 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {2946 /*2947 * rename(a, b) when b is an existing2948 * directory ought to result in ISDIR, but2949 * Solaris 5.8 gives ENOTDIR. Sheesh.2950 */2951 if (remove_empty_directories(git_path("logs/%s", newrefname))) {2952 error("Directory not empty: logs/%s", newrefname);2953 return -1;2954 }2955 goto retry;2956 } else if (errno == ENOENT && --attempts_remaining > 0) {2957 /*2958 * Maybe another process just deleted one of2959 * the directories in the path to newrefname.2960 * Try again from the beginning.2961 */2962 goto retry;2963 } else {2964 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",2965 newrefname, strerror(errno));2966 return -1;2967 }2968 }2969 return 0;2970}29712972static int rename_ref_available(const char *oldname, const char *newname)2973{2974 struct string_list skip = STRING_LIST_INIT_NODUP;2975 struct strbuf err = STRBUF_INIT;2976 int ret;29772978 string_list_insert(&skip, oldname);2979 ret = !verify_refname_available(newname, NULL, &skip,2980 get_packed_refs(&ref_cache), &err)2981 && !verify_refname_available(newname, NULL, &skip,2982 get_loose_refs(&ref_cache), &err);2983 if (!ret)2984 error("%s", err.buf);29852986 string_list_clear(&skip, 0);2987 strbuf_release(&err);2988 return ret;2989}29902991static int write_ref_to_lockfile(struct ref_lock *lock,2992 const unsigned char *sha1, struct strbuf *err);2993static int commit_ref_update(struct ref_lock *lock,2994 const unsigned char *sha1, const char *logmsg,2995 int flags, struct strbuf *err);29962997int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)2998{2999 unsigned char sha1[20], orig_sha1[20];3000 int flag = 0, logmoved = 0;3001 struct ref_lock *lock;3002 struct stat loginfo;3003 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);3004 const char *symref = NULL;3005 struct strbuf err = STRBUF_INIT;30063007 if (log && S_ISLNK(loginfo.st_mode))3008 return error("reflog for %s is a symlink", oldrefname);30093010 symref = resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,3011 orig_sha1, &flag);3012 if (flag & REF_ISSYMREF)3013 return error("refname %s is a symbolic ref, renaming it is not supported",3014 oldrefname);3015 if (!symref)3016 return error("refname %s not found", oldrefname);30173018 if (!rename_ref_available(oldrefname, newrefname))3019 return 1;30203021 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))3022 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",3023 oldrefname, strerror(errno));30243025 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {3026 error("unable to delete old %s", oldrefname);3027 goto rollback;3028 }30293030 if (!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&3031 delete_ref(newrefname, sha1, REF_NODEREF)) {3032 if (errno==EISDIR) {3033 if (remove_empty_directories(git_path("%s", newrefname))) {3034 error("Directory not empty: %s", newrefname);3035 goto rollback;3036 }3037 } else {3038 error("unable to delete existing %s", newrefname);3039 goto rollback;3040 }3041 }30423043 if (log && rename_tmp_log(newrefname))3044 goto rollback;30453046 logmoved = log;30473048 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, 0, NULL, &err);3049 if (!lock) {3050 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);3051 strbuf_release(&err);3052 goto rollback;3053 }3054 hashcpy(lock->old_oid.hash, orig_sha1);30553056 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||3057 commit_ref_update(lock, orig_sha1, logmsg, 0, &err)) {3058 error("unable to write current sha1 into %s: %s", newrefname, err.buf);3059 strbuf_release(&err);3060 goto rollback;3061 }30623063 return 0;30643065 rollback:3066 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, 0, NULL, &err);3067 if (!lock) {3068 error("unable to lock %s for rollback: %s", oldrefname, err.buf);3069 strbuf_release(&err);3070 goto rollbacklog;3071 }30723073 flag = log_all_ref_updates;3074 log_all_ref_updates = 0;3075 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||3076 commit_ref_update(lock, orig_sha1, NULL, 0, &err)) {3077 error("unable to write current sha1 into %s: %s", oldrefname, err.buf);3078 strbuf_release(&err);3079 }3080 log_all_ref_updates = flag;30813082 rollbacklog:3083 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))3084 error("unable to restore logfile %s from %s: %s",3085 oldrefname, newrefname, strerror(errno));3086 if (!logmoved && log &&3087 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))3088 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",3089 oldrefname, strerror(errno));30903091 return 1;3092}30933094static int close_ref(struct ref_lock *lock)3095{3096 if (close_lock_file(lock->lk))3097 return -1;3098 return 0;3099}31003101static int commit_ref(struct ref_lock *lock)3102{3103 if (commit_lock_file(lock->lk))3104 return -1;3105 return 0;3106}31073108/*3109 * copy the reflog message msg to buf, which has been allocated sufficiently3110 * large, while cleaning up the whitespaces. Especially, convert LF to space,3111 * because reflog file is one line per entry.3112 */3113static int copy_msg(char *buf, const char *msg)3114{3115 char *cp = buf;3116 char c;3117 int wasspace = 1;31183119 *cp++ = '\t';3120 while ((c = *msg++)) {3121 if (wasspace && isspace(c))3122 continue;3123 wasspace = isspace(c);3124 if (wasspace)3125 c = ' ';3126 *cp++ = c;3127 }3128 while (buf < cp && isspace(cp[-1]))3129 cp--;3130 *cp++ = '\n';3131 return cp - buf;3132}31333134static int should_autocreate_reflog(const char *refname)3135{3136 if (!log_all_ref_updates)3137 return 0;3138 return starts_with(refname, "refs/heads/") ||3139 starts_with(refname, "refs/remotes/") ||3140 starts_with(refname, "refs/notes/") ||3141 !strcmp(refname, "HEAD");3142}31433144/*3145 * Create a reflog for a ref. If force_create = 0, the reflog will3146 * only be created for certain refs (those for which3147 * should_autocreate_reflog returns non-zero. Otherwise, create it3148 * regardless of the ref name. Fill in *err and return -1 on failure.3149 */3150static int log_ref_setup(const char *refname, struct strbuf *sb_logfile, struct strbuf *err, int force_create)3151{3152 int logfd, oflags = O_APPEND | O_WRONLY;3153 char *logfile;31543155 strbuf_git_path(sb_logfile, "logs/%s", refname);3156 logfile = sb_logfile->buf;3157 /* make sure the rest of the function can't change "logfile" */3158 sb_logfile = NULL;3159 if (force_create || should_autocreate_reflog(refname)) {3160 if (safe_create_leading_directories(logfile) < 0) {3161 strbuf_addf(err, "unable to create directory for %s: "3162 "%s", logfile, strerror(errno));3163 return -1;3164 }3165 oflags |= O_CREAT;3166 }31673168 logfd = open(logfile, oflags, 0666);3169 if (logfd < 0) {3170 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))3171 return 0;31723173 if (errno == EISDIR) {3174 if (remove_empty_directories(logfile)) {3175 strbuf_addf(err, "There are still logs under "3176 "'%s'", logfile);3177 return -1;3178 }3179 logfd = open(logfile, oflags, 0666);3180 }31813182 if (logfd < 0) {3183 strbuf_addf(err, "unable to append to %s: %s",3184 logfile, strerror(errno));3185 return -1;3186 }3187 }31883189 adjust_shared_perm(logfile);3190 close(logfd);3191 return 0;3192}319331943195int safe_create_reflog(const char *refname, int force_create, struct strbuf *err)3196{3197 int ret;3198 struct strbuf sb = STRBUF_INIT;31993200 ret = log_ref_setup(refname, &sb, err, force_create);3201 strbuf_release(&sb);3202 return ret;3203}32043205static int log_ref_write_fd(int fd, const unsigned char *old_sha1,3206 const unsigned char *new_sha1,3207 const char *committer, const char *msg)3208{3209 int msglen, written;3210 unsigned maxlen, len;3211 char *logrec;32123213 msglen = msg ? strlen(msg) : 0;3214 maxlen = strlen(committer) + msglen + 100;3215 logrec = xmalloc(maxlen);3216 len = sprintf(logrec, "%s %s %s\n",3217 sha1_to_hex(old_sha1),3218 sha1_to_hex(new_sha1),3219 committer);3220 if (msglen)3221 len += copy_msg(logrec + len - 1, msg) - 1;32223223 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;3224 free(logrec);3225 if (written != len)3226 return -1;32273228 return 0;3229}32303231static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,3232 const unsigned char *new_sha1, const char *msg,3233 struct strbuf *sb_log_file, int flags,3234 struct strbuf *err)3235{3236 int logfd, result, oflags = O_APPEND | O_WRONLY;3237 char *log_file;32383239 if (log_all_ref_updates < 0)3240 log_all_ref_updates = !is_bare_repository();32413242 result = log_ref_setup(refname, sb_log_file, err, flags & REF_FORCE_CREATE_REFLOG);32433244 if (result)3245 return result;3246 log_file = sb_log_file->buf;3247 /* make sure the rest of the function can't change "log_file" */3248 sb_log_file = NULL;32493250 logfd = open(log_file, oflags);3251 if (logfd < 0)3252 return 0;3253 result = log_ref_write_fd(logfd, old_sha1, new_sha1,3254 git_committer_info(0), msg);3255 if (result) {3256 strbuf_addf(err, "unable to append to %s: %s", log_file,3257 strerror(errno));3258 close(logfd);3259 return -1;3260 }3261 if (close(logfd)) {3262 strbuf_addf(err, "unable to append to %s: %s", log_file,3263 strerror(errno));3264 return -1;3265 }3266 return 0;3267}32683269static int log_ref_write(const char *refname, const unsigned char *old_sha1,3270 const unsigned char *new_sha1, const char *msg,3271 int flags, struct strbuf *err)3272{3273 struct strbuf sb = STRBUF_INIT;3274 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,3275 err);3276 strbuf_release(&sb);3277 return ret;3278}32793280int is_branch(const char *refname)3281{3282 return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");3283}32843285/*3286 * Write sha1 into the open lockfile, then close the lockfile. On3287 * errors, rollback the lockfile, fill in *err and3288 * return -1.3289 */3290static int write_ref_to_lockfile(struct ref_lock *lock,3291 const unsigned char *sha1, struct strbuf *err)3292{3293 static char term = '\n';3294 struct object *o;32953296 o = parse_object(sha1);3297 if (!o) {3298 strbuf_addf(err,3299 "Trying to write ref %s with nonexistent object %s",3300 lock->ref_name, sha1_to_hex(sha1));3301 unlock_ref(lock);3302 return -1;3303 }3304 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {3305 strbuf_addf(err,3306 "Trying to write non-commit object %s to branch %s",3307 sha1_to_hex(sha1), lock->ref_name);3308 unlock_ref(lock);3309 return -1;3310 }3311 if (write_in_full(lock->lk->fd, sha1_to_hex(sha1), 40) != 40 ||3312 write_in_full(lock->lk->fd, &term, 1) != 1 ||3313 close_ref(lock) < 0) {3314 strbuf_addf(err,3315 "Couldn't write %s", lock->lk->filename.buf);3316 unlock_ref(lock);3317 return -1;3318 }3319 return 0;3320}33213322/*3323 * Commit a change to a loose reference that has already been written3324 * to the loose reference lockfile. Also update the reflogs if3325 * necessary, using the specified lockmsg (which can be NULL).3326 */3327static int commit_ref_update(struct ref_lock *lock,3328 const unsigned char *sha1, const char *logmsg,3329 int flags, struct strbuf *err)3330{3331 clear_loose_ref_cache(&ref_cache);3332 if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) < 0 ||3333 (strcmp(lock->ref_name, lock->orig_ref_name) &&3334 log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) < 0)) {3335 char *old_msg = strbuf_detach(err, NULL);3336 strbuf_addf(err, "Cannot update the ref '%s': %s",3337 lock->ref_name, old_msg);3338 free(old_msg);3339 unlock_ref(lock);3340 return -1;3341 }3342 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {3343 /*3344 * Special hack: If a branch is updated directly and HEAD3345 * points to it (may happen on the remote side of a push3346 * for example) then logically the HEAD reflog should be3347 * updated too.3348 * A generic solution implies reverse symref information,3349 * but finding all symrefs pointing to the given branch3350 * would be rather costly for this rare event (the direct3351 * update of a branch) to be worth it. So let's cheat and3352 * check with HEAD only which should cover 99% of all usage3353 * scenarios (even 100% of the default ones).3354 */3355 unsigned char head_sha1[20];3356 int head_flag;3357 const char *head_ref;3358 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3359 head_sha1, &head_flag);3360 if (head_ref && (head_flag & REF_ISSYMREF) &&3361 !strcmp(head_ref, lock->ref_name)) {3362 struct strbuf log_err = STRBUF_INIT;3363 if (log_ref_write("HEAD", lock->old_oid.hash, sha1,3364 logmsg, 0, &log_err)) {3365 error("%s", log_err.buf);3366 strbuf_release(&log_err);3367 }3368 }3369 }3370 if (commit_ref(lock)) {3371 error("Couldn't set %s", lock->ref_name);3372 unlock_ref(lock);3373 return -1;3374 }33753376 unlock_ref(lock);3377 return 0;3378}33793380int create_symref(const char *ref_target, const char *refs_heads_master,3381 const char *logmsg)3382{3383 const char *lockpath;3384 char ref[1000];3385 int fd, len, written;3386 char *git_HEAD = git_pathdup("%s", ref_target);3387 unsigned char old_sha1[20], new_sha1[20];3388 struct strbuf err = STRBUF_INIT;33893390 if (logmsg && read_ref(ref_target, old_sha1))3391 hashclr(old_sha1);33923393 if (safe_create_leading_directories(git_HEAD) < 0)3394 return error("unable to create directory for %s", git_HEAD);33953396#ifndef NO_SYMLINK_HEAD3397 if (prefer_symlink_refs) {3398 unlink(git_HEAD);3399 if (!symlink(refs_heads_master, git_HEAD))3400 goto done;3401 fprintf(stderr, "no symlink - falling back to symbolic ref\n");3402 }3403#endif34043405 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);3406 if (sizeof(ref) <= len) {3407 error("refname too long: %s", refs_heads_master);3408 goto error_free_return;3409 }3410 lockpath = mkpath("%s.lock", git_HEAD);3411 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);3412 if (fd < 0) {3413 error("Unable to open %s for writing", lockpath);3414 goto error_free_return;3415 }3416 written = write_in_full(fd, ref, len);3417 if (close(fd) != 0 || written != len) {3418 error("Unable to write to %s", lockpath);3419 goto error_unlink_return;3420 }3421 if (rename(lockpath, git_HEAD) < 0) {3422 error("Unable to create %s", git_HEAD);3423 goto error_unlink_return;3424 }3425 if (adjust_shared_perm(git_HEAD)) {3426 error("Unable to fix permissions on %s", lockpath);3427 error_unlink_return:3428 unlink_or_warn(lockpath);3429 error_free_return:3430 free(git_HEAD);3431 return -1;3432 }34333434#ifndef NO_SYMLINK_HEAD3435 done:3436#endif3437 if (logmsg && !read_ref(refs_heads_master, new_sha1) &&3438 log_ref_write(ref_target, old_sha1, new_sha1, logmsg, 0, &err)) {3439 error("%s", err.buf);3440 strbuf_release(&err);3441 }34423443 free(git_HEAD);3444 return 0;3445}34463447struct read_ref_at_cb {3448 const char *refname;3449 unsigned long at_time;3450 int cnt;3451 int reccnt;3452 unsigned char *sha1;3453 int found_it;34543455 unsigned char osha1[20];3456 unsigned char nsha1[20];3457 int tz;3458 unsigned long date;3459 char **msg;3460 unsigned long *cutoff_time;3461 int *cutoff_tz;3462 int *cutoff_cnt;3463};34643465static int read_ref_at_ent(unsigned char *osha1, unsigned char *nsha1,3466 const char *email, unsigned long timestamp, int tz,3467 const char *message, void *cb_data)3468{3469 struct read_ref_at_cb *cb = cb_data;34703471 cb->reccnt++;3472 cb->tz = tz;3473 cb->date = timestamp;34743475 if (timestamp <= cb->at_time || cb->cnt == 0) {3476 if (cb->msg)3477 *cb->msg = xstrdup(message);3478 if (cb->cutoff_time)3479 *cb->cutoff_time = timestamp;3480 if (cb->cutoff_tz)3481 *cb->cutoff_tz = tz;3482 if (cb->cutoff_cnt)3483 *cb->cutoff_cnt = cb->reccnt - 1;3484 /*3485 * we have not yet updated cb->[n|o]sha1 so they still3486 * hold the values for the previous record.3487 */3488 if (!is_null_sha1(cb->osha1)) {3489 hashcpy(cb->sha1, nsha1);3490 if (hashcmp(cb->osha1, nsha1))3491 warning("Log for ref %s has gap after %s.",3492 cb->refname, show_date(cb->date, cb->tz, DATE_MODE(RFC2822)));3493 }3494 else if (cb->date == cb->at_time)3495 hashcpy(cb->sha1, nsha1);3496 else if (hashcmp(nsha1, cb->sha1))3497 warning("Log for ref %s unexpectedly ended on %s.",3498 cb->refname, show_date(cb->date, cb->tz,3499 DATE_MODE(RFC2822)));3500 hashcpy(cb->osha1, osha1);3501 hashcpy(cb->nsha1, nsha1);3502 cb->found_it = 1;3503 return 1;3504 }3505 hashcpy(cb->osha1, osha1);3506 hashcpy(cb->nsha1, nsha1);3507 if (cb->cnt > 0)3508 cb->cnt--;3509 return 0;3510}35113512static int read_ref_at_ent_oldest(unsigned char *osha1, unsigned char *nsha1,3513 const char *email, unsigned long timestamp,3514 int tz, const char *message, void *cb_data)3515{3516 struct read_ref_at_cb *cb = cb_data;35173518 if (cb->msg)3519 *cb->msg = xstrdup(message);3520 if (cb->cutoff_time)3521 *cb->cutoff_time = timestamp;3522 if (cb->cutoff_tz)3523 *cb->cutoff_tz = tz;3524 if (cb->cutoff_cnt)3525 *cb->cutoff_cnt = cb->reccnt;3526 hashcpy(cb->sha1, osha1);3527 if (is_null_sha1(cb->sha1))3528 hashcpy(cb->sha1, nsha1);3529 /* We just want the first entry */3530 return 1;3531}35323533int read_ref_at(const char *refname, unsigned int flags, unsigned long at_time, int cnt,3534 unsigned char *sha1, char **msg,3535 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)3536{3537 struct read_ref_at_cb cb;35383539 memset(&cb, 0, sizeof(cb));3540 cb.refname = refname;3541 cb.at_time = at_time;3542 cb.cnt = cnt;3543 cb.msg = msg;3544 cb.cutoff_time = cutoff_time;3545 cb.cutoff_tz = cutoff_tz;3546 cb.cutoff_cnt = cutoff_cnt;3547 cb.sha1 = sha1;35483549 for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);35503551 if (!cb.reccnt) {3552 if (flags & GET_SHA1_QUIETLY)3553 exit(128);3554 else3555 die("Log for %s is empty.", refname);3556 }3557 if (cb.found_it)3558 return 0;35593560 for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);35613562 return 1;3563}35643565int reflog_exists(const char *refname)3566{3567 struct stat st;35683569 return !lstat(git_path("logs/%s", refname), &st) &&3570 S_ISREG(st.st_mode);3571}35723573int delete_reflog(const char *refname)3574{3575 return remove_path(git_path("logs/%s", refname));3576}35773578static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)3579{3580 unsigned char osha1[20], nsha1[20];3581 char *email_end, *message;3582 unsigned long timestamp;3583 int tz;35843585 /* old SP new SP name <email> SP time TAB msg LF */3586 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||3587 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||3588 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||3589 !(email_end = strchr(sb->buf + 82, '>')) ||3590 email_end[1] != ' ' ||3591 !(timestamp = strtoul(email_end + 2, &message, 10)) ||3592 !message || message[0] != ' ' ||3593 (message[1] != '+' && message[1] != '-') ||3594 !isdigit(message[2]) || !isdigit(message[3]) ||3595 !isdigit(message[4]) || !isdigit(message[5]))3596 return 0; /* corrupt? */3597 email_end[1] = '\0';3598 tz = strtol(message + 1, NULL, 10);3599 if (message[6] != '\t')3600 message += 6;3601 else3602 message += 7;3603 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);3604}36053606static char *find_beginning_of_line(char *bob, char *scan)3607{3608 while (bob < scan && *(--scan) != '\n')3609 ; /* keep scanning backwards */3610 /*3611 * Return either beginning of the buffer, or LF at the end of3612 * the previous line.3613 */3614 return scan;3615}36163617int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)3618{3619 struct strbuf sb = STRBUF_INIT;3620 FILE *logfp;3621 long pos;3622 int ret = 0, at_tail = 1;36233624 logfp = fopen(git_path("logs/%s", refname), "r");3625 if (!logfp)3626 return -1;36273628 /* Jump to the end */3629 if (fseek(logfp, 0, SEEK_END) < 0)3630 return error("cannot seek back reflog for %s: %s",3631 refname, strerror(errno));3632 pos = ftell(logfp);3633 while (!ret && 0 < pos) {3634 int cnt;3635 size_t nread;3636 char buf[BUFSIZ];3637 char *endp, *scanp;36383639 /* Fill next block from the end */3640 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;3641 if (fseek(logfp, pos - cnt, SEEK_SET))3642 return error("cannot seek back reflog for %s: %s",3643 refname, strerror(errno));3644 nread = fread(buf, cnt, 1, logfp);3645 if (nread != 1)3646 return error("cannot read %d bytes from reflog for %s: %s",3647 cnt, refname, strerror(errno));3648 pos -= cnt;36493650 scanp = endp = buf + cnt;3651 if (at_tail && scanp[-1] == '\n')3652 /* Looking at the final LF at the end of the file */3653 scanp--;3654 at_tail = 0;36553656 while (buf < scanp) {3657 /*3658 * terminating LF of the previous line, or the beginning3659 * of the buffer.3660 */3661 char *bp;36623663 bp = find_beginning_of_line(buf, scanp);36643665 if (*bp == '\n') {3666 /*3667 * The newline is the end of the previous line,3668 * so we know we have complete line starting3669 * at (bp + 1). Prefix it onto any prior data3670 * we collected for the line and process it.3671 */3672 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));3673 scanp = bp;3674 endp = bp + 1;3675 ret = show_one_reflog_ent(&sb, fn, cb_data);3676 strbuf_reset(&sb);3677 if (ret)3678 break;3679 } else if (!pos) {3680 /*3681 * We are at the start of the buffer, and the3682 * start of the file; there is no previous3683 * line, and we have everything for this one.3684 * Process it, and we can end the loop.3685 */3686 strbuf_splice(&sb, 0, 0, buf, endp - buf);3687 ret = show_one_reflog_ent(&sb, fn, cb_data);3688 strbuf_reset(&sb);3689 break;3690 }36913692 if (bp == buf) {3693 /*3694 * We are at the start of the buffer, and there3695 * is more file to read backwards. Which means3696 * we are in the middle of a line. Note that we3697 * may get here even if *bp was a newline; that3698 * just means we are at the exact end of the3699 * previous line, rather than some spot in the3700 * middle.3701 *3702 * Save away what we have to be combined with3703 * the data from the next read.3704 */3705 strbuf_splice(&sb, 0, 0, buf, endp - buf);3706 break;3707 }3708 }37093710 }3711 if (!ret && sb.len)3712 die("BUG: reverse reflog parser had leftover data");37133714 fclose(logfp);3715 strbuf_release(&sb);3716 return ret;3717}37183719int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)3720{3721 FILE *logfp;3722 struct strbuf sb = STRBUF_INIT;3723 int ret = 0;37243725 logfp = fopen(git_path("logs/%s", refname), "r");3726 if (!logfp)3727 return -1;37283729 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))3730 ret = show_one_reflog_ent(&sb, fn, cb_data);3731 fclose(logfp);3732 strbuf_release(&sb);3733 return ret;3734}3735/*3736 * Call fn for each reflog in the namespace indicated by name. name3737 * must be empty or end with '/'. Name will be used as a scratch3738 * space, but its contents will be restored before return.3739 */3740static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)3741{3742 DIR *d = opendir(git_path("logs/%s", name->buf));3743 int retval = 0;3744 struct dirent *de;3745 int oldlen = name->len;37463747 if (!d)3748 return name->len ? errno : 0;37493750 while ((de = readdir(d)) != NULL) {3751 struct stat st;37523753 if (de->d_name[0] == '.')3754 continue;3755 if (ends_with(de->d_name, ".lock"))3756 continue;3757 strbuf_addstr(name, de->d_name);3758 if (stat(git_path("logs/%s", name->buf), &st) < 0) {3759 ; /* silently ignore */3760 } else {3761 if (S_ISDIR(st.st_mode)) {3762 strbuf_addch(name, '/');3763 retval = do_for_each_reflog(name, fn, cb_data);3764 } else {3765 struct object_id oid;37663767 if (read_ref_full(name->buf, 0, oid.hash, NULL))3768 retval = error("bad ref for %s", name->buf);3769 else3770 retval = fn(name->buf, &oid, 0, cb_data);3771 }3772 if (retval)3773 break;3774 }3775 strbuf_setlen(name, oldlen);3776 }3777 closedir(d);3778 return retval;3779}37803781int for_each_reflog(each_ref_fn fn, void *cb_data)3782{3783 int retval;3784 struct strbuf name;3785 strbuf_init(&name, PATH_MAX);3786 retval = do_for_each_reflog(&name, fn, cb_data);3787 strbuf_release(&name);3788 return retval;3789}37903791/**3792 * Information needed for a single ref update. Set new_sha1 to the new3793 * value or to null_sha1 to delete the ref. To check the old value3794 * while the ref is locked, set (flags & REF_HAVE_OLD) and set3795 * old_sha1 to the old value, or to null_sha1 to ensure the ref does3796 * not exist before update.3797 */3798struct ref_update {3799 /*3800 * If (flags & REF_HAVE_NEW), set the reference to this value:3801 */3802 unsigned char new_sha1[20];3803 /*3804 * If (flags & REF_HAVE_OLD), check that the reference3805 * previously had this value:3806 */3807 unsigned char old_sha1[20];3808 /*3809 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,3810 * REF_DELETING, and REF_ISPRUNING:3811 */3812 unsigned int flags;3813 struct ref_lock *lock;3814 int type;3815 char *msg;3816 const char refname[FLEX_ARRAY];3817};38183819/*3820 * Transaction states.3821 * OPEN: The transaction is in a valid state and can accept new updates.3822 * An OPEN transaction can be committed.3823 * CLOSED: A closed transaction is no longer active and no other operations3824 * than free can be used on it in this state.3825 * A transaction can either become closed by successfully committing3826 * an active transaction or if there is a failure while building3827 * the transaction thus rendering it failed/inactive.3828 */3829enum ref_transaction_state {3830 REF_TRANSACTION_OPEN = 0,3831 REF_TRANSACTION_CLOSED = 13832};38333834/*3835 * Data structure for holding a reference transaction, which can3836 * consist of checks and updates to multiple references, carried out3837 * as atomically as possible. This structure is opaque to callers.3838 */3839struct ref_transaction {3840 struct ref_update **updates;3841 size_t alloc;3842 size_t nr;3843 enum ref_transaction_state state;3844};38453846struct ref_transaction *ref_transaction_begin(struct strbuf *err)3847{3848 assert(err);38493850 return xcalloc(1, sizeof(struct ref_transaction));3851}38523853void ref_transaction_free(struct ref_transaction *transaction)3854{3855 int i;38563857 if (!transaction)3858 return;38593860 for (i = 0; i < transaction->nr; i++) {3861 free(transaction->updates[i]->msg);3862 free(transaction->updates[i]);3863 }3864 free(transaction->updates);3865 free(transaction);3866}38673868static struct ref_update *add_update(struct ref_transaction *transaction,3869 const char *refname)3870{3871 size_t len = strlen(refname);3872 struct ref_update *update = xcalloc(1, sizeof(*update) + len + 1);38733874 strcpy((char *)update->refname, refname);3875 ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);3876 transaction->updates[transaction->nr++] = update;3877 return update;3878}38793880int ref_transaction_update(struct ref_transaction *transaction,3881 const char *refname,3882 const unsigned char *new_sha1,3883 const unsigned char *old_sha1,3884 unsigned int flags, const char *msg,3885 struct strbuf *err)3886{3887 struct ref_update *update;38883889 assert(err);38903891 if (transaction->state != REF_TRANSACTION_OPEN)3892 die("BUG: update called for transaction that is not open");38933894 if (new_sha1 && !is_null_sha1(new_sha1) &&3895 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {3896 strbuf_addf(err, "refusing to update ref with bad name %s",3897 refname);3898 return -1;3899 }39003901 update = add_update(transaction, refname);3902 if (new_sha1) {3903 hashcpy(update->new_sha1, new_sha1);3904 flags |= REF_HAVE_NEW;3905 }3906 if (old_sha1) {3907 hashcpy(update->old_sha1, old_sha1);3908 flags |= REF_HAVE_OLD;3909 }3910 update->flags = flags;3911 if (msg)3912 update->msg = xstrdup(msg);3913 return 0;3914}39153916int ref_transaction_create(struct ref_transaction *transaction,3917 const char *refname,3918 const unsigned char *new_sha1,3919 unsigned int flags, const char *msg,3920 struct strbuf *err)3921{3922 if (!new_sha1 || is_null_sha1(new_sha1))3923 die("BUG: create called without valid new_sha1");3924 return ref_transaction_update(transaction, refname, new_sha1,3925 null_sha1, flags, msg, err);3926}39273928int ref_transaction_delete(struct ref_transaction *transaction,3929 const char *refname,3930 const unsigned char *old_sha1,3931 unsigned int flags, const char *msg,3932 struct strbuf *err)3933{3934 if (old_sha1 && is_null_sha1(old_sha1))3935 die("BUG: delete called with old_sha1 set to zeros");3936 return ref_transaction_update(transaction, refname,3937 null_sha1, old_sha1,3938 flags, msg, err);3939}39403941int ref_transaction_verify(struct ref_transaction *transaction,3942 const char *refname,3943 const unsigned char *old_sha1,3944 unsigned int flags,3945 struct strbuf *err)3946{3947 if (!old_sha1)3948 die("BUG: verify called with old_sha1 set to NULL");3949 return ref_transaction_update(transaction, refname,3950 NULL, old_sha1,3951 flags, NULL, err);3952}39533954int update_ref(const char *msg, const char *refname,3955 const unsigned char *new_sha1, const unsigned char *old_sha1,3956 unsigned int flags, enum action_on_err onerr)3957{3958 struct ref_transaction *t;3959 struct strbuf err = STRBUF_INIT;39603961 t = ref_transaction_begin(&err);3962 if (!t ||3963 ref_transaction_update(t, refname, new_sha1, old_sha1,3964 flags, msg, &err) ||3965 ref_transaction_commit(t, &err)) {3966 const char *str = "update_ref failed for ref '%s': %s";39673968 ref_transaction_free(t);3969 switch (onerr) {3970 case UPDATE_REFS_MSG_ON_ERR:3971 error(str, refname, err.buf);3972 break;3973 case UPDATE_REFS_DIE_ON_ERR:3974 die(str, refname, err.buf);3975 break;3976 case UPDATE_REFS_QUIET_ON_ERR:3977 break;3978 }3979 strbuf_release(&err);3980 return 1;3981 }3982 strbuf_release(&err);3983 ref_transaction_free(t);3984 return 0;3985}39863987static int ref_update_reject_duplicates(struct string_list *refnames,3988 struct strbuf *err)3989{3990 int i, n = refnames->nr;39913992 assert(err);39933994 for (i = 1; i < n; i++)3995 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {3996 strbuf_addf(err,3997 "Multiple updates for ref '%s' not allowed.",3998 refnames->items[i].string);3999 return 1;4000 }4001 return 0;4002}40034004int ref_transaction_commit(struct ref_transaction *transaction,4005 struct strbuf *err)4006{4007 int ret = 0, i;4008 int n = transaction->nr;4009 struct ref_update **updates = transaction->updates;4010 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;4011 struct string_list_item *ref_to_delete;4012 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;40134014 assert(err);40154016 if (transaction->state != REF_TRANSACTION_OPEN)4017 die("BUG: commit called for transaction that is not open");40184019 if (!n) {4020 transaction->state = REF_TRANSACTION_CLOSED;4021 return 0;4022 }40234024 /* Fail if a refname appears more than once in the transaction: */4025 for (i = 0; i < n; i++)4026 string_list_append(&affected_refnames, updates[i]->refname);4027 string_list_sort(&affected_refnames);4028 if (ref_update_reject_duplicates(&affected_refnames, err)) {4029 ret = TRANSACTION_GENERIC_ERROR;4030 goto cleanup;4031 }40324033 /*4034 * Acquire all locks, verify old values if provided, check4035 * that new values are valid, and write new values to the4036 * lockfiles, ready to be activated. Only keep one lockfile4037 * open at a time to avoid running out of file descriptors.4038 */4039 for (i = 0; i < n; i++) {4040 struct ref_update *update = updates[i];40414042 if ((update->flags & REF_HAVE_NEW) &&4043 is_null_sha1(update->new_sha1))4044 update->flags |= REF_DELETING;4045 update->lock = lock_ref_sha1_basic(4046 update->refname,4047 ((update->flags & REF_HAVE_OLD) ?4048 update->old_sha1 : NULL),4049 &affected_refnames, NULL,4050 update->flags,4051 &update->type,4052 err);4053 if (!update->lock) {4054 char *reason;40554056 ret = (errno == ENOTDIR)4057 ? TRANSACTION_NAME_CONFLICT4058 : TRANSACTION_GENERIC_ERROR;4059 reason = strbuf_detach(err, NULL);4060 strbuf_addf(err, "cannot lock ref '%s': %s",4061 update->refname, reason);4062 free(reason);4063 goto cleanup;4064 }4065 if ((update->flags & REF_HAVE_NEW) &&4066 !(update->flags & REF_DELETING)) {4067 int overwriting_symref = ((update->type & REF_ISSYMREF) &&4068 (update->flags & REF_NODEREF));40694070 if (!overwriting_symref &&4071 !hashcmp(update->lock->old_oid.hash, update->new_sha1)) {4072 /*4073 * The reference already has the desired4074 * value, so we don't need to write it.4075 */4076 } else if (write_ref_to_lockfile(update->lock,4077 update->new_sha1,4078 err)) {4079 char *write_err = strbuf_detach(err, NULL);40804081 /*4082 * The lock was freed upon failure of4083 * write_ref_to_lockfile():4084 */4085 update->lock = NULL;4086 strbuf_addf(err,4087 "cannot update the ref '%s': %s",4088 update->refname, write_err);4089 free(write_err);4090 ret = TRANSACTION_GENERIC_ERROR;4091 goto cleanup;4092 } else {4093 update->flags |= REF_NEEDS_COMMIT;4094 }4095 }4096 if (!(update->flags & REF_NEEDS_COMMIT)) {4097 /*4098 * We didn't have to write anything to the lockfile.4099 * Close it to free up the file descriptor:4100 */4101 if (close_ref(update->lock)) {4102 strbuf_addf(err, "Couldn't close %s.lock",4103 update->refname);4104 goto cleanup;4105 }4106 }4107 }41084109 /* Perform updates first so live commits remain referenced */4110 for (i = 0; i < n; i++) {4111 struct ref_update *update = updates[i];41124113 if (update->flags & REF_NEEDS_COMMIT) {4114 if (commit_ref_update(update->lock,4115 update->new_sha1, update->msg,4116 update->flags, err)) {4117 /* freed by commit_ref_update(): */4118 update->lock = NULL;4119 ret = TRANSACTION_GENERIC_ERROR;4120 goto cleanup;4121 } else {4122 /* freed by commit_ref_update(): */4123 update->lock = NULL;4124 }4125 }4126 }41274128 /* Perform deletes now that updates are safely completed */4129 for (i = 0; i < n; i++) {4130 struct ref_update *update = updates[i];41314132 if (update->flags & REF_DELETING) {4133 if (delete_ref_loose(update->lock, update->type, err)) {4134 ret = TRANSACTION_GENERIC_ERROR;4135 goto cleanup;4136 }41374138 if (!(update->flags & REF_ISPRUNING))4139 string_list_append(&refs_to_delete,4140 update->lock->ref_name);4141 }4142 }41434144 if (repack_without_refs(&refs_to_delete, err)) {4145 ret = TRANSACTION_GENERIC_ERROR;4146 goto cleanup;4147 }4148 for_each_string_list_item(ref_to_delete, &refs_to_delete)4149 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));4150 clear_loose_ref_cache(&ref_cache);41514152cleanup:4153 transaction->state = REF_TRANSACTION_CLOSED;41544155 for (i = 0; i < n; i++)4156 if (updates[i]->lock)4157 unlock_ref(updates[i]->lock);4158 string_list_clear(&refs_to_delete, 0);4159 string_list_clear(&affected_refnames, 0);4160 return ret;4161}41624163static int ref_present(const char *refname,4164 const struct object_id *oid, int flags, void *cb_data)4165{4166 struct string_list *affected_refnames = cb_data;41674168 return string_list_has_string(affected_refnames, refname);4169}41704171int initial_ref_transaction_commit(struct ref_transaction *transaction,4172 struct strbuf *err)4173{4174 struct ref_dir *loose_refs = get_loose_refs(&ref_cache);4175 struct ref_dir *packed_refs = get_packed_refs(&ref_cache);4176 int ret = 0, i;4177 int n = transaction->nr;4178 struct ref_update **updates = transaction->updates;4179 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;41804181 assert(err);41824183 if (transaction->state != REF_TRANSACTION_OPEN)4184 die("BUG: commit called for transaction that is not open");41854186 /* Fail if a refname appears more than once in the transaction: */4187 for (i = 0; i < n; i++)4188 string_list_append(&affected_refnames, updates[i]->refname);4189 string_list_sort(&affected_refnames);4190 if (ref_update_reject_duplicates(&affected_refnames, err)) {4191 ret = TRANSACTION_GENERIC_ERROR;4192 goto cleanup;4193 }41944195 /*4196 * It's really undefined to call this function in an active4197 * repository or when there are existing references: we are4198 * only locking and changing packed-refs, so (1) any4199 * simultaneous processes might try to change a reference at4200 * the same time we do, and (2) any existing loose versions of4201 * the references that we are setting would have precedence4202 * over our values. But some remote helpers create the remote4203 * "HEAD" and "master" branches before calling this function,4204 * so here we really only check that none of the references4205 * that we are creating already exists.4206 */4207 if (for_each_rawref(ref_present, &affected_refnames))4208 die("BUG: initial ref transaction called with existing refs");42094210 for (i = 0; i < n; i++) {4211 struct ref_update *update = updates[i];42124213 if ((update->flags & REF_HAVE_OLD) &&4214 !is_null_sha1(update->old_sha1))4215 die("BUG: initial ref transaction with old_sha1 set");4216 if (verify_refname_available(update->refname,4217 &affected_refnames, NULL,4218 loose_refs, err) ||4219 verify_refname_available(update->refname,4220 &affected_refnames, NULL,4221 packed_refs, err)) {4222 ret = TRANSACTION_NAME_CONFLICT;4223 goto cleanup;4224 }4225 }42264227 if (lock_packed_refs(0)) {4228 strbuf_addf(err, "unable to lock packed-refs file: %s",4229 strerror(errno));4230 ret = TRANSACTION_GENERIC_ERROR;4231 goto cleanup;4232 }42334234 for (i = 0; i < n; i++) {4235 struct ref_update *update = updates[i];42364237 if ((update->flags & REF_HAVE_NEW) &&4238 !is_null_sha1(update->new_sha1))4239 add_packed_ref(update->refname, update->new_sha1);4240 }42414242 if (commit_packed_refs()) {4243 strbuf_addf(err, "unable to commit packed-refs file: %s",4244 strerror(errno));4245 ret = TRANSACTION_GENERIC_ERROR;4246 goto cleanup;4247 }42484249cleanup:4250 transaction->state = REF_TRANSACTION_CLOSED;4251 string_list_clear(&affected_refnames, 0);4252 return ret;4253}42544255char *shorten_unambiguous_ref(const char *refname, int strict)4256{4257 int i;4258 static char **scanf_fmts;4259 static int nr_rules;4260 char *short_name;42614262 if (!nr_rules) {4263 /*4264 * Pre-generate scanf formats from ref_rev_parse_rules[].4265 * Generate a format suitable for scanf from a4266 * ref_rev_parse_rules rule by interpolating "%s" at the4267 * location of the "%.*s".4268 */4269 size_t total_len = 0;4270 size_t offset = 0;42714272 /* the rule list is NULL terminated, count them first */4273 for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)4274 /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */4275 total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;42764277 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);42784279 offset = 0;4280 for (i = 0; i < nr_rules; i++) {4281 assert(offset < total_len);4282 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;4283 offset += snprintf(scanf_fmts[i], total_len - offset,4284 ref_rev_parse_rules[i], 2, "%s") + 1;4285 }4286 }42874288 /* bail out if there are no rules */4289 if (!nr_rules)4290 return xstrdup(refname);42914292 /* buffer for scanf result, at most refname must fit */4293 short_name = xstrdup(refname);42944295 /* skip first rule, it will always match */4296 for (i = nr_rules - 1; i > 0 ; --i) {4297 int j;4298 int rules_to_fail = i;4299 int short_name_len;43004301 if (1 != sscanf(refname, scanf_fmts[i], short_name))4302 continue;43034304 short_name_len = strlen(short_name);43054306 /*4307 * in strict mode, all (except the matched one) rules4308 * must fail to resolve to a valid non-ambiguous ref4309 */4310 if (strict)4311 rules_to_fail = nr_rules;43124313 /*4314 * check if the short name resolves to a valid ref,4315 * but use only rules prior to the matched one4316 */4317 for (j = 0; j < rules_to_fail; j++) {4318 const char *rule = ref_rev_parse_rules[j];4319 char refname[PATH_MAX];43204321 /* skip matched rule */4322 if (i == j)4323 continue;43244325 /*4326 * the short name is ambiguous, if it resolves4327 * (with this previous rule) to a valid ref4328 * read_ref() returns 0 on success4329 */4330 mksnpath(refname, sizeof(refname),4331 rule, short_name_len, short_name);4332 if (ref_exists(refname))4333 break;4334 }43354336 /*4337 * short name is non-ambiguous if all previous rules4338 * haven't resolved to a valid ref4339 */4340 if (j == rules_to_fail)4341 return short_name;4342 }43434344 free(short_name);4345 return xstrdup(refname);4346}43474348static struct string_list *hide_refs;43494350int parse_hide_refs_config(const char *var, const char *value, const char *section)4351{4352 if (!strcmp("transfer.hiderefs", var) ||4353 /* NEEDSWORK: use parse_config_key() once both are merged */4354 (starts_with(var, section) && var[strlen(section)] == '.' &&4355 !strcmp(var + strlen(section), ".hiderefs"))) {4356 char *ref;4357 int len;43584359 if (!value)4360 return config_error_nonbool(var);4361 ref = xstrdup(value);4362 len = strlen(ref);4363 while (len && ref[len - 1] == '/')4364 ref[--len] = '\0';4365 if (!hide_refs) {4366 hide_refs = xcalloc(1, sizeof(*hide_refs));4367 hide_refs->strdup_strings = 1;4368 }4369 string_list_append(hide_refs, ref);4370 }4371 return 0;4372}43734374int ref_is_hidden(const char *refname)4375{4376 struct string_list_item *item;43774378 if (!hide_refs)4379 return 0;4380 for_each_string_list_item(item, hide_refs) {4381 int len;4382 if (!starts_with(refname, item->string))4383 continue;4384 len = strlen(item->string);4385 if (!refname[len] || refname[len] == '/')4386 return 1;4387 }4388 return 0;4389}43904391struct expire_reflog_cb {4392 unsigned int flags;4393 reflog_expiry_should_prune_fn *should_prune_fn;4394 void *policy_cb;4395 FILE *newlog;4396 unsigned char last_kept_sha1[20];4397};43984399static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,4400 const char *email, unsigned long timestamp, int tz,4401 const char *message, void *cb_data)4402{4403 struct expire_reflog_cb *cb = cb_data;4404 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;44054406 if (cb->flags & EXPIRE_REFLOGS_REWRITE)4407 osha1 = cb->last_kept_sha1;44084409 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,4410 message, policy_cb)) {4411 if (!cb->newlog)4412 printf("would prune %s", message);4413 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)4414 printf("prune %s", message);4415 } else {4416 if (cb->newlog) {4417 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",4418 sha1_to_hex(osha1), sha1_to_hex(nsha1),4419 email, timestamp, tz, message);4420 hashcpy(cb->last_kept_sha1, nsha1);4421 }4422 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)4423 printf("keep %s", message);4424 }4425 return 0;4426}44274428int reflog_expire(const char *refname, const unsigned char *sha1,4429 unsigned int flags,4430 reflog_expiry_prepare_fn prepare_fn,4431 reflog_expiry_should_prune_fn should_prune_fn,4432 reflog_expiry_cleanup_fn cleanup_fn,4433 void *policy_cb_data)4434{4435 static struct lock_file reflog_lock;4436 struct expire_reflog_cb cb;4437 struct ref_lock *lock;4438 char *log_file;4439 int status = 0;4440 int type;4441 struct strbuf err = STRBUF_INIT;44424443 memset(&cb, 0, sizeof(cb));4444 cb.flags = flags;4445 cb.policy_cb = policy_cb_data;4446 cb.should_prune_fn = should_prune_fn;44474448 /*4449 * The reflog file is locked by holding the lock on the4450 * reference itself, plus we might need to update the4451 * reference if --updateref was specified:4452 */4453 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, 0, &type, &err);4454 if (!lock) {4455 error("cannot lock ref '%s': %s", refname, err.buf);4456 strbuf_release(&err);4457 return -1;4458 }4459 if (!reflog_exists(refname)) {4460 unlock_ref(lock);4461 return 0;4462 }44634464 log_file = git_pathdup("logs/%s", refname);4465 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4466 /*4467 * Even though holding $GIT_DIR/logs/$reflog.lock has4468 * no locking implications, we use the lock_file4469 * machinery here anyway because it does a lot of the4470 * work we need, including cleaning up if the program4471 * exits unexpectedly.4472 */4473 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {4474 struct strbuf err = STRBUF_INIT;4475 unable_to_lock_message(log_file, errno, &err);4476 error("%s", err.buf);4477 strbuf_release(&err);4478 goto failure;4479 }4480 cb.newlog = fdopen_lock_file(&reflog_lock, "w");4481 if (!cb.newlog) {4482 error("cannot fdopen %s (%s)",4483 reflog_lock.filename.buf, strerror(errno));4484 goto failure;4485 }4486 }44874488 (*prepare_fn)(refname, sha1, cb.policy_cb);4489 for_each_reflog_ent(refname, expire_reflog_ent, &cb);4490 (*cleanup_fn)(cb.policy_cb);44914492 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4493 /*4494 * It doesn't make sense to adjust a reference pointed4495 * to by a symbolic ref based on expiring entries in4496 * the symbolic reference's reflog. Nor can we update4497 * a reference if there are no remaining reflog4498 * entries.4499 */4500 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4501 !(type & REF_ISSYMREF) &&4502 !is_null_sha1(cb.last_kept_sha1);45034504 if (close_lock_file(&reflog_lock)) {4505 status |= error("couldn't write %s: %s", log_file,4506 strerror(errno));4507 } else if (update &&4508 (write_in_full(lock->lk->fd,4509 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||4510 write_str_in_full(lock->lk->fd, "\n") != 1 ||4511 close_ref(lock) < 0)) {4512 status |= error("couldn't write %s",4513 lock->lk->filename.buf);4514 rollback_lock_file(&reflog_lock);4515 } else if (commit_lock_file(&reflog_lock)) {4516 status |= error("unable to commit reflog '%s' (%s)",4517 log_file, strerror(errno));4518 } else if (update && commit_ref(lock)) {4519 status |= error("couldn't set %s", lock->ref_name);4520 }4521 }4522 free(log_file);4523 unlock_ref(lock);4524 return status;45254526 failure:4527 rollback_lock_file(&reflog_lock);4528 free(log_file);4529 unlock_ref(lock);4530 return -1;4531}