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 is_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 844static int entry_matches(struct ref_entry *entry, const struct string_list *list) 845{ 846 return list && string_list_has_string(list, entry->name); 847} 848 849struct nonmatching_ref_data { 850 const struct string_list *skip; 851 struct ref_entry *found; 852}; 853 854static int nonmatching_ref_fn(struct ref_entry *entry, void *vdata) 855{ 856 struct nonmatching_ref_data *data = vdata; 857 858 if (entry_matches(entry, data->skip)) 859 return 0; 860 861 data->found = entry; 862 return 1; 863} 864 865static void report_refname_conflict(struct ref_entry *entry, 866 const char *refname) 867{ 868 error("'%s' exists; cannot create '%s'", entry->name, refname); 869} 870 871/* 872 * Return true iff a reference named refname could be created without 873 * conflicting with the name of an existing reference in dir. If 874 * skip is non-NULL, ignore potential conflicts with refs in skip 875 * (e.g., because they are scheduled for deletion in the same 876 * operation). 877 * 878 * Two reference names conflict if one of them exactly matches the 879 * leading components of the other; e.g., "refs/foo/bar" conflicts 880 * with both "refs/foo" and with "refs/foo/bar/baz" but not with 881 * "refs/foo/bar" or "refs/foo/barbados". 882 * 883 * skip must be sorted. 884 */ 885static int is_refname_available(const char *refname, 886 const struct string_list *skip, 887 struct ref_dir *dir) 888{ 889 const char *slash; 890 int pos; 891 struct strbuf dirname = STRBUF_INIT; 892 893 /* 894 * For the sake of comments in this function, suppose that 895 * refname is "refs/foo/bar". 896 */ 897 898 for (slash = strchr(refname, '/'); slash; slash = strchr(slash + 1, '/')) { 899 /* 900 * We are still at a leading dir of the refname (e.g., 901 * "refs/foo"; if there is a reference with that name, 902 * it is a conflict, *unless* it is in skip. 903 */ 904 pos = search_ref_dir(dir, refname, slash - refname); 905 if (pos >= 0) { 906 /* 907 * We found a reference whose name is a proper 908 * prefix of refname; e.g., "refs/foo". 909 */ 910 struct ref_entry *entry = dir->entries[pos]; 911 if (entry_matches(entry, skip)) { 912 /* 913 * The reference we just found, e.g., 914 * "refs/foo", is also in skip, so it 915 * is not considered a conflict. 916 * Moreover, the fact that "refs/foo" 917 * exists means that there cannot be 918 * any references anywhere under the 919 * "refs/foo/" namespace (because they 920 * would have conflicted with 921 * "refs/foo"). So we can stop looking 922 * now and return true. 923 */ 924 return 1; 925 } 926 report_refname_conflict(entry, refname); 927 return 0; 928 } 929 930 931 /* 932 * Otherwise, we can try to continue our search with 933 * the next component. So try to look up the 934 * directory, e.g., "refs/foo/". 935 */ 936 pos = search_ref_dir(dir, refname, slash + 1 - refname); 937 if (pos < 0) { 938 /* 939 * There was no directory "refs/foo/", so 940 * there is nothing under this whole prefix, 941 * and we are OK. 942 */ 943 return 1; 944 } 945 946 dir = get_ref_dir(dir->entries[pos]); 947 } 948 949 /* 950 * We are at the leaf of our refname (e.g., "refs/foo/bar"). 951 * There is no point in searching for a reference with that 952 * name, because a refname isn't considered to conflict with 953 * itself. But we still need to check for references whose 954 * names are in the "refs/foo/bar/" namespace, because they 955 * *do* conflict. 956 */ 957 strbuf_addstr(&dirname, refname); 958 strbuf_addch(&dirname, '/'); 959 pos = search_ref_dir(dir, dirname.buf, dirname.len); 960 strbuf_release(&dirname); 961 962 if (pos >= 0) { 963 /* 964 * We found a directory named "$refname/" (e.g., 965 * "refs/foo/bar/"). It is a problem iff it contains 966 * any ref that is not in "skip". 967 */ 968 struct nonmatching_ref_data data; 969 struct ref_entry *entry = dir->entries[pos]; 970 971 dir = get_ref_dir(entry); 972 data.skip = skip; 973 sort_ref_dir(dir); 974 if (!do_for_each_entry_in_dir(dir, 0, nonmatching_ref_fn, &data)) 975 return 1; 976 977 report_refname_conflict(data.found, refname); 978 return 0; 979 } 980 981 return 1; 982} 983 984struct packed_ref_cache { 985 struct ref_entry *root; 986 987 /* 988 * Count of references to the data structure in this instance, 989 * including the pointer from ref_cache::packed if any. The 990 * data will not be freed as long as the reference count is 991 * nonzero. 992 */ 993 unsigned int referrers; 994 995 /* 996 * Iff the packed-refs file associated with this instance is 997 * currently locked for writing, this points at the associated 998 * lock (which is owned by somebody else). The referrer count 999 * is also incremented when the file is locked and decremented1000 * when it is unlocked.1001 */1002 struct lock_file *lock;10031004 /* The metadata from when this packed-refs cache was read */1005 struct stat_validity validity;1006};10071008/*1009 * Future: need to be in "struct repository"1010 * when doing a full libification.1011 */1012static struct ref_cache {1013 struct ref_cache *next;1014 struct ref_entry *loose;1015 struct packed_ref_cache *packed;1016 /*1017 * The submodule name, or "" for the main repo. We allocate1018 * length 1 rather than FLEX_ARRAY so that the main ref_cache1019 * is initialized correctly.1020 */1021 char name[1];1022} ref_cache, *submodule_ref_caches;10231024/* Lock used for the main packed-refs file: */1025static struct lock_file packlock;10261027/*1028 * Increment the reference count of *packed_refs.1029 */1030static void acquire_packed_ref_cache(struct packed_ref_cache *packed_refs)1031{1032 packed_refs->referrers++;1033}10341035/*1036 * Decrease the reference count of *packed_refs. If it goes to zero,1037 * free *packed_refs and return true; otherwise return false.1038 */1039static int release_packed_ref_cache(struct packed_ref_cache *packed_refs)1040{1041 if (!--packed_refs->referrers) {1042 free_ref_entry(packed_refs->root);1043 stat_validity_clear(&packed_refs->validity);1044 free(packed_refs);1045 return 1;1046 } else {1047 return 0;1048 }1049}10501051static void clear_packed_ref_cache(struct ref_cache *refs)1052{1053 if (refs->packed) {1054 struct packed_ref_cache *packed_refs = refs->packed;10551056 if (packed_refs->lock)1057 die("internal error: packed-ref cache cleared while locked");1058 refs->packed = NULL;1059 release_packed_ref_cache(packed_refs);1060 }1061}10621063static void clear_loose_ref_cache(struct ref_cache *refs)1064{1065 if (refs->loose) {1066 free_ref_entry(refs->loose);1067 refs->loose = NULL;1068 }1069}10701071static struct ref_cache *create_ref_cache(const char *submodule)1072{1073 int len;1074 struct ref_cache *refs;1075 if (!submodule)1076 submodule = "";1077 len = strlen(submodule) + 1;1078 refs = xcalloc(1, sizeof(struct ref_cache) + len);1079 memcpy(refs->name, submodule, len);1080 return refs;1081}10821083/*1084 * Return a pointer to a ref_cache for the specified submodule. For1085 * the main repository, use submodule==NULL. The returned structure1086 * will be allocated and initialized but not necessarily populated; it1087 * should not be freed.1088 */1089static struct ref_cache *get_ref_cache(const char *submodule)1090{1091 struct ref_cache *refs;10921093 if (!submodule || !*submodule)1094 return &ref_cache;10951096 for (refs = submodule_ref_caches; refs; refs = refs->next)1097 if (!strcmp(submodule, refs->name))1098 return refs;10991100 refs = create_ref_cache(submodule);1101 refs->next = submodule_ref_caches;1102 submodule_ref_caches = refs;1103 return refs;1104}11051106/* The length of a peeled reference line in packed-refs, including EOL: */1107#define PEELED_LINE_LENGTH 4211081109/*1110 * The packed-refs header line that we write out. Perhaps other1111 * traits will be added later. The trailing space is required.1112 */1113static const char PACKED_REFS_HEADER[] =1114 "# pack-refs with: peeled fully-peeled \n";11151116/*1117 * Parse one line from a packed-refs file. Write the SHA1 to sha1.1118 * Return a pointer to the refname within the line (null-terminated),1119 * or NULL if there was a problem.1120 */1121static const char *parse_ref_line(struct strbuf *line, unsigned char *sha1)1122{1123 const char *ref;11241125 /*1126 * 42: the answer to everything.1127 *1128 * In this case, it happens to be the answer to1129 * 40 (length of sha1 hex representation)1130 * +1 (space in between hex and name)1131 * +1 (newline at the end of the line)1132 */1133 if (line->len <= 42)1134 return NULL;11351136 if (get_sha1_hex(line->buf, sha1) < 0)1137 return NULL;1138 if (!isspace(line->buf[40]))1139 return NULL;11401141 ref = line->buf + 41;1142 if (isspace(*ref))1143 return NULL;11441145 if (line->buf[line->len - 1] != '\n')1146 return NULL;1147 line->buf[--line->len] = 0;11481149 return ref;1150}11511152/*1153 * Read f, which is a packed-refs file, into dir.1154 *1155 * A comment line of the form "# pack-refs with: " may contain zero or1156 * more traits. We interpret the traits as follows:1157 *1158 * No traits:1159 *1160 * Probably no references are peeled. But if the file contains a1161 * peeled value for a reference, we will use it.1162 *1163 * peeled:1164 *1165 * References under "refs/tags/", if they *can* be peeled, *are*1166 * peeled in this file. References outside of "refs/tags/" are1167 * probably not peeled even if they could have been, but if we find1168 * a peeled value for such a reference we will use it.1169 *1170 * fully-peeled:1171 *1172 * All references in the file that can be peeled are peeled.1173 * Inversely (and this is more important), any references in the1174 * file for which no peeled value is recorded is not peelable. This1175 * trait should typically be written alongside "peeled" for1176 * compatibility with older clients, but we do not require it1177 * (i.e., "peeled" is a no-op if "fully-peeled" is set).1178 */1179static void read_packed_refs(FILE *f, struct ref_dir *dir)1180{1181 struct ref_entry *last = NULL;1182 struct strbuf line = STRBUF_INIT;1183 enum { PEELED_NONE, PEELED_TAGS, PEELED_FULLY } peeled = PEELED_NONE;11841185 while (strbuf_getwholeline(&line, f, '\n') != EOF) {1186 unsigned char sha1[20];1187 const char *refname;1188 const char *traits;11891190 if (skip_prefix(line.buf, "# pack-refs with:", &traits)) {1191 if (strstr(traits, " fully-peeled "))1192 peeled = PEELED_FULLY;1193 else if (strstr(traits, " peeled "))1194 peeled = PEELED_TAGS;1195 /* perhaps other traits later as well */1196 continue;1197 }11981199 refname = parse_ref_line(&line, sha1);1200 if (refname) {1201 int flag = REF_ISPACKED;12021203 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1204 hashclr(sha1);1205 flag |= REF_BAD_NAME | REF_ISBROKEN;1206 }1207 last = create_ref_entry(refname, sha1, flag, 0);1208 if (peeled == PEELED_FULLY ||1209 (peeled == PEELED_TAGS && starts_with(refname, "refs/tags/")))1210 last->flag |= REF_KNOWS_PEELED;1211 add_ref(dir, last);1212 continue;1213 }1214 if (last &&1215 line.buf[0] == '^' &&1216 line.len == PEELED_LINE_LENGTH &&1217 line.buf[PEELED_LINE_LENGTH - 1] == '\n' &&1218 !get_sha1_hex(line.buf + 1, sha1)) {1219 hashcpy(last->u.value.peeled, sha1);1220 /*1221 * Regardless of what the file header said,1222 * we definitely know the value of *this*1223 * reference:1224 */1225 last->flag |= REF_KNOWS_PEELED;1226 }1227 }12281229 strbuf_release(&line);1230}12311232/*1233 * Get the packed_ref_cache for the specified ref_cache, creating it1234 * if necessary.1235 */1236static struct packed_ref_cache *get_packed_ref_cache(struct ref_cache *refs)1237{1238 const char *packed_refs_file;12391240 if (*refs->name)1241 packed_refs_file = git_path_submodule(refs->name, "packed-refs");1242 else1243 packed_refs_file = git_path("packed-refs");12441245 if (refs->packed &&1246 !stat_validity_check(&refs->packed->validity, packed_refs_file))1247 clear_packed_ref_cache(refs);12481249 if (!refs->packed) {1250 FILE *f;12511252 refs->packed = xcalloc(1, sizeof(*refs->packed));1253 acquire_packed_ref_cache(refs->packed);1254 refs->packed->root = create_dir_entry(refs, "", 0, 0);1255 f = fopen(packed_refs_file, "r");1256 if (f) {1257 stat_validity_update(&refs->packed->validity, fileno(f));1258 read_packed_refs(f, get_ref_dir(refs->packed->root));1259 fclose(f);1260 }1261 }1262 return refs->packed;1263}12641265static struct ref_dir *get_packed_ref_dir(struct packed_ref_cache *packed_ref_cache)1266{1267 return get_ref_dir(packed_ref_cache->root);1268}12691270static struct ref_dir *get_packed_refs(struct ref_cache *refs)1271{1272 return get_packed_ref_dir(get_packed_ref_cache(refs));1273}12741275void add_packed_ref(const char *refname, const unsigned char *sha1)1276{1277 struct packed_ref_cache *packed_ref_cache =1278 get_packed_ref_cache(&ref_cache);12791280 if (!packed_ref_cache->lock)1281 die("internal error: packed refs not locked");1282 add_ref(get_packed_ref_dir(packed_ref_cache),1283 create_ref_entry(refname, sha1, REF_ISPACKED, 1));1284}12851286/*1287 * Read the loose references from the namespace dirname into dir1288 * (without recursing). dirname must end with '/'. dir must be the1289 * directory entry corresponding to dirname.1290 */1291static void read_loose_refs(const char *dirname, struct ref_dir *dir)1292{1293 struct ref_cache *refs = dir->ref_cache;1294 DIR *d;1295 const char *path;1296 struct dirent *de;1297 int dirnamelen = strlen(dirname);1298 struct strbuf refname;12991300 if (*refs->name)1301 path = git_path_submodule(refs->name, "%s", dirname);1302 else1303 path = git_path("%s", dirname);13041305 d = opendir(path);1306 if (!d)1307 return;13081309 strbuf_init(&refname, dirnamelen + 257);1310 strbuf_add(&refname, dirname, dirnamelen);13111312 while ((de = readdir(d)) != NULL) {1313 unsigned char sha1[20];1314 struct stat st;1315 int flag;1316 const char *refdir;13171318 if (de->d_name[0] == '.')1319 continue;1320 if (ends_with(de->d_name, ".lock"))1321 continue;1322 strbuf_addstr(&refname, de->d_name);1323 refdir = *refs->name1324 ? git_path_submodule(refs->name, "%s", refname.buf)1325 : git_path("%s", refname.buf);1326 if (stat(refdir, &st) < 0) {1327 ; /* silently ignore */1328 } else if (S_ISDIR(st.st_mode)) {1329 strbuf_addch(&refname, '/');1330 add_entry_to_dir(dir,1331 create_dir_entry(refs, refname.buf,1332 refname.len, 1));1333 } else {1334 if (*refs->name) {1335 hashclr(sha1);1336 flag = 0;1337 if (resolve_gitlink_ref(refs->name, refname.buf, sha1) < 0) {1338 hashclr(sha1);1339 flag |= REF_ISBROKEN;1340 }1341 } else if (read_ref_full(refname.buf,1342 RESOLVE_REF_READING,1343 sha1, &flag)) {1344 hashclr(sha1);1345 flag |= REF_ISBROKEN;1346 }1347 if (check_refname_format(refname.buf,1348 REFNAME_ALLOW_ONELEVEL)) {1349 hashclr(sha1);1350 flag |= REF_BAD_NAME | REF_ISBROKEN;1351 }1352 add_entry_to_dir(dir,1353 create_ref_entry(refname.buf, sha1, flag, 0));1354 }1355 strbuf_setlen(&refname, dirnamelen);1356 }1357 strbuf_release(&refname);1358 closedir(d);1359}13601361static struct ref_dir *get_loose_refs(struct ref_cache *refs)1362{1363 if (!refs->loose) {1364 /*1365 * Mark the top-level directory complete because we1366 * are about to read the only subdirectory that can1367 * hold references:1368 */1369 refs->loose = create_dir_entry(refs, "", 0, 0);1370 /*1371 * Create an incomplete entry for "refs/":1372 */1373 add_entry_to_dir(get_ref_dir(refs->loose),1374 create_dir_entry(refs, "refs/", 5, 1));1375 }1376 return get_ref_dir(refs->loose);1377}13781379/* We allow "recursive" symbolic refs. Only within reason, though */1380#define MAXDEPTH 51381#define MAXREFLEN (1024)13821383/*1384 * Called by resolve_gitlink_ref_recursive() after it failed to read1385 * from the loose refs in ref_cache refs. Find <refname> in the1386 * packed-refs file for the submodule.1387 */1388static int resolve_gitlink_packed_ref(struct ref_cache *refs,1389 const char *refname, unsigned char *sha1)1390{1391 struct ref_entry *ref;1392 struct ref_dir *dir = get_packed_refs(refs);13931394 ref = find_ref(dir, refname);1395 if (ref == NULL)1396 return -1;13971398 hashcpy(sha1, ref->u.value.sha1);1399 return 0;1400}14011402static int resolve_gitlink_ref_recursive(struct ref_cache *refs,1403 const char *refname, unsigned char *sha1,1404 int recursion)1405{1406 int fd, len;1407 char buffer[128], *p;1408 char *path;14091410 if (recursion > MAXDEPTH || strlen(refname) > MAXREFLEN)1411 return -1;1412 path = *refs->name1413 ? git_path_submodule(refs->name, "%s", refname)1414 : git_path("%s", refname);1415 fd = open(path, O_RDONLY);1416 if (fd < 0)1417 return resolve_gitlink_packed_ref(refs, refname, sha1);14181419 len = read(fd, buffer, sizeof(buffer)-1);1420 close(fd);1421 if (len < 0)1422 return -1;1423 while (len && isspace(buffer[len-1]))1424 len--;1425 buffer[len] = 0;14261427 /* Was it a detached head or an old-fashioned symlink? */1428 if (!get_sha1_hex(buffer, sha1))1429 return 0;14301431 /* Symref? */1432 if (strncmp(buffer, "ref:", 4))1433 return -1;1434 p = buffer + 4;1435 while (isspace(*p))1436 p++;14371438 return resolve_gitlink_ref_recursive(refs, p, sha1, recursion+1);1439}14401441int resolve_gitlink_ref(const char *path, const char *refname, unsigned char *sha1)1442{1443 int len = strlen(path), retval;1444 char *submodule;1445 struct ref_cache *refs;14461447 while (len && path[len-1] == '/')1448 len--;1449 if (!len)1450 return -1;1451 submodule = xstrndup(path, len);1452 refs = get_ref_cache(submodule);1453 free(submodule);14541455 retval = resolve_gitlink_ref_recursive(refs, refname, sha1, 0);1456 return retval;1457}14581459/*1460 * Return the ref_entry for the given refname from the packed1461 * references. If it does not exist, return NULL.1462 */1463static struct ref_entry *get_packed_ref(const char *refname)1464{1465 return find_ref(get_packed_refs(&ref_cache), refname);1466}14671468/*1469 * A loose ref file doesn't exist; check for a packed ref. The1470 * options are forwarded from resolve_safe_unsafe().1471 */1472static int resolve_missing_loose_ref(const char *refname,1473 int resolve_flags,1474 unsigned char *sha1,1475 int *flags)1476{1477 struct ref_entry *entry;14781479 /*1480 * The loose reference file does not exist; check for a packed1481 * reference.1482 */1483 entry = get_packed_ref(refname);1484 if (entry) {1485 hashcpy(sha1, entry->u.value.sha1);1486 if (flags)1487 *flags |= REF_ISPACKED;1488 return 0;1489 }1490 /* The reference is not a packed reference, either. */1491 if (resolve_flags & RESOLVE_REF_READING) {1492 errno = ENOENT;1493 return -1;1494 } else {1495 hashclr(sha1);1496 return 0;1497 }1498}14991500/* This function needs to return a meaningful errno on failure */1501const char *resolve_ref_unsafe(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)1502{1503 int depth = MAXDEPTH;1504 ssize_t len;1505 char buffer[256];1506 static char refname_buffer[256];1507 int bad_name = 0;15081509 if (flags)1510 *flags = 0;15111512 if (check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {1513 if (flags)1514 *flags |= REF_BAD_NAME;15151516 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1517 !refname_is_safe(refname)) {1518 errno = EINVAL;1519 return NULL;1520 }1521 /*1522 * dwim_ref() uses REF_ISBROKEN to distinguish between1523 * missing refs and refs that were present but invalid,1524 * to complain about the latter to stderr.1525 *1526 * We don't know whether the ref exists, so don't set1527 * REF_ISBROKEN yet.1528 */1529 bad_name = 1;1530 }1531 for (;;) {1532 char path[PATH_MAX];1533 struct stat st;1534 char *buf;1535 int fd;15361537 if (--depth < 0) {1538 errno = ELOOP;1539 return NULL;1540 }15411542 git_snpath(path, sizeof(path), "%s", refname);15431544 /*1545 * We might have to loop back here to avoid a race1546 * condition: first we lstat() the file, then we try1547 * to read it as a link or as a file. But if somebody1548 * changes the type of the file (file <-> directory1549 * <-> symlink) between the lstat() and reading, then1550 * we don't want to report that as an error but rather1551 * try again starting with the lstat().1552 */1553 stat_ref:1554 if (lstat(path, &st) < 0) {1555 if (errno != ENOENT)1556 return NULL;1557 if (resolve_missing_loose_ref(refname, resolve_flags,1558 sha1, flags))1559 return NULL;1560 if (bad_name) {1561 hashclr(sha1);1562 if (flags)1563 *flags |= REF_ISBROKEN;1564 }1565 return refname;1566 }15671568 /* Follow "normalized" - ie "refs/.." symlinks by hand */1569 if (S_ISLNK(st.st_mode)) {1570 len = readlink(path, buffer, sizeof(buffer)-1);1571 if (len < 0) {1572 if (errno == ENOENT || errno == EINVAL)1573 /* inconsistent with lstat; retry */1574 goto stat_ref;1575 else1576 return NULL;1577 }1578 buffer[len] = 0;1579 if (starts_with(buffer, "refs/") &&1580 !check_refname_format(buffer, 0)) {1581 strcpy(refname_buffer, buffer);1582 refname = refname_buffer;1583 if (flags)1584 *flags |= REF_ISSYMREF;1585 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {1586 hashclr(sha1);1587 return refname;1588 }1589 continue;1590 }1591 }15921593 /* Is it a directory? */1594 if (S_ISDIR(st.st_mode)) {1595 errno = EISDIR;1596 return NULL;1597 }15981599 /*1600 * Anything else, just open it and try to use it as1601 * a ref1602 */1603 fd = open(path, O_RDONLY);1604 if (fd < 0) {1605 if (errno == ENOENT)1606 /* inconsistent with lstat; retry */1607 goto stat_ref;1608 else1609 return NULL;1610 }1611 len = read_in_full(fd, buffer, sizeof(buffer)-1);1612 if (len < 0) {1613 int save_errno = errno;1614 close(fd);1615 errno = save_errno;1616 return NULL;1617 }1618 close(fd);1619 while (len && isspace(buffer[len-1]))1620 len--;1621 buffer[len] = '\0';16221623 /*1624 * Is it a symbolic ref?1625 */1626 if (!starts_with(buffer, "ref:")) {1627 /*1628 * Please note that FETCH_HEAD has a second1629 * line containing other data.1630 */1631 if (get_sha1_hex(buffer, sha1) ||1632 (buffer[40] != '\0' && !isspace(buffer[40]))) {1633 if (flags)1634 *flags |= REF_ISBROKEN;1635 errno = EINVAL;1636 return NULL;1637 }1638 if (bad_name) {1639 hashclr(sha1);1640 if (flags)1641 *flags |= REF_ISBROKEN;1642 }1643 return refname;1644 }1645 if (flags)1646 *flags |= REF_ISSYMREF;1647 buf = buffer + 4;1648 while (isspace(*buf))1649 buf++;1650 refname = strcpy(refname_buffer, buf);1651 if (resolve_flags & RESOLVE_REF_NO_RECURSE) {1652 hashclr(sha1);1653 return refname;1654 }1655 if (check_refname_format(buf, REFNAME_ALLOW_ONELEVEL)) {1656 if (flags)1657 *flags |= REF_ISBROKEN;16581659 if (!(resolve_flags & RESOLVE_REF_ALLOW_BAD_NAME) ||1660 !refname_is_safe(buf)) {1661 errno = EINVAL;1662 return NULL;1663 }1664 bad_name = 1;1665 }1666 }1667}16681669char *resolve_refdup(const char *ref, int resolve_flags, unsigned char *sha1, int *flags)1670{1671 return xstrdup_or_null(resolve_ref_unsafe(ref, resolve_flags, sha1, flags));1672}16731674/* The argument to filter_refs */1675struct ref_filter {1676 const char *pattern;1677 each_ref_fn *fn;1678 void *cb_data;1679};16801681int read_ref_full(const char *refname, int resolve_flags, unsigned char *sha1, int *flags)1682{1683 if (resolve_ref_unsafe(refname, resolve_flags, sha1, flags))1684 return 0;1685 return -1;1686}16871688int read_ref(const char *refname, unsigned char *sha1)1689{1690 return read_ref_full(refname, RESOLVE_REF_READING, sha1, NULL);1691}16921693int ref_exists(const char *refname)1694{1695 unsigned char sha1[20];1696 return !!resolve_ref_unsafe(refname, RESOLVE_REF_READING, sha1, NULL);1697}16981699static int filter_refs(const char *refname, const unsigned char *sha1, int flags,1700 void *data)1701{1702 struct ref_filter *filter = (struct ref_filter *)data;1703 if (wildmatch(filter->pattern, refname, 0, NULL))1704 return 0;1705 return filter->fn(refname, sha1, flags, filter->cb_data);1706}17071708enum peel_status {1709 /* object was peeled successfully: */1710 PEEL_PEELED = 0,17111712 /*1713 * object cannot be peeled because the named object (or an1714 * object referred to by a tag in the peel chain), does not1715 * exist.1716 */1717 PEEL_INVALID = -1,17181719 /* object cannot be peeled because it is not a tag: */1720 PEEL_NON_TAG = -2,17211722 /* ref_entry contains no peeled value because it is a symref: */1723 PEEL_IS_SYMREF = -3,17241725 /*1726 * ref_entry cannot be peeled because it is broken (i.e., the1727 * symbolic reference cannot even be resolved to an object1728 * name):1729 */1730 PEEL_BROKEN = -41731};17321733/*1734 * Peel the named object; i.e., if the object is a tag, resolve the1735 * tag recursively until a non-tag is found. If successful, store the1736 * result to sha1 and return PEEL_PEELED. If the object is not a tag1737 * or is not valid, return PEEL_NON_TAG or PEEL_INVALID, respectively,1738 * and leave sha1 unchanged.1739 */1740static enum peel_status peel_object(const unsigned char *name, unsigned char *sha1)1741{1742 struct object *o = lookup_unknown_object(name);17431744 if (o->type == OBJ_NONE) {1745 int type = sha1_object_info(name, NULL);1746 if (type < 0 || !object_as_type(o, type, 0))1747 return PEEL_INVALID;1748 }17491750 if (o->type != OBJ_TAG)1751 return PEEL_NON_TAG;17521753 o = deref_tag_noverify(o);1754 if (!o)1755 return PEEL_INVALID;17561757 hashcpy(sha1, o->sha1);1758 return PEEL_PEELED;1759}17601761/*1762 * Peel the entry (if possible) and return its new peel_status. If1763 * repeel is true, re-peel the entry even if there is an old peeled1764 * value that is already stored in it.1765 *1766 * It is OK to call this function with a packed reference entry that1767 * might be stale and might even refer to an object that has since1768 * been garbage-collected. In such a case, if the entry has1769 * REF_KNOWS_PEELED then leave the status unchanged and return1770 * PEEL_PEELED or PEEL_NON_TAG; otherwise, return PEEL_INVALID.1771 */1772static enum peel_status peel_entry(struct ref_entry *entry, int repeel)1773{1774 enum peel_status status;17751776 if (entry->flag & REF_KNOWS_PEELED) {1777 if (repeel) {1778 entry->flag &= ~REF_KNOWS_PEELED;1779 hashclr(entry->u.value.peeled);1780 } else {1781 return is_null_sha1(entry->u.value.peeled) ?1782 PEEL_NON_TAG : PEEL_PEELED;1783 }1784 }1785 if (entry->flag & REF_ISBROKEN)1786 return PEEL_BROKEN;1787 if (entry->flag & REF_ISSYMREF)1788 return PEEL_IS_SYMREF;17891790 status = peel_object(entry->u.value.sha1, entry->u.value.peeled);1791 if (status == PEEL_PEELED || status == PEEL_NON_TAG)1792 entry->flag |= REF_KNOWS_PEELED;1793 return status;1794}17951796int peel_ref(const char *refname, unsigned char *sha1)1797{1798 int flag;1799 unsigned char base[20];18001801 if (current_ref && (current_ref->name == refname1802 || !strcmp(current_ref->name, refname))) {1803 if (peel_entry(current_ref, 0))1804 return -1;1805 hashcpy(sha1, current_ref->u.value.peeled);1806 return 0;1807 }18081809 if (read_ref_full(refname, RESOLVE_REF_READING, base, &flag))1810 return -1;18111812 /*1813 * If the reference is packed, read its ref_entry from the1814 * cache in the hope that we already know its peeled value.1815 * We only try this optimization on packed references because1816 * (a) forcing the filling of the loose reference cache could1817 * be expensive and (b) loose references anyway usually do not1818 * have REF_KNOWS_PEELED.1819 */1820 if (flag & REF_ISPACKED) {1821 struct ref_entry *r = get_packed_ref(refname);1822 if (r) {1823 if (peel_entry(r, 0))1824 return -1;1825 hashcpy(sha1, r->u.value.peeled);1826 return 0;1827 }1828 }18291830 return peel_object(base, sha1);1831}18321833struct warn_if_dangling_data {1834 FILE *fp;1835 const char *refname;1836 const struct string_list *refnames;1837 const char *msg_fmt;1838};18391840static int warn_if_dangling_symref(const char *refname, const unsigned char *sha1,1841 int flags, void *cb_data)1842{1843 struct warn_if_dangling_data *d = cb_data;1844 const char *resolves_to;1845 unsigned char junk[20];18461847 if (!(flags & REF_ISSYMREF))1848 return 0;18491850 resolves_to = resolve_ref_unsafe(refname, 0, junk, NULL);1851 if (!resolves_to1852 || (d->refname1853 ? strcmp(resolves_to, d->refname)1854 : !string_list_has_string(d->refnames, resolves_to))) {1855 return 0;1856 }18571858 fprintf(d->fp, d->msg_fmt, refname);1859 fputc('\n', d->fp);1860 return 0;1861}18621863void warn_dangling_symref(FILE *fp, const char *msg_fmt, const char *refname)1864{1865 struct warn_if_dangling_data data;18661867 data.fp = fp;1868 data.refname = refname;1869 data.refnames = NULL;1870 data.msg_fmt = msg_fmt;1871 for_each_rawref(warn_if_dangling_symref, &data);1872}18731874void warn_dangling_symrefs(FILE *fp, const char *msg_fmt, const struct string_list *refnames)1875{1876 struct warn_if_dangling_data data;18771878 data.fp = fp;1879 data.refname = NULL;1880 data.refnames = refnames;1881 data.msg_fmt = msg_fmt;1882 for_each_rawref(warn_if_dangling_symref, &data);1883}18841885/*1886 * Call fn for each reference in the specified ref_cache, omitting1887 * references not in the containing_dir of base. fn is called for all1888 * references, including broken ones. If fn ever returns a non-zero1889 * value, stop the iteration and return that value; otherwise, return1890 * 0.1891 */1892static int do_for_each_entry(struct ref_cache *refs, const char *base,1893 each_ref_entry_fn fn, void *cb_data)1894{1895 struct packed_ref_cache *packed_ref_cache;1896 struct ref_dir *loose_dir;1897 struct ref_dir *packed_dir;1898 int retval = 0;18991900 /*1901 * We must make sure that all loose refs are read before accessing the1902 * packed-refs file; this avoids a race condition in which loose refs1903 * are migrated to the packed-refs file by a simultaneous process, but1904 * our in-memory view is from before the migration. get_packed_ref_cache()1905 * takes care of making sure our view is up to date with what is on1906 * disk.1907 */1908 loose_dir = get_loose_refs(refs);1909 if (base && *base) {1910 loose_dir = find_containing_dir(loose_dir, base, 0);1911 }1912 if (loose_dir)1913 prime_ref_dir(loose_dir);19141915 packed_ref_cache = get_packed_ref_cache(refs);1916 acquire_packed_ref_cache(packed_ref_cache);1917 packed_dir = get_packed_ref_dir(packed_ref_cache);1918 if (base && *base) {1919 packed_dir = find_containing_dir(packed_dir, base, 0);1920 }19211922 if (packed_dir && loose_dir) {1923 sort_ref_dir(packed_dir);1924 sort_ref_dir(loose_dir);1925 retval = do_for_each_entry_in_dirs(1926 packed_dir, loose_dir, fn, cb_data);1927 } else if (packed_dir) {1928 sort_ref_dir(packed_dir);1929 retval = do_for_each_entry_in_dir(1930 packed_dir, 0, fn, cb_data);1931 } else if (loose_dir) {1932 sort_ref_dir(loose_dir);1933 retval = do_for_each_entry_in_dir(1934 loose_dir, 0, fn, cb_data);1935 }19361937 release_packed_ref_cache(packed_ref_cache);1938 return retval;1939}19401941/*1942 * Call fn for each reference in the specified ref_cache for which the1943 * refname begins with base. If trim is non-zero, then trim that many1944 * characters off the beginning of each refname before passing the1945 * refname to fn. flags can be DO_FOR_EACH_INCLUDE_BROKEN to include1946 * broken references in the iteration. If fn ever returns a non-zero1947 * value, stop the iteration and return that value; otherwise, return1948 * 0.1949 */1950static int do_for_each_ref(struct ref_cache *refs, const char *base,1951 each_ref_fn fn, int trim, int flags, void *cb_data)1952{1953 struct ref_entry_cb data;1954 data.base = base;1955 data.trim = trim;1956 data.flags = flags;1957 data.fn = fn;1958 data.cb_data = cb_data;19591960 if (ref_paranoia < 0)1961 ref_paranoia = git_env_bool("GIT_REF_PARANOIA", 0);1962 if (ref_paranoia)1963 data.flags |= DO_FOR_EACH_INCLUDE_BROKEN;19641965 return do_for_each_entry(refs, base, do_one_ref, &data);1966}19671968static int do_head_ref(const char *submodule, each_ref_fn fn, void *cb_data)1969{1970 unsigned char sha1[20];1971 int flag;19721973 if (submodule) {1974 if (resolve_gitlink_ref(submodule, "HEAD", sha1) == 0)1975 return fn("HEAD", sha1, 0, cb_data);19761977 return 0;1978 }19791980 if (!read_ref_full("HEAD", RESOLVE_REF_READING, sha1, &flag))1981 return fn("HEAD", sha1, flag, cb_data);19821983 return 0;1984}19851986int head_ref(each_ref_fn fn, void *cb_data)1987{1988 return do_head_ref(NULL, fn, cb_data);1989}19901991int head_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)1992{1993 return do_head_ref(submodule, fn, cb_data);1994}19951996int for_each_ref(each_ref_fn fn, void *cb_data)1997{1998 return do_for_each_ref(&ref_cache, "", fn, 0, 0, cb_data);1999}20002001int for_each_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2002{2003 return do_for_each_ref(get_ref_cache(submodule), "", fn, 0, 0, cb_data);2004}20052006int for_each_ref_in(const char *prefix, each_ref_fn fn, void *cb_data)2007{2008 return do_for_each_ref(&ref_cache, prefix, fn, strlen(prefix), 0, cb_data);2009}20102011int for_each_ref_in_submodule(const char *submodule, const char *prefix,2012 each_ref_fn fn, void *cb_data)2013{2014 return do_for_each_ref(get_ref_cache(submodule), prefix, fn, strlen(prefix), 0, cb_data);2015}20162017int for_each_tag_ref(each_ref_fn fn, void *cb_data)2018{2019 return for_each_ref_in("refs/tags/", fn, cb_data);2020}20212022int for_each_tag_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2023{2024 return for_each_ref_in_submodule(submodule, "refs/tags/", fn, cb_data);2025}20262027int for_each_branch_ref(each_ref_fn fn, void *cb_data)2028{2029 return for_each_ref_in("refs/heads/", fn, cb_data);2030}20312032int for_each_branch_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2033{2034 return for_each_ref_in_submodule(submodule, "refs/heads/", fn, cb_data);2035}20362037int for_each_remote_ref(each_ref_fn fn, void *cb_data)2038{2039 return for_each_ref_in("refs/remotes/", fn, cb_data);2040}20412042int for_each_remote_ref_submodule(const char *submodule, each_ref_fn fn, void *cb_data)2043{2044 return for_each_ref_in_submodule(submodule, "refs/remotes/", fn, cb_data);2045}20462047int for_each_replace_ref(each_ref_fn fn, void *cb_data)2048{2049 return do_for_each_ref(&ref_cache, "refs/replace/", fn, 13, 0, cb_data);2050}20512052int head_ref_namespaced(each_ref_fn fn, void *cb_data)2053{2054 struct strbuf buf = STRBUF_INIT;2055 int ret = 0;2056 unsigned char sha1[20];2057 int flag;20582059 strbuf_addf(&buf, "%sHEAD", get_git_namespace());2060 if (!read_ref_full(buf.buf, RESOLVE_REF_READING, sha1, &flag))2061 ret = fn(buf.buf, sha1, flag, cb_data);2062 strbuf_release(&buf);20632064 return ret;2065}20662067int for_each_namespaced_ref(each_ref_fn fn, void *cb_data)2068{2069 struct strbuf buf = STRBUF_INIT;2070 int ret;2071 strbuf_addf(&buf, "%srefs/", get_git_namespace());2072 ret = do_for_each_ref(&ref_cache, buf.buf, fn, 0, 0, cb_data);2073 strbuf_release(&buf);2074 return ret;2075}20762077int for_each_glob_ref_in(each_ref_fn fn, const char *pattern,2078 const char *prefix, void *cb_data)2079{2080 struct strbuf real_pattern = STRBUF_INIT;2081 struct ref_filter filter;2082 int ret;20832084 if (!prefix && !starts_with(pattern, "refs/"))2085 strbuf_addstr(&real_pattern, "refs/");2086 else if (prefix)2087 strbuf_addstr(&real_pattern, prefix);2088 strbuf_addstr(&real_pattern, pattern);20892090 if (!has_glob_specials(pattern)) {2091 /* Append implied '/' '*' if not present. */2092 if (real_pattern.buf[real_pattern.len - 1] != '/')2093 strbuf_addch(&real_pattern, '/');2094 /* No need to check for '*', there is none. */2095 strbuf_addch(&real_pattern, '*');2096 }20972098 filter.pattern = real_pattern.buf;2099 filter.fn = fn;2100 filter.cb_data = cb_data;2101 ret = for_each_ref(filter_refs, &filter);21022103 strbuf_release(&real_pattern);2104 return ret;2105}21062107int for_each_glob_ref(each_ref_fn fn, const char *pattern, void *cb_data)2108{2109 return for_each_glob_ref_in(fn, pattern, NULL, cb_data);2110}21112112int for_each_rawref(each_ref_fn fn, void *cb_data)2113{2114 return do_for_each_ref(&ref_cache, "", fn, 0,2115 DO_FOR_EACH_INCLUDE_BROKEN, cb_data);2116}21172118const char *prettify_refname(const char *name)2119{2120 return name + (2121 starts_with(name, "refs/heads/") ? 11 :2122 starts_with(name, "refs/tags/") ? 10 :2123 starts_with(name, "refs/remotes/") ? 13 :2124 0);2125}21262127static const char *ref_rev_parse_rules[] = {2128 "%.*s",2129 "refs/%.*s",2130 "refs/tags/%.*s",2131 "refs/heads/%.*s",2132 "refs/remotes/%.*s",2133 "refs/remotes/%.*s/HEAD",2134 NULL2135};21362137int refname_match(const char *abbrev_name, const char *full_name)2138{2139 const char **p;2140 const int abbrev_name_len = strlen(abbrev_name);21412142 for (p = ref_rev_parse_rules; *p; p++) {2143 if (!strcmp(full_name, mkpath(*p, abbrev_name_len, abbrev_name))) {2144 return 1;2145 }2146 }21472148 return 0;2149}21502151static void unlock_ref(struct ref_lock *lock)2152{2153 /* Do not free lock->lk -- atexit() still looks at them */2154 if (lock->lk)2155 rollback_lock_file(lock->lk);2156 free(lock->ref_name);2157 free(lock->orig_ref_name);2158 free(lock);2159}21602161/* This function should make sure errno is meaningful on error */2162static struct ref_lock *verify_lock(struct ref_lock *lock,2163 const unsigned char *old_sha1, int mustexist)2164{2165 if (read_ref_full(lock->ref_name,2166 mustexist ? RESOLVE_REF_READING : 0,2167 lock->old_sha1, NULL)) {2168 int save_errno = errno;2169 error("Can't verify ref %s", lock->ref_name);2170 unlock_ref(lock);2171 errno = save_errno;2172 return NULL;2173 }2174 if (hashcmp(lock->old_sha1, old_sha1)) {2175 error("Ref %s is at %s but expected %s", lock->ref_name,2176 sha1_to_hex(lock->old_sha1), sha1_to_hex(old_sha1));2177 unlock_ref(lock);2178 errno = EBUSY;2179 return NULL;2180 }2181 return lock;2182}21832184static int remove_empty_directories(const char *file)2185{2186 /* we want to create a file but there is a directory there;2187 * if that is an empty directory (or a directory that contains2188 * only empty directories), remove them.2189 */2190 struct strbuf path;2191 int result, save_errno;21922193 strbuf_init(&path, 20);2194 strbuf_addstr(&path, file);21952196 result = remove_dir_recursively(&path, REMOVE_DIR_EMPTY_ONLY);2197 save_errno = errno;21982199 strbuf_release(&path);2200 errno = save_errno;22012202 return result;2203}22042205/*2206 * *string and *len will only be substituted, and *string returned (for2207 * later free()ing) if the string passed in is a magic short-hand form2208 * to name a branch.2209 */2210static char *substitute_branch_name(const char **string, int *len)2211{2212 struct strbuf buf = STRBUF_INIT;2213 int ret = interpret_branch_name(*string, *len, &buf);22142215 if (ret == *len) {2216 size_t size;2217 *string = strbuf_detach(&buf, &size);2218 *len = size;2219 return (char *)*string;2220 }22212222 return NULL;2223}22242225int dwim_ref(const char *str, int len, unsigned char *sha1, char **ref)2226{2227 char *last_branch = substitute_branch_name(&str, &len);2228 const char **p, *r;2229 int refs_found = 0;22302231 *ref = NULL;2232 for (p = ref_rev_parse_rules; *p; p++) {2233 char fullref[PATH_MAX];2234 unsigned char sha1_from_ref[20];2235 unsigned char *this_result;2236 int flag;22372238 this_result = refs_found ? sha1_from_ref : sha1;2239 mksnpath(fullref, sizeof(fullref), *p, len, str);2240 r = resolve_ref_unsafe(fullref, RESOLVE_REF_READING,2241 this_result, &flag);2242 if (r) {2243 if (!refs_found++)2244 *ref = xstrdup(r);2245 if (!warn_ambiguous_refs)2246 break;2247 } else if ((flag & REF_ISSYMREF) && strcmp(fullref, "HEAD")) {2248 warning("ignoring dangling symref %s.", fullref);2249 } else if ((flag & REF_ISBROKEN) && strchr(fullref, '/')) {2250 warning("ignoring broken ref %s.", fullref);2251 }2252 }2253 free(last_branch);2254 return refs_found;2255}22562257int dwim_log(const char *str, int len, unsigned char *sha1, char **log)2258{2259 char *last_branch = substitute_branch_name(&str, &len);2260 const char **p;2261 int logs_found = 0;22622263 *log = NULL;2264 for (p = ref_rev_parse_rules; *p; p++) {2265 unsigned char hash[20];2266 char path[PATH_MAX];2267 const char *ref, *it;22682269 mksnpath(path, sizeof(path), *p, len, str);2270 ref = resolve_ref_unsafe(path, RESOLVE_REF_READING,2271 hash, NULL);2272 if (!ref)2273 continue;2274 if (reflog_exists(path))2275 it = path;2276 else if (strcmp(ref, path) && reflog_exists(ref))2277 it = ref;2278 else2279 continue;2280 if (!logs_found++) {2281 *log = xstrdup(it);2282 hashcpy(sha1, hash);2283 }2284 if (!warn_ambiguous_refs)2285 break;2286 }2287 free(last_branch);2288 return logs_found;2289}22902291/*2292 * Locks a ref returning the lock on success and NULL on failure.2293 * On failure errno is set to something meaningful.2294 */2295static struct ref_lock *lock_ref_sha1_basic(const char *refname,2296 const unsigned char *old_sha1,2297 const struct string_list *skip,2298 unsigned int flags, int *type_p)2299{2300 char *ref_file;2301 const char *orig_refname = refname;2302 struct ref_lock *lock;2303 int last_errno = 0;2304 int type, lflags;2305 int mustexist = (old_sha1 && !is_null_sha1(old_sha1));2306 int resolve_flags = 0;2307 int attempts_remaining = 3;23082309 lock = xcalloc(1, sizeof(struct ref_lock));2310 lock->lock_fd = -1;23112312 if (mustexist)2313 resolve_flags |= RESOLVE_REF_READING;2314 if (flags & REF_DELETING) {2315 resolve_flags |= RESOLVE_REF_ALLOW_BAD_NAME;2316 if (flags & REF_NODEREF)2317 resolve_flags |= RESOLVE_REF_NO_RECURSE;2318 }23192320 refname = resolve_ref_unsafe(refname, resolve_flags,2321 lock->old_sha1, &type);2322 if (!refname && errno == EISDIR) {2323 /* we are trying to lock foo but we used to2324 * have foo/bar which now does not exist;2325 * it is normal for the empty directory 'foo'2326 * to remain.2327 */2328 ref_file = git_path("%s", orig_refname);2329 if (remove_empty_directories(ref_file)) {2330 last_errno = errno;2331 error("there are still refs under '%s'", orig_refname);2332 goto error_return;2333 }2334 refname = resolve_ref_unsafe(orig_refname, resolve_flags,2335 lock->old_sha1, &type);2336 }2337 if (type_p)2338 *type_p = type;2339 if (!refname) {2340 last_errno = errno;2341 error("unable to resolve reference %s: %s",2342 orig_refname, strerror(errno));2343 goto error_return;2344 }2345 /*2346 * If the ref did not exist and we are creating it, make sure2347 * there is no existing packed ref whose name begins with our2348 * refname, nor a packed ref whose name is a proper prefix of2349 * our refname.2350 */2351 if (is_null_sha1(lock->old_sha1) &&2352 !is_refname_available(refname, skip, get_packed_refs(&ref_cache))) {2353 last_errno = ENOTDIR;2354 goto error_return;2355 }23562357 lock->lk = xcalloc(1, sizeof(struct lock_file));23582359 lflags = 0;2360 if (flags & REF_NODEREF) {2361 refname = orig_refname;2362 lflags |= LOCK_NO_DEREF;2363 }2364 lock->ref_name = xstrdup(refname);2365 lock->orig_ref_name = xstrdup(orig_refname);2366 ref_file = git_path("%s", refname);23672368 retry:2369 switch (safe_create_leading_directories(ref_file)) {2370 case SCLD_OK:2371 break; /* success */2372 case SCLD_VANISHED:2373 if (--attempts_remaining > 0)2374 goto retry;2375 /* fall through */2376 default:2377 last_errno = errno;2378 error("unable to create directory for %s", ref_file);2379 goto error_return;2380 }23812382 lock->lock_fd = hold_lock_file_for_update(lock->lk, ref_file, lflags);2383 if (lock->lock_fd < 0) {2384 last_errno = errno;2385 if (errno == ENOENT && --attempts_remaining > 0)2386 /*2387 * Maybe somebody just deleted one of the2388 * directories leading to ref_file. Try2389 * again:2390 */2391 goto retry;2392 else {2393 struct strbuf err = STRBUF_INIT;2394 unable_to_lock_message(ref_file, errno, &err);2395 error("%s", err.buf);2396 strbuf_release(&err);2397 goto error_return;2398 }2399 }2400 return old_sha1 ? verify_lock(lock, old_sha1, mustexist) : lock;24012402 error_return:2403 unlock_ref(lock);2404 errno = last_errno;2405 return NULL;2406}24072408/*2409 * Write an entry to the packed-refs file for the specified refname.2410 * If peeled is non-NULL, write it as the entry's peeled value.2411 */2412static void write_packed_entry(FILE *fh, char *refname, unsigned char *sha1,2413 unsigned char *peeled)2414{2415 fprintf_or_die(fh, "%s %s\n", sha1_to_hex(sha1), refname);2416 if (peeled)2417 fprintf_or_die(fh, "^%s\n", sha1_to_hex(peeled));2418}24192420/*2421 * An each_ref_entry_fn that writes the entry to a packed-refs file.2422 */2423static int write_packed_entry_fn(struct ref_entry *entry, void *cb_data)2424{2425 enum peel_status peel_status = peel_entry(entry, 0);24262427 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2428 error("internal error: %s is not a valid packed reference!",2429 entry->name);2430 write_packed_entry(cb_data, entry->name, entry->u.value.sha1,2431 peel_status == PEEL_PEELED ?2432 entry->u.value.peeled : NULL);2433 return 0;2434}24352436/* This should return a meaningful errno on failure */2437int lock_packed_refs(int flags)2438{2439 struct packed_ref_cache *packed_ref_cache;24402441 if (hold_lock_file_for_update(&packlock, git_path("packed-refs"), flags) < 0)2442 return -1;2443 /*2444 * Get the current packed-refs while holding the lock. If the2445 * packed-refs file has been modified since we last read it,2446 * this will automatically invalidate the cache and re-read2447 * the packed-refs file.2448 */2449 packed_ref_cache = get_packed_ref_cache(&ref_cache);2450 packed_ref_cache->lock = &packlock;2451 /* Increment the reference count to prevent it from being freed: */2452 acquire_packed_ref_cache(packed_ref_cache);2453 return 0;2454}24552456/*2457 * Commit the packed refs changes.2458 * On error we must make sure that errno contains a meaningful value.2459 */2460int commit_packed_refs(void)2461{2462 struct packed_ref_cache *packed_ref_cache =2463 get_packed_ref_cache(&ref_cache);2464 int error = 0;2465 int save_errno = 0;2466 FILE *out;24672468 if (!packed_ref_cache->lock)2469 die("internal error: packed-refs not locked");24702471 out = fdopen_lock_file(packed_ref_cache->lock, "w");2472 if (!out)2473 die_errno("unable to fdopen packed-refs descriptor");24742475 fprintf_or_die(out, "%s", PACKED_REFS_HEADER);2476 do_for_each_entry_in_dir(get_packed_ref_dir(packed_ref_cache),2477 0, write_packed_entry_fn, out);24782479 if (commit_lock_file(packed_ref_cache->lock)) {2480 save_errno = errno;2481 error = -1;2482 }2483 packed_ref_cache->lock = NULL;2484 release_packed_ref_cache(packed_ref_cache);2485 errno = save_errno;2486 return error;2487}24882489void rollback_packed_refs(void)2490{2491 struct packed_ref_cache *packed_ref_cache =2492 get_packed_ref_cache(&ref_cache);24932494 if (!packed_ref_cache->lock)2495 die("internal error: packed-refs not locked");2496 rollback_lock_file(packed_ref_cache->lock);2497 packed_ref_cache->lock = NULL;2498 release_packed_ref_cache(packed_ref_cache);2499 clear_packed_ref_cache(&ref_cache);2500}25012502struct ref_to_prune {2503 struct ref_to_prune *next;2504 unsigned char sha1[20];2505 char name[FLEX_ARRAY];2506};25072508struct pack_refs_cb_data {2509 unsigned int flags;2510 struct ref_dir *packed_refs;2511 struct ref_to_prune *ref_to_prune;2512};25132514/*2515 * An each_ref_entry_fn that is run over loose references only. If2516 * the loose reference can be packed, add an entry in the packed ref2517 * cache. If the reference should be pruned, also add it to2518 * ref_to_prune in the pack_refs_cb_data.2519 */2520static int pack_if_possible_fn(struct ref_entry *entry, void *cb_data)2521{2522 struct pack_refs_cb_data *cb = cb_data;2523 enum peel_status peel_status;2524 struct ref_entry *packed_entry;2525 int is_tag_ref = starts_with(entry->name, "refs/tags/");25262527 /* ALWAYS pack tags */2528 if (!(cb->flags & PACK_REFS_ALL) && !is_tag_ref)2529 return 0;25302531 /* Do not pack symbolic or broken refs: */2532 if ((entry->flag & REF_ISSYMREF) || !ref_resolves_to_object(entry))2533 return 0;25342535 /* Add a packed ref cache entry equivalent to the loose entry. */2536 peel_status = peel_entry(entry, 1);2537 if (peel_status != PEEL_PEELED && peel_status != PEEL_NON_TAG)2538 die("internal error peeling reference %s (%s)",2539 entry->name, sha1_to_hex(entry->u.value.sha1));2540 packed_entry = find_ref(cb->packed_refs, entry->name);2541 if (packed_entry) {2542 /* Overwrite existing packed entry with info from loose entry */2543 packed_entry->flag = REF_ISPACKED | REF_KNOWS_PEELED;2544 hashcpy(packed_entry->u.value.sha1, entry->u.value.sha1);2545 } else {2546 packed_entry = create_ref_entry(entry->name, entry->u.value.sha1,2547 REF_ISPACKED | REF_KNOWS_PEELED, 0);2548 add_ref(cb->packed_refs, packed_entry);2549 }2550 hashcpy(packed_entry->u.value.peeled, entry->u.value.peeled);25512552 /* Schedule the loose reference for pruning if requested. */2553 if ((cb->flags & PACK_REFS_PRUNE)) {2554 int namelen = strlen(entry->name) + 1;2555 struct ref_to_prune *n = xcalloc(1, sizeof(*n) + namelen);2556 hashcpy(n->sha1, entry->u.value.sha1);2557 strcpy(n->name, entry->name);2558 n->next = cb->ref_to_prune;2559 cb->ref_to_prune = n;2560 }2561 return 0;2562}25632564/*2565 * Remove empty parents, but spare refs/ and immediate subdirs.2566 * Note: munges *name.2567 */2568static void try_remove_empty_parents(char *name)2569{2570 char *p, *q;2571 int i;2572 p = name;2573 for (i = 0; i < 2; i++) { /* refs/{heads,tags,...}/ */2574 while (*p && *p != '/')2575 p++;2576 /* tolerate duplicate slashes; see check_refname_format() */2577 while (*p == '/')2578 p++;2579 }2580 for (q = p; *q; q++)2581 ;2582 while (1) {2583 while (q > p && *q != '/')2584 q--;2585 while (q > p && *(q-1) == '/')2586 q--;2587 if (q == p)2588 break;2589 *q = '\0';2590 if (rmdir(git_path("%s", name)))2591 break;2592 }2593}25942595/* make sure nobody touched the ref, and unlink */2596static void prune_ref(struct ref_to_prune *r)2597{2598 struct ref_transaction *transaction;2599 struct strbuf err = STRBUF_INIT;26002601 if (check_refname_format(r->name, 0))2602 return;26032604 transaction = ref_transaction_begin(&err);2605 if (!transaction ||2606 ref_transaction_delete(transaction, r->name, r->sha1,2607 REF_ISPRUNING, NULL, &err) ||2608 ref_transaction_commit(transaction, &err)) {2609 ref_transaction_free(transaction);2610 error("%s", err.buf);2611 strbuf_release(&err);2612 return;2613 }2614 ref_transaction_free(transaction);2615 strbuf_release(&err);2616 try_remove_empty_parents(r->name);2617}26182619static void prune_refs(struct ref_to_prune *r)2620{2621 while (r) {2622 prune_ref(r);2623 r = r->next;2624 }2625}26262627int pack_refs(unsigned int flags)2628{2629 struct pack_refs_cb_data cbdata;26302631 memset(&cbdata, 0, sizeof(cbdata));2632 cbdata.flags = flags;26332634 lock_packed_refs(LOCK_DIE_ON_ERROR);2635 cbdata.packed_refs = get_packed_refs(&ref_cache);26362637 do_for_each_entry_in_dir(get_loose_refs(&ref_cache), 0,2638 pack_if_possible_fn, &cbdata);26392640 if (commit_packed_refs())2641 die_errno("unable to overwrite old ref-pack file");26422643 prune_refs(cbdata.ref_to_prune);2644 return 0;2645}26462647int repack_without_refs(struct string_list *refnames, struct strbuf *err)2648{2649 struct ref_dir *packed;2650 struct string_list_item *refname;2651 int ret, needs_repacking = 0, removed = 0;26522653 assert(err);26542655 /* Look for a packed ref */2656 for_each_string_list_item(refname, refnames) {2657 if (get_packed_ref(refname->string)) {2658 needs_repacking = 1;2659 break;2660 }2661 }26622663 /* Avoid locking if we have nothing to do */2664 if (!needs_repacking)2665 return 0; /* no refname exists in packed refs */26662667 if (lock_packed_refs(0)) {2668 unable_to_lock_message(git_path("packed-refs"), errno, err);2669 return -1;2670 }2671 packed = get_packed_refs(&ref_cache);26722673 /* Remove refnames from the cache */2674 for_each_string_list_item(refname, refnames)2675 if (remove_entry(packed, refname->string) != -1)2676 removed = 1;2677 if (!removed) {2678 /*2679 * All packed entries disappeared while we were2680 * acquiring the lock.2681 */2682 rollback_packed_refs();2683 return 0;2684 }26852686 /* Write what remains */2687 ret = commit_packed_refs();2688 if (ret)2689 strbuf_addf(err, "unable to overwrite old ref-pack file: %s",2690 strerror(errno));2691 return ret;2692}26932694static int delete_ref_loose(struct ref_lock *lock, int flag, struct strbuf *err)2695{2696 assert(err);26972698 if (!(flag & REF_ISPACKED) || flag & REF_ISSYMREF) {2699 /*2700 * loose. The loose file name is the same as the2701 * lockfile name, minus ".lock":2702 */2703 char *loose_filename = get_locked_file_path(lock->lk);2704 int res = unlink_or_msg(loose_filename, err);2705 free(loose_filename);2706 if (res)2707 return 1;2708 }2709 return 0;2710}27112712int delete_ref(const char *refname, const unsigned char *sha1, unsigned int flags)2713{2714 struct ref_transaction *transaction;2715 struct strbuf err = STRBUF_INIT;27162717 transaction = ref_transaction_begin(&err);2718 if (!transaction ||2719 ref_transaction_delete(transaction, refname,2720 (sha1 && !is_null_sha1(sha1)) ? sha1 : NULL,2721 flags, NULL, &err) ||2722 ref_transaction_commit(transaction, &err)) {2723 error("%s", err.buf);2724 ref_transaction_free(transaction);2725 strbuf_release(&err);2726 return 1;2727 }2728 ref_transaction_free(transaction);2729 strbuf_release(&err);2730 return 0;2731}27322733/*2734 * People using contrib's git-new-workdir have .git/logs/refs ->2735 * /some/other/path/.git/logs/refs, and that may live on another device.2736 *2737 * IOW, to avoid cross device rename errors, the temporary renamed log must2738 * live into logs/refs.2739 */2740#define TMP_RENAMED_LOG "logs/refs/.tmp-renamed-log"27412742static int rename_tmp_log(const char *newrefname)2743{2744 int attempts_remaining = 4;27452746 retry:2747 switch (safe_create_leading_directories(git_path("logs/%s", newrefname))) {2748 case SCLD_OK:2749 break; /* success */2750 case SCLD_VANISHED:2751 if (--attempts_remaining > 0)2752 goto retry;2753 /* fall through */2754 default:2755 error("unable to create directory for %s", newrefname);2756 return -1;2757 }27582759 if (rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", newrefname))) {2760 if ((errno==EISDIR || errno==ENOTDIR) && --attempts_remaining > 0) {2761 /*2762 * rename(a, b) when b is an existing2763 * directory ought to result in ISDIR, but2764 * Solaris 5.8 gives ENOTDIR. Sheesh.2765 */2766 if (remove_empty_directories(git_path("logs/%s", newrefname))) {2767 error("Directory not empty: logs/%s", newrefname);2768 return -1;2769 }2770 goto retry;2771 } else if (errno == ENOENT && --attempts_remaining > 0) {2772 /*2773 * Maybe another process just deleted one of2774 * the directories in the path to newrefname.2775 * Try again from the beginning.2776 */2777 goto retry;2778 } else {2779 error("unable to move logfile "TMP_RENAMED_LOG" to logs/%s: %s",2780 newrefname, strerror(errno));2781 return -1;2782 }2783 }2784 return 0;2785}27862787static int rename_ref_available(const char *oldname, const char *newname)2788{2789 struct string_list skip = STRING_LIST_INIT_NODUP;2790 int ret;27912792 string_list_insert(&skip, oldname);2793 ret = is_refname_available(newname, &skip, get_packed_refs(&ref_cache))2794 && is_refname_available(newname, &skip, get_loose_refs(&ref_cache));2795 string_list_clear(&skip, 0);2796 return ret;2797}27982799static int write_ref_sha1(struct ref_lock *lock, const unsigned char *sha1,2800 const char *logmsg);28012802int rename_ref(const char *oldrefname, const char *newrefname, const char *logmsg)2803{2804 unsigned char sha1[20], orig_sha1[20];2805 int flag = 0, logmoved = 0;2806 struct ref_lock *lock;2807 struct stat loginfo;2808 int log = !lstat(git_path("logs/%s", oldrefname), &loginfo);2809 const char *symref = NULL;28102811 if (log && S_ISLNK(loginfo.st_mode))2812 return error("reflog for %s is a symlink", oldrefname);28132814 symref = resolve_ref_unsafe(oldrefname, RESOLVE_REF_READING,2815 orig_sha1, &flag);2816 if (flag & REF_ISSYMREF)2817 return error("refname %s is a symbolic ref, renaming it is not supported",2818 oldrefname);2819 if (!symref)2820 return error("refname %s not found", oldrefname);28212822 if (!rename_ref_available(oldrefname, newrefname))2823 return 1;28242825 if (log && rename(git_path("logs/%s", oldrefname), git_path(TMP_RENAMED_LOG)))2826 return error("unable to move logfile logs/%s to "TMP_RENAMED_LOG": %s",2827 oldrefname, strerror(errno));28282829 if (delete_ref(oldrefname, orig_sha1, REF_NODEREF)) {2830 error("unable to delete old %s", oldrefname);2831 goto rollback;2832 }28332834 if (!read_ref_full(newrefname, RESOLVE_REF_READING, sha1, NULL) &&2835 delete_ref(newrefname, sha1, REF_NODEREF)) {2836 if (errno==EISDIR) {2837 if (remove_empty_directories(git_path("%s", newrefname))) {2838 error("Directory not empty: %s", newrefname);2839 goto rollback;2840 }2841 } else {2842 error("unable to delete existing %s", newrefname);2843 goto rollback;2844 }2845 }28462847 if (log && rename_tmp_log(newrefname))2848 goto rollback;28492850 logmoved = log;28512852 lock = lock_ref_sha1_basic(newrefname, NULL, NULL, 0, NULL);2853 if (!lock) {2854 error("unable to lock %s for update", newrefname);2855 goto rollback;2856 }2857 hashcpy(lock->old_sha1, orig_sha1);2858 if (write_ref_sha1(lock, orig_sha1, logmsg)) {2859 error("unable to write current sha1 into %s", newrefname);2860 goto rollback;2861 }28622863 return 0;28642865 rollback:2866 lock = lock_ref_sha1_basic(oldrefname, NULL, NULL, 0, NULL);2867 if (!lock) {2868 error("unable to lock %s for rollback", oldrefname);2869 goto rollbacklog;2870 }28712872 flag = log_all_ref_updates;2873 log_all_ref_updates = 0;2874 if (write_ref_sha1(lock, orig_sha1, NULL))2875 error("unable to write current sha1 into %s", oldrefname);2876 log_all_ref_updates = flag;28772878 rollbacklog:2879 if (logmoved && rename(git_path("logs/%s", newrefname), git_path("logs/%s", oldrefname)))2880 error("unable to restore logfile %s from %s: %s",2881 oldrefname, newrefname, strerror(errno));2882 if (!logmoved && log &&2883 rename(git_path(TMP_RENAMED_LOG), git_path("logs/%s", oldrefname)))2884 error("unable to restore logfile %s from "TMP_RENAMED_LOG": %s",2885 oldrefname, strerror(errno));28862887 return 1;2888}28892890static int close_ref(struct ref_lock *lock)2891{2892 if (close_lock_file(lock->lk))2893 return -1;2894 lock->lock_fd = -1;2895 return 0;2896}28972898static int commit_ref(struct ref_lock *lock)2899{2900 if (commit_lock_file(lock->lk))2901 return -1;2902 lock->lock_fd = -1;2903 return 0;2904}29052906/*2907 * copy the reflog message msg to buf, which has been allocated sufficiently2908 * large, while cleaning up the whitespaces. Especially, convert LF to space,2909 * because reflog file is one line per entry.2910 */2911static int copy_msg(char *buf, const char *msg)2912{2913 char *cp = buf;2914 char c;2915 int wasspace = 1;29162917 *cp++ = '\t';2918 while ((c = *msg++)) {2919 if (wasspace && isspace(c))2920 continue;2921 wasspace = isspace(c);2922 if (wasspace)2923 c = ' ';2924 *cp++ = c;2925 }2926 while (buf < cp && isspace(cp[-1]))2927 cp--;2928 *cp++ = '\n';2929 return cp - buf;2930}29312932/* This function must set a meaningful errno on failure */2933int log_ref_setup(const char *refname, char *logfile, int bufsize)2934{2935 int logfd, oflags = O_APPEND | O_WRONLY;29362937 git_snpath(logfile, bufsize, "logs/%s", refname);2938 if (log_all_ref_updates &&2939 (starts_with(refname, "refs/heads/") ||2940 starts_with(refname, "refs/remotes/") ||2941 starts_with(refname, "refs/notes/") ||2942 !strcmp(refname, "HEAD"))) {2943 if (safe_create_leading_directories(logfile) < 0) {2944 int save_errno = errno;2945 error("unable to create directory for %s", logfile);2946 errno = save_errno;2947 return -1;2948 }2949 oflags |= O_CREAT;2950 }29512952 logfd = open(logfile, oflags, 0666);2953 if (logfd < 0) {2954 if (!(oflags & O_CREAT) && (errno == ENOENT || errno == EISDIR))2955 return 0;29562957 if (errno == EISDIR) {2958 if (remove_empty_directories(logfile)) {2959 int save_errno = errno;2960 error("There are still logs under '%s'",2961 logfile);2962 errno = save_errno;2963 return -1;2964 }2965 logfd = open(logfile, oflags, 0666);2966 }29672968 if (logfd < 0) {2969 int save_errno = errno;2970 error("Unable to append to %s: %s", logfile,2971 strerror(errno));2972 errno = save_errno;2973 return -1;2974 }2975 }29762977 adjust_shared_perm(logfile);2978 close(logfd);2979 return 0;2980}29812982static int log_ref_write_fd(int fd, const unsigned char *old_sha1,2983 const unsigned char *new_sha1,2984 const char *committer, const char *msg)2985{2986 int msglen, written;2987 unsigned maxlen, len;2988 char *logrec;29892990 msglen = msg ? strlen(msg) : 0;2991 maxlen = strlen(committer) + msglen + 100;2992 logrec = xmalloc(maxlen);2993 len = sprintf(logrec, "%s %s %s\n",2994 sha1_to_hex(old_sha1),2995 sha1_to_hex(new_sha1),2996 committer);2997 if (msglen)2998 len += copy_msg(logrec + len - 1, msg) - 1;29993000 written = len <= maxlen ? write_in_full(fd, logrec, len) : -1;3001 free(logrec);3002 if (written != len)3003 return -1;30043005 return 0;3006}30073008static int log_ref_write(const char *refname, const unsigned char *old_sha1,3009 const unsigned char *new_sha1, const char *msg)3010{3011 int logfd, result, oflags = O_APPEND | O_WRONLY;3012 char log_file[PATH_MAX];30133014 if (log_all_ref_updates < 0)3015 log_all_ref_updates = !is_bare_repository();30163017 result = log_ref_setup(refname, log_file, sizeof(log_file));3018 if (result)3019 return result;30203021 logfd = open(log_file, oflags);3022 if (logfd < 0)3023 return 0;3024 result = log_ref_write_fd(logfd, old_sha1, new_sha1,3025 git_committer_info(0), msg);3026 if (result) {3027 int save_errno = errno;3028 close(logfd);3029 error("Unable to append to %s", log_file);3030 errno = save_errno;3031 return -1;3032 }3033 if (close(logfd)) {3034 int save_errno = errno;3035 error("Unable to append to %s", log_file);3036 errno = save_errno;3037 return -1;3038 }3039 return 0;3040}30413042int is_branch(const char *refname)3043{3044 return !strcmp(refname, "HEAD") || starts_with(refname, "refs/heads/");3045}30463047/*3048 * Write sha1 into the ref specified by the lock. Make sure that errno3049 * is sane on error.3050 */3051static int write_ref_sha1(struct ref_lock *lock,3052 const unsigned char *sha1, const char *logmsg)3053{3054 static char term = '\n';3055 struct object *o;30563057 o = parse_object(sha1);3058 if (!o) {3059 error("Trying to write ref %s with nonexistent object %s",3060 lock->ref_name, sha1_to_hex(sha1));3061 unlock_ref(lock);3062 errno = EINVAL;3063 return -1;3064 }3065 if (o->type != OBJ_COMMIT && is_branch(lock->ref_name)) {3066 error("Trying to write non-commit object %s to branch %s",3067 sha1_to_hex(sha1), lock->ref_name);3068 unlock_ref(lock);3069 errno = EINVAL;3070 return -1;3071 }3072 if (write_in_full(lock->lock_fd, sha1_to_hex(sha1), 40) != 40 ||3073 write_in_full(lock->lock_fd, &term, 1) != 1 ||3074 close_ref(lock) < 0) {3075 int save_errno = errno;3076 error("Couldn't write %s", lock->lk->filename.buf);3077 unlock_ref(lock);3078 errno = save_errno;3079 return -1;3080 }3081 clear_loose_ref_cache(&ref_cache);3082 if (log_ref_write(lock->ref_name, lock->old_sha1, sha1, logmsg) < 0 ||3083 (strcmp(lock->ref_name, lock->orig_ref_name) &&3084 log_ref_write(lock->orig_ref_name, lock->old_sha1, sha1, logmsg) < 0)) {3085 unlock_ref(lock);3086 return -1;3087 }3088 if (strcmp(lock->orig_ref_name, "HEAD") != 0) {3089 /*3090 * Special hack: If a branch is updated directly and HEAD3091 * points to it (may happen on the remote side of a push3092 * for example) then logically the HEAD reflog should be3093 * updated too.3094 * A generic solution implies reverse symref information,3095 * but finding all symrefs pointing to the given branch3096 * would be rather costly for this rare event (the direct3097 * update of a branch) to be worth it. So let's cheat and3098 * check with HEAD only which should cover 99% of all usage3099 * scenarios (even 100% of the default ones).3100 */3101 unsigned char head_sha1[20];3102 int head_flag;3103 const char *head_ref;3104 head_ref = resolve_ref_unsafe("HEAD", RESOLVE_REF_READING,3105 head_sha1, &head_flag);3106 if (head_ref && (head_flag & REF_ISSYMREF) &&3107 !strcmp(head_ref, lock->ref_name))3108 log_ref_write("HEAD", lock->old_sha1, sha1, logmsg);3109 }3110 if (commit_ref(lock)) {3111 error("Couldn't set %s", lock->ref_name);3112 unlock_ref(lock);3113 return -1;3114 }3115 unlock_ref(lock);3116 return 0;3117}31183119int create_symref(const char *ref_target, const char *refs_heads_master,3120 const char *logmsg)3121{3122 const char *lockpath;3123 char ref[1000];3124 int fd, len, written;3125 char *git_HEAD = git_pathdup("%s", ref_target);3126 unsigned char old_sha1[20], new_sha1[20];31273128 if (logmsg && read_ref(ref_target, old_sha1))3129 hashclr(old_sha1);31303131 if (safe_create_leading_directories(git_HEAD) < 0)3132 return error("unable to create directory for %s", git_HEAD);31333134#ifndef NO_SYMLINK_HEAD3135 if (prefer_symlink_refs) {3136 unlink(git_HEAD);3137 if (!symlink(refs_heads_master, git_HEAD))3138 goto done;3139 fprintf(stderr, "no symlink - falling back to symbolic ref\n");3140 }3141#endif31423143 len = snprintf(ref, sizeof(ref), "ref: %s\n", refs_heads_master);3144 if (sizeof(ref) <= len) {3145 error("refname too long: %s", refs_heads_master);3146 goto error_free_return;3147 }3148 lockpath = mkpath("%s.lock", git_HEAD);3149 fd = open(lockpath, O_CREAT | O_EXCL | O_WRONLY, 0666);3150 if (fd < 0) {3151 error("Unable to open %s for writing", lockpath);3152 goto error_free_return;3153 }3154 written = write_in_full(fd, ref, len);3155 if (close(fd) != 0 || written != len) {3156 error("Unable to write to %s", lockpath);3157 goto error_unlink_return;3158 }3159 if (rename(lockpath, git_HEAD) < 0) {3160 error("Unable to create %s", git_HEAD);3161 goto error_unlink_return;3162 }3163 if (adjust_shared_perm(git_HEAD)) {3164 error("Unable to fix permissions on %s", lockpath);3165 error_unlink_return:3166 unlink_or_warn(lockpath);3167 error_free_return:3168 free(git_HEAD);3169 return -1;3170 }31713172#ifndef NO_SYMLINK_HEAD3173 done:3174#endif3175 if (logmsg && !read_ref(refs_heads_master, new_sha1))3176 log_ref_write(ref_target, old_sha1, new_sha1, logmsg);31773178 free(git_HEAD);3179 return 0;3180}31813182struct read_ref_at_cb {3183 const char *refname;3184 unsigned long at_time;3185 int cnt;3186 int reccnt;3187 unsigned char *sha1;3188 int found_it;31893190 unsigned char osha1[20];3191 unsigned char nsha1[20];3192 int tz;3193 unsigned long date;3194 char **msg;3195 unsigned long *cutoff_time;3196 int *cutoff_tz;3197 int *cutoff_cnt;3198};31993200static int read_ref_at_ent(unsigned char *osha1, unsigned char *nsha1,3201 const char *email, unsigned long timestamp, int tz,3202 const char *message, void *cb_data)3203{3204 struct read_ref_at_cb *cb = cb_data;32053206 cb->reccnt++;3207 cb->tz = tz;3208 cb->date = timestamp;32093210 if (timestamp <= cb->at_time || cb->cnt == 0) {3211 if (cb->msg)3212 *cb->msg = xstrdup(message);3213 if (cb->cutoff_time)3214 *cb->cutoff_time = timestamp;3215 if (cb->cutoff_tz)3216 *cb->cutoff_tz = tz;3217 if (cb->cutoff_cnt)3218 *cb->cutoff_cnt = cb->reccnt - 1;3219 /*3220 * we have not yet updated cb->[n|o]sha1 so they still3221 * hold the values for the previous record.3222 */3223 if (!is_null_sha1(cb->osha1)) {3224 hashcpy(cb->sha1, nsha1);3225 if (hashcmp(cb->osha1, nsha1))3226 warning("Log for ref %s has gap after %s.",3227 cb->refname, show_date(cb->date, cb->tz, DATE_RFC2822));3228 }3229 else if (cb->date == cb->at_time)3230 hashcpy(cb->sha1, nsha1);3231 else if (hashcmp(nsha1, cb->sha1))3232 warning("Log for ref %s unexpectedly ended on %s.",3233 cb->refname, show_date(cb->date, cb->tz,3234 DATE_RFC2822));3235 hashcpy(cb->osha1, osha1);3236 hashcpy(cb->nsha1, nsha1);3237 cb->found_it = 1;3238 return 1;3239 }3240 hashcpy(cb->osha1, osha1);3241 hashcpy(cb->nsha1, nsha1);3242 if (cb->cnt > 0)3243 cb->cnt--;3244 return 0;3245}32463247static int read_ref_at_ent_oldest(unsigned char *osha1, unsigned char *nsha1,3248 const char *email, unsigned long timestamp,3249 int tz, const char *message, void *cb_data)3250{3251 struct read_ref_at_cb *cb = cb_data;32523253 if (cb->msg)3254 *cb->msg = xstrdup(message);3255 if (cb->cutoff_time)3256 *cb->cutoff_time = timestamp;3257 if (cb->cutoff_tz)3258 *cb->cutoff_tz = tz;3259 if (cb->cutoff_cnt)3260 *cb->cutoff_cnt = cb->reccnt;3261 hashcpy(cb->sha1, osha1);3262 if (is_null_sha1(cb->sha1))3263 hashcpy(cb->sha1, nsha1);3264 /* We just want the first entry */3265 return 1;3266}32673268int read_ref_at(const char *refname, unsigned int flags, unsigned long at_time, int cnt,3269 unsigned char *sha1, char **msg,3270 unsigned long *cutoff_time, int *cutoff_tz, int *cutoff_cnt)3271{3272 struct read_ref_at_cb cb;32733274 memset(&cb, 0, sizeof(cb));3275 cb.refname = refname;3276 cb.at_time = at_time;3277 cb.cnt = cnt;3278 cb.msg = msg;3279 cb.cutoff_time = cutoff_time;3280 cb.cutoff_tz = cutoff_tz;3281 cb.cutoff_cnt = cutoff_cnt;3282 cb.sha1 = sha1;32833284 for_each_reflog_ent_reverse(refname, read_ref_at_ent, &cb);32853286 if (!cb.reccnt) {3287 if (flags & GET_SHA1_QUIETLY)3288 exit(128);3289 else3290 die("Log for %s is empty.", refname);3291 }3292 if (cb.found_it)3293 return 0;32943295 for_each_reflog_ent(refname, read_ref_at_ent_oldest, &cb);32963297 return 1;3298}32993300int reflog_exists(const char *refname)3301{3302 struct stat st;33033304 return !lstat(git_path("logs/%s", refname), &st) &&3305 S_ISREG(st.st_mode);3306}33073308int delete_reflog(const char *refname)3309{3310 return remove_path(git_path("logs/%s", refname));3311}33123313static int show_one_reflog_ent(struct strbuf *sb, each_reflog_ent_fn fn, void *cb_data)3314{3315 unsigned char osha1[20], nsha1[20];3316 char *email_end, *message;3317 unsigned long timestamp;3318 int tz;33193320 /* old SP new SP name <email> SP time TAB msg LF */3321 if (sb->len < 83 || sb->buf[sb->len - 1] != '\n' ||3322 get_sha1_hex(sb->buf, osha1) || sb->buf[40] != ' ' ||3323 get_sha1_hex(sb->buf + 41, nsha1) || sb->buf[81] != ' ' ||3324 !(email_end = strchr(sb->buf + 82, '>')) ||3325 email_end[1] != ' ' ||3326 !(timestamp = strtoul(email_end + 2, &message, 10)) ||3327 !message || message[0] != ' ' ||3328 (message[1] != '+' && message[1] != '-') ||3329 !isdigit(message[2]) || !isdigit(message[3]) ||3330 !isdigit(message[4]) || !isdigit(message[5]))3331 return 0; /* corrupt? */3332 email_end[1] = '\0';3333 tz = strtol(message + 1, NULL, 10);3334 if (message[6] != '\t')3335 message += 6;3336 else3337 message += 7;3338 return fn(osha1, nsha1, sb->buf + 82, timestamp, tz, message, cb_data);3339}33403341static char *find_beginning_of_line(char *bob, char *scan)3342{3343 while (bob < scan && *(--scan) != '\n')3344 ; /* keep scanning backwards */3345 /*3346 * Return either beginning of the buffer, or LF at the end of3347 * the previous line.3348 */3349 return scan;3350}33513352int for_each_reflog_ent_reverse(const char *refname, each_reflog_ent_fn fn, void *cb_data)3353{3354 struct strbuf sb = STRBUF_INIT;3355 FILE *logfp;3356 long pos;3357 int ret = 0, at_tail = 1;33583359 logfp = fopen(git_path("logs/%s", refname), "r");3360 if (!logfp)3361 return -1;33623363 /* Jump to the end */3364 if (fseek(logfp, 0, SEEK_END) < 0)3365 return error("cannot seek back reflog for %s: %s",3366 refname, strerror(errno));3367 pos = ftell(logfp);3368 while (!ret && 0 < pos) {3369 int cnt;3370 size_t nread;3371 char buf[BUFSIZ];3372 char *endp, *scanp;33733374 /* Fill next block from the end */3375 cnt = (sizeof(buf) < pos) ? sizeof(buf) : pos;3376 if (fseek(logfp, pos - cnt, SEEK_SET))3377 return error("cannot seek back reflog for %s: %s",3378 refname, strerror(errno));3379 nread = fread(buf, cnt, 1, logfp);3380 if (nread != 1)3381 return error("cannot read %d bytes from reflog for %s: %s",3382 cnt, refname, strerror(errno));3383 pos -= cnt;33843385 scanp = endp = buf + cnt;3386 if (at_tail && scanp[-1] == '\n')3387 /* Looking at the final LF at the end of the file */3388 scanp--;3389 at_tail = 0;33903391 while (buf < scanp) {3392 /*3393 * terminating LF of the previous line, or the beginning3394 * of the buffer.3395 */3396 char *bp;33973398 bp = find_beginning_of_line(buf, scanp);33993400 if (*bp == '\n') {3401 /*3402 * The newline is the end of the previous line,3403 * so we know we have complete line starting3404 * at (bp + 1). Prefix it onto any prior data3405 * we collected for the line and process it.3406 */3407 strbuf_splice(&sb, 0, 0, bp + 1, endp - (bp + 1));3408 scanp = bp;3409 endp = bp + 1;3410 ret = show_one_reflog_ent(&sb, fn, cb_data);3411 strbuf_reset(&sb);3412 if (ret)3413 break;3414 } else if (!pos) {3415 /*3416 * We are at the start of the buffer, and the3417 * start of the file; there is no previous3418 * line, and we have everything for this one.3419 * Process it, and we can end the loop.3420 */3421 strbuf_splice(&sb, 0, 0, buf, endp - buf);3422 ret = show_one_reflog_ent(&sb, fn, cb_data);3423 strbuf_reset(&sb);3424 break;3425 }34263427 if (bp == buf) {3428 /*3429 * We are at the start of the buffer, and there3430 * is more file to read backwards. Which means3431 * we are in the middle of a line. Note that we3432 * may get here even if *bp was a newline; that3433 * just means we are at the exact end of the3434 * previous line, rather than some spot in the3435 * middle.3436 *3437 * Save away what we have to be combined with3438 * the data from the next read.3439 */3440 strbuf_splice(&sb, 0, 0, buf, endp - buf);3441 break;3442 }3443 }34443445 }3446 if (!ret && sb.len)3447 die("BUG: reverse reflog parser had leftover data");34483449 fclose(logfp);3450 strbuf_release(&sb);3451 return ret;3452}34533454int for_each_reflog_ent(const char *refname, each_reflog_ent_fn fn, void *cb_data)3455{3456 FILE *logfp;3457 struct strbuf sb = STRBUF_INIT;3458 int ret = 0;34593460 logfp = fopen(git_path("logs/%s", refname), "r");3461 if (!logfp)3462 return -1;34633464 while (!ret && !strbuf_getwholeline(&sb, logfp, '\n'))3465 ret = show_one_reflog_ent(&sb, fn, cb_data);3466 fclose(logfp);3467 strbuf_release(&sb);3468 return ret;3469}3470/*3471 * Call fn for each reflog in the namespace indicated by name. name3472 * must be empty or end with '/'. Name will be used as a scratch3473 * space, but its contents will be restored before return.3474 */3475static int do_for_each_reflog(struct strbuf *name, each_ref_fn fn, void *cb_data)3476{3477 DIR *d = opendir(git_path("logs/%s", name->buf));3478 int retval = 0;3479 struct dirent *de;3480 int oldlen = name->len;34813482 if (!d)3483 return name->len ? errno : 0;34843485 while ((de = readdir(d)) != NULL) {3486 struct stat st;34873488 if (de->d_name[0] == '.')3489 continue;3490 if (ends_with(de->d_name, ".lock"))3491 continue;3492 strbuf_addstr(name, de->d_name);3493 if (stat(git_path("logs/%s", name->buf), &st) < 0) {3494 ; /* silently ignore */3495 } else {3496 if (S_ISDIR(st.st_mode)) {3497 strbuf_addch(name, '/');3498 retval = do_for_each_reflog(name, fn, cb_data);3499 } else {3500 unsigned char sha1[20];3501 if (read_ref_full(name->buf, 0, sha1, NULL))3502 retval = error("bad ref for %s", name->buf);3503 else3504 retval = fn(name->buf, sha1, 0, cb_data);3505 }3506 if (retval)3507 break;3508 }3509 strbuf_setlen(name, oldlen);3510 }3511 closedir(d);3512 return retval;3513}35143515int for_each_reflog(each_ref_fn fn, void *cb_data)3516{3517 int retval;3518 struct strbuf name;3519 strbuf_init(&name, PATH_MAX);3520 retval = do_for_each_reflog(&name, fn, cb_data);3521 strbuf_release(&name);3522 return retval;3523}35243525/**3526 * Information needed for a single ref update. Set new_sha1 to the new3527 * value or to null_sha1 to delete the ref. To check the old value3528 * while the ref is locked, set (flags & REF_HAVE_OLD) and set3529 * old_sha1 to the old value, or to null_sha1 to ensure the ref does3530 * not exist before update.3531 */3532struct ref_update {3533 /*3534 * If (flags & REF_HAVE_NEW), set the reference to this value:3535 */3536 unsigned char new_sha1[20];3537 /*3538 * If (flags & REF_HAVE_OLD), check that the reference3539 * previously had this value:3540 */3541 unsigned char old_sha1[20];3542 /*3543 * One or more of REF_HAVE_NEW, REF_HAVE_OLD, REF_NODEREF,3544 * REF_DELETING, and REF_ISPRUNING:3545 */3546 unsigned int flags;3547 struct ref_lock *lock;3548 int type;3549 char *msg;3550 const char refname[FLEX_ARRAY];3551};35523553/*3554 * Transaction states.3555 * OPEN: The transaction is in a valid state and can accept new updates.3556 * An OPEN transaction can be committed.3557 * CLOSED: A closed transaction is no longer active and no other operations3558 * than free can be used on it in this state.3559 * A transaction can either become closed by successfully committing3560 * an active transaction or if there is a failure while building3561 * the transaction thus rendering it failed/inactive.3562 */3563enum ref_transaction_state {3564 REF_TRANSACTION_OPEN = 0,3565 REF_TRANSACTION_CLOSED = 13566};35673568/*3569 * Data structure for holding a reference transaction, which can3570 * consist of checks and updates to multiple references, carried out3571 * as atomically as possible. This structure is opaque to callers.3572 */3573struct ref_transaction {3574 struct ref_update **updates;3575 size_t alloc;3576 size_t nr;3577 enum ref_transaction_state state;3578};35793580struct ref_transaction *ref_transaction_begin(struct strbuf *err)3581{3582 assert(err);35833584 return xcalloc(1, sizeof(struct ref_transaction));3585}35863587void ref_transaction_free(struct ref_transaction *transaction)3588{3589 int i;35903591 if (!transaction)3592 return;35933594 for (i = 0; i < transaction->nr; i++) {3595 free(transaction->updates[i]->msg);3596 free(transaction->updates[i]);3597 }3598 free(transaction->updates);3599 free(transaction);3600}36013602static struct ref_update *add_update(struct ref_transaction *transaction,3603 const char *refname)3604{3605 size_t len = strlen(refname);3606 struct ref_update *update = xcalloc(1, sizeof(*update) + len + 1);36073608 strcpy((char *)update->refname, refname);3609 ALLOC_GROW(transaction->updates, transaction->nr + 1, transaction->alloc);3610 transaction->updates[transaction->nr++] = update;3611 return update;3612}36133614int ref_transaction_update(struct ref_transaction *transaction,3615 const char *refname,3616 const unsigned char *new_sha1,3617 const unsigned char *old_sha1,3618 unsigned int flags, const char *msg,3619 struct strbuf *err)3620{3621 struct ref_update *update;36223623 assert(err);36243625 if (transaction->state != REF_TRANSACTION_OPEN)3626 die("BUG: update called for transaction that is not open");36273628 if (new_sha1 && !is_null_sha1(new_sha1) &&3629 check_refname_format(refname, REFNAME_ALLOW_ONELEVEL)) {3630 strbuf_addf(err, "refusing to update ref with bad name %s",3631 refname);3632 return -1;3633 }36343635 update = add_update(transaction, refname);3636 if (new_sha1) {3637 hashcpy(update->new_sha1, new_sha1);3638 flags |= REF_HAVE_NEW;3639 }3640 if (old_sha1) {3641 hashcpy(update->old_sha1, old_sha1);3642 flags |= REF_HAVE_OLD;3643 }3644 update->flags = flags;3645 if (msg)3646 update->msg = xstrdup(msg);3647 return 0;3648}36493650int ref_transaction_create(struct ref_transaction *transaction,3651 const char *refname,3652 const unsigned char *new_sha1,3653 unsigned int flags, const char *msg,3654 struct strbuf *err)3655{3656 if (!new_sha1 || is_null_sha1(new_sha1))3657 die("BUG: create called without valid new_sha1");3658 return ref_transaction_update(transaction, refname, new_sha1,3659 null_sha1, flags, msg, err);3660}36613662int ref_transaction_delete(struct ref_transaction *transaction,3663 const char *refname,3664 const unsigned char *old_sha1,3665 unsigned int flags, const char *msg,3666 struct strbuf *err)3667{3668 if (old_sha1 && is_null_sha1(old_sha1))3669 die("BUG: delete called with old_sha1 set to zeros");3670 return ref_transaction_update(transaction, refname,3671 null_sha1, old_sha1,3672 flags, msg, err);3673}36743675int ref_transaction_verify(struct ref_transaction *transaction,3676 const char *refname,3677 const unsigned char *old_sha1,3678 unsigned int flags,3679 struct strbuf *err)3680{3681 if (!old_sha1)3682 die("BUG: verify called with old_sha1 set to NULL");3683 return ref_transaction_update(transaction, refname,3684 NULL, old_sha1,3685 flags, NULL, err);3686}36873688int update_ref(const char *msg, const char *refname,3689 const unsigned char *new_sha1, const unsigned char *old_sha1,3690 unsigned int flags, enum action_on_err onerr)3691{3692 struct ref_transaction *t;3693 struct strbuf err = STRBUF_INIT;36943695 t = ref_transaction_begin(&err);3696 if (!t ||3697 ref_transaction_update(t, refname, new_sha1, old_sha1,3698 flags, msg, &err) ||3699 ref_transaction_commit(t, &err)) {3700 const char *str = "update_ref failed for ref '%s': %s";37013702 ref_transaction_free(t);3703 switch (onerr) {3704 case UPDATE_REFS_MSG_ON_ERR:3705 error(str, refname, err.buf);3706 break;3707 case UPDATE_REFS_DIE_ON_ERR:3708 die(str, refname, err.buf);3709 break;3710 case UPDATE_REFS_QUIET_ON_ERR:3711 break;3712 }3713 strbuf_release(&err);3714 return 1;3715 }3716 strbuf_release(&err);3717 ref_transaction_free(t);3718 return 0;3719}37203721static int ref_update_compare(const void *r1, const void *r2)3722{3723 const struct ref_update * const *u1 = r1;3724 const struct ref_update * const *u2 = r2;3725 return strcmp((*u1)->refname, (*u2)->refname);3726}37273728static int ref_update_reject_duplicates(struct ref_update **updates, int n,3729 struct strbuf *err)3730{3731 int i;37323733 assert(err);37343735 for (i = 1; i < n; i++)3736 if (!strcmp(updates[i - 1]->refname, updates[i]->refname)) {3737 strbuf_addf(err,3738 "Multiple updates for ref '%s' not allowed.",3739 updates[i]->refname);3740 return 1;3741 }3742 return 0;3743}37443745int ref_transaction_commit(struct ref_transaction *transaction,3746 struct strbuf *err)3747{3748 int ret = 0, i;3749 int n = transaction->nr;3750 struct ref_update **updates = transaction->updates;3751 struct string_list refs_to_delete = STRING_LIST_INIT_NODUP;3752 struct string_list_item *ref_to_delete;37533754 assert(err);37553756 if (transaction->state != REF_TRANSACTION_OPEN)3757 die("BUG: commit called for transaction that is not open");37583759 if (!n) {3760 transaction->state = REF_TRANSACTION_CLOSED;3761 return 0;3762 }37633764 /* Copy, sort, and reject duplicate refs */3765 qsort(updates, n, sizeof(*updates), ref_update_compare);3766 if (ref_update_reject_duplicates(updates, n, err)) {3767 ret = TRANSACTION_GENERIC_ERROR;3768 goto cleanup;3769 }37703771 /* Acquire all locks while verifying old values */3772 for (i = 0; i < n; i++) {3773 struct ref_update *update = updates[i];3774 unsigned int flags = update->flags;37753776 if ((flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1))3777 flags |= REF_DELETING;3778 update->lock = lock_ref_sha1_basic(3779 update->refname,3780 ((update->flags & REF_HAVE_OLD) ?3781 update->old_sha1 : NULL),3782 NULL,3783 flags,3784 &update->type);3785 if (!update->lock) {3786 ret = (errno == ENOTDIR)3787 ? TRANSACTION_NAME_CONFLICT3788 : TRANSACTION_GENERIC_ERROR;3789 strbuf_addf(err, "Cannot lock the ref '%s'.",3790 update->refname);3791 goto cleanup;3792 }3793 }37943795 /* Perform updates first so live commits remain referenced */3796 for (i = 0; i < n; i++) {3797 struct ref_update *update = updates[i];3798 int flags = update->flags;37993800 if ((flags & REF_HAVE_NEW) && !is_null_sha1(update->new_sha1)) {3801 int overwriting_symref = ((update->type & REF_ISSYMREF) &&3802 (update->flags & REF_NODEREF));38033804 if (!overwriting_symref3805 && !hashcmp(update->lock->old_sha1, update->new_sha1)) {3806 /*3807 * The reference already has the desired3808 * value, so we don't need to write it.3809 */3810 unlock_ref(update->lock);3811 update->lock = NULL;3812 } else if (write_ref_sha1(update->lock, update->new_sha1,3813 update->msg)) {3814 update->lock = NULL; /* freed by write_ref_sha1 */3815 strbuf_addf(err, "Cannot update the ref '%s'.",3816 update->refname);3817 ret = TRANSACTION_GENERIC_ERROR;3818 goto cleanup;3819 } else {3820 /* freed by write_ref_sha1(): */3821 update->lock = NULL;3822 }3823 }3824 }38253826 /* Perform deletes now that updates are safely completed */3827 for (i = 0; i < n; i++) {3828 struct ref_update *update = updates[i];3829 int flags = update->flags;38303831 if ((flags & REF_HAVE_NEW) && is_null_sha1(update->new_sha1)) {3832 if (delete_ref_loose(update->lock, update->type, err)) {3833 ret = TRANSACTION_GENERIC_ERROR;3834 goto cleanup;3835 }38363837 if (!(flags & REF_ISPRUNING))3838 string_list_append(&refs_to_delete,3839 update->lock->ref_name);3840 }3841 }38423843 if (repack_without_refs(&refs_to_delete, err)) {3844 ret = TRANSACTION_GENERIC_ERROR;3845 goto cleanup;3846 }3847 for_each_string_list_item(ref_to_delete, &refs_to_delete)3848 unlink_or_warn(git_path("logs/%s", ref_to_delete->string));3849 clear_loose_ref_cache(&ref_cache);38503851cleanup:3852 transaction->state = REF_TRANSACTION_CLOSED;38533854 for (i = 0; i < n; i++)3855 if (updates[i]->lock)3856 unlock_ref(updates[i]->lock);3857 string_list_clear(&refs_to_delete, 0);3858 return ret;3859}38603861char *shorten_unambiguous_ref(const char *refname, int strict)3862{3863 int i;3864 static char **scanf_fmts;3865 static int nr_rules;3866 char *short_name;38673868 if (!nr_rules) {3869 /*3870 * Pre-generate scanf formats from ref_rev_parse_rules[].3871 * Generate a format suitable for scanf from a3872 * ref_rev_parse_rules rule by interpolating "%s" at the3873 * location of the "%.*s".3874 */3875 size_t total_len = 0;3876 size_t offset = 0;38773878 /* the rule list is NULL terminated, count them first */3879 for (nr_rules = 0; ref_rev_parse_rules[nr_rules]; nr_rules++)3880 /* -2 for strlen("%.*s") - strlen("%s"); +1 for NUL */3881 total_len += strlen(ref_rev_parse_rules[nr_rules]) - 2 + 1;38823883 scanf_fmts = xmalloc(nr_rules * sizeof(char *) + total_len);38843885 offset = 0;3886 for (i = 0; i < nr_rules; i++) {3887 assert(offset < total_len);3888 scanf_fmts[i] = (char *)&scanf_fmts[nr_rules] + offset;3889 offset += snprintf(scanf_fmts[i], total_len - offset,3890 ref_rev_parse_rules[i], 2, "%s") + 1;3891 }3892 }38933894 /* bail out if there are no rules */3895 if (!nr_rules)3896 return xstrdup(refname);38973898 /* buffer for scanf result, at most refname must fit */3899 short_name = xstrdup(refname);39003901 /* skip first rule, it will always match */3902 for (i = nr_rules - 1; i > 0 ; --i) {3903 int j;3904 int rules_to_fail = i;3905 int short_name_len;39063907 if (1 != sscanf(refname, scanf_fmts[i], short_name))3908 continue;39093910 short_name_len = strlen(short_name);39113912 /*3913 * in strict mode, all (except the matched one) rules3914 * must fail to resolve to a valid non-ambiguous ref3915 */3916 if (strict)3917 rules_to_fail = nr_rules;39183919 /*3920 * check if the short name resolves to a valid ref,3921 * but use only rules prior to the matched one3922 */3923 for (j = 0; j < rules_to_fail; j++) {3924 const char *rule = ref_rev_parse_rules[j];3925 char refname[PATH_MAX];39263927 /* skip matched rule */3928 if (i == j)3929 continue;39303931 /*3932 * the short name is ambiguous, if it resolves3933 * (with this previous rule) to a valid ref3934 * read_ref() returns 0 on success3935 */3936 mksnpath(refname, sizeof(refname),3937 rule, short_name_len, short_name);3938 if (ref_exists(refname))3939 break;3940 }39413942 /*3943 * short name is non-ambiguous if all previous rules3944 * haven't resolved to a valid ref3945 */3946 if (j == rules_to_fail)3947 return short_name;3948 }39493950 free(short_name);3951 return xstrdup(refname);3952}39533954static struct string_list *hide_refs;39553956int parse_hide_refs_config(const char *var, const char *value, const char *section)3957{3958 if (!strcmp("transfer.hiderefs", var) ||3959 /* NEEDSWORK: use parse_config_key() once both are merged */3960 (starts_with(var, section) && var[strlen(section)] == '.' &&3961 !strcmp(var + strlen(section), ".hiderefs"))) {3962 char *ref;3963 int len;39643965 if (!value)3966 return config_error_nonbool(var);3967 ref = xstrdup(value);3968 len = strlen(ref);3969 while (len && ref[len - 1] == '/')3970 ref[--len] = '\0';3971 if (!hide_refs) {3972 hide_refs = xcalloc(1, sizeof(*hide_refs));3973 hide_refs->strdup_strings = 1;3974 }3975 string_list_append(hide_refs, ref);3976 }3977 return 0;3978}39793980int ref_is_hidden(const char *refname)3981{3982 struct string_list_item *item;39833984 if (!hide_refs)3985 return 0;3986 for_each_string_list_item(item, hide_refs) {3987 int len;3988 if (!starts_with(refname, item->string))3989 continue;3990 len = strlen(item->string);3991 if (!refname[len] || refname[len] == '/')3992 return 1;3993 }3994 return 0;3995}39963997struct expire_reflog_cb {3998 unsigned int flags;3999 reflog_expiry_should_prune_fn *should_prune_fn;4000 void *policy_cb;4001 FILE *newlog;4002 unsigned char last_kept_sha1[20];4003};40044005static int expire_reflog_ent(unsigned char *osha1, unsigned char *nsha1,4006 const char *email, unsigned long timestamp, int tz,4007 const char *message, void *cb_data)4008{4009 struct expire_reflog_cb *cb = cb_data;4010 struct expire_reflog_policy_cb *policy_cb = cb->policy_cb;40114012 if (cb->flags & EXPIRE_REFLOGS_REWRITE)4013 osha1 = cb->last_kept_sha1;40144015 if ((*cb->should_prune_fn)(osha1, nsha1, email, timestamp, tz,4016 message, policy_cb)) {4017 if (!cb->newlog)4018 printf("would prune %s", message);4019 else if (cb->flags & EXPIRE_REFLOGS_VERBOSE)4020 printf("prune %s", message);4021 } else {4022 if (cb->newlog) {4023 fprintf(cb->newlog, "%s %s %s %lu %+05d\t%s",4024 sha1_to_hex(osha1), sha1_to_hex(nsha1),4025 email, timestamp, tz, message);4026 hashcpy(cb->last_kept_sha1, nsha1);4027 }4028 if (cb->flags & EXPIRE_REFLOGS_VERBOSE)4029 printf("keep %s", message);4030 }4031 return 0;4032}40334034int reflog_expire(const char *refname, const unsigned char *sha1,4035 unsigned int flags,4036 reflog_expiry_prepare_fn prepare_fn,4037 reflog_expiry_should_prune_fn should_prune_fn,4038 reflog_expiry_cleanup_fn cleanup_fn,4039 void *policy_cb_data)4040{4041 static struct lock_file reflog_lock;4042 struct expire_reflog_cb cb;4043 struct ref_lock *lock;4044 char *log_file;4045 int status = 0;4046 int type;40474048 memset(&cb, 0, sizeof(cb));4049 cb.flags = flags;4050 cb.policy_cb = policy_cb_data;4051 cb.should_prune_fn = should_prune_fn;40524053 /*4054 * The reflog file is locked by holding the lock on the4055 * reference itself, plus we might need to update the4056 * reference if --updateref was specified:4057 */4058 lock = lock_ref_sha1_basic(refname, sha1, NULL, 0, &type);4059 if (!lock)4060 return error("cannot lock ref '%s'", refname);4061 if (!reflog_exists(refname)) {4062 unlock_ref(lock);4063 return 0;4064 }40654066 log_file = git_pathdup("logs/%s", refname);4067 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4068 /*4069 * Even though holding $GIT_DIR/logs/$reflog.lock has4070 * no locking implications, we use the lock_file4071 * machinery here anyway because it does a lot of the4072 * work we need, including cleaning up if the program4073 * exits unexpectedly.4074 */4075 if (hold_lock_file_for_update(&reflog_lock, log_file, 0) < 0) {4076 struct strbuf err = STRBUF_INIT;4077 unable_to_lock_message(log_file, errno, &err);4078 error("%s", err.buf);4079 strbuf_release(&err);4080 goto failure;4081 }4082 cb.newlog = fdopen_lock_file(&reflog_lock, "w");4083 if (!cb.newlog) {4084 error("cannot fdopen %s (%s)",4085 reflog_lock.filename.buf, strerror(errno));4086 goto failure;4087 }4088 }40894090 (*prepare_fn)(refname, sha1, cb.policy_cb);4091 for_each_reflog_ent(refname, expire_reflog_ent, &cb);4092 (*cleanup_fn)(cb.policy_cb);40934094 if (!(flags & EXPIRE_REFLOGS_DRY_RUN)) {4095 /*4096 * It doesn't make sense to adjust a reference pointed4097 * to by a symbolic ref based on expiring entries in4098 * the symbolic reference's reflog. Nor can we update4099 * a reference if there are no remaining reflog4100 * entries.4101 */4102 int update = (flags & EXPIRE_REFLOGS_UPDATE_REF) &&4103 !(type & REF_ISSYMREF) &&4104 !is_null_sha1(cb.last_kept_sha1);41054106 if (close_lock_file(&reflog_lock)) {4107 status |= error("couldn't write %s: %s", log_file,4108 strerror(errno));4109 } else if (update &&4110 (write_in_full(lock->lock_fd,4111 sha1_to_hex(cb.last_kept_sha1), 40) != 40 ||4112 write_str_in_full(lock->lock_fd, "\n") != 1 ||4113 close_ref(lock) < 0)) {4114 status |= error("couldn't write %s",4115 lock->lk->filename.buf);4116 rollback_lock_file(&reflog_lock);4117 } else if (commit_lock_file(&reflog_lock)) {4118 status |= error("unable to commit reflog '%s' (%s)",4119 log_file, strerror(errno));4120 } else if (update && commit_ref(lock)) {4121 status |= error("couldn't set %s", lock->ref_name);4122 }4123 }4124 free(log_file);4125 unlock_ref(lock);4126 return status;41274128 failure:4129 rollback_lock_file(&reflog_lock);4130 free(log_file);4131 unlock_ref(lock);4132 return -1;4133}