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 struct dirent *de;1356 int dirnamelen = strlen(dirname);1357 struct strbuf refname;1358 struct strbuf path = STRBUF_INIT;1359 size_t path_baselen;13601361 if (*refs->name)1362 strbuf_git_path_submodule(&path, refs->name, "%s", dirname);1363 else1364 strbuf_git_path(&path, "%s", dirname);1365 path_baselen = path.len;13661367 d = opendir(path.buf);1368 if (!d) {1369 strbuf_release(&path);1370 return;1371 }13721373 strbuf_init(&refname, dirnamelen + 257);1374 strbuf_add(&refname, dirname, dirnamelen);13751376 while ((de = readdir(d)) != NULL) {1377 unsigned char sha1[20];1378 struct stat st;1379 int flag;13801381 if (de->d_name[0] == '.')1382 continue;1383 if (ends_with(de->d_name, ".lock"))1384 continue;1385 strbuf_addstr(&refname, de->d_name);1386 strbuf_addstr(&path, de->d_name);1387 if (stat(path.buf, &st) < 0) {1388 ; /* silently ignore */1389 } else if (S_ISDIR(st.st_mode)) {1390 strbuf_addch(&refname, '/');1391 add_entry_to_dir(dir,1392 create_dir_entry(refs, refname.buf,1393 refname.len, 1));1394 } else {1395 int read_ok;13961397 if (*refs->name) {1398 hashclr(sha1);1399 flag = 0;1400 read_ok = !resolve_gitlink_ref(refs->name,1401 refname.buf, sha1);1402 } else {1403 read_ok = !read_ref_full(refname.buf,1404 RESOLVE_REF_READING,1405 sha1, &flag);1406 }14071408 if (!read_ok) {1409 hashclr(sha1);1410 flag |= REF_ISBROKEN;1411 } else if (is_null_sha1(sha1)) {1412 /*1413 * It is so astronomically unlikely1414 * that NULL_SHA1 is the SHA-1 of an1415 * actual object that we consider its1416 * appearance in a loose reference1417 * file to be repo corruption1418 * (probably due to a software bug).1419 */1420 flag |= REF_ISBROKEN;1421 }14221423 if (check_refname_format(refname.buf,1424 REFNAME_ALLOW_ONELEVEL)) {1425 if (!refname_is_safe(refname.buf))1426 die("loose refname is dangerous: %s", refname.buf);1427 hashclr(sha1);1428 flag |= REF_BAD_NAME | REF_ISBROKEN;1429 }1430 add_entry_to_dir(dir,1431 create_ref_entry(refname.buf, sha1, flag, 0));1432 }1433 strbuf_setlen(&refname, dirnamelen);1434 strbuf_setlen(&path, path_baselen);1435 }1436 strbuf_release(&refname);1437 strbuf_release(&path);1438 closedir(d);1439}14401441static struct ref_dir *get_loose_refs(struct ref_cache *refs)1442{1443 if (!refs->loose) {1444 /*1445 * Mark the top-level directory complete because we1446 * are about to read the only subdirectory that can1447 * hold references:1448 */1449 refs->loose = create_dir_entry(refs, "", 0, 0);1450 /*1451 * Create an incomplete entry for "refs/":1452 */1453 add_entry_to_dir(get_ref_dir(refs->loose),1454 create_dir_entry(refs, "refs/", 5, 1));1455 }1456 return get_ref_dir(refs->loose);1457}14581459/* We allow "recursive" symbolic refs. Only within reason, though */1460#define MAXDEPTH 51461#define MAXREFLEN (1024)14621463/*1464 * Called by resolve_gitlink_ref_recursive() after it failed to read1465 * from the loose refs in ref_cache refs. Find <refname> in the1466 * packed-refs file for the submodule.1467 */1468static int resolve_gitlink_packed_ref(struct ref_cache *refs,1469 const char *refname, unsigned char *sha1)1470{1471 struct ref_entry *ref;1472 struct ref_dir *dir = get_packed_refs(refs);14731474 ref = find_ref(dir, refname);1475 if (ref == NULL)1476 return -1;14771478 hashcpy(sha1, ref->u.value.oid.hash);1479 return 0;1480}14811482static int resolve_gitlink_ref_recursive(struct ref_cache *refs,1483 const char *refname, unsigned char *sha1,1484 int recursion)1485{1486 int fd, len;1487 char buffer[128], *p;1488 char *path;14891490 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)1491 return -1;1492 path = *refs->name1493 ? git_pathdup_submodule(refs->name, "%s", refname)1494 : git_pathdup("%s", refname);1495 fd = open(path, O_RDONLY);1496 free(path);1497 if (fd < 0)1498 return resolve_gitlink_packed_ref(refs, refname, sha1);14991500 len = read(fd, buffer, sizeof(buffer)-1);1501 close(fd);1502 if (len < 0)1503 return -1;1504 while (len && isspace(buffer[len-1]))1505 len--;1506 buffer[len] = 0;15071508 /* Was it a detached head or an old-fashioned symlink? */1509 if (!get_sha1_hex(buffer, sha1))1510 return 0;15111512 /* Symref? */1513 if (strncmp(buffer, "ref:", 4))1514 return -1;1515 p = buffer + 4;1516 while (isspace(*p))1517 p++;15181519 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1520}15211522int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)1523{1524 int len = strlen(path), retval;1525 char *submodule;1526 struct ref_cache *refs;15271528 while (len && path[len-1] == '/')1529 len--;1530 if (!len)1531 return -1;1532 submodule = xstrndup(path, len);1533 refs = get_ref_cache(submodule);1534 free(submodule);15351536 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);1537 return retval;1538}15391540/*1541 * Return the ref_entry for the given refname from the packed1542 * references. If it does not exist, return NULL.1543 */1544static struct ref_entry *get_packed_ref(const char *refname)1545{1546 return find_ref(get_packed_refs(&ref_cache), refname);1547}15481549/*1550 * A loose ref file doesn't exist; check for a packed ref. The1551 * options are forwarded from resolve_safe_unsafe().1552 */1553static int resolve_missing_loose_ref(const char *refname,1554 int resolve_flags,1555 unsigned char *sha1,1556 int *flags)1557{1558 struct ref_entry *entry;15591560 /*1561 * The loose reference file does not exist; check for a packed1562 * reference.1563 */1564 entry = get_packed_ref(refname);1565 if (entry) {1566 hashcpy(sha1, entry->u.value.oid.hash);1567 if (flags)1568 *flags |= REF_ISPACKED;1569 return 0;1570 }1571 /* The reference is not a packed reference, either. */1572 if (resolve_flags & RESOLVE_REF_READING) {1573 errno = ENOENT;1574 return -1;1575 } else {1576 hashclr(sha1);1577 return 0;1578 }1579}15801581/* This function needs to return a meaningful errno on failure */1582static const char *resolve_ref_1(const char *refname,1583 int resolve_flags,1584 unsigned char *sha1,1585 int *flags,1586 struct strbuf *sb_refname,1587 struct strbuf *sb_path,1588 struct strbuf *sb_contents)1589{1590 int depth = MAXDEPTH;1591 int bad_name = 0;15921593 if (flags)1594 *flags = 0;15951596 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1597 if (flags)1598 *flags |= REF_BAD_NAME;15991600 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1601 !refname_is_safe(refname)) {1602 errno = EINVAL;1603 return NULL;1604 }1605 /*1606 * dwim_ref() uses REF_ISBROKEN to distinguish between1607 * missing refs and refs that were present but invalid,1608 * to complain about the latter to stderr.1609 *1610 * We don't know whether the ref exists, so don't set1611 * REF_ISBROKEN yet.1612 */1613 bad_name = 1;1614 }1615 for (;;) {1616 const char *path;1617 struct stat st;1618 char *buf;1619 int fd;16201621 if (--depth < 0) {1622 errno = ELOOP;1623 return NULL;1624 }16251626 strbuf_reset(sb_path);1627 strbuf_git_path(sb_path, "%s", refname);1628 path = sb_path->buf;16291630 /*1631 * We might have to loop back here to avoid a race1632 * condition: first we lstat() the file, then we try1633 * to read it as a link or as a file. But if somebody1634 * changes the type of the file (file <-> directory1635 * <-> symlink) between the lstat() and reading, then1636 * we don't want to report that as an error but rather1637 * try again starting with the lstat().1638 */1639 stat_ref:1640 if (lstat(path, &st) < 0) {1641 if (errno != ENOENT)1642 return NULL;1643 if (resolve_missing_loose_ref(refname, resolve_flags,1644 sha1, flags))1645 return NULL;1646 if (bad_name) {1647 hashclr(sha1);1648 if (flags)1649 *flags |= REF_ISBROKEN;1650 }1651 return refname;1652 }16531654 /* Follow "normalized" - ie "refs/.." symlinks by hand */1655 if (S_ISLNK(st.st_mode)) {1656 strbuf_reset(sb_contents);1657 if (strbuf_readlink(sb_contents, path, 0) < 0) {1658 if (errno == ENOENT || errno == EINVAL)1659 /* inconsistent with lstat; retry */1660 goto stat_ref;1661 else1662 return NULL;1663 }1664 if (starts_with(sb_contents->buf, "refs/") &&1665 !check_refname_format(sb_contents->buf, 0)) {1666 strbuf_swap(sb_refname, sb_contents);1667 refname = sb_refname->buf;1668 if (flags)1669 *flags |= REF_ISSYMREF;1670 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {1671 hashclr(sha1);1672 return refname;1673 }1674 continue;1675 }1676 }16771678 /* Is it a directory? */1679 if (S_ISDIR(st.st_mode)) {1680 errno = EISDIR;1681 return NULL;1682 }16831684 /*1685 * Anything else, just open it and try to use it as1686 * a ref1687 */1688 fd = open(path, O_RDONLY);1689 if (fd < 0) {1690 if (errno == ENOENT)1691 /* inconsistent with lstat; retry */1692 goto stat_ref;1693 else1694 return NULL;1695 }1696 strbuf_reset(sb_contents);1697 if (strbuf_read(sb_contents, fd, 256) < 0) {1698 int save_errno = errno;1699 close(fd);1700 errno = save_errno;1701 return NULL;1702 }1703 close(fd);1704 strbuf_rtrim(sb_contents);17051706 /*1707 * Is it a symbolic ref?1708 */1709 if (!starts_with(sb_contents->buf, "ref:")) {1710 /*1711 * Please note that FETCH_HEAD has a second1712 * line containing other data.1713 */1714 if (get_sha1_hex(sb_contents->buf, sha1) ||1715 (sb_contents->buf[40] != '\0' && !isspace(sb_contents->buf[40]))) {1716 if (flags)1717 *flags |= REF_ISBROKEN;1718 errno = EINVAL;1719 return NULL;1720 }1721 if (bad_name) {1722 hashclr(sha1);1723 if (flags)1724 *flags |= REF_ISBROKEN;1725 }1726 return refname;1727 }1728 if (flags)1729 *flags |= REF_ISSYMREF;1730 buf = sb_contents->buf + 4;1731 while (isspace(*buf))1732 buf++;1733 strbuf_reset(sb_refname);1734 strbuf_addstr(sb_refname, buf);1735 refname = sb_refname->buf;1736 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {1737 hashclr(sha1);1738 return refname;1739 }1740 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {1741 if (flags)1742 *flags |= REF_ISBROKEN;17431744 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1745 !refname_is_safe(buf)) {1746 errno = EINVAL;1747 return NULL;1748 }1749 bad_name = 1;1750 }1751 }1752}17531754const char *resolve_ref_unsafe(const char *refname, int resolve_flags,1755 unsigned char *sha1, int *flags)1756{1757 static struct strbuf sb_refname = STRBUF_INIT;1758 struct strbuf sb_contents = STRBUF_INIT;1759 struct strbuf sb_path = STRBUF_INIT;1760 const char *ret;17611762 ret = resolve_ref_1(refname, resolve_flags, sha1, flags,1763 &sb_refname, &sb_path, &sb_contents);1764 strbuf_release(&sb_path);1765 strbuf_release(&sb_contents);1766 return ret;1767}17681769char *resolve_refdup(const char *refname, int resolve_flags,1770 unsigned char *sha1, int *flags)1771{1772 return xstrdup_or_null(resolve_ref_unsafe(refname, resolve_flags,1773 sha1, flags));1774}17751776/* The argument to filter_refs */1777struct ref_filter {1778 const char *pattern;1779 each_ref_fn *fn;1780 void *cb_data;1781};17821783int read_ref_full(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)1784{1785 if (resolve_ref_unsafe(refname, resolve_flags, sha1, flags))1786 return 0;1787 return -1;1788}17891790int read_ref(const char *refname, unsigned char *sha1)1791{1792 return read_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);1793}17941795int ref_exists(const char *refname)1796{1797 unsigned char sha1[20];1798 return !!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);1799}18001801static int filter_refs(const char *refname, const struct object_id *oid,1802 int flags, void *data)1803{1804 struct ref_filter *filter = (struct ref_filter *)data;18051806 if (wildmatch(filter->pattern, refname, 0, NULL))1807 return 0;1808 return filter->fn(refname, oid, flags, filter->cb_data);1809}18101811enum peel_status {1812 /* object was peeled successfully: */1813 PEEL_PEELED = 0,18141815 /*1816 * object cannot be peeled because the named object (or an1817 * object referred to by a tag in the peel chain), does not1818 * exist.1819 */1820 PEEL_INVALID = -1,18211822 /* object cannot be peeled because it is not a tag: */1823 PEEL_NON_TAG = -2,18241825 /* ref_entry contains no peeled value because it is a symref: */1826 PEEL_IS_SYMREF = -3,18271828 /*1829 * ref_entry cannot be peeled because it is broken (i.e., the1830 * symbolic reference cannot even be resolved to an object1831 * name):1832 */1833 PEEL_BROKEN = -41834};18351836/*1837 * Peel the named object; i.e., if the object is a tag, resolve the1838 * tag recursively until a non-tag is found. If successful, store the1839 * result to sha1 and return PEEL_PEELED. If the object is not a tag1840 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,1841 * and leave sha1 unchanged.1842 */1843static enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)1844{1845 struct object *o = lookup_unknown_object(name);18461847 if (o->type == OBJ_NONE) {1848 int type = sha1_object_info(name, NULL);1849 if (type < 0 || !object_as_type(o, type, 0))1850 return PEEL_INVALID;1851 }18521853 if (o->type != OBJ_TAG)1854 return PEEL_NON_TAG;18551856 o = deref_tag_noverify(o);1857 if (!o)1858 return PEEL_INVALID;18591860 hashcpy(sha1, o->sha1);1861 return PEEL_PEELED;1862}18631864/*1865 * Peel the entry (if possible) and return its new peel_status. If1866 * repeel is true, re-peel the entry even if there is an old peeled1867 * value that is already stored in it.1868 *1869 * It is OK to call this function with a packed reference entry that1870 * might be stale and might even refer to an object that has since1871 * been garbage-collected. In such a case, if the entry has1872 * REF_KNOWS_PEELED then leave the status unchanged and return1873 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1874 */1875static enum peel_status peel_entry(struct ref_entry *entry, int repeel)1876{1877 enum peel_status status;18781879 if (entry->flag & REF_KNOWS_PEELED) {1880 if (repeel) {1881 entry->flag &= ~REF_KNOWS_PEELED;1882 oidclr(&entry->u.value.peeled);1883 } else {1884 return is_null_oid(&entry->u.value.peeled) ?1885 PEEL_NON_TAG : PEEL_PEELED;1886 }1887 }1888 if (entry->flag & REF_ISBROKEN)1889 return PEEL_BROKEN;1890 if (entry->flag & REF_ISSYMREF)1891 return PEEL_IS_SYMREF;18921893 status = peel_object(entry->u.value.oid.hash, entry->u.value.peeled.hash);1894 if (status == PEEL_PEELED || status == PEEL_NON_TAG)1895 entry->flag |= REF_KNOWS_PEELED;1896 return status;1897}18981899int peel_ref(const char *refname, unsigned char *sha1)1900{1901 int flag;1902 unsigned char base[20];19031904 if (current_ref && (current_ref->name == refname1905 || !strcmp(current_ref->name, refname))) {1906 if (peel_entry(current_ref, 0))1907 return -1;1908 hashcpy(sha1, current_ref->u.value.peeled.hash);1909 return 0;1910 }19111912 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1913 return -1;19141915 /*1916 * If the reference is packed, read its ref_entry from the1917 * cache in the hope that we already know its peeled value.1918 * We only try this optimization on packed references because1919 * (a) forcing the filling of the loose reference cache could1920 * be expensive and (b) loose references anyway usually do not1921 * have REF_KNOWS_PEELED.1922 */1923 if (flag & REF_ISPACKED) {1924 struct ref_entry *r = get_packed_ref(refname);1925 if (r) {1926 if (peel_entry(r, 0))1927 return -1;1928 hashcpy(sha1, r->u.value.peeled.hash);1929 return 0;1930 }1931 }19321933 return peel_object(base, sha1);1934}19351936struct warn_if_dangling_data {1937 FILE *fp;1938 const char *refname;1939 const struct string_list *refnames;1940 const char *msg_fmt;1941};19421943static int warn_if_dangling_symref(const char *refname, const struct object_id *oid,1944 int flags, void *cb_data)1945{1946 struct warn_if_dangling_data *d = cb_data;1947 const char *resolves_to;1948 struct object_id junk;19491950 if (!(flags & REF_ISSYMREF))1951 return 0;19521953 resolves_to = resolve_ref_unsafe(refname, 0, junk.hash, NULL);1954 if (!resolves_to1955 || (d->refname1956 ? strcmp(resolves_to, d->refname)1957 : !string_list_has_string(d->refnames, resolves_to))) {1958 return 0;1959 }19601961 fprintf(d->fp, d->msg_fmt, refname);1962 fputc('\n', d->fp);1963 return 0;1964}19651966void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)1967{1968 struct warn_if_dangling_data data;19691970 data.fp = fp;1971 data.refname = refname;1972 data.refnames = NULL;1973 data.msg_fmt = msg_fmt;1974 for_each_rawref(warn_if_dangling_symref, &data);1975}19761977void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)1978{1979 struct warn_if_dangling_data data;19801981 data.fp = fp;1982 data.refname = NULL;1983 data.refnames = refnames;1984 data.msg_fmt = msg_fmt;1985 for_each_rawref(warn_if_dangling_symref, &data);1986}19871988/*1989 * Call fn for each reference in the specified ref_cache, omitting1990 * references not in the containing_dir of base. fn is called for all1991 * references, including broken ones. If fn ever returns a non-zero1992 * value, stop the iteration and return that value; otherwise, return1993 * 0.1994 */1995static int do_for_each_entry(struct ref_cache *refs, const char *base,1996 each_ref_entry_fn fn, void *cb_data)1997{1998 struct packed_ref_cache *packed_ref_cache;1999 struct ref_dir *loose_dir;2000 struct ref_dir *packed_dir;2001 int retval = 0;20022003 /*2004 * We must make sure that all loose refs are read before accessing the2005 * packed-refs file; this avoids a race condition in which loose refs2006 * are migrated to the packed-refs file by a simultaneous process, but2007 * our in-memory view is from before the migration. get_packed_ref_cache()2008 * takes care of making sure our view is up to date with what is on2009 * disk.2010 */2011 loose_dir = get_loose_refs(refs);2012 if (base && *base) {2013 loose_dir = find_containing_dir(loose_dir, base, 0);2014 }2015 if (loose_dir)2016 prime_ref_dir(loose_dir);20172018 packed_ref_cache = get_packed_ref_cache(refs);2019 acquire_packed_ref_cache(packed_ref_cache);2020 packed_dir = get_packed_ref_dir(packed_ref_cache);2021 if (base && *base) {2022 packed_dir = find_containing_dir(packed_dir, base, 0);2023 }20242025 if (packed_dir && loose_dir) {2026 sort_ref_dir(packed_dir);2027 sort_ref_dir(loose_dir);2028 retval = do_for_each_entry_in_dirs(2029 packed_dir, loose_dir, fn, cb_data);2030 } else if (packed_dir) {2031 sort_ref_dir(packed_dir);2032 retval = do_for_each_entry_in_dir(2033 packed_dir, 0, fn, cb_data);2034 } else if (loose_dir) {2035 sort_ref_dir(loose_dir);2036 retval = do_for_each_entry_in_dir(2037 loose_dir, 0, fn, cb_data);2038 }20392040 release_packed_ref_cache(packed_ref_cache);2041 return retval;2042}20432044/*2045 * Call fn for each reference in the specified ref_cache for which the2046 * refname begins with base. If trim is non-zero, then trim that many2047 * characters off the beginning of each refname before passing the2048 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include2049 * broken references in the iteration. If fn ever returns a non-zero2050 * value, stop the iteration and return that value; otherwise, return2051 * 0.2052 */2053static int do_for_each_ref(struct ref_cache *refs, const char *base,2054 each_ref_fn fn, int trim, int flags, void *cb_data)2055{2056 struct ref_entry_cb data;2057 data.base = base;2058 data.trim = trim;2059 data.flags = flags;2060 data.fn = fn;2061 data.cb_data = cb_data;20622063 if (ref_paranoia < 0)2064 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);2065 if (ref_paranoia)2066 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;20672068 return do_for_each_entry(refs, base, do_one_ref, &data);2069}20702071static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)2072{2073 struct object_id oid;2074 int flag;20752076 if (submodule) {2077 if (resolve_gitlink_ref(submodule, "HEAD", oid.hash) == 0)2078 return fn("HEAD", &oid, 0, cb_data);20792080 return 0;2081 }20822083 if (!read_ref_full("HEAD", RESOLVE_REF_READING, oid.hash, &flag))2084 return fn("HEAD", &oid, flag, cb_data);20852086 return 0;2087}20882089int head_ref(each_ref_fn fn, void *cb_data)2090{2091 return do_head_ref(NULL, fn, cb_data);2092}20932094int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2095{2096 return do_head_ref(submodule, fn, cb_data);2097}20982099int for_each_ref(each_ref_fn fn, void *cb_data)2100{2101 return do_for_each_ref(&ref_cache, "", fn, 0, 0, cb_data);2102}21032104int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2105{2106 return do_for_each_ref(get_ref_cache(submodule), "", fn, 0, 0, cb_data);2107}21082109int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)2110{2111 return do_for_each_ref(&ref_cache, prefix, fn, strlen(prefix), 0, cb_data);2112}21132114int for_each_ref_in_submodule(const char *submodule, const char *prefix,2115 each_ref_fn fn, void *cb_data)2116{2117 return do_for_each_ref(get_ref_cache(submodule), prefix, fn, strlen(prefix), 0, cb_data);2118}21192120int for_each_tag_ref(each_ref_fn fn, void *cb_data)2121{2122 return for_each_ref_in("refs/tags/", fn, cb_data);2123}21242125int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2126{2127 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);2128}21292130int for_each_branch_ref(each_ref_fn fn, void *cb_data)2131{2132 return for_each_ref_in("refs/heads/", fn, cb_data);2133}21342135int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2136{2137 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);2138}21392140int for_each_remote_ref(each_ref_fn fn, void *cb_data)2141{2142 return for_each_ref_in("refs/remotes/", fn, cb_data);2143}21442145int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2146{2147 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);2148}21492150int for_each_replace_ref(each_ref_fn fn, void *cb_data)2151{2152 return do_for_each_ref(&ref_cache, git_replace_ref_base, fn,2153 strlen(git_replace_ref_base), 0, cb_data);2154}21552156int head_ref_namespaced(each_ref_fn fn, void *cb_data)2157{2158 struct strbuf buf = STRBUF_INIT;2159 int ret = 0;2160 struct object_id oid;2161 int flag;21622163 strbuf_addf(&buf, "%sHEAD", get_git_namespace());2164 if (!read_ref_full(buf.buf, RESOLVE_REF_READING, oid.hash, &flag))2165 ret = fn(buf.buf, &oid, flag, cb_data);2166 strbuf_release(&buf);21672168 return ret;2169}21702171int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)2172{2173 struct strbuf buf = STRBUF_INIT;2174 int ret;2175 strbuf_addf(&buf, "%srefs/", get_git_namespace());2176 ret = do_for_each_ref(&ref_cache, buf.buf, fn, 0, 0, cb_data);2177 strbuf_release(&buf);2178 return ret;2179}21802181int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,2182 const char *prefix, void *cb_data)2183{2184 struct strbuf real_pattern = STRBUF_INIT;2185 struct ref_filter filter;2186 int ret;21872188 if (!prefix && !starts_with(pattern, "refs/"))2189 strbuf_addstr(&real_pattern, "refs/");2190 else if (prefix)2191 strbuf_addstr(&real_pattern, prefix);2192 strbuf_addstr(&real_pattern, pattern);21932194 if (!has_glob_specials(pattern)) {2195 /* Append implied '/' '*' if not present. */2196 if (real_pattern.buf[real_pattern.len - 1] != '/')2197 strbuf_addch(&real_pattern, '/');2198 /* No need to check for '*', there is none. */2199 strbuf_addch(&real_pattern, '*');2200 }22012202 filter.pattern = real_pattern.buf;2203 filter.fn = fn;2204 filter.cb_data = cb_data;2205 ret = for_each_ref(filter_refs, &filter);22062207 strbuf_release(&real_pattern);2208 return ret;2209}22102211int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)2212{2213 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);2214}22152216int for_each_rawref(each_ref_fn fn, void *cb_data)2217{2218 return do_for_each_ref(&ref_cache, "", fn, 0,2219 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);2220}22212222const char *prettify_refname(const char *name)2223{2224 return name + (2225 starts_with(name, "refs/heads/") ? 11 :2226 starts_with(name, "refs/tags/") ? 10 :2227 starts_with(name, "refs/remotes/") ? 13 :2228 0);2229}22302231static const char *ref_rev_parse_rules[] = {2232 "%.*s",2233 "refs/%.*s",2234 "refs/tags/%.*s",2235 "refs/heads/%.*s",2236 "refs/remotes/%.*s",2237 "refs/remotes/%.*s/HEAD",2238 NULL2239};22402241int refname_match(const char *abbrev_name, const char *full_name)2242{2243 const char **p;2244 const int abbrev_name_len = strlen(abbrev_name);22452246 for (p = ref_rev_parse_rules; *p; p++) {2247 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {2248 return 1;2249 }2250 }22512252 return 0;2253}22542255static void unlock_ref(struct ref_lock *lock)2256{2257 /* Do not free lock->lk -- atexit() still looks at them */2258 if (lock->lk)2259 rollback_lock_file(lock->lk);2260 free(lock->ref_name);2261 free(lock->orig_ref_name);2262 free(lock);2263}22642265/*2266 * Verify that the reference locked by lock has the value old_sha1.2267 * Fail if the reference doesn't exist and mustexist is set. Return 02268 * on success. On error, write an error message to err, set errno, and2269 * return a negative value.2270 */2271static int verify_lock(struct ref_lock *lock,2272 const unsigned char *old_sha1, int mustexist,2273 struct strbuf *err)2274{2275 assert(err);22762277 if (read_ref_full(lock->ref_name,2278 mustexist ? RESOLVE_REF_READING : 0,2279 lock->old_oid.hash, NULL)) {2280 int save_errno = errno;2281 strbuf_addf(err, "can't verify ref %s", lock->ref_name);2282 errno = save_errno;2283 return -1;2284 }2285 if (hashcmp(lock->old_oid.hash, old_sha1)) {2286 strbuf_addf(err, "ref %s is at %s but expected %s",2287 lock->ref_name,2288 sha1_to_hex(lock->old_oid.hash),2289 sha1_to_hex(old_sha1));2290 errno = EBUSY;2291 return -1;2292 }2293 return 0;2294}22952296static int remove_empty_directories(struct strbuf *path)2297{2298 /*2299 * we want to create a file but there is a directory there;2300 * if that is an empty directory (or a directory that contains2301 * only empty directories), remove them.2302 */2303 return remove_dir_recursively(path, REMOVE_DIR_EMPTY_ONLY);2304}23052306/*2307 * *string and *len will only be substituted, and *string returned (for2308 * later free()ing) if the string passed in is a magic short-hand form2309 * to name a branch.2310 */2311static char *substitute_branch_name(const char **string, int *len)2312{2313 struct strbuf buf = STRBUF_INIT;2314 int ret = interpret_branch_name(*string, *len, &buf);23152316 if (ret == *len) {2317 size_t size;2318 *string = strbuf_detach(&buf, &size);2319 *len = size;2320 return (char *)*string;2321 }23222323 return NULL;2324}23252326int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)2327{2328 char *last_branch = substitute_branch_name(&str, &len);2329 const char **p, *r;2330 int refs_found = 0;23312332 *ref = NULL;2333 for (p = ref_rev_parse_rules; *p; p++) {2334 char fullref[PATH_MAX];2335 unsigned char sha1_from_ref[20];2336 unsigned char *this_result;2337 int flag;23382339 this_result = refs_found ? sha1_from_ref : sha1;2340 mksnpath(fullref, sizeof(fullref), *p, len, str);2341 r = resolve_ref_unsafe(fullref, RESOLVE_REF_READING,2342 this_result, &flag);2343 if (r) {2344 if (!refs_found++)2345 *ref = xstrdup(r);2346 if (!warn_ambiguous_refs)2347 break;2348 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {2349 warning("ignoring dangling symref %s.", fullref);2350 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {2351 warning("ignoring broken ref %s.", fullref);2352 }2353 }2354 free(last_branch);2355 return refs_found;2356}23572358int dwim_log(const char *str, int len, unsigned char *sha1, char **log)2359{2360 char *last_branch = substitute_branch_name(&str, &len);2361 const char **p;2362 int logs_found = 0;23632364 *log = NULL;2365 for (p = ref_rev_parse_rules; *p; p++) {2366 unsigned char hash[20];2367 char path[PATH_MAX];2368 const char *ref, *it;23692370 mksnpath(path, sizeof(path), *p, len, str);2371 ref = resolve_ref_unsafe(path, RESOLVE_REF_READING,2372 hash, NULL);2373 if (!ref)2374 continue;2375 if (reflog_exists(path))2376 it = path;2377 else if (strcmp(ref, path) && reflog_exists(ref))2378 it = ref;2379 else2380 continue;2381 if (!logs_found++) {2382 *log = xstrdup(it);2383 hashcpy(sha1, hash);2384 }2385 if (!warn_ambiguous_refs)2386 break;2387 }2388 free(last_branch);2389 return logs_found;2390}23912392/*2393 * Locks a ref returning the lock on success and NULL on failure.2394 * On failure errno is set to something meaningful.2395 */2396static struct ref_lock *lock_ref_sha1_basic(const char *refname,2397 const unsigned char *old_sha1,2398 const struct string_list *extras,2399 const struct string_list *skip,2400 unsigned int flags, int *type_p,2401 struct strbuf *err)2402{2403 struct strbuf ref_file = STRBUF_INIT;2404 struct strbuf orig_ref_file = STRBUF_INIT;2405 const char *orig_refname = refname;2406 struct ref_lock *lock;2407 int last_errno = 0;2408 int type, lflags;2409 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2410 int resolve_flags = 0;2411 int attempts_remaining = 3;24122413 assert(err);24142415 lock = xcalloc(1, sizeof(struct ref_lock));24162417 if (mustexist)2418 resolve_flags |= RESOLVE_REF_READING;2419 if (flags & REF_DELETING) {2420 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;2421 if (flags & REF_NODEREF)2422 resolve_flags |= RESOLVE_REF_NO_RECURSE;2423 }24242425 refname = resolve_ref_unsafe(refname, resolve_flags,2426 lock->old_oid.hash, &type);2427 if (!refname && errno == EISDIR) {2428 /*2429 * we are trying to lock foo but we used to2430 * have foo/bar which now does not exist;2431 * it is normal for the empty directory 'foo'2432 * to remain.2433 */2434 strbuf_git_path(&orig_ref_file, "%s", orig_refname);2435 if (remove_empty_directories(&orig_ref_file)) {2436 last_errno = errno;2437 if (!verify_refname_available(orig_refname, extras, skip,2438 get_loose_refs(&ref_cache), err))2439 strbuf_addf(err, "there are still refs under '%s'",2440 orig_refname);2441 goto error_return;2442 }2443 refname = resolve_ref_unsafe(orig_refname, resolve_flags,2444 lock->old_oid.hash, &type);2445 }2446 if (type_p)2447 *type_p = type;2448 if (!refname) {2449 last_errno = errno;2450 if (last_errno != ENOTDIR ||2451 !verify_refname_available(orig_refname, extras, skip,2452 get_loose_refs(&ref_cache), err))2453 strbuf_addf(err, "unable to resolve reference %s: %s",2454 orig_refname, strerror(last_errno));24552456 goto error_return;2457 }2458 /*2459 * If the ref did not exist and we are creating it, make sure2460 * there is no existing packed ref whose name begins with our2461 * refname, nor a packed ref whose name is a proper prefix of2462 * our refname.2463 */2464 if (is_null_oid(&lock->old_oid) &&2465 verify_refname_available(refname, extras, skip,2466 get_packed_refs(&ref_cache), err)) {2467 last_errno = ENOTDIR;2468 goto error_return;2469 }24702471 lock->lk = xcalloc(1, sizeof(struct lock_file));24722473 lflags = 0;2474 if (flags & REF_NODEREF) {2475 refname = orig_refname;2476 lflags |= LOCK_NO_DEREF;2477 }2478 lock->ref_name = xstrdup(refname);2479 lock->orig_ref_name = xstrdup(orig_refname);2480 strbuf_git_path(&ref_file, "%s", refname);24812482 retry:2483 switch (safe_create_leading_directories_const(ref_file.buf)) {2484 case SCLD_OK:2485 break; /* success */2486 case SCLD_VANISHED:2487 if (--attempts_remaining > 0)2488 goto retry;2489 /* fall through */2490 default:2491 last_errno = errno;2492 strbuf_addf(err, "unable to create directory for %s",2493 ref_file.buf);2494 goto error_return;2495 }24962497 if (hold_lock_file_for_update(lock->lk, ref_file.buf, lflags) < 0) {2498 last_errno = errno;2499 if (errno == ENOENT && --attempts_remaining > 0)2500 /*2501 * Maybe somebody just deleted one of the2502 * directories leading to ref_file. Try2503 * again:2504 */2505 goto retry;2506 else {2507 unable_to_lock_message(ref_file.buf, errno, err);2508 goto error_return;2509 }2510 }2511 if (old_sha1 && verify_lock(lock, old_sha1, mustexist, err)) {2512 last_errno = errno;2513 goto error_return;2514 }2515 goto out;25162517 error_return:2518 unlock_ref(lock);2519 lock = NULL;25202521 out:2522 strbuf_release(&ref_file);2523 strbuf_release(&orig_ref_file);2524 errno = last_errno;2525 return lock;2526}25272528/*2529 * Write an entry to the packed-refs file for the specified refname.2530 * If peeled is non-NULL, write it as the entry's peeled value.2531 */2532static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,2533 unsigned char *peeled)2534{2535 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);2536 if (peeled)2537 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));2538}25392540/*2541 * An each_ref_entry_fn that writes the entry to a packed-refs file.2542 */2543static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)2544{2545 enum peel_status peel_status = peel_entry(entry, 0);25462547 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2548 error("internal error: %s is not a valid packed reference!",2549 entry->name);2550 write_packed_entry(cb_data, entry->name, entry->u.value.oid.hash,2551 peel_status == PEEL_PEELED ?2552 entry->u.value.peeled.hash : NULL);2553 return 0;2554}25552556/*2557 * Lock the packed-refs file for writing. Flags is passed to2558 * hold_lock_file_for_update(). Return 0 on success. On errors, set2559 * errno appropriately and return a nonzero value.2560 */2561static int lock_packed_refs(int flags)2562{2563 static int timeout_configured = 0;2564 static int timeout_value = 1000;25652566 struct packed_ref_cache *packed_ref_cache;25672568 if (!timeout_configured) {2569 git_config_get_int("core.packedrefstimeout", &timeout_value);2570 timeout_configured = 1;2571 }25722573 if (hold_lock_file_for_update_timeout(2574 &packlock, git_path("packed-refs"),2575 flags, timeout_value) < 0)2576 return -1;2577 /*2578 * Get the current packed-refs while holding the lock. If the2579 * packed-refs file has been modified since we last read it,2580 * this will automatically invalidate the cache and re-read2581 * the packed-refs file.2582 */2583 packed_ref_cache = get_packed_ref_cache(&ref_cache);2584 packed_ref_cache->lock = &packlock;2585 /* Increment the reference count to prevent it from being freed: */2586 acquire_packed_ref_cache(packed_ref_cache);2587 return 0;2588}25892590/*2591 * Write the current version of the packed refs cache from memory to2592 * disk. The packed-refs file must already be locked for writing (see2593 * lock_packed_refs()). Return zero on success. On errors, set errno2594 * and return a nonzero value2595 */2596static int commit_packed_refs(void)2597{2598 struct packed_ref_cache *packed_ref_cache =2599 get_packed_ref_cache(&ref_cache);2600 int error = 0;2601 int save_errno = 0;2602 FILE *out;26032604 if (!packed_ref_cache->lock)2605 die("internal error: packed-refs not locked");26062607 out = fdopen_lock_file(packed_ref_cache->lock, "w");2608 if (!out)2609 die_errno("unable to fdopen packed-refs descriptor");26102611 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);2612 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),2613 0, write_packed_entry_fn, out);26142615 if (commit_lock_file(packed_ref_cache->lock)) {2616 save_errno = errno;2617 error = -1;2618 }2619 packed_ref_cache->lock = NULL;2620 release_packed_ref_cache(packed_ref_cache);2621 errno = save_errno;2622 return error;2623}26242625/*2626 * Rollback the lockfile for the packed-refs file, and discard the2627 * in-memory packed reference cache. (The packed-refs file will be2628 * read anew if it is needed again after this function is called.)2629 */2630static void rollback_packed_refs(void)2631{2632 struct packed_ref_cache *packed_ref_cache =2633 get_packed_ref_cache(&ref_cache);26342635 if (!packed_ref_cache->lock)2636 die("internal error: packed-refs not locked");2637 rollback_lock_file(packed_ref_cache->lock);2638 packed_ref_cache->lock = NULL;2639 release_packed_ref_cache(packed_ref_cache);2640 clear_packed_ref_cache(&ref_cache);2641}26422643struct ref_to_prune {2644 struct ref_to_prune *next;2645 unsigned char sha1[20];2646 char name[FLEX_ARRAY];2647};26482649struct pack_refs_cb_data {2650 unsigned int flags;2651 struct ref_dir *packed_refs;2652 struct ref_to_prune *ref_to_prune;2653};26542655/*2656 * An each_ref_entry_fn that is run over loose references only. If2657 * the loose reference can be packed, add an entry in the packed ref2658 * cache. If the reference should be pruned, also add it to2659 * ref_to_prune in the pack_refs_cb_data.2660 */2661static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)2662{2663 struct pack_refs_cb_data *cb = cb_data;2664 enum peel_status peel_status;2665 struct ref_entry *packed_entry;2666 int is_tag_ref = starts_with(entry->name, "refs/tags/");26672668 /* ALWAYS pack tags */2669 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2670 return 0;26712672 /* Do not pack symbolic or broken refs: */2673 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2674 return 0;26752676 /* Add a packed ref cache entry equivalent to the loose entry. */2677 peel_status = peel_entry(entry, 1);2678 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2679 die("internal error peeling reference %s (%s)",2680 entry->name, oid_to_hex(&entry->u.value.oid));2681 packed_entry = find_ref(cb->packed_refs, entry->name);2682 if (packed_entry) {2683 /* Overwrite existing packed entry with info from loose entry */2684 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2685 oidcpy(&packed_entry->u.value.oid, &entry->u.value.oid);2686 } else {2687 packed_entry = create_ref_entry(entry->name, entry->u.value.oid.hash,2688 REF_ISPACKED | REF_KNOWS_PEELED, 0);2689 add_ref(cb->packed_refs, packed_entry);2690 }2691 oidcpy(&packed_entry->u.value.peeled, &entry->u.value.peeled);26922693 /* Schedule the loose reference for pruning if requested. */2694 if ((cb->flags & PACK_REFS_PRUNE)) {2695 int namelen = strlen(entry->name) + 1;2696 struct ref_to_prune *n = xcalloc(1, sizeof(*n) + namelen);2697 hashcpy(n->sha1, entry->u.value.oid.hash);2698 memcpy(n->name, entry->name, namelen); /* includes NUL */2699 n->next = cb->ref_to_prune;2700 cb->ref_to_prune = n;2701 }2702 return 0;2703}27042705/*2706 * Remove empty parents, but spare refs/ and immediate subdirs.2707 * Note: munges *name.2708 */2709static void try_remove_empty_parents(char *name)2710{2711 char *p, *q;2712 int i;2713 p = name;2714 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */2715 while (*p && *p != '/')2716 p++;2717 /* tolerate duplicate slashes; see check_refname_format() */2718 while (*p == '/')2719 p++;2720 }2721 for (q = p; *q; q++)2722 ;2723 while (1) {2724 while (q > p && *q != '/')2725 q--;2726 while (q > p && *(q-1) == '/')2727 q--;2728 if (q == p)2729 break;2730 *q = '\0';2731 if (rmdir(git_path("%s", name)))2732 break;2733 }2734}27352736/* make sure nobody touched the ref, and unlink */2737static void prune_ref(struct ref_to_prune *r)2738{2739 struct ref_transaction *transaction;2740 struct strbuf err = STRBUF_INIT;27412742 if (check_refname_format(r->name, 0))2743 return;27442745 transaction = ref_transaction_begin(&err);2746 if (!transaction ||2747 ref_transaction_delete(transaction, r->name, r->sha1,2748 REF_ISPRUNING, NULL, &err) ||2749 ref_transaction_commit(transaction, &err)) {2750 ref_transaction_free(transaction);2751 error("%s", err.buf);2752 strbuf_release(&err);2753 return;2754 }2755 ref_transaction_free(transaction);2756 strbuf_release(&err);2757 try_remove_empty_parents(r->name);2758}27592760static void prune_refs(struct ref_to_prune *r)2761{2762 while (r) {2763 prune_ref(r);2764 r = r->next;2765 }2766}27672768int pack_refs(unsigned int flags)2769{2770 struct pack_refs_cb_data cbdata;27712772 memset(&cbdata, 0, sizeof(cbdata));2773 cbdata.flags = flags;27742775 lock_packed_refs(LOCK_DIE_ON_ERROR);2776 cbdata.packed_refs = get_packed_refs(&ref_cache);27772778 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,2779 pack_if_possible_fn, &cbdata);27802781 if (commit_packed_refs())2782 die_errno("unable to overwrite old ref-pack file");27832784 prune_refs(cbdata.ref_to_prune);2785 return 0;2786}27872788/*2789 * Rewrite the packed-refs file, omitting any refs listed in2790 * 'refnames'. On error, leave packed-refs unchanged, write an error2791 * message to 'err', and return a nonzero value.2792 *2793 * The refs in 'refnames' needn't be sorted. `err` must not be NULL.2794 */2795static int repack_without_refs(struct string_list *refnames, struct strbuf *err)2796{2797 struct ref_dir *packed;2798 struct string_list_item *refname;2799 int ret, needs_repacking = 0, removed = 0;28002801 assert(err);28022803 /* Look for a packed ref */2804 for_each_string_list_item(refname, refnames) {2805 if (get_packed_ref(refname->string)) {2806 needs_repacking = 1;2807 break;2808 }2809 }28102811 /* Avoid locking if we have nothing to do */2812 if (!needs_repacking)2813 return 0; /* no refname exists in packed refs */28142815 if (lock_packed_refs(0)) {2816 unable_to_lock_message(git_path("packed-refs"), errno, err);2817 return -1;2818 }2819 packed = get_packed_refs(&ref_cache);28202821 /* Remove refnames from the cache */2822 for_each_string_list_item(refname, refnames)2823 if (remove_entry(packed, refname->string) != -1)2824 removed = 1;2825 if (!removed) {2826 /*2827 * All packed entries disappeared while we were2828 * acquiring the lock.2829 */2830 rollback_packed_refs();2831 return 0;2832 }28332834 /* Write what remains */2835 ret = commit_packed_refs();2836 if (ret)2837 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",2838 strerror(errno));2839 return ret;2840}28412842static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)2843{2844 assert(err);28452846 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2847 /*2848 * loose. The loose file name is the same as the2849 * lockfile name, minus ".lock":2850 */2851 char *loose_filename = get_locked_file_path(lock->lk);2852 int res = unlink_or_msg(loose_filename, err);2853 free(loose_filename);2854 if (res)2855 return 1;2856 }2857 return 0;2858}28592860static int is_per_worktree_ref(const char *refname)2861{2862 return !strcmp(refname, "HEAD");2863}28642865static int is_pseudoref_syntax(const char *refname)2866{2867 const char *c;28682869 for (c = refname; *c; c++) {2870 if (!isupper(*c) && *c != '-' && *c != '_')2871 return 0;2872 }28732874 return 1;2875}28762877enum ref_type ref_type(const char *refname)2878{2879 if (is_per_worktree_ref(refname))2880 return REF_TYPE_PER_WORKTREE;2881 if (is_pseudoref_syntax(refname))2882 return REF_TYPE_PSEUDOREF;2883 return REF_TYPE_NORMAL;2884}28852886static int write_pseudoref(const char *pseudoref, const unsigned char *sha1,2887 const unsigned char *old_sha1, struct strbuf *err)2888{2889 const char *filename;2890 int fd;2891 static struct lock_file lock;2892 struct strbuf buf = STRBUF_INIT;2893 int ret = -1;28942895 strbuf_addf(&buf, "%s\n", sha1_to_hex(sha1));28962897 filename = git_path("%s", pseudoref);2898 fd = hold_lock_file_for_update(&lock, filename, LOCK_DIE_ON_ERROR);2899 if (fd < 0) {2900 strbuf_addf(err, "Could not open '%s' for writing: %s",2901 filename, strerror(errno));2902 return -1;2903 }29042905 if (old_sha1) {2906 unsigned char actual_old_sha1[20];29072908 if (read_ref(pseudoref, actual_old_sha1))2909 die("could not read ref '%s'", pseudoref);2910 if (hashcmp(actual_old_sha1, old_sha1)) {2911 strbuf_addf(err, "Unexpected sha1 when writing %s", pseudoref);2912 rollback_lock_file(&lock);2913 goto done;2914 }2915 }29162917 if (write_in_full(fd, buf.buf, buf.len) != buf.len) {2918 strbuf_addf(err, "Could not write to '%s'", filename);2919 rollback_lock_file(&lock);2920 goto done;2921 }29222923 commit_lock_file(&lock);2924 ret = 0;2925done:2926 strbuf_release(&buf);2927 return ret;2928}29292930static int delete_pseudoref(const char *pseudoref, const unsigned char *old_sha1)2931{2932 static struct lock_file lock;2933 const char *filename;29342935 filename = git_path("%s", pseudoref);29362937 if (old_sha1 && !is_null_sha1(old_sha1)) {2938 int fd;2939 unsigned char actual_old_sha1[20];29402941 fd = hold_lock_file_for_update(&lock, filename,2942 LOCK_DIE_ON_ERROR);2943 if (fd < 0)2944 die_errno(_("Could not open '%s' for writing"), filename);2945 if (read_ref(pseudoref, actual_old_sha1))2946 die("could not read ref '%s'", pseudoref);2947 if (hashcmp(actual_old_sha1, old_sha1)) {2948 warning("Unexpected sha1 when deleting %s", pseudoref);2949 rollback_lock_file(&lock);2950 return -1;2951 }29522953 unlink(filename);2954 rollback_lock_file(&lock);2955 } else {2956 unlink(filename);2957 }29582959 return 0;2960}29612962int delete_ref(const char *refname, const unsigned char *old_sha1,2963 unsigned int flags)2964{2965 struct ref_transaction *transaction;2966 struct strbuf err = STRBUF_INIT;29672968 if (ref_type(refname) == REF_TYPE_PSEUDOREF)2969 return delete_pseudoref(refname, old_sha1);29702971 transaction = ref_transaction_begin(&err);2972 if (!transaction ||2973 ref_transaction_delete(transaction, refname, old_sha1,2974 flags, NULL, &err) ||2975 ref_transaction_commit(transaction, &err)) {2976 error("%s", err.buf);2977 ref_transaction_free(transaction);2978 strbuf_release(&err);2979 return 1;2980 }2981 ref_transaction_free(transaction);2982 strbuf_release(&err);2983 return 0;2984}29852986int delete_refs(struct string_list *refnames)2987{2988 struct strbuf err = STRBUF_INIT;2989 int i, result = 0;29902991 if (!refnames->nr)2992 return 0;29932994 result = repack_without_refs(refnames, &err);2995 if (result) {2996 /*2997 * If we failed to rewrite the packed-refs file, then2998 * it is unsafe to try to remove loose refs, because2999 * doing so might expose an obsolete packed value for3000 * a reference that might even point at an object that3001 * has been garbage collected.3002 */3003 if (refnames->nr == 1)3004 error(_("could not delete reference %s: %s"),3005 refnames->items[0].string, err.buf);3006 else3007 error(_("could not delete references: %s"), err.buf);30083009 goto out;3010 }30113012 for (i = 0; i < refnames->nr; i++) {3013 const char *refname = refnames->items[i].string;30143015 if (delete_ref(refname, NULL, 0))3016 result |= error(_("could not remove reference %s"), refname);3017 }30183019out:3020 strbuf_release(&err);3021 return result;3022}30233024/*3025 * People using contrib's git-new-workdir have .git/logs/refs ->3026 * /some/other/path/.git/logs/refs, and that may live on another device.3027 *3028 * IOW, to avoid cross device rename errors, the temporary renamed log must3029 * live into logs/refs.3030 */3031#define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"30323033static int rename_tmp_log(const char *newrefname)3034{3035 int attempts_remaining = 4;3036 struct strbuf path = STRBUF_INIT;3037 int ret = -1;30383039 retry:3040 strbuf_reset(&path);3041 strbuf_git_path(&path, "logs/%s", newrefname);3042 switch (safe_create_leading_directories_const(path.buf)) {3043 case SCLD_OK:3044 break; /* success */3045 case SCLD_VANISHED:3046 if (--attempts_remaining > 0)3047 goto retry;3048 /* fall through */3049 default:3050 error("unable to create directory for %s", newrefname);3051 goto out;3052 }30533054 if (rename(git_path(TMP_RENAMED_LOG), path.buf)) {3055 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {3056 /*3057 * rename(a, b) when b is an existing3058 * directory ought to result in ISDIR, but3059 * Solaris 5.8 gives ENOTDIR. Sheesh.3060 */3061 if (remove_empty_directories(&path)) {3062 error("Directory not empty: logs/%s", newrefname);3063 goto out;3064 }3065 goto retry;3066 } else if (errno == ENOENT && --attempts_remaining > 0) {3067 /*3068 * Maybe another process just deleted one of3069 * the directories in the path to newrefname.3070 * Try again from the beginning.3071 */3072 goto retry;3073 } else {3074 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",3075 newrefname, strerror(errno));3076 goto out;3077 }3078 }3079 ret = 0;3080out:3081 strbuf_release(&path);3082 return ret;3083}30843085static int rename_ref_available(const char *oldname, const char *newname)3086{3087 struct string_list skip = STRING_LIST_INIT_NODUP;3088 struct strbuf err = STRBUF_INIT;3089 int ret;30903091 string_list_insert(&skip, oldname);3092 ret = !verify_refname_available(newname, NULL, &skip,3093 get_packed_refs(&ref_cache), &err)3094 && !verify_refname_available(newname, NULL, &skip,3095 get_loose_refs(&ref_cache), &err);3096 if (!ret)3097 error("%s", err.buf);30983099 string_list_clear(&skip, 0);3100 strbuf_release(&err);3101 return ret;3102}31033104static int write_ref_to_lockfile(struct ref_lock *lock,3105 const unsigned char *sha1, struct strbuf *err);3106static int commit_ref_update(struct ref_lock *lock,3107 const unsigned char *sha1, const char *logmsg,3108 int flags, struct strbuf *err);31093110int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)3111{3112 unsigned char sha1[20], orig_sha1[20];3113 int flag = 0, logmoved = 0;3114 struct ref_lock *lock;3115 struct stat loginfo;3116 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);3117 const char *symref = NULL;3118 struct strbuf err = STRBUF_INIT;31193120 if (log && S_ISLNK(loginfo.st_mode))3121 return error("reflog for %s is a symlink", oldrefname);31223123 symref = resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,3124 orig_sha1, &flag);3125 if (flag & REF_ISSYMREF)3126 return error("refname %s is a symbolic ref, renaming it is not supported",3127 oldrefname);3128 if (!symref)3129 return error("refname %s not found", oldrefname);31303131 if (!rename_ref_available(oldrefname, newrefname))3132 return 1;31333134 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))3135 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",3136 oldrefname, strerror(errno));31373138 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {3139 error("unable to delete old %s", oldrefname);3140 goto rollback;3141 }31423143 if (!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&3144 delete_ref(newrefname, sha1, REF_NODEREF)) {3145 if (errno==EISDIR) {3146 struct strbuf path = STRBUF_INIT;3147 int result;31483149 strbuf_git_path(&path, "%s", newrefname);3150 result = remove_empty_directories(&path);3151 strbuf_release(&path);31523153 if (result) {3154 error("Directory not empty: %s", newrefname);3155 goto rollback;3156 }3157 } else {3158 error("unable to delete existing %s", newrefname);3159 goto rollback;3160 }3161 }31623163 if (log && rename_tmp_log(newrefname))3164 goto rollback;31653166 logmoved = log;31673168 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, 0, NULL, &err);3169 if (!lock) {3170 error("unable to rename '%s' to '%s': %s", oldrefname, newrefname, err.buf);3171 strbuf_release(&err);3172 goto rollback;3173 }3174 hashcpy(lock->old_oid.hash, orig_sha1);31753176 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||3177 commit_ref_update(lock, orig_sha1, logmsg, 0, &err)) {3178 error("unable to write current sha1 into %s: %s", newrefname, err.buf);3179 strbuf_release(&err);3180 goto rollback;3181 }31823183 return 0;31843185 rollback:3186 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, 0, NULL, &err);3187 if (!lock) {3188 error("unable to lock %s for rollback: %s", oldrefname, err.buf);3189 strbuf_release(&err);3190 goto rollbacklog;3191 }31923193 flag = log_all_ref_updates;3194 log_all_ref_updates = 0;3195 if (write_ref_to_lockfile(lock, orig_sha1, &err) ||3196 commit_ref_update(lock, orig_sha1, NULL, 0, &err)) {3197 error("unable to write current sha1 into %s: %s", oldrefname, err.buf);3198 strbuf_release(&err);3199 }3200 log_all_ref_updates = flag;32013202 rollbacklog:3203 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))3204 error("unable to restore logfile %s from %s: %s",3205 oldrefname, newrefname, strerror(errno));3206 if (!logmoved && log &&3207 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))3208 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",3209 oldrefname, strerror(errno));32103211 return 1;3212}32133214static int close_ref(struct ref_lock *lock)3215{3216 if (close_lock_file(lock->lk))3217 return -1;3218 return 0;3219}32203221static int commit_ref(struct ref_lock *lock)3222{3223 if (commit_lock_file(lock->lk))3224 return -1;3225 return 0;3226}32273228/*3229 * copy the reflog message msg to buf, which has been allocated sufficiently3230 * large, while cleaning up the whitespaces. Especially, convert LF to space,3231 * because reflog file is one line per entry.3232 */3233static int copy_msg(char *buf, const char *msg)3234{3235 char *cp = buf;3236 char c;3237 int wasspace = 1;32383239 *cp++ = '\t';3240 while ((c = *msg++)) {3241 if (wasspace && isspace(c))3242 continue;3243 wasspace = isspace(c);3244 if (wasspace)3245 c = ' ';3246 *cp++ = c;3247 }3248 while (buf < cp && isspace(cp[-1]))3249 cp--;3250 *cp++ = '\n';3251 return cp - buf;3252}32533254static int should_autocreate_reflog(const char *refname)3255{3256 if (!log_all_ref_updates)3257 return 0;3258 return starts_with(refname, "refs/heads/") ||3259 starts_with(refname, "refs/remotes/") ||3260 starts_with(refname, "refs/notes/") ||3261 !strcmp(refname, "HEAD");3262}32633264/*3265 * Create a reflog for a ref. If force_create = 0, the reflog will3266 * only be created for certain refs (those for which3267 * should_autocreate_reflog returns non-zero. Otherwise, create it3268 * regardless of the ref name. Fill in *err and return -1 on failure.3269 */3270static int log_ref_setup(const char *refname, struct strbuf *logfile, struct strbuf *err, int force_create)3271{3272 int logfd, oflags = O_APPEND | O_WRONLY;32733274 strbuf_git_path(logfile, "logs/%s", refname);3275 if (force_create || should_autocreate_reflog(refname)) {3276 if (safe_create_leading_directories(logfile->buf) < 0) {3277 strbuf_addf(err, "unable to create directory for %s: "3278 "%s", logfile->buf, strerror(errno));3279 return -1;3280 }3281 oflags |= O_CREAT;3282 }32833284 logfd = open(logfile->buf, oflags, 0666);3285 if (logfd < 0) {3286 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))3287 return 0;32883289 if (errno == EISDIR) {3290 if (remove_empty_directories(logfile)) {3291 strbuf_addf(err, "There are still logs under "3292 "'%s'", logfile->buf);3293 return -1;3294 }3295 logfd = open(logfile->buf, oflags, 0666);3296 }32973298 if (logfd < 0) {3299 strbuf_addf(err, "unable to append to %s: %s",3300 logfile->buf, strerror(errno));3301 return -1;3302 }3303 }33043305 adjust_shared_perm(logfile->buf);3306 close(logfd);3307 return 0;3308}330933103311int safe_create_reflog(const char *refname, int force_create, struct strbuf *err)3312{3313 int ret;3314 struct strbuf sb = STRBUF_INIT;33153316 ret = log_ref_setup(refname, &sb, err, force_create);3317 strbuf_release(&sb);3318 return ret;3319}33203321static int log_ref_write_fd(int fd, const unsigned char *old_sha1,3322 const unsigned char *new_sha1,3323 const char *committer, const char *msg)3324{3325 int msglen, written;3326 unsigned maxlen, len;3327 char *logrec;33283329 msglen = msg ? strlen(msg) : 0;3330 maxlen = strlen(committer) + msglen + 100;3331 logrec = xmalloc(maxlen);3332 len = xsnprintf(logrec, maxlen, "%s %s %s\n",3333 sha1_to_hex(old_sha1),3334 sha1_to_hex(new_sha1),3335 committer);3336 if (msglen)3337 len += copy_msg(logrec + len - 1, msg) - 1;33383339 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;3340 free(logrec);3341 if (written != len)3342 return -1;33433344 return 0;3345}33463347static int log_ref_write_1(const char *refname, const unsigned char *old_sha1,3348 const unsigned char *new_sha1, const char *msg,3349 struct strbuf *logfile, int flags,3350 struct strbuf *err)3351{3352 int logfd, result, oflags = O_APPEND | O_WRONLY;33533354 if (log_all_ref_updates < 0)3355 log_all_ref_updates = !is_bare_repository();33563357 result = log_ref_setup(refname, logfile, err, flags & REF_FORCE_CREATE_REFLOG);33583359 if (result)3360 return result;33613362 logfd = open(logfile->buf, oflags);3363 if (logfd < 0)3364 return 0;3365 result = log_ref_write_fd(logfd, old_sha1, new_sha1,3366 git_committer_info(0), msg);3367 if (result) {3368 strbuf_addf(err, "unable to append to %s: %s", logfile->buf,3369 strerror(errno));3370 close(logfd);3371 return -1;3372 }3373 if (close(logfd)) {3374 strbuf_addf(err, "unable to append to %s: %s", logfile->buf,3375 strerror(errno));3376 return -1;3377 }3378 return 0;3379}33803381static int log_ref_write(const char *refname, const unsigned char *old_sha1,3382 const unsigned char *new_sha1, const char *msg,3383 int flags, struct strbuf *err)3384{3385 struct strbuf sb = STRBUF_INIT;3386 int ret = log_ref_write_1(refname, old_sha1, new_sha1, msg, &sb, flags,3387 err);3388 strbuf_release(&sb);3389 return ret;3390}33913392int is_branch(const char *refname)3393{3394 return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");3395}33963397/*3398 * Write sha1 into the open lockfile, then close the lockfile. On3399 * errors, rollback the lockfile, fill in *err and3400 * return -1.3401 */3402static int write_ref_to_lockfile(struct ref_lock *lock,3403 const unsigned char *sha1, struct strbuf *err)3404{3405 static char term = '\n';3406 struct object *o;3407 int fd;34083409 o = parse_object(sha1);3410 if (!o) {3411 strbuf_addf(err,3412 "Trying to write ref %s with nonexistent object %s",3413 lock->ref_name, sha1_to_hex(sha1));3414 unlock_ref(lock);3415 return -1;3416 }3417 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {3418 strbuf_addf(err,3419 "Trying to write non-commit object %s to branch %s",3420 sha1_to_hex(sha1), lock->ref_name);3421 unlock_ref(lock);3422 return -1;3423 }3424 fd = get_lock_file_fd(lock->lk);3425 if (write_in_full(fd, sha1_to_hex(sha1), 40) != 40 ||3426 write_in_full(fd, &term, 1) != 1 ||3427 close_ref(lock) < 0) {3428 strbuf_addf(err,3429 "Couldn't write %s", get_lock_file_path(lock->lk));3430 unlock_ref(lock);3431 return -1;3432 }3433 return 0;3434}34353436/*3437 * Commit a change to a loose reference that has already been written3438 * to the loose reference lockfile. Also update the reflogs if3439 * necessary, using the specified lockmsg (which can be NULL).3440 */3441static int commit_ref_update(struct ref_lock *lock,3442 const unsigned char *sha1, const char *logmsg,3443 int flags, struct strbuf *err)3444{3445 clear_loose_ref_cache(&ref_cache);3446 if (log_ref_write(lock->ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) < 0 ||3447 (strcmp(lock->ref_name, lock->orig_ref_name) &&3448 log_ref_write(lock->orig_ref_name, lock->old_oid.hash, sha1, logmsg, flags, err) < 0)) {3449 char *old_msg = strbuf_detach(err, NULL);3450 strbuf_addf(err, "Cannot update the ref '%s': %s",3451 lock->ref_name, old_msg);3452 free(old_msg);3453 unlock_ref(lock);3454 return -1;3455 }3456 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {3457 /*3458 * Special hack: If a branch is updated directly and HEAD3459 * points to it (may happen on the remote side of a push3460 * for example) then logically the HEAD reflog should be3461 * updated too.3462 * A generic solution implies reverse symref information,3463 * but finding all symrefs pointing to the given branch3464 * would be rather costly for this rare event (the direct3465 * update of a branch) to be worth it. So let's cheat and3466 * check with HEAD only which should cover 99% of all usage3467 * scenarios (even 100% of the default ones).3468 */3469 unsigned char head_sha1[20];3470 int head_flag;3471 const char *head_ref;3472 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3473 head_sha1, &head_flag);3474 if (head_ref && (head_flag & REF_ISSYMREF) &&3475 !strcmp(head_ref, lock->ref_name)) {3476 struct strbuf log_err = STRBUF_INIT;3477 if (log_ref_write("HEAD", lock->old_oid.hash, sha1,3478 logmsg, 0, &log_err)) {3479 error("%s", log_err.buf);3480 strbuf_release(&log_err);3481 }3482 }3483 }3484 if (commit_ref(lock)) {3485 error("Couldn't set %s", lock->ref_name);3486 unlock_ref(lock);3487 return -1;3488 }34893490 unlock_ref(lock);3491 return 0;3492}34933494int create_symref(const char *ref_target, const char *refs_heads_master,3495 const char *logmsg)3496{3497 char *lockpath = NULL;3498 char ref[1000];3499 int fd, len, written;3500 char *git_HEAD = git_pathdup("%s", ref_target);3501 unsigned char old_sha1[20], new_sha1[20];3502 struct strbuf err = STRBUF_INIT;35033504 if (logmsg && read_ref(ref_target, old_sha1))3505 hashclr(old_sha1);35063507 if (safe_create_leading_directories(git_HEAD) < 0)3508 return error("unable to create directory for %s", git_HEAD);35093510#ifndef NO_SYMLINK_HEAD3511 if (prefer_symlink_refs) {3512 unlink(git_HEAD);3513 if (!symlink(refs_heads_master, git_HEAD))3514 goto done;3515 fprintf(stderr, "no symlink - falling back to symbolic ref\n");3516 }3517#endif35183519 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);3520 if (sizeof(ref) <= len) {3521 error("refname too long: %s", refs_heads_master);3522 goto error_free_return;3523 }3524 lockpath = mkpathdup("%s.lock", git_HEAD);3525 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);3526 if (fd < 0) {3527 error("Unable to open %s for writing", lockpath);3528 goto error_free_return;3529 }3530 written = write_in_full(fd, ref, len);3531 if (close(fd) != 0 || written != len) {3532 error("Unable to write to %s", lockpath);3533 goto error_unlink_return;3534 }3535 if (rename(lockpath, git_HEAD) < 0) {3536 error("Unable to create %s", git_HEAD);3537 goto error_unlink_return;3538 }3539 if (adjust_shared_perm(git_HEAD)) {3540 error("Unable to fix permissions on %s", lockpath);3541 error_unlink_return:3542 unlink_or_warn(lockpath);3543 error_free_return:3544 free(lockpath);3545 free(git_HEAD);3546 return -1;3547 }3548 free(lockpath);35493550#ifndef NO_SYMLINK_HEAD3551 done:3552#endif3553 if (logmsg && !read_ref(refs_heads_master, new_sha1) &&3554 log_ref_write(ref_target, old_sha1, new_sha1, logmsg, 0, &err)) {3555 error("%s", err.buf);3556 strbuf_release(&err);3557 }35583559 free(git_HEAD);3560 return 0;3561}35623563struct read_ref_at_cb {3564 const char *refname;3565 unsigned long at_time;3566 int cnt;3567 int reccnt;3568 unsigned char *sha1;3569 int found_it;35703571 unsigned char osha1[20];3572 unsigned char nsha1[20];3573 int tz;3574 unsigned long date;3575 char **msg;3576 unsigned long *cutoff_time;3577 int *cutoff_tz;3578 int *cutoff_cnt;3579};35803581static int read_ref_at_ent(unsigned char *osha1, unsigned char *nsha1,3582 const char *email, unsigned long timestamp, int tz,3583 const char *message, void *cb_data)3584{3585 struct read_ref_at_cb *cb = cb_data;35863587 cb->reccnt++;3588 cb->tz = tz;3589 cb->date = timestamp;35903591 if (timestamp <= cb->at_time || cb->cnt == 0) {3592 if (cb->msg)3593 *cb->msg = xstrdup(message);3594 if (cb->cutoff_time)3595 *cb->cutoff_time = timestamp;3596 if (cb->cutoff_tz)3597 *cb->cutoff_tz = tz;3598 if (cb->cutoff_cnt)3599 *cb->cutoff_cnt = cb->reccnt - 1;3600 /*3601 * we have not yet updated cb->[n|o]sha1 so they still3602 * hold the values for the previous record.3603 */3604 if (!is_null_sha1(cb->osha1)) {3605 hashcpy(cb->sha1, nsha1);3606 if (hashcmp(cb->osha1, nsha1))3607 warning("Log for ref %s has gap after %s.",3608 cb->refname, show_date(cb->date, cb->tz, DATE_MODE(RFC2822)));3609 }3610 else if (cb->date == cb->at_time)3611 hashcpy(cb->sha1, nsha1);3612 else if (hashcmp(nsha1, cb->sha1))3613 warning("Log for ref %s unexpectedly ended on %s.",3614 cb->refname, show_date(cb->date, cb->tz,3615 DATE_MODE(RFC2822)));3616 hashcpy(cb->osha1, osha1);3617 hashcpy(cb->nsha1, nsha1);3618 cb->found_it = 1;3619 return 1;3620 }3621 hashcpy(cb->osha1, osha1);3622 hashcpy(cb->nsha1, nsha1);3623 if (cb->cnt > 0)3624 cb->cnt--;3625 return 0;3626}36273628static int read_ref_at_ent_oldest(unsigned char *osha1, unsigned char *nsha1,3629 const char *email, unsigned long timestamp,3630 int tz, const char *message, void *cb_data)3631{3632 struct read_ref_at_cb *cb = cb_data;36333634 if (cb->msg)3635 *cb->msg = xstrdup(message);3636 if (cb->cutoff_time)3637 *cb->cutoff_time = timestamp;3638 if (cb->cutoff_tz)3639 *cb->cutoff_tz = tz;3640 if (cb->cutoff_cnt)3641 *cb->cutoff_cnt = cb->reccnt;3642 hashcpy(cb->sha1, osha1);3643 if (is_null_sha1(cb->sha1))3644 hashcpy(cb->sha1, nsha1);3645 /* We just want the first entry */3646 return 1;3647}36483649int read_ref_at(const char *refname, unsigned int flags, unsigned long at_time, int cnt,3650 unsigned char *sha1, char **msg,3651 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)3652{3653 struct read_ref_at_cb cb;36543655 memset(&cb, 0, sizeof(cb));3656 cb.refname = refname;3657 cb.at_time = at_time;3658 cb.cnt = cnt;3659 cb.msg = msg;3660 cb.cutoff_time = cutoff_time;3661 cb.cutoff_tz = cutoff_tz;3662 cb.cutoff_cnt = cutoff_cnt;3663 cb.sha1 = sha1;36643665 for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);36663667 if (!cb.reccnt) {3668 if (flags & GET_SHA1_QUIETLY)3669 exit(128);3670 else3671 die("Log for %s is empty.", refname);3672 }3673 if (cb.found_it)3674 return 0;36753676 for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);36773678 return 1;3679}36803681int reflog_exists(const char *refname)3682{3683 struct stat st;36843685 return !lstat(git_path("logs/%s", refname), &st) &&3686 S_ISREG(st.st_mode);3687}36883689int delete_reflog(const char *refname)3690{3691 return remove_path(git_path("logs/%s", refname));3692}36933694static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)3695{3696 unsigned char osha1[20], nsha1[20];3697 char *email_end, *message;3698 unsigned long timestamp;3699 int tz;37003701 /* old SP new SP name <email> SP time TAB msg LF */3702 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||3703 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||3704 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||3705 !(email_end = strchr(sb->buf + 82, '>')) ||3706 email_end[1] != ' ' ||3707 !(timestamp = strtoul(email_end + 2, &message, 10)) ||3708 !message || message[0] != ' ' ||3709 (message[1] != '+' && message[1] != '-') ||3710 !isdigit(message[2]) || !isdigit(message[3]) ||3711 !isdigit(message[4]) || !isdigit(message[5]))3712 return 0; /* corrupt? */3713 email_end[1] = '\0';3714 tz = strtol(message + 1, NULL, 10);3715 if (message[6] != '\t')3716 message += 6;3717 else3718 message += 7;3719 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);3720}37213722static char *find_beginning_of_line(char *bob, char *scan)3723{3724 while (bob < scan && *(--scan) != '\n')3725 ; /* keep scanning backwards */3726 /*3727 * Return either beginning of the buffer, or LF at the end of3728 * the previous line.3729 */3730 return scan;3731}37323733int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)3734{3735 struct strbuf sb = STRBUF_INIT;3736 FILE *logfp;3737 long pos;3738 int ret = 0, at_tail = 1;37393740 logfp = fopen(git_path("logs/%s", refname), "r");3741 if (!logfp)3742 return -1;37433744 /* Jump to the end */3745 if (fseek(logfp, 0, SEEK_END) < 0)3746 return error("cannot seek back reflog for %s: %s",3747 refname, strerror(errno));3748 pos = ftell(logfp);3749 while (!ret && 0 < pos) {3750 int cnt;3751 size_t nread;3752 char buf[BUFSIZ];3753 char *endp, *scanp;37543755 /* Fill next block from the end */3756 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;3757 if (fseek(logfp, pos - cnt, SEEK_SET))3758 return error("cannot seek back reflog for %s: %s",3759 refname, strerror(errno));3760 nread = fread(buf, cnt, 1, logfp);3761 if (nread != 1)3762 return error("cannot read %d bytes from reflog for %s: %s",3763 cnt, refname, strerror(errno));3764 pos -= cnt;37653766 scanp = endp = buf + cnt;3767 if (at_tail && scanp[-1] == '\n')3768 /* Looking at the final LF at the end of the file */3769 scanp--;3770 at_tail = 0;37713772 while (buf < scanp) {3773 /*3774 * terminating LF of the previous line, or the beginning3775 * of the buffer.3776 */3777 char *bp;37783779 bp = find_beginning_of_line(buf, scanp);37803781 if (*bp == '\n') {3782 /*3783 * The newline is the end of the previous line,3784 * so we know we have complete line starting3785 * at (bp + 1). Prefix it onto any prior data3786 * we collected for the line and process it.3787 */3788 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));3789 scanp = bp;3790 endp = bp + 1;3791 ret = show_one_reflog_ent(&sb, fn, cb_data);3792 strbuf_reset(&sb);3793 if (ret)3794 break;3795 } else if (!pos) {3796 /*3797 * We are at the start of the buffer, and the3798 * start of the file; there is no previous3799 * line, and we have everything for this one.3800 * Process it, and we can end the loop.3801 */3802 strbuf_splice(&sb, 0, 0, buf, endp - buf);3803 ret = show_one_reflog_ent(&sb, fn, cb_data);3804 strbuf_reset(&sb);3805 break;3806 }38073808 if (bp == buf) {3809 /*3810 * We are at the start of the buffer, and there3811 * is more file to read backwards. Which means3812 * we are in the middle of a line. Note that we3813 * may get here even if *bp was a newline; that3814 * just means we are at the exact end of the3815 * previous line, rather than some spot in the3816 * middle.3817 *3818 * Save away what we have to be combined with3819 * the data from the next read.3820 */3821 strbuf_splice(&sb, 0, 0, buf, endp - buf);3822 break;3823 }3824 }38253826 }3827 if (!ret && sb.len)3828 die("BUG: reverse reflog parser had leftover data");38293830 fclose(logfp);3831 strbuf_release(&sb);3832 return ret;3833}38343835int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)3836{3837 FILE *logfp;3838 struct strbuf sb = STRBUF_INIT;3839 int ret = 0;38403841 logfp = fopen(git_path("logs/%s", refname), "r");3842 if (!logfp)3843 return -1;38443845 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))3846 ret = show_one_reflog_ent(&sb, fn, cb_data);3847 fclose(logfp);3848 strbuf_release(&sb);3849 return ret;3850}3851/*3852 * Call fn for each reflog in the namespace indicated by name. name3853 * must be empty or end with '/'. Name will be used as a scratch3854 * space, but its contents will be restored before return.3855 */3856static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)3857{3858 DIR *d = opendir(git_path("logs/%s", name->buf));3859 int retval = 0;3860 struct dirent *de;3861 int oldlen = name->len;38623863 if (!d)3864 return name->len ? errno : 0;38653866 while ((de = readdir(d)) != NULL) {3867 struct stat st;38683869 if (de->d_name[0] == '.')3870 continue;3871 if (ends_with(de->d_name, ".lock"))3872 continue;3873 strbuf_addstr(name, de->d_name);3874 if (stat(git_path("logs/%s", name->buf), &st) < 0) {3875 ; /* silently ignore */3876 } else {3877 if (S_ISDIR(st.st_mode)) {3878 strbuf_addch(name, '/');3879 retval = do_for_each_reflog(name, fn, cb_data);3880 } else {3881 struct object_id oid;38823883 if (read_ref_full(name->buf, 0, oid.hash, NULL))3884 retval = error("bad ref for %s", name->buf);3885 else3886 retval = fn(name->buf, &oid, 0, cb_data);3887 }3888 if (retval)3889 break;3890 }3891 strbuf_setlen(name, oldlen);3892 }3893 closedir(d);3894 return retval;3895}38963897int for_each_reflog(each_ref_fn fn, void *cb_data)3898{3899 int retval;3900 struct strbuf name;3901 strbuf_init(&name, PATH_MAX);3902 retval = do_for_each_reflog(&name, fn, cb_data);3903 strbuf_release(&name);3904 return retval;3905}39063907/**3908 * Information needed for a single ref update. Set new_sha1 to the new3909 * value or to null_sha1 to delete the ref. To check the old value3910 * while the ref is locked, set (flags & REF_HAVE_OLD) and set3911 * old_sha1 to the old value, or to null_sha1 to ensure the ref does3912 * not exist before update.3913 */3914struct ref_update {3915 /*3916 * If (flags & REF_HAVE_NEW), set the reference to this value:3917 */3918 unsigned char new_sha1[20];3919 /*3920 * If (flags & REF_HAVE_OLD), check that the reference3921 * previously had this value:3922 */3923 unsigned char old_sha1[20];3924 /*3925 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,3926 * REF_DELETING, and REF_ISPRUNING:3927 */3928 unsigned int flags;3929 struct ref_lock *lock;3930 int type;3931 char *msg;3932 const char refname[FLEX_ARRAY];3933};39343935/*3936 * Transaction states.3937 * OPEN: The transaction is in a valid state and can accept new updates.3938 * An OPEN transaction can be committed.3939 * CLOSED: A closed transaction is no longer active and no other operations3940 * than free can be used on it in this state.3941 * A transaction can either become closed by successfully committing3942 * an active transaction or if there is a failure while building3943 * the transaction thus rendering it failed/inactive.3944 */3945enum ref_transaction_state {3946 REF_TRANSACTION_OPEN = 0,3947 REF_TRANSACTION_CLOSED = 13948};39493950/*3951 * Data structure for holding a reference transaction, which can3952 * consist of checks and updates to multiple references, carried out3953 * as atomically as possible. This structure is opaque to callers.3954 */3955struct ref_transaction {3956 struct ref_update **updates;3957 size_t alloc;3958 size_t nr;3959 enum ref_transaction_state state;3960};39613962struct ref_transaction *ref_transaction_begin(struct strbuf *err)3963{3964 assert(err);39653966 return xcalloc(1, sizeof(struct ref_transaction));3967}39683969void ref_transaction_free(struct ref_transaction *transaction)3970{3971 int i;39723973 if (!transaction)3974 return;39753976 for (i = 0; i < transaction->nr; i++) {3977 free(transaction->updates[i]->msg);3978 free(transaction->updates[i]);3979 }3980 free(transaction->updates);3981 free(transaction);3982}39833984static struct ref_update *add_update(struct ref_transaction *transaction,3985 const char *refname)3986{3987 size_t len = strlen(refname) + 1;3988 struct ref_update *update = xcalloc(1, sizeof(*update) + len);39893990 memcpy((char *)update->refname, refname, len); /* includes NUL */3991 ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);3992 transaction->updates[transaction->nr++] = update;3993 return update;3994}39953996int ref_transaction_update(struct ref_transaction *transaction,3997 const char *refname,3998 const unsigned char *new_sha1,3999 const unsigned char *old_sha1,4000 unsigned int flags, const char *msg,4001 struct strbuf *err)4002{4003 struct ref_update *update;40044005 assert(err);40064007 if (transaction->state != REF_TRANSACTION_OPEN)4008 die("BUG: update called for transaction that is not open");40094010 if (new_sha1 && !is_null_sha1(new_sha1) &&4011 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {4012 strbuf_addf(err, "refusing to update ref with bad name %s",4013 refname);4014 return -1;4015 }40164017 update = add_update(transaction, refname);4018 if (new_sha1) {4019 hashcpy(update->new_sha1, new_sha1);4020 flags |= REF_HAVE_NEW;4021 }4022 if (old_sha1) {4023 hashcpy(update->old_sha1, old_sha1);4024 flags |= REF_HAVE_OLD;4025 }4026 update->flags = flags;4027 if (msg)4028 update->msg = xstrdup(msg);4029 return 0;4030}40314032int ref_transaction_create(struct ref_transaction *transaction,4033 const char *refname,4034 const unsigned char *new_sha1,4035 unsigned int flags, const char *msg,4036 struct strbuf *err)4037{4038 if (!new_sha1 || is_null_sha1(new_sha1))4039 die("BUG: create called without valid new_sha1");4040 return ref_transaction_update(transaction, refname, new_sha1,4041 null_sha1, flags, msg, err);4042}40434044int ref_transaction_delete(struct ref_transaction *transaction,4045 const char *refname,4046 const unsigned char *old_sha1,4047 unsigned int flags, const char *msg,4048 struct strbuf *err)4049{4050 if (old_sha1 && is_null_sha1(old_sha1))4051 die("BUG: delete called with old_sha1 set to zeros");4052 return ref_transaction_update(transaction, refname,4053 null_sha1, old_sha1,4054 flags, msg, err);4055}40564057int ref_transaction_verify(struct ref_transaction *transaction,4058 const char *refname,4059 const unsigned char *old_sha1,4060 unsigned int flags,4061 struct strbuf *err)4062{4063 if (!old_sha1)4064 die("BUG: verify called with old_sha1 set to NULL");4065 return ref_transaction_update(transaction, refname,4066 NULL, old_sha1,4067 flags, NULL, err);4068}40694070int update_ref(const char *msg, const char *refname,4071 const unsigned char *new_sha1, const unsigned char *old_sha1,4072 unsigned int flags, enum action_on_err onerr)4073{4074 struct ref_transaction *t = NULL;4075 struct strbuf err = STRBUF_INIT;4076 int ret = 0;40774078 if (ref_type(refname) == REF_TYPE_PSEUDOREF) {4079 ret = write_pseudoref(refname, new_sha1, old_sha1, &err);4080 } else {4081 t = ref_transaction_begin(&err);4082 if (!t ||4083 ref_transaction_update(t, refname, new_sha1, old_sha1,4084 flags, msg, &err) ||4085 ref_transaction_commit(t, &err)) {4086 ret = 1;4087 ref_transaction_free(t);4088 }4089 }4090 if (ret) {4091 const char *str = "update_ref failed for ref '%s': %s";40924093 switch (onerr) {4094 case UPDATE_REFS_MSG_ON_ERR:4095 error(str, refname, err.buf);4096 break;4097 case UPDATE_REFS_DIE_ON_ERR:4098 die(str, refname, err.buf);4099 break;4100 case UPDATE_REFS_QUIET_ON_ERR:4101 break;4102 }4103 strbuf_release(&err);4104 return 1;4105 }4106 strbuf_release(&err);4107 if (t)4108 ref_transaction_free(t);4109 return 0;4110}41114112static int ref_update_reject_duplicates(struct string_list *refnames,4113 struct strbuf *err)4114{4115 int i, n = refnames->nr;41164117 assert(err);41184119 for (i = 1; i < n; i++)4120 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {4121 strbuf_addf(err,4122 "Multiple updates for ref '%s' not allowed.",4123 refnames->items[i].string);4124 return 1;4125 }4126 return 0;4127}41284129int ref_transaction_commit(struct ref_transaction *transaction,4130 struct strbuf *err)4131{4132 int ret = 0, i;4133 int n = transaction->nr;4134 struct ref_update **updates = transaction->updates;4135 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;4136 struct string_list_item *ref_to_delete;4137 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;41384139 assert(err);41404141 if (transaction->state != REF_TRANSACTION_OPEN)4142 die("BUG: commit called for transaction that is not open");41434144 if (!n) {4145 transaction->state = REF_TRANSACTION_CLOSED;4146 return 0;4147 }41484149 /* Fail if a refname appears more than once in the transaction: */4150 for (i = 0; i < n; i++)4151 string_list_append(&affected_refnames, updates[i]->refname);4152 string_list_sort(&affected_refnames);4153 if (ref_update_reject_duplicates(&affected_refnames, err)) {4154 ret = TRANSACTION_GENERIC_ERROR;4155 goto cleanup;4156 }41574158 /*4159 * Acquire all locks, verify old values if provided, check4160 * that new values are valid, and write new values to the4161 * lockfiles, ready to be activated. Only keep one lockfile4162 * open at a time to avoid running out of file descriptors.4163 */4164 for (i = 0; i < n; i++) {4165 struct ref_update *update = updates[i];41664167 if ((update->flags & REF_HAVE_NEW) &&4168 is_null_sha1(update->new_sha1))4169 update->flags |= REF_DELETING;4170 update->lock = lock_ref_sha1_basic(4171 update->refname,4172 ((update->flags & REF_HAVE_OLD) ?4173 update->old_sha1 : NULL),4174 &affected_refnames, NULL,4175 update->flags,4176 &update->type,4177 err);4178 if (!update->lock) {4179 char *reason;41804181 ret = (errno == ENOTDIR)4182 ? TRANSACTION_NAME_CONFLICT4183 : TRANSACTION_GENERIC_ERROR;4184 reason = strbuf_detach(err, NULL);4185 strbuf_addf(err, "cannot lock ref '%s': %s",4186 update->refname, reason);4187 free(reason);4188 goto cleanup;4189 }4190 if ((update->flags & REF_HAVE_NEW) &&4191 !(update->flags & REF_DELETING)) {4192 int overwriting_symref = ((update->type & REF_ISSYMREF) &&4193 (update->flags & REF_NODEREF));41944195 if (!overwriting_symref &&4196 !hashcmp(update->lock->old_oid.hash, update->new_sha1)) {4197 /*4198 * The reference already has the desired4199 * value, so we don't need to write it.4200 */4201 } else if (write_ref_to_lockfile(update->lock,4202 update->new_sha1,4203 err)) {4204 char *write_err = strbuf_detach(err, NULL);42054206 /*4207 * The lock was freed upon failure of4208 * write_ref_to_lockfile():4209 */4210 update->lock = NULL;4211 strbuf_addf(err,4212 "cannot update the ref '%s': %s",4213 update->refname, write_err);4214 free(write_err);4215 ret = TRANSACTION_GENERIC_ERROR;4216 goto cleanup;4217 } else {4218 update->flags |= REF_NEEDS_COMMIT;4219 }4220 }4221 if (!(update->flags & REF_NEEDS_COMMIT)) {4222 /*4223 * We didn't have to write anything to the lockfile.4224 * Close it to free up the file descriptor:4225 */4226 if (close_ref(update->lock)) {4227 strbuf_addf(err, "Couldn't close %s.lock",4228 update->refname);4229 goto cleanup;4230 }4231 }4232 }42334234 /* Perform updates first so live commits remain referenced */4235 for (i = 0; i < n; i++) {4236 struct ref_update *update = updates[i];42374238 if (update->flags & REF_NEEDS_COMMIT) {4239 if (commit_ref_update(update->lock,4240 update->new_sha1, update->msg,4241 update->flags, err)) {4242 /* freed by commit_ref_update(): */4243 update->lock = NULL;4244 ret = TRANSACTION_GENERIC_ERROR;4245 goto cleanup;4246 } else {4247 /* freed by commit_ref_update(): */4248 update->lock = NULL;4249 }4250 }4251 }42524253 /* Perform deletes now that updates are safely completed */4254 for (i = 0; i < n; i++) {4255 struct ref_update *update = updates[i];42564257 if (update->flags & REF_DELETING) {4258 if (delete_ref_loose(update->lock, update->type, err)) {4259 ret = TRANSACTION_GENERIC_ERROR;4260 goto cleanup;4261 }42624263 if (!(update->flags & REF_ISPRUNING))4264 string_list_append(&refs_to_delete,4265 update->lock->ref_name);4266 }4267 }42684269 if (repack_without_refs(&refs_to_delete, err)) {4270 ret = TRANSACTION_GENERIC_ERROR;4271 goto cleanup;4272 }4273 for_each_string_list_item(ref_to_delete, &refs_to_delete)4274 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));4275 clear_loose_ref_cache(&ref_cache);42764277cleanup:4278 transaction->state = REF_TRANSACTION_CLOSED;42794280 for (i = 0; i < n; i++)4281 if (updates[i]->lock)4282 unlock_ref(updates[i]->lock);4283 string_list_clear(&refs_to_delete, 0);4284 string_list_clear(&affected_refnames, 0);4285 return ret;4286}42874288static int ref_present(const char *refname,4289 const struct object_id *oid, int flags, void *cb_data)4290{4291 struct string_list *affected_refnames = cb_data;42924293 return string_list_has_string(affected_refnames, refname);4294}42954296int initial_ref_transaction_commit(struct ref_transaction *transaction,4297 struct strbuf *err)4298{4299 struct ref_dir *loose_refs = get_loose_refs(&ref_cache);4300 struct ref_dir *packed_refs = get_packed_refs(&ref_cache);4301 int ret = 0, i;4302 int n = transaction->nr;4303 struct ref_update **updates = transaction->updates;4304 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;43054306 assert(err);43074308 if (transaction->state != REF_TRANSACTION_OPEN)4309 die("BUG: commit called for transaction that is not open");43104311 /* Fail if a refname appears more than once in the transaction: */4312 for (i = 0; i < n; i++)4313 string_list_append(&affected_refnames, updates[i]->refname);4314 string_list_sort(&affected_refnames);4315 if (ref_update_reject_duplicates(&affected_refnames, err)) {4316 ret = TRANSACTION_GENERIC_ERROR;4317 goto cleanup;4318 }43194320 /*4321 * It's really undefined to call this function in an active4322 * repository or when there are existing references: we are4323 * only locking and changing packed-refs, so (1) any4324 * simultaneous processes might try to change a reference at4325 * the same time we do, and (2) any existing loose versions of4326 * the references that we are setting would have precedence4327 * over our values. But some remote helpers create the remote4328 * "HEAD" and "master" branches before calling this function,4329 * so here we really only check that none of the references4330 * that we are creating already exists.4331 */4332 if (for_each_rawref(ref_present, &affected_refnames))4333 die("BUG: initial ref transaction called with existing refs");43344335 for (i = 0; i < n; i++) {4336 struct ref_update *update = updates[i];43374338 if ((update->flags & REF_HAVE_OLD) &&4339 !is_null_sha1(update->old_sha1))4340 die("BUG: initial ref transaction with old_sha1 set");4341 if (verify_refname_available(update->refname,4342 &affected_refnames, NULL,4343 loose_refs, err) ||4344 verify_refname_available(update->refname,4345 &affected_refnames, NULL,4346 packed_refs, err)) {4347 ret = TRANSACTION_NAME_CONFLICT;4348 goto cleanup;4349 }4350 }43514352 if (lock_packed_refs(0)) {4353 strbuf_addf(err, "unable to lock packed-refs file: %s",4354 strerror(errno));4355 ret = TRANSACTION_GENERIC_ERROR;4356 goto cleanup;4357 }43584359 for (i = 0; i < n; i++) {4360 struct ref_update *update = updates[i];43614362 if ((update->flags & REF_HAVE_NEW) &&4363 !is_null_sha1(update->new_sha1))4364 add_packed_ref(update->refname, update->new_sha1);4365 }43664367 if (commit_packed_refs()) {4368 strbuf_addf(err, "unable to commit packed-refs file: %s",4369 strerror(errno));4370 ret = TRANSACTION_GENERIC_ERROR;4371 goto cleanup;4372 }43734374cleanup:4375 transaction->state = REF_TRANSACTION_CLOSED;4376 string_list_clear(&affected_refnames, 0);4377 return ret;4378}43794380char *shorten_unambiguous_ref(const char *refname, int strict)4381{4382 int i;4383 static char **scanf_fmts;4384 static int nr_rules;4385 char *short_name;43864387 if (!nr_rules) {4388 /*4389 * Pre-generate scanf formats from ref_rev_parse_rules[].4390 * Generate a format suitable for scanf from a4391 * ref_rev_parse_rules rule by interpolating "%s" at the4392 * location of the "%.*s".4393 */4394 size_t total_len = 0;4395 size_t offset = 0;43964397 /* the rule list is NULL terminated, count them first */4398 for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)4399 /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */4400 total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;44014402 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);44034404 offset = 0;4405 for (i = 0; i < nr_rules; i++) {4406 assert(offset < total_len);4407 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;4408 offset += snprintf(scanf_fmts[i], total_len - offset,4409 ref_rev_parse_rules[i], 2, "%s") + 1;4410 }4411 }44124413 /* bail out if there are no rules */4414 if (!nr_rules)4415 return xstrdup(refname);44164417 /* buffer for scanf result, at most refname must fit */4418 short_name = xstrdup(refname);44194420 /* skip first rule, it will always match */4421 for (i = nr_rules - 1; i > 0 ; --i) {4422 int j;4423 int rules_to_fail = i;4424 int short_name_len;44254426 if (1 != sscanf(refname, scanf_fmts[i], short_name))4427 continue;44284429 short_name_len = strlen(short_name);44304431 /*4432 * in strict mode, all (except the matched one) rules4433 * must fail to resolve to a valid non-ambiguous ref4434 */4435 if (strict)4436 rules_to_fail = nr_rules;44374438 /*4439 * check if the short name resolves to a valid ref,4440 * but use only rules prior to the matched one4441 */4442 for (j = 0; j < rules_to_fail; j++) {4443 const char *rule = ref_rev_parse_rules[j];4444 char refname[PATH_MAX];44454446 /* skip matched rule */4447 if (i == j)4448 continue;44494450 /*4451 * the short name is ambiguous, if it resolves4452 * (with this previous rule) to a valid ref4453 * read_ref() returns 0 on success4454 */4455 mksnpath(refname, sizeof(refname),4456 rule, short_name_len, short_name);4457 if (ref_exists(refname))4458 break;4459 }44604461 /*4462 * short name is non-ambiguous if all previous rules4463 * haven't resolved to a valid ref4464 */4465 if (j == rules_to_fail)4466 return short_name;4467 }44684469 free(short_name);4470 return xstrdup(refname);4471}44724473static struct string_list *hide_refs;44744475int parse_hide_refs_config(const char *var, const char *value, const char *section)4476{4477 if (!strcmp("transfer.hiderefs", var) ||4478 /* NEEDSWORK: use parse_config_key() once both are merged */4479 (starts_with(var, section) && var[strlen(section)] == '.' &&4480 !strcmp(var + strlen(section), ".hiderefs"))) {4481 char *ref;4482 int len;44834484 if (!value)4485 return config_error_nonbool(var);4486 ref = xstrdup(value);4487 len = strlen(ref);4488 while (len && ref[len - 1] == '/')4489 ref[--len] = '\0';4490 if (!hide_refs) {4491 hide_refs = xcalloc(1, sizeof(*hide_refs));4492 hide_refs->strdup_strings = 1;4493 }4494 string_list_append(hide_refs, ref);4495 }4496 return 0;4497}44984499int ref_is_hidden(const char *refname)4500{4501 int i;45024503 if (!hide_refs)4504 return 0;4505 for (i = hide_refs->nr - 1; i >= 0; i--) {4506 const char *match = hide_refs->items[i].string;4507 int neg = 0;4508 int len;45094510 if (*match == '!') {4511 neg = 1;4512 match++;4513 }45144515 if (!starts_with(refname, match))4516 continue;4517 len = strlen(match);4518 if (!refname[len] || refname[len] == '/')4519 return !neg;4520 }4521 return 0;4522}45234524struct expire_reflog_cb {4525 unsigned int flags;4526 reflog_expiry_should_prune_fn *should_prune_fn;4527 void *policy_cb;4528 FILE *newlog;4529 unsigned char last_kept_sha1[20];4530};45314532static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,4533 const char *email, unsigned long timestamp, int tz,4534 const char *message, void *cb_data)4535{4536 struct expire_reflog_cb *cb = cb_data;4537 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;45384539 if (cb->flags & EXPIRE_REFLOGS_REWRITE)4540 osha1 = cb->last_kept_sha1;45414542 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,4543 message, policy_cb)) {4544 if (!cb->newlog)4545 printf("would prune %s", message);4546 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)4547 printf("prune %s", message);4548 } else {4549 if (cb->newlog) {4550 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",4551 sha1_to_hex(osha1), sha1_to_hex(nsha1),4552 email, timestamp, tz, message);4553 hashcpy(cb->last_kept_sha1, nsha1);4554 }4555 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)4556 printf("keep %s", message);4557 }4558 return 0;4559}45604561int reflog_expire(const char *refname, const unsigned char *sha1,4562 unsigned int flags,4563 reflog_expiry_prepare_fn prepare_fn,4564 reflog_expiry_should_prune_fn should_prune_fn,4565 reflog_expiry_cleanup_fn cleanup_fn,4566 void *policy_cb_data)4567{4568 static struct lock_file reflog_lock;4569 struct expire_reflog_cb cb;4570 struct ref_lock *lock;4571 char *log_file;4572 int status = 0;4573 int type;4574 struct strbuf err = STRBUF_INIT;45754576 memset(&cb, 0, sizeof(cb));4577 cb.flags = flags;4578 cb.policy_cb = policy_cb_data;4579 cb.should_prune_fn = should_prune_fn;45804581 /*4582 * The reflog file is locked by holding the lock on the4583 * reference itself, plus we might need to update the4584 * reference if --updateref was specified:4585 */4586 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, 0, &type, &err);4587 if (!lock) {4588 error("cannot lock ref '%s': %s", refname, err.buf);4589 strbuf_release(&err);4590 return -1;4591 }4592 if (!reflog_exists(refname)) {4593 unlock_ref(lock);4594 return 0;4595 }45964597 log_file = git_pathdup("logs/%s", refname);4598 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4599 /*4600 * Even though holding $GIT_DIR/logs/$reflog.lock has4601 * no locking implications, we use the lock_file4602 * machinery here anyway because it does a lot of the4603 * work we need, including cleaning up if the program4604 * exits unexpectedly.4605 */4606 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {4607 struct strbuf err = STRBUF_INIT;4608 unable_to_lock_message(log_file, errno, &err);4609 error("%s", err.buf);4610 strbuf_release(&err);4611 goto failure;4612 }4613 cb.newlog = fdopen_lock_file(&reflog_lock, "w");4614 if (!cb.newlog) {4615 error("cannot fdopen %s (%s)",4616 get_lock_file_path(&reflog_lock), strerror(errno));4617 goto failure;4618 }4619 }46204621 (*prepare_fn)(refname, sha1, cb.policy_cb);4622 for_each_reflog_ent(refname, expire_reflog_ent, &cb);4623 (*cleanup_fn)(cb.policy_cb);46244625 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4626 /*4627 * It doesn't make sense to adjust a reference pointed4628 * to by a symbolic ref based on expiring entries in4629 * the symbolic reference's reflog. Nor can we update4630 * a reference if there are no remaining reflog4631 * entries.4632 */4633 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4634 !(type & REF_ISSYMREF) &&4635 !is_null_sha1(cb.last_kept_sha1);46364637 if (close_lock_file(&reflog_lock)) {4638 status |= error("couldn't write %s: %s", log_file,4639 strerror(errno));4640 } else if (update &&4641 (write_in_full(get_lock_file_fd(lock->lk),4642 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||4643 write_str_in_full(get_lock_file_fd(lock->lk), "\n") != 1 ||4644 close_ref(lock) < 0)) {4645 status |= error("couldn't write %s",4646 get_lock_file_path(lock->lk));4647 rollback_lock_file(&reflog_lock);4648 } else if (commit_lock_file(&reflog_lock)) {4649 status |= error("unable to commit reflog '%s' (%s)",4650 log_file, strerror(errno));4651 } else if (update && commit_ref(lock)) {4652 status |= error("couldn't set %s", lock->ref_name);4653 }4654 }4655 free(log_file);4656 unlock_ref(lock);4657 return status;46584659 failure:4660 rollback_lock_file(&reflog_lock);4661 free(log_file);4662 unlock_ref(lock);4663 return -1;4664}