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 unsigned char old_sha1[20]; 14 int lock_fd; 15}; 16 17/* 18 * How to handle various characters in refnames: 19 * 0: An acceptable character for refs 20 * 1: End-of-component 21 * 2: ., look for a preceding . to reject .. in refs 22 * 3: {, look for a preceding @ to reject @{ in refs 23 * 4: A bad character: ASCII control characters, "~", "^", ":" or SP 24 */ 25static unsigned char refname_disposition[256] = { 26 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 27 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 28 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 2, 1, 29 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 0, 4, 30 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 31 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 4, 0, 4, 0, 32 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 33 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 4, 4 34}; 35 36/* 37 * Flag passed to lock_ref_sha1_basic() telling it to tolerate broken 38 * refs (i.e., because the reference is about to be deleted anyway). 39 */ 40#define REF_DELETING 0x02 41 42/* 43 * Used as a flag in ref_update::flags when a loose ref is being 44 * pruned. 45 */ 46#define REF_ISPRUNING 0x04 47 48/* 49 * Used as a flag in ref_update::flags when the reference should be 50 * updated to new_sha1. 51 */ 52#define REF_HAVE_NEW 0x08 53 54/* 55 * Used as a flag in ref_update::flags when old_sha1 should be 56 * checked. 57 */ 58#define REF_HAVE_OLD 0x10 59 60/* 61 * Try to read one refname component from the front of refname. 62 * Return the length of the component found, or -1 if the component is 63 * not legal. It is legal if it is something reasonable to have under 64 * ".git/refs/"; We do not like it if: 65 * 66 * - any path component of it begins with ".", or 67 * - it has double dots "..", or 68 * - it has ASCII control character, "~", "^", ":" or SP, anywhere, or 69 * - it ends with a "/". 70 * - it ends with ".lock" 71 * - it contains a "\" (backslash) 72 */ 73static int check_refname_component(const char *refname, int flags) 74{ 75 const char *cp; 76 char last = '\0'; 77 78 for (cp = refname; ; cp++) { 79 int ch = *cp & 255; 80 unsigned char disp = refname_disposition[ch]; 81 switch (disp) { 82 case 1: 83 goto out; 84 case 2: 85 if (last == '.') 86 return -1; /* Refname contains "..". */ 87 break; 88 case 3: 89 if (last == '@') 90 return -1; /* Refname contains "@{". */ 91 break; 92 case 4: 93 return -1; 94 } 95 last = ch; 96 } 97out: 98 if (cp == refname) 99 return 0; /* Component has zero length. */ 100 if (refname[0] == '.') 101 return -1; /* Component starts with '.'. */ 102 if (cp - refname >= LOCK_SUFFIX_LEN && 103 !memcmp(cp - LOCK_SUFFIX_LEN, LOCK_SUFFIX, LOCK_SUFFIX_LEN)) 104 return -1; /* Refname ends with ".lock". */ 105 return cp - refname; 106} 107 108int check_refname_format(const char *refname, int flags) 109{ 110 int component_len, component_count = 0; 111 112 if (!strcmp(refname, "@")) 113 /* Refname is a single character '@'. */ 114 return -1; 115 116 while (1) { 117 /* We are at the start of a path component. */ 118 component_len = check_refname_component(refname, flags); 119 if (component_len <= 0) { 120 if ((flags & REFNAME_REFSPEC_PATTERN) && 121 refname[0] == '*' && 122 (refname[1] == '\0' || refname[1] == '/')) { 123 /* Accept one wildcard as a full refname component. */ 124 flags &= ~REFNAME_REFSPEC_PATTERN; 125 component_len = 1; 126 } else { 127 return -1; 128 } 129 } 130 component_count++; 131 if (refname[component_len] == '\0') 132 break; 133 /* Skip to next component. */ 134 refname += component_len + 1; 135 } 136 137 if (refname[component_len - 1] == '.') 138 return -1; /* Refname ends with '.'. */ 139 if (!(flags & REFNAME_ALLOW_ONELEVEL) && component_count < 2) 140 return -1; /* Refname has only one component. */ 141 return 0; 142} 143 144struct ref_entry; 145 146/* 147 * Information used (along with the information in ref_entry) to 148 * describe a single cached reference. This data structure only 149 * occurs embedded in a union in struct ref_entry, and only when 150 * (ref_entry->flag & REF_DIR) is zero. 151 */ 152struct ref_value { 153 /* 154 * The name of the object to which this reference resolves 155 * (which may be a tag object). If REF_ISBROKEN, this is 156 * null. If REF_ISSYMREF, then this is the name of the object 157 * referred to by the last reference in the symlink chain. 158 */ 159 unsigned char sha1[20]; 160 161 /* 162 * If REF_KNOWS_PEELED, then this field holds the peeled value 163 * of this reference, or null if the reference is known not to 164 * be peelable. See the documentation for peel_ref() for an 165 * exact definition of "peelable". 166 */ 167 unsigned char peeled[20]; 168}; 169 170struct ref_cache; 171 172/* 173 * Information used (along with the information in ref_entry) to 174 * describe a level in the hierarchy of references. This data 175 * structure only occurs embedded in a union in struct ref_entry, and 176 * only when (ref_entry.flag & REF_DIR) is set. In that case, 177 * (ref_entry.flag & REF_INCOMPLETE) determines whether the references 178 * in the directory have already been read: 179 * 180 * (ref_entry.flag & REF_INCOMPLETE) unset -- a directory of loose 181 * or packed references, already read. 182 * 183 * (ref_entry.flag & REF_INCOMPLETE) set -- a directory of loose 184 * references that hasn't been read yet (nor has any of its 185 * subdirectories). 186 * 187 * Entries within a directory are stored within a growable array of 188 * pointers to ref_entries (entries, nr, alloc). Entries 0 <= i < 189 * sorted are sorted by their component name in strcmp() order and the 190 * remaining entries are unsorted. 191 * 192 * Loose references are read lazily, one directory at a time. When a 193 * directory of loose references is read, then all of the references 194 * in that directory are stored, and REF_INCOMPLETE stubs are created 195 * for any subdirectories, but the subdirectories themselves are not 196 * read. The reading is triggered by get_ref_dir(). 197 */ 198struct ref_dir { 199 int nr, alloc; 200 201 /* 202 * Entries with index 0 <= i < sorted are sorted by name. New 203 * entries are appended to the list unsorted, and are sorted 204 * only when required; thus we avoid the need to sort the list 205 * after the addition of every reference. 206 */ 207 int sorted; 208 209 /* A pointer to the ref_cache that contains this ref_dir. */ 210 struct ref_cache *ref_cache; 211 212 struct ref_entry **entries; 213}; 214 215/* 216 * Bit values for ref_entry::flag. REF_ISSYMREF=0x01, 217 * REF_ISPACKED=0x02, REF_ISBROKEN=0x04 and REF_BAD_NAME=0x08 are 218 * public values; see refs.h. 219 */ 220 221/* 222 * The field ref_entry->u.value.peeled of this value entry contains 223 * the correct peeled value for the reference, which might be 224 * null_sha1 if the reference is not a tag or if it is broken. 225 */ 226#define REF_KNOWS_PEELED 0x10 227 228/* ref_entry represents a directory of references */ 229#define REF_DIR 0x20 230 231/* 232 * Entry has not yet been read from disk (used only for REF_DIR 233 * entries representing loose references) 234 */ 235#define REF_INCOMPLETE 0x40 236 237/* 238 * A ref_entry represents either a reference or a "subdirectory" of 239 * references. 240 * 241 * Each directory in the reference namespace is represented by a 242 * ref_entry with (flags & REF_DIR) set and containing a subdir member 243 * that holds the entries in that directory that have been read so 244 * far. If (flags & REF_INCOMPLETE) is set, then the directory and 245 * its subdirectories haven't been read yet. REF_INCOMPLETE is only 246 * used for loose reference directories. 247 * 248 * References are represented by a ref_entry with (flags & REF_DIR) 249 * unset and a value member that describes the reference's value. The 250 * flag member is at the ref_entry level, but it is also needed to 251 * interpret the contents of the value field (in other words, a 252 * ref_value object is not very much use without the enclosing 253 * ref_entry). 254 * 255 * Reference names cannot end with slash and directories' names are 256 * always stored with a trailing slash (except for the top-level 257 * directory, which is always denoted by ""). This has two nice 258 * consequences: (1) when the entries in each subdir are sorted 259 * lexicographically by name (as they usually are), the references in 260 * a whole tree can be generated in lexicographic order by traversing 261 * the tree in left-to-right, depth-first order; (2) the names of 262 * references and subdirectories cannot conflict, and therefore the 263 * presence of an empty subdirectory does not block the creation of a 264 * similarly-named reference. (The fact that reference names with the 265 * same leading components can conflict *with each other* is a 266 * separate issue that is regulated by verify_refname_available().) 267 * 268 * Please note that the name field contains the fully-qualified 269 * reference (or subdirectory) name. Space could be saved by only 270 * storing the relative names. But that would require the full names 271 * to be generated on the fly when iterating in do_for_each_ref(), and 272 * would break callback functions, who have always been able to assume 273 * that the name strings that they are passed will not be freed during 274 * the iteration. 275 */ 276struct ref_entry { 277 unsigned char flag; /* ISSYMREF? ISPACKED? */ 278 union { 279 struct ref_value value; /* if not (flags&REF_DIR) */ 280 struct ref_dir subdir; /* if (flags&REF_DIR) */ 281 } u; 282 /* 283 * The full name of the reference (e.g., "refs/heads/master") 284 * or the full name of the directory with a trailing slash 285 * (e.g., "refs/heads/"): 286 */ 287 char name[FLEX_ARRAY]; 288}; 289 290static void read_loose_refs(const char *dirname, struct ref_dir *dir); 291 292static struct ref_dir *get_ref_dir(struct ref_entry *entry) 293{ 294 struct ref_dir *dir; 295 assert(entry->flag & REF_DIR); 296 dir = &entry->u.subdir; 297 if (entry->flag & REF_INCOMPLETE) { 298 read_loose_refs(entry->name, dir); 299 entry->flag &= ~REF_INCOMPLETE; 300 } 301 return dir; 302} 303 304/* 305 * Check if a refname is safe. 306 * For refs that start with "refs/" we consider it safe as long they do 307 * not try to resolve to outside of refs/. 308 * 309 * For all other refs we only consider them safe iff they only contain 310 * upper case characters and '_' (like "HEAD" AND "MERGE_HEAD", and not like 311 * "config"). 312 */ 313static int refname_is_safe(const char *refname) 314{ 315 if (starts_with(refname, "refs/")) { 316 char *buf; 317 int result; 318 319 buf = xmalloc(strlen(refname) + 1); 320 /* 321 * Does the refname try to escape refs/? 322 * For example: refs/foo/../bar is safe but refs/foo/../../bar 323 * is not. 324 */ 325 result = !normalize_path_copy(buf, refname + strlen("refs/")); 326 free(buf); 327 return result; 328 } 329 while (*refname) { 330 if (!isupper(*refname) && *refname != '_') 331 return 0; 332 refname++; 333 } 334 return 1; 335} 336 337static struct ref_entry *create_ref_entry(const char *refname, 338 const unsigned char *sha1, int flag, 339 int check_name) 340{ 341 int len; 342 struct ref_entry *ref; 343 344 if (check_name && 345 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) 346 die("Reference has invalid format: '%s'", refname); 347 if (!check_name && !refname_is_safe(refname)) 348 die("Reference has invalid name: '%s'", refname); 349 len = strlen(refname) + 1; 350 ref = xmalloc(sizeof(struct ref_entry) + len); 351 hashcpy(ref->u.value.sha1, sha1); 352 hashclr(ref->u.value.peeled); 353 memcpy(ref->name, refname, len); 354 ref->flag = flag; 355 return ref; 356} 357 358static void clear_ref_dir(struct ref_dir *dir); 359 360static void free_ref_entry(struct ref_entry *entry) 361{ 362 if (entry->flag & REF_DIR) { 363 /* 364 * Do not use get_ref_dir() here, as that might 365 * trigger the reading of loose refs. 366 */ 367 clear_ref_dir(&entry->u.subdir); 368 } 369 free(entry); 370} 371 372/* 373 * Add a ref_entry to the end of dir (unsorted). Entry is always 374 * stored directly in dir; no recursion into subdirectories is 375 * done. 376 */ 377static void add_entry_to_dir(struct ref_dir *dir, struct ref_entry *entry) 378{ 379 ALLOC_GROW(dir->entries, dir->nr + 1, dir->alloc); 380 dir->entries[dir->nr++] = entry; 381 /* optimize for the case that entries are added in order */ 382 if (dir->nr == 1 || 383 (dir->nr == dir->sorted + 1 && 384 strcmp(dir->entries[dir->nr - 2]->name, 385 dir->entries[dir->nr - 1]->name) < 0)) 386 dir->sorted = dir->nr; 387} 388 389/* 390 * Clear and free all entries in dir, recursively. 391 */ 392static void clear_ref_dir(struct ref_dir *dir) 393{ 394 int i; 395 for (i = 0; i < dir->nr; i++) 396 free_ref_entry(dir->entries[i]); 397 free(dir->entries); 398 dir->sorted = dir->nr = dir->alloc = 0; 399 dir->entries = NULL; 400} 401 402/* 403 * Create a struct ref_entry object for the specified dirname. 404 * dirname is the name of the directory with a trailing slash (e.g., 405 * "refs/heads/") or "" for the top-level directory. 406 */ 407static struct ref_entry *create_dir_entry(struct ref_cache *ref_cache, 408 const char *dirname, size_t len, 409 int incomplete) 410{ 411 struct ref_entry *direntry; 412 direntry = xcalloc(1, sizeof(struct ref_entry) + len + 1); 413 memcpy(direntry->name, dirname, len); 414 direntry->name[len] = '\0'; 415 direntry->u.subdir.ref_cache = ref_cache; 416 direntry->flag = REF_DIR | (incomplete ? REF_INCOMPLETE : 0); 417 return direntry; 418} 419 420static int ref_entry_cmp(const void *a, const void *b) 421{ 422 struct ref_entry *one = *(struct ref_entry **)a; 423 struct ref_entry *two = *(struct ref_entry **)b; 424 return strcmp(one->name, two->name); 425} 426 427static void sort_ref_dir(struct ref_dir *dir); 428 429struct string_slice { 430 size_t len; 431 const char *str; 432}; 433 434static int ref_entry_cmp_sslice(const void *key_, const void *ent_) 435{ 436 const struct string_slice *key = key_; 437 const struct ref_entry *ent = *(const struct ref_entry * const *)ent_; 438 int cmp = strncmp(key->str, ent->name, key->len); 439 if (cmp) 440 return cmp; 441 return '\0' - (unsigned char)ent->name[key->len]; 442} 443 444/* 445 * Return the index of the entry with the given refname from the 446 * ref_dir (non-recursively), sorting dir if necessary. Return -1 if 447 * no such entry is found. dir must already be complete. 448 */ 449static int search_ref_dir(struct ref_dir *dir, const char *refname, size_t len) 450{ 451 struct ref_entry **r; 452 struct string_slice key; 453 454 if (refname == NULL || !dir->nr) 455 return -1; 456 457 sort_ref_dir(dir); 458 key.len = len; 459 key.str = refname; 460 r = bsearch(&key, dir->entries, dir->nr, sizeof(*dir->entries), 461 ref_entry_cmp_sslice); 462 463 if (r == NULL) 464 return -1; 465 466 return r - dir->entries; 467} 468 469/* 470 * Search for a directory entry directly within dir (without 471 * recursing). Sort dir if necessary. subdirname must be a directory 472 * name (i.e., end in '/'). If mkdir is set, then create the 473 * directory if it is missing; otherwise, return NULL if the desired 474 * directory cannot be found. dir must already be complete. 475 */ 476static struct ref_dir *search_for_subdir(struct ref_dir *dir, 477 const char *subdirname, size_t len, 478 int mkdir) 479{ 480 int entry_index = search_ref_dir(dir, subdirname, len); 481 struct ref_entry *entry; 482 if (entry_index == -1) { 483 if (!mkdir) 484 return NULL; 485 /* 486 * Since dir is complete, the absence of a subdir 487 * means that the subdir really doesn't exist; 488 * therefore, create an empty record for it but mark 489 * the record complete. 490 */ 491 entry = create_dir_entry(dir->ref_cache, subdirname, len, 0); 492 add_entry_to_dir(dir, entry); 493 } else { 494 entry = dir->entries[entry_index]; 495 } 496 return get_ref_dir(entry); 497} 498 499/* 500 * If refname is a reference name, find the ref_dir within the dir 501 * tree that should hold refname. If refname is a directory name 502 * (i.e., ends in '/'), then return that ref_dir itself. dir must 503 * represent the top-level directory and must already be complete. 504 * Sort ref_dirs and recurse into subdirectories as necessary. If 505 * mkdir is set, then create any missing directories; otherwise, 506 * return NULL if the desired directory cannot be found. 507 */ 508static struct ref_dir *find_containing_dir(struct ref_dir *dir, 509 const char *refname, int mkdir) 510{ 511 const char *slash; 512 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 513 size_t dirnamelen = slash - refname + 1; 514 struct ref_dir *subdir; 515 subdir = search_for_subdir(dir, refname, dirnamelen, mkdir); 516 if (!subdir) { 517 dir = NULL; 518 break; 519 } 520 dir = subdir; 521 } 522 523 return dir; 524} 525 526/* 527 * Find the value entry with the given name in dir, sorting ref_dirs 528 * and recursing into subdirectories as necessary. If the name is not 529 * found or it corresponds to a directory entry, return NULL. 530 */ 531static struct ref_entry *find_ref(struct ref_dir *dir, const char *refname) 532{ 533 int entry_index; 534 struct ref_entry *entry; 535 dir = find_containing_dir(dir, refname, 0); 536 if (!dir) 537 return NULL; 538 entry_index = search_ref_dir(dir, refname, strlen(refname)); 539 if (entry_index == -1) 540 return NULL; 541 entry = dir->entries[entry_index]; 542 return (entry->flag & REF_DIR) ? NULL : entry; 543} 544 545/* 546 * Remove the entry with the given name from dir, recursing into 547 * subdirectories as necessary. If refname is the name of a directory 548 * (i.e., ends with '/'), then remove the directory and its contents. 549 * If the removal was successful, return the number of entries 550 * remaining in the directory entry that contained the deleted entry. 551 * If the name was not found, return -1. Please note that this 552 * function only deletes the entry from the cache; it does not delete 553 * it from the filesystem or ensure that other cache entries (which 554 * might be symbolic references to the removed entry) are updated. 555 * Nor does it remove any containing dir entries that might be made 556 * empty by the removal. dir must represent the top-level directory 557 * and must already be complete. 558 */ 559static int remove_entry(struct ref_dir *dir, const char *refname) 560{ 561 int refname_len = strlen(refname); 562 int entry_index; 563 struct ref_entry *entry; 564 int is_dir = refname[refname_len - 1] == '/'; 565 if (is_dir) { 566 /* 567 * refname represents a reference directory. Remove 568 * the trailing slash; otherwise we will get the 569 * directory *representing* refname rather than the 570 * one *containing* it. 571 */ 572 char *dirname = xmemdupz(refname, refname_len - 1); 573 dir = find_containing_dir(dir, dirname, 0); 574 free(dirname); 575 } else { 576 dir = find_containing_dir(dir, refname, 0); 577 } 578 if (!dir) 579 return -1; 580 entry_index = search_ref_dir(dir, refname, refname_len); 581 if (entry_index == -1) 582 return -1; 583 entry = dir->entries[entry_index]; 584 585 memmove(&dir->entries[entry_index], 586 &dir->entries[entry_index + 1], 587 (dir->nr - entry_index - 1) * sizeof(*dir->entries) 588 ); 589 dir->nr--; 590 if (dir->sorted > entry_index) 591 dir->sorted--; 592 free_ref_entry(entry); 593 return dir->nr; 594} 595 596/* 597 * Add a ref_entry to the ref_dir (unsorted), recursing into 598 * subdirectories as necessary. dir must represent the top-level 599 * directory. Return 0 on success. 600 */ 601static int add_ref(struct ref_dir *dir, struct ref_entry *ref) 602{ 603 dir = find_containing_dir(dir, ref->name, 1); 604 if (!dir) 605 return -1; 606 add_entry_to_dir(dir, ref); 607 return 0; 608} 609 610/* 611 * Emit a warning and return true iff ref1 and ref2 have the same name 612 * and the same sha1. Die if they have the same name but different 613 * sha1s. 614 */ 615static int is_dup_ref(const struct ref_entry *ref1, const struct ref_entry *ref2) 616{ 617 if (strcmp(ref1->name, ref2->name)) 618 return 0; 619 620 /* Duplicate name; make sure that they don't conflict: */ 621 622 if ((ref1->flag & REF_DIR) || (ref2->flag & REF_DIR)) 623 /* This is impossible by construction */ 624 die("Reference directory conflict: %s", ref1->name); 625 626 if (hashcmp(ref1->u.value.sha1, ref2->u.value.sha1)) 627 die("Duplicated ref, and SHA1s don't match: %s", ref1->name); 628 629 warning("Duplicated ref: %s", ref1->name); 630 return 1; 631} 632 633/* 634 * Sort the entries in dir non-recursively (if they are not already 635 * sorted) and remove any duplicate entries. 636 */ 637static void sort_ref_dir(struct ref_dir *dir) 638{ 639 int i, j; 640 struct ref_entry *last = NULL; 641 642 /* 643 * This check also prevents passing a zero-length array to qsort(), 644 * which is a problem on some platforms. 645 */ 646 if (dir->sorted == dir->nr) 647 return; 648 649 qsort(dir->entries, dir->nr, sizeof(*dir->entries), ref_entry_cmp); 650 651 /* Remove any duplicates: */ 652 for (i = 0, j = 0; j < dir->nr; j++) { 653 struct ref_entry *entry = dir->entries[j]; 654 if (last && is_dup_ref(last, entry)) 655 free_ref_entry(entry); 656 else 657 last = dir->entries[i++] = entry; 658 } 659 dir->sorted = dir->nr = i; 660} 661 662/* Include broken references in a do_for_each_ref*() iteration: */ 663#define DO_FOR_EACH_INCLUDE_BROKEN 0x01 664 665/* 666 * Return true iff the reference described by entry can be resolved to 667 * an object in the database. Emit a warning if the referred-to 668 * object does not exist. 669 */ 670static int ref_resolves_to_object(struct ref_entry *entry) 671{ 672 if (entry->flag & REF_ISBROKEN) 673 return 0; 674 if (!has_sha1_file(entry->u.value.sha1)) { 675 error("%s does not point to a valid object!", entry->name); 676 return 0; 677 } 678 return 1; 679} 680 681/* 682 * current_ref is a performance hack: when iterating over references 683 * using the for_each_ref*() functions, current_ref is set to the 684 * current reference's entry before calling the callback function. If 685 * the callback function calls peel_ref(), then peel_ref() first 686 * checks whether the reference to be peeled is the current reference 687 * (it usually is) and if so, returns that reference's peeled version 688 * if it is available. This avoids a refname lookup in a common case. 689 */ 690static struct ref_entry *current_ref; 691 692typedef int each_ref_entry_fn(struct ref_entry *entry, void *cb_data); 693 694struct ref_entry_cb { 695 const char *base; 696 int trim; 697 int flags; 698 each_ref_fn *fn; 699 void *cb_data; 700}; 701 702/* 703 * Handle one reference in a do_for_each_ref*()-style iteration, 704 * calling an each_ref_fn for each entry. 705 */ 706static int do_one_ref(struct ref_entry *entry, void *cb_data) 707{ 708 struct ref_entry_cb *data = cb_data; 709 struct ref_entry *old_current_ref; 710 int retval; 711 712 if (!starts_with(entry->name, data->base)) 713 return 0; 714 715 if (!(data->flags & DO_FOR_EACH_INCLUDE_BROKEN) && 716 !ref_resolves_to_object(entry)) 717 return 0; 718 719 /* Store the old value, in case this is a recursive call: */ 720 old_current_ref = current_ref; 721 current_ref = entry; 722 retval = data->fn(entry->name + data->trim, entry->u.value.sha1, 723 entry->flag, data->cb_data); 724 current_ref = old_current_ref; 725 return retval; 726} 727 728/* 729 * Call fn for each reference in dir that has index in the range 730 * offset <= index < dir->nr. Recurse into subdirectories that are in 731 * that index range, sorting them before iterating. This function 732 * does not sort dir itself; it should be sorted beforehand. fn is 733 * called for all references, including broken ones. 734 */ 735static int do_for_each_entry_in_dir(struct ref_dir *dir, int offset, 736 each_ref_entry_fn fn, void *cb_data) 737{ 738 int i; 739 assert(dir->sorted == dir->nr); 740 for (i = offset; i < dir->nr; i++) { 741 struct ref_entry *entry = dir->entries[i]; 742 int retval; 743 if (entry->flag & REF_DIR) { 744 struct ref_dir *subdir = get_ref_dir(entry); 745 sort_ref_dir(subdir); 746 retval = do_for_each_entry_in_dir(subdir, 0, fn, cb_data); 747 } else { 748 retval = fn(entry, cb_data); 749 } 750 if (retval) 751 return retval; 752 } 753 return 0; 754} 755 756/* 757 * Call fn for each reference in the union of dir1 and dir2, in order 758 * by refname. Recurse into subdirectories. If a value entry appears 759 * in both dir1 and dir2, then only process the version that is in 760 * dir2. The input dirs must already be sorted, but subdirs will be 761 * sorted as needed. fn is called for all references, including 762 * broken ones. 763 */ 764static int do_for_each_entry_in_dirs(struct ref_dir *dir1, 765 struct ref_dir *dir2, 766 each_ref_entry_fn fn, void *cb_data) 767{ 768 int retval; 769 int i1 = 0, i2 = 0; 770 771 assert(dir1->sorted == dir1->nr); 772 assert(dir2->sorted == dir2->nr); 773 while (1) { 774 struct ref_entry *e1, *e2; 775 int cmp; 776 if (i1 == dir1->nr) { 777 return do_for_each_entry_in_dir(dir2, i2, fn, cb_data); 778 } 779 if (i2 == dir2->nr) { 780 return do_for_each_entry_in_dir(dir1, i1, fn, cb_data); 781 } 782 e1 = dir1->entries[i1]; 783 e2 = dir2->entries[i2]; 784 cmp = strcmp(e1->name, e2->name); 785 if (cmp == 0) { 786 if ((e1->flag & REF_DIR) && (e2->flag & REF_DIR)) { 787 /* Both are directories; descend them in parallel. */ 788 struct ref_dir *subdir1 = get_ref_dir(e1); 789 struct ref_dir *subdir2 = get_ref_dir(e2); 790 sort_ref_dir(subdir1); 791 sort_ref_dir(subdir2); 792 retval = do_for_each_entry_in_dirs( 793 subdir1, subdir2, fn, cb_data); 794 i1++; 795 i2++; 796 } else if (!(e1->flag & REF_DIR) && !(e2->flag & REF_DIR)) { 797 /* Both are references; ignore the one from dir1. */ 798 retval = fn(e2, cb_data); 799 i1++; 800 i2++; 801 } else { 802 die("conflict between reference and directory: %s", 803 e1->name); 804 } 805 } else { 806 struct ref_entry *e; 807 if (cmp < 0) { 808 e = e1; 809 i1++; 810 } else { 811 e = e2; 812 i2++; 813 } 814 if (e->flag & REF_DIR) { 815 struct ref_dir *subdir = get_ref_dir(e); 816 sort_ref_dir(subdir); 817 retval = do_for_each_entry_in_dir( 818 subdir, 0, fn, cb_data); 819 } else { 820 retval = fn(e, cb_data); 821 } 822 } 823 if (retval) 824 return retval; 825 } 826} 827 828/* 829 * Load all of the refs from the dir into our in-memory cache. The hard work 830 * of loading loose refs is done by get_ref_dir(), so we just need to recurse 831 * through all of the sub-directories. We do not even need to care about 832 * sorting, as traversal order does not matter to us. 833 */ 834static void prime_ref_dir(struct ref_dir *dir) 835{ 836 int i; 837 for (i = 0; i < dir->nr; i++) { 838 struct ref_entry *entry = dir->entries[i]; 839 if (entry->flag & REF_DIR) 840 prime_ref_dir(get_ref_dir(entry)); 841 } 842} 843 844struct nonmatching_ref_data { 845 const struct string_list *skip; 846 const char *conflicting_refname; 847}; 848 849static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata) 850{ 851 struct nonmatching_ref_data *data = vdata; 852 853 if (data->skip && string_list_has_string(data->skip, entry->name)) 854 return 0; 855 856 data->conflicting_refname = entry->name; 857 return 1; 858} 859 860/* 861 * Return 0 if a reference named refname could be created without 862 * conflicting with the name of an existing reference in dir. 863 * Otherwise, return a negative value. If extras is non-NULL, it is a 864 * list of additional refnames with which refname is not allowed to 865 * conflict. If skip is non-NULL, ignore potential conflicts with refs 866 * in skip (e.g., because they are scheduled for deletion in the same 867 * operation). Behavior is undefined if the same name is listed in 868 * both extras and skip. 869 * 870 * Two reference names conflict if one of them exactly matches the 871 * leading components of the other; e.g., "refs/foo/bar" conflicts 872 * with both "refs/foo" and with "refs/foo/bar/baz" but not with 873 * "refs/foo/bar" or "refs/foo/barbados". 874 * 875 * extras and skip must be sorted. 876 */ 877static int verify_refname_available(const char *refname, 878 const struct string_list *extras, 879 const struct string_list *skip, 880 struct ref_dir *dir) 881{ 882 const char *slash; 883 int pos; 884 struct strbuf dirname = STRBUF_INIT; 885 int ret = -1; 886 887 /* 888 * For the sake of comments in this function, suppose that 889 * refname is "refs/foo/bar". 890 */ 891 892 strbuf_grow(&dirname, strlen(refname) + 1); 893 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 894 /* Expand dirname to the new prefix, not including the trailing slash: */ 895 strbuf_add(&dirname, refname + dirname.len, slash - refname - dirname.len); 896 897 /* 898 * We are still at a leading dir of the refname (e.g., 899 * "refs/foo"; if there is a reference with that name, 900 * it is a conflict, *unless* it is in skip. 901 */ 902 if (dir) { 903 pos = search_ref_dir(dir, dirname.buf, dirname.len); 904 if (pos >= 0 && 905 (!skip || !string_list_has_string(skip, dirname.buf))) { 906 /* 907 * We found a reference whose name is 908 * a proper prefix of refname; e.g., 909 * "refs/foo", and is not in skip. 910 */ 911 error("'%s' exists; cannot create '%s'", 912 dirname.buf, refname); 913 goto cleanup; 914 } 915 } 916 917 if (extras && string_list_has_string(extras, dirname.buf) && 918 (!skip || !string_list_has_string(skip, dirname.buf))) { 919 error("cannot process '%s' and '%s' at the same time", 920 refname, dirname.buf); 921 goto cleanup; 922 } 923 924 /* 925 * Otherwise, we can try to continue our search with 926 * the next component. So try to look up the 927 * directory, e.g., "refs/foo/". If we come up empty, 928 * we know there is nothing under this whole prefix, 929 * but even in that case we still have to continue the 930 * search for conflicts with extras. 931 */ 932 strbuf_addch(&dirname, '/'); 933 if (dir) { 934 pos = search_ref_dir(dir, dirname.buf, dirname.len); 935 if (pos < 0) { 936 /* 937 * There was no directory "refs/foo/", 938 * so there is nothing under this 939 * whole prefix. So there is no need 940 * to continue looking for conflicting 941 * references. But we need to continue 942 * looking for conflicting extras. 943 */ 944 dir = NULL; 945 } else { 946 dir = get_ref_dir(dir->entries[pos]); 947 } 948 } 949 } 950 951 /* 952 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 953 * There is no point in searching for a reference with that 954 * name, because a refname isn't considered to conflict with 955 * itself. But we still need to check for references whose 956 * names are in the "refs/foo/bar/" namespace, because they 957 * *do* conflict. 958 */ 959 strbuf_addstr(&dirname, refname + dirname.len); 960 strbuf_addch(&dirname, '/'); 961 962 if (dir) { 963 pos = search_ref_dir(dir, dirname.buf, dirname.len); 964 965 if (pos >= 0) { 966 /* 967 * We found a directory named "$refname/" 968 * (e.g., "refs/foo/bar/"). It is a problem 969 * iff it contains any ref that is not in 970 * "skip". 971 */ 972 struct nonmatching_ref_data data; 973 974 data.skip = skip; 975 data.conflicting_refname = NULL; 976 dir = get_ref_dir(dir->entries[pos]); 977 sort_ref_dir(dir); 978 if (do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) { 979 error("'%s' exists; cannot create '%s'", 980 data.conflicting_refname, refname); 981 goto cleanup; 982 } 983 } 984 } 985 986 if (extras) { 987 /* 988 * Check for entries in extras that start with 989 * "$refname/". We do that by looking for the place 990 * where "$refname/" would be inserted in extras. If 991 * there is an entry at that position that starts with 992 * "$refname/" and is not in skip, then we have a 993 * conflict. 994 */ 995 for (pos = string_list_find_insert_index(extras, dirname.buf, 0); 996 pos < extras->nr; pos++) { 997 const char *extra_refname = extras->items[pos].string; 998 999 if (!starts_with(extra_refname, dirname.buf))1000 break;10011002 if (!skip || !string_list_has_string(skip, extra_refname)) {1003 error("cannot process '%s' and '%s' at the same time",1004 refname, extra_refname);1005 goto cleanup;1006 }1007 }1008 }10091010 /* No conflicts were found */1011 ret = 0;10121013cleanup:1014 strbuf_release(&dirname);1015 return ret;1016}10171018struct packed_ref_cache {1019 struct ref_entry *root;10201021 /*1022 * Count of references to the data structure in this instance,1023 * including the pointer from ref_cache::packed if any. The1024 * data will not be freed as long as the reference count is1025 * nonzero.1026 */1027 unsigned int referrers;10281029 /*1030 * Iff the packed-refs file associated with this instance is1031 * currently locked for writing, this points at the associated1032 * lock (which is owned by somebody else). The referrer count1033 * is also incremented when the file is locked and decremented1034 * when it is unlocked.1035 */1036 struct lock_file *lock;10371038 /* The metadata from when this packed-refs cache was read */1039 struct stat_validity validity;1040};10411042/*1043 * Future: need to be in "struct repository"1044 * when doing a full libification.1045 */1046static struct ref_cache {1047 struct ref_cache *next;1048 struct ref_entry *loose;1049 struct packed_ref_cache *packed;1050 /*1051 * The submodule name, or "" for the main repo. We allocate1052 * length 1 rather than FLEX_ARRAY so that the main ref_cache1053 * is initialized correctly.1054 */1055 char name[1];1056} ref_cache, *submodule_ref_caches;10571058/* Lock used for the main packed-refs file: */1059static struct lock_file packlock;10601061/*1062 * Increment the reference count of *packed_refs.1063 */1064static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)1065{1066 packed_refs->referrers++;1067}10681069/*1070 * Decrease the reference count of *packed_refs. If it goes to zero,1071 * free *packed_refs and return true; otherwise return false.1072 */1073static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)1074{1075 if (!--packed_refs->referrers) {1076 free_ref_entry(packed_refs->root);1077 stat_validity_clear(&packed_refs->validity);1078 free(packed_refs);1079 return 1;1080 } else {1081 return 0;1082 }1083}10841085static void clear_packed_ref_cache(struct ref_cache *refs)1086{1087 if (refs->packed) {1088 struct packed_ref_cache *packed_refs = refs->packed;10891090 if (packed_refs->lock)1091 die("internal error: packed-ref cache cleared while locked");1092 refs->packed = NULL;1093 release_packed_ref_cache(packed_refs);1094 }1095}10961097static void clear_loose_ref_cache(struct ref_cache *refs)1098{1099 if (refs->loose) {1100 free_ref_entry(refs->loose);1101 refs->loose = NULL;1102 }1103}11041105static struct ref_cache *create_ref_cache(const char *submodule)1106{1107 int len;1108 struct ref_cache *refs;1109 if (!submodule)1110 submodule = "";1111 len = strlen(submodule) + 1;1112 refs = xcalloc(1, sizeof(struct ref_cache) + len);1113 memcpy(refs->name, submodule, len);1114 return refs;1115}11161117/*1118 * Return a pointer to a ref_cache for the specified submodule. For1119 * the main repository, use submodule==NULL. The returned structure1120 * will be allocated and initialized but not necessarily populated; it1121 * should not be freed.1122 */1123static struct ref_cache *get_ref_cache(const char *submodule)1124{1125 struct ref_cache *refs;11261127 if (!submodule || !*submodule)1128 return &ref_cache;11291130 for (refs = submodule_ref_caches; refs; refs = refs->next)1131 if (!strcmp(submodule, refs->name))1132 return refs;11331134 refs = create_ref_cache(submodule);1135 refs->next = submodule_ref_caches;1136 submodule_ref_caches = refs;1137 return refs;1138}11391140/* The length of a peeled reference line in packed-refs, including EOL: */1141#define PEELED_LINE_LENGTH 4211421143/*1144 * The packed-refs header line that we write out. Perhaps other1145 * traits will be added later. The trailing space is required.1146 */1147static const char PACKED_REFS_HEADER[] =1148 "# pack-refs with: peeled fully-peeled \n";11491150/*1151 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1152 * Return a pointer to the refname within the line (null-terminated),1153 * or NULL if there was a problem.1154 */1155static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)1156{1157 const char *ref;11581159 /*1160 * 42: the answer to everything.1161 *1162 * In this case, it happens to be the answer to1163 * 40 (length of sha1 hex representation)1164 * +1 (space in between hex and name)1165 * +1 (newline at the end of the line)1166 */1167 if (line->len <= 42)1168 return NULL;11691170 if (get_sha1_hex(line->buf, sha1) < 0)1171 return NULL;1172 if (!isspace(line->buf[40]))1173 return NULL;11741175 ref = line->buf + 41;1176 if (isspace(*ref))1177 return NULL;11781179 if (line->buf[line->len - 1] != '\n')1180 return NULL;1181 line->buf[--line->len] = 0;11821183 return ref;1184}11851186/*1187 * Read f, which is a packed-refs file, into dir.1188 *1189 * A comment line of the form "# pack-refs with: " may contain zero or1190 * more traits. We interpret the traits as follows:1191 *1192 * No traits:1193 *1194 * Probably no references are peeled. But if the file contains a1195 * peeled value for a reference, we will use it.1196 *1197 * peeled:1198 *1199 * References under "refs/tags/", if they *can* be peeled, *are*1200 * peeled in this file. References outside of "refs/tags/" are1201 * probably not peeled even if they could have been, but if we find1202 * a peeled value for such a reference we will use it.1203 *1204 * fully-peeled:1205 *1206 * All references in the file that can be peeled are peeled.1207 * Inversely (and this is more important), any references in the1208 * file for which no peeled value is recorded is not peelable. This1209 * trait should typically be written alongside "peeled" for1210 * compatibility with older clients, but we do not require it1211 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1212 */1213static void read_packed_refs(FILE *f, struct ref_dir *dir)1214{1215 struct ref_entry *last = NULL;1216 struct strbuf line = STRBUF_INIT;1217 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;12181219 while (strbuf_getwholeline(&line, f, '\n') != EOF) {1220 unsigned char sha1[20];1221 const char *refname;1222 const char *traits;12231224 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {1225 if (strstr(traits, " fully-peeled "))1226 peeled = PEELED_FULLY;1227 else if (strstr(traits, " peeled "))1228 peeled = PEELED_TAGS;1229 /* perhaps other traits later as well */1230 continue;1231 }12321233 refname = parse_ref_line(&line, sha1);1234 if (refname) {1235 int flag = REF_ISPACKED;12361237 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1238 hashclr(sha1);1239 flag |= REF_BAD_NAME | REF_ISBROKEN;1240 }1241 last = create_ref_entry(refname, sha1, flag, 0);1242 if (peeled == PEELED_FULLY ||1243 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))1244 last->flag |= REF_KNOWS_PEELED;1245 add_ref(dir, last);1246 continue;1247 }1248 if (last &&1249 line.buf[0] == '^' &&1250 line.len == PEELED_LINE_LENGTH &&1251 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&1252 !get_sha1_hex(line.buf + 1, sha1)) {1253 hashcpy(last->u.value.peeled, sha1);1254 /*1255 * Regardless of what the file header said,1256 * we definitely know the value of *this*1257 * reference:1258 */1259 last->flag |= REF_KNOWS_PEELED;1260 }1261 }12621263 strbuf_release(&line);1264}12651266/*1267 * Get the packed_ref_cache for the specified ref_cache, creating it1268 * if necessary.1269 */1270static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1271{1272 const char *packed_refs_file;12731274 if (*refs->name)1275 packed_refs_file = git_path_submodule(refs->name, "packed-refs");1276 else1277 packed_refs_file = git_path("packed-refs");12781279 if (refs->packed &&1280 !stat_validity_check(&refs->packed->validity, packed_refs_file))1281 clear_packed_ref_cache(refs);12821283 if (!refs->packed) {1284 FILE *f;12851286 refs->packed = xcalloc(1, sizeof(*refs->packed));1287 acquire_packed_ref_cache(refs->packed);1288 refs->packed->root = create_dir_entry(refs, "", 0, 0);1289 f = fopen(packed_refs_file, "r");1290 if (f) {1291 stat_validity_update(&refs->packed->validity, fileno(f));1292 read_packed_refs(f, get_ref_dir(refs->packed->root));1293 fclose(f);1294 }1295 }1296 return refs->packed;1297}12981299static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1300{1301 return get_ref_dir(packed_ref_cache->root);1302}13031304static struct ref_dir *get_packed_refs(struct ref_cache *refs)1305{1306 return get_packed_ref_dir(get_packed_ref_cache(refs));1307}13081309void add_packed_ref(const char *refname, const unsigned char *sha1)1310{1311 struct packed_ref_cache *packed_ref_cache =1312 get_packed_ref_cache(&ref_cache);13131314 if (!packed_ref_cache->lock)1315 die("internal error: packed refs not locked");1316 add_ref(get_packed_ref_dir(packed_ref_cache),1317 create_ref_entry(refname, sha1, REF_ISPACKED, 1));1318}13191320/*1321 * Read the loose references from the namespace dirname into dir1322 * (without recursing). dirname must end with '/'. dir must be the1323 * directory entry corresponding to dirname.1324 */1325static void read_loose_refs(const char *dirname, struct ref_dir *dir)1326{1327 struct ref_cache *refs = dir->ref_cache;1328 DIR *d;1329 const char *path;1330 struct dirent *de;1331 int dirnamelen = strlen(dirname);1332 struct strbuf refname;13331334 if (*refs->name)1335 path = git_path_submodule(refs->name, "%s", dirname);1336 else1337 path = git_path("%s", dirname);13381339 d = opendir(path);1340 if (!d)1341 return;13421343 strbuf_init(&refname, dirnamelen + 257);1344 strbuf_add(&refname, dirname, dirnamelen);13451346 while ((de = readdir(d)) != NULL) {1347 unsigned char sha1[20];1348 struct stat st;1349 int flag;1350 const char *refdir;13511352 if (de->d_name[0] == '.')1353 continue;1354 if (ends_with(de->d_name, ".lock"))1355 continue;1356 strbuf_addstr(&refname, de->d_name);1357 refdir = *refs->name1358 ? git_path_submodule(refs->name, "%s", refname.buf)1359 : git_path("%s", refname.buf);1360 if (stat(refdir, &st) < 0) {1361 ; /* silently ignore */1362 } else if (S_ISDIR(st.st_mode)) {1363 strbuf_addch(&refname, '/');1364 add_entry_to_dir(dir,1365 create_dir_entry(refs, refname.buf,1366 refname.len, 1));1367 } else {1368 if (*refs->name) {1369 hashclr(sha1);1370 flag = 0;1371 if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) {1372 hashclr(sha1);1373 flag |= REF_ISBROKEN;1374 }1375 } else if (read_ref_full(refname.buf,1376 RESOLVE_REF_READING,1377 sha1, &flag)) {1378 hashclr(sha1);1379 flag |= REF_ISBROKEN;1380 }1381 if (check_refname_format(refname.buf,1382 REFNAME_ALLOW_ONELEVEL)) {1383 hashclr(sha1);1384 flag |= REF_BAD_NAME | REF_ISBROKEN;1385 }1386 add_entry_to_dir(dir,1387 create_ref_entry(refname.buf, sha1, flag, 0));1388 }1389 strbuf_setlen(&refname, dirnamelen);1390 }1391 strbuf_release(&refname);1392 closedir(d);1393}13941395static struct ref_dir *get_loose_refs(struct ref_cache *refs)1396{1397 if (!refs->loose) {1398 /*1399 * Mark the top-level directory complete because we1400 * are about to read the only subdirectory that can1401 * hold references:1402 */1403 refs->loose = create_dir_entry(refs, "", 0, 0);1404 /*1405 * Create an incomplete entry for "refs/":1406 */1407 add_entry_to_dir(get_ref_dir(refs->loose),1408 create_dir_entry(refs, "refs/", 5, 1));1409 }1410 return get_ref_dir(refs->loose);1411}14121413/* We allow "recursive" symbolic refs. Only within reason, though */1414#define MAXDEPTH 51415#define MAXREFLEN (1024)14161417/*1418 * Called by resolve_gitlink_ref_recursive() after it failed to read1419 * from the loose refs in ref_cache refs. Find <refname> in the1420 * packed-refs file for the submodule.1421 */1422static int resolve_gitlink_packed_ref(struct ref_cache *refs,1423 const char *refname, unsigned char *sha1)1424{1425 struct ref_entry *ref;1426 struct ref_dir *dir = get_packed_refs(refs);14271428 ref = find_ref(dir, refname);1429 if (ref == NULL)1430 return -1;14311432 hashcpy(sha1, ref->u.value.sha1);1433 return 0;1434}14351436static int resolve_gitlink_ref_recursive(struct ref_cache *refs,1437 const char *refname, unsigned char *sha1,1438 int recursion)1439{1440 int fd, len;1441 char buffer[128], *p;1442 char *path;14431444 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)1445 return -1;1446 path = *refs->name1447 ? git_path_submodule(refs->name, "%s", refname)1448 : git_path("%s", refname);1449 fd = open(path, O_RDONLY);1450 if (fd < 0)1451 return resolve_gitlink_packed_ref(refs, refname, sha1);14521453 len = read(fd, buffer, sizeof(buffer)-1);1454 close(fd);1455 if (len < 0)1456 return -1;1457 while (len && isspace(buffer[len-1]))1458 len--;1459 buffer[len] = 0;14601461 /* Was it a detached head or an old-fashioned symlink? */1462 if (!get_sha1_hex(buffer, sha1))1463 return 0;14641465 /* Symref? */1466 if (strncmp(buffer, "ref:", 4))1467 return -1;1468 p = buffer + 4;1469 while (isspace(*p))1470 p++;14711472 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1473}14741475int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)1476{1477 int len = strlen(path), retval;1478 char *submodule;1479 struct ref_cache *refs;14801481 while (len && path[len-1] == '/')1482 len--;1483 if (!len)1484 return -1;1485 submodule = xstrndup(path, len);1486 refs = get_ref_cache(submodule);1487 free(submodule);14881489 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);1490 return retval;1491}14921493/*1494 * Return the ref_entry for the given refname from the packed1495 * references. If it does not exist, return NULL.1496 */1497static struct ref_entry *get_packed_ref(const char *refname)1498{1499 return find_ref(get_packed_refs(&ref_cache), refname);1500}15011502/*1503 * A loose ref file doesn't exist; check for a packed ref. The1504 * options are forwarded from resolve_safe_unsafe().1505 */1506static int resolve_missing_loose_ref(const char *refname,1507 int resolve_flags,1508 unsigned char *sha1,1509 int *flags)1510{1511 struct ref_entry *entry;15121513 /*1514 * The loose reference file does not exist; check for a packed1515 * reference.1516 */1517 entry = get_packed_ref(refname);1518 if (entry) {1519 hashcpy(sha1, entry->u.value.sha1);1520 if (flags)1521 *flags |= REF_ISPACKED;1522 return 0;1523 }1524 /* The reference is not a packed reference, either. */1525 if (resolve_flags & RESOLVE_REF_READING) {1526 errno = ENOENT;1527 return -1;1528 } else {1529 hashclr(sha1);1530 return 0;1531 }1532}15331534/* This function needs to return a meaningful errno on failure */1535const char *resolve_ref_unsafe(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)1536{1537 int depth = MAXDEPTH;1538 ssize_t len;1539 char buffer[256];1540 static char refname_buffer[256];1541 int bad_name = 0;15421543 if (flags)1544 *flags = 0;15451546 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1547 if (flags)1548 *flags |= REF_BAD_NAME;15491550 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1551 !refname_is_safe(refname)) {1552 errno = EINVAL;1553 return NULL;1554 }1555 /*1556 * dwim_ref() uses REF_ISBROKEN to distinguish between1557 * missing refs and refs that were present but invalid,1558 * to complain about the latter to stderr.1559 *1560 * We don't know whether the ref exists, so don't set1561 * REF_ISBROKEN yet.1562 */1563 bad_name = 1;1564 }1565 for (;;) {1566 char path[PATH_MAX];1567 struct stat st;1568 char *buf;1569 int fd;15701571 if (--depth < 0) {1572 errno = ELOOP;1573 return NULL;1574 }15751576 git_snpath(path, sizeof(path), "%s", refname);15771578 /*1579 * We might have to loop back here to avoid a race1580 * condition: first we lstat() the file, then we try1581 * to read it as a link or as a file. But if somebody1582 * changes the type of the file (file <-> directory1583 * <-> symlink) between the lstat() and reading, then1584 * we don't want to report that as an error but rather1585 * try again starting with the lstat().1586 */1587 stat_ref:1588 if (lstat(path, &st) < 0) {1589 if (errno != ENOENT)1590 return NULL;1591 if (resolve_missing_loose_ref(refname, resolve_flags,1592 sha1, flags))1593 return NULL;1594 if (bad_name) {1595 hashclr(sha1);1596 if (flags)1597 *flags |= REF_ISBROKEN;1598 }1599 return refname;1600 }16011602 /* Follow "normalized" - ie "refs/.." symlinks by hand */1603 if (S_ISLNK(st.st_mode)) {1604 len = readlink(path, buffer, sizeof(buffer)-1);1605 if (len < 0) {1606 if (errno == ENOENT || errno == EINVAL)1607 /* inconsistent with lstat; retry */1608 goto stat_ref;1609 else1610 return NULL;1611 }1612 buffer[len] = 0;1613 if (starts_with(buffer, "refs/") &&1614 !check_refname_format(buffer, 0)) {1615 strcpy(refname_buffer, buffer);1616 refname = refname_buffer;1617 if (flags)1618 *flags |= REF_ISSYMREF;1619 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {1620 hashclr(sha1);1621 return refname;1622 }1623 continue;1624 }1625 }16261627 /* Is it a directory? */1628 if (S_ISDIR(st.st_mode)) {1629 errno = EISDIR;1630 return NULL;1631 }16321633 /*1634 * Anything else, just open it and try to use it as1635 * a ref1636 */1637 fd = open(path, O_RDONLY);1638 if (fd < 0) {1639 if (errno == ENOENT)1640 /* inconsistent with lstat; retry */1641 goto stat_ref;1642 else1643 return NULL;1644 }1645 len = read_in_full(fd, buffer, sizeof(buffer)-1);1646 if (len < 0) {1647 int save_errno = errno;1648 close(fd);1649 errno = save_errno;1650 return NULL;1651 }1652 close(fd);1653 while (len && isspace(buffer[len-1]))1654 len--;1655 buffer[len] = '\0';16561657 /*1658 * Is it a symbolic ref?1659 */1660 if (!starts_with(buffer, "ref:")) {1661 /*1662 * Please note that FETCH_HEAD has a second1663 * line containing other data.1664 */1665 if (get_sha1_hex(buffer, sha1) ||1666 (buffer[40] != '\0' && !isspace(buffer[40]))) {1667 if (flags)1668 *flags |= REF_ISBROKEN;1669 errno = EINVAL;1670 return NULL;1671 }1672 if (bad_name) {1673 hashclr(sha1);1674 if (flags)1675 *flags |= REF_ISBROKEN;1676 }1677 return refname;1678 }1679 if (flags)1680 *flags |= REF_ISSYMREF;1681 buf = buffer + 4;1682 while (isspace(*buf))1683 buf++;1684 refname = strcpy(refname_buffer, buf);1685 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {1686 hashclr(sha1);1687 return refname;1688 }1689 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {1690 if (flags)1691 *flags |= REF_ISBROKEN;16921693 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1694 !refname_is_safe(buf)) {1695 errno = EINVAL;1696 return NULL;1697 }1698 bad_name = 1;1699 }1700 }1701}17021703char *resolve_refdup(const char *ref, int resolve_flags, unsigned char *sha1, int *flags)1704{1705 return xstrdup_or_null(resolve_ref_unsafe(ref, resolve_flags, sha1, flags));1706}17071708/* The argument to filter_refs */1709struct ref_filter {1710 const char *pattern;1711 each_ref_fn *fn;1712 void *cb_data;1713};17141715int read_ref_full(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)1716{1717 if (resolve_ref_unsafe(refname, resolve_flags, sha1, flags))1718 return 0;1719 return -1;1720}17211722int read_ref(const char *refname, unsigned char *sha1)1723{1724 return read_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);1725}17261727int ref_exists(const char *refname)1728{1729 unsigned char sha1[20];1730 return !!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);1731}17321733static int filter_refs(const char *refname, const unsigned char *sha1, int flags,1734 void *data)1735{1736 struct ref_filter *filter = (struct ref_filter *)data;1737 if (wildmatch(filter->pattern, refname, 0, NULL))1738 return 0;1739 return filter->fn(refname, sha1, flags, filter->cb_data);1740}17411742enum peel_status {1743 /* object was peeled successfully: */1744 PEEL_PEELED = 0,17451746 /*1747 * object cannot be peeled because the named object (or an1748 * object referred to by a tag in the peel chain), does not1749 * exist.1750 */1751 PEEL_INVALID = -1,17521753 /* object cannot be peeled because it is not a tag: */1754 PEEL_NON_TAG = -2,17551756 /* ref_entry contains no peeled value because it is a symref: */1757 PEEL_IS_SYMREF = -3,17581759 /*1760 * ref_entry cannot be peeled because it is broken (i.e., the1761 * symbolic reference cannot even be resolved to an object1762 * name):1763 */1764 PEEL_BROKEN = -41765};17661767/*1768 * Peel the named object; i.e., if the object is a tag, resolve the1769 * tag recursively until a non-tag is found. If successful, store the1770 * result to sha1 and return PEEL_PEELED. If the object is not a tag1771 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,1772 * and leave sha1 unchanged.1773 */1774static enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)1775{1776 struct object *o = lookup_unknown_object(name);17771778 if (o->type == OBJ_NONE) {1779 int type = sha1_object_info(name, NULL);1780 if (type < 0 || !object_as_type(o, type, 0))1781 return PEEL_INVALID;1782 }17831784 if (o->type != OBJ_TAG)1785 return PEEL_NON_TAG;17861787 o = deref_tag_noverify(o);1788 if (!o)1789 return PEEL_INVALID;17901791 hashcpy(sha1, o->sha1);1792 return PEEL_PEELED;1793}17941795/*1796 * Peel the entry (if possible) and return its new peel_status. If1797 * repeel is true, re-peel the entry even if there is an old peeled1798 * value that is already stored in it.1799 *1800 * It is OK to call this function with a packed reference entry that1801 * might be stale and might even refer to an object that has since1802 * been garbage-collected. In such a case, if the entry has1803 * REF_KNOWS_PEELED then leave the status unchanged and return1804 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1805 */1806static enum peel_status peel_entry(struct ref_entry *entry, int repeel)1807{1808 enum peel_status status;18091810 if (entry->flag & REF_KNOWS_PEELED) {1811 if (repeel) {1812 entry->flag &= ~REF_KNOWS_PEELED;1813 hashclr(entry->u.value.peeled);1814 } else {1815 return is_null_sha1(entry->u.value.peeled) ?1816 PEEL_NON_TAG : PEEL_PEELED;1817 }1818 }1819 if (entry->flag & REF_ISBROKEN)1820 return PEEL_BROKEN;1821 if (entry->flag & REF_ISSYMREF)1822 return PEEL_IS_SYMREF;18231824 status = peel_object(entry->u.value.sha1, entry->u.value.peeled);1825 if (status == PEEL_PEELED || status == PEEL_NON_TAG)1826 entry->flag |= REF_KNOWS_PEELED;1827 return status;1828}18291830int peel_ref(const char *refname, unsigned char *sha1)1831{1832 int flag;1833 unsigned char base[20];18341835 if (current_ref && (current_ref->name == refname1836 || !strcmp(current_ref->name, refname))) {1837 if (peel_entry(current_ref, 0))1838 return -1;1839 hashcpy(sha1, current_ref->u.value.peeled);1840 return 0;1841 }18421843 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1844 return -1;18451846 /*1847 * If the reference is packed, read its ref_entry from the1848 * cache in the hope that we already know its peeled value.1849 * We only try this optimization on packed references because1850 * (a) forcing the filling of the loose reference cache could1851 * be expensive and (b) loose references anyway usually do not1852 * have REF_KNOWS_PEELED.1853 */1854 if (flag & REF_ISPACKED) {1855 struct ref_entry *r = get_packed_ref(refname);1856 if (r) {1857 if (peel_entry(r, 0))1858 return -1;1859 hashcpy(sha1, r->u.value.peeled);1860 return 0;1861 }1862 }18631864 return peel_object(base, sha1);1865}18661867struct warn_if_dangling_data {1868 FILE *fp;1869 const char *refname;1870 const struct string_list *refnames;1871 const char *msg_fmt;1872};18731874static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1,1875 int flags, void *cb_data)1876{1877 struct warn_if_dangling_data *d = cb_data;1878 const char *resolves_to;1879 unsigned char junk[20];18801881 if (!(flags & REF_ISSYMREF))1882 return 0;18831884 resolves_to = resolve_ref_unsafe(refname, 0, junk, NULL);1885 if (!resolves_to1886 || (d->refname1887 ? strcmp(resolves_to, d->refname)1888 : !string_list_has_string(d->refnames, resolves_to))) {1889 return 0;1890 }18911892 fprintf(d->fp, d->msg_fmt, refname);1893 fputc('\n', d->fp);1894 return 0;1895}18961897void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)1898{1899 struct warn_if_dangling_data data;19001901 data.fp = fp;1902 data.refname = refname;1903 data.refnames = NULL;1904 data.msg_fmt = msg_fmt;1905 for_each_rawref(warn_if_dangling_symref, &data);1906}19071908void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)1909{1910 struct warn_if_dangling_data data;19111912 data.fp = fp;1913 data.refname = NULL;1914 data.refnames = refnames;1915 data.msg_fmt = msg_fmt;1916 for_each_rawref(warn_if_dangling_symref, &data);1917}19181919/*1920 * Call fn for each reference in the specified ref_cache, omitting1921 * references not in the containing_dir of base. fn is called for all1922 * references, including broken ones. If fn ever returns a non-zero1923 * value, stop the iteration and return that value; otherwise, return1924 * 0.1925 */1926static int do_for_each_entry(struct ref_cache *refs, const char *base,1927 each_ref_entry_fn fn, void *cb_data)1928{1929 struct packed_ref_cache *packed_ref_cache;1930 struct ref_dir *loose_dir;1931 struct ref_dir *packed_dir;1932 int retval = 0;19331934 /*1935 * We must make sure that all loose refs are read before accessing the1936 * packed-refs file; this avoids a race condition in which loose refs1937 * are migrated to the packed-refs file by a simultaneous process, but1938 * our in-memory view is from before the migration. get_packed_ref_cache()1939 * takes care of making sure our view is up to date with what is on1940 * disk.1941 */1942 loose_dir = get_loose_refs(refs);1943 if (base && *base) {1944 loose_dir = find_containing_dir(loose_dir, base, 0);1945 }1946 if (loose_dir)1947 prime_ref_dir(loose_dir);19481949 packed_ref_cache = get_packed_ref_cache(refs);1950 acquire_packed_ref_cache(packed_ref_cache);1951 packed_dir = get_packed_ref_dir(packed_ref_cache);1952 if (base && *base) {1953 packed_dir = find_containing_dir(packed_dir, base, 0);1954 }19551956 if (packed_dir && loose_dir) {1957 sort_ref_dir(packed_dir);1958 sort_ref_dir(loose_dir);1959 retval = do_for_each_entry_in_dirs(1960 packed_dir, loose_dir, fn, cb_data);1961 } else if (packed_dir) {1962 sort_ref_dir(packed_dir);1963 retval = do_for_each_entry_in_dir(1964 packed_dir, 0, fn, cb_data);1965 } else if (loose_dir) {1966 sort_ref_dir(loose_dir);1967 retval = do_for_each_entry_in_dir(1968 loose_dir, 0, fn, cb_data);1969 }19701971 release_packed_ref_cache(packed_ref_cache);1972 return retval;1973}19741975/*1976 * Call fn for each reference in the specified ref_cache for which the1977 * refname begins with base. If trim is non-zero, then trim that many1978 * characters off the beginning of each refname before passing the1979 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include1980 * broken references in the iteration. If fn ever returns a non-zero1981 * value, stop the iteration and return that value; otherwise, return1982 * 0.1983 */1984static int do_for_each_ref(struct ref_cache *refs, const char *base,1985 each_ref_fn fn, int trim, int flags, void *cb_data)1986{1987 struct ref_entry_cb data;1988 data.base = base;1989 data.trim = trim;1990 data.flags = flags;1991 data.fn = fn;1992 data.cb_data = cb_data;19931994 if (ref_paranoia < 0)1995 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);1996 if (ref_paranoia)1997 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;19981999 return do_for_each_entry(refs, base, do_one_ref, &data);2000}20012002static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)2003{2004 unsigned char sha1[20];2005 int flag;20062007 if (submodule) {2008 if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0)2009 return fn("HEAD", sha1, 0, cb_data);20102011 return 0;2012 }20132014 if (!read_ref_full("HEAD", RESOLVE_REF_READING, sha1, &flag))2015 return fn("HEAD", sha1, flag, cb_data);20162017 return 0;2018}20192020int head_ref(each_ref_fn fn, void *cb_data)2021{2022 return do_head_ref(NULL, fn, cb_data);2023}20242025int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2026{2027 return do_head_ref(submodule, fn, cb_data);2028}20292030int for_each_ref(each_ref_fn fn, void *cb_data)2031{2032 return do_for_each_ref(&ref_cache, "", fn, 0, 0, cb_data);2033}20342035int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2036{2037 return do_for_each_ref(get_ref_cache(submodule), "", fn, 0, 0, cb_data);2038}20392040int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)2041{2042 return do_for_each_ref(&ref_cache, prefix, fn, strlen(prefix), 0, cb_data);2043}20442045int for_each_ref_in_submodule(const char *submodule, const char *prefix,2046 each_ref_fn fn, void *cb_data)2047{2048 return do_for_each_ref(get_ref_cache(submodule), prefix, fn, strlen(prefix), 0, cb_data);2049}20502051int for_each_tag_ref(each_ref_fn fn, void *cb_data)2052{2053 return for_each_ref_in("refs/tags/", fn, cb_data);2054}20552056int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2057{2058 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);2059}20602061int for_each_branch_ref(each_ref_fn fn, void *cb_data)2062{2063 return for_each_ref_in("refs/heads/", fn, cb_data);2064}20652066int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2067{2068 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);2069}20702071int for_each_remote_ref(each_ref_fn fn, void *cb_data)2072{2073 return for_each_ref_in("refs/remotes/", fn, cb_data);2074}20752076int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2077{2078 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);2079}20802081int for_each_replace_ref(each_ref_fn fn, void *cb_data)2082{2083 return do_for_each_ref(&ref_cache, "refs/replace/", fn, 13, 0, cb_data);2084}20852086int head_ref_namespaced(each_ref_fn fn, void *cb_data)2087{2088 struct strbuf buf = STRBUF_INIT;2089 int ret = 0;2090 unsigned char sha1[20];2091 int flag;20922093 strbuf_addf(&buf, "%sHEAD", get_git_namespace());2094 if (!read_ref_full(buf.buf, RESOLVE_REF_READING, sha1, &flag))2095 ret = fn(buf.buf, sha1, flag, cb_data);2096 strbuf_release(&buf);20972098 return ret;2099}21002101int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)2102{2103 struct strbuf buf = STRBUF_INIT;2104 int ret;2105 strbuf_addf(&buf, "%srefs/", get_git_namespace());2106 ret = do_for_each_ref(&ref_cache, buf.buf, fn, 0, 0, cb_data);2107 strbuf_release(&buf);2108 return ret;2109}21102111int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,2112 const char *prefix, void *cb_data)2113{2114 struct strbuf real_pattern = STRBUF_INIT;2115 struct ref_filter filter;2116 int ret;21172118 if (!prefix && !starts_with(pattern, "refs/"))2119 strbuf_addstr(&real_pattern, "refs/");2120 else if (prefix)2121 strbuf_addstr(&real_pattern, prefix);2122 strbuf_addstr(&real_pattern, pattern);21232124 if (!has_glob_specials(pattern)) {2125 /* Append implied '/' '*' if not present. */2126 if (real_pattern.buf[real_pattern.len - 1] != '/')2127 strbuf_addch(&real_pattern, '/');2128 /* No need to check for '*', there is none. */2129 strbuf_addch(&real_pattern, '*');2130 }21312132 filter.pattern = real_pattern.buf;2133 filter.fn = fn;2134 filter.cb_data = cb_data;2135 ret = for_each_ref(filter_refs, &filter);21362137 strbuf_release(&real_pattern);2138 return ret;2139}21402141int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)2142{2143 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);2144}21452146int for_each_rawref(each_ref_fn fn, void *cb_data)2147{2148 return do_for_each_ref(&ref_cache, "", fn, 0,2149 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);2150}21512152const char *prettify_refname(const char *name)2153{2154 return name + (2155 starts_with(name, "refs/heads/") ? 11 :2156 starts_with(name, "refs/tags/") ? 10 :2157 starts_with(name, "refs/remotes/") ? 13 :2158 0);2159}21602161static const char *ref_rev_parse_rules[] = {2162 "%.*s",2163 "refs/%.*s",2164 "refs/tags/%.*s",2165 "refs/heads/%.*s",2166 "refs/remotes/%.*s",2167 "refs/remotes/%.*s/HEAD",2168 NULL2169};21702171int refname_match(const char *abbrev_name, const char *full_name)2172{2173 const char **p;2174 const int abbrev_name_len = strlen(abbrev_name);21752176 for (p = ref_rev_parse_rules; *p; p++) {2177 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {2178 return 1;2179 }2180 }21812182 return 0;2183}21842185static void unlock_ref(struct ref_lock *lock)2186{2187 /* Do not free lock->lk -- atexit() still looks at them */2188 if (lock->lk)2189 rollback_lock_file(lock->lk);2190 free(lock->ref_name);2191 free(lock->orig_ref_name);2192 free(lock);2193}21942195/* This function should make sure errno is meaningful on error */2196static struct ref_lock *verify_lock(struct ref_lock *lock,2197 const unsigned char *old_sha1, int mustexist)2198{2199 if (read_ref_full(lock->ref_name,2200 mustexist ? RESOLVE_REF_READING : 0,2201 lock->old_sha1, NULL)) {2202 int save_errno = errno;2203 error("Can't verify ref %s", lock->ref_name);2204 unlock_ref(lock);2205 errno = save_errno;2206 return NULL;2207 }2208 if (hashcmp(lock->old_sha1, old_sha1)) {2209 error("Ref %s is at %s but expected %s", lock->ref_name,2210 sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1));2211 unlock_ref(lock);2212 errno = EBUSY;2213 return NULL;2214 }2215 return lock;2216}22172218static int remove_empty_directories(const char *file)2219{2220 /* we want to create a file but there is a directory there;2221 * if that is an empty directory (or a directory that contains2222 * only empty directories), remove them.2223 */2224 struct strbuf path;2225 int result, save_errno;22262227 strbuf_init(&path, 20);2228 strbuf_addstr(&path, file);22292230 result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);2231 save_errno = errno;22322233 strbuf_release(&path);2234 errno = save_errno;22352236 return result;2237}22382239/*2240 * *string and *len will only be substituted, and *string returned (for2241 * later free()ing) if the string passed in is a magic short-hand form2242 * to name a branch.2243 */2244static char *substitute_branch_name(const char **string, int *len)2245{2246 struct strbuf buf = STRBUF_INIT;2247 int ret = interpret_branch_name(*string, *len, &buf);22482249 if (ret == *len) {2250 size_t size;2251 *string = strbuf_detach(&buf, &size);2252 *len = size;2253 return (char *)*string;2254 }22552256 return NULL;2257}22582259int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)2260{2261 char *last_branch = substitute_branch_name(&str, &len);2262 const char **p, *r;2263 int refs_found = 0;22642265 *ref = NULL;2266 for (p = ref_rev_parse_rules; *p; p++) {2267 char fullref[PATH_MAX];2268 unsigned char sha1_from_ref[20];2269 unsigned char *this_result;2270 int flag;22712272 this_result = refs_found ? sha1_from_ref : sha1;2273 mksnpath(fullref, sizeof(fullref), *p, len, str);2274 r = resolve_ref_unsafe(fullref, RESOLVE_REF_READING,2275 this_result, &flag);2276 if (r) {2277 if (!refs_found++)2278 *ref = xstrdup(r);2279 if (!warn_ambiguous_refs)2280 break;2281 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {2282 warning("ignoring dangling symref %s.", fullref);2283 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {2284 warning("ignoring broken ref %s.", fullref);2285 }2286 }2287 free(last_branch);2288 return refs_found;2289}22902291int dwim_log(const char *str, int len, unsigned char *sha1, char **log)2292{2293 char *last_branch = substitute_branch_name(&str, &len);2294 const char **p;2295 int logs_found = 0;22962297 *log = NULL;2298 for (p = ref_rev_parse_rules; *p; p++) {2299 unsigned char hash[20];2300 char path[PATH_MAX];2301 const char *ref, *it;23022303 mksnpath(path, sizeof(path), *p, len, str);2304 ref = resolve_ref_unsafe(path, RESOLVE_REF_READING,2305 hash, NULL);2306 if (!ref)2307 continue;2308 if (reflog_exists(path))2309 it = path;2310 else if (strcmp(ref, path) && reflog_exists(ref))2311 it = ref;2312 else2313 continue;2314 if (!logs_found++) {2315 *log = xstrdup(it);2316 hashcpy(sha1, hash);2317 }2318 if (!warn_ambiguous_refs)2319 break;2320 }2321 free(last_branch);2322 return logs_found;2323}23242325/*2326 * Locks a ref returning the lock on success and NULL on failure.2327 * On failure errno is set to something meaningful.2328 */2329static struct ref_lock *lock_ref_sha1_basic(const char *refname,2330 const unsigned char *old_sha1,2331 const struct string_list *extras,2332 const struct string_list *skip,2333 unsigned int flags, int *type_p)2334{2335 char *ref_file;2336 const char *orig_refname = refname;2337 struct ref_lock *lock;2338 int last_errno = 0;2339 int type, lflags;2340 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2341 int resolve_flags = 0;2342 int attempts_remaining = 3;23432344 lock = xcalloc(1, sizeof(struct ref_lock));2345 lock->lock_fd = -1;23462347 if (mustexist)2348 resolve_flags |= RESOLVE_REF_READING;2349 if (flags & REF_DELETING) {2350 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;2351 if (flags & REF_NODEREF)2352 resolve_flags |= RESOLVE_REF_NO_RECURSE;2353 }23542355 refname = resolve_ref_unsafe(refname, resolve_flags,2356 lock->old_sha1, &type);2357 if (!refname && errno == EISDIR) {2358 /* we are trying to lock foo but we used to2359 * have foo/bar which now does not exist;2360 * it is normal for the empty directory 'foo'2361 * to remain.2362 */2363 ref_file = git_path("%s", orig_refname);2364 if (remove_empty_directories(ref_file)) {2365 last_errno = errno;2366 error("there are still refs under '%s'", orig_refname);2367 goto error_return;2368 }2369 refname = resolve_ref_unsafe(orig_refname, resolve_flags,2370 lock->old_sha1, &type);2371 }2372 if (type_p)2373 *type_p = type;2374 if (!refname) {2375 last_errno = errno;2376 error("unable to resolve reference %s: %s",2377 orig_refname, strerror(errno));2378 goto error_return;2379 }2380 /*2381 * If the ref did not exist and we are creating it, make sure2382 * there is no existing packed ref whose name begins with our2383 * refname, nor a packed ref whose name is a proper prefix of2384 * our refname.2385 */2386 if (is_null_sha1(lock->old_sha1) &&2387 verify_refname_available(refname, extras, skip, get_packed_refs(&ref_cache))) {2388 last_errno = ENOTDIR;2389 goto error_return;2390 }23912392 lock->lk = xcalloc(1, sizeof(struct lock_file));23932394 lflags = 0;2395 if (flags & REF_NODEREF) {2396 refname = orig_refname;2397 lflags |= LOCK_NO_DEREF;2398 }2399 lock->ref_name = xstrdup(refname);2400 lock->orig_ref_name = xstrdup(orig_refname);2401 ref_file = git_path("%s", refname);24022403 retry:2404 switch (safe_create_leading_directories(ref_file)) {2405 case SCLD_OK:2406 break; /* success */2407 case SCLD_VANISHED:2408 if (--attempts_remaining > 0)2409 goto retry;2410 /* fall through */2411 default:2412 last_errno = errno;2413 error("unable to create directory for %s", ref_file);2414 goto error_return;2415 }24162417 lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags);2418 if (lock->lock_fd < 0) {2419 last_errno = errno;2420 if (errno == ENOENT && --attempts_remaining > 0)2421 /*2422 * Maybe somebody just deleted one of the2423 * directories leading to ref_file. Try2424 * again:2425 */2426 goto retry;2427 else {2428 struct strbuf err = STRBUF_INIT;2429 unable_to_lock_message(ref_file, errno, &err);2430 error("%s", err.buf);2431 strbuf_release(&err);2432 goto error_return;2433 }2434 }2435 return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock;24362437 error_return:2438 unlock_ref(lock);2439 errno = last_errno;2440 return NULL;2441}24422443/*2444 * Write an entry to the packed-refs file for the specified refname.2445 * If peeled is non-NULL, write it as the entry's peeled value.2446 */2447static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,2448 unsigned char *peeled)2449{2450 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);2451 if (peeled)2452 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));2453}24542455/*2456 * An each_ref_entry_fn that writes the entry to a packed-refs file.2457 */2458static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)2459{2460 enum peel_status peel_status = peel_entry(entry, 0);24612462 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2463 error("internal error: %s is not a valid packed reference!",2464 entry->name);2465 write_packed_entry(cb_data, entry->name, entry->u.value.sha1,2466 peel_status == PEEL_PEELED ?2467 entry->u.value.peeled : NULL);2468 return 0;2469}24702471/* This should return a meaningful errno on failure */2472int lock_packed_refs(int flags)2473{2474 struct packed_ref_cache *packed_ref_cache;24752476 if (hold_lock_file_for_update(&packlock, git_path("packed-refs"), flags) < 0)2477 return -1;2478 /*2479 * Get the current packed-refs while holding the lock. If the2480 * packed-refs file has been modified since we last read it,2481 * this will automatically invalidate the cache and re-read2482 * the packed-refs file.2483 */2484 packed_ref_cache = get_packed_ref_cache(&ref_cache);2485 packed_ref_cache->lock = &packlock;2486 /* Increment the reference count to prevent it from being freed: */2487 acquire_packed_ref_cache(packed_ref_cache);2488 return 0;2489}24902491/*2492 * Commit the packed refs changes.2493 * On error we must make sure that errno contains a meaningful value.2494 */2495int commit_packed_refs(void)2496{2497 struct packed_ref_cache *packed_ref_cache =2498 get_packed_ref_cache(&ref_cache);2499 int error = 0;2500 int save_errno = 0;2501 FILE *out;25022503 if (!packed_ref_cache->lock)2504 die("internal error: packed-refs not locked");25052506 out = fdopen_lock_file(packed_ref_cache->lock, "w");2507 if (!out)2508 die_errno("unable to fdopen packed-refs descriptor");25092510 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);2511 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),2512 0, write_packed_entry_fn, out);25132514 if (commit_lock_file(packed_ref_cache->lock)) {2515 save_errno = errno;2516 error = -1;2517 }2518 packed_ref_cache->lock = NULL;2519 release_packed_ref_cache(packed_ref_cache);2520 errno = save_errno;2521 return error;2522}25232524void rollback_packed_refs(void)2525{2526 struct packed_ref_cache *packed_ref_cache =2527 get_packed_ref_cache(&ref_cache);25282529 if (!packed_ref_cache->lock)2530 die("internal error: packed-refs not locked");2531 rollback_lock_file(packed_ref_cache->lock);2532 packed_ref_cache->lock = NULL;2533 release_packed_ref_cache(packed_ref_cache);2534 clear_packed_ref_cache(&ref_cache);2535}25362537struct ref_to_prune {2538 struct ref_to_prune *next;2539 unsigned char sha1[20];2540 char name[FLEX_ARRAY];2541};25422543struct pack_refs_cb_data {2544 unsigned int flags;2545 struct ref_dir *packed_refs;2546 struct ref_to_prune *ref_to_prune;2547};25482549/*2550 * An each_ref_entry_fn that is run over loose references only. If2551 * the loose reference can be packed, add an entry in the packed ref2552 * cache. If the reference should be pruned, also add it to2553 * ref_to_prune in the pack_refs_cb_data.2554 */2555static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)2556{2557 struct pack_refs_cb_data *cb = cb_data;2558 enum peel_status peel_status;2559 struct ref_entry *packed_entry;2560 int is_tag_ref = starts_with(entry->name, "refs/tags/");25612562 /* ALWAYS pack tags */2563 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2564 return 0;25652566 /* Do not pack symbolic or broken refs: */2567 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2568 return 0;25692570 /* Add a packed ref cache entry equivalent to the loose entry. */2571 peel_status = peel_entry(entry, 1);2572 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2573 die("internal error peeling reference %s (%s)",2574 entry->name, sha1_to_hex(entry->u.value.sha1));2575 packed_entry = find_ref(cb->packed_refs, entry->name);2576 if (packed_entry) {2577 /* Overwrite existing packed entry with info from loose entry */2578 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2579 hashcpy(packed_entry->u.value.sha1, entry->u.value.sha1);2580 } else {2581 packed_entry = create_ref_entry(entry->name, entry->u.value.sha1,2582 REF_ISPACKED | REF_KNOWS_PEELED, 0);2583 add_ref(cb->packed_refs, packed_entry);2584 }2585 hashcpy(packed_entry->u.value.peeled, entry->u.value.peeled);25862587 /* Schedule the loose reference for pruning if requested. */2588 if ((cb->flags & PACK_REFS_PRUNE)) {2589 int namelen = strlen(entry->name) + 1;2590 struct ref_to_prune *n = xcalloc(1, sizeof(*n) + namelen);2591 hashcpy(n->sha1, entry->u.value.sha1);2592 strcpy(n->name, entry->name);2593 n->next = cb->ref_to_prune;2594 cb->ref_to_prune = n;2595 }2596 return 0;2597}25982599/*2600 * Remove empty parents, but spare refs/ and immediate subdirs.2601 * Note: munges *name.2602 */2603static void try_remove_empty_parents(char *name)2604{2605 char *p, *q;2606 int i;2607 p = name;2608 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */2609 while (*p && *p != '/')2610 p++;2611 /* tolerate duplicate slashes; see check_refname_format() */2612 while (*p == '/')2613 p++;2614 }2615 for (q = p; *q; q++)2616 ;2617 while (1) {2618 while (q > p && *q != '/')2619 q--;2620 while (q > p && *(q-1) == '/')2621 q--;2622 if (q == p)2623 break;2624 *q = '\0';2625 if (rmdir(git_path("%s", name)))2626 break;2627 }2628}26292630/* make sure nobody touched the ref, and unlink */2631static void prune_ref(struct ref_to_prune *r)2632{2633 struct ref_transaction *transaction;2634 struct strbuf err = STRBUF_INIT;26352636 if (check_refname_format(r->name, 0))2637 return;26382639 transaction = ref_transaction_begin(&err);2640 if (!transaction ||2641 ref_transaction_delete(transaction, r->name, r->sha1,2642 REF_ISPRUNING, NULL, &err) ||2643 ref_transaction_commit(transaction, &err)) {2644 ref_transaction_free(transaction);2645 error("%s", err.buf);2646 strbuf_release(&err);2647 return;2648 }2649 ref_transaction_free(transaction);2650 strbuf_release(&err);2651 try_remove_empty_parents(r->name);2652}26532654static void prune_refs(struct ref_to_prune *r)2655{2656 while (r) {2657 prune_ref(r);2658 r = r->next;2659 }2660}26612662int pack_refs(unsigned int flags)2663{2664 struct pack_refs_cb_data cbdata;26652666 memset(&cbdata, 0, sizeof(cbdata));2667 cbdata.flags = flags;26682669 lock_packed_refs(LOCK_DIE_ON_ERROR);2670 cbdata.packed_refs = get_packed_refs(&ref_cache);26712672 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,2673 pack_if_possible_fn, &cbdata);26742675 if (commit_packed_refs())2676 die_errno("unable to overwrite old ref-pack file");26772678 prune_refs(cbdata.ref_to_prune);2679 return 0;2680}26812682int repack_without_refs(struct string_list *refnames, struct strbuf *err)2683{2684 struct ref_dir *packed;2685 struct string_list_item *refname;2686 int ret, needs_repacking = 0, removed = 0;26872688 assert(err);26892690 /* Look for a packed ref */2691 for_each_string_list_item(refname, refnames) {2692 if (get_packed_ref(refname->string)) {2693 needs_repacking = 1;2694 break;2695 }2696 }26972698 /* Avoid locking if we have nothing to do */2699 if (!needs_repacking)2700 return 0; /* no refname exists in packed refs */27012702 if (lock_packed_refs(0)) {2703 unable_to_lock_message(git_path("packed-refs"), errno, err);2704 return -1;2705 }2706 packed = get_packed_refs(&ref_cache);27072708 /* Remove refnames from the cache */2709 for_each_string_list_item(refname, refnames)2710 if (remove_entry(packed, refname->string) != -1)2711 removed = 1;2712 if (!removed) {2713 /*2714 * All packed entries disappeared while we were2715 * acquiring the lock.2716 */2717 rollback_packed_refs();2718 return 0;2719 }27202721 /* Write what remains */2722 ret = commit_packed_refs();2723 if (ret)2724 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",2725 strerror(errno));2726 return ret;2727}27282729static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)2730{2731 assert(err);27322733 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2734 /*2735 * loose. The loose file name is the same as the2736 * lockfile name, minus ".lock":2737 */2738 char *loose_filename = get_locked_file_path(lock->lk);2739 int res = unlink_or_msg(loose_filename, err);2740 free(loose_filename);2741 if (res)2742 return 1;2743 }2744 return 0;2745}27462747int delete_ref(const char *refname, const unsigned char *sha1, unsigned int flags)2748{2749 struct ref_transaction *transaction;2750 struct strbuf err = STRBUF_INIT;27512752 transaction = ref_transaction_begin(&err);2753 if (!transaction ||2754 ref_transaction_delete(transaction, refname,2755 (sha1 && !is_null_sha1(sha1)) ? sha1 : NULL,2756 flags, NULL, &err) ||2757 ref_transaction_commit(transaction, &err)) {2758 error("%s", err.buf);2759 ref_transaction_free(transaction);2760 strbuf_release(&err);2761 return 1;2762 }2763 ref_transaction_free(transaction);2764 strbuf_release(&err);2765 return 0;2766}27672768/*2769 * People using contrib's git-new-workdir have .git/logs/refs ->2770 * /some/other/path/.git/logs/refs, and that may live on another device.2771 *2772 * IOW, to avoid cross device rename errors, the temporary renamed log must2773 * live into logs/refs.2774 */2775#define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"27762777static int rename_tmp_log(const char *newrefname)2778{2779 int attempts_remaining = 4;27802781 retry:2782 switch (safe_create_leading_directories(git_path("logs/%s", newrefname))) {2783 case SCLD_OK:2784 break; /* success */2785 case SCLD_VANISHED:2786 if (--attempts_remaining > 0)2787 goto retry;2788 /* fall through */2789 default:2790 error("unable to create directory for %s", newrefname);2791 return -1;2792 }27932794 if (rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {2795 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {2796 /*2797 * rename(a, b) when b is an existing2798 * directory ought to result in ISDIR, but2799 * Solaris 5.8 gives ENOTDIR. Sheesh.2800 */2801 if (remove_empty_directories(git_path("logs/%s", newrefname))) {2802 error("Directory not empty: logs/%s", newrefname);2803 return -1;2804 }2805 goto retry;2806 } else if (errno == ENOENT && --attempts_remaining > 0) {2807 /*2808 * Maybe another process just deleted one of2809 * the directories in the path to newrefname.2810 * Try again from the beginning.2811 */2812 goto retry;2813 } else {2814 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",2815 newrefname, strerror(errno));2816 return -1;2817 }2818 }2819 return 0;2820}28212822static int rename_ref_available(const char *oldname, const char *newname)2823{2824 struct string_list skip = STRING_LIST_INIT_NODUP;2825 int ret;28262827 string_list_insert(&skip, oldname);2828 ret = !verify_refname_available(newname, NULL, &skip,2829 get_packed_refs(&ref_cache))2830 && !verify_refname_available(newname, NULL, &skip,2831 get_loose_refs(&ref_cache));2832 string_list_clear(&skip, 0);2833 return ret;2834}28352836static int write_ref_sha1(struct ref_lock *lock, const unsigned char *sha1,2837 const char *logmsg);28382839int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)2840{2841 unsigned char sha1[20], orig_sha1[20];2842 int flag = 0, logmoved = 0;2843 struct ref_lock *lock;2844 struct stat loginfo;2845 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2846 const char *symref = NULL;28472848 if (log && S_ISLNK(loginfo.st_mode))2849 return error("reflog for %s is a symlink", oldrefname);28502851 symref = resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,2852 orig_sha1, &flag);2853 if (flag & REF_ISSYMREF)2854 return error("refname %s is a symbolic ref, renaming it is not supported",2855 oldrefname);2856 if (!symref)2857 return error("refname %s not found", oldrefname);28582859 if (!rename_ref_available(oldrefname, newrefname))2860 return 1;28612862 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))2863 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",2864 oldrefname, strerror(errno));28652866 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2867 error("unable to delete old %s", oldrefname);2868 goto rollback;2869 }28702871 if (!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&2872 delete_ref(newrefname, sha1, REF_NODEREF)) {2873 if (errno==EISDIR) {2874 if (remove_empty_directories(git_path("%s", newrefname))) {2875 error("Directory not empty: %s", newrefname);2876 goto rollback;2877 }2878 } else {2879 error("unable to delete existing %s", newrefname);2880 goto rollback;2881 }2882 }28832884 if (log && rename_tmp_log(newrefname))2885 goto rollback;28862887 logmoved = log;28882889 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, NULL, 0, NULL);2890 if (!lock) {2891 error("unable to lock %s for update", newrefname);2892 goto rollback;2893 }2894 hashcpy(lock->old_sha1, orig_sha1);2895 if (write_ref_sha1(lock, orig_sha1, logmsg)) {2896 error("unable to write current sha1 into %s", newrefname);2897 goto rollback;2898 }28992900 return 0;29012902 rollback:2903 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, NULL, 0, NULL);2904 if (!lock) {2905 error("unable to lock %s for rollback", oldrefname);2906 goto rollbacklog;2907 }29082909 flag = log_all_ref_updates;2910 log_all_ref_updates = 0;2911 if (write_ref_sha1(lock, orig_sha1, NULL))2912 error("unable to write current sha1 into %s", oldrefname);2913 log_all_ref_updates = flag;29142915 rollbacklog:2916 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))2917 error("unable to restore logfile %s from %s: %s",2918 oldrefname, newrefname, strerror(errno));2919 if (!logmoved && log &&2920 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))2921 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",2922 oldrefname, strerror(errno));29232924 return 1;2925}29262927static int close_ref(struct ref_lock *lock)2928{2929 if (close_lock_file(lock->lk))2930 return -1;2931 lock->lock_fd = -1;2932 return 0;2933}29342935static int commit_ref(struct ref_lock *lock)2936{2937 if (commit_lock_file(lock->lk))2938 return -1;2939 lock->lock_fd = -1;2940 return 0;2941}29422943/*2944 * copy the reflog message msg to buf, which has been allocated sufficiently2945 * large, while cleaning up the whitespaces. Especially, convert LF to space,2946 * because reflog file is one line per entry.2947 */2948static int copy_msg(char *buf, const char *msg)2949{2950 char *cp = buf;2951 char c;2952 int wasspace = 1;29532954 *cp++ = '\t';2955 while ((c = *msg++)) {2956 if (wasspace && isspace(c))2957 continue;2958 wasspace = isspace(c);2959 if (wasspace)2960 c = ' ';2961 *cp++ = c;2962 }2963 while (buf < cp && isspace(cp[-1]))2964 cp--;2965 *cp++ = '\n';2966 return cp - buf;2967}29682969/* This function must set a meaningful errno on failure */2970int log_ref_setup(const char *refname, char *logfile, int bufsize)2971{2972 int logfd, oflags = O_APPEND | O_WRONLY;29732974 git_snpath(logfile, bufsize, "logs/%s", refname);2975 if (log_all_ref_updates &&2976 (starts_with(refname, "refs/heads/") ||2977 starts_with(refname, "refs/remotes/") ||2978 starts_with(refname, "refs/notes/") ||2979 !strcmp(refname, "HEAD"))) {2980 if (safe_create_leading_directories(logfile) < 0) {2981 int save_errno = errno;2982 error("unable to create directory for %s", logfile);2983 errno = save_errno;2984 return -1;2985 }2986 oflags |= O_CREAT;2987 }29882989 logfd = open(logfile, oflags, 0666);2990 if (logfd < 0) {2991 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2992 return 0;29932994 if (errno == EISDIR) {2995 if (remove_empty_directories(logfile)) {2996 int save_errno = errno;2997 error("There are still logs under '%s'",2998 logfile);2999 errno = save_errno;3000 return -1;3001 }3002 logfd = open(logfile, oflags, 0666);3003 }30043005 if (logfd < 0) {3006 int save_errno = errno;3007 error("Unable to append to %s: %s", logfile,3008 strerror(errno));3009 errno = save_errno;3010 return -1;3011 }3012 }30133014 adjust_shared_perm(logfile);3015 close(logfd);3016 return 0;3017}30183019static int log_ref_write_fd(int fd, const unsigned char *old_sha1,3020 const unsigned char *new_sha1,3021 const char *committer, const char *msg)3022{3023 int msglen, written;3024 unsigned maxlen, len;3025 char *logrec;30263027 msglen = msg ? strlen(msg) : 0;3028 maxlen = strlen(committer) + msglen + 100;3029 logrec = xmalloc(maxlen);3030 len = sprintf(logrec, "%s %s %s\n",3031 sha1_to_hex(old_sha1),3032 sha1_to_hex(new_sha1),3033 committer);3034 if (msglen)3035 len += copy_msg(logrec + len - 1, msg) - 1;30363037 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;3038 free(logrec);3039 if (written != len)3040 return -1;30413042 return 0;3043}30443045static int log_ref_write(const char *refname, const unsigned char *old_sha1,3046 const unsigned char *new_sha1, const char *msg)3047{3048 int logfd, result, oflags = O_APPEND | O_WRONLY;3049 char log_file[PATH_MAX];30503051 if (log_all_ref_updates < 0)3052 log_all_ref_updates = !is_bare_repository();30533054 result = log_ref_setup(refname, log_file, sizeof(log_file));3055 if (result)3056 return result;30573058 logfd = open(log_file, oflags);3059 if (logfd < 0)3060 return 0;3061 result = log_ref_write_fd(logfd, old_sha1, new_sha1,3062 git_committer_info(0), msg);3063 if (result) {3064 int save_errno = errno;3065 close(logfd);3066 error("Unable to append to %s", log_file);3067 errno = save_errno;3068 return -1;3069 }3070 if (close(logfd)) {3071 int save_errno = errno;3072 error("Unable to append to %s", log_file);3073 errno = save_errno;3074 return -1;3075 }3076 return 0;3077}30783079int is_branch(const char *refname)3080{3081 return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");3082}30833084/*3085 * Write sha1 into the ref specified by the lock. Make sure that errno3086 * is sane on error.3087 */3088static int write_ref_sha1(struct ref_lock *lock,3089 const unsigned char *sha1, const char *logmsg)3090{3091 static char term = '\n';3092 struct object *o;30933094 o = parse_object(sha1);3095 if (!o) {3096 error("Trying to write ref %s with nonexistent object %s",3097 lock->ref_name, sha1_to_hex(sha1));3098 unlock_ref(lock);3099 errno = EINVAL;3100 return -1;3101 }3102 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {3103 error("Trying to write non-commit object %s to branch %s",3104 sha1_to_hex(sha1), lock->ref_name);3105 unlock_ref(lock);3106 errno = EINVAL;3107 return -1;3108 }3109 if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 ||3110 write_in_full(lock->lock_fd, &term, 1) != 1 ||3111 close_ref(lock) < 0) {3112 int save_errno = errno;3113 error("Couldn't write %s", lock->lk->filename.buf);3114 unlock_ref(lock);3115 errno = save_errno;3116 return -1;3117 }3118 clear_loose_ref_cache(&ref_cache);3119 if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 ||3120 (strcmp(lock->ref_name, lock->orig_ref_name) &&3121 log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) {3122 unlock_ref(lock);3123 return -1;3124 }3125 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {3126 /*3127 * Special hack: If a branch is updated directly and HEAD3128 * points to it (may happen on the remote side of a push3129 * for example) then logically the HEAD reflog should be3130 * updated too.3131 * A generic solution implies reverse symref information,3132 * but finding all symrefs pointing to the given branch3133 * would be rather costly for this rare event (the direct3134 * update of a branch) to be worth it. So let's cheat and3135 * check with HEAD only which should cover 99% of all usage3136 * scenarios (even 100% of the default ones).3137 */3138 unsigned char head_sha1[20];3139 int head_flag;3140 const char *head_ref;3141 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3142 head_sha1, &head_flag);3143 if (head_ref && (head_flag & REF_ISSYMREF) &&3144 !strcmp(head_ref, lock->ref_name))3145 log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);3146 }3147 if (commit_ref(lock)) {3148 error("Couldn't set %s", lock->ref_name);3149 unlock_ref(lock);3150 return -1;3151 }3152 unlock_ref(lock);3153 return 0;3154}31553156int create_symref(const char *ref_target, const char *refs_heads_master,3157 const char *logmsg)3158{3159 const char *lockpath;3160 char ref[1000];3161 int fd, len, written;3162 char *git_HEAD = git_pathdup("%s", ref_target);3163 unsigned char old_sha1[20], new_sha1[20];31643165 if (logmsg && read_ref(ref_target, old_sha1))3166 hashclr(old_sha1);31673168 if (safe_create_leading_directories(git_HEAD) < 0)3169 return error("unable to create directory for %s", git_HEAD);31703171#ifndef NO_SYMLINK_HEAD3172 if (prefer_symlink_refs) {3173 unlink(git_HEAD);3174 if (!symlink(refs_heads_master, git_HEAD))3175 goto done;3176 fprintf(stderr, "no symlink - falling back to symbolic ref\n");3177 }3178#endif31793180 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);3181 if (sizeof(ref) <= len) {3182 error("refname too long: %s", refs_heads_master);3183 goto error_free_return;3184 }3185 lockpath = mkpath("%s.lock", git_HEAD);3186 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);3187 if (fd < 0) {3188 error("Unable to open %s for writing", lockpath);3189 goto error_free_return;3190 }3191 written = write_in_full(fd, ref, len);3192 if (close(fd) != 0 || written != len) {3193 error("Unable to write to %s", lockpath);3194 goto error_unlink_return;3195 }3196 if (rename(lockpath, git_HEAD) < 0) {3197 error("Unable to create %s", git_HEAD);3198 goto error_unlink_return;3199 }3200 if (adjust_shared_perm(git_HEAD)) {3201 error("Unable to fix permissions on %s", lockpath);3202 error_unlink_return:3203 unlink_or_warn(lockpath);3204 error_free_return:3205 free(git_HEAD);3206 return -1;3207 }32083209#ifndef NO_SYMLINK_HEAD3210 done:3211#endif3212 if (logmsg && !read_ref(refs_heads_master, new_sha1))3213 log_ref_write(ref_target, old_sha1, new_sha1, logmsg);32143215 free(git_HEAD);3216 return 0;3217}32183219struct read_ref_at_cb {3220 const char *refname;3221 unsigned long at_time;3222 int cnt;3223 int reccnt;3224 unsigned char *sha1;3225 int found_it;32263227 unsigned char osha1[20];3228 unsigned char nsha1[20];3229 int tz;3230 unsigned long date;3231 char **msg;3232 unsigned long *cutoff_time;3233 int *cutoff_tz;3234 int *cutoff_cnt;3235};32363237static int read_ref_at_ent(unsigned char *osha1, unsigned char *nsha1,3238 const char *email, unsigned long timestamp, int tz,3239 const char *message, void *cb_data)3240{3241 struct read_ref_at_cb *cb = cb_data;32423243 cb->reccnt++;3244 cb->tz = tz;3245 cb->date = timestamp;32463247 if (timestamp <= cb->at_time || cb->cnt == 0) {3248 if (cb->msg)3249 *cb->msg = xstrdup(message);3250 if (cb->cutoff_time)3251 *cb->cutoff_time = timestamp;3252 if (cb->cutoff_tz)3253 *cb->cutoff_tz = tz;3254 if (cb->cutoff_cnt)3255 *cb->cutoff_cnt = cb->reccnt - 1;3256 /*3257 * we have not yet updated cb->[n|o]sha1 so they still3258 * hold the values for the previous record.3259 */3260 if (!is_null_sha1(cb->osha1)) {3261 hashcpy(cb->sha1, nsha1);3262 if (hashcmp(cb->osha1, nsha1))3263 warning("Log for ref %s has gap after %s.",3264 cb->refname, show_date(cb->date, cb->tz, DATE_RFC2822));3265 }3266 else if (cb->date == cb->at_time)3267 hashcpy(cb->sha1, nsha1);3268 else if (hashcmp(nsha1, cb->sha1))3269 warning("Log for ref %s unexpectedly ended on %s.",3270 cb->refname, show_date(cb->date, cb->tz,3271 DATE_RFC2822));3272 hashcpy(cb->osha1, osha1);3273 hashcpy(cb->nsha1, nsha1);3274 cb->found_it = 1;3275 return 1;3276 }3277 hashcpy(cb->osha1, osha1);3278 hashcpy(cb->nsha1, nsha1);3279 if (cb->cnt > 0)3280 cb->cnt--;3281 return 0;3282}32833284static int read_ref_at_ent_oldest(unsigned char *osha1, unsigned char *nsha1,3285 const char *email, unsigned long timestamp,3286 int tz, const char *message, void *cb_data)3287{3288 struct read_ref_at_cb *cb = cb_data;32893290 if (cb->msg)3291 *cb->msg = xstrdup(message);3292 if (cb->cutoff_time)3293 *cb->cutoff_time = timestamp;3294 if (cb->cutoff_tz)3295 *cb->cutoff_tz = tz;3296 if (cb->cutoff_cnt)3297 *cb->cutoff_cnt = cb->reccnt;3298 hashcpy(cb->sha1, osha1);3299 if (is_null_sha1(cb->sha1))3300 hashcpy(cb->sha1, nsha1);3301 /* We just want the first entry */3302 return 1;3303}33043305int read_ref_at(const char *refname, unsigned int flags, unsigned long at_time, int cnt,3306 unsigned char *sha1, char **msg,3307 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)3308{3309 struct read_ref_at_cb cb;33103311 memset(&cb, 0, sizeof(cb));3312 cb.refname = refname;3313 cb.at_time = at_time;3314 cb.cnt = cnt;3315 cb.msg = msg;3316 cb.cutoff_time = cutoff_time;3317 cb.cutoff_tz = cutoff_tz;3318 cb.cutoff_cnt = cutoff_cnt;3319 cb.sha1 = sha1;33203321 for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);33223323 if (!cb.reccnt) {3324 if (flags & GET_SHA1_QUIETLY)3325 exit(128);3326 else3327 die("Log for %s is empty.", refname);3328 }3329 if (cb.found_it)3330 return 0;33313332 for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);33333334 return 1;3335}33363337int reflog_exists(const char *refname)3338{3339 struct stat st;33403341 return !lstat(git_path("logs/%s", refname), &st) &&3342 S_ISREG(st.st_mode);3343}33443345int delete_reflog(const char *refname)3346{3347 return remove_path(git_path("logs/%s", refname));3348}33493350static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)3351{3352 unsigned char osha1[20], nsha1[20];3353 char *email_end, *message;3354 unsigned long timestamp;3355 int tz;33563357 /* old SP new SP name <email> SP time TAB msg LF */3358 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||3359 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||3360 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||3361 !(email_end = strchr(sb->buf + 82, '>')) ||3362 email_end[1] != ' ' ||3363 !(timestamp = strtoul(email_end + 2, &message, 10)) ||3364 !message || message[0] != ' ' ||3365 (message[1] != '+' && message[1] != '-') ||3366 !isdigit(message[2]) || !isdigit(message[3]) ||3367 !isdigit(message[4]) || !isdigit(message[5]))3368 return 0; /* corrupt? */3369 email_end[1] = '\0';3370 tz = strtol(message + 1, NULL, 10);3371 if (message[6] != '\t')3372 message += 6;3373 else3374 message += 7;3375 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);3376}33773378static char *find_beginning_of_line(char *bob, char *scan)3379{3380 while (bob < scan && *(--scan) != '\n')3381 ; /* keep scanning backwards */3382 /*3383 * Return either beginning of the buffer, or LF at the end of3384 * the previous line.3385 */3386 return scan;3387}33883389int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)3390{3391 struct strbuf sb = STRBUF_INIT;3392 FILE *logfp;3393 long pos;3394 int ret = 0, at_tail = 1;33953396 logfp = fopen(git_path("logs/%s", refname), "r");3397 if (!logfp)3398 return -1;33993400 /* Jump to the end */3401 if (fseek(logfp, 0, SEEK_END) < 0)3402 return error("cannot seek back reflog for %s: %s",3403 refname, strerror(errno));3404 pos = ftell(logfp);3405 while (!ret && 0 < pos) {3406 int cnt;3407 size_t nread;3408 char buf[BUFSIZ];3409 char *endp, *scanp;34103411 /* Fill next block from the end */3412 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;3413 if (fseek(logfp, pos - cnt, SEEK_SET))3414 return error("cannot seek back reflog for %s: %s",3415 refname, strerror(errno));3416 nread = fread(buf, cnt, 1, logfp);3417 if (nread != 1)3418 return error("cannot read %d bytes from reflog for %s: %s",3419 cnt, refname, strerror(errno));3420 pos -= cnt;34213422 scanp = endp = buf + cnt;3423 if (at_tail && scanp[-1] == '\n')3424 /* Looking at the final LF at the end of the file */3425 scanp--;3426 at_tail = 0;34273428 while (buf < scanp) {3429 /*3430 * terminating LF of the previous line, or the beginning3431 * of the buffer.3432 */3433 char *bp;34343435 bp = find_beginning_of_line(buf, scanp);34363437 if (*bp == '\n') {3438 /*3439 * The newline is the end of the previous line,3440 * so we know we have complete line starting3441 * at (bp + 1). Prefix it onto any prior data3442 * we collected for the line and process it.3443 */3444 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));3445 scanp = bp;3446 endp = bp + 1;3447 ret = show_one_reflog_ent(&sb, fn, cb_data);3448 strbuf_reset(&sb);3449 if (ret)3450 break;3451 } else if (!pos) {3452 /*3453 * We are at the start of the buffer, and the3454 * start of the file; there is no previous3455 * line, and we have everything for this one.3456 * Process it, and we can end the loop.3457 */3458 strbuf_splice(&sb, 0, 0, buf, endp - buf);3459 ret = show_one_reflog_ent(&sb, fn, cb_data);3460 strbuf_reset(&sb);3461 break;3462 }34633464 if (bp == buf) {3465 /*3466 * We are at the start of the buffer, and there3467 * is more file to read backwards. Which means3468 * we are in the middle of a line. Note that we3469 * may get here even if *bp was a newline; that3470 * just means we are at the exact end of the3471 * previous line, rather than some spot in the3472 * middle.3473 *3474 * Save away what we have to be combined with3475 * the data from the next read.3476 */3477 strbuf_splice(&sb, 0, 0, buf, endp - buf);3478 break;3479 }3480 }34813482 }3483 if (!ret && sb.len)3484 die("BUG: reverse reflog parser had leftover data");34853486 fclose(logfp);3487 strbuf_release(&sb);3488 return ret;3489}34903491int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)3492{3493 FILE *logfp;3494 struct strbuf sb = STRBUF_INIT;3495 int ret = 0;34963497 logfp = fopen(git_path("logs/%s", refname), "r");3498 if (!logfp)3499 return -1;35003501 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))3502 ret = show_one_reflog_ent(&sb, fn, cb_data);3503 fclose(logfp);3504 strbuf_release(&sb);3505 return ret;3506}3507/*3508 * Call fn for each reflog in the namespace indicated by name. name3509 * must be empty or end with '/'. Name will be used as a scratch3510 * space, but its contents will be restored before return.3511 */3512static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)3513{3514 DIR *d = opendir(git_path("logs/%s", name->buf));3515 int retval = 0;3516 struct dirent *de;3517 int oldlen = name->len;35183519 if (!d)3520 return name->len ? errno : 0;35213522 while ((de = readdir(d)) != NULL) {3523 struct stat st;35243525 if (de->d_name[0] == '.')3526 continue;3527 if (ends_with(de->d_name, ".lock"))3528 continue;3529 strbuf_addstr(name, de->d_name);3530 if (stat(git_path("logs/%s", name->buf), &st) < 0) {3531 ; /* silently ignore */3532 } else {3533 if (S_ISDIR(st.st_mode)) {3534 strbuf_addch(name, '/');3535 retval = do_for_each_reflog(name, fn, cb_data);3536 } else {3537 unsigned char sha1[20];3538 if (read_ref_full(name->buf, 0, sha1, NULL))3539 retval = error("bad ref for %s", name->buf);3540 else3541 retval = fn(name->buf, sha1, 0, cb_data);3542 }3543 if (retval)3544 break;3545 }3546 strbuf_setlen(name, oldlen);3547 }3548 closedir(d);3549 return retval;3550}35513552int for_each_reflog(each_ref_fn fn, void *cb_data)3553{3554 int retval;3555 struct strbuf name;3556 strbuf_init(&name, PATH_MAX);3557 retval = do_for_each_reflog(&name, fn, cb_data);3558 strbuf_release(&name);3559 return retval;3560}35613562/**3563 * Information needed for a single ref update. Set new_sha1 to the new3564 * value or to null_sha1 to delete the ref. To check the old value3565 * while the ref is locked, set (flags & REF_HAVE_OLD) and set3566 * old_sha1 to the old value, or to null_sha1 to ensure the ref does3567 * not exist before update.3568 */3569struct ref_update {3570 /*3571 * If (flags & REF_HAVE_NEW), set the reference to this value:3572 */3573 unsigned char new_sha1[20];3574 /*3575 * If (flags & REF_HAVE_OLD), check that the reference3576 * previously had this value:3577 */3578 unsigned char old_sha1[20];3579 /*3580 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,3581 * REF_DELETING, and REF_ISPRUNING:3582 */3583 unsigned int flags;3584 struct ref_lock *lock;3585 int type;3586 char *msg;3587 const char refname[FLEX_ARRAY];3588};35893590/*3591 * Transaction states.3592 * OPEN: The transaction is in a valid state and can accept new updates.3593 * An OPEN transaction can be committed.3594 * CLOSED: A closed transaction is no longer active and no other operations3595 * than free can be used on it in this state.3596 * A transaction can either become closed by successfully committing3597 * an active transaction or if there is a failure while building3598 * the transaction thus rendering it failed/inactive.3599 */3600enum ref_transaction_state {3601 REF_TRANSACTION_OPEN = 0,3602 REF_TRANSACTION_CLOSED = 13603};36043605/*3606 * Data structure for holding a reference transaction, which can3607 * consist of checks and updates to multiple references, carried out3608 * as atomically as possible. This structure is opaque to callers.3609 */3610struct ref_transaction {3611 struct ref_update **updates;3612 size_t alloc;3613 size_t nr;3614 enum ref_transaction_state state;3615};36163617struct ref_transaction *ref_transaction_begin(struct strbuf *err)3618{3619 assert(err);36203621 return xcalloc(1, sizeof(struct ref_transaction));3622}36233624void ref_transaction_free(struct ref_transaction *transaction)3625{3626 int i;36273628 if (!transaction)3629 return;36303631 for (i = 0; i < transaction->nr; i++) {3632 free(transaction->updates[i]->msg);3633 free(transaction->updates[i]);3634 }3635 free(transaction->updates);3636 free(transaction);3637}36383639static struct ref_update *add_update(struct ref_transaction *transaction,3640 const char *refname)3641{3642 size_t len = strlen(refname);3643 struct ref_update *update = xcalloc(1, sizeof(*update) + len + 1);36443645 strcpy((char *)update->refname, refname);3646 ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);3647 transaction->updates[transaction->nr++] = update;3648 return update;3649}36503651int ref_transaction_update(struct ref_transaction *transaction,3652 const char *refname,3653 const unsigned char *new_sha1,3654 const unsigned char *old_sha1,3655 unsigned int flags, const char *msg,3656 struct strbuf *err)3657{3658 struct ref_update *update;36593660 assert(err);36613662 if (transaction->state != REF_TRANSACTION_OPEN)3663 die("BUG: update called for transaction that is not open");36643665 if (new_sha1 && !is_null_sha1(new_sha1) &&3666 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {3667 strbuf_addf(err, "refusing to update ref with bad name %s",3668 refname);3669 return -1;3670 }36713672 update = add_update(transaction, refname);3673 if (new_sha1) {3674 hashcpy(update->new_sha1, new_sha1);3675 flags |= REF_HAVE_NEW;3676 }3677 if (old_sha1) {3678 hashcpy(update->old_sha1, old_sha1);3679 flags |= REF_HAVE_OLD;3680 }3681 update->flags = flags;3682 if (msg)3683 update->msg = xstrdup(msg);3684 return 0;3685}36863687int ref_transaction_create(struct ref_transaction *transaction,3688 const char *refname,3689 const unsigned char *new_sha1,3690 unsigned int flags, const char *msg,3691 struct strbuf *err)3692{3693 if (!new_sha1 || is_null_sha1(new_sha1))3694 die("BUG: create called without valid new_sha1");3695 return ref_transaction_update(transaction, refname, new_sha1,3696 null_sha1, flags, msg, err);3697}36983699int ref_transaction_delete(struct ref_transaction *transaction,3700 const char *refname,3701 const unsigned char *old_sha1,3702 unsigned int flags, const char *msg,3703 struct strbuf *err)3704{3705 if (old_sha1 && is_null_sha1(old_sha1))3706 die("BUG: delete called with old_sha1 set to zeros");3707 return ref_transaction_update(transaction, refname,3708 null_sha1, old_sha1,3709 flags, msg, err);3710}37113712int ref_transaction_verify(struct ref_transaction *transaction,3713 const char *refname,3714 const unsigned char *old_sha1,3715 unsigned int flags,3716 struct strbuf *err)3717{3718 if (!old_sha1)3719 die("BUG: verify called with old_sha1 set to NULL");3720 return ref_transaction_update(transaction, refname,3721 NULL, old_sha1,3722 flags, NULL, err);3723}37243725int update_ref(const char *msg, const char *refname,3726 const unsigned char *new_sha1, const unsigned char *old_sha1,3727 unsigned int flags, enum action_on_err onerr)3728{3729 struct ref_transaction *t;3730 struct strbuf err = STRBUF_INIT;37313732 t = ref_transaction_begin(&err);3733 if (!t ||3734 ref_transaction_update(t, refname, new_sha1, old_sha1,3735 flags, msg, &err) ||3736 ref_transaction_commit(t, &err)) {3737 const char *str = "update_ref failed for ref '%s': %s";37383739 ref_transaction_free(t);3740 switch (onerr) {3741 case UPDATE_REFS_MSG_ON_ERR:3742 error(str, refname, err.buf);3743 break;3744 case UPDATE_REFS_DIE_ON_ERR:3745 die(str, refname, err.buf);3746 break;3747 case UPDATE_REFS_QUIET_ON_ERR:3748 break;3749 }3750 strbuf_release(&err);3751 return 1;3752 }3753 strbuf_release(&err);3754 ref_transaction_free(t);3755 return 0;3756}37573758static int ref_update_reject_duplicates(struct string_list *refnames,3759 struct strbuf *err)3760{3761 int i, n = refnames->nr;37623763 assert(err);37643765 for (i = 1; i < n; i++)3766 if (!strcmp(refnames->items[i - 1].string, refnames->items[i].string)) {3767 strbuf_addf(err,3768 "Multiple updates for ref '%s' not allowed.",3769 refnames->items[i].string);3770 return 1;3771 }3772 return 0;3773}37743775int ref_transaction_commit(struct ref_transaction *transaction,3776 struct strbuf *err)3777{3778 int ret = 0, i;3779 int n = transaction->nr;3780 struct ref_update **updates = transaction->updates;3781 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3782 struct string_list_item *ref_to_delete;3783 struct string_list affected_refnames = STRING_LIST_INIT_NODUP;37843785 assert(err);37863787 if (transaction->state != REF_TRANSACTION_OPEN)3788 die("BUG: commit called for transaction that is not open");37893790 if (!n) {3791 transaction->state = REF_TRANSACTION_CLOSED;3792 return 0;3793 }37943795 /* Fail if a refname appears more than once in the transaction: */3796 for (i = 0; i < n; i++)3797 string_list_append(&affected_refnames, updates[i]->refname);3798 string_list_sort(&affected_refnames);3799 if (ref_update_reject_duplicates(&affected_refnames, err)) {3800 ret = TRANSACTION_GENERIC_ERROR;3801 goto cleanup;3802 }38033804 /* Acquire all locks while verifying old values */3805 for (i = 0; i < n; i++) {3806 struct ref_update *update = updates[i];3807 unsigned int flags = update->flags;38083809 if ((flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1))3810 flags |= REF_DELETING;3811 update->lock = lock_ref_sha1_basic(3812 update->refname,3813 ((update->flags & REF_HAVE_OLD) ?3814 update->old_sha1 : NULL),3815 &affected_refnames, NULL,3816 flags,3817 &update->type);3818 if (!update->lock) {3819 ret = (errno == ENOTDIR)3820 ? TRANSACTION_NAME_CONFLICT3821 : TRANSACTION_GENERIC_ERROR;3822 strbuf_addf(err, "Cannot lock the ref '%s'.",3823 update->refname);3824 goto cleanup;3825 }3826 }38273828 /* Perform updates first so live commits remain referenced */3829 for (i = 0; i < n; i++) {3830 struct ref_update *update = updates[i];3831 int flags = update->flags;38323833 if ((flags & REF_HAVE_NEW) && !is_null_sha1(update->new_sha1)) {3834 int overwriting_symref = ((update->type & REF_ISSYMREF) &&3835 (update->flags & REF_NODEREF));38363837 if (!overwriting_symref3838 && !hashcmp(update->lock->old_sha1, update->new_sha1)) {3839 /*3840 * The reference already has the desired3841 * value, so we don't need to write it.3842 */3843 unlock_ref(update->lock);3844 update->lock = NULL;3845 } else if (write_ref_sha1(update->lock, update->new_sha1,3846 update->msg)) {3847 update->lock = NULL; /* freed by write_ref_sha1 */3848 strbuf_addf(err, "Cannot update the ref '%s'.",3849 update->refname);3850 ret = TRANSACTION_GENERIC_ERROR;3851 goto cleanup;3852 } else {3853 /* freed by write_ref_sha1(): */3854 update->lock = NULL;3855 }3856 }3857 }38583859 /* Perform deletes now that updates are safely completed */3860 for (i = 0; i < n; i++) {3861 struct ref_update *update = updates[i];3862 int flags = update->flags;38633864 if ((flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1)) {3865 if (delete_ref_loose(update->lock, update->type, err)) {3866 ret = TRANSACTION_GENERIC_ERROR;3867 goto cleanup;3868 }38693870 if (!(flags & REF_ISPRUNING))3871 string_list_append(&refs_to_delete,3872 update->lock->ref_name);3873 }3874 }38753876 if (repack_without_refs(&refs_to_delete, err)) {3877 ret = TRANSACTION_GENERIC_ERROR;3878 goto cleanup;3879 }3880 for_each_string_list_item(ref_to_delete, &refs_to_delete)3881 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3882 clear_loose_ref_cache(&ref_cache);38833884cleanup:3885 transaction->state = REF_TRANSACTION_CLOSED;38863887 for (i = 0; i < n; i++)3888 if (updates[i]->lock)3889 unlock_ref(updates[i]->lock);3890 string_list_clear(&refs_to_delete, 0);3891 string_list_clear(&affected_refnames, 0);3892 return ret;3893}38943895char *shorten_unambiguous_ref(const char *refname, int strict)3896{3897 int i;3898 static char **scanf_fmts;3899 static int nr_rules;3900 char *short_name;39013902 if (!nr_rules) {3903 /*3904 * Pre-generate scanf formats from ref_rev_parse_rules[].3905 * Generate a format suitable for scanf from a3906 * ref_rev_parse_rules rule by interpolating "%s" at the3907 * location of the "%.*s".3908 */3909 size_t total_len = 0;3910 size_t offset = 0;39113912 /* the rule list is NULL terminated, count them first */3913 for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)3914 /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */3915 total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;39163917 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);39183919 offset = 0;3920 for (i = 0; i < nr_rules; i++) {3921 assert(offset < total_len);3922 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;3923 offset += snprintf(scanf_fmts[i], total_len - offset,3924 ref_rev_parse_rules[i], 2, "%s") + 1;3925 }3926 }39273928 /* bail out if there are no rules */3929 if (!nr_rules)3930 return xstrdup(refname);39313932 /* buffer for scanf result, at most refname must fit */3933 short_name = xstrdup(refname);39343935 /* skip first rule, it will always match */3936 for (i = nr_rules - 1; i > 0 ; --i) {3937 int j;3938 int rules_to_fail = i;3939 int short_name_len;39403941 if (1 != sscanf(refname, scanf_fmts[i], short_name))3942 continue;39433944 short_name_len = strlen(short_name);39453946 /*3947 * in strict mode, all (except the matched one) rules3948 * must fail to resolve to a valid non-ambiguous ref3949 */3950 if (strict)3951 rules_to_fail = nr_rules;39523953 /*3954 * check if the short name resolves to a valid ref,3955 * but use only rules prior to the matched one3956 */3957 for (j = 0; j < rules_to_fail; j++) {3958 const char *rule = ref_rev_parse_rules[j];3959 char refname[PATH_MAX];39603961 /* skip matched rule */3962 if (i == j)3963 continue;39643965 /*3966 * the short name is ambiguous, if it resolves3967 * (with this previous rule) to a valid ref3968 * read_ref() returns 0 on success3969 */3970 mksnpath(refname, sizeof(refname),3971 rule, short_name_len, short_name);3972 if (ref_exists(refname))3973 break;3974 }39753976 /*3977 * short name is non-ambiguous if all previous rules3978 * haven't resolved to a valid ref3979 */3980 if (j == rules_to_fail)3981 return short_name;3982 }39833984 free(short_name);3985 return xstrdup(refname);3986}39873988static struct string_list *hide_refs;39893990int parse_hide_refs_config(const char *var, const char *value, const char *section)3991{3992 if (!strcmp("transfer.hiderefs", var) ||3993 /* NEEDSWORK: use parse_config_key() once both are merged */3994 (starts_with(var, section) && var[strlen(section)] == '.' &&3995 !strcmp(var + strlen(section), ".hiderefs"))) {3996 char *ref;3997 int len;39983999 if (!value)4000 return config_error_nonbool(var);4001 ref = xstrdup(value);4002 len = strlen(ref);4003 while (len && ref[len - 1] == '/')4004 ref[--len] = '\0';4005 if (!hide_refs) {4006 hide_refs = xcalloc(1, sizeof(*hide_refs));4007 hide_refs->strdup_strings = 1;4008 }4009 string_list_append(hide_refs, ref);4010 }4011 return 0;4012}40134014int ref_is_hidden(const char *refname)4015{4016 struct string_list_item *item;40174018 if (!hide_refs)4019 return 0;4020 for_each_string_list_item(item, hide_refs) {4021 int len;4022 if (!starts_with(refname, item->string))4023 continue;4024 len = strlen(item->string);4025 if (!refname[len] || refname[len] == '/')4026 return 1;4027 }4028 return 0;4029}40304031struct expire_reflog_cb {4032 unsigned int flags;4033 reflog_expiry_should_prune_fn *should_prune_fn;4034 void *policy_cb;4035 FILE *newlog;4036 unsigned char last_kept_sha1[20];4037};40384039static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,4040 const char *email, unsigned long timestamp, int tz,4041 const char *message, void *cb_data)4042{4043 struct expire_reflog_cb *cb = cb_data;4044 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;40454046 if (cb->flags & EXPIRE_REFLOGS_REWRITE)4047 osha1 = cb->last_kept_sha1;40484049 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,4050 message, policy_cb)) {4051 if (!cb->newlog)4052 printf("would prune %s", message);4053 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)4054 printf("prune %s", message);4055 } else {4056 if (cb->newlog) {4057 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",4058 sha1_to_hex(osha1), sha1_to_hex(nsha1),4059 email, timestamp, tz, message);4060 hashcpy(cb->last_kept_sha1, nsha1);4061 }4062 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)4063 printf("keep %s", message);4064 }4065 return 0;4066}40674068int reflog_expire(const char *refname, const unsigned char *sha1,4069 unsigned int flags,4070 reflog_expiry_prepare_fn prepare_fn,4071 reflog_expiry_should_prune_fn should_prune_fn,4072 reflog_expiry_cleanup_fn cleanup_fn,4073 void *policy_cb_data)4074{4075 static struct lock_file reflog_lock;4076 struct expire_reflog_cb cb;4077 struct ref_lock *lock;4078 char *log_file;4079 int status = 0;4080 int type;40814082 memset(&cb, 0, sizeof(cb));4083 cb.flags = flags;4084 cb.policy_cb = policy_cb_data;4085 cb.should_prune_fn = should_prune_fn;40864087 /*4088 * The reflog file is locked by holding the lock on the4089 * reference itself, plus we might need to update the4090 * reference if --updateref was specified:4091 */4092 lock = lock_ref_sha1_basic(refname, sha1, NULL, NULL, 0, &type);4093 if (!lock)4094 return error("cannot lock ref '%s'", refname);4095 if (!reflog_exists(refname)) {4096 unlock_ref(lock);4097 return 0;4098 }40994100 log_file = git_pathdup("logs/%s", refname);4101 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4102 /*4103 * Even though holding $GIT_DIR/logs/$reflog.lock has4104 * no locking implications, we use the lock_file4105 * machinery here anyway because it does a lot of the4106 * work we need, including cleaning up if the program4107 * exits unexpectedly.4108 */4109 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {4110 struct strbuf err = STRBUF_INIT;4111 unable_to_lock_message(log_file, errno, &err);4112 error("%s", err.buf);4113 strbuf_release(&err);4114 goto failure;4115 }4116 cb.newlog = fdopen_lock_file(&reflog_lock, "w");4117 if (!cb.newlog) {4118 error("cannot fdopen %s (%s)",4119 reflog_lock.filename.buf, strerror(errno));4120 goto failure;4121 }4122 }41234124 (*prepare_fn)(refname, sha1, cb.policy_cb);4125 for_each_reflog_ent(refname, expire_reflog_ent, &cb);4126 (*cleanup_fn)(cb.policy_cb);41274128 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4129 /*4130 * It doesn't make sense to adjust a reference pointed4131 * to by a symbolic ref based on expiring entries in4132 * the symbolic reference's reflog. Nor can we update4133 * a reference if there are no remaining reflog4134 * entries.4135 */4136 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4137 !(type & REF_ISSYMREF) &&4138 !is_null_sha1(cb.last_kept_sha1);41394140 if (close_lock_file(&reflog_lock)) {4141 status |= error("couldn't write %s: %s", log_file,4142 strerror(errno));4143 } else if (update &&4144 (write_in_full(lock->lock_fd,4145 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||4146 write_str_in_full(lock->lock_fd, "\n") != 1 ||4147 close_ref(lock) < 0)) {4148 status |= error("couldn't write %s",4149 lock->lk->filename.buf);4150 rollback_lock_file(&reflog_lock);4151 } else if (commit_lock_file(&reflog_lock)) {4152 status |= error("unable to commit reflog '%s' (%s)",4153 log_file, strerror(errno));4154 } else if (update && commit_ref(lock)) {4155 status |= error("couldn't set %s", lock->ref_name);4156 }4157 }4158 free(log_file);4159 unlock_ref(lock);4160 return status;41614162 failure:4163 rollback_lock_file(&reflog_lock);4164 free(log_file);4165 unlock_ref(lock);4166 return -1;4167}